Search results for: genetic algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 4629

Search results for: genetic algorithm

4269 Improved Whale Algorithm Based on Information Entropy and Its Application in Truss Structure Optimization Design

Authors: Serges Mendomo Meye, Li Guowei, Shen Zhenzhong, Gan Lei, Xu Liqun

Abstract:

Given the limitations of the original whale optimization algorithm (WAO) in local optimum and low convergence accuracy in truss structure optimization problems, based on the fundamental whale algorithm, an improved whale optimization algorithm (SWAO) based on information entropy is proposed. The information entropy itself is an uncertain measure. It is used to control the range of whale searches in path selection. It can overcome the shortcomings of the basic whale optimization algorithm (WAO) and can improve the global convergence speed of the algorithm. Taking truss structure as the optimization research object, the mathematical model of truss structure optimization is established; the cross-sectional area of truss is taken as the design variable; the objective function is the weight of truss structure; and an improved whale optimization algorithm (SWAO) is used for optimization design, which provides a new idea and means for its application in large and complex engineering structure optimization design.

Keywords: information entropy, structural optimization, truss structure, whale algorithm

Procedia PDF Downloads 211
4268 Integrated Location-Allocation Planning in Multi Product Multi Echelon Single Period Closed Loop Supply Chain Network Design

Authors: Santhosh Srinivasan, Vipul Garhiya, Shahul Hamid Khan

Abstract:

Environmental performance along with social performance is becoming vital factors for industries to achieve global standards. With a good environmental policy global industries are differentiating them from their competitors. This paper concentrates on multi stage, multi product and multi period manufacturing network. Single objective mathematical models for a total cost for the entire forward supply chain and reverse chain are considered. Here five different problems are considered by varying the number of facilities for illustration. M-MOGA, Shuffle Frog Leaping algorithm (SFLA) and CPLEX are used for finding the optimal solution for the mathematical model.

Keywords: closed loop supply chain, genetic algorithm, random search, multi period, green supply chain

Procedia PDF Downloads 366
4267 Parallel Version of Reinhard’s Color Transfer Algorithm

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 583
4266 A Filtering Algorithm for a Nonlinear State-Space Model

Authors: Abdullah Eqal Al Mazrooei

Abstract:

Kalman filter is a famous algorithm that utilizes to estimate the state in the linear systems. It has numerous applications in technology and science. Since of the most of applications in real life can be described by nonlinear systems. So, Kalman filter does not work with the nonlinear systems because it is suitable to linear systems only. In this work, a nonlinear filtering algorithm is presented which is suitable to use with the special kinds of nonlinear systems. This filter generalizes the Kalman filter. This means that this filter also can be used for the linear systems. Our algorithm depends on a special linearization of the second degree. We introduced the nonlinear algorithm with a bilinear state-space model. A simulation example is presented to illustrate the efficiency of the algorithm.

Keywords: Kalman filter, filtering algorithm, nonlinear systems, state-space model

Procedia PDF Downloads 347
4265 Chemical Reaction Algorithm for Expectation Maximization Clustering

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems.

Keywords: chemical reaction optimization, expection maimization, initia, objective function clustering

Procedia PDF Downloads 682
4264 Genetic Algorithms Multi-Objective Model for Project Scheduling

Authors: Elsheikh Asser

Abstract:

Time and cost are the main goals of the construction project management. The first schedule developed may not be a suitable schedule for beginning or completing the project to achieve the target completion time at a minimum total cost. In general, there are trade-offs between time and cost (TCT) to complete the activities of a project. This research presents genetic algorithms (GAs) multi-objective model for project scheduling considering different scenarios such as least cost, least time, and target time.

Keywords: genetic algorithms, time-cost trade-off, multi-objective model, project scheduling

Procedia PDF Downloads 394
4263 Optimizing Volume Fraction Variation Profile of Bidirectional Functionally Graded Circular Plate under Mechanical Loading to Minimize Its Stresses

Authors: Javad Jamali Khouei, Mohammadreza Khoshravan

Abstract:

Considering that application of functionally graded material is increasing in most industries, it seems necessary to present a methodology for designing optimal profile of structures such as plate under mechanical loading which is highly consumed in industries. Therefore, volume fraction variation profile of functionally graded circular plate which has been considered two-directional is optimized so that stress of structure is minimized. For this purpose, equilibrium equations of two-directional functionally graded circular plate are solved by applying semi analytical-numerical method under mechanical loading and support conditions. By solving equilibrium equations, deflections and stresses are obtained in terms of control variables of volume fraction variation profile. As a result, the problem formula can be defined as an optimization problem by aiming at minimization of critical von-mises stress under constraints of deflections, stress and a physical constraint relating to structure of material. Then, the related problem can be solved with help of one of the metaheuristic algorithms such as genetic algorithm. Results of optimization for the applied model under constraints and loadings and boundary conditions show that functionally graded plate should be graded only in radial direction and there is no need for volume fraction variation of the constituent particles in thickness direction. For validating results, optimal values of the obtained design variables are graphically evaluated.

Keywords: two-directional functionally graded material, single objective optimization, semi analytical-numerical solution, genetic algorithm, graphical solution with contour

Procedia PDF Downloads 255
4262 Agro Morphological Characterization of Vicia faba L. Accessions in the Kingdom of Saudi Arabia

Authors: Zia Amjad, Salem Safar Alghamdi

Abstract:

This experiment was carried out at student educational farm College of Food and Agriculture, KSU, kingdom of Saudi Arabia; in order to characterize 154 Vicia faba, characterization, PCA, ago-morphological diversity. Icia faba L. accessions were based on ipove and ibpgr descriptors. 24 agro-morphological characters including 11 quantitative and 13 qualitative were observed for genetic variation. All the results were analyzed using multivariate analysis i.e. principle component analysis. First 6 principle components with eigenvalue greater than one; accounted for 72% of available Vicia faba genetic diversity. However, first three components revealed more than 10% of genetic diversity each i.e. 22.36%, 15.86%, and 10.89% respectively. PCA distributed the V. faba accessions into different groups based on their performance for the characters under observation. PC-1 which represented 22.36% of the genetic diversity was positively associated with stipule spot pigmentation, intensity of streaks, pod degree of curvature and to some extent with 100 seed weight. PC-2 covered 15.86 of the genetic diversity and showed positive association for average seed weight per plant, pod length, number of seeds per plant, 100 seed weight, stipule spot pigmentation, intensity of streaks (same as in PC-1), and to some extent for pod degree of curvature and number of pods per plant. PC-3 revealed 10.89% of genetic diversity and expressed positive association for number of pods per plant and number of leaflets per plant.

Keywords: Vicia faba, characterization, PCA, ago-morphological diversity

Procedia PDF Downloads 422
4261 Influence of ABCB1 2677G > T Single Nucleotide Polymorphism on Warfarin Maintenance Therapy among Patients with Prosthetic Heart Valve

Authors: M. G. Gopisankar, A. Surendiran, M. Hemachandren

Abstract:

The dose requirement of warfarin to achieve target INR range varies in patients with prosthetic heart valve. This variation in is affected by both genetic and non-genetic factors. Earlier studies have identified role of CYP2C9 and VKORC1 genetic polymorphisms on warfarin dose requirement. Warfarin being a substrate for drug transporter, P-glycoprotein coded by ABCB1 gene, may also be influenced by its genetic polymorphisms. This study was aimed to study the effect of single nucleotide polymorphism (SNP), ABCB1 2677G > T on warfarin maintenance dose requirement in patients with steady-state International Normalized Ratio (INR). The median dose requirement was significantly different between the genotype groups GG vs. GT (35 ± 20; 42.5 ± 18, p < 0.05), GG vs. TT (35 ± 20; 41.25 ± 25, p<0.05). There was no significant difference between GT vs. TT. In conclusion, patients with variant allele require a higher weekly maintenance dose of warfarin compared to patients without variant allele.

Keywords: warfarin pharamcogenetics, pharmacogenomics of warfarin, ABCB1 and warfarin, pglycoprotein and warfarin

Procedia PDF Downloads 228
4260 Improved FP-Growth Algorithm with Multiple Minimum Supports Using Maximum Constraints

Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam

Abstract:

Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FP-growth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.

Keywords: association rules, FP-growth, multiple minimum supports, Weka tool

Procedia PDF Downloads 449
4259 Multiclass Support Vector Machines with Simultaneous Multi-Factors Optimization for Corporate Credit Ratings

