[PDF][PDF] Матричнозначные корреляционные меры и многомерные тесты независимости

ЕМ Суханова - 2008 - static.freereferats.ru
Ученый секретарь диссертационного совета Д. 501.001. 85 при МГУ, доктор
физикоматематических наук, профессор ИН Сергеев ении многомерного непараметрического …

Contribution au développement de stratégies de diagnostic à base de modèles pour les véhicules spatiaux-Application à une mission de rentrée atmosphérique

A Falcoz - 2009 - tel.archives-ouvertes.fr
Les travaux présentés dans ce mémoire s'inscrivent dans le cadre d'un projet de dimension
européenne réalisé en partenariat avec l'Agence Spatiale Européenne et EADS Astrium sur …

Efficient bounded reachability computation for rectangular automata

X Chen, E Ábrahám, G Frehse - International Workshop on Reachability …, 2011 - Springer
We present a new approach to compute the reachable set with a bounded number of jumps
for a rectangular automaton. The reachable set under a flow transition is computed as a …

Engineering constraint solvers for automatic analysis of probabilistic hybrid automata

M Fränzle, T Teige, A Eggers - The Journal of Logic and Algebraic …, 2010 - Elsevier
In this article, we recall different approaches to the constraint-based, symbolic analysis of
hybrid discrete-continuous systems and combine them to a technology able to address hybrid …

[BOOK][B] On the Complement of r-disjoint k-parabolic Subspace Arrangements

JA White - 2010 - search.proquest.com
… That is, for any hyperplane arrangement Ji?, there is a related zonotope Z(Jf) associated to
it. See Ziegler [47] for more details about zonotopes. However, given any essential subspace …

[BOOK][B] On the discrete fundamental groups of the associahedron and cyclohedron

C Severs - 2009 - search.proquest.com
Discrete homotopy theory, or A-theory, is a recently developed area of algebraic combinatorics.
This dissertation uses the tools of A-theory to study two polytopes, the associahedron …

Compositional bounded reachability using time partitioning and abstraction

J Green - 2012 - ideals.illinois.edu
Automatic verification of cyber-physical systems (CPS) typically involves computing the
reachable set of states of such systems. This computation is known to be exponential in the …

Fault Detection and Identification relying on set-membership Identifiability

N Verdière, C Jauberthie, L Travé-Massuyès - IFAC Proceedings Volumes, 2012 - Elsevier
Identifiability is the property that a mathematical model must satisfy to guarantee an unambiguous
mapping between its parameters and the output trajectories. It is of prime importance …

An output feedback distributed predictive control algorithm

M Farina, R Scattolini - 2011 50th IEEE Conference on Decision …, 2011 - ieeexplore.ieee.org
This paper presents an output feedback Distributed Predictive Control (DPC) algorithm for
interconnected systems based on neighbor-to-neighbor communication. The algorithm, based …

Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization

ST McCormick, S Fujishige - Mathematical Programming, 2010 - Springer
Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions
with several applications. Recently Fujishige and Iwata showed how to extend the Iwata, …