Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Xu, X" wg kryterium: Autor


Wyświetlanie 1-4 z 4
Tytuł:
A unified approach to stability analysis of switched linear descriptor systems under arbitrary switching
Autorzy:
Zhai, G.
Xu, X.
Powiązania:
https://bibliotekanauki.pl/articles/907764.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
układ komutowany
układ deskrypcyjny
stabilność
komutacja dowolna
nierówność macierzy
LMI
switched linear descriptor systems
stability
arbitrary switching
linear matrix inequalities (LMIs)
common quadratic Lyapunov functions
Opis:
We establish a unified approach to stability analysis for switched linear descriptor systems under arbitrary switching in both continuous-time and discrete-time domains. The approach is based on common quadratic Lyapunov functions incorporated with linear matrix inequalities (LMIs). We show that if there is a common quadratic Lyapunov function for the stability of all subsystems, then the switched system is stable under arbitrary switching. The analysis results are natural extensions of the existing results for switched linear state space systems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 249-259
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Extended Lie algebraic stability analysis for switched systems with continuous-time and discrete–time subsystems
Autorzy:
Zhai, G.
Xu, X.
Lin, H.
Liu, D.
Powiązania:
https://bibliotekanauki.pl/articles/929816.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
układ komutowany
funkcja Lapunowa
algebra Lie'go
stateczność wykładnicza
switched systems
common quadratic Lyapunov functions
Lie algebra
exponential stability
arbitrary switching
dwell time scheme
Opis:
We analyze stability for switched systems which are composed of both continuous-time and discrete-time subsystems. By considering a Lie algebra generated by all subsystem matrices, we show that if all subsystems are Hurwitz/Schur stable and this Lie algebra is solvable, then there is a common quadratic Lyapunov function for all subsystems and thus the switched system is exponentially stable under arbitrary switching. When not all subsystems are stable and the same Lie algebra is solvable, we show that there is a common quadratic Lyapunov-like function for all subsystems and the switched system is exponentially stable under a dwell time scheme. Two numerical examples are provided to demonstrate the result.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 447-454
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stability and Hopf bifurcation analysis for a Lotka-Volterra predator-prey model with two delays
Autorzy:
Xu, C.
Liao, M.
He, X.
Powiązania:
https://bibliotekanauki.pl/articles/907822.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
opóźnienie
stabilność
bifurkacja Hopfa
predator-prey model
delay
stability
Hopf bifurcation
Opis:
In this paper, a two-species Lotka-Volterra predator-prey model with two delays is considered. By analyzing the associated characteristic transcendental equation, the linear stability of the positive equilibrium is investigated and Hopf bifurcation is demonstrated. Some explicit formulae for determining the stability and direction of Hopf bifurcation periodic solutions bifurcating from Hopf bifurcations are obtained by using normal form theory and center manifold theory. Some numerical simulations for supporting the theoretical results are also included.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 97-107
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient connected dominating set algorithm in WSNs based on the induced tree of the crossed cube
Autorzy:
Zhang, J.
Xu, L.
Zhou, S. M.
Wu, W.
Ye, X.
Powiązania:
https://bibliotekanauki.pl/articles/330830.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
wireless sensor networks
connected dominating set
induced tree
approximation algorithm
crossed cube
bezprzewodowa sieć sensorowa
podgrafy indukowane
algorytm aproksymacyjny
Opis:
The connected dominating set (CDS) has become a well-known approach for constructing a virtual backbone in wireless sensor networks. Then traffic can forwarded by the virtual backbone and other nodes turn off their radios to save energy. Furthermore, a smaller CDS incurs fewer interference problems. However, constructing a minimum CDS is an NP-hard problem, and thus most researchers concentrate on how to derive approximate algorithms. In this paper, a novel algorithm based on the induced tree of the crossed cube (ITCC) is presented. The ITCC is to find a maximal independent set (MIS), which is based on building an induced tree of the crossed cube network, and then to connect the MIS nodes to form a CDS. The priority of an induced tree is determined according to a new parameter, the degree of the node in the square of a graph. This paper presents the proof that the ITCC generates a CDS with a lower approximation ratio. Furthermore, it is proved that the cardinality of the induced trees is a Fibonacci sequence, and an upper bound to the number of the dominating set is established. The simulations show that the algorithm provides the smallest CDS size compared with some other traditional algorithms.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 295-309
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies