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

Search results for: Lamarkian genetic algorithm

4140 Power Allocation Algorithm for Orthogonal Frequency Division Multiplexing Based Cognitive Radio Networks

Authors: Bircan Demiral

Abstract:

Cognitive radio (CR) is the promising technology that addresses the spectrum scarcity problem for future wireless communications. Orthogonal Frequency Division Multiplexing (OFDM) technology provides more power band ratios for cognitive radio networks (CRNs). While CR is a solution to the spectrum scarcity, it also brings up the capacity problem. In this paper, a novel power allocation algorithm that aims at maximizing the sum capacity in the OFDM based cognitive radio networks is proposed. Proposed allocation algorithm is based on the previously developed water-filling algorithm. To reduce the computational complexity calculating in water filling algorithm, proposed algorithm allocates the total power according to each subcarrier. The power allocated to the subcarriers increases sum capacity. To see this increase, Matlab program was used, and the proposed power allocation was compared with average power allocation, water filling and general power allocation algorithms. The water filling algorithm performed worse than the proposed algorithm while it performed better than the other two algorithms. The proposed algorithm is better than other algorithms in terms of capacity increase. In addition the effect of the change in the number of subcarriers on capacity was discussed. Simulation results show that the increase in the number of subcarrier increases the capacity.

Keywords: cognitive radio network, OFDM, power allocation, water filling

Procedia PDF Downloads 119
4139 The Impact of P108L Genetic Variant on Calcium Release and Malignant Hyperthermia Susceptibility

Authors: Mohammed Althobiti, Patrick Booms, Dorota Fiszer, Philip Hopkins

Abstract:

Malignant hyperthermia (MH) is a pharmacogenetic disorder of skeletal muscle. MH results from anaesthetics induced breakdown of calcium homeostasis. RYR1 and CACN1AS mutations represent the aetiology in ~70% of the MH population. Previous studies indicate that up to 25% of MH patients carry no variants in these genes. Therefore, the aim of this study is to investigate the relationships between MH susceptibility and genes encoding skeletal muscle Ca2+ channels as well as accessory proteins. The JSRP, encoding JP-45, was previously sequenced and novel genetic variants were identified. The variant p.P108L (c.323C > T) was identified in exon 4 and encodes a change from a proline at amino acid 108 to leucine residue. The variant P108L was detected in two patients out of 50 with 4% frequency in the sample population. The alignment of DNA sequences in different species indicates highly conserved proline sequences involved in the substitution of the P108L variant. In this study, the variant P108L co-segregates with the SNP p.V92A (c.275T > C) at the same exon, both variants being inherited in the same two patients only. This indicates that the two variants may represent a haplotype. Therefore, a set of single nucleotide polymorphisms and statistical analysis will be used to investigate the effects of haplotypes on MH susceptibility. Furthermore, investigating the effect of the P108L variant in combination with RYR1 mutations or other genetic variants in other genes as a combination of two or more genetic variants, haplotypes may then provide stronger genetic evidence indicating that JSRP1 is associated with MH susceptibility. In conclusion, these preliminary results lend a potential modifier role of the variant P108L in JSRP1 in MH susceptibility and further investigations are suggested to confirm these results.

Keywords: JSRP1, malignant hyperthermia, RyR1, skeletal muscle

Procedia PDF Downloads 313
4138 Multi-Objective Variable Neighborhood Search Algorithm to Solving Scheduling Problem with Transportation Times

Authors: Majid Khalili

Abstract:

This paper deals with a bi-objective hybrid no-wait flowshop scheduling problem minimizing the makespan and total weighted tardiness, in which we consider transportation times between stages. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. This paper presents a new multi-objective variable neighborhood algorithm (MOVNS). A set of experimental instances are carried out to evaluate the algorithm by advanced multi-objective performance measures. The algorithm is carefully evaluated for its performance against available algorithm by means of multi-objective performance measures and statistical tools. The related results show that a variant of our proposed MOVNS provides sound performance comparing with other algorithms.

Keywords: no-wait hybrid flowshop scheduling; multi-objective variable neighborhood algorithm; makespan; total weighted tardiness

Procedia PDF Downloads 400
4137 Simulation of 3-D Direction-of-Arrival Estimation Using MUSIC Algorithm

Authors: Duckyong Kim, Jong Kang Park, Jong Tae Kim

Abstract:

DOA (Direction of Arrival) estimation is an important method in array signal processing and has a wide range of applications such as direction finding, beam forming, and so on. In this paper, we briefly introduce the MUSIC (Multiple Signal Classification) Algorithm, one of DOA estimation methods for analyzing several targets. Then we apply the MUSIC algorithm to the two-dimensional antenna array to analyze DOA estimation in 3D space through MATLAB simulation. We also analyze the design factors that can affect the accuracy of DOA estimation through simulation, and proceed with further consideration on how to apply the system.

Keywords: DOA estimation, MUSIC algorithm, spatial spectrum, array signal processing

Procedia PDF Downloads 351
4136 Development and Verification of the Idom Shielding Optimization Tool

Authors: Omar Bouhassoun, Cristian Garrido, César Hueso

Abstract:

The radiation shielding design is an optimization problem with multiple -constrained- objective functions (radiation dose, weight, price, etc.) that depend on several parameters (material, thickness, position, etc.). The classical approach for shielding design consists of a brute force trial-and-error process subject to previous designer experience. Therefore, the result is an empirical solution but not optimal, which can degrade the overall performance of the shielding. In order to automate the shielding design procedure, the IDOM Shielding Optimization Tool (ISOT) has been developed. This software combines optimization algorithms with the capabilities to read/write input files, run calculations, as well as parse output files for different radiation transport codes. In the first stage, the software was established to adjust the input files for two well-known Monte Carlo codes (MCNP and Serpent) and optimize the result (weight, volume, price, dose rate) using multi-objective genetic algorithms. Nevertheless, its modular implementation easily allows the inclusion of more radiation transport codes and optimization algorithms. The work related to the development of ISOT and its verification on a simple 3D multi-layer shielding problem using both MCNP and Serpent will be presented. ISOT looks very promising for achieving an optimal solution to complex shielding problems.

Keywords: optimization, shielding, nuclear, genetic algorithm

Procedia PDF Downloads 91
4135 Evaluation of Antioxidant Activity as a Function of the Genetic Diversity of Canna indica Complex

Authors: A. Rattanapittayapron, O. Vanijajiva

Abstract:

Canna indica is a prominent species complex in tropical and subtropical areas. They become indigenous in Southeast Asia where they have been introduced. At present, C. indica complex comprises over hundred hybrids, are cultivated as commercial horticulture. The species complex contains starchy rhizome having economic value in terms of food and herbal medicine. In addition, bright color of the flowers makes it a valuable ornamental plant and potential source for natural colorant. This study aims to assess genetic diversity of four varieties of C. indica complex based on SRAP (sequence-related amplified polymorphism) and iPBS (inter primer binding site) markers. We also examined phytochemical characteristics and antioxidant properties of the flower extracts from four different color varieties. Results showed that despite of the genetic variation, there were no significant differences in phytochemical characteristics and antioxidant properties of flowers. The SRAP and iPBS results agree with the more primitive traits showed by morphological information and phytochemical and antioxidant characteristics from the flowers. Since Canna flowers has long been used as natural colorants together with the antioxidant activities from the ethanol extracts in this study, there are likely to be good source for cosmetics additives.

Keywords: Canna indica, antioxidant activity, genetic diversity, SRAP, iPBS

Procedia PDF Downloads 293
4134 A Combined Meta-Heuristic with Hyper-Heuristic Approach to Single Machine Production Scheduling Problem

Authors: C. E. Nugraheni, L. Abednego

Abstract:

This paper is concerned with minimization of mean tardiness and flow time in a real single machine production scheduling problem. Two variants of genetic algorithm as meta-heuristic are combined with hyper-heuristic approach are proposed to solve this problem. These methods are used to solve instances generated with real world data from a company. Encouraging results are reported.

Keywords: hyper-heuristics, evolutionary algorithms, production scheduling, meta-heuristic

Procedia PDF Downloads 362
4133 Part of Speech Tagging Using Statistical Approach for Nepali Text

Authors: Archit Yajnik

Abstract:

Part of Speech Tagging has always been a challenging task in the era of Natural Language Processing. This article presents POS tagging for Nepali text using Hidden Markov Model and Viterbi algorithm. From the Nepali text, annotated corpus training and testing data set are randomly separated. Both methods are employed on the data sets. Viterbi algorithm is found to be computationally faster and accurate as compared to HMM. The accuracy of 95.43% is achieved using Viterbi algorithm. Error analysis where the mismatches took place is elaborately discussed.

Keywords: hidden markov model, natural language processing, POS tagging, viterbi algorithm

Procedia PDF Downloads 308
4132 Implementation of Iterative Algorithm for Earthquake Location

