Search results for: one side class algorithm

Authors: Doru Anastasiu Popescu, Dan Rădulescu

Abstract:

In this paper, we determine the similarity of two HTML web applications. We are going to use a genetic algorithm in order to determine the most significant web pages of each application (we are not going to use every web page of a site). Using these significant web pages, we will find the similarity value between the two applications. The algorithm is going to be efficient because we are going to use a reduced number of web pages for comparisons but it will return an approximate value of the similarity. The binary trees are used to keep the tags from the significant pages. The algorithm was implemented in Java language.

Keywords: Tag, HTML, web page, genetic algorithm, similarity value, binary tree

Procedia PDF Downloads 330

Authors: Engy Adel Mohamed, Yasser Gamal-Eldin Hegazy

Abstract:

This paper presents a firefly based algorithm for optimal sizing and allocation of distributed generators for profit maximization. Distributed generators in the proposed algorithm are of photovoltaic and combined heat and power technologies. Combined heat and power distributed generators are modeled as voltage controlled nodes while photovoltaic distributed generators are modeled as constant power nodes. The proposed algorithm is implemented in MATLAB environment and tested the unbalanced IEEE 37-node feeder. The results show the effectiveness of the proposed algorithm in optimal selection of distributed generators size and site in order to maximize the total system profit.

Keywords: distributed generators, firefly algorithm, IEEE 37-node feeder, profit maximization

Procedia PDF Downloads 409

Authors: Ghodhbani Salah, Jemili Farah

Abstract:

With the growth of cyber attacks, information safety has become an important issue all over the world. Many firms rely on security technologies such as intrusion detection systems (IDSs) to manage information technology security risks. IDSs are considered to be the last line of defense to secure a network and play a very important role in detecting large number of attacks. However the main problem with today’s most popular commercial IDSs is generating high volume of alerts and huge number of false positives. This drawback has become the main motivation for many research papers in IDS area. Hence, in this paper we present a data mining technique to assist network administrators to analyze and reduce false positive alarms that are produced by an IDS and increase detection accuracy. Our data mining technique is unsupervised clustering method based on hybrid ANT algorithm. This algorithm discovers clusters of intruders’ behavior without prior knowledge of a possible number of classes, then we apply K-means algorithm to improve the convergence of the ANT clustering. Experimental results on real dataset show that our proposed approach is efficient with high detection rate and low false alarm rate.

Keywords: intrusion detection system, alarm filtering, ANT class, ant clustering, intruders’ behaviors, false alarms

Procedia PDF Downloads 379

Authors: Selcuk Aslan, Dervis Karaboga, Celal Ozturk

Abstract:

Artificial Bee Colony (ABC) algorithm is one of the most successful swarm intelligence based metaheuristics. It has been applied to a number of constrained or unconstrained numerical and combinatorial optimization problems. In this paper, we presented a parallelized version of ABC algorithm by adapting employed and onlooker bee phases to the Compute Unified Device Architecture (CUDA) platform which is a graphical processing unit (GPU) programming environment by NVIDIA. The execution speed and obtained results of the proposed approach and sequential version of ABC algorithm are compared on functions that are typically used as benchmarks for optimization algorithms. Tests on standard benchmark functions with different colony size and number of parameters showed that proposed parallelization approach for ABC algorithm decreases the execution time consumed by the employed and onlooker bee phases in total and achieved similar or better quality of the results compared to the standard sequential implementation of the ABC algorithm.

Keywords: Artificial Bee Colony algorithm, GPU computing, swarm intelligence, parallelization

Procedia PDF Downloads 343

Authors: Qiang Zhang, Chun Yuan

Abstract:

Since the PU (Prediction Unit) decision process is the most time consuming part of the emerging HEVC (High Efficient Video Coding) standardin intra and inter frame coding, this paper proposes the fast PU decision algorithm and speed up the algorithm using CUDA (Compute Unified Device Architecture). In intra frame coding, the fast PU decision algorithm uses the texture features to skip intra-frame prediction or terminal the intra-frame prediction for smaller PU size. In inter frame coding of HEVC, the fast PU decision algorithm takes use of the similarity of its own two Nx2N size PU's motion vectors and the hierarchical structure of CU (Coding Unit) partition to skip some modes of PU partition, so as to reduce the motion estimation times. The accelerate algorithm using CUDA is based on the fast PU decision algorithm which uses the GPU to make the motion search and the gradient computation could be parallel computed. The proposed algorithm achieves up to 57% time saving compared to the HM 10.0 with little rate-distortion losses (0.043dB drop and 1.82% bitrate increase on average).

Keywords: HEVC, PU decision, inter prediction, intra prediction, CUDA, parallel

Procedia PDF Downloads 370

Authors: Mengjun Yang, Zhulin Zong, Jie Gao

Abstract:

In this paper, a new and robust algorithm is proposed to achieve high resolution for inverse synthetic aperture radar (ISAR) imaging in the compressive sensing (CS) framework. Traditional CS based methods have to assume that unknown scatters exactly lie on the pre-divided grids; otherwise, their reconstruction performance dropped significantly. In this processing algorithm, several basis shifts are utilized to achieve the same effect as grid refinement does. The detailed implementation of the basis shift algorithm is presented in this paper. From the simulation we can see that using the basis shift algorithm, imaging precision can be improved. The effectiveness and feasibility of the proposed method are investigated by the simulation results.

Keywords: ISAR imaging, sparse reconstruction, off-grid, basis shift

Procedia PDF Downloads 238

Authors: Anum Ali, Kashaf ad Dooja, Asif Saleem

Abstract:

The future smart cities trend will be towards Internet of Things (IoT); IoT creates dynamic connections in a ubiquitous manner. Smart cities offer ease and flexibility for daily life matters. By using small devices that are connected to cloud servers based on IoT, network traffic between these devices is growing exponentially, whose security is a concerned issue, since ratio of cyber attack may make the network traffic vulnerable. This paper discusses the latest machine learning approaches in related work further to tackle the increasing rate of cyber attacks, machine learning algorithm is applied to IoT-based network traffic data. The proposed algorithm train itself on data and identify different sections of devices interaction by using supervised learning which is considered as a classifier related to a specific IoT device class. The simulation results clearly identify the attacks and produce fewer false detections.

Keywords: IoT, traffic security, deep learning, classification

Procedia PDF Downloads 123

Authors: Abdullah M. Almeshal, Mohammad R. Alenezi, Muhammad Moaz

Abstract:

In this paper, we discuss the performance of applying hybrid spiral dynamic bacterial chemotaxis (HSDBC) optimisation algorithm on an intelligent controller for a differential drive robot. A unicycle class of differential drive robot is utilised to serve as a basis application to evaluate the performance of the HSDBC algorithm. A hybrid fuzzy logic controller is developed and implemented for the unicycle robot to follow a predefined trajectory. Trajectories of various frictional profiles and levels were simulated to evaluate the performance of the robot at different operating conditions. Controller gains and scaling factors were optimised using HSDBC and the performance is evaluated in comparison to previously adopted optimisation algorithms. The HSDBC has proven its feasibility in achieving a faster convergence toward the optimal gains and resulted in a superior performance.

Keywords: differential drive robot, hybrid fuzzy controller, optimization, path tracking, unicycle robot

Procedia PDF Downloads 437

Authors: Mohammadhosein Hasanbeig, Lacra Pavel

Abstract:

In this paper, we study a distributed control algorithm for the problem of unknown area coverage by a network of robots. The coverage objective is to locate a set of targets in the area and to minimize the robots’ energy consumption. The robots have no prior knowledge about the location and also about the number of the targets in the area. One efficient approach that can be used to relax the robots’ lack of knowledge is to incorporate an auxiliary learning algorithm into the control scheme. A learning algorithm actually allows the robots to explore and study the unknown environment and to eventually overcome their lack of knowledge. The control algorithm itself is modeled based on game theory where the network of the robots use their collective information to play a non-cooperative potential game. The algorithm is tested via simulations to verify its performance and adaptability.

