Displaying similar documents to “On Hales-Jewett's theorem.”

Non-fragile sampled data H ∞ filtering of general continuous Markov jump linear systems

Mouquan Shen, Guangming Zhang, Yuhao Yuan, Lei Mei (2014)

Kybernetika

Similarity:

This paper is concerned with the non-fragile sampled data H ∞ filtering problem for continuous Markov jump linear system with partly known transition probabilities (TPs). The filter gain is assumed to have additive variations and TPs are assumed to be known, uncertain with known bounds and completely unknown. The aim is to design a non-fragile H ∞ filter to ensure both the robust stochastic stability and a prescribed level of H ∞ performance for the filtering error dynamics. Sufficient conditions...

Efficient application of e-invariants in finite element method for an elastodynamic equation

Martin Balazovjech, Ladislav Halada (2013)

Kybernetika

Similarity:

We introduce a new efficient way of computation of partial differential equations using a hybrid method composed from FEM in space and FDM in time domain. The overall computational scheme is explicit in time. The key idea of the suggested way is based on a transformation of standard basis functions into new basis functions. The results of this matrix transformation are e-invariants (effective invariants) with such suitable properties which save the number of arithmetical operations needed...

Observer design for a class of nonlinear discrete-time systems with time-delay

Yali Dong, Jinying Liu, Shengwei Mei (2013)

Kybernetika

Similarity:

The problem of observer design for a class of nonlinear discrete-time systems with time-delay is considered. A new approach of nonlinear observer design is proposed for the class of systems. Based on differential mean value theory, the error dynamic is transformed into linear parameter variable system. By using Lyapunov stability theory and Schur complement lemma, the sufficient conditions expressed in terms of matrix inequalities are obtained to guarantee the observer error converges...

Regular Expression Quantifiers - at least m Occurrences

Michał Trybulec (2008)

Formalized Mathematics

Similarity:

This is the second article on regular expression quantifiers. [4] introduced the quantifiers m to n occurrences and optional occurrence. In the sequel, the quantifiers: at least m occurrences and positive closure (at least 1 occurrence) are introduced. Notation and terminology were taken from [8], several properties of regular expressions from [7].MML identifier: FLANG 3, version: 7.8.05 4.89.993