Stochastic switching of delayed feedback suppresses oscillations in genetic regulatory systems

Delays and stochasticity have both served as crucially valuable ingredients in mathematical descriptions of control, physical, and biological systems. In this work, we investigate how explicitly dynamical stochasticity in delays modulates the effect of delayed feedback. To do so, we consider a hybrid model where stochastic delays evolve by a continuous-time Markov chain, and between switching events, the system of interest evolves via a deterministic delay equation. Our main contribution is the calculation of an effective delay equation in the fast switching limit. This effective equation maintains the influence of all subsystem delays and cannot be replaced with a single effective delay. To illustrate the relevance of this calculation, we investigate a simple model of stochastically switching delayed feedback motivated by gene regulation. We show that sufficiently fast switching between two oscillatory subsystems can yield stable dynamics.Comment: updated: 13 pages, 5 figure

Optimal control problems involving constrained, switched, and delay systems

In this thesis, we develop numerical methods for solving five nonstandard optimal control problems. The main idea of each method is to reformulate the optimal control problem as, or approximate it by, a nonlinear programming problem. The decision variables in this nonlinear programming problem influence its cost function (and constraints, if it has any) implicitly through the dynamic system. Hence, deriving the gradient of the cost and the constraint functions is a difficult task. A major focus of this thesis is on developing methods for computing these gradients. These methods can then be used in conjunction with a gradient-based optimization technique to solve the optimal control problem efficiently.The first optimal control problem that we consider has nonlinear inequality constraints that depend on the state at two or more discrete time points. These time points are decision variables that, together with a control function, should be chosen in an optimal manner. To tackle this problem, we first approximate the control by a piecewise constant function whose values and switching times (the times at which it changes value) are decision variables. We then apply a novel time-scaling transformation that maps the switching times to fixed points in a new time horizon. This yields an approximate dynamic optimization problem with a finite number of decision variables. We develop a new algorithm, which involves integrating an auxiliary dynamic system forward in time, for computing the gradient of the cost and constraints in this approximate problem.The second optimal control problem that we consider has nonlinear continuous inequality constraints. These constraints restrict both the state and the control at every point in the time horizon. As with the first problem, we approximate the control by a piecewise constant function and then transform the time variable. This yields an approximate semi-infinite programming problem, which can be solved using a penalty function algorithm. A solution of this problem immediately furnishes a suboptimal control for the original optimal control problem. By repeatedly increasing the number of parameters used in the approximation, we can generate a sequence of suboptimal controls. Our main result shows that the cost of these suboptimal controls converges to the minimum cost.The third optimal control problem that we consider is an applied problem from electrical engineering. Its aim is to determine an optimal operating scheme for a switchedcapacitor DC-DC power converter—an electronic device that transforms one DC voltage into another by periodically switching between several circuit topologies. Specifically, the optimal control problem is to choose the times at which the topology switches occur so that the output voltage ripple is minimized and the load regulation is maximized. This problem is governed by a switched system with linear subsystems (each subsystem models one of the power converter’s topologies). Moreover, its cost function is non-smooth. By introducing an auxiliary dynamic system and transforming the time variable (so that the topology switching times become fixed), we derive an equivalent semi-infinite programming problem. This semi-infinite programming problem, like the one that approximates the continuously-constrained optimal control problem, can be solved using a penalty function algorithm.The fourth optimal control problem that we consider involves a general switched system, which includes the model of a switched-capacitor DC-DC power converter as a special case. This switched system evolves by switching between several subsystems of nonlinear ordinary differential equations. Furthermore, each subsystem switch is accompanied by an instantaneous change in the state. These instantaneous changes—so-called state jumps—are influenced by control variables that, together with the subsystem switching times, should be selected in an optimal manner. As with the previous optimal control problems, we tackle this problem by transforming the time variable to obtain an equivalent problem in which the switching times are fixed. However, the functions governing the state jumps in this new problem are discontinuous. To overcome this difficulty, we introduce an approximate problem whose state jumps are governed by smooth functions. This approximate problem can be solved using a nonlinear programming algorithm. We prove an important convergence result that links the approximate problem’s solution with the original problem’s solution.The final optimal control problem that we consider is a parameter identification problem. The aim of this problem is to use given experimental data to identify unknown state-delays in a nonlinear delay-differential system. More precisely, the optimal control problem involves choosing the state-delays to minimize a cost function measuring the discrepancy between predicted and observed system output. We show that the gradient of this cost function can be computed by solving an auxiliary delay-differential system. On the basis of this result, the optimal control problem can be formulated—and hence solved—as a standard nonlinear programming problem