Keywords: distributed control, game theory, multi-agent learning, reinforcement learning

Procedia PDF Downloads 427

Authors: Mahmoud M. Othman, Y. G. Hegazy, A. Y. Abdelaziz

Abstract:

This paper proposes a novel heuristic algorithm that aims to determine the best size and location of distributed generators in unbalanced distribution networks. The proposed heuristic algorithm can deal with the planning cases where power loss is to be optimized without violating the system practical constraints. The distributed generation units in the proposed algorithm is modeled as voltage controlled node with the flexibility to be converted to constant power factor node in case of reactive power limit violation. The proposed algorithm is implemented in MATLAB and tested on the IEEE 37 -node feeder. The results obtained show the effectiveness of the proposed algorithm.

Keywords: distributed generation, heuristic approach, optimization, planning

Procedia PDF Downloads 492

Authors: Ayman M. Othman, Hassan Y. Ahmed, Tallat A. Ali

Abstract:

Inadequate maintenance programs and funds allocated for highway networks in the developed countries have led to fast deterioration of road side elements. Therefore, this research focuses on developing a performance model for road side elements periodic maintenance activities. Road side elements that receive periodic maintenance include; earthen shoulder, road signs and traffic markings. Using the level of service concept, the developed model can determine the optimal periodic maintenance intervals for those elements based on a selected level of service suitable with the available periodic maintenance budget. Data related to time periods for progressive deterioration stages for the chosen elements were collected. Ten maintenance experts in Aswan, Sohag and Assiut cities were interviewed for that purpose. Time in months related to 10%, 25%, 40%, 50%, 75%, 90% and 100% deterioration of each road side element was estimated based on the experts opinion. Least square regression analysis has shown that a power function represents the best fit for earthen shoulders edge drop-off and damage of road signs with time. It was also evident that, the progressive dirtiness of road signs could be represented by a quadratic function an a linear function could represent the paint degradation nature of both traffic markings and road signs. Actual measurements of earthen shoulder edge drop-off agree considerably with the developed model.

Keywords: deterioration, level of service, periodic maintenance, performance model, road side element

Procedia PDF Downloads 539

Authors: Qian Pei, Hengjian Tong, Weitao Chen, Hai Wang, Yanrong Feng

Abstract:

Horizontal parallax is the foundation of stereoscopic viewing. However, the human eye will feel uncomfortable and it will occur diplopia if horizontal parallax is larger than eye separation. Therefore, we need to do parallax refining before conducting stereoscopic observation. Although some scholars have been devoted to online remote sensing refining, the main work of image refining is completed on the server side. There will be a significant delay when multiple users access the server at the same time. The emergence of HTML5 technology in recent years makes it possible to develop rich browser web application. Authors complete the image parallax refining on the browser side based on HTML5, while server side only need to transfer image data and parallax file to browser side according to the browser’s request. In this way, we can greatly reduce the server CPU load and allow a large number of users to access server in parallel and respond the user’s request quickly.

Keywords: 3D remote sensing images, parallax, online refining, rich browser web application, HTML5

Procedia PDF Downloads 434

Authors: J. Areerut

Abstract:

Experimental Film Class Project is supported by the Institute for Research and Development at Suan Sunandha Rajabhat University. This project is purported to provide academic and professional services to improve the quality standards of the community and locals in accordance with the mission of the university, which is to improve and expand knowledge for the community and to develop and transfer such knowledge and professions to the next generation. Eventually, it leads to sustainable development because the development of human resources is deemed as the key for sustainable development. Moreover, the Experimental Film Class is an integral part of the teaching of film production at Suan Sunandha International School of Art (SISA). By means of giving opportunities to students for participation in projects by sharing experience, skill and knowledge and participation in field activities, it helps students in the film production major to enhance their abilities and potentials as preparation for their readiness in the marketplace. Additionally, in this class, we provide basic film knowledge, screenwriting techniques, editing and subtitles including uploading videos on social media such as YouTube and Facebook for the participant students.

