From swarm intelligence to metaheuristics: nature-inspired optimization algorithms

Nature has provided rich models for computational problem solving, including optimizations based on the swarm intelligence exhibited by fireflies, bats, and ants. These models can stimulate computer scientists to think nontraditionally in creating tools to address application design challenges

From swarm intelligence to metaheuristics: nature-inspired optimization algorithms

Nature has provided rich models for computational problem solving, including optimizations based on the swarm intelligence exhibited by fireflies, bats, and ants. These models can stimulate computer scientists to think nontraditionally in creating tools to address application design challenges

Parallel hybrid chicken swarm optimization for solving the quadratic assignment problem

In this research, we intend to suggest a new method based on a parallel hybrid chicken swarm optimization (PHCSO) by integrating the constructive procedure of GRASP and an effective modified version of Tabu search. In this vein, the goal of this adaptation is straightforward about the fact of preventing the stagnation of the research. Furthermore, the proposed contribution looks at providing an optimal trade-off between the two key components of bio-inspired metaheuristics: local intensification and global diversification, which affect the efficiency of our proposed algorithm and the choice of the dependent parameters. Moreover, the pragmatic results of exhaustive experiments were promising while applying our algorithm on diverse QAPLIB instances . Finally, we briefly highlight perspectives for further research

Evolutionary perspectives in computer music

This paper presents a brief overview of music evolution - western and non-western music - from its genesis to serialism and the Darmstadt school. Some mathematical aspects of music are then presented and confronted with music as a form of art. Some questions follow: are these two (very) distinct aspects compatible? Can computers be of real help in automatic composition? Evolutionaty Algorithms (EAs) - Genetic Algorithms (GAs), Genetic Programming (GP), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) - are then introduced and some results of GAs and GPs application to music generation are analysed. Variable fitness functions and PSO application seems a promising way to explore. However, what output should be envisaged? Should we expect that computer music sounds as human music, or should we look for a totally different way to explore and listen? How far can go computer creativity and in what direction?N/

Synthesis and Implementation (In STM8S) of Phased Circular Antenna Arrays Using Taguchi Method

This paper is aimed at assessing the effectiveness of the phase-only control strategy based on a customized Taguchi method when applied to Uniform Circular Arrays (UCA).  The objective of this paper consists to contribute the main lobe optimization of the smart antenna using Taguchi's method. We used the cited method in order to determine phase's weights for each element of the circular antenna array in order to steer the principal lobe from -65° to 65° covering all angular space. After that, we made an electronic platform using the microcontroller STM8S in order to implement an intelligent system. The architecture of this work had used a digital phase shifters, a demodulator AD8347, a modulator AD8349, an array antenna, cards STM8S-Discovery

Using Optimized Features for Modified Optical Backpropagation Neural Network Model in Online Handwritten Character Recognition System

One major problem encountered by researchers in developing character recognition system is selection of efficient features (optimal features). In this paper, Particle Swarm Optimization (PSO) is proposed for feature selection. However, backpropagation algorithm has been reported to be an effective and most widely used supervised training algorithm for multi-layered feedforward neural networks but has the shortcomings of longer training time and entrapment into a local minimal. Several research works have been proposed to improve this algorithm but some of these research works were based on ‘learning parameter’ which in some cases slowed down the training process. Hence, this paper has focused on alleviating the problem of standard backpropagation algorithm based on ‘error adjustment’. To this effect, PSO is integrated with a ‘Modified Optical Backpropagation (MOBP)’ neural network to enhancement the performance of the classifier in terms of recognition accuracy and recognition time.  Experiments were conducted on MOBP neural network and PSO-based MOBP classifiers using 6,200 handwritten character samples (uppercase (A-Z), lowercase (a-z) English alphabet and 10 digits (0-9)) collected from 100 subjects using G-Pen 450 digitizer and the system was tested with 100 character samples written by people who did not participate in the initial data acquisition process. Experimental results show promising results for the PSO-based MOBP classifier in terms of the performance measures. Keywords: Artificial Neural Network, Feature Extraction, Feature Selection, Particle Swarm Optimization, Modified Optical Backpropagation

LEAP: Efficient and Automated Test Method for NLP Software

The widespread adoption of DNNs in NLP software has highlighted the need for robustness. Researchers proposed various automatic testing techniques for adversarial test cases. However, existing methods suffer from two limitations: weak error-discovering capabilities, with success rates ranging from 0% to 24.6% for BERT-based NLP software, and time inefficiency, taking 177.8s to 205.28s per test case, making them challenging for time-constrained scenarios. To address these issues, this paper proposes LEAP, an automated test method that uses LEvy flight-based Adaptive Particle swarm optimization integrated with textual features to generate adversarial test cases. Specifically, we adopt Levy flight for population initialization to increase the diversity of generated test cases. We also design an inertial weight adaptive update operator to improve the efficiency of LEAP's global optimization of high-dimensional text examples and a mutation operator based on the greedy strategy to reduce the search time. We conducted a series of experiments to validate LEAP's ability to test NLP software and found that the average success rate of LEAP in generating adversarial test cases is 79.1%, which is 6.1% higher than the next best approach (PSOattack). While ensuring high success rates, LEAP significantly reduces time overhead by up to 147.6s compared to other heuristic-based methods. Additionally, the experimental results demonstrate that LEAP can generate more transferable test cases and significantly enhance the robustness of DNN-based systems.Comment: Accepted at ASE 202