4 results
Search Results
2. LMI approach to stability for a competitive Lotka–Volterra system with time-varying delays
- Author
-
Sun, Yuan Gong and Meng, Fan Wei
- Subjects
- *
MATRICES (Mathematics) , *PAPER , *EQUALITY , *EQUILIBRIUM - Abstract
Abstract: This paper considers the problem of local asymptotic stability for a competitive Lotka–Volterra system with time-varying delays. By employing a linear matrix inequality (LMI) approach, we not only prove that the local asymptotic stability of the positive equilibrium for the Lotka–Volterra type competitive system will be preserved for suitable delays under a well known condition, but also obtain the maximal allowable length of delays by using Matlab’s Control Systems Toolbox to solve a feasible LMI. Compared with some known results, our estimate on the length of delays is less conservative. [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF
3. Cuts leaving components of given minimum order
- Author
-
Hellwig, Angelika, Rautenbach, Dieter, and Volkmann, Lutz
- Subjects
- *
PAPER , *EQUALITY , *POLITICAL science , *DEMOCRACY - Abstract
Abstract: For a connected graph G, the restricted edge-connectivity is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that each component of contains at least p vertices. In the present paper we introduce the more general parameter defined as the minimum cardinality of an edge-cut over all edge-cuts S such that one component of contains at least p vertices and another component of contains at least q vertices where p and q are positive integers. Analogously, we define as the minimum cardinality of a vertex-cut over all vertex-cuts such that one component of contains at least p vertices and another component of contains at least q vertices. A connected graph G is -connected (-connected), if () is well-defined. First we give useful equivalences to -connectivity and -connectivity and characterize the classes of graphs which are -connected and -connected. Then we prove which generalizes Whitney''s well-known inequality . Finally, we characterize the class of graphs for which is minimum, i.e. and the class of graphs for which is maximum, i.e. or . [Copyright &y& Elsevier]
- Published
- 2005
- Full Text
- View/download PDF
4. Self-Reliance and Empathy: The Enemies of Poverty—and of the Poor.
- Author
-
Lane, Robert E.
- Subjects
PAPER ,SELF-reliance ,EMPATHY ,POVERTY ,POOR people ,POST-industrial society theory ,PHYSICAL distribution of goods ,PSYCHOLOGICAL research ,NATIONAL socialism & justice ,FRATERNAL organizations - Abstract
Starting with a brief review of why all post-industrial societies tend to be inegalitarian, this paper develops two main themes: (1) how the idea that people are individually responsible for their own fates reduces poverty but impedes redistribution, and (2) how both the loose ties of individuals to their societies and the selective nature of their empathy and pity for others reduces compassion for the poor, making redistribution unlikely. The first theme is elaborated through psychological research on dispositional versus circumstantial attributions, showing their effects on the widely shared belief in a just world and more generally on the prevailing theory of the justice of deserts. The attribution-affect-action model is used to show how dispositional attributions evoke either anger or pity for victims and, if anger, then unwillingness to help. The development of the second theme shows how people divorce their own fates from those of their nations, how the basic tendency to favor the familiar and similar limits support for redistribution, how converting concern regarding deprivations of the self to concern for (fraternal) deprivation of people like the self excludes those who most need help, how envy fails to lead to redistribution, and finally, how people's ideas of the privileged and the disadvantaged reflect market values and often mark the poor and the different as overprivileged. [ABSTRACT FROM AUTHOR]
- Published
- 2001
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.