Keywords: experimental film class, Watbangkapom School, participant students, basic of film production, film workshop

Procedia PDF Downloads 311

Authors: Emine Ebru Demirci, Remzi Şahin

Abstract:

The purpose of this study is to compare Self Compacting Concrete (SCC) and Conventional Concrete (CC), which are used in beams with dense reinforcement, in terms of their capillary absorption. During the comparison of SCC and CC, the effects of two different factors were also investigated: concrete strength class and curing condition. In the study, both SCC and CC were produced in three different concrete classes (C25, C50 and C70) and the other parameter (i.e curing condition) was determined as two levels: moisture and air curing. Beam dimensions were determined to be 200 x 250 x 3000 mm. Reinforcements of the beams were calculated and placed as 2ø12 for the top and 3ø12 for the bottom. Stirrups with dimension 8 mm were used as lateral rebar and stirrup distances were chosen as 10 cm in the confinement zone and 15 cm at the central zone. In this manner, densification of rebars in lateral cross-sections of beams and handling of SCC in real conditions were aimed. Concrete covers of the rebars were chosen to be equal in all directions as 25 mm. The capillary absorption measurements were performed on core samples taken from the beams. Core samples of ø8x16 cm were taken from the beginning (0-100 cm), middle (100-200 cm) and end (200-300 cm) region of the beams according to the casting direction of SCC. However core samples were taken from lateral surface of the beams. In the study, capillary absorption experiments were performed according to Turkish Standard TS EN 13057. It was observed that, for both curing environments and all strength classes of concrete, SCC’s had lower capillary absorption values than that of CC’s. The capillary absorption values of C25 class of SCC are 11% and 16% lower than that of C25 class of CC for air and moisture conditions, respectively. For C50 class, these decreases were 6% and 18%, while for C70 class, they were 16% and 9%, respectively. It was also detected that, for both SCC and CC, capillary absorption values of samples kept in moisture curing are significantly lower than that of samples stored in air curing. For CC’s; C25, C50 and C70 class moisture-cured samples were found to have 26%, 12% and 31% lower capillary absorption values, respectively, when compared to the air-cured ones. For SCC’s; these values were 30%, 23% and 24%, respectively. Apart from that, it was determined that capillary absorption values for both SCC and CC decrease with increasing strength class of concrete for both curing environments. It was found that, for air cured CC, C50 and C70 class of concretes had 39% and 63% lower capillary absorption values compared to the C25 class of concrete. For the same type of concrete samples cured in the moisture environment, these values were found to be 27% and 66%. It was found that for SCC samples, capillary absorption value of C50 and C70 concretes, which were kept in air curing, were 35% and 65% lower than that of C25, while for moisture-cured samples these values were 29% and 63%, respectively. When standard deviations of the capillary absorption values are compared for core samples obtained from the beginning, middle and end of the CC and SCC beams, it was found that, in all three strength classes of concrete, the variation is much smaller for SCC than CC. This demonstrated that SCC’s had more uniform character than CC’s.

Keywords: self compacting concrete, reinforced concrete beam, capillary absorption, strength class, curing condition

Procedia PDF Downloads 346

Authors: Mamatha Hosapatna, Anne D. Souza, Vrinda Hari Ankolekar, Antony Sylvan D. Souza

Abstract:

Introduction: The lower extremity of the femur is characterized by an anterior groove in which patella is held during motion. This groove separates the two lips of the trochlea (medial and lateral), prolongation of the two condyles. In humans, the lateral trochlear lip is more developed than the medial one, creating an asymmetric groove that is also specific to the human body. Because of femoral obliquity, contraction of quadriceps leads to a lateral dislocation stress on the patella, and the more elevated lateral side of the patellar groove helps the patella stays in its correct place, acting as a wall against lateral dislocation. This specific shape fits an oblique femur. It is known that femoral obliquity is not genetically determined but comes with orthostatism and biped walking. Material and Methodology: To measure the various dimensions of the Femoropatellar groove (FPG) and femoral condyle using digital image analyser. 37 dried adult femora (22 right,15 left) were used for the study. End on images of the lower end of the femur was taken. Various dimensions of the Femoropatellar groove and FP angle were measured using image J software. Results were analyzed statistically. Results: Maximum of the altitude of medial condyle of the right femur is 4.98± 0.35 cm and of the left femur is 5.20±.16 cm. Maximum altitude of lateral condyle is 5.44±0.4 and 5.50±0.14 on the right and left side respectively. Medial length of the groove is 1.30±0.38 cm on the right side and on the left side is 1.88±0.16 cm. The lateral length of the groove on the right side is 1.900±.16 cm and left side is 1.88±0.16 cm. Femoropatellar angle is 136.38◦±2.59 on the right side and on the left side it is 142.38◦±7.0 Angle and dimensions of the femoropatellar groove on the medial and lateral sides were measured. Asymmetry in the patellar groove was observed. The lateral lip was found to be wider and bigger which correlated with the previous studies. An asymmetrical patellar groove with a protruding lateral side associated with an oblique femur is a specific mark of bipedal locomotion. Conclusion: Dimensions of FPG are important in maintaining the stability of patella and also in knee replacement surgeries. The implants used in to replace the patellofemoral compartment consist of a metal groove to fit on the femoral end and a plastic disc that attaches to the undersurface of the patella. The location and configuration of the patellofemoral groove of the distal femur are clinically significant in the mechanics and pathomechanics of the patellofemoral articulation.

Keywords: femoral patellar groove, femoro patellar angle, lateral condyle, medial condyle

Procedia PDF Downloads 367

Authors: Meng-Hui Chen, Chiao-Wei Yu, Pei-Chann Chang

Abstract:

Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods.

Keywords: traveling salesman problem, artificial chromosomes, greedy search, imperial competitive algorithm

Procedia PDF Downloads 425

Authors: Firmanda Taufiq

Abstract:

Turkey as a country with great political power and political dynamics that occurred in Turkey shows symptoms that make this country interesting enough to be studied. In addition, there is also Post-Islamism phenomenon that causes fluctuations and changes in Turkish politics. In this regard, Turkey carved out history by holding a referendum that changed the state system from a parliamentary system with a presidential system. This change has major implications in the life of Turkish society and politics. The condition is not only influenced by the government of Recep Tayyib Erdogan alone, but actually there is also anxiety middle class Turkish (Middle Class Anatolia). So there was a Turkish referendum held on 16 April 2017. This research using descriptive-analysis method to analyzing problems of research, that's how the post-Islamism situation in Turkey and Anatolian Middle Class impact to Turkish referendum. Actually, the political process that took place in Turkey is inseparable from Post-Islamism which became an important part in the change and transition of government system. The AKP Party as the basis of the Erdogan government movement became an important actor in the political and policy dynamics produced by the Erdogan government. It is then why the Turkish referendum took place.

Keywords: post-Islamism, Turkish politic, AKP, middle class Anatolia

Procedia PDF Downloads 459

Authors: Abbas Mirakhorli

Abstract:

A hub covering problem is a type of hub location problem that tries to maximize the coverage area with the least amount of installed hubs. There have not been many studies in the literature about multi-objective hubs covering location problems. Thus, in this paper, a bi-objective model for the hub covering problem is presented. The two objectives that are considered in this paper are the minimization of total transportation costs and the maximization of coverage of origin-destination nodes. A genetic algorithm is presented to solve the model when the number of nodes is increased. The genetic algorithm is capable of solving the model when the number of nodes increases by more than 20. Moreover, the genetic algorithm solves the model in less amount of time.

