An Effective Automatic Procedure for Testing Parameter Identifiability of HIV/AIDS Models

Realistic HIV models tend to be rather complex and many recent models proposed in the literature could not yet be analyzed by traditional identifiability testing techniques. In this paper, we check a priori global identifiability of some of these nonlinear HIV models taken from the recent literature, by using a differential algebra algorithm based on previous work of the author. The algorithm is implemented in a software tool, called DAISY (Differential Algebra for Identifiability of SYstems), which has been recently released (DAISY is freely available on the web site ). The software can be used to automatically check global identifiability of (linear and) nonlinear models described by polynomial or rational differential equations, thus providing a general and reliable tool to test global identifiability of several HIV models proposed in the literature. It can be used by researchers with a minimum of mathematical background.     

An Efficient Algorithm for Some Highly Nonlinear Fractional PDEs in Mathematical Physics

In this paper, a fractional complex transform (FCT) is used to convert the given fractional partial differential equations (FPDEs) into corresponding partial differential equations (PDEs) and subsequently Reduced Differential Transform Method (RDTM) is applied on the transformed system of linear and nonlinear time-fractional PDEs. The results so obtained are re-stated by making use of inverse transformation which yields it in terms of original variables. It is observed that the proposed algorithm is highly efficient and appropriate for fractional PDEs and hence can be extended to other complex problems of diversified nonlinear nature.     

Efficient nonlinear predictive control of a biochemical reactor using neural models

This paper describes the application of artificial neural networks to modelling and control of a continuous fermentor. A computationally efficient nonlinear model predictive control (MPC) algorithm with nonlinear prediction and linearisation (MPC-NPL) which needs solving on-line a quadratic programming problem is developed. It is demonstrated that the algorithm results in closed-loop control performance similar to that obtained in nonlinear MPC, which hinges on full on-line non-convex optimisation. The computational complexity of the MPC-NPL algorithm is shown, control accuracy and robustness are also demonstrated in the case of noisy measurements and disturbances affecting the process.     

Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as ‘erf’, is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.     

Index selection with nonlinear profit function as a tool to achieve simultaneous genetic gain

Summary Simultaneous improvement of several, and often negatively correlated, traits is frequently a desired objective in forest tree breeding. A profit function that includes a combination of both linear weights and weights for the cross-products of trait combinations facilitates the construction of a linear index, with an attractive response in all traits. A detailed algorithm for finding the index coefficients is provided, along with three examples of applications in tree breeding. The index is also a powerful tool in optimizing the selection for a ratio of two traits. It is argued that a more equal progress in several traits provides a safetey net when faced with economic uncertainties. The provided algorithm eliminates the need for direct search techniques. Existence of a dual set of linear weights means that the statistical properties of the index based on nonlinear profit functions are identical to those of the classical Smith-Hazel type of index.     

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1)β _k ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations.     

Nonlinear system identification and control based on modular neural networks

A new approach for nonlinear system identification and control based on modular neural networks (MNN) is proposed in this paper. The computational complexity of neural identification can be greatly reduced if the whole system is decomposed into several subsystems. This is obtained using a partitioning algorithm. Each local nonlinear model is associated with a nonlinear controller. These are also implemented by neural networks. The switching between the neural controllers is done by a dynamical switcher, also implemented by neural networks, that tracks the different operating points. The proposed multiple modelling and control strategy has been successfully tested on simulated laboratory scale liquid-level system.     

An algorithm for finding globally identifiable parameter combinations of nonlinear ODE models using Gröbner Bases

The parameter identifiability problem for dynamic system ODE models has been extensively studied. Nevertheless, except for linear ODE models, the question of establishing identifiable combinations of parameters when the model is unidentifiable has not received as much attention and the problem is not fully resolved for nonlinear ODEs. Identifiable combinations are useful, for example, for the reparameterization of an unidentifiable ODE model into an identifiable one. We extend an existing algorithm for finding globally identifiable parameters of nonlinear ODE models to generate the ‘simplest’ globally identifiable parameter combinations using Gröbner Bases. We also provide sufficient conditions for the method to work, demonstrate our algorithm and find associated identifiable reparameterizations for several linear and nonlinear unidentifiable biomodels.     