Authors: Hussain K. Chaiel

Abstract:

The development in the field of the digital signal processing (DSP) and the microelectronics technology reduces the complexity of the iterative algorithms that need large number of arithmetic operations. Virtex-Field Programmable Gate Arrays (FPGAs) are programmable silicon foundations which offer an important solution for addressing the needs of high performance DSP designer. In this work, Virtex-7 FPGA technology is used to implement an iterative algorithm to estimate the earthquake location. Simulation results show that an implementation based on block RAMB36E1 and DSP48E1 slices of Virtex-7 type reduces the number of cycles of the clock frequency. This enables the algorithm to be used for earthquake prediction.

Keywords: DSP, earthquake, FPGA, iterative algorithm

Procedia PDF Downloads 362
4131 Phenological and Molecular Genetic Diversity Analysis among Saudi durum Wheat Landraces

Authors: Naser B. Almari, Salem S. Alghamdi, Muhammad Afzal, Mohamed Helmy El Shal

Abstract:

Wheat landraces are a rich genetic resource for boosting agronomic qualities in breeding programs while also providing diversity and unique adaptation to local environmental conditions. These genotypes have grown increasingly important in the face of recent climate change challenges. This research aimed to look at the genetic diversity of Saudi Durum wheat landraces using morpho-phenological and molecular data. The principal components analysis (PCA) analysis recorded 78.47 % variance and 1.064 eigenvalues for the first six PCs of the total, respectively. The significant characters contributed more to the diversity are the length of owns at the tip relative to the length of the ear, culm: glaucosity of the neck, flag leaf: glaucosity of the sheath, flag leaf: anthocyanin coloration of auricles, plant: frequency of plants with recurved flag leaves, ear: length, and ear: shape in profile in the PC1. The significant wheat genotypes contributed more in the PC1 (8, 14, 497, 650, 569, 590, 594, 598, 600, 601, and 604). The cluster analysis recorded an 85.42 cophenetic correlation among the 22 wheat genotypes and grouped the genotypes into two main groups. Group, I contain 8 genotypes, however, the 2nd group contains 12 wheat genotypes, while two genotypes (13 and 497) are standing alone in the dendrogram and unable to make a group with any one of the genotypes. The second group was subdivided into two subgroups. The genotypes (14, 602, and 600) were present in the second sub-group. The genotypes were grouped into two main groups. The first group contains 17 genotypes, while the second group contains 3 (8, 977, and 594) wheat genotypes. The genotype (602) was standing alone and unable to make a group with any wheat genotype. The genotypes 650 and 13 also stand alone in the first group. Using the Mantel test, the data recorded a significant (R2 = 0.0006) correlation (phenotypic and genetic) among 22 wheat durum genotypes.

Keywords: durum wheat, PCA, cluster analysis, SRAP, genetic diversity

Procedia PDF Downloads 92
4130 Alternative Key Exchange Algorithm Based on Elliptic Curve Digital Signature Algorithm Certificate and Usage in Applications

Authors: A. Andreasyan, C. Connors

Abstract:

The Elliptic Curve Digital Signature algorithm-based X509v3 certificates are becoming more popular due to their short public and private key sizes. Moreover, these certificates can be stored in Internet of Things (IoT) devices, with limited resources, using less memory and transmitted in network security protocols, such as Internet Key Exchange (IKE), Transport Layer Security (TLS) and Secure Shell (SSH) with less bandwidth. The proposed method gives another advantage, in that it increases the performance of the above-mentioned protocols in terms of key exchange by saving one scalar multiplication operation.

Keywords: cryptography, elliptic curve digital signature algorithm, key exchange, network security protocol

Procedia PDF Downloads 125
4129 Hybrid Gravity Gradient Inversion-Ant Colony Optimization Algorithm for Motion Planning of Mobile Robots

Authors: Meng Wu

Abstract:

Motion planning is a common task required to be fulfilled by robots. A strategy combining Ant Colony Optimization (ACO) and gravity gradient inversion algorithm is proposed for motion planning of mobile robots. In this paper, in order to realize optimal motion planning strategy, the cost function in ACO is designed based on gravity gradient inversion algorithm. The obstacles around mobile robot can cause gravity gradient anomalies; the gradiometer is installed on the mobile robot to detect the gravity gradient anomalies. After obtaining the anomalies, gravity gradient inversion algorithm is employed to calculate relative distance and orientation between mobile robot and obstacles. The relative distance and orientation deduced from gravity gradient inversion algorithm is employed as cost function in ACO algorithm to realize motion planning. The proposed strategy is validated by the simulation and experiment results.

