A hybrid EKF and switching PSO algorithm for joint state and parameter estimation of lateral flow immunoassay models

This is the post-print version of the Article. The official published can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, a hybrid extended Kalman filter (EKF) and switching particle swarm optimization (SPSO) algorithm is proposed for jointly estimating both the parameters and states of the lateral flow immunoassay model through available short time-series measurement. Our proposed method generalizes the well-known EKF algorithm by imposing physical constraints on the system states. Note that the state constraints are encountered very often in practice that give rise to considerable difficulties in system analysis and design. The main purpose of this paper is to handle the dynamic modeling problem with state constraints by combining the extended Kalman filtering and constrained optimization algorithms via the maximization probability method. More specifically, a recently developed SPSO algorithm is used to cope with the constrained optimization problem by converting it into an unconstrained optimization one through adding a penalty term to the objective function. The proposed algorithm is then employed to simultaneously identify the parameters and states of a lateral flow immunoassay model. It is shown that the proposed algorithm gives much improved performance over the traditional EKF method.This work was supported in part by the International Science and Technology Cooperation Project of China under Grant 2009DFA32050, Natural Science Foundation of China under Grants 61104041, International Science and Technology Cooperation Project of Fujian Province of China under Grant 2009I0016

Metaheuristic Algorithms in Artificial Intelligence with Applications to Bioinformatics, Biostatistics, Ecology and, the Manufacturing Industries

Nature-inspired metaheuristic algorithms are important components of artificial intelligence, and are increasingly used across disciplines to tackle various types of challenging optimization problems. We apply a newly proposed nature-inspired metaheuristic algorithm called competitive swarm optimizer with mutated agents (CSO-MA) and demonstrate its flexibility and out-performance relative to its competitors in a variety of optimization problems in the statistical sciences. In particular, we show the algorithm is efficient and can incorporate various cost structures or multiple user-specified nonlinear constraints. Our applications include (i) finding maximum likelihood estimates of parameters in a single cell generalized trend model to study pseudotime in bioinformatics, (ii) estimating parameters in a commonly used Rasch model in education research, (iii) finding M-estimates for a Cox regression in a Markov renewal model and (iv) matrix completion to impute missing values in a two compartment model. In addition we discuss applications to (v) select variables optimally in an ecology problem and (vi) design a car refueling experiment for the auto industry using a logistic model with multiple interacting factors

Iterated filtering methods for Markov process epidemic models

Dynamic epidemic models have proven valuable for public health decision makers as they provide useful insights into the understanding and prevention of infectious diseases. However, inference for these types of models can be difficult because the disease spread is typically only partially observed e.g. in form of reported incidences in given time periods. This chapter discusses how to perform likelihood-based inference for partially observed Markov epidemic models when it is relatively easy to generate samples from the Markov transmission model while the likelihood function is intractable. The first part of the chapter reviews the theoretical background of inference for partially observed Markov processes (POMP) via iterated filtering. In the second part of the chapter the performance of the method and associated practical difficulties are illustrated on two examples. In the first example a simulated outbreak data set consisting of the number of newly reported cases aggregated by week is fitted to a POMP where the underlying disease transmission model is assumed to be a simple Markovian SIR model. The second example illustrates possible model extensions such as seasonal forcing and over-dispersion in both, the transmission and observation model, which can be used, e.g., when analysing routinely collected rotavirus surveillance data. Both examples are implemented using the R-package pomp (King et al., 2016) and the code is made available online.Comment: This manuscript is a preprint of a chapter to appear in the Handbook of Infectious Disease Data Analysis, Held, L., Hens, N., O'Neill, P.D. and Wallinga, J. (Eds.). Chapman \& Hall/CRC, 2018. Please use the book for possible citations. Corrected typo in the references and modified second exampl

A Linear Multi-User Detector for STBC MC-CDMA Systems based on the Adaptive Implementation of the Minimum-Conditional Bit-Error-Rate Criterion and on Genetic Algorithm-assisted MMSE Channel Estimation

The implementation of efficient baseband receivers characterized by affordable computational load is a crucial point in the development of transmission systems exploiting diversity in different domains. In this paper, we are proposing a linear multi-user detector for MIMO MC-CDMA systems with Alamouti’s Space-Time Block Coding, inspired by the concept of Minimum Conditional Bit-Error-Rate (MCBER) and relying on Genetic-Algorithm (GA)-assisted MMSE channel estimation. The MCBER combiner has been implemented in adaptive way by using Least-Mean-Square (LMS) optimization. Firstly, we shall analyze the proposed adaptive MCBER MUD receiver with ideal knowledge of Channel Status Information (CSI). Afterwards, we shall consider the complete receiver structure, encompassing also the non-ideal GA-assisted channel estimation. Simulation results evidenced that the proposed MCBER receiver always outperforms state-of-the-art receiver schemes based on EGC and MMSE criterion exploiting the same degree of channel knowledge (i.e. ideal or estimated CSI)

