Design, fabrication and control of a magnetic capsule-robot for the human esophagus

Much research on the development of a robotic capsule and micro robot for the diagnosis of gastrointestinal diseases has been carried out. The powering of these micro systems is becoming very challenging as the implementation of such systems is limited due to the existence of on-board power supplies. This paper presents a micro robotic system based on magnetic principles. The goal is to build a system in which a capsule-robot can be manipulated wirelessly inside an enclosed environment such as human??s body. A prototype of capsule-robot is built and tested, that can be remotely operated with three DOF in an enclosed environment by transferring magnetic energy and electromagnetic waves. A magnetic drive unit generates magnetic energy for the manipulation. Experimental results show the capsule-robot is manipulated and moved through a desired trajectory in a viscous fluid. The capsule-robot can be potentially used for endoscopy and colonoscopy.     

Genetic-based minimum classification error mapping for accurate identifying Peer-to-Peer applications in the internet traffic

In this paper, we propose a hybrid approach using genetic algorithm and neural networks to classify Peer-to-Peer (P2P) traffic in IP networks. We first compute the minimum classification error (MCE) matrix using genetic algorithm. The MCE matrix is then used during the pre-processing step to map the original dataset into a new space. The mapped data set is then fed to three different classifiers: distance-based, K-Nearest Neighbors, and neural networks classifiers. We measure three different indexes, namely mutual information, Dunn, and SD to evaluate the extent of separation of the data points before and after mapping is performed. The experimental results demonstrate that with the proposed mapping scheme we achieve, on average, 8% higher accuracy in classification of the P2P traffic compare to the previous solutions. Moreover, the genetic-based MCE matrix increases the classification accuracy more than what the basic MCE does.     

A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations

A resource investment problem with discounted cash flows (RIPDCF) is a project-scheduling problem in which (a) the availability levels of the resources are considered decision variables and (b) the goal is to find a schedule such that the net present value of the project cash flows optimizes. In this paper, the RIPDCF in which the activities are subject to generalized precedence relations is first modeled. Then, a genetic algorithm (GA) is proposed to solve this model. In addition, design of experiments and response surface methodology are employed to both tune the GA parameters and to evaluate the performance of the proposed method in 240 test problems. The results of the performance analysis show that the efficiency of the proposed GA method is relatively well.     

Extreme learning machine assessment for estimating sediment transport in open channels

The minimum velocity required to prevent sediment deposition in open channels is examined in this study. The parameters affecting transport are first determined and then categorized into different dimensionless groups, including “movement,” “transport,” “sediment,” “transport mode,” and “flow resistance.” Six different models are presented to identify the effect of each of these parameters. The feed-forward neural network (FFNN) is used to predict the densimetric Froude number (Fr) and the extreme learning machine (ELM) algorithm is utilized to train it. The results of this algorithm are compared with back propagation (BP), genetic programming (GP) and existing sediment transport equations. The results indicate that FFNN-ELM produced better results than FNN-BP, GP and existing sediment transport methods in both training (RMSE = 0.26 and MARE = 0.052) and testing (RMSE = 0.121 and MARE = 0.023). Moreover, the performance of FFNN-ELM is examined for different pipe diameters.     

Multi-Verse Optimizer: a nature-inspired algorithm for global optimization

This paper proposes a novel nature-inspired algorithm called Multi-Verse Optimizer (MVO). The main inspirations of this algorithm are based on three concepts in cosmology: white hole, black hole, and wormhole. The mathematical models of these three concepts are developed to perform exploration, exploitation, and local search, respectively. The MVO algorithm is first benchmarked on 19 challenging test problems. It is then applied to five real engineering problems to further confirm its performance. To validate the results, MVO is compared with four well-known algorithms: Grey Wolf Optimizer, Particle Swarm Optimization, Genetic Algorithm, and Gravitational Search Algorithm. The results prove that the proposed algorithm is able to provide very competitive results and outperforms the best algorithms in the literature on the majority of the test beds. The results of the real case studies also demonstrate the potential of MVO in solving real problems with unknown search spaces. Note that the source codes of the proposed MVO algorithm are publicly available at http://www.alimirjalili.com/MVO.html.     

Design of sliding mode and model reference adaptive control strategies for multivariable tape transport mechanism: a performance comparison

This paper presents sliding mode control and model reference adaptive control strategies for the tape transport mechanism. A nonlinear multivariable MIMO model of the process, consisting of take-up and supply reel servos for tape tension control and capstan servo for speed control is considered. The sliding mode control is applied for the nonlinear dynamic model of the process, while the model reference adaptive control deals with the linearized one. Moreover, in order to associate with the realistic model of system, design of controllers is accomplished with respect to parametric uncertainties. It is shown that both control strategies can guarantee asymptotic stability of the closed-loop system and tracking of desired outputs with the appropriate pace in the presence of uncertainties. Finally, simulation results demonstrate the effectiveness of the proposed controllers.     

Multi-stage genetic programming: A new strategy to nonlinear system modeling

This paper presents a new multi-stage genetic programming (MSGP) strategy for modeling nonlinear systems. The proposed strategy is based on incorporating the individual effect of predictor variables and the interactions among them to provide more accurate simulations. According to the MSGP strategy, an efficient formulation for a problem comprises different terms. In the first stage of the MSGP-based analysis, the output variable is formulated in terms of an influencing variable. Thereafter, the error between the actual and the predicted value is formulated in terms of a new variable. Finally, the interaction term is derived by formulating the difference between the actual values and the values predicted by the individually developed terms. The capabilities of MSGP are illustrated by applying it to the formulation of different complex engineering problems. The problems analyzed herein include the following: (i) simulation of pH neutralization process, (ii) prediction of surface roughness in end milling, and (iii) classification of soil liquefaction conditions. The validity of the proposed strategy is confirmed by applying the derived models to the parts of the experimental results that were not included in the analyses. Further, the external validation of the models is verified using several statistical criteria recommended by other researchers. The MSGP-based solutions are capable of effectively simulating the nonlinear behavior of the investigated systems. The results of MSGP are found to be more accurate than those of standard GP and artificial neural network-based models.     

Resource-efficient routing and scheduling of time-constrained streaming communication on networks-on-chip

Network-on-chip-based multiprocessor systems-on-chip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-on-chip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. It also introduces a technique to take the dynamism in applications into account when scheduling the communication of an application on the network-on-chip while minimizing the resource usage. Our experiments show that resource-utilization is improved when compared to existing techniques.     

Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

Flow shop problems as a typical manufacturing challenge have gained wide attention in academic fields. In this paper, we consider a bi-criteria permutation flow shop scheduling problem, where the weighted mean completion time and the weighted mean tardiness are to be minimized simultaneously. Due to the complexity of the problem, it is very difficult to obtain optimum solution for this kind of problems by means of traditional approaches. Therefore, a new multi-objective shuffled frog-leaping algorithm (MOSFLA) is introduced for the first time to search locally Pareto-optimal frontier for the given problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with three distinguished multi-objective genetic algorithms, i.e. PS-NC GA, NSGA-II, and SPEA-II. The computational results show that the proposed MOSFLA performs better than the above genetic algorithms, especially for the large-sized problems.