Keywords: motion planning, gravity gradient inversion algorithm, ant colony optimization

Procedia PDF Downloads 124
4128 Application of ATP7B Gene Mutation Analysis in Prenatal Diagnosis of Wilson’s Disease

Authors: Huong M. T. Nguyen, Hoa A. P. Nguyen, Chi V. Phan, Mai P. T. Nguyen, Ngoc D. Ngo, Van T. Ta, Hai T. Le

Abstract:

Wilson’s disease is an autosomal recessive disorder of copper metabolism, which is caused by mutation in copper- transporting P-type ATPase (ATP7B). The mechanism of this disease is a failure of hepatic excretion of copper to the bile, and it leads to copper deposits in the liver and other organs. Most clinical symptoms of Wilson’s disease can present as liver disease and/or neurologic disease. Objective: The goal of the study is prenatal diagnosis for pregnant women at high risk of Wilson’s disease in Northern Vietnam. Material and method: Three probands with clinically diagnosed liver disease were detected in the mutations of 21 exons and exon-intron boundaries of the ATP7B gene by direct Sanger-sequencing. Prenatal diagnoses were performed by amniotic fluid sampling from pregnant women in the 16th-18th weeks of pregnancy after the genotypes of parents with the probands were identified. Result: A total of three different mutations of the probands, including of S105*, P1052L, P1273G, were detected. Among three fetuses which underwent prenatal genetic testing, one fetus was homozygote; two fetuses were carriers. Conclusion: Genetic testing provided a useful method for prenatal diagnosis, and is a basis for genetic counseling.

Keywords: ATP7B gene, genetic testing, prenatal diagnosis, pedigree, Wilson disease

Procedia PDF Downloads 432
4127 Penguins Search Optimization Algorithm for Chaotic Synchronization System

Authors: Sofiane Bououden, Ilyes Boulkaibet

Abstract:

In terms of security of the information signal, the meta-heuristic Penguins Search Optimization Algorithm (PeSOA) is applied to synchronize chaotic encryption communications in the case of sensitive dependence on initial conditions in chaotic generator oscillator. The objective of this paper is the use of the PeSOA algorithm to exploring search space with random and iterative processes for synchronization of symmetric keys in both transmission and reception. Simulation results show the effectiveness of the PeSOA algorithm in generating symmetric keys of the encryption process and synchronizing.

Keywords: meta-heuristic, PeSOA, chaotic systems, encryption, synchronization optimization

Procedia PDF Downloads 174
4126 Variants of Fat Mass Obesity Associated rs 9939609 Associated with Obesity and Eating Behavior in Adolescent of Minangkabau Ethnic

Authors: Susmiati, Ingrid S. Surono, Jamsari, Nur Indrawati Lipoeto

Abstract:

There are two contradicting opinions on the relationship between fat mass obesity associated (FTO) rs 9939609 variants and obesity on various ethnics and races. The first opinion agrees that there is an association between the two variables, yet another one disagree. Minangkabau ethnic had a different dietary pattern with other ethnics in Indonesia. They had higher fat and low fiber intakes compared to the other ethnics groups. There is little research in genetic factors that influence eating behavior (food preference or food selection). The objective of this study was to investigate the association between FTO rs 9939609 variants with obesity and eating behavior in adolescent girls of Minangkabau Ethnic. The research design was case control study. A total of 275 adolescent girls aged 12-15 years old (130 obese and 145 normal) were randomly chosen from four districts at West Sumatera (Padang, Padang Pariaman, Padang Panjang and Tanah Datar). Genetic variants of FTO rs 9939609 were analyzed with Tetra-primer Amplification Refractory Mutation System-Polimerase Chain Reaction (AMRS PCR), eating behavior were gathered using eating habits questionnaire, and Body Mass Index (BMI) was calculated according to BMI Z-score (WHO). The result showed that genetic variants of FTO rs 9939609 (TT, TA and AA genotype) had associated with obesity (p = 0,013), whereas subject with An Allele was significantly associated with obesity (odds ratio 1,62 [95% confidential interval, 1,00-2,60]). Subjects with An Allele carrier reported a higher consumption of fried food (p < 0.05) as compared to TT genotypes carriers. There is no association between genetic variants and meal frequency, fruit and fiber intakes p > 0.05. The genetic variants of FTO rs 9939609 are associated with obesity and eating behavior in adolescent of Minangkabau Ethics.