Keywords: facility location, hub covering, multi-objective optimization, genetic algorithm

Procedia PDF Downloads 25

Authors: Masoumeh Ali Pouri, Hamid Haj Seyyed Javadi

Abstract:

Nowadays, cloud processing is one of the important issues in information technology. Since scheduling of tasks graph is an NP-hard problem, considering approaches based on undeterminisitic methods such as evolutionary processing, mostly genetic and cuckoo algorithms, will be effective. Therefore, an efficient algorithm has been proposed for scheduling of tasks graph to obtain an appropriate scheduling with minimum time. In this algorithm, the new approach is based on making the length of the critical path shorter and reducing the cost of communication. Finally, the results obtained from the implementation of the presented method show that this algorithm acts the same as other algorithms when it faces graphs without communication cost. It performs quicker and better than some algorithms like DSC and MCP algorithms when it faces the graphs involving communication cost.

Keywords: cloud computing, scheduling, tasks graph, chakoos algorithm

Procedia PDF Downloads 31

Authors: Hamidreza Saberkari, Mousa Shamsi, Hossein Ahmadi, Saeed Vaali, , MohammadHossein Sedaaghi

Abstract:

In the recent years, using signal processing tools for accurate identification of the protein coding regions has become a challenge in bioinformatics. Most of the genomic signal processing methods is based on the period-3 characteristics of the nucleoids in DNA strands and consequently, spectral analysis is applied to the numerical sequences of DNA to find the location of periodical components. In this paper, a novel ensemble algorithm for gene selection in DNA sequences has been presented which is based on the combination of Goertzel algorithm and anti-notch filter (ANF). The proposed algorithm has many advantages when compared to other conventional methods. Firstly, it leads to identify the coding protein regions more accurate due to using the Goertzel algorithm which is tuned at the desired frequency. Secondly, faster detection time is achieved. The proposed algorithm is applied on several genes, including genes available in databases BG570 and HMR195 and their results are compared to other methods based on the nucleotide level evaluation criteria. Implementation results show the excellent performance of the proposed algorithm in identifying protein coding regions, specifically in identification of small-scale gene areas.

Keywords: protein coding regions, period-3, anti-notch filter, Goertzel algorithm

Procedia PDF Downloads 365

Authors: Jingpeng Gao, Xinrui Mao, Zhibin Deng

Abstract:

Aiming at the low recognition rate on the composite signal modulation in low signal to noise ratio (SNR), this paper proposes a modulation recognition algorithm based on ICanny-CNN. Firstly, the radar signal is transformed into the time-frequency image by Choi-Williams Distribution (CWD). Secondly, we propose an image processing algorithm using the Guided Filter and the threshold selection method, which is combined with the hole filling and the mask operation. Finally, the shallow convolutional neural network (CNN) is combined with the idea of the depth-wise convolution (Dw Conv) and the point-wise convolution (Pw Conv). The proposed CNN is designed to complete image classification and realize modulation recognition of radar signal. The simulation results show that the proposed algorithm can reach 90.83% at 0dB and 71.52% at -8dB. Therefore, the proposed algorithm has a good classification and anti-noise performance in radar signal modulation recognition and other fields.

Keywords: modulation recognition, image processing, composite signal, improved Canny algorithm

Procedia PDF Downloads 162

Authors: Arbnor Pajaziti, Hasan Cana

Abstract:

In this paper, the structural genetic algorithm is used to optimize the neural network to control the joint movements of robotic arm. The robotic arm has also been modeled in 3D and simulated in real-time in MATLAB. It is found that Neural Networks provide a simple and effective way to control the robot tasks. Computer simulation examples are given to illustrate the significance of this method. By combining Genetic Algorithm optimization method and Neural Networks for the given robotic arm with 5 D.O.F. the obtained the results shown that the base joint movements overshooting time without controller was about 0.5 seconds, while with Neural Network controller (optimized with Genetic Algorithm) was about 0.2 seconds, and the population size of 150 gave best results.

