Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Xu, M." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    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 ant-based filtering random-finite-set approach to simultaneous localization and mapping
    Autorzy:
    Li, D.
    Zhu, J.
    Xu, B.
    Lu, M.
    Li, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/329854.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    simultaneous localization
    simultaneous mapping
    random finite set
    probability hypothesis density
    ant colony
    lokalizacja jednoczesna
    mapowanie jednoczesne
    algorytm mrówkowy
    Opis:
    Inspired by ant foraging, as well as modeling of the feature map and measurements as random finite sets, a novel formulation in an ant colony framework is proposed to jointly estimate the map and the vehicle trajectory so as to solve a feature-based simultaneous localization and mapping (SLAM) problem. This so-called ant-PHD-SLAM algorithm allows decomposing the recursion for the joint map-trajectory posterior density into a jointly propagated posterior density of the vehicle trajectory and the posterior density of the feature map conditioned on the vehicle trajectory. More specifically, an ant-PHD filter is proposed to jointly estimate the number of map features and their locations, namely, using the powerful search ability and collective cooperation of ants to complete the PHD-SLAM filter time prediction and data update process. Meanwhile, a novel fast moving ant estimator (F-MAE) is utilized to estimate the maneuvering vehicle trajectory. Evaluation and comparison using several numerical examples show a performance improvement over recently reported approaches. Moreover, the experimental results based on the robot operation system (ROS) platform validate the consistency with the results obtained from numerical simulations.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 505-519
    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-3 z 3

      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