Single event molecular signalling for estimation and control

Cell biology is characterised by low molecule numbers and coupled stochastic chemical reactions with intrinsic noise permeating and dominating the interactions between molecules. Recent work [9] has shown that in such environments there are hard limits on the accuracy with which molecular populations can be controlled and estimated. These limits are predicated on a continuous diffusion approximation of the target molecule (although the remainder of the system is non-linear and discrete). The principal result of [9] assumes that the birth rate of the signalling species is linearly dependent on the target molecule population size. In this paper, we investigate the situation when the entire system is kept discrete, and arbitrary non-linear coupling is allowed between the target molecule and downstream signalling molecules. In this case it is possible, by relying solely on the event triggered nature of control and signalling reactions, to define non-linear reaction rate modulation schemes that achieve improved performance in certain parameter regimes. These schemes would not appear to be biologically relevant, raising the question of what are an appropriate set of assumptions for obtaining biologically meaningful results. © 2013 EUCA.

Trajectory control based on discrete full-range dynamics

There has been an increasing interest in the use of mechanical dynamics, (e.g., assive, Elastic, And viscous dynamics) for energy efficient and agile control of robotic systems. Despite the impressive demonstrations of behavioural performance, The mechanical dynamics of this class of robotic systems is still very limited as compared to those of biological systems. For example, Passive dynamic walkers are not capable of generating joint torques to compensate for disturbances from complex environments. In order to tackle such a discrepancy between biological and artificial systems, We present the concept and design of an adaptive clutch mechanism that discretely covers the full-range of dynamics. As a result, The system is capable of a large variety of joint operations, including dynamic switching among passive, actuated and rigid modes. The main innovation of this paper is the framework and algorithm developed for controlling the trajectory of such joint. We present different control strategies that exploit passive dynamics. Simulation results demonstrate a significant improvement in motion control with respect to the speed of motion and energy efficiency. The actuator is implemented in a simple pendulum platform to quantitatively evaluate this novel approach.

Continuous weak measurement and feedback control of a solid-state charge qubit: A physical unravelling of non-Lindblad master equation

Conventional quantum trajectory theory developed in quantum optics is largely based on the physical unravelling of a Lindblad-type master equation, which constitutes the theoretical basis of continuous quantum measurement and feedback control. In this work, in the context of continuous quantum measurement and feedback control of a solid-state charge qubit, we present a physical unravelling scheme of a non-Lindblad-type master equation. Self-consistency and numerical efficiency are well demonstrated. In particular, the control effect is manifested in the detector noise spectrum, and the effect of measurement voltage is discussed.

Intelligent control of avalanched photodiode to get optimal state

To improve the sensitivity of our laser radar system, we provided a set of control method for APDs (Avalanched Photodiodes) based on single-chip computer together with the circuits dealing with noise and temperature. It adjusts the voltages intelligently and maintains the APD's optimal working status.

基于克隆选择算法的非线性优化迭代学习控制；Clonal selection algorithm based nonlinear optimal iterative learning control

为实现对模型不确定的有约束非线性系统在特定时间域上输出轨迹的有效跟踪,将改进的克隆选择算法用于求解迭代学习控制中的优化问题。提出基于克隆选择算法的非线性优化迭代学习控制。在每次迭代运算后,一个克隆选择算法用于求解下次迭代运算中的最优输入,另一个克隆选择算法用于修正系统参考模型。仿真结果表明,该方法比GA-ILC具有更快的收敛速度,能够有效处理输入上的约束以及模型不确定问题,通过少数几次迭代学习就能取得满意的跟踪效果。

Switching Between Discrete and Continuous Process Models to Predict Molecular Genetic Activity

Two kinds of process models have been used in programs that reason about change: Discrete and continuous models. We describe the design and implementation of a qualitative simulator, PEPTIDE, which uses both kinds of process models to predict the behavior of molecular energetic systems. The program uses a discrete process model to simulate both situations involving abrupt changes in quantities and the actions of small numbers of molecules. It uses a continuous process model to predict gradual changes in quantities. A novel technique, called aggregation, allows the simulator to switch between theses models through the recognition and summary of cycles. The flexibility of PEPTIDE's aggregator allows the program to detect cycles within cycles and predict the behavior of complex situations.

Linear inverse problems with discrete data: II. Stability and regularization

For pt.I. see ibid. vol.1, p.301 (1985). In the first part of this work a general definition of an inverse problem with discrete data has been given and an analysis in terms of singular systems has been performed. The problem of the numerical stability of the solution, which in that paper was only briefly discussed, is the main topic of this second part. When the condition number of the problem is too large, a small error on the data can produce an extremely large error on the generalised solution, which therefore has no physical meaning. The authors review most of the methods which have been developed for overcoming this difficulty, including numerical filtering, Tikhonov regularisation, iterative methods, the Backus-Gilbert method and so on. Regularisation methods for the stable approximation of generalised solutions obtained through minimisation of suitable seminorms (C-generalised solutions), such as the method of Phillips (1962), are also considered.

Second-Order Training of Adaptive Critics for Online Process Control

A new algorithm for training of nonlinear optimal neuro-controllers (in the form of the model-free, action-dependent, adaptive critic paradigm). Overcomes problems with existing stochastic backpropagation training: need for data storage, parameter shadowing and poor convergence, offering significant benefits for online applications.

Correspondence between continuous-variable and discrete quantum systems of arbitrary dimensions

We establish a mapping between a continuous-variable (CV) quantum system and a discrete quantum system of arbitrary dimension. This opens up the general possibility to perform any quantum information task with a CV system as if it were a discrete system. The Einstein-Podolsky-Rosen state is mapped onto the maximally entangled state in any finite-dimensional Hilbert space and thus can be considered as a universal resource of entanglement. An explicit example of the map and a proposal for its experimental realization are discussed.

Distribution-based adaptive bounding genetic algorithm for continuous optimisation problems

A new search-space-updating technique for genetic algorithms is proposed for continuous optimisation problems. Other than gradually reducing the search space during the evolution process with a fixed reduction rate set ‘a priori’, the upper and the lower boundaries for each variable in the objective function are dynamically adjusted based on its distribution statistics. To test the effectiveness, the technique is applied to a number of benchmark optimisation problems in comparison with three other techniques, namely the genetic algorithms with parameter space size adjustment (GAPSSA) technique [A.B. Djurišic, Elite genetic algorithms with adaptive mutations for solving continuous optimization problems – application to modeling of the optical constants of solids, Optics Communications 151 (1998) 147–159], successive zooming genetic algorithm (SZGA) [Y. Kwon, S. Kwon, S. Jin, J. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Computers and Structures 81 (2003) 1715–1725] and a simple GA. The tests show that for well-posed problems, existing search space updating techniques perform well in terms of convergence speed and solution precision however, for some ill-posed problems these techniques are statistically inferior to a simple GA. All the tests show that the proposed new search space update technique is statistically superior to its counterparts.