Search results for: clonal algorithm

Authors: M. Dezvarei, S. Morovati

Abstract:

In recent years, increasing usage of electrical energy provides a widespread field for investigating new methods to produce clean electricity with high reliability and cost management. Fuel cells are new clean generations to make electricity and thermal energy together with high performance and no environmental pollution. According to the expansion of fuel cell usage in different industrial networks, the identification and optimization of its parameters is really significant. This paper presents optimization of a proton exchange membrane fuel cell (PEMFC) parameters based on modified particle swarm optimization with real valued mutation (RVM) and clonal algorithms. Mathematical equations of this type of fuel cell are presented as the main model structure in the optimization process. Optimized parameters based on clonal and RVM algorithms are compared with the desired values in the presence and absence of measurement noise. This paper shows that these methods can improve the performance of traditional optimization methods. Simulation results are employed to analyze and compare the performance of these methodologies in order to optimize the proton exchange membrane fuel cell parameters.

Keywords: clonal algorithm, proton exchange membrane fuel cell (PEMFC), particle swarm optimization (PSO), real-valued mutation (RVM)

Procedia PDF Downloads 314

Authors: Weicheng Luo, Wenzhi Zhao

Abstract:

Plants growth in desert often suffered from stresses like water deficit, wind erosion and sand burial. Thus, plants in desert always have unique strategies to adapt these stresses. However, data regarding how clonal shrubs withstand wind erosion and sand burial in natural habitats remain relatively scarce. Therefore, we selected a common clonal shrub Calligonum arborescens to study the adaptive strategies of clonal plants to sand dune environment in a transitional zone of desert and Hexi Oasis of China. Our results show that sand burial is one of the essential prerequisites for the survival of C. arborescens rhizome fragments. Both the time and degrees of sand burial and wind erosion had significantly effects on clonal reproduction and growth of C. arborescens. With increasing burial depth, the number of ramets and biomass production significantly decreased. There is same change trend in severe erosion treatments. However, the number of ramets and biomass production significantly increased in moderate erosion treatments. Rhizome severed greatly decreased ramet number and biomass production under both sand burial and severe erosion treatments. That indicated that both sand burial and severe erosion had negative effects on the clonal growth of C. arborescens, but moderate wind erosion had positive effects. And rhizome connections alleviated the negative effects of sand burial and of severe erosion on the growth and performance of C. arborescens. Most fragments of C. arborescens grew in the directions of northeastern and southwestern. Ramet number and biomass, rhizome length and biomass in these two directions were significantly higher than those found in other directions. Interestingly, these directions were perpendicular to the prevailing wind direction. Distribution of C. arborescens differed in different habitats. The total number of individuals was significantly higher in inter-dune areas and on windward slopes than on the top and leeward slopes of dunes; more clonal ramets were produced on the top of dunes than elsewhere, and a few were found on leeward slopes. The mainly reason is that ramets on windward and top of dunes can easily suffered with moderated wind erosion which promoted clonal growth and reproduction of C. arborescens. These results indicated that C. arborescens adapted sand dune environment through directional growth and patchy distribution, and sand-burial and wind erosion were the key factors which led to the directional growth and patchiness of C. arborescens.

Keywords: adaptive strategy, Calligonum arborescens Litv, clonal fragment, desert-oasis transitional zone, sand burial and wind erosion

Procedia PDF Downloads 205

Authors: Sabahattin Comertpay, Sandra Pastorino, Rosanna Mezzapelle, Mika Tanji, Oriana Strianese, Andrea Napolitano, Tracey Weigel, Joseph Friedberg, Paul Sugarbaker, Thomas Krausz, Ena Wang, Amy Powers, Giovanni Gaudino, Harvey I. Pass, Fatmagul Ozcelik, Barbara L. Parsons, Haining Yang, Michele Carbone

Abstract:

Tumors are thought to be monoclonal in origin. This paradigm arose decades ago, primarily from the study of hematopoietic malignancies and sarcomas. The clonal origin of malignant mesothelioma (MM), a deadly cancer resistant to the current therapies, has not been investigated. Examination of the pleura from patients with MM shows often the presence of multiple pleural nodules, raising the question of whether they represent independent or metastatic growth processes. To investigate the clonality patterns of MM, we used the HUMARA (Human Androgen Receptor) assay to examine 14 sporadic and 2 familial Malignant Mesotheliomas (MM). Of 16 specimens studied, 15 were informative and 14/15 revealed two electrophoretically distinct methylated HUMARA alleles, indicating a polyclonal origin for these tumors. This discovery has important clinical implications, because an accurate assessment of tumor clonality is key to the design of novel molecular strategies for the treatment of MM.

Keywords: malignant mesothelioma, clonal origin, HUMARA, sarcomas

Procedia PDF Downloads 408

Authors: Amelyn M. Ambal, Jose Hermis Patricio

Abstract:

A macro-somatic clonal propagation study was undertaken to determine the effects of method of propagation, rooting hormone, and level of rooting hormone concentration of TBOS (Calophyllum inophyllum Mer. and Pongamia pinnata L.). A factorial experiment in SSSPD with three replications was used in the study and analyzed using ANOVA and LSD. Open mist propagation is effective for rooting Calophyllum inophyllum and Pongamia pinnata cuttings as it gave statistically higher number of adventitious roots, longer length of roots, and higher rooting percentage. C. inophyllum cuttings exhibit statistically higher rooting percentage compared to P. pinnata cuttings when subjected to open mist method and treated with 600 ppm of NAA. NAA is more effective than IBA in terms of number and length of roots, and rooting percentage produced. However, levels of hormone concentration were not generally effective on the rooting performance and shoot production of both species.

Keywords: adventitious roots, Calophyllum, close-mist, macro-somatic clonal propagation, Pongamia, open-mist

Procedia PDF Downloads 418

Authors: R. M. Rizk-Allah

Abstract:

This paper presents co-evolutionary fruit fly optimization algorithm based on firefly algorithm (CFOA-FA) for solving unconstrained optimization problems. The proposed algorithm integrates the merits of fruit fly optimization algorithm (FOA), firefly algorithm (FA) and elite strategy to refine the performance of classical FOA. Moreover, co-evolutionary mechanism is performed by applying FA procedures to ensure the diversity of the swarm. Finally, the proposed algorithm CFOA- FA is tested on several benchmark problems from the usual literature and the numerical results have demonstrated the superiority of the proposed algorithm for finding the global optimal solution.

Keywords: firefly algorithm, fruit fly optimization algorithm, unconstrained optimization problems

Procedia PDF Downloads 501

Authors: Asiye Ciftci, Zeki Kaya

Abstract:

Populus nigra is one of the most economically and ecologically important forest trees in Turkey, well known for its rapid growth, good ability to vegetative propagation and the extreme uses of its wood. Due to overexploitation, loss of natural distribution area and extreme hybridization and introgression, Populus nigra is one of the most threatened tree species in Turkey and Europe. Using 20 nuclear microsatellite loci, the genetic structure of European black poplar populations along the two largest rivers of Turkey was analyzed. All tested loci were highly polymorphic, displaying 5 to 15 alleles per locus. Observed heterozygosity (overall Ho = 0.79) has been higher than the expected (overall He = 0.58) in each population. Low level of genetic differentiation among populations (FST= 0,03) and excess of heterozygotes for each river were found. Human-mediated dispersal, phenotypic selection, high level of gene flow and extensive circulations of clonal materials may cause those situations. The genetic data obtained from this study could provide the basis for efficient in situ and ex-situ conservation and restoration of species natural populations in its natural habitat as well as having sustainable breeding and poplar plantations in the future.

Keywords: populus, clonal, loci, ex situ

Procedia PDF Downloads 260

Authors: Gaohuizi Guo, Ning Zhang

Abstract:

