An extensive English language bibliography on graph theory and its applications

Bibliography on graph theory and its application

In Defense of Dynamical Explanation

Proponents of mechanistic explanation have argued that dynamical models are mere phenomenal models, in that they describe rather than explain the scientific phenomena produced by complex systems. I argue instead that dynamical models can, in fact, be explanatory. Using an example from neuroscientific research on epilepsy, I show that dynamical models can meet the explanatory demands met by mechanistic models, and as such occupy their own unique place within the space of explanatory scientific models

Quantum control theory and applications: A survey

This paper presents a survey on quantum control theory and applications from a control systems perspective. Some of the basic concepts and main developments (including open-loop control and closed-loop control) in quantum control theory are reviewed. In the area of open-loop quantum control, the paper surveys the notion of controllability for quantum systems and presents several control design strategies including optimal control, Lyapunov-based methodologies, variable structure control and quantum incoherent control. In the area of closed-loop quantum control, the paper reviews closed-loop learning control and several important issues related to quantum feedback control including quantum filtering, feedback stabilization, LQG control and robust quantum control.Comment: 38 pages, invited survey paper from a control systems perspective, some references are added, published versio

Institute for Computational Mechanics in Propulsion (ICOMP)

The Institute for Computational Mechanics in Propulsion (ICOMP) is a combined activity of Case Western Reserve University, Ohio Aerospace Institute (OAI) and NASA Lewis. The purpose of ICOMP is to develop techniques to improve problem solving capabilities in all aspects of computational mechanics related to propulsion. The activities at ICOMP during 1991 are described

Finding weakly reversible realizations of chemical reaction networks using optimization

An algorithm is given in this paper for the computation of dynamically equivalent weakly reversible realizations with the maximal number of reactions, for chemical reaction networks (CRNs) with mass action kinetics. The original problem statement can be traced back at least 30 years ago. The algorithm uses standard linear and mixed integer linear programming, and it is based on elementary graph theory and important former results on the dense realizations of CRNs. The proposed method is also capable of determining if no dynamically equivalent weakly reversible structure exists for a given reaction network with a previously fixed complex set.Comment: 18 pages, 9 figure