H ? filtering for stochastic singular fuzzy systems with time-varying delay

This paper considers the H? filtering problem for stochastic singular fuzzy systems with timevarying delay. We assume that the state and measurement are corrupted by stochastic uncertain exogenous disturbance and that the system dynamic is modeled by Ito-type stochastic differential equations. Based on an auxiliary vector and an integral inequality, a set of delay-dependent sufficient conditions is established, which ensures that the filtering error system is e?t - weighted integral input-to-state stable in mean (iISSiM). A fuzzy filter is designed such that the filtering error system is impulse-free, e?t -weighted iISSiM and the H? attenuation level from disturbance to estimation error is belowa prescribed scalar.Aset of sufficient conditions for the solvability of the H? filtering problem is obtained in terms of a new type of Lyapunov function and a set of linear matrix inequalities. Simulation examples are provided to illustrate the effectiveness of the proposed filtering approach developed in this paper

Fixed-time control of delayed neural networks with impulsive perturbations

This paper is concerned with the fixed-time stability of delayed neural networks with impulsive perturbations. By means of inequality analysis technique and Lyapunov function method, some novel fixed-time stability criteria for the addressed neural networks are derived in terms of linear matrix inequalities (LMIs). The settling time can be estimated without depending on any initial conditions but only on the designed controllers. In addition, two different controllers are designed for the impulsive delayed neural networks. Moreover, each controller involves three parts, in which each part has different role in the stabilization of the addressed neural networks. Finally, two numerical examples are provided to illustrate the effectiveness of the theoretical analysis

Computational methods for solving optimal industrial process control problems