Optimal Path Planning for Aerial Load Transportation in Complex Environments using PSO-Improved Artificial Potential Fields

In this article, we investigate the optimal path planning for aerial load transportation in complex, dynamic, and static environments using Particle Swarm Optimization (PSO). A hierarchical optimal control system is designed for a quadrotor equipped with a cable-suspended payload, employing Euler-Lagrange equations of motion. To navigate through obstacles, an improved artificial potential field combined with the PSO algorithm is used to determine the shortest path for a virtual point, acting as a leader. This leader guides the system toward the target point while avoiding collisions with both fixed and moving obstacles. The gravitational and repulsion coefficient forces using various PSO methods are fine-tuned to achieve the best trajectory and minimize time duration. The identified point serves as the desired location for quadrotor position control, based on a sliding mode strategy. Finally, we present numerical results to demonstrate the successful transportation of the payload by the system

Using and Interpreting the Bayesian Optimization Algorithm to Improve Early Stage Design of Marine Structures.

Early stage naval structural design continues to advance as designers seek to improve the quality and speed of the design process. The early stages of design produce preliminary dimensions or scantlings which control the cost and structural performance of a vessel. Increased complexity in the evaluation of structural response has led to a need for efficient algorithms well suited to solving structural design specific optimization problems. As problem sizes increase, existing optimizers can become slow or inaccurate. The Bayesian Optimization Algorithm (BOA) is presented as one solution to efficiently solve problems in the structural design optimization process. The Bayesian optimization algorithm is an Estimation of Distribution Algorithm (EDA) that uses a statistical sample of potential design solutions to create and train a Bayesian network (BN). The application of BNs is well suited for nearly decomposable problem composition which closely matches rules based structural design evaluation. This makes the BOA well suited to solve complex early stage structural optimization problems. Additionally, the learning processes used to create and train the BNs can be analyzed and interpreted to capture design knowledge. This return of knowledge to the designer helps to improve designer intuition and model synthesis in the face of more complex and intricate models. The BNs are thus analyzed to augment design problem understanding and explore trade-offs within the design space. The result matches a paradigm shift in early stage optimization of naval structures. Designers gain better understanding of critical design variables and their interactions as compared to the previous focus on the single most optimal solution. This leads to efficient simulations which rapidly explore design spaces, document critical design variable relationships and enable the designer to create better early stage design solutions.PhDNaval Architecture and Marine EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/133317/1/tedevine_1.pd

Satisfiability Logic Analysis Via Radial Basis Function Neural Network with Artificial Bee Colony Algorithm

Radial Basis Function Neural Network (RBFNN) is a variant of artificial neural network (ANN) paradigm, utilized in a plethora of fields of studies such as engineering, technology and science. 2 Satisfiability (2SAT) programming has been coined as a prominent logical rule that defines the identity of RBFNN. In this research, a swarm-based searching algorithm namely, the Artificial Bee Colony (ABC) will be introduced to facilitate the training of RBFNN. Worth mentioning that ABC is a new population-based metaheuristics algorithm inspired by the intelligent comportment of the honey bee hives. The optimization pattern in ABC was found fruitful in RBFNN since ABC reduces the complexity of the RBFNN in optimizing important parameters. The effectiveness of ABC in RBFNN has been examined in terms of various performance evaluations. Therefore, the simulation has proved that the ABC complied efficiently in tandem with the Radial Basis Neural Network with 2SAT according to various evaluations such as the Root Mean Square Error (RMSE), Sum of Squares Error (SSE), Mean Absolute Percentage Error (MAPE), and CPU Time. Overall, the experimental results have demonstrated the capability of ABC in enhancing the learning phase of RBFNN-2SAT as compared to the Genetic Algorithm (GA), Differential Evolution (DE) algorithm and Particle Swarm Optimization (PSO) algorithm

Enhanced segment particle swarm optimization for large-scale kinetic parameter estimation of escherichia coli network model

The development of a large-scale metabolic model of Escherichia coli (E. coli) is very crucial to identify the potential solution of industrially viable productions. However, the large-scale kinetic parameters estimation using optimization algorithms is still not applied to the main metabolic pathway of the E. coli model, and they’re a lack of accuracy result been reported for current parameters estimation using this approach. Thus, this research aimed to estimate large-scale kinetic parameters of the main metabolic pathway of the E. coli model. In this regard, a Local Sensitivity Analysis, Segment Particle Swarm Optimization (Se-PSO) algorithm, and the Enhanced Segment Particle Swarm Optimization (ESe-PSO) algorithm was adapted and proposed to estimate the parameters. Initially, PSO algorithm was adapted to find the globally optimal result based on unorganized particle movement in the search space toward the optimal solution. This development then introduces the Se-PSO algorithm in which the particles are segmented to find a local optimal solution at the beginning and later sought by the PSO algorithm. Additionally, the study proposed an Enhance Se-PSO algorithm to improve the linear value of inertia weigh

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field