Keywords: FTO rs9939609, obesity, eating behavior, adolescents

Procedia PDF Downloads 155
4125 Hyperspectral Image Classification Using Tree Search Algorithm

Authors: Shreya Pare, Parvin Akhter

Abstract:

Remotely sensing image classification becomes a very challenging task owing to the high dimensionality of hyperspectral images. The pixel-wise classification methods fail to take the spatial structure information of an image. Therefore, to improve the performance of classification, spatial information can be integrated into the classification process. In this paper, the multilevel thresholding algorithm based on a modified fuzzy entropy function is used to perform the segmentation of hyperspectral images. The fuzzy parameters of the MFE function have been optimized by using a new meta-heuristic algorithm based on the Tree-Search algorithm. The segmented image is classified by a large distribution machine (LDM) classifier. Experimental results are shown on a hyperspectral image dataset. The experimental outputs indicate that the proposed technique (MFE-TSA-LDM) achieves much higher classification accuracy for hyperspectral images when compared to state-of-art classification techniques. The proposed algorithm provides accurate segmentation and classification maps, thus becoming more suitable for image classification with large spatial structures.

Keywords: classification, hyperspectral images, large distribution margin, modified fuzzy entropy function, multilevel thresholding, tree search algorithm, hyperspectral image classification using tree search algorithm

Procedia PDF Downloads 144
4124 Consumer Load Profile Determination with Entropy-Based K-Means Algorithm

Authors: Ioannis P. Panapakidis, Marios N. Moschakis

Abstract:

With the continuous increment of smart meter installations across the globe, the need for processing of the load data is evident. Clustering-based load profiling is built upon the utilization of unsupervised machine learning tools for the purpose of formulating the typical load curves or load profiles. The most commonly used algorithm in the load profiling literature is the K-means. While the algorithm has been successfully tested in a variety of applications, its drawback is the strong dependence in the initialization phase. This paper proposes a novel modified form of the K-means that addresses the aforementioned problem. Simulation results indicate the superiority of the proposed algorithm compared to the K-means.

Keywords: clustering, load profiling, load modeling, machine learning, energy efficiency and quality

Procedia PDF Downloads 140
4123 Forward Stable Computation of Roots of Real Polynomials with Only Real Distinct Roots

Authors: Nevena Jakovčević Stor, Ivan Slapničar

Abstract:

Any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be chosen as real. By using accurate forward stable algorithm for computing eigen values of real symmetric arrowhead matrices we derive a forward stable algorithm for computation of roots of such polynomials in O(n^2 ) operations. The algorithm computes each root to almost full accuracy. In some cases, the algorithm invokes extended precision routines, but only in the non-iterative part. Our examples include numerically difficult problems, like the well-known Wilkinson’s polynomials. Our algorithm compares favorably to other method for polynomial root-finding, like MPSolve or Newton’s method.

Keywords: roots of polynomials, eigenvalue decomposition, arrowhead matrix, high relative accuracy

Procedia PDF Downloads 392
4122 A Hybrid Pareto-Based Swarm Optimization Algorithm for the Multi-Objective Flexible Job Shop Scheduling Problems

Authors: Aydin Teymourifar, Gurkan Ozturk

Abstract:

In this paper, a new hybrid particle swarm optimization algorithm is proposed for the multi-objective flexible job shop scheduling problem that is very important and hard combinatorial problem. The Pareto approach is used for solving the multi-objective problem. Several new local search heuristics are integrated into an algorithm based on the critical block concept to enhance the performance of the algorithm. The algorithm is compared with the recently published multi-objective algorithms based on benchmarks selected from the literature. Several metrics are used for quantifying performance and comparison of the achieved solutions. The algorithms are also compared based on the Weighting summation of objectives approach. The proposed algorithm can find the Pareto solutions more efficiently than the compared algorithms in less computational time.

Keywords: swarm-based optimization, local search, Pareto optimality, flexible job shop scheduling, multi-objective optimization

Procedia PDF Downloads 352
4121 An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem

Authors: Y. Wang

Abstract:

The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.

Keywords: frequency quadrilateral, iterative algorithm, sparse graph, traveling salesman problem

Procedia PDF Downloads 204
4120 Track Initiation Method Based on Multi-Algorithm Fusion Learning of 1DCNN And Bi-LSTM

Authors: Zhe Li, Aihua Cai

Abstract:

Aiming at the problem of high-density clutter and interference affecting radar detection target track initiation in ECM and complex radar mission, the traditional radar target track initiation method has been difficult to adapt. To this end, we propose a multi-algorithm fusion learning track initiation algorithm, which transforms the track initiation problem into a true-false track discrimination problem, and designs an algorithm based on 1DCNN(One-Dimensional CNN)combined with Bi-LSTM (Bi-Directional Long Short-Term Memory )for fusion classification. The experimental dataset consists of real trajectories obtained from a certain type of three-coordinate radar measurements, and the experiments are compared with traditional trajectory initiation methods such as rule-based method, logical-based method and Hough-transform-based method. The simulation results show that the overall performance of the multi-algorithm fusion learning track initiation algorithm is significantly better than that of the traditional method, and the real track initiation rate can be effectively improved under high clutter density with the average initiation time similar to the logical method.

Keywords: track initiation, multi-algorithm fusion, 1DCNN, Bi-LSTM

Procedia PDF Downloads 53
4119 A Variable Incremental Conductance MPPT Algorithm Applied to Photovoltaic Water Pumping System

Authors: Sarah Abdourraziq, Rachid Elbachtiri

Abstract:

The use of solar energy as a source for pumping water is one of the promising areas in the photovoltaic (PV) application. The energy of photovoltaic pumping systems (PVPS) can be widely improved by employing an MPPT algorithm. This will lead consequently to maximize the electrical motor speed of the system. This paper presents a modified incremental conductance (IncCond) MPPT algorithm with direct control method applied to a standalone PV pumping system. The influence of the algorithm parameters on system behavior is investigated and compared with the traditional (INC) method. The studied system consists of a PV panel, a DC-DC boost converter, and a PMDC motor-pump. The simulation of the system by MATLAB-SIMULINK is carried out. Simulation results found are satisfactory.

Keywords: photovoltaic pumping system (PVPS), incremental conductance (INC), MPPT algorithm, boost converter

Procedia PDF Downloads 378
4118 Use of Hierarchical Temporal Memory Algorithm in Heart Attack Detection

Authors: Tesnim Charrad, Kaouther Nouira, Ahmed Ferchichi

Abstract:

In order to reduce the number of deaths due to heart problems, we propose the use of Hierarchical Temporal Memory Algorithm (HTM) which is a real time anomaly detection algorithm. HTM is a cortical learning algorithm based on neocortex used for anomaly detection. In other words, it is based on a conceptual theory of how the human brain can work. It is powerful in predicting unusual patterns, anomaly detection and classification. In this paper, HTM have been implemented and tested on ECG datasets in order to detect cardiac anomalies. Experiments showed good performance in terms of specificity, sensitivity and execution time.

Keywords: cardiac anomalies, ECG, HTM, real time anomaly detection

Procedia PDF Downloads 198
4117 The Prevalence of X-Chromosome Aneuploidy in Recurrent Pregnancy Loss

Authors: Rim Frikha, Nouha Bouayed, Afifa Sellami, Nozha Chakroun, Salima Douad, Leila Keskes, Tarek Rebai

Abstract:

Recurrent pregnancy loss (RPL), classically defined as the occurrence of two or more failed pregnancies, is a serious reproductive problem, in which, chromosomal rearrangements in either carrier are a major cause; mainly the chromosome aneuploidy. This study was conducted to determine the frequency and contribution of X-chromosome aneuploidy in recurrent pregnancy loss. A retrospective study was carried out among 100 couples with more than 2 miscarriages, referred to our genetic counseling. In all the cases the detailed reproductive histories were taken. Chromosomal analysis was performed using RHG banding in peripheral blood. Of a total of 100 couples; 3 patients with a detected X-chromosome aneuploidy were identified with an overall frequency of 3%. Chromosome abnormalities are as below: a Turner syndrome with 45, X/46, XX mosaicism, a 47, XXX, and a Klinefelter syndrome with 46, XY/47, XXY. These data show a high incidence of X-chromosome aneuploidy; mainly with mosaicism; in RPL. Thus, couples with such chromosomal abnormality should be referred to a clinical geneticist with whom the option of pre-implantation genetic diagnosis in subsequent pregnancy should be discussed.

Keywords: aneuploidy, genetic testing, recurrent pregnancy loss, X-chromosome

Procedia PDF Downloads 341
4116 Resource-Constrained Assembly Line Balancing Problems with Multi-Manned Workstations

Authors: Yin-Yann Chen, Jia-Ying Li

Abstract:

Assembly line balancing problems can be categorized into one-sided, two-sided, and multi-manned ones by using the number of operators deployed at workstations. This study explores the balancing problem of a resource-constrained assembly line with multi-manned workstations. Resources include machines or tools in assembly lines such as jigs, fixtures, and hand tools. A mathematical programming model was developed to carry out decision-making and planning in order to minimize the numbers of workstations, resources, and operators for achieving optimal production efficiency. To improve the solution-finding efficiency, a genetic algorithm (GA) and a simulated annealing algorithm (SA) were designed and developed in this study to be combined with a practical case in car making. Results of the GA/SA and mathematics programming were compared to verify their validity. Finally, analysis and comparison were conducted in terms of the target values, production efficiency, and deployment combinations provided by the algorithms in order for the results of this study to provide references for decision-making on production deployment.

Keywords: heuristic algorithms, line balancing, multi-manned workstation, resource-constrained

Procedia PDF Downloads 184
4115 Genomic Surveillance of Bacillus Anthracis in South Africa Revealed a Unique Genetic Cluster of B- Clade Strains

Authors: Kgaugelo Lekota, Ayesha Hassim, Henriette Van Heerden

Abstract:

Bacillus anthracis is the causative agent of anthrax that is composed of three genetic groups, namely A, B, and C. Clade-A is distributed world-wide, while sub-clades B has been identified in Kruger National Park (KNP), South Africa. KNP is one of the endemic anthrax regions in South Africa with distinctive genetic diversity. Genomic surveillance of KNP B. anthracis strains was employed on the historical culture collection isolates (n=67) dated from the 1990’s to 2015 using a whole genome sequencing approach. Whole genome single nucleotide polymorphism (SNPs) and pan-genomics analysis were used to define the B. anthracis genetic population structure. This study showed that KNP has heterologous B. anthracis strains grouping in the A-clade with more prominent ABr.005/006 (Ancient A) SNP lineage. The 2012 and 2015 anthrax isolates are dispersed amongst minor sub-clades that prevail in non-stabilized genetic evolution strains. This was augmented with non-parsimony informative SNPs of the B. anthracis strains across minor sub-clades of the Ancient A clade. Pan-genomics of B. anthracis showed a clear distinction between A and B-clade genomes with 11 374 predicted clusters of protein coding genes. Unique accessory genes of B-clade genomes that included biosynthetic cell wall genes and multidrug resistant of Fosfomycin. South Africa consists of diverse B. anthracis strains with unique defined SNPs. The sequenced B. anthracis strains in this study will serve as a means to further trace the dissemination of B. anthracis outbreaks globally and especially in South Africa.

Keywords: bacillus anthracis, whole genome single nucleotide polymorphisms, pangenomics, kruger national park

Procedia PDF Downloads 116
4114 Effectiveness of ISSR Technique in Revealing Genetic Diversity of Phaseolus vulgaris L. Representing Various Parts of the World

Authors: Mohamed El-Shikh

Abstract:

Phaseolus vulgaris L. is the world’s second most important bean after soybeans; used for human food and animal feed. It has generally been linked to reduced risk of cardiovascular disease, diabetes mellitus, obesity, cancer and diseases of digestive tract. The effectiveness of ISSR in achievement of the genetic diversity among 60 common bean accessions; represent various germplasms around the world was investigated. In general, the studied Phaseolus vulgaris accessions were divided into 2 major groups. All of the South-American accessions were separated into the second major group. These accessions may have different genetic features that are distinct from the rest of the accessions clustered in the major group. Asia and Europe accessions (1-20) seem to be more genetically similar (99%) to each other as they clustered in the same sub-group. The American and African varieties showed similarities as well and clustered in the same sub-tree group. In contrast, Asian and American accessions No. 22 and 23 showed a high level of genetic similarities, although these were isolated from different regions. The phylogenetic tree showed that all the Asian accessions (along with Australian No. 59 and 60) were similar except Indian and Yemen accessions No. 9 and 20. Only Netherlands accession No. 3 was different from the rest of European accessions. Morocco accession No. 52 was genetically different from the rest of the African accessions. Canadian accession No. 44 seems to be different from the other North American accessions including Guatemala, Mexico and USA.

Keywords: phylogenetic tree, Phaseolus vulgaris, ISSR technique, genetics

Procedia PDF Downloads 392
4113 Application of Analytical Method for Placement of DG Unit for Loss Reduction in Distribution Systems

Authors: G. V. Siva Krishna Rao, B. Srinivasa Rao

Abstract:

The main aim of the paper is to implement a technique using distributed generation in distribution systems to reduce the distribution system losses and to improve voltage profiles. The fuzzy logic technique is used to select the proper location of DG and an analytical method is proposed to calculate the size of DG unit at any power factor. The optimal sizes of DG units are compared with optimal sizes obtained using the genetic algorithm. The suggested method is programmed under Matlab software and is tested on IEEE 33 bus system and the results are presented.

Keywords: DG Units, sizing of DG units, analytical methods, optimum size

Procedia PDF Downloads 454
4112 Water Stress Response Profiling of Nigerian Bambara Groundnut (Vigna subterranea L. Verdc.) Germplasm and Genetic Diversity Studies of Some Selected Accessions Using SSR Markers

Authors: Dorcas Ropo Abejide, Olamide Ahmed Falusi, Oladipupo Abdulazeez Yusuf Daudu, Bolaji Zuluqurineen Salihu, Muhammad Liman Muhammad

Abstract:

This study evaluated the morpho-agronomic response of twenty-four (24) Nigerian Bambara groundnut landraces to water stress and genetic diversity of some selected accessions using SSR markers. The studies were carried out in the botanical garden of the Department of Plant Biology, Federal University of Technology, Minna, Niger State, Nigeria in a randomized complete block design using three replicates. Molecular analysis using SSR primers was carried out at the International Institute of Tropical Agriculture (IITA) Ibadan in order to characterize ten selected accessions comprising the seven most drought tolerant and three most susceptible accessions from the 24 accessions evaluated. Results revealed that water stress decreased morpho-agronomic traits such as plant height, leaf area, number of leaves per plant, seed yield, etc. A total of 22 alleles were detected by the SSR markers used with a mean number of 4 allelles. SSR markers MBamCO₃₃, Primer 65, and G358B2-D15 each detected 4 allelles, while Primer 3FR and 4FR detected 5 allelles each. The study revealed significantly high polymorphisms in 10 Loci. The mean value of polymorpic information content was 0.6997, implying the usefulness of the primers used in identifying genetic similarities and differences among the Bambara groundnut genotypes. The SSR analysis revealed a comparable pattern between genetic diversity and drought tolerance of the genotypes. The UPGMA dendrogram showed that at a genetic distance of 0.1, the accessions were grouped into three groups according to their level of tolerance to drought. The two most drought-tolerant accessions were grouped together, and the 5th and 6th most drought-tolerant accessions were also grouped together. This suggests that the genotypes grouped together may be genetically close, may possess similar genes, or have a common origin. The degree of genetic variants obtained from this profiling could be useful in Bambara groundnut breeding for drought tolerance. The identified drought tolerant Bambara groundnut landraces are important genetic resources for drought stress tolerance breeding programme of Bambara groundnut. The genotypes are also useful for germplasm conservation and global implications.

Keywords: Bambara groundnut, genetic diversity, germplasm, SSR markers, water stress

Procedia PDF Downloads 32
4111 Symmetric Key Encryption Algorithm Using Indian Traditional Musical Scale for Information Security

Authors: Aishwarya Talapuru, Sri Silpa Padmanabhuni, B. Jyoshna

Abstract:

Cryptography helps in preventing threats to information security by providing various algorithms. This study introduces a new symmetric key encryption algorithm for information security which is linked with the "raagas" which means Indian traditional scale and pattern of music notes. This algorithm takes the plain text as input and starts its encryption process. The algorithm then randomly selects a raaga from the list of raagas that is assumed to be present with both sender and the receiver. The plain text is associated with the thus selected raaga and an intermediate cipher-text is formed as the algorithm converts the plain text characters into other characters, depending upon the rules of the algorithm. This intermediate code or cipher text is arranged in various patterns in three different rounds of encryption performed. The total number of rounds in the algorithm is equal to the multiples of 3. To be more specific, the outcome or output of the sequence of first three rounds is again passed as the input to this sequence of rounds recursively, till the total number of rounds of encryption is performed. The raaga selected by the algorithm and the number of rounds performed will be specified at an arbitrary location in the key, in addition to important information regarding the rounds of encryption, embedded in the key which is known by the sender and interpreted only by the receiver, thereby making the algorithm hack proof. The key can be constructed of any number of bits without any restriction to the size. A software application is also developed to demonstrate this process of encryption, which dynamically takes the plain text as input and readily generates the cipher text as output. Therefore, this algorithm stands as one of the strongest tools for information security.

Keywords: cipher text, cryptography, plaintext, raaga

Procedia PDF Downloads 265