This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

This paper describes a new finishing process using magnetic abrasives were newly made to finish effectively brass plate that is very difficult to be polished by the conventional machining processes. Taguchi experimental design method was adopted for evaluating the effect of the process parameters on the improvement of the surface roughness and hardness by the magnetic abrasive polishing. The process parameters are: the applied current to the inductor, the working gap between the workpiece and the inductor, the rotational speed and the volume of powder. The analysis of variance(ANOVA) was analyzed using statistical software to identify the optimal conditions for better surface roughness and hardness. Regressions models based on statistical m

Background: MRSA (methicillin-resistant Staphylococcus aureus) is a global health problem. Many people are looking for new ways to combat MRSA, for example by using bacteriophages (phages). It has been extremely challenging to isolate a sufficient quantity of lytic anti-MRSA phages. Therefore, new techniques for separating, refining, and reworking anti-MRSA phages were sought in this study.

Methods: Of 437 S. aureus isolates, nine clinical MRSA isolates were obtained from three hospitals in Baghdad, Iraq and two ATCC MRSA strains were used to separate wild anti-MRS

The majority of real-world problems involve not only finding the optimal solution, but also this solution must satisfy one or more constraints. Differential evolution (DE) algorithm with constraints handling has been proposed to solve one of the most fundamental problems in cellular network design. This proposed method has been applied to solve the radio network planning (RNP) in the forthcoming 5G Long Term Evolution (5G LTE) wireless cellular network, that satisfies both deployment cost and energy savings by reducing the number of deployed micro base stations (BSs) in an area of interest. Practically, this has been implemented using constrained strategy that must guarantee good coverage for the users as well. Three differential evolution

A spectrophotometric determination of azithromycin was optimized using the simplex model. The approach has been proven to be accurate and sensitive. The analyte has been reacted with bromothymol blue (BTB) to form a colored ion pair which has been extracted in chloroform in a buffer medium of pH=4 of potassium phthalate. The extracted colored product was assayed at 415 nm and exhibited a linear quantification range over (1 - 20) g/ml. The excipients did not exhibit any interferences with the proposed approach for assaying azithromycin in pharmaceutical formulations.

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

This paper presents an improved technique on Ant Colony Optimization (ACO) algorithm. The procedure is applied on Single Machine with Infinite Bus (SMIB) system with power system stabilizer (PSS) at three different loading regimes. The simulations are made by using MATLAB software. The results show that by using Improved Ant Colony Optimization (IACO) the system will give better performance with less number of iterations as it compared with a previous modification on ACO. In addition, the probability of selecting the arc depends on the best ant performance and the evaporation rate.

The issue of image captioning, which comprises automatic text generation to understand an image’s visual information, has become feasible with the developments in object recognition and image classification. Deep learning has received much interest from the scientific community and can be very useful in real-world applications. The proposed image captioning approach involves the use of Convolution Neural Network (CNN) pre-trained models combined with Long Short Term Memory (LSTM) to generate image captions. The process includes two stages. The first stage entails training the CNN-LSTM models using baseline hyper-parameters and the second stage encompasses training CNN-LSTM models by optimizing and adjusting the hyper-parameters of