RNA processing and Arabidopsis flowering time control.

Plants control their flowering time in order to ensure that they reproduce under favourable conditions. The components involved in this complex process have been identified using a molecular genetic approach in Arabidopsis and classified into genetically separable pathways. The autonomous pathway controls the level of mRNA encoding a floral repressor, FLC, and comprises three RNA-binding proteins, FCA, FPA and FLK. FCA interacts with the 3'-end RNA-processing factor FY to autoregulate its own expression post-transcriptionally and to control FLC. Other components of the autonomous pathway, FVE and FLD, regulate FLC epigenetically. This combination of epigenetic and post-transcriptional control gives precision to the control of FLC expression and flowering time.

An allelic series reveals essential roles for FY in plant development in addition to flowering-time control

The autonomous pathway functions to promote flowering in Arabidopsis by limiting the accumulation of the floral repressor FLOWERING LOCUS C (FLC). Within this pathway FCA is a plant-specific, nuclear RNA-binding protein, which interacts with FY, a highly conserved eukaryotic polyadenylation factor. FCA and FY function to control polyadenylation site choice during processing of the FCA transcript. Null mutations in the yeast FY homologue Pfs2p are lethal. This raises the question as to whether these essential RNA processing functions are conserved in plants. Characterisation of an allelic series of fy mutations reveals that null alleles are embryo lethal. Furthermore, silencing of FY, but not FCA, is deleterious to growth in Nicotiana. The late-flowering fy alleles are hypomorphic and indicate a requirement for both intact FY WD repeats and the C-terminal domain in repression of FLC. The FY C-terminal domain binds FCA and in vitro assays demonstrate a requirement for both C-terminal FY-PPLPP repeats during this interaction. The expression domain of FY supports its roles in essential and flowering-time functions. Hence, FY may mediate both regulated and constitutive RNA 3'-end processing.

Representations and algorithms for finite-state bisimulations of linear discrete-time control systems

While a large amount of research over the past two decades has focused on discrete abstractions of infinite-state dynamical systems, many structural and algorithmic details of these abstractions remain unknown. To clarify the computational resources needed to perform discrete abstractions, this paper examines the algorithmic properties of an existing method for deriving finite-state systems that are bisimilar to linear discrete-time control systems. We explicitly find the structure of the finite-state system, show that it can be enormous compared to the original linear system, and give conditions to guarantee that the finite-state system is reasonably sized and efficiently computable. Though constructing the finite-state system is generally impractical, we see that special cases could be amenable to satisfiability based verification techniques. ©2009 IEEE.

Decentralised minimum-time consensus

We consider the discrete-time dynamics of a network of agents that exchange information according to a nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.

Time-optimal control of a 3-level quantum system and its generalization to an n-level system

We solve the problem of steering a three-level quantum system from one eigen-state to another in minimum time and study its possible extension to the time-optimal control problem for a general n-level quantum system. For the three-level system we find all optimal controls by finding two types of symmetry in the problem: ℤ2 × S3 discrete symmetry and S1 continuous symmetry, and exploiting them to solve the problem through discrete reduction and symplectic reduction. We then study the geometry, in the same framework, which occurs in the time-optimal control of a general n-level quantum system. © 2007 IEEE.

Time-optimal control of a 3-level quantum system and its generalization

We solve the problem of steering a three-level quantum system from one eigen-state to another in minimum time and study its possible extension to the time-optimal control problem for a general n-level quantum system. For the three-level system we find all optimal controls by finding two types of symmetry in the problems: ℤ × S3 discrete symmetry and 51 continuous symmetry, and exploiting them to solve the problem through discrete reduction and symplectic reduction. We then study the geometry, in the same framework, which occurs in the time-optimal control of a general n-level quantum system. Copyright ©2007 Watam Press.

Minimum maneuver time calculation using convex optimization

The problem of calculating the minimum lap or maneuver time of a nonlinear vehicle, which is linearized at each time step, is formulated as a convex optimization problem. The formulation provides an alternative to previously used quasi-steady-state analysis or nonlinear optimization. Key steps are: the use of model predictive control; expressing the minimum time problem as one of maximizing distance traveled along the track centerline; and linearizing the track and vehicle trajectories by expressing them as small displacements from a fixed reference. A consequence of linearizing the vehicle dynamics is that nonoptimal steering control action can be generated, but attention to the constraints and the cost function minimizes the effect. Optimal control actions and vehicle responses for a 90 deg bend are presented and compared to the nonconvex nonlinear programming solution. Copyright © 2013 by ASME.

The unidirectional emptying box

A theoretical description of the turbulent mixing within and the draining of a dense fluid layer from a box connected to a uniform density, quiescent environment through openings in the top and the base of the box is presented in this paper. This is an extension of the draining model developed by Linden et al. (Annu. Rev. Fluid Mech. vol. 31, 1990, pp. 201-238) and includes terms that describe localized mixing within the emptying box at the density interface. Mixing is induced by a turbulent flow of replacement fluid into the box and as a consequence we predict, and observe in complementary experiments, the development of a three-layer stratification. Based on the data collated from previous researchers, three distinct formulations for entrainment fluxes across density interfaces are used to account for this localized mixing. The model was then solved numerically for the three mixing formulations. Analytical solutions were developed for one formulation directly and for a second on assuming that localized mixing is relatively weak though still significant in redistributing buoyancy on the timescale of the draining process. Comparisons between our theoretical predictions and the experimental data, which we have collected on the developing layer depths and their densities show good agreement. The differences in predictions between the three mixing formulations suggest that the normalized flux turbulently entrained across a density interface tends to a constant value for large values of a Froude number FrT, based on conditions of the inflow through the top of the box, and scales as the cube of FrT for small values of FrT. The upper limit on the rate of entrainment into the mixed layer results in a minimum time (tD) to remove the original dense layer. Using our analytical solutions, we bound this time and show that 0.2tE ≈tD tE, i.e. the original dense layer may be depleted up to five times more rapidly than when there is no internal mixing and the box empties in a time tE. © 2010 Cambridge University Press.

Efficient minimum manoeuvre time optimisation of an oversteering vehicle at constant forward speed

A receding horizon steering controller is presented, capable of pushing an oversteering nonlinear vehicle model to its handling limit while travelling at constant forward speed. The controller is able to optimise the vehicle path, using a computationally efficient and robust technique, so that the vehicle progression along a track is maximised as a function of time. The resultant method forms part of the solution to the motor racing objective of minimising lap time. © 2011 AACC American Automatic Control Council.