A Model for Multi-site Pacing of Fibrillation Using Nonlinear Dynamics Feedback

Traditionally, cardiac defibrillation requires a strong electric shock. Many unwanted side effects of this shock could be eliminated if defibrillation were performed using weak stimuli applied to several locations throughout the heart. Such multi-site pacing algorithms have been shown to defibrillate both experimentally (Pak et al., Am J Physiol 285:H2704–H2711, 2003) and theoretically (Puwal and Roth, J Biol Systems 14:101–112, 2006). Gauthier et al. (Chaos, 12:952–961, 2002) proposed a method to pace the heart using an algorithm based on nonlinear dynamics feedback applied through a single electrode. Our study applies a related but simpler algorithm, which essentially configures each electrode as a demand pacemaker, to simulate the multi-site pacing of fibrillating cardiac tissue. We use the numerical model developed by Fenton et al. (Chaos, 12:852–892, 2002) as the reaction term in a reaction–diffusion equation that we solve over a two-dimensional sheet of tissue. The defibrillation rate after pacing for 3 s is about 30%, which is significantly higher than the spontaneous defibrillation rate and is higher than observed in previous experimental and theoretical studies. Tuning the algorithm period can increase this rate to 45%. Electronic supplementary material The online version of this article (doi:) contains supplementary material, which is available to authorized users.     

Implementation of a Phase Detection Algorithm for Dynamic Cardiac Computed Tomography Analysis Based on Time Dependent Contrast Agent Distribution

This paper presents a phase detection algorithm for four-dimensional (4D) cardiac computed tomography (CT) analysis. The algorithm detects a phase, i.e. a specific three-dimensional (3D) image out of several time-distributed 3D images, with high contrast in the left ventricle and low contrast in the right ventricle. The purpose is to use the automatically detected phase in an existing algorithm that automatically aligns the images along the heart axis. Decision making is based on the contrast agent distribution over time. It was implemented in KardioPerfusion – a software framework currently being developed for 4D CT myocardial perfusion analysis. Agreement of the phase detection algorithm with two reference readers was 97% (95% CI: 82–100%). Mean duration for detection was 0.020 s (95% CI: 0.018–0.022 s), which was times less than the readers needed (s, ). Thus, this algorithm is an accurate and fast tool that can improve work flow of clinical examinations.     

Multi-model recursive identification for nonlinear systems with non-uniformly sampling

A recursive least squares based on Multi-model is proposed for non-uniformly sampled-data nonlinear (NUSDN) systems. The corresponding state space model of an NUSDN system is derived using lifting technique. Taking advantage of the Fuzzy c-Mean Clustering algorithm, NUSDN is divided into several local models. The basic idea is that the NUSDN system is viewed as a model switching system under a given rule. Once the local models are identified, the global model is determined. A pH neutralization process validate the performance of the proposed algorithm.     

Bidirectional reaction steps in metabolic networks: II. Flux estimation and statistical analysis

Metabolic carbon labelling experiments enable a large amount of extracellular fluxes and intracellular carbon isotope enrichments to be measured. Since the relation between the measured quantities and the unknown intracellular metabolic fluxes is given by bilinear balance equations, flux determination from this data set requires the numerical solution of a nonlinear inverse problem. To this end, a general algorithm for flux estimation from metabolic carbon labelling experiments based on the least squares approach is developed in this contribution and complemented by appropriate tools for statistical analysis. The linearization technique usually applied for the computation of nonlinear confidence regions is shown to be inappropriate in the case of large exchange fluxes. For this reason a sophisticated compactification transformation technique for nonlinear statistical analysis is developed. Statistical analysis is then performed by computing appropriate statistical quality measures like output sensitivities, parameter sensitivities and the parameter covariance matrix. This allows one to determine the order of magnitude of exchange fluxes in most practical situations. An application study with a large data set from lysine-producing Corynebacterium glutamicum demonstrates the power and limitations of the carbon-labelling technique. It is shown that all intracellular fluxes in central metabolism can be quantitated without assumptions on intracellular energy yields. At the same time several exchange fluxes are determined which is invaluable information for metabolic engineering. (c) 1997 John Wiley & Sons, Inc. Biotechnol Bioeng 55: 118-135, 1997.     

