Automated Design of Stream Ciphers Using GADS

2016 ◽  
pp. 46-73
Author(s):  
Wasan Awad ◽  
Amal M. Al Hiddi
Keyword(s):  
Genetic Algorithm ◽  
Genetic Programming ◽  
Simulated Annealing Algorithm ◽  
Automated Design ◽  
Effective Algorithm ◽  
Syntactic Rule ◽  
Individual Program ◽  
Annealing Algorithm ◽  
Representation Method ◽  
The Individual

The main objective of this chapter is to propose a new effective algorithm to design stream cipher systems automatically using simulated annealing algorithm and genetic programming with a different method for representing the genetic programming population individuals. Usually the individual programs represented as LISP expressions; in the proposed method the programs are represented as strings of integers representing the individual program syntactic rule numbers. Genetic programming with this representation method is called genetic algorithm for developing software (GADS). The performance of the proposed algorithm will be studied by applying different genetic methods and parameters. Furthermore, it will be compared with other representation methods such as LISP expression.

Optimal Training of Artificial Neural Networks to Forecast Power System State Variables

2014 ◽  
Vol 3 (1) ◽  
pp. 65-82 ◽  
Author(s):  
Victor Kurbatsky ◽  
Denis Sidorov ◽  
Nikita Tomin ◽  
Vadim Spiryaev
Keyword(s):  
Genetic Algorithm ◽  
Support Vector Machine ◽  
Simulated Annealing ◽  
Power System ◽  
Simulated Annealing Algorithm ◽  
Active Power ◽  
Support Vector ◽  
State Variables ◽  
Annealing Algorithm ◽  
Artificial Neural

The problem of forecasting state variables of electric power system is studied. The paper suggests data-driven adaptive approach based on hybrid-genetic algorithm which combines the advantages of genetic algorithm and simulated annealing algorithm. The proposed method has two stages. At the first stage the input signal is decomposed into orthogonal basis functions based on the Hilbert-Huang transform. The genetic algorithm and simulated annealing algorithm are applied to optimal training of the artificial neural network and support vector machine at the second stage. The results of applying the developed approach for the short-term forecasts of active power flows in the electric networks are presented. The best efficiency of proposed approach is demonstrated on real retrospective data of active power flow forecast using the hybrid-genetic support vector machine algorithm.

Research on Active Polarization Control System of Fiber Laser Based on a Mixed Genetic Algorithm and Simulated Annealing Algorithm

2020 ◽  
Vol 40 (23) ◽  
pp. 2314002
Author(s):  
尤阳 You Yang ◽  
漆云凤 Qi Yunfeng ◽  
沈辉 Shen Hui ◽  
邹星星 Zou Xingxing ◽  
何兵 He Bing ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Control System ◽  
Fiber Laser ◽  
Simulated Annealing Algorithm ◽  
Polarization Control ◽  
Annealing Algorithm ◽  
Mixed Genetic Algorithm

scholarly journals Urban Traffic Signal Control Based on Multiobjective Joint Optimization

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Yongrong Wu ◽  
Yijie Zhou ◽  
Yanming Feng ◽  
Yutian Xiao ◽  
Shaojie He ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing Algorithm ◽  
Urban Traffic ◽  
Joint Optimization ◽  
Signal Control ◽  
Traffic Signal Control ◽  
Signal Timing ◽  
Timing Optimization ◽  
Average Delay ◽  
Annealing Algorithm

This paper proposes two algorithms for signal timing optimization of single intersections, namely, microbial genetic algorithm and simulated annealing algorithm. The basis of the optimization of these two algorithms is the original timing scheme of the SCATS, and the optimized parameters are the average delay of vehicles and the capacity. Experiments verify that these two algorithms are, respectively, improved by 67.47% and 46.88%, based on the original timing scheme.

scholarly journals A Comparison of Metaheuristic Optimization Algorithms for Scale Short-Form Development

2020 ◽  
Vol 80 (5) ◽  
pp. 910-931
Author(s):  
Anthony W. Raborn ◽  
Walter L. Leite ◽  
Katerina M. Marcoulides
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Simulated Annealing Algorithm ◽  
Short Form ◽  
Model Misspecification ◽  
External Variable ◽  
Monte Carlo Simulation Study ◽  
Short Forms ◽  
Annealing Algorithm ◽  
Form Development

This study compares automated methods to develop short forms of psychometric scales. Obtaining a short form that has both adequate internal structure and strong validity with respect to relationships with other variables is difficult with traditional methods of short-form development. Metaheuristic algorithms can select items for short forms while optimizing on several validity criteria, such as adequate model fit, composite reliability, and relationship to external variables. Using a Monte Carlo simulation study, this study compared existing implementations of the ant colony optimization, Tabu search, and genetic algorithm to select short forms of scales, as well as a new implementation of the simulated annealing algorithm. Selection of short forms of scales with unidimensional, multidimensional, and bifactor structure were evaluated, with and without model misspecification and/or an external variable. The results showed that when the confirmatory factor analysis model of the full form of the scale was correctly specified or had only minor misspecification, the four algorithms produced short forms with good psychometric qualities that maintained the desired factor structure of the full scale. Major model misspecification resulted in worse performance for all algorithms, but including an external variable only had minor effects on results. The simulated annealing algorithm showed the best overall performance as well as robustness to model misspecification, while the genetic algorithm produced short forms with worse fit than the other algorithms under conditions with model misspecification.

Sign in / Sign up

Export Citation Format

Share Document