Keywords: robotic arm, neural network, genetic algorithm, optimization

Procedia PDF Downloads 483

Authors: Samia Sadouki Chibani, Abdelkamel Tari

Abstract:

Web service composition combines available services to provide new functionality. Given the number of available services with similar functionalities and different non functional aspects (QoS), the problem of finding a QoS-optimal web service composition is considered as an optimization problem belonging to NP-hard class. Thus, an optimal solution cannot be found by exact algorithms within a reasonable time. In this paper, a meta-heuristic bio-inspired is presented to address the QoS aware web service composition; it is based on Elephant Herding Optimization (EHO) algorithm, which is inspired by the herding behavior of elephant group. EHO is characterized by a process of dividing and combining the population to sub populations (clan); this process allows the exchange of information between local searches to move toward a global optimum. However, with Applying others evolutionary algorithms the problem of early stagnancy in a local optimum cannot be avoided. Compared with PSO, the results of experimental evaluation show that our proposition significantly outperforms the existing algorithm with better performance of the fitness value and a fast convergence.

Keywords: bio-inspired algorithms, elephant herding optimization, QoS optimization, web service composition

Procedia PDF Downloads 296

Authors: Tomas Menard

Abstract:

The synthesis of output-feedback control law has been investigated by many researchers since the last century. While many results exist for the case of Linear Time Invariant systems whose measurements are continuously available, nowadays, control laws are usually implemented on micro-controller, then the measurements are discrete-time by nature. This fact has to be taken into account explicitly in order to obtain a satisfactory behavior of the closed-loop system. One considers here a general class of systems corresponding to an observability normal form and which is subject to uncertainties in the dynamics and sampling of the output. Indeed, in practice, the modeling of the system is never perfect, this results in unknown uncertainties in the dynamics of the model. We propose here an output feedback algorithm which is based on a linear state feedback and a continuous-discrete time observer. The main feature of the proposed control law is that only discrete-time measurements of the output are needed. Furthermore, it is formally proven that the state of the closed loop system exponentially converges toward the origin despite the unknown uncertainties. Finally, the performances of this control scheme are illustrated with simulations.

Keywords: dynamical systems, output feedback control law, sampling, uncertain systems

Procedia PDF Downloads 254

Authors: Anuj Abraham, N. Pappa, Daniel Honc, Rahul Sharma

Abstract:

In this paper, an analysis of some model order reduction techniques is presented. A new hybrid algorithm for model order reduction of linear time invariant systems is compared with the conventional techniques namely Balanced Truncation, Hankel Norm reduction and Dominant Pole Algorithm (DPA). The proposed hybrid algorithm is known as Clustering Dominant Pole Algorithm (CDPA) is able to compute the full set of dominant poles and its cluster center efficiently. The dominant poles of a transfer function are specific eigenvalues of the state space matrix of the corresponding dynamical system. The effectiveness of this novel technique is shown through the simulation results.

Keywords: balanced truncation, clustering, dominant pole, Hankel norm, model reduction

Procedia PDF Downloads 572

Authors: Gkolfo I. Smani, Vasileios Megalooikonomou

Abstract:

Social influence and influence diffusion have been studied in social networks. However, most existing tasks on this subject focus on static networks. In this paper, the problem of maximizing influence diffusion in dynamic social networks, i.e., the case of networks that change over time, is studied. The DM algorithm is an extension of the MATI algorithm and solves the influence maximization (IM) problem in dynamic networks and is proposed under the linear threshold (LT) and independent cascade (IC) models. Experimental results show that our proposed algorithm achieves a diffusion performance better by 1.5 times than several state-of-the-art algorithms and comparable results in diffusion scale with the Greedy algorithm. Also, the proposed algorithm is 2.4 times faster than previous methods.

Keywords: influence maximization, dynamic social networks, diffusion, social influence, graphs

Procedia PDF Downloads 205

