Leslie (1945) models the evolution in discrete time of a closed, single-sex population with discrete age groups by multiplying a vector describing the age structure by a matrix containing the birth and death rates. We suppose that successive matrices are chosen according to a Markov chain from a finite set of matrices. We find exactly the long-run rate of growth and expected age structure. We g...

This paper presents a new synthesis procedure (design algorithm) for cellular neural networks (CNN’s) with a space-invariant cloning template with applications to associative memories. In the present synthesis procedure, the design problem is formulated as a set of linear inequalities, and the inequalities are solved using the well-known perceptron training algorithm. When desired memory patter...

We present a complete set of new flavour-permutation-symmetric mixing observables. We give expressions for these “plaquette invariants”, both in terms of the mixing matrix elements alone, and in terms of manifestly Jarlskog-invariant functions of fermion mass matrices. While these quantities are unconstrained in the Standard Model, we point out that remarkably, in the case of leptonic mixing, t...

We present a novel ultimate bound and invariant set computation method for continuous-time switched linear systems with disturbances and arbitrary switching. The proposed method relies on the existence of a transformation that takes all matrices of the switched linear system into a convenient form satisfying certain properties. The method provides ultimate bounds and invariant sets in the form ...

This paper deals with problems of parity space-based fault detection for a class of discrete-time linear Markovian jump systems. A new algorithm is firstly introduced to reduce the computation of mode-dependent redundancy relation parameter matrices. Different from the case of linear time invariant systems, the parity space-based residual generator for a Markovian jump system cannot be designed...