Results 1 - 10 of 616

Basic problems in stability and design of switched systems

by Daniel Liberzon, A. Stephen Morse - IEEE Control Systems Magazine , 1999
"... By a switched system, we mean a hybrid dynamical system consisting of a family of continuous-time subsystems and a rule that orchestrates the switching between them. This article surveys recent developments in three basic problems regarding stability and design of switched systems. These problems ar ..."
Abstract - Cited by 379 (10 self) - Add to MetaCart
By a switched system, we mean a hybrid dynamical system consisting of a family of continuous-time subsystems and a rule that orchestrates the switching between them. This article surveys recent developments in three basic problems regarding stability and design of switched systems. These problems

On flux coupling analysis of metabolic subsystems

by Sayed-Amir Marashi, Laszlo David, Alexander Bockmayr - JOURNAL OF THEORETICAL BIOLOGY , 2012
"... Genome-scale metabolic networks are useful tools for achieving a system-level understanding of metabolism. However, due to their large size, analysis of such networks may be difficult and algorithms can be very slow. Therefore, some authors have suggested to analyze subsystems instead of the origina ..."
Abstract - Cited by 4 (3 self) - Add to MetaCart
of fully, partially or directionally coupled reactions may be detected as uncoupled in certain subsystems. Interestingly, this behavior is the opposite of the flux coupling changes that may occur due to missing reactions, or equivalently, deletion of reactions. Computational experiments suggest

Subsystem Structural Analysis

by Mehdi S. Zarghamee, Daniel W. Eggers, Ömer O. Erbay, Frank W. Kan, Yasuo Kitane, Atis A. Liepins, Michael Mudlock, Wassim I. Naguib, Rasko P. Ojdrovic, Andrew T. Sarawit, Peter R. Barrett, John L. Gross, Therese P. Mcallister, Mehdi S. Zarghamee, Said Bolourchi, Daniel W. Eggers, Ömer O. Erbay, Frank W. Kan, Yasuo Kitane, Atis A. Liepins, Michael Mudlock, Wassim I. Naguib, Rasko P. Ojdrovic, Andrew T. Sarawit, Simpson Gumpertz, Heger Inc, Peter R. Barrett, John L. Gross, Therese P. Mcallister , 2005
"... Certain commercial entities, equipment, products, or materials are identified in this document in order to describe a procedure or concept adequately or to trace the history of the procedures and practices used. Such identification is not intended to imply recommendation, endorsement, or implication ..."
Abstract - Add to MetaCart
Certain commercial entities, equipment, products, or materials are identified in this document in order to describe a procedure or concept adequately or to trace the history of the procedures and practices used. Such identification is not intended to imply recommendation, endorsement

E-Unification for Subsystems of S4

by Renate A. Schmidt , 1998
"... This paper is concerned with the unification problem in the path logics associated by the optimised functional translation method with the propositional modal logics K, KD, KT, KD4, S4 and S5. It presents improved unification algorithms for certain forms of the right identity and associativity laws. ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
This paper is concerned with the unification problem in the path logics associated by the optimised functional translation method with the propositional modal logics K, KD, KT, KD4, S4 and S5. It presents improved unification algorithms for certain forms of the right identity and associativity laws

An Approximate Newton-Like Coupling of Subsystems

by J. Menck , 1998
"... Introduction Complex technical systems are often assembled by coupling well-known subsystems together. Typically, all of these units can be attacked with reliable solvers, maybe even specialized software packages, as long as they stand alone. It may however be doubtful how to handle them if they al ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
The synthetic approach: Try to combine the given subsystem solvers to get a solver for the coupled system. The analytic approach is for example the basis of the well-established flowsheeting software SPEEDUP [5]. While it certainly has a lot of advantages, there can still be good reasons to stick

A Minimal Subsystem of the Kari-Culik

by Jason Siefken , 2014
"... The Kari-Culik tilings are formed from a set of 13 Wang tiles that tile the plane only aperiodically. They are the smallest known set of Wang tiles to do so and are not as well understood as other examples of aperiodic Wang tiles. We show that the Z2 action by translation on a certain subset of the ..."
Abstract - Add to MetaCart
The Kari-Culik tilings are formed from a set of 13 Wang tiles that tile the plane only aperiodically. They are the smallest known set of Wang tiles to do so and are not as well understood as other examples of aperiodic Wang tiles. We show that the Z2 action by translation on a certain subset

Minimal Infeasible Subsystems and Benders cuts

by Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette , 2008
"... There are many situations in mathematical programming where cutting planes can be generated by solving a certain “cut generation linear program ” whose feasible solutions define a family of valid inequalities for the problem at hand. Disjunctive cuts and Benders cuts are two familiar examples. In th ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
There are many situations in mathematical programming where cutting planes can be generated by solving a certain “cut generation linear program ” whose feasible solutions define a family of valid inequalities for the problem at hand. Disjunctive cuts and Benders cuts are two familiar examples

Formalizing forcing arguments in subsystems of secondorder arithmetic

by Jeremy Avigad - Annals of Pure and Applied Logic , 1996
"... We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmetic can be formalized in the base theory, thereby converting them to effective proof-theoretic arguments. We use this method to sharpen conservation theorems of Harrington and Brown-Simpson, giving an ..."
Abstract - Cited by 17 (9 self) - Add to MetaCart
We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmetic can be formalized in the base theory, thereby converting them to effective proof-theoretic arguments. We use this method to sharpen conservation theorems of Harrington and Brown-Simpson, giving

Classification of Subsystems for Local Nets with Trivial Superselection Structure

by Sebastiano Carpi, Roberto Conti , 2008
"... Let F be a local net of von Neumann algebras in four spacetime dimensions satisfying certain natural structural assumptions. We prove that if F has trivial superselection structure then every covariant, Haag-dual subsystem B is of the form FG 1 ⊗ I for a suitable decomposition F = F1 ⊗ F2 and a comp ..."
Abstract - Cited by 10 (3 self) - Add to MetaCart
Let F be a local net of von Neumann algebras in four spacetime dimensions satisfying certain natural structural assumptions. We prove that if F has trivial superselection structure then every covariant, Haag-dual subsystem B is of the form FG 1 ⊗ I for a suitable decomposition F = F1 ⊗ F2 and a

Quantum Equilibrium and the Origin of Absolute Uncertainty

by Detlef Dürr, Sheldon Goldstein, Nino Zanghí , 1992
"... The quantum formalism is a "measurement" formalism--a phenomenological formalism describing certain macroscopic regularities. We argue that it can be regarded, and best be understood, as arising from Bohmian mechanics, which is what emerges from Schr6dinger's equation for a system of ..."
Abstract - Cited by 167 (52 self) - Add to MetaCart
The quantum formalism is a "measurement" formalism--a phenomenological formalism describing certain macroscopic regularities. We argue that it can be regarded, and best be understood, as arising from Bohmian mechanics, which is what emerges from Schr6dinger's equation for a system
Results 1 - 10 of 616