simplicity of algorithm
1.Genetic algorithms, as a computational model simulating the biologicalevolution process of the genetic selection theory of Darwin, is a whole new globaloptimization algorithm and is widely used in many fields with its remarkablecharacteristic of simplicity, commonability, stability, suitability for parallelprocessing, high-efficiency, and practibility .
2.Genetic algorithm(GA), as a computational model simulating the biological evolution process of the genetic: selection theory of Darwin,is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high eficiency, and practibility.
3.The Expectation-Maximization algorithm is a popular one ,which is also called EM algorithm and introduced by Dempster ,Laird & Rubin(1977)(DLR)in a presented paper in Royal Statistics Associate. Its advantage is simplicity and stability. Especially,the log-likelihood of the observed data is guaranteed to be non-decreasing at each iteration .
4.On the basis of analysis of modeling method of PLS, regarded response variate as 0-1 variates, a novel DPR algorithm based on PLS is set up in this paper. It has moreadvantages than Fisher discriminant analysis and Bayes discriminant analysis, such as simplicity and robustness, clearly qualitative explanation;
5.After several iteration steps, the chaotic sequences are mapped to ASCII codes, and using the ASCII codes to one by one XOR every byte of the map data. In order to avoiding the localization of the finite precision, we change the parameter of the chaotic mapping with step length. Comparing with DES and A5 algorithms, computing results show that our algorithm is fairly good in efficiency, security and simplicity.
