In this paper we provide a novel approach for breaking a significant class of block ciphers, the so-called SPN ciphers, using the process of gene assembly in ciliates. Our proposed scheme utilizes, for the first time,...In this paper we provide a novel approach for breaking a significant class of block ciphers, the so-called SPN ciphers, using the process of gene assembly in ciliates. Our proposed scheme utilizes, for the first time, the Turing-powerful potential of gene assembly procedure of ciliated protozoa into the real world computations and has a fewer number of steps than the other proposed schemes to break a cipher. We elaborate notions of formal language theory based on AIR systems, which can be thought of as a modified version of intramolecular scheme to model the ciliate bio-operations, for construction of building blocks necessary for breaking the cipher, and based on these nature-inspired constructions which are as powerful as Turing machines, we propose a theoretical approach for breaking SPN ciphers. Then, we simulate our proposed plan for breaking these ciphers on a sample block cipher based on this structure. Our results show that the proposed scheme has 51.5 percent improvement over the best previously proposed nature-inspired scheme for breaking a cipher.展开更多
In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movemen...In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movement of water drops in the natural hydrological cycle. The HCA performance is tested on various geometric structures and standard benchmarks instances. The HCA has successfully solved TSPs and obtained the optimal solution for 20 of 24 benchmarked instances, and near-optimal for the rest. The obtained results illustrate the efficiency of using HCA for solving discrete domain optimization problems. The solution quality and number of iterations were compared with those of other metaheuristic algorithms. The comparisons demonstrate the effectiveness of the HCA.展开更多
Magnetotactic bacteria optimization algorithm (MBOA) is a new optimization algorithm inspired by the characteristics of magnetotactic bacteria, which is a kind of polyphyletic group of prokaryotes with the characteris...Magnetotactic bacteria optimization algorithm (MBOA) is a new optimization algorithm inspired by the characteristics of magnetotactic bacteria, which is a kind of polyphyletic group of prokaryotes with the characteristics of magnetotaxis that make them orient and swim along geomagnetic field lines. The original Magnetotactic Bacteria Optimization Algorithm (MBOA) and several new variants of MBOA mimics the interaction energy between magnetosomes chains to obtain moments for solving problems. In this paper, Magnetotactic Bacteria Optimization Algorithm with the Best Individual-guided Differential Interaction Energy (MBOA-BIDE) is proposed. We improved interaction energy calculation by using the best individual-guided?differential interaction energy formation. We focus on analyzing the performance of different parameters settings. The experiment results show that the proposed algorithm is sensitive to parameters settings on some functions.展开更多
Magnetotactic bacteria is a kind of polyphyletic group of prokaryotes with the characteristics of magnetotaxis that make them orient and swim along geomagnetic field lines. A magnetotactic bacteria optimization algori...Magnetotactic bacteria is a kind of polyphyletic group of prokaryotes with the characteristics of magnetotaxis that make them orient and swim along geomagnetic field lines. A magnetotactic bacteria optimization algorithm(MBOA) inspired by the characteristics of magnetotactic bacteria is researched in the paper. Experiment results show that the MBOA is effective in function optimization problems and has good and competitive performance compared with the other classical optimization algorithms.展开更多
文摘In this paper we provide a novel approach for breaking a significant class of block ciphers, the so-called SPN ciphers, using the process of gene assembly in ciliates. Our proposed scheme utilizes, for the first time, the Turing-powerful potential of gene assembly procedure of ciliated protozoa into the real world computations and has a fewer number of steps than the other proposed schemes to break a cipher. We elaborate notions of formal language theory based on AIR systems, which can be thought of as a modified version of intramolecular scheme to model the ciliate bio-operations, for construction of building blocks necessary for breaking the cipher, and based on these nature-inspired constructions which are as powerful as Turing machines, we propose a theoretical approach for breaking SPN ciphers. Then, we simulate our proposed plan for breaking these ciphers on a sample block cipher based on this structure. Our results show that the proposed scheme has 51.5 percent improvement over the best previously proposed nature-inspired scheme for breaking a cipher.
文摘In this paper, a recently developed nature-inspired optimization algorithm called the hydrological cycle algorithm (HCA) is evaluated on the traveling salesman problem (TSP). The HCA is based on the continuous movement of water drops in the natural hydrological cycle. The HCA performance is tested on various geometric structures and standard benchmarks instances. The HCA has successfully solved TSPs and obtained the optimal solution for 20 of 24 benchmarked instances, and near-optimal for the rest. The obtained results illustrate the efficiency of using HCA for solving discrete domain optimization problems. The solution quality and number of iterations were compared with those of other metaheuristic algorithms. The comparisons demonstrate the effectiveness of the HCA.
文摘Magnetotactic bacteria optimization algorithm (MBOA) is a new optimization algorithm inspired by the characteristics of magnetotactic bacteria, which is a kind of polyphyletic group of prokaryotes with the characteristics of magnetotaxis that make them orient and swim along geomagnetic field lines. The original Magnetotactic Bacteria Optimization Algorithm (MBOA) and several new variants of MBOA mimics the interaction energy between magnetosomes chains to obtain moments for solving problems. In this paper, Magnetotactic Bacteria Optimization Algorithm with the Best Individual-guided Differential Interaction Energy (MBOA-BIDE) is proposed. We improved interaction energy calculation by using the best individual-guided?differential interaction energy formation. We focus on analyzing the performance of different parameters settings. The experiment results show that the proposed algorithm is sensitive to parameters settings on some functions.
文摘Magnetotactic bacteria is a kind of polyphyletic group of prokaryotes with the characteristics of magnetotaxis that make them orient and swim along geomagnetic field lines. A magnetotactic bacteria optimization algorithm(MBOA) inspired by the characteristics of magnetotactic bacteria is researched in the paper. Experiment results show that the MBOA is effective in function optimization problems and has good and competitive performance compared with the other classical optimization algorithms.