Firefly algorithm (FA) and Sine Cosine algorithm (SCA) are two very popular and advanced metaheuristic algorithms. However, these algorithms applied to multi-objective optimization problems have some shortcomings, respectively, such as premature convergence and limited exploration capability. Combining the privileges of FA and SCA while avoiding their deficiencies may improve the accuracy and efficiency of the algorithm. This paper proposes a hybridization of FA and SCA algorithms, named multi-objective firefly-sine cosine algorithm (MFA-SCA), to develop a more efficient meta-heuristic algorithm than FA and SCA.

Keywords: firefly algorithm, hybrid algorithm, multi-objective optimization, sine cosine algorithm

Procedia PDF Downloads 131

Authors: Safeer Hussain Khan

Abstract:

In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corresponding results proved for the above three iterative algorithms to a class of more general operators. At the end, we remark that nothing prevents us to extend our result to the case of the iterative algorithm with error terms.

Keywords: contractive-like operator, iterative algorithm, fixed point, strong convergence

Procedia PDF Downloads 514

Authors: Abdullah Eqal Al Mazrooei

Abstract:

In this paper, we introduce a mathematical algorithm which is used for estimating the states in the bilinear systems. This algorithm uses a special linearization of the second-order term by using the best available information about the state of the system. This technique makes our algorithm generalizes the well-known Kalman estimators. The system which is used here is of the bilinear class, the evolution of this model is linear-bilinear in the state of the system. Our algorithm can be used with linear and bilinear systems. We also here introduced a real application for the new algorithm to prove the feasibility and the efficiency for it.

Keywords: estimation algorithm, bilinear systems, Kakman filter, second order linearization

Procedia PDF Downloads 446

Authors: Mohd Naqiuddin Bin Husri, Siti Rahmah Abd Rahman, Dalilah Abu Bakar, Dayang Izawati Abang Masli, Meilina Ong Abdullah

Abstract:

A serious shortage of prime agricultural land coupled with environmental concerns inland expansion has daunted efforts to increase the national yield average. To address this issue, maximising yield per unit hectare through quality planting material is of great importance. Breeding for improved planting materials has been a continuous effort since the early days of this industry, it is time-consuming, and the likelihood of segregation within the progenies further impedes progress in this area. Incorporation of the cloning technology in oil palm breeding programmes is therefore advantageous to expedite the development of commercial elite and high-yielding planting materials. After more than 22 years of research and development through this project, reliable protocols for liquid/suspension culture systems coupled with various innovative technologies which are effective at promoting proliferation and growth of oil palm culture have been established. Subsequently, clonal palms derived from the suspension culture system were extensively studied in the field, and the results have been encouraging. Clones such as CPS1, CPS2 and a few others recorded superior performance in comparison with D x P standard crosses.

Keywords: tissue culture, suspension culture, oil palm, Elaeis guineensis

Procedia PDF Downloads 158

Authors: Nassiri Khalid, El Hibaoui Abdelaaziz et Hajar Moha

Abstract:

In this paper, we introduce and analyse a probabilistic distributed algorithm for a construction of a minimum spanning tree on network. This algorithm is based on the handshake concept. Firstly, each network node is considered as a sub-spanning tree. And at each round of the execution of our algorithm, a sub-spanning trees are merged. The execution continues until all sub-spanning trees are merged into one. We analyze this algorithm by a stochastic process.

Keywords: Spanning tree, Distributed Algorithm, Handshake Algorithm, Matching, Probabilistic Analysis

Procedia PDF Downloads 628

Authors: Vishnu Pratap Singh Kirar

Abstract:

Artificial Neural Network (ANN) can be trained using backpropagation (BP). It is the most widely used algorithm for supervised learning with multi-layered feed-forward networks. Efficient learning by the BP algorithm is required for many practical applications. The BP algorithm calculates the weight changes of artificial neural networks, and a common approach is to use a two-term algorithm consisting of a learning rate (LR) and a momentum factor (MF). The major drawbacks of the two-term BP learning algorithm are the problems of local minima and slow convergence speeds, which limit the scope for real-time applications. Recently the addition of an extra term, called a proportional factor (PF), to the two-term BP algorithm was proposed. The third increases the speed of the BP algorithm. However, the PF term also reduces the convergence of the BP algorithm, and criteria for evaluating convergence are required to facilitate the application of the three terms BP algorithm. Although these two seem to be closely related, as described later, we summarize various improvements to overcome the drawbacks. Here we compare the different methods of convergence of the new three-term BP algorithm.

