1,721,018 research outputs found
Lie-algebraic conditions for exponential stability of switched systems
No full textIt has recently been shown that a family of exponentially stable linear systems whose matrices generate a solvable Lie algebra possesses a quadratic common Lyapunov function, which implies that the corresponding switched linear system is exponentially stable for arbitrary switching. In this paper we prove that the same properties hold under the weaker condition that the Lie algebra generated by given matrices can be decomposed into a sum of a solvable ideal and a subalgebra with a compact Lie group. The corresponding local stability result for nonlinear switched systems is also established. Moreover, we demonstrate that if a Lie algebra fails to satisfy the above condition, then it can be generated by a family of stable matrices such that the corresponding switched linear system is not stable. Relevant facts from the theory of Lie algebras are collected at the end of the paper for easy reference
On robust Lie-algebraic stability conditions for switched linear systems
No full textThis paper presents new suffcient conditions for
exponential stability of switched linear systems under arbitrary
switching, which involve the commutators (Lie brackets) among
the given matrices generating the switched system. The main
novel feature of these stability criteria is that, unlike their
earlier counterparts, they are robust with respect to small perturbations
of the system parameters. Two distinct approaches
are investigated. For discrete-time switched linear systems, we
formulate a stability condition in terms of an explicit upper
bound on the norms of the Lie brackets. For continuous-time
switched linear systems, we develop two stability criteria which
capture proximity of the associated matrix Lie algebra to a
solvable or a solvable plus compact Lie algebra, respectively
Lie-algebraic stability criteria for switched systems
No full textAbstract. It was recently shown that a family of exponentially stable linear systems whose matrices generate a solvable Lie algebra possesses a quadratic common Lyapunov function, which implies that the corresponding switched linear system is exponentially stable for arbitrary switching. In this paper we prove that the same properties hold under the weaker condition that the Lie algebra generated by given matrices can be decomposed into a sum of a solvable ideal and a subalgebra with a compact Lie group. The corresponding local stability result for nonlinear switched systems is also established. Moreover, we demonstrate that if a Lie algebra fails to satisfy the above condition, then it can be generated by a family of stable matrices such that the corresponding switched linear system is not stable. Relevant facts from the theory of Lie algebras are collected at the end of the paper for easy reference
Integral-Input-to-State Stability of Switched Nonlinear Systems under Slow Switching
No full textIn this paper we study integral-input-to-state stability (iISS) of nonlinear switched systems with jumps. We demonstrate by examples that iISS is not always preserved under slow enough dwell time switching, and then we present sufficient conditions for iISS to be preserved under slow switching. These conditions involve, besides a sufficiently large dwell time, some additional properties of comparison functions characterizing iISS of the individual modes. When the sufficient conditions that guarantee iISS are only partially satisfied, we are then able to conclude weaker variants of iISS, also introduced in this work. As an illustration, we show that switched systems with bilinear zero-input-stable modes are always iISS under sufficiently large dwell time
Quasi-integral-input-to-state stability for switched nonlinear systems
No full textIn this paper we introduce and give sufficient conditions for the quasi-iISS property for switched nonlinear systems under dwell-time switching signals. Unlike previous works, our dwell-time bound does not rely on the knowledge of the state but it relies only on the system initial condition and the bound on the input energy. We prove, through a counterexample, that knowledge of the system initial state and bound on input energy is necessary for the estimation of a dwell-time that guarantees quasi-iISS for the switched system. An illustrative example is also included
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Get PDF“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Get PDFWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Get PDFWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
