Search results for: 5) genetic algorithm

Authors: Shahram Jamali, Samira Hamed

Abstract:

One of the open issues in Random Early Detection (RED) algorithm is how to set its parameters to reach high performance for the dynamic conditions of the network. Although original RED uses fixed values for its parameters, this paper follows a model-based approach to upgrade performance of the RED algorithm. It models the routers queue behavior by using the Markov model and uses this model to predict future conditions of the queue. This prediction helps the proposed algorithm to make some tunings over RED's parameters and provide efficiency and better performance. Widespread packet level simulations confirm that the proposed algorithm, called Markov-RED, outperforms RED and FARED in terms of queue stability, bottleneck utilization and dropped packets count.

Keywords: active queue management, RED, Markov model, random early detection algorithm

Procedia PDF Downloads 542

Authors: H. Merhni, A. Sbiti, I. Ratbi, A. Sefiani

Abstract:

The proximal spinal muscular atrophy (SMA) is a group of neuromuscular disorders characterized by progressive muscle weakness due to the degeneration and loss of anterior motor neurons of the spinal cord. Depending on the age of onset of symptoms and their evolution, four types of SMA, varying in severity, result in a mutations of the SMN gene (survival of Motor neuron). We have analyzed the DNA of 295 patients referred to our genetic counseling; since January 1996 until October 2014; for suspected SMA. The homozygous deletion of exon 7 of the SMN gene was found in 133 patients; of which, 40.6% were born to consanguineous parents. In countries like Morocco, where the frequency of heterozygotes for SMA is high, genetic testing should be offered as first-line and, after careful clinical assessment, especially in newborns and infants with congenital hypotonia unexplained and prognosis compromise. The molecular diagnosis of SMA allows a quick and certainly diagnosis, provide adequate genetic counseling for families at risk and suggest, for couples who want prenatal diagnosis. The analysis of the SMN gene is a perfect example of genetic testing with an excellent cost/benefit ratio that can be of great interest in public health, especially in low-income countries. We emphasize in this work for the benefit of the generalization of molecular diagnosis of SMA by the technique of PCR-enzymatic digestion in other centers in Morocco.

Keywords: Exon7, PCR-digestion, SMA, SMN gene

Procedia PDF Downloads 245

Authors: Juan Manuel Sanchez-Cartas, Gonzalo Leon

Abstract:

A price competition algorithm for ABMs based on game theory principles is proposed to deal with the simulation of theoretical market models. The algorithm is applied to the classical Hotelling’s model and to a two-sided market model to show it leads to the optimal behavior predicted by theoretical models. However, when theoretical models fail to predict the equilibrium, the algorithm is capable of reaching a feasible outcome. Results highlight that the algorithm can be implemented in other simulation models to guarantee rational users and endogenous optimal behaviors. Also, it can be applied as a tool of verification given that is theoretically based.

Keywords: agent-based models, algorithmic game theory, multi-sided markets, price optimization

Procedia PDF Downloads 464

Authors: J. Vinay , Kusumbati Besra, Niharika Pattnaik, Shivaram Prasad Singh, Manjusha Dixit

Abstract:

Gallbladder cancer (GBC) is rare but highly malignant cancer; its prevalence is more in certain geographical regions and ethnic groups, which include the Northern and Eastern states of India. Previous studies in India have reported genetic predisposition as one of the risk factors in GBC pathogenesis. Although the matrix metalloproteinase-14 (MMP14) is a well-known modulator of the tumor microenvironment and tumorigenesis and TCGA data also suggests its upregulation yet, its role in the genetic predisposition for GBC is completely unknown. We elucidated the role of MMP14 promoter variants as genetic risk factors and their implications in expression modulation. We screened MMP14 promoter variants association with GBC using Sanger’s sequencing in approximately 300 GBC and 300 control subjects and 26 GBC tissue samples of Indian ethnicity. The immunohistochemistry was used to check the MMP14 protein expression in GBC tissue samples. The role of promoter variants on expression levels was elucidated using a luciferase reporter assay. The variants rs1004030 (p-value = 0.0001) and rs1003349 (p-value = 0.0008) were significantly associated with gallbladder cancer. The luciferase assay in two different cell lines, HEK-293 (p = 0.0006) and TGBC1TKB (p = 0.0036) showed a significant increase in relative luciferase activity in the presence of risk alleles for both the single nucleotide polymorphisms (SNPs). Similarly, genotype-phenotype correlation in patients samples confirmed that the presence of risk alleles at rs1004030 and rs1003349 increased MMP14 expression. Overall, this study unravels the genetic association of MMP14 promoter variants with gallbladder cancer, which may contribute to pathogenesis by increasing its expression.