Keywords: neural network, backpropagation, local minima, fast convergence rate

Procedia PDF Downloads 465

Authors: Kevin Worrall, Euan McGookin

Abstract:

The use of optimization algorithms is common across a large number of diverse fields. This work presents the use of a hybrid optimization algorithm applied to a mobile robot tasked with carrying out a search of an unknown environment. The algorithm is then applied to the multiple robots case, which results in a reduction in the time taken to carry out the search. The hybrid algorithm is a Random Search Algorithm fused with a Tabu mechanism. The work shows that the algorithm locates the desired points in a quicker time than a brute force search. The Tabu Random algorithm is shown to work within a simulated environment using a validated mathematical model. The simulation was run using three different environments with varying numbers of targets. As an algorithm, the Tabu Random is small, clear and can be implemented with minimal resources. The power of the algorithm is the speed at which it locates points of interest and the robustness to the number of robots involved. The number of robots can vary with no changes to the algorithm resulting in a flexible algorithm.

Keywords: algorithms, control, multi-agent, search and rescue

Procedia PDF Downloads 211

Authors: Shabnam Alizadeh, Hatice Dumanoglu

Abstract:

Plant tissue culture is a substantial plant propagation technique for mass clonal production throughout the year, regardless of time in fruit species. However, the rooting achievement must be enhanced in the difficult-to-root genotypes. Classical auxin applications in clonal propagation of these genotypes are inadequate to solve the rooting problem. Nanoparticles having different physical and chemical properties from bulk material could enhance the rooting success of controlled release of these substances when loaded with auxin due to their ability to reach the active substance up to the target cells as a carrier system.The purpose of this study is to investigate the effects of zinc oxide nanoparticles loaded with indole-3-acetic acid (IAA-nZnO) and indole-3-butyric acid (IBA-nZnO) on in vitro rooting of microcuttings in a difficult-to-root apple genotype (Malus domestica Borkh.). Rooting treatments consisted of IBA or IAA at concentrations of 0.5, 1.0, 2.0, 3.0 mg/L; nZnO, IAA-nZnO and IBA-nZnO at doses of 0.0, 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 mg/L were used. All components were added to the Murashige and Skoog (MS) basal medium at strength ½ with 2% sucrose and 0.7% agar before autoclaving. In the study, no rooting occurred in control and nZnO applications. Especially, 1.0 mg/L and 2.0 mg/L IBA-nZnO nanoparticle applications (containing 0.5 mg/L and 0.9 mg/L IBA), respectively with rooting rates of 40.3% and 70.4%, rooting levels of 2.0±0.4 and 2.3±0.4, 2.6±0.7 and 2.5±0.6 average root numbers and 20.4±1.6 mm and 20.2±3.4 mm average root lengths put forward as effective applications.

Keywords: Auxin, Malus, nanotechnology, zinc oxide nanoparticles

Procedia PDF Downloads 112

Authors: Thomas Yeboah

Abstract:

Cloud Computing is newly paradigm in computing that promises a delivery of computing as a service rather than a product, whereby shared resources, software, and information are provided to computers and other devices as a utility (like the electricity grid) over a network (typically the Internet). As Cloud Computing is a newly style of computing on the internet. It has many merits along with some crucial issues that need to be resolved in order to improve reliability of cloud environment. These issues are related with the load balancing, fault tolerance and different security issues in cloud environment.In this paper the main concern is to develop an effective load balancing algorithm that gives satisfactory performance to both, cloud users and providers. This proposed algorithm (hybrid Bee Ant Colony algorithm) is a combination of two dynamic algorithms: Ant Colony Optimization and Bees Life algorithm. Ant Colony algorithm is used in this hybrid Bee Ant Colony algorithm to solve load balancing issues whiles the Bees Life algorithm is used for optimization of job scheduling in cloud environment. The results of the proposed algorithm shows that the hybrid Bee Ant Colony algorithm outperforms the performances of both Ant Colony algorithm and Bees Life algorithm when evaluated the proposed algorithm performances in terms of Waiting time and Response time on a simulator called CloudSim.