In this thesis, we develop new computational methods for three classes of dynamic optimization problems: (i) A parameter identification problem for a general nonlinear time-delay system; (ii) an optimal control problem involving systems with both input and output delays, and subject to continuous inequality state constraints; and (iii) a max-min optimal control problem arising in gradient elution chromatography.In the first problem, we consider a parameter identification problem involving a general nonlinear time-delay system, where the unknown time delays and system parameters are to be identified. This problem is posed as a dynamic optimization problem, where its cost function is to measure the discrepancy between predicted output and observed system output. The aim is to find unknown time-delays and system parameters such that the cost function is minimized. We develop a gradient-based computational method for solving this dynamic optimization problem. We show that the gradients of the cost function with respect to these unknown parameters can be obtained via solving a set of auxiliary time-delay differential systems from t = 0 to t = T. On this basis, the parameter identification problem can be solved as a nonlinear optimization problem and existing optimization techniques can be used. Two numerical examples are solved using the proposed computational method. Simulation results show that the proposed computational method is highly effective. In particular, the convergence is very fast even when the initial guess of the parameter values is far away from the optimal values.Unlike the first problem, in the second problem, we consider a time delay identification problem, where the input function for the nonlinear time-delay system is piecewise-constant. We assume that the time-delays—one involving the state variables and the other involving the input variables—are unknown and need to be estimated using experimental data. We also formulate the problem of estimating the unknown delays as a nonlinear optimization problem in which the cost function measures the least-squares error between predicted output and measured system output. This estimation problem can be viewed as a switched system optimal control problem with time-delays. We show that the gradient of the cost function with respect to the unknown state delay can be obtained via solving a auxiliary time-delay differential system. Furthermore, the gradient of the cost function with respect to the unknown input delay can be obtained via solving an auxiliary time-delay differential system with jump conditions at the delayed control switching time points. On this basis, we develop a heuristic computational algorithm for solving this problem using gradient based optimization algorithms. Time-delays in two industrial processes are estimated using the proposed computational method. Simulation results show that the proposed computational method is highly effective.For the third problem, we consider a general optimal control problem governed by a system with input and output delays, and subject to continuous inequality constraints on the state and control. We focus on developing an effective computational method for solving this constrained time delay optimal control problem. For this, the control parameterization technique is used to approximate the time planning horizon [0, T] into N subintervals. Then, the control is approximated by a piecewise constant function with possible discontinuities at the pre-assigned partition points, which are also called the switching time points. The heights of the piecewise constant function are decision variables which are to be chosen such that a given cost function is minimized. For the continuous inequality constraints on the state, we construct approximating smooth functions in integral form. Then, the summation of these approximating smooth functions in integral form, which is called the constraint violation, is appended to the cost function to form a new augmented cost function. In this way, we obtain a sequence of approximate optimization problems subject to only boundedness constraints on the decision variables. Then, the gradient of the augmented cost function is derived. On this basis, we develop an effective computational method for solving the time-delay optimal control problem with continuous inequality constraints on the state and control via solving a sequence of approximate optimization problems, each of which can be solved as a nonlinear optimization problem by using existing gradient-based optimization techniques. This proposed method is then used to solve a practical optimal control problem arising in the study of a real evaporation process. The results obtained are highly satisfactory, showing that the proposed method is highly effective.The fourth problem that we consider is a max-min optimal control problem arising in the study of gradient elution chromatography, where the manipulative variables in the chromatographic process are to be chosen such that the separation efficiency is maximized. This problem has three non-standard characteristics: (i) The objective function is nonsmooth; (ii) each state variable is defined over a different time horizon; and (iii) the order of the final times for the state variable, the so-called retention times, are not fixed. To solve this problem, we first introduce a set of auxiliary decision variables to govern the ordering of the retention times. The integer constraints on these auxiliary decision variables are approximated by continuous boundedness constraints. Then, we approximate the control by a piecewise constant function, and apply a novel time-scaling transformation to map the retention times and control switching times to fixed points in a new time horizon. The retention times and control switching times become decision variables in the new time horizon. In addition, the max-min objective function is approximated by a minimization problem subject to an additional constraint. On this basis, the optimal control problem is reduced to an approximate nonlinear optimization problem subject to smooth constraints, which is then solved using a recently developed exact penalty function method. Numerical results obtained show that this approach is highly effective.Finally, some concluding remarks and suggestions for further study are made in the conclusion chapter

Language Switching using Augmentative and Alternative Communication: An Investigation of Spanish-English Bilingual Children with and without Language Impairments

Children with severe speech and language impairments may rely on augmentative and alternative communication (AAC) for a variety of communicative functions. Despite the availability of bilingual AAC devices that allow the user to communicate in more than one language and alternate between languages, little research has addressed assessment and intervention concerns for bilingual children who use AAC. This study investigated the ability of bilingual children with and without language impairments to discriminate between languages using a bilingual AAC app during a cued language switching task. Participants included 58 English-Spanish bilingual children ages 4;0 – 6;11 (23 with language impairments). Children received standardized language assessments in English and Spanish as well as assessment of nonverbal IQ and processing speed. All participants completed an experimental language switching task in which they were asked to locate images of vocabulary words in Spanish and English using a Spanish and English speech-generating device (SGD). Parents of child participants completed a demographic information form and participated in an interview about their child’s language environments. Results of a series of hierarchical linear regressions indicated that when controlling for age, processing speed significantly predicted children’s ability on the experimental language switching task. Nonparametric tests showed no evidence of increased response times on trials where participants were required to switch between languages compared to trials where they did not switch. Further analysis indicated that language dominance, nonverbal IQ, and language abilities were not significant predictors of bilingual language switching ability using AAC. Results from this study indicated that in addition to age, processing speed ability may be an important predictor of children’s ability to language switch using AAC. This study contributes to the understanding of how young bilingual children conceptualize and discriminate between language systems. This research paves the way for further assessment and intervention studies to investigate how best to support bilingual children with language impairments and developmental disabilities who may benefit from AAC