Keywords: gallbladder cancer, matrix metalloproteinase-14, single nucleotide polymorphism, case control study, genetic association study

Procedia PDF Downloads 182

Authors: Anderson S. Fonseca, Italo F. S. Da Silva, Robert D. A. Santos, Mayara G. Da Silva, Pedro H. C. Vieira, Antonio M. S. Sobrinho, Victor H. B. Lemos, Petterson S. Diniz, Anselmo C. Paiva, Eliana M. G. Monteiro

Abstract:

In Brazil, the National Electric Energy Agency (ANEEL) establishes that electrical energy companies are responsible for measuring and billing their customers. Among these regulations, it’s defined that a company must bill your customers within 27-33 days. If a relocation or a change of period is required, the consumer must be notified in writing, in advance of a billing period. To make it easier to organize a workday’s measurements, these companies create a reading plan. These plans consist of grouping customers into reading groups, which are visited by an employee responsible for measuring consumption and billing. The creation process of a plan efficiently and optimally is a capacitated clustering problem with constraints related to homogeneity and compactness, that is, the employee’s working load and the geographical position of the consuming unit. This process is a work done manually by several experts who have experience in the geographic formation of the region, which takes a large number of days to complete the final planning, and because it’s human activity, there is no guarantee of finding the best optimization for planning. In this paper, the GBKMeans method presents a technique based on K-Means and genetic algorithms for creating a capacitated cluster that respects the constraints established in an efficient and balanced manner, that minimizes the cost of relocating consumer units and the time required for final planning creation. The results obtained by the presented method are compared with the current planning of a real city, showing an improvement of 54.71% in the standard deviation of working load and 11.97% in the compactness of the groups.

Keywords: capacitated clustering, k-means, genetic algorithm, districting problems

Procedia PDF Downloads 200

Authors: Smail Tigani, Mohamed Ouzzif

Abstract:

This work presents a discrete quantitative state prediction algorithm with intelligent behavior making it able to self-improve some performance aspects. The specificity of this algorithm is the capacity of self-rectification of the prediction strategy before the final decision. The auto-rectification mechanism is based on two parallel mathematical models. In one hand, the algorithm predicts the next state based on event transition matrix updated after each observation. In the other hand, the algorithm extracts its residues trend with a linear regression representing historical residues data-points in order to rectify the first decision if needs. For a normal distribution, the interactivity between the two models allows the algorithm to self-optimize its performance and then make better prediction. Designed key performance indicator, computed during a Monte Carlo simulation, shows the advantages of the proposed approach compared with traditional one.

Keywords: discrete state, Markov Chains, linear regression, auto-adaptive systems, decision making, Monte Carlo Simulation

Procedia PDF Downloads 500

Authors: Eman M. Sarhan, Doaa A. Ghareeb, Gabriella Ortore, Amr A. Amara, Mohamed M. El-Sayed

Abstract:

Drug salting and nanoparticle-based drug delivery formulations are considered to be an effective means for rendering the hydrophobic drugs’ nano-scale dispersion in aqueous media, and thus circumventing the pitfalls of their poor solubility as well as enhancing their membrane permeability. The current study aims to increase the bioavailability of quaternary ammonium berberine through acid salting and biodegradable bovine serum albumin (BSA)-based nanoparticulate drug formulation. Berberine hydroxide (BBR-OH) that was chemically synthesized by alkalization of the commercially available berberine hydrochloride (BBR-HCl) was then acidified to get Di-berberine sulfate (BBR)₂SO₄. The purified crystals were spectrally characterized. The desolvation technique was optimized for the preparation of size-controlled BSA-BBR-HCl, BSA-BBR-OH, and BSA-(BBR)₂SO₄ nanoparticles. Particle size, zeta potential, drug release, encapsulation efficiency, Fourier transform infrared spectroscopy (FTIR), tandem MS-MS spectroscopy, energy-dispersive X-ray spectroscopy (EDX), scanning and transmitting electron microscopic examination (SEM, TEM), in vitro bioactivity, and in silico drug-polymer interaction were determined. BSA (PDB ID; 4OR0) protonation state at different pH values was predicted using Amber12 molecular dynamic simulation. Then blind docking was performed using Lamarkian genetic algorithm (LGA) through AutoDock4.2 software. Results proved the purity and the size-controlled synthesis of berberine-BSA-nanoparticles. The possible binding poses, hydrophobic and hydrophilic interactions of berberine on BSA at different pH values were predicted. Antioxidant, anti-hemolytic, and cell differentiated ability of tested drugs and their nano-formulations were evaluated. Thus, drug salting and the potentially effective albumin berberine nanoparticle formulations can be successfully developed using a well-optimized desolvation technique and exhibiting better in vitro cellular bioavailability.

Keywords: berberine, BSA, BBR-OH, BBR-HCl, BSA-BBR-HCl, BSA-BBR-OH, (BBR)₂SO₄, BSA-(BBR)₂SO₄, FTIR, AutoDock4.2 Software, Lamarkian genetic algorithm, SEM, TEM, EDX

Procedia PDF Downloads 175

Authors: N. Guo, C. Xu, Z. C. Yang

Abstract:

In order to ensure the high reliability of an aircraft, the accurate structural dynamics analysis has become an indispensable part in the design of an aircraft structure. Therefore, the structural finite element model which can be used to accurately calculate the structural dynamics and their transfer relations is the prerequisite in structural dynamic design. A dynamic finite element model updating method is presented to correct the uncertain parameters of the finite element model of a structure using measured modal parameters. The coordinate modal assurance criterion is used to evaluate the correlation level at each coordinate over the experimental and the analytical mode shapes. Then, the weighted summation of the natural frequency residual and the coordinate modal assurance criterion residual is used as the objective function. Moreover, the hybrid pattern search (HPS) optimization technique, which synthesizes the advantages of pattern search (PS) optimization technique and genetic algorithm (GA), is introduced to solve the dynamic FE model updating problem. A numerical simulation and a model updating experiment for GARTEUR aircraft model are performed to validate the feasibility and effectiveness of the present dynamic model updating method, respectively. The updated results show that the proposed method can be successfully used to modify the incorrect parameters with good robustness.

Keywords: model updating, modal parameter, coordinate modal assurance criterion, hybrid genetic/pattern search

Procedia PDF Downloads 163

Authors: B. Selma, S. Chouraqui

Abstract:

The pancreas is an elongated organ that extends across the abdomen, below the stomach. In addition, it secretes certain enzymes that aid in food digestion. The pancreas also manufactures hormones responsible for regulating blood glucose levels. In the present paper, we propose a mathematical model to study the homeostasis of glucose and insulin in healthy human, and a simulation of this model, which depicts the physiological events after a meal, will be represented in ordinary humans. The aim of this paper is to design an algorithm which regulates the level of glucose in the blood. The algorithm applied the concept of expert system for performing an algorithm control in the form of an "active" used to prescribe the rate of insulin infusion. By decomposing the system into subsystems, we have developed parametric models of each subsystem by using a forcing function strategy. The results showed a performance of the control system.

Keywords: modeling, algorithm, regulation, glucose-insulin, blood, control system

Procedia PDF Downloads 180

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 338

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 140

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 113

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 315

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 421

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 381

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 385

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 120

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 460

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 331

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 177

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 394

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 152

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 142

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 201

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 186

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 169

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 420

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 373

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(CN_maxn²) where C is the iterations, N_max 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 237

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 100