Keywords: ant colony optimization algorithm, bees life algorithm, scheduling algorithm, performance, cloud computing, load balancing

Procedia PDF Downloads 594

Authors: Sardar Ameer Akram Khan, Shahzad Amin Sheikh

Abstract:

Blind equalization is an important technique amongst equalization family. Multimodulus algorithms based on blind equalization removes the undesirable effects of ISI and cater ups the phase issues, saving the cost of rotator at the receiver end. In this paper a new algorithm combination of recursive least square and Multimodulus algorithm named as RLSMMA is proposed by providing few assumption, fast convergence and minimum Mean Square Error (MSE) is achieved. The excellence of this technique is shown in the simulations presenting MSE plots and the resulting filter results.

Keywords: blind equalizations, constant modulus algorithm, multi-modulus algorithm, recursive least square algorithm, quadrature amplitude modulation (QAM)

Procedia PDF Downloads 615

Authors: Safa Adi

Abstract:

This paper will consider the problem of sequential mining patterns embedded in a database by handling the time constraints as defined in the GSP algorithm (level wise algorithms). We will compare two previous approaches GTC and PSP, that resumes the general principles of GSP. Furthermore this paper will discuss PG-hybrid algorithm, that using PSP and GTC. The results show that PSP and GTC are more efficient than GSP. On the other hand, the GTC algorithm performs better than PSP. The PG-hybrid algorithm use PSP algorithm for the two first passes on the database, and GTC approach for the following scans. Experiments show that the hybrid approach is very efficient for short, frequent sequences.

Keywords: database, GTC algorithm, PSP algorithm, sequential patterns, time constraints

Procedia PDF Downloads 354

Authors: Ali Nourollah, Mohsen Movahedinejad

Abstract:

In this paper a new algorithm to generate random simple polygons from a given set of points in a two dimensional plane is designed. The proposed algorithm uses a genetic algorithm to generate polygons with few vertices. A new merge algorithm is presented which converts any two polygons into a simple polygon. This algorithm at first changes two polygons into a polygonal chain and then the polygonal chain is converted into a simple polygon. The process of converting a polygonal chain into a simple polygon is based on the removal of intersecting edges. The merge algorithm has the time complexity of O ((r+s) *l) where r and s are the size of merging polygons and l shows the number of intersecting edges removed from the polygonal chain. It will be shown that 1 < l < r+s. The experiments results show that the proposed algorithm has the ability to generate a great number of different simple polygons and has better performance in comparison to celebrated algorithms such as space partitioning and steady growth.

Keywords: Divide and conquer, genetic algorithm, merge polygons, Random simple polygon generation.

Procedia PDF Downloads 504

Authors: Ying Li, Yan Li

Abstract:

A new algorithm for single hidden layer feedforward neural networks (SLFN), Orthogonal Basis Extreme Learning (OBEL) algorithm, is proposed and the algorithm derivation is given in the paper. The algorithm can decide both the NNs parameters and the neuron number of hidden layer(s) during training while providing extreme fast learning speed. It will provide a practical way to develop NNs. The simulation results of function approximation showed that the algorithm is effective and feasible with good accuracy and adaptability.

Keywords: neural network, orthogonal basis extreme learning, function approximation

Procedia PDF Downloads 504

Authors: Wullapa Wongsinlatam

Abstract:

Back propagation algorithm (BP) is a widely used technique in artificial neural network and has been used as a tool for solving the time series problems, such as decreasing training time, maximizing the ability to fall into local minima, and optimizing sensitivity of the initial weights and bias. This paper proposes an improvement of a BP technique which is called IM-COH algorithm (IM-COH). By combining IM-COH algorithm with cuckoo search algorithm (CS), the result is cuckoo search improved control output hidden layer algorithm (CS-IM-COH). This new algorithm has a better ability in optimizing sensitivity of the initial weights and bias than the original BP algorithm. In this research, the algorithm of CS-IM-COH is compared with the original BP, the IM-COH, and the original BP with CS (CS-BP). Furthermore, the selected benchmarks, four time series samples, are shown in this research for illustration. The research shows that the CS-IM-COH algorithm give the best forecasting results compared with the selected samples.

