Boolean networks (BNs) are discrete-time dynamical systems with Boolean state-variables. BNs are recently attracting considerable interest as computational models for biological systems and, in particular, as models of gene regulating networks. Boolean control networks (BCNs) are Boolean networks with Boolean inputs. We consider the problem of steering a BCN from a given state to a desired stat...

The Acrobot, a two-link arm that is unactuated at the first joint, is challenging to control because it is an under actuated, nonlinear, continuous system. We describe a direct search algorithm for finding swingup trajectories for the Acrobot. The algorithm uses a Iookahead search that maximizes the Acrobot’s totaf energy in an N-step window. Because the controls are extremal and the number of ...

We investigate the constant amplitude nature of several time-optimal input shaping designs for controlling exible structures. We rst discuss the equivalence of the time-optimal zero-vibration shaper with the traditional time-optimal control problem. Then we show that several robust time-optimal shaper designs for exible systems are equivalent to the time-optimal controls for diierent systems. T...

A generalised minimum variance controller is developed for linear time-varying systems. The plants to be controlled are described using a controlled autoregressive moving average model and are exponentially stable. Both, the plant parameters and the noise variance are time-varying. The generalised minimum variance cost functional is the sum of a tracking error variance between a filtered plant ...

In this paper we give new results on the fault{tolerance capabilities of the star graph. We rst consider the problem of determining the maximum number r(n) of vertices in a n! vertices star graph S n such that by removing any set of vertices and/or edges from S n of cardinality at most r(n) the diameter of S n does not increase. Subsequently, we give an algorithm for broadcasting a message in S...

IPTV stands for Internet Protocol Television, and any user with an IP device such as a smart phone can get IPTV service anywhere and anytime as long as the user can access the Internet. Because of this advantage, IPTV is widely believed to be the next killer internet application, and many organizations provide IPTV services. As IPTV becomes popular, formal proofs of IPTV service quality have be...

A filter family with minimum product of the impulse response duration and the frequency bandwidth is considered. The impulse response spread is characterized by the higher order moments. For the frequency spread measure, the second order moment is used. Minimizing products of the moments, causal systems with the largest energy concentration in time for a given bandwidth are obtained. The result...

We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to reach a location against all possible choices of the opponent We do not put any syntactic restriction on the game structure, nor do we require any player to guarantee time divergence. We only require players to use physically r...

We investigate the minimum weight path problem in networks whose link weights and link delays are both functions of time. We demonstrate that in general there exist cases in which no finite path is optimal leading us to define an infinite path (naturally, containing loops) in such a way that the minimum weight problem always has a solution. We also characterize the structure of an infinite opti...

Fire-growth modeling on complex landscapes can be approached as a search for the minimum time for fire to travel among nodes in a two-dimensional network. The paths producing minimum travel time between nodes are then interpolated to reveal the fire perimeter positions at an instant in time. These fire perimeters and their fire behavior characteristics (e.g., spread rate, fireline intensity) ar...