Authors: Hyunchul Ahn, William X. S. Wong

Abstract:

Corporate credit rating prediction is one of the most important topics, which has been studied by researchers in the last decade. Over the last decade, researchers are pushing the limit to enhance the exactness of the corporate credit rating prediction model by applying several data-driven tools including statistical and artificial intelligence methods. Among them, multiclass support vector machine (MSVM) has been widely applied due to its good predictability. However, heuristics, for example, parameters of a kernel function, appropriate feature and instance subset, has become the main reason for the critics on MSVM, as they have dictate the MSVM architectural variables. This study presents a hybrid MSVM model that is intended to optimize all the parameter such as feature selection, instance selection, and kernel parameter. Our model adopts genetic algorithm (GA) to simultaneously optimize multiple heterogeneous design factors of MSVM.

Keywords: corporate credit rating prediction, Feature selection, genetic algorithms, instance selection, multiclass support vector machines

Procedia PDF Downloads 265
4258 Genetic Diversity of Wild Population of Heterobranchus Spp. Based on Mitochondria DNA Cytochrome C Oxidase Subunit I Gene Analysis

Authors: M. Y. Abubakar, Ipinjolu J. K., Yuzine B. Esa, Magawata I., Hassan W. A., Turaki A. A.

Abstract:

Catfish (Heterobranchus spp.) is a major freshwater fish that are widely distributed in Nigeria waters and are gaining rapid aquaculture expansion. However, indiscriminate artificial crossbreeding of the species with others poses a threat to their biodiversity. There is a paucity of information about the genetic variability, hence this insight on the genetic variability is badly needed, not only for the species conservation but for aquaculture expansion. In this study, we tested the level of Genetic diversity, population differentiation and phylogenetic relationship analysis on 35 individuals of two populations of Heterobranchus bidorsalis and 29 individuals of three populations of Heterobranchus longifilis using the mitochondrial cytochrome c oxidase subunit I (mtDNA COI) gene sequence. Nucleotide sequences of 650 bp fragment of the COI gene of the two species were compared. In the whole 4 and 5 haplotypes were distinguished in the populations of H. bidorsalis & H. longifilis with accession numbers (MG334168 - MG334171 & MG334172 to MG334176) respectively. Haplotypes diversity indices revealed a range of 0.59 ± 0.08 to 0.57 ± 0.09 in H. bidorsalis and 0.000 to 0.001051 ± 0.000945 in H. longifilis population, respectively. Analysis of molecular variance (AMOVA) revealed no significant variation among H. bidorsalis population of the Niger & Benue Rivers, detected significant genetic variation was between the Rivers of Niger, Kaduna and Benue population of H. longifilis. Two main clades were recovered, showing a clear separation between H. bidorsalis and H. longifilis in the phylogenetic tree. The mtDNA COI genes studied revealed high gene flow between populations with no distinct genetic differentiation between the populations as measured by the fixation index (FST) statistic. However, a proportion of population-specific haplotypes was observed in the two species studied, suggesting a substantial degree of genetic distinctiveness for each of the population investigated. These findings present the description of the species character and accessions of the fish’s genetic resources, through gene sequence submitted in Genetic database. The data will help to protect their valuable wild resource and contribute to their recovery and selective breeding in Nigeria.

Keywords: AMOVA, genetic diversity, Heterobranchus spp., mtDNA COI, phylogenetic tree

Procedia PDF Downloads 114
4257 Investigation of Genetic Variation among Anemone narcissiflora L. Population Using PCR-RAPD Molecular Marker

Authors: Somayeh Akrami, Habib Onsori, Elham Tahmassebian

Abstract:

Species of Anemone narcissiflora is belonged to Anemone genus of Ranunculaceae family. This species has two subspecies named narcissiflora and willdenowii which the latest is recorded in Iran in 2010. Some samples of A. narcissiflora is gathered from kuhkamar-zonouz region of East -Azerbaijan province, Iran to study the genetic diversity of the species by using RAPD molecular markers, and estimation of genetic diversity were evaluated with the using 10mer RAPD primers by PCR-RAPD method. 39 polymorphic bands were produced from the six primers used in this technique that the maximum band is related to the RP1 primer, the lowest band is related to the RP7 and the average band for all primers were 6.5 polymorphic bands. Cluster analysis of samples in done by UPGMA method in NTSYSpc 2.02 software. Dendrogram resulting from migrating bands showed that the studied samples can be divided into two groups. The first group includes samples with 1-2 flowers and the second group consists of two sub-groups which the first subgroup consists of samples with 3-5 flowers, and the second subgroup consists of samples with 6-7 flowers. The results of the comparison and analysis of the data obtained from RAPD technique and similarity matrix represents the genetic variation between collected samples. This study shows that RAPD markers can determine the polymorphisms between different genotypes of A. narcissiflora and their hybrids. So RAPD technique can serve as a suitable molecular method to determine the genetic diversity of samples.

Keywords: Anemone narcissiflora, genetic diversity, RAPD-PCR

Procedia PDF Downloads 449
4256 A Piebald Cladistic Portray of Mitochondrial DNA Control Region Haplogroups in Khyber Pakhtunkhwa, Pakistan

Authors: Shahzad Bhatti, M. Aslamkhan, Sana Abbas, Marcella Attimonelli, Hikmet Hakan Aydin, Erica Martinha Silva de Souza,

Abstract:

Despite being situated at the crossroad of Asia, Pakistan has gained crucial importance because of its pivotal role in subsequent migratory events. To highlight the genetic footprints and to contribute an enigmatic picture of the relative population expansion pattern among four major Pashtun tribes in Khyber Pakhtunkhwa viz., Bangash, Khattak, Mahsuds and Orakzai, the complete mitochondrial control region of 100 Pashtun were analyzed. All Pashtun tribes studied here revealed high genetic diversity; that was comparable to the other Central Asian, Southeast Asian and European populations. The configuration of genetic variation and heterogeneity further unveiled through Multidimensional Scaling, Principal Component Analysis, and phylogenetic analysis. The results revealed that the Pashtun is a composite mosaic of West Eurasian ancestry of numerous geographic origin. They received substantial gene flow during different invasions and have a high element of the Western provenance. The most common haplogroups reported in this study are: South Asian haplogroup M (28%) and R (8%); whereas, West Asians haplogroups are present, albeit in high frequencies (67%) and widespread over all; HV (15%), U (17%), H (9%), J (8%), K (8%), W (4%), N (3%) and T (3%). Herein we linked the unexplored genetic connection between Ashkenazi Jews and Pashtun. The presence of specific haplotypes J1b (4%) and K1a1b1a (5%) point to a genetic connection of Jewish conglomeration with Khattak tribe. This was a result of an ancient genetic influx in the early Neolithic period that led to the formation of a diverse genetic substratum in present day Pashtun.

Keywords: mtDNA haplogroups, control region, Pakistan, KPK, ethnicity

Procedia PDF Downloads 449
4255 A Rapid Code Acquisition Scheme in OOC-Based CDMA Systems

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 503
4254 Efficient Heuristic Algorithm to Speed Up Graphcut in Gpu for Image Stitching

Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran

Abstract:

GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.

Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm

Procedia PDF Downloads 95
4253 Development of a Software System for Management and Genetic Analysis of Biological Samples for Forensic Laboratories

Authors: Mariana Lima, Rodrigo Silva, Victor Stange, Teodiano Bastos

Abstract:

Due to the high reliability reached by DNA tests, since the 1980s this kind of test has allowed the identification of a growing number of criminal cases, including old cases that were unsolved, now having a chance to be solved with this technology. Currently, the use of genetic profiling databases is a typical method to increase the scope of genetic comparison. Forensic laboratories must process, analyze, and generate genetic profiles of a growing number of samples, which require time and great storage capacity. Therefore, it is essential to develop methodologies capable to organize and minimize the spent time for both biological sample processing and analysis of genetic profiles, using software tools. Thus, the present work aims the development of a software system solution for laboratories of forensics genetics, which allows sample, criminal case and local database management, minimizing the time spent in the workflow and helps to compare genetic profiles. For the development of this software system, all data related to the storage and processing of samples, workflows and requirements that incorporate the system have been considered. The system uses the following software languages: HTML, CSS, and JavaScript in Web technology, with NodeJS platform as server, which has great efficiency in the input and output of data. In addition, the data are stored in a relational database (MySQL), which is free, allowing a better acceptance for users. The software system here developed allows more agility to the workflow and analysis of samples, contributing to the rapid insertion of the genetic profiles in the national database and to increase resolution of crimes. The next step of this research is its validation, in order to operate in accordance with current Brazilian national legislation.

Keywords: database, forensic genetics, genetic analysis, sample management, software solution

Procedia PDF Downloads 345
4252 Milk Protein Genetic Variation and Haplotype Structure in Sudanse Indigenous Dairy Zebu Cattle

Authors: Ammar Said Ahmed, M. Reissmann, R. Bortfeldt, G. A. Brockmann

Abstract:

Milk protein genetic variants are of interest for characterizing domesticated mammalian species and breeds, and for studying associations with economic traits. The aim of this work was to analyze milk protein genetic variation in the Sudanese native cattle breeds, which have been gradually declining in numbers over the last years due to the breed substitution, and indiscriminate crossbreeding. The genetic variation at three milk protein genes αS1-casein (CSN1S1), αS2-casein (CSN1S2) and ƙ-casein (CSN3) was investigated in 250 animals belonging to five Bos indicus cattle breeds of Sudan (Butana, Kenana, White-nile, Erashy and Elgash). Allele specific primers were designed for five SNPs determine the CSN1S1 variants B and C, the CSN1S2 variants A and B, the CSN3 variants A, B and H. Allele, haplotype frequencies and genetic distances (D) were calculated and the phylogenetic tree was constructed. All breeds were found to be polymorphic for the studied genes. The CSN1S1*C variant was found very frequently (>0.63) in all analyzed breeds with highest frequency (0.82) in White-nile cattle. The CSN1S2*A variant (0.77) and CSN3*A variant (0.79) had highest frequency in Kenana cattle. Eleven haplotypes in casein gene cluster were inferred. Six of all haplotypes occurred in all breeds with remarkably deferent frequencies. The estimated D ranged from 0.004 to 0.049. The most distant breeds were White-nile and Kenana (D 0.0479). The results presented contribute to the genetic knowledge of indigenous cattle and can be used for proper definition and classification of the Sudanese cattle breeds as well as breeding, utilization, and potential development of conservation strategies for local breeds.

Keywords: milk protein, genetic variation, casein haplotype, Bos indicus

Procedia PDF Downloads 402
4251 Travel Planning in Public Transport Networks Applying the Algorithm A* for Metropolitan District of Quito

Authors: M. Fernanda Salgado, Alfonso Tierra, Wilbert Aguilar

Abstract:

The present project consists in applying the informed search algorithm A star (A*) to solve traveler problems, applying it by urban public transportation routes. The digitization of the information allowed to identify 26% of the total of routes that are registered within the Metropolitan District of Quito. For the validation of this information, data were taken in field on the travel times and the difference with respect to the times estimated by the program, resulting in that the difference between them was not greater than 2:20 minutes. We validate A* algorithm with the Dijkstra algorithm, comparing nodes vectors based on the public transport stops, the validation was established through the student t-test hypothesis. Then we verified that the times estimated by the program using the A* algorithm are similar to those registered on field. Furthermore, we review the performance of the algorithm generating iterations in both algorithms. Finally, with these iterations, a hypothesis test was carried out again with student t-test where it was concluded that the iterations of the base algorithm Dijsktra are greater than those generated by the algorithm A*.

Keywords: algorithm A*, graph, mobility, public transport, travel planning, routes

Procedia PDF Downloads 209
4250 Research and Development of Intelligent Cooling Channels Design System

Authors: Q. Niu, X. H. Zhou, W. Liu

Abstract:

The cooling channels of injection mould play a crucial role in determining the productivity of moulding process and the product quality. It’s not a simple task to design high quality cooling channels. In this paper, an intelligent cooling channels design system including automatic layout of cooling channels, interference checking and assembly of accessories is studied. Automatic layout of cooling channels using genetic algorithm is analyzed. Through integrating experience criteria of designing cooling channels, considering the factors such as the mould temperature and interference checking, the automatic layout of cooling channels is implemented. The method of checking interference based on distance constraint algorithm and the function of automatic and continuous assembly of accessories are developed and integrated into the system. Case studies demonstrate the feasibility and practicality of the intelligent design system.

Keywords: injection mould, cooling channel, intelligent design, automatic layout, interference checking

Procedia PDF Downloads 406
4249 Molecular and Phytochemical Fingerprinting of Anti-Cancer Drug Yielding Plants in South India

Authors: Alexis John de Britto

Abstract:

Studies were performed to select the superior genotypes based on intra-specific variations, caused by phytogeographical, climatic and edaphic parameters of three anti cancer drug yielding mangrove plants such as Acanthus ilicifolius L., Calophyllum inophyllum L. and Excoecaria agallocha L. using ISSR (Inter Simple Sequence Repeats) markers and phytochemical analysis such as preliminary phytochemical tests, TLC, HPTLC, HPLC and antioxidant tests. The plants were collected from five different geographical locations of the East Coast of south India. Genetic heterozygosity, Nei’s gene diversity, Shannon’s information index and Percentage of polymorphism between the populations were calculated using POPGENE software. Cluster analysis was performed using UPGMA algorithm. AMOVA and correlations between genetic diversity and soil factors were analyzed. Combining the molecular and phytochemical variations superior genotypes were selected. Conservation constraints and methods of efficient exploitation of the species are discussed.

Keywords: anti-cancer drug yielding plants, DNA fingerprinting, phytochemical analysis, selection of superior genotypes

Procedia PDF Downloads 303
4248 Rainfall-Runoff Forecasting Utilizing Genetic Programming Technique

Authors: Ahmed Najah Ahmed Al-Mahfoodh, Ali Najah Ahmed Al-Mahfoodh, Ahmed Al-Shafie

Abstract:

In this study, genetic programming (GP) technique has been investigated in prediction of set of rainfall-runoff data. To assess the effect of input parameters on the model, the sensitivity analysis was adopted. To evaluate the performance of the proposed model, three statistical indexes were used, namely; Correlation Coefficient (CC), Mean Square Error (MSE) and Correlation of Efficiency (CE). The principle aim of this study is to develop a computationally efficient and robust approach for predict of rainfall-runoff which could reduce the cost and labour for measuring these parameters. This research concentrates on the Johor River in Johor State, Malaysia.

Keywords: genetic programming, prediction, rainfall-runoff, Malaysia

Procedia PDF Downloads 445
4247 An Improved C-Means Model for MRI Segmentation

Authors: Ying Shen, Weihua Zhu

Abstract:

Medical images are important to help identifying different diseases, for example, Magnetic resonance imaging (MRI) can be used to investigate the brain, spinal cord, bones, joints, breasts, blood vessels, and heart. Image segmentation, in medical image analysis, is usually the first step to find out some characteristics with similar color, intensity or texture so that the diagnosis could be further carried out based on these features. This paper introduces an improved C-means model to segment the MRI images. The model is based on information entropy to evaluate the segmentation results by achieving global optimization. Several contributions are significant. Firstly, Genetic Algorithm (GA) is used for achieving global optimization in this model where fuzzy C-means clustering algorithm (FCMA) is not capable of doing that. Secondly, the information entropy after segmentation is used for measuring the effectiveness of MRI image processing. Experimental results show the outperformance of the proposed model by comparing with traditional approaches.

Keywords: magnetic resonance image (MRI), c-means model, image segmentation, information entropy

Procedia PDF Downloads 203
4246 The Use of Medical Biotechnology to Treat Genetic Disease

Authors: Rachel Matar, Maxime Merheb

Abstract:

Chemical drugs have been used for many centuries as the only way to cure diseases until the novel gene therapy has been created in 1960. Gene therapy is based on the insertion, correction, or inactivation of genes to treat people with genetic illness (1). Gene therapy has made wonders in Parkison’s, Alzheimer and multiple sclerosis. In addition to great promises in the healing of deadly diseases like many types of cancer and autoimmune diseases (2). This method implies the use of recombinant DNA technology with the help of different viral and non-viral vectors (3). It is nowadays used in somatic cells as well as embryos and gametes. Beside all the benefits of gene therapy, this technique is deemed by some opponents as an ethically unacceptable treatment as it implies playing with the genes of living organisms.

Keywords: gene therapy, genetic disease, cancer, multiple sclerosis

Procedia PDF Downloads 503
4245 A Bio-Inspired Approach for Self-Managing Wireless Sensor and Actor Networks

Authors: Lyamine Guezouli, Kamel Barka, Zineb Seghir