Keywords: artificial neural networks, back propagation algorithm, time series, local minima problem, metaheuristic optimization

Procedia PDF Downloads 114

Authors: Alisha Akya, Afsaneh salami

Abstract:

Background and Objective: Pseudomonas aeruginosa is an opportunistic pathogen associated with nosocomial infections. One of the major concerns for the treatment of P. aeruginosa infections is its resistant to a variety of antibiotics. The purpose of this study was to assess the dissemination of p. aeruginosa isolates obtained from major hospitals in Kermanshah, west of Iran. Materials and Methods: Antibiotic susceptibility testing was performed using the minimal inhibitory concentrations. Mettalo-beta-lactamase was investigated using the double disk diffusion (DDST) test and PCR. Molecular typing was performed by pulsed-field gel electrophoresis (PFGE). Results: The 60 P. aeruginosa isolates, 30 (50%) were resistant to gentamicin, 38 (63/3%) to piperacilin, 42 (70%) to ceftazidime, and 45 (75%) to cefepime. Twenty-nine (48/3%) isolates were MBLs producer based on the DDST test. Five (8/3%) isolates were positive for VIM gene and 4 of them were from burn specimens. PFGE analysis among MBLs producers revealed 12 distinct genotype patterns. A pattern covering the highest number of strains was determined as the dominant clone. Conclusions: Our study showed that P. aeruginosa strains can be spread between patients in hospitals or acquired from different environmental sources. P. aeruginosa isolates were highly resistant to antibiotics and, therefore, the susceptibility of isolates to antibiotics should be tested before treatment. Given the clinical significance of MBLs producing isolates, identification of these organisms is essential in the hospitals in order to get a better therapeutic response and control of bacterial dissemination.

Keywords: clonal dissemination, mettalo-beta-lactamase, Pseudomonas aeruginosa, PFGE

Procedia PDF Downloads 298

Authors: Anna Solovyeva, Ivan Levakin, Nickolai Galaktionov, Olga Podgornaya

Abstract:

Animals that reproduce asexually were thought to have the same genotypes within generations for a long time. However, some refuting examples were found, and mobile genetic elements (MGEs) or transposons are considered to be the most probable source of genetic instability. Dispersed nature and the ability to change their genomic localization enables MGEs to be efficient mutators. Hence the study of MGEs genomic impact requires an appropriate object which comprehends both representative amounts of various MGEs and options to evaluate the genomic influence of MGEs. Animals that reproduce asexually seem to be a decent model to study MGEs impact in genomic variability. We found a small marine trematode Himasthla elongata (Himasthlidae) to be a good model for such investigation as it has a small genome size, diverse MGEs and parthenogenetic stages in the lifecycle. In the current work, clonal diversity of cercaria was traced with an AFLP (Amplified fragment length polymorphism) method, diverse zones from electrophoretic patterns were cloned, and the nature of the fragments explored. Polymorphic patterns of individual cercariae AFLP-based fingerprints are enriched with retrotransposons of different families. The bulk of those sequences are represented by open reading frames of non-Long Terminal Repeats containing elements(non-LTR) yet Long-Terminal Repeats containing elements (LTR), to a lesser extent in variable figments of AFLP array. The CR1 elements expose both in polymorphic and conservative patterns are remarkably more frequent than the other non-LTR retrotransposons. This data was confirmed with shotgun sequencing-based on Illumina HiSeq 2500 platform. Individual cercaria of the same clone (i.e., originated from a single miracidium and inhabiting one host) has a various distribution of MGE families detected in sequenced AFLP patterns. The most numerous are CR1 and RTE-Bov retrotransposons, typical for trematode genomes. Also, we identified LTR-retrotransposons of Pao and Gypsy families among DNA transposons of CMC-EnSpm, Tc1/Mariner, MuLE-MuDR and Merlin families. We detected many of them in H. elongata transcriptome. Such uneven MGEs distribution in AFLP sequences’ sets reflects the different patterns of transposons spreading in cercarial genomes as transposons affect the genome in many ways (ectopic recombination, gene structure interruption, epigenetic silencing). It is considered that they play a key role in the origins of trematode clonal polymorphism. The authors greatly appreciate the help received at the Kartesh White Sea Biological Station of the Russian Academy of Sciences Zoological Institute. This work is funded with RSF 19-74-20102 and RFBR 17-04-02161 grants and the research program of the Zoological Institute of the Russian Academy of Sciences (project number AAAA-A19-119020690109-2).

