27,204 research outputs found
Protein Structure Determination Using Chemical Shifts
In this PhD thesis, a novel method to determine protein structures using
chemical shifts is presented.Comment: Univ Copenhagen PhD thesis (2014) in Biochemistr
The saturation conjecture (after A. Knutson and T. Tao)
In this exposition we give a simple and complete treatment of A. Knutson and
T. Tao's recent proof (http://front.math.ucdavis.edu/math.RT/9807160) of the
saturation conjecture, which asserts that the Littlewood-Richardson semigroup
is saturated. The main tool is Knutson and Tao's hive model for
Berenstein-Zelevinsky polytopes. In an appendix of W. Fulton it is shown that
the hive model is equivalent to the original Littlewood-Richardson rule.Comment: Latex document, 12 pages, 24 figure
Distributed Robustness Analysis of Interconnected Uncertain Systems Using Chordal Decomposition
Large-scale interconnected uncertain systems commonly have large state and
uncertainty dimensions. Aside from the heavy computational cost of solving
centralized robust stability analysis techniques, privacy requirements in the
network can also introduce further issues. In this paper, we utilize IQC
analysis for analyzing large-scale interconnected uncertain systems and we
evade these issues by describing a decomposition scheme that is based on the
interconnection structure of the system. This scheme is based on the so-called
chordal decomposition and does not add any conservativeness to the analysis
approach. The decomposed problem can be solved using distributed computational
algorithms without the need for a centralized computational unit. We further
discuss the merits of the proposed analysis approach using a numerical
experiment.Comment: 3 figures. Submitted to the 19th IFAC world congres
Distributed Robust Stability Analysis of Interconnected Uncertain Systems
This paper considers robust stability analysis of a large network of
interconnected uncertain systems. To avoid analyzing the entire network as a
single large, lumped system, we model the network interconnections with
integral quadratic constraints. This approach yields a sparse linear matrix
inequality which can be decomposed into a set of smaller, coupled linear matrix
inequalities. This allows us to solve the analysis problem efficiently and in a
distributed manner. We also show that the decomposed problem is equivalent to
the original robustness analysis problem, and hence our method does not
introduce additional conservativeness.Comment: This paper has been accepted for presentation at the 51st IEEE
Conference on Decision and Control, Maui, Hawaii, 201
Robust Stability Analysis of Sparsely Interconnected Uncertain Systems
In this paper, we consider robust stability analysis of large-scale sparsely
interconnected uncertain systems. By modeling the interconnections among the
subsystems with integral quadratic constraints, we show that robust stability
analysis of such systems can be performed by solving a set of sparse linear
matrix inequalities. We also show that a sparse formulation of the analysis
problem is equivalent to the classical formulation of the robustness analysis
problem and hence does not introduce any additional conservativeness. The
sparse formulation of the analysis problem allows us to apply methods that rely
on efficient sparse factorization techniques, and our numerical results
illustrate the effectiveness of this approach compared to methods that are
based on the standard formulation of the analysis problem.Comment: Provisionally accepted to appear in IEEE Transactions on Automatic
Contro
- …