Authors: Elham Alaee, Mousa Shamsi, Hossein Ahmadi, Soroosh Nazem, Mohammad Hossein Sedaaghi

Abstract:

Human face has a fundamental role in the appearance of individuals. So the importance of facial surgeries is undeniable. Thus, there is a need for the appropriate and accurate facial skin segmentation in order to extract different features. Since Fuzzy C-Means (FCM) clustering algorithm doesn’t work appropriately for noisy images and outliers, in this paper we exploit Possibilistic C-Means (PCM) algorithm in order to segment the facial skin. For this purpose, first, we convert facial images from RGB to YCbCr color space. To evaluate performance of the proposed algorithm, the database of Sahand University of Technology, Tabriz, Iran was used. In order to have a better understanding from the proposed algorithm; FCM and Expectation-Maximization (EM) algorithms are also used for facial skin segmentation. The proposed method shows better results than the other segmentation methods. Results include misclassification error (0.032) and the region’s area error (0.045) for the proposed algorithm.

Keywords: facial image, segmentation, PCM, FCM, skin error, facial surgery

Procedia PDF Downloads 552

Authors: A. Boudjemai, A. Zafrane, R. Hocine

Abstract:

Honeycomb sandwich panels are increasingly used in the construction of space vehicles because of their outstanding strength, stiffness and light weight properties. However, the use of honeycomb sandwich plates comes with difficulties in the design process as a result of the large number of design variables involved, including composite material design, shape and geometry. Hence, this work deals with the presentation of an optimal design of hexagonal honeycomb sandwich structures subjected to space environment. The optimization process is performed using a set of algorithms including the gravitational search algorithm (GSA). Numerical results are obtained and presented for a set of algorithms. The results obtained by the GSA algorithm are much better compared to other algorithms used in this study.

Keywords: optimization, gravitational search algorithm, genetic algorithm, honeycomb plate

Procedia PDF Downloads 352

Authors: Kalluru Maheswaramma, Putta Padma

Abstract:

This study makes an attempt to demonstrate the wondrous world of the upwardly middle black community in Gloria Naylor’s Linden Hills. Gloria Naylor’s first novel The Women of Brewster Place is about the working class and Linden Hills about middle-class Black America. Naylor believes their serenity that is lost in the middle or working class black people as they move into the upper patriarchal society. Naylor challenges the different forms of superiority, homophobia, and chauvinism, interracial bias, and the like, which plague a community so significantly trying to be acceptable in the larger white community. In an ironic twist, Naylor creates characters that recognize their desire for a solid black community but who in reality ignore blackness and negate any emergent sign of its development. Linden Hills is an expose of the wealthy and spiritually dissolute upper class. Linden Hills is an examination of an upper-middle-class African American community in which women are largely exploited or invisible and in which men have, in the course of upward mobility, sacrificed their racial identity and their essence. Linden Hills is a social world, which includes firm stratification, false values, and an immobilizing impact on its residents. Touching a brief note upon the origin and development of African American Literature as well a note on the chosen writer and her works, the paper proceeds to depict the middle-class black community of Linden Hills.

Keywords: gloria naylor, linden hills, African American community, the middle black community

Procedia PDF Downloads 527

Authors: Israa Sh. Tawfic, Sema Koc Kayhan

Abstract:

In this paper, first, we propose least support orthogonal matching pursuit (LS-OMP) algorithm to improve the performance, of the OMP (orthogonal matching pursuit) algorithm. LS-OMP algorithm adaptively chooses optimum L (least part of support), at each iteration. This modification helps to reduce the computational complexity significantly and performs better than OMP algorithm. Second, we give the procedure for the invisible image watermarking in the presence of compressive sampling. The image reconstruction based on a set of watermarked measurements is performed using LS-OMP.

Keywords: compressed sensing, orthogonal matching pursuit, restricted isometry property, signal reconstruction, least support orthogonal matching pursuit, watermark

Procedia PDF Downloads 311