Keywords: AFLP, clonal polymorphism, Himasthla elongata, mobile genetic elements, NGS

Procedia PDF Downloads 94

Authors: Jean-Pierre Lomaliza, Kwang-Seok Moon, Hanhoon Park

Abstract:

It is well-known that Ramer Douglas Peucker (RDP) algorithm greatly depends on the method of choosing starting points. Therefore, this paper focuses on finding such starting points that will optimize the results of RDP algorithm. Specifically, this paper proposes a curve approximation algorithm that finds flat points, called essential points, of an input curve, divides the curve into corner-like sub-curves using the essential points, and applies the RDP algorithm to the sub-curves. The number of essential points play a role on optimizing the approximation results by balancing the degree of shape information loss and the amount of data reduction. Through experiments with curves of various types and complexities of shape, we compared the performance of the proposed algorithm with three other methods, i.e., the RDP algorithm itself and its variants. As a result, the proposed algorithm outperformed the others in term of maintaining the original shapes of the input curve, which is important in various applications like pattern recognition.

Keywords: curve approximation, essential point, RDP algorithm

Procedia PDF Downloads 503

Authors: Djendi Mohmaed

Abstract:

In this paper, we propose a dual adaptive algorithm, which is based on the combination between the forward blind source separation (FBSS) structure and the affine projection algorithm (APA). This proposed algorithm combines the advantages of the source separation properties of the FBSS structure and the fast convergence characteristics of the APA algorithm. The proposed algorithm needs two noisy observations to provide an enhanced speech signal. This process is done in a blind manner without the need for ant priori information about the source signals. The proposed dual forward blind source separation affine projection algorithm is denoted (DFAPA) and used for the first time in an airplane cockpit context to enhance the communication from- and to- the airplane. Intensive experiments were carried out in this sense to evaluate the performance of the proposed DFAPA algorithm.

Keywords: adaptive algorithm, speech enhancement, system mismatch, SNR

Procedia PDF Downloads 107

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a hybrid distributed algorithm has been suggested for the multi-objective job shop scheduling problem. Many new approaches are used at design steps of the distributed algorithm. Co-evolutionary structure of the algorithm and competition between different communicated hybrid algorithms, which are executed simultaneously, causes to efficient search. Using several machines for distributing the algorithms, at the iteration and solution levels, increases computational speed. The proposed algorithm is able to find the Pareto solutions of the big problems in shorter time than other algorithm in the literature. Apache Spark and Hadoop platforms have been used for the distribution of the algorithm. The suggested algorithm and implementations have been compared with results of the successful algorithms in the literature. Results prove the efficiency and high speed of the algorithm.

Keywords: distributed algorithms, Apache Spark, Hadoop, job shop scheduling, multi-objective optimization

Procedia PDF Downloads 332

Authors: Cemil Turan, Mohammad Shukri Salman

Abstract:

The convergence rate of the least-mean-square (LMS) algorithm deteriorates if the input signal to the filter is correlated. In a system identification problem, this convergence rate can be improved if the signal is white and/or if the system is sparse. We recently proposed a sparse transform domain LMS-type algorithm that uses a variable step-size for a sparse system identification. The proposed algorithm provided high performance even if the input signal is highly correlated. In this work, we investigate the performance of the proposed TD-LMS algorithm for a large number of filter tap which is also a critical issue for standard LMS algorithm. Additionally, the optimum value of the most important parameter is calculated for all experiments. Moreover, the convergence analysis of the proposed algorithm is provided. The performance of the proposed algorithm has been compared to different algorithms in a sparse system identification setting of different sparsity levels and different number of filter taps. Simulations have shown that the proposed algorithm has prominent performance compared to the other algorithms.

Keywords: adaptive filtering, sparse system identification, TD-LMS algorithm, VSSLMS algorithm

Procedia PDF Downloads 322

Authors: Omar Ramzi Jasim, Jalal Sultan Ashour

Abstract:

Production Planning or Master Production Schedule (MPS) is a key interface between marketing and manufacturing, since it links customer service directly to efficient use of production resources. Mismanagement of the MPS is considered as one of fundamental problems in operation and it can potentially lead to poor customer satisfaction. In this paper, a hybrid evolutionary algorithm (ICA-GA) is presented, which integrates the merits of both imperialist competitive algorithm (ICA) and genetic algorithm (GA) for solving multi-objective MPS problems. In the presented algorithm, the colonies in each empire has be represented a small population and communicate with each other using genetic operators. By testing on 5 production scenarios, the numerical results of ICA-GA algorithm show the efficiency and capabilities of the hybrid algorithm in finding the optimum solutions. The ICA-GA solutions yield the lower inventory level and keep customer satisfaction high and the required overtime is also lower, compared with results of GA and SA in all production scenarios.

Keywords: master production scheduling, genetic algorithm, imperialist competitive algorithm, hybrid algorithm

Procedia PDF Downloads 439

Authors: Jeryes Danial, Yosi Ben Asher

Abstract:

Algorithms for controlling a swarm of robots is an active research field, out of which cattle herding is one of the most complex problems to solve. In this paper, we derive an independent herding algorithm that is specifically designed for a swarm of quadcopters. The algorithm works by devising flight trajectories that cause the cows to run-away in the desired direction and hence herd cows that are distributed in a given field towards a common gathering point. Unlike previously proposed swarm herding algorithms, this algorithm does not use a flocking model but rather stars each cow separately. The effectiveness of this algorithm is verified experimentally using a simulator. We use a special set of experiments attempting to demonstrate that the herding times of this algorithm correspond to field diameter small constant regardless of the number of cows in the field. This is an optimal result indicating that the algorithm groups the cows into intermediate groups and herd them as one forming ever closing bigger groups.

Keywords: swarm, independent, distributed, algorithm

Procedia PDF Downloads 145

Authors: Sikander Singh Cheema, Jasmeen Kaur

Abstract:

In this paper, the concept of data mining is summarized and its one of the important process i.e KDD is summarized. The data mining based on Genetic Algorithm is researched in and ways to achieve the data mining Genetic Algorithm are surveyed. This paper also conducts a formal review on the area of data mining tasks and genetic algorithm in various fields.

Keywords: data mining, KDD, genetic algorithm, descriptive mining, predictive mining

Procedia PDF Downloads 564

Authors: F. Erdal, E. Dogan, F. E. Uz

Abstract:

In this study, firefly optimization based optimum design algorithm is presented for the grillage systems. Naming of the algorithm is derived from the fireflies, whose sense of movement is taken as a model in the development of the algorithm. Fireflies’ being unisex and attraction between each other constitute the basis of the algorithm. The design algorithm considers the displacement and strength constraints which are implemented from LRFD-AISC (Load and Resistance Factor Design-American Institute of Steel Construction). It selects the appropriate W (Wide Flange)-sections for the transverse and longitudinal beams of the grillage system among 272 discrete W-section designations given in LRFD-AISC so that the design limitations described in LRFD are satisfied and the weight of the system is confined to be minimal. Number of design examples is considered to demonstrate the efficiency of the algorithm presented.

Keywords: firefly algorithm, steel grillage systems, optimum design, stochastic search techniques

Procedia PDF Downloads 393