Abstract:

Wireless sensor and actor networks (WSANs) present a research challenge for different practice areas. Researchers are trying to optimize the use of such networks through their research work. This optimization is done on certain criteria, such as improving energy efficiency, exploiting node heterogeneity, self-adaptability and self-configuration. In this article, we present our proposal for BIFSA (Biologically-Inspired Framework for Wireless Sensor and Actor networks). Indeed, BIFSA is a middleware that addresses the key issues of wireless sensor and actor networks. BIFSA consists of two types of agents: sensor agents (SA) that operate at the sensor level to collect and transport data to actors and actor agents (AA) that operate at the actor level to transport data to base stations. Once the sensor agent arrives at the actor, it becomes an actor agent, which can exploit the resources of the actors and vice versa. BIFSA allows agents to evolve their genetic structures and adapt to the current network conditions. The simulation results show that BIFSA allows the agents to make better use of all the resources available in each type of node, which improves the performance of the network.

Keywords: wireless sensor and actor networks, self-management, genetic algorithm, agent.

Procedia PDF Downloads 58
4244 An Evolutionary Approach for Automated Optimization and Design of Vivaldi Antennas

Authors: Sahithi Yarlagadda

Abstract:

The design of antenna is constrained by mathematical and geometrical parameters. Though there are diverse antenna structures with wide range of feeds yet, there are many geometries to be tried, which cannot be customized into predefined computational methods. The antenna design and optimization qualify to apply evolutionary algorithmic approach since the antenna parameters weights dependent on geometric characteristics directly. The evolutionary algorithm can be explained simply for a given quality function to be maximized. We can randomly create a set of candidate solutions, elements of the function's domain, and apply the quality function as an abstract fitness measure. Based on this fitness, some of the better candidates are chosen to seed the next generation by applying recombination and permutation to them. In conventional approach, the quality function is unaltered for any iteration. But the antenna parameters and geometries are wide to fit into single function. So, the weight coefficients are obtained for all possible antenna electrical parameters and geometries; the variation is learnt by mining the data obtained for an optimized algorithm. The weight and covariant coefficients of corresponding parameters are logged for learning and future use as datasets. This paper drafts an approach to obtain the requirements to study and methodize the evolutionary approach to automated antenna design for our past work on Vivaldi antenna as test candidate. The antenna parameters like gain, directivity, etc. are directly caged by geometries, materials, and dimensions. The design equations are to be noted here and valuated for all possible conditions to get maxima and minima for given frequency band. The boundary conditions are thus obtained prior to implementation, easing the optimization. The implementation mainly aimed to study the practical computational, processing, and design complexities that incur while simulations. HFSS is chosen for simulations and results. MATLAB is used to generate the computations, combinations, and data logging. MATLAB is also used to apply machine learning algorithms and plotting the data to design the algorithm. The number of combinations is to be tested manually, so HFSS API is used to call HFSS functions from MATLAB itself. MATLAB parallel processing tool box is used to run multiple simulations in parallel. The aim is to develop an add-in to antenna design software like HFSS, CSTor, a standalone application to optimize pre-identified common parameters of wide range of antennas available. In this paper, we have used MATLAB to calculate Vivaldi antenna parameters like slot line characteristic impedance, impedance of stripline, slot line width, flare aperture size, dielectric and K means, and Hamming window are applied to obtain the best test parameters. HFSS API is used to calculate the radiation, bandwidth, directivity, and efficiency, and data is logged for applying the Evolutionary genetic algorithm in MATLAB. The paper demonstrates the computational weights and Machine Learning approach for automated antenna optimizing for Vivaldi antenna.

Keywords: machine learning, Vivaldi, evolutionary algorithm, genetic algorithm

Procedia PDF Downloads 84
4243 Study of the Influence of Non Genetic Factors Affecting over Nutrition Students in Ayutthaya Province, Thailand

Authors: Thananyada Buapian

Abstract:

