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

A tunable band pass filter based on fiber Bragg grating sensor using an in-fiber Mach-Zender interferometer with dual micro-cavities is presented. The micro-cavity was formed by splicing together a conventional single-mode fiber and a solid core photonic crystal fiber (SCPCF) with simple arc discharge technique. Different parameters such as arc power, length of the SCPCF and the overlap gap between samples were considered to control the fabrication process. The ellipsoidal air-cavity between the two fibers forms Fabry-Perot cavity. The diffraction loss was very low due to short cavity length. Ellipsoidal shape micro-cavities were experimentally achieved parallel to the propagation axis having dimensions of (24.92 – 62.32) μm of width

 The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

Human beings are greatly inspired by nature. Nature has the ability to solve very complex problems in its own distinctive way. The problems around us are becoming more and more complex in the real time and at the same instance our mother nature is guiding us to solve these natural problems. Nature gives some of the logical and effective ways to find solutions to these problems. Nature acts as an optimized source for solving the complex problems.  Decomposition is a basic strategy in traditional multi-objective optimization. However, it has not yet been widely used in multi-objective evolutionary optimization.   

Although computational strategies for taking care of Multi-objective Optimization Problems (MOPs) h

In this paper, we construct a new mathematical system as Multiplicative Cyclic Group (MCG), called a New Digital Algebraic Generator (NDAG) Unit, which would generate digital sequences with good statistical properties. This new Unit can be considered as a new basic unit of stream ciphers.

A (NDAG) system can be constructed from collection of (NDAG) units using a Boolean function as a combining function of the system. This system could be used in cryptography as like as Linear Feedback Shift Register (LFSR) unit. This unit is basic component of  a stream cipher system.