Koopman Invariant Subspaces and Finite Linear Representations of Nonlinear Dynamical Systems for Control

In this work, we explore finite-dimensional linear representations of nonlinear dynamical systems by restricting the Koopman operator to an invariant subspace spanned by specially chosen observable functions. The Koopman operator is an infinite-dimensional linear operator that evolves functions of the state of a dynamical system. Dominant terms in the Koopman expansion are typically computed using dynamic mode decomposition (DMD). DMD uses linear measurements of the state variables, and it has recently been shown that this may be too restrictive for nonlinear systems. Choosing the right nonlinear observable functions to form an invariant subspace where it is possible to obtain linear reduced-order models, especially those that are useful for control, is an open challenge. Here, we investigate the choice of observable functions for Koopman analysis that enable the use of optimal linear control techniques on nonlinear problems. First, to include a cost on the state of the system, as in linear quadratic regulator (LQR) control, it is helpful to include these states in the observable subspace, as in DMD. However, we find that this is only possible when there is a single isolated fixed point, as systems with multiple fixed points or more complicated attractors are not globally topologically conjugate to a finite-dimensional linear system, and cannot be represented by a finite-dimensional linear Koopman subspace that includes the state. We then present a data-driven strategy to identify relevant observable functions for Koopman analysis by leveraging a new algorithm to determine relevant terms in a dynamical system by ℓ₁-regularized regression of the data in a nonlinear function space; we also show how this algorithm is related to DMD. Finally, we demonstrate the usefulness of nonlinear observable subspaces in the design of Koopman operator optimal control laws for fully nonlinear systems using techniques from linear optimal control.     

dendroTools: R package for studying linear and nonlinear responses between tree-rings and daily environmental data

We introduce in this paper the dendroTools R package for studying the statistical relationships between tree-ring parameters and daily environmental data. The core function of the package is daily_response(), which works by sliding a moving window through daily environmental data and calculating statistical metrics with one or more tree ring proxies. Possible metrics are correlation coefficient, coefficient of determination and adjusted coefficient of determination. In addition to linear regression, it is possible to use a nonlinear artificial neural network with the Bayesian regularization training algorithm (brnn). dendroTools provides the opportunity to use daily climate data and robust nonlinear functions for the analysis of climate-growth relationships. Models should thus be better adapted to the real (continuous) growth of trees and should gain in predictive capabilities. The dendroTools R package is freely available in the CRAN repository. The functionality of the package is demonstrated on two examples, one using a mean vessel area (MVA) chronology and one a traditional tree-ring width (TRW).     

Analysis of Gene Coexpression by B-Spline Based CoD Estimation

The gene coexpression study has emerged as a novel holistic approach for microarray data analysis. Different indices have been used in exploring coexpression relationship, but each is associated with certain pitfalls. The Pearson's correlation coefficient, for example, is not capable of uncovering nonlinear pattern and directionality of coexpression. Mutual information can detect nonlinearity but fails to show directionality. The coefficient of determination (CoD) is unique in exploring different patterns of gene coexpression, but so far only applied to discrete data and the conversion of continuous microarray data to the discrete format could lead to information loss. Here, we proposed an effective algorithm, CoexPro, for gene coexpression analysis. The new algorithm is based on B-spline approximation of coexpression between a pair of genes, followed by CoD estimation. The algorithm was justified by simulation studies and by functional semantic similarity analysis. The proposed algorithm is capable of uncovering both linear and a specific class of nonlinear relationships from continuous microarray data. It can also provide suggestions for possible directionality of coexpression to the researchers. The new algorithm presents a novel model for gene coexpression and will be a valuable tool for a variety of gene expression and network studies. The application of the algorithm was demonstrated by an analysis on ligand-receptor coexpression in cancerous and noncancerous cells. The software implementing the algorithm is available upon request to the authors.     

Repeated measures random forests (RMRF): Identifying factors associated with nocturnal hypoglycemia