Overnutrition is emerging as a morbid disease in developing and Westernized countries. Because of its comorbidity diseases, it is cost-effective to prevent and manage this disease earlier. In Thailand, this alarming disease has long been studied, but the prevalence is still higher than that in the past. Physicians should recognize it well and have a definite direction to face and combat this dangerous disease. Rapid changes in the tremendous figure of overnutrition students indicate that genetic factors are not the primary determinants since human genes have remained unchanged for a century. This study aims to assess the prevalence of overnutrition students and to investigate the non-genetic factors affecting over nutrition students. A cross-sectional school-based survey was conducted. A two-stage sampling was adopted. Respondents included 1,850 students in grades 4 to 6 in Ayutthaya Province. An anthropometric measurement and questionnaire were developed. Childhood over nutrition was defined as a weight-for-height Z-score above +2SD of NCHS/WHO references. About thirty three percent of the children were over nutrition in Ayutthaya province. Stepwise multiple logistic regression analysis showed that 8 statistically significant non genetic factors explain the variation of childhood over nutrition by 18 percent. Sex is the prime factor to explain the variation of childhood over nutrition, followed by duration of light physical activities, duration of moderate physical activities, having been breastfed, the presence of a healthy role model of the caregiver, number of siblings, birth order, and occupation of the caregiver, respectively. Non genetic factors, especially the subjects’ demographic and physical activities, as well as the caregivers’ background and family environment, should be considered in viable approach to remedy this health imbalance in children.

Keywords: non genetic factors, non-genetic, over nutrition, over nutrition students

Procedia PDF Downloads 251
4242 A Speeded up Robust Scale-Invariant Feature Transform Currency Recognition Algorithm

Authors: Daliyah S. Aljutaili, Redna A. Almutlaq, Suha A. Alharbi, Dina M. Ibrahim

Abstract:

All currencies around the world look very different from each other. For instance, the size, color, and pattern of the paper are different. With the development of modern banking services, automatic methods for paper currency recognition become important in many applications like vending machines. One of the currency recognition architecture’s phases is Feature detection and description. There are many algorithms that are used for this phase, but they still have some disadvantages. This paper proposes a feature detection algorithm, which merges the advantages given in the current SIFT and SURF algorithms, which we call, Speeded up Robust Scale-Invariant Feature Transform (SR-SIFT) algorithm. Our proposed SR-SIFT algorithm overcomes the problems of both the SIFT and SURF algorithms. The proposed algorithm aims to speed up the SIFT feature detection algorithm and keep it robust. Simulation results demonstrate that the proposed SR-SIFT algorithm decreases the average response time, especially in small and minimum number of best key points, increases the distribution of the number of best key points on the surface of the currency. Furthermore, the proposed algorithm increases the accuracy of the true best point distribution inside the currency edge than the other two algorithms.

Keywords: currency recognition, feature detection and description, SIFT algorithm, SURF algorithm, speeded up and robust features

Procedia PDF Downloads 209
4241 Selecting the Best RBF Neural Network Using PSO Algorithm for ECG Signal Prediction

Authors: Najmeh Mohsenifar, Narjes Mohsenifar, Abbas Kargar

Abstract:

In this paper, has been presented a stable method for predicting the ECG signals through the RBF neural networks, by the PSO algorithm. In spite of quasi-periodic ECG signal from a healthy person, there are distortions in electro cardiographic data for a patient. Therefore, there is no precise mathematical model for prediction. Here, we have exploited neural networks that are capable of complicated nonlinear mapping. Although the architecture and spread of RBF networks are usually selected through trial and error, the PSO algorithm has been used for choosing the best neural network. In this way, 2 second of a recorded ECG signal is employed to predict duration of 20 second in advance. Our simulations show that PSO algorithm can find the RBF neural network with minimum MSE and the accuracy of the predicted ECG signal is 97 %.

Keywords: electrocardiogram, RBF artificial neural network, PSO algorithm, predict, accuracy

Procedia PDF Downloads 591
4240 Application of a New Efficient Normal Parameter Reduction Algorithm of Soft Sets in Online Shopping

Authors: Xiuqin Ma, Hongwu Qin

Abstract:

A new efficient normal parameter reduction algorithm of soft set in decision making was proposed. However, up to the present, few documents have focused on real-life applications of this algorithm. Accordingly, we apply a New Efficient Normal Parameter Reduction algorithm into real-life datasets of online shopping, such as Blackberry Mobile Phone Dataset. Experimental results show that this algorithm is not only suitable but feasible for dealing with the online shopping.

Keywords: soft sets, parameter reduction, normal parameter reduction, online shopping

Procedia PDF Downloads 485