Nocturnal hypoglycemia is a common phenomenon among patients with diabetes and can lead to a broad range of adverse events and complications. Identifying factors associated with hypoglycemia can improve glucose control and patient care. We propose a repeated measures random forest (RMRF) algorithm that can handle nonlinear relationships and interactions and the correlated responses from patients evaluated over several nights. Simulation results show that our proposed algorithm captures the informative variable more often than naïvely assuming independence. RMRF also outperforms standard random forest and extremely randomized trees algorithms. We demonstrate scenarios where RMRF attains greater prediction accuracy than generalized linear models. We apply the RMRF algorithm to analyze a diabetes study with 2524 nights from 127 patients with type 1 diabetes. We find that nocturnal hypoglycemia is associated with HbA1c, bedtime blood glucose (BG), insulin on board, time system activated, exercise intensity, and daytime hypoglycemia. The RMRF can accurately classify nights at high risk of nocturnal hypoglycemia.     

An Extended Kalman Filtering Approach to Modeling Nonlinear Dynamic Gene Regulatory Networks via Short Gene Expression Time Series

In this paper, the extended Kalman filter (EKF) algorithm is applied to model the gene regulatory network from gene time series data. The gene regulatory network is considered as a nonlinear dynamic stochastic model that consists of the gene measurement equation and the gene regulation equation. After specifying the model structure, we apply the EKF algorithm for identifying both the model parameters and the actual value of gene expression levels. It is shown that the EKF algorithm is an online estimation algorithm that can identify a large number of parameters (including parameters of nonlinear functions) through iterative procedure by using a small number of observations. Four real-world gene expression data sets are employed to demonstrate the effectiveness of the EKF algorithm, and the obtained models are evaluated from the viewpoint of bioinformatics.     

Novel Approach to Nonlinear PID Parameter Optimization Using Ant Colony Optimization Algorithm

This paper presents an application of an Ant Colony Optimization （ACO） algorithm to optimize the parameters in the design of a type of nonlinear PID controller. The ACO algorithm is a novel heuristic bionic algorithm, which is based on the behaviour of real ants in nature searching for food. In order to optimize the parameters of the nonlinear PID controller using ACO algorithm, an objective function based on position tracing error was constructed, and elitist strategy was adopted in the improved ACO algorithm. Detailed simulation steps are presented. This nonlinear PID controller using the ACO algorithm has high precision of control and quick response.     

Directed molecular evolution by machine learning and the influence of nonlinear interactions

Alternative search strategies for the directed evolution of proteins are presented and compared with each other. In particular, two different machine learning strategies based on partial least-squares regression are developed: the first contains only linear terms that represent a given residue's independent contribution to fitness, the second contains additional nonlinear terms to account for potential epistatic coupling between residues. The nonlinear modeling strategy is further divided into two types, one that contains all possible nonlinear terms and another that makes use of a genetic algorithm to select a subset of important interaction terms. The performance of each modeling type as a function of training set size is analysed. Simulated molecular evolution on a synthetic protein landscape shows the use of machine learning techniques to guide library design can be a powerful addition to library generation methods such as DNA shuffling.     

Cybernetic model predictive control of a continuous bioreactor with cell recycle

The control of poly-beta-hydroxybutyrate (PHB) productivity in a continuous bioreactor with cell recycle is studied by simulation. A cybernetic model of PHB synthesis in Alcaligenes eutrophus is developed. Model parameters are identified using experimental data, and simulation results are presented. The model is interfaced to a multirate model predictive control (MPC) algorithm. PHB productivity and concentration are controlled by manipulating dilution rate and recycle ratio. Unmeasured time varying disturbances are imposed to study regulatory control performance, including unreachable setpoints. With proper controller tuning, the nonlinear MPC algorithm can track productivity and concentration setpoints despite a change in the sign of PHB productivity gain with respect to dilution rate. It is shown that the nonlinear MPC algorithm is able to track the maximum achievable productivity for unreachable setpoints under significant process/model mismatch. The impact of model uncertainty upon controller performance is explored. The multirate MPC algorithm is tested using three controllers employing models that vary in complexity of regulation. It is shown that controller performance deteriorates as a function of decreasing biological complexity.