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ę "behavior modeling" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Cellular Automata and Many-Particle Systems Modeling Aggregation Behavior Among Populations
    Autorzy:
    Morale, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/929762.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    równanie różniczkowe stochastyczne
    równanie różniczkowo-całkowe
    cellular automata
    individual-based models
    stochastic differential equations
    law of large numbers
    density dependence
    nonlinear integrodifferential equations
    Opis:
    A cellular automaton model is presented in order to describe mutual interactions among the individuals of a population due to social decisions.The scheme is used for getting qualitative results, comparable to field experiments carried out on a population of ants which present an aggregative behavior. We also present a second description of a biological spatially structured population of N individuals by a system of stochastic differential equations of Ito type. A 'law of large numbers' to a continuum dynamics described by an integro-differential equation is given.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2000, 10, 1; 157-173
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids
    Autorzy:
    Kołodziej, J.
    Xhafa, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/907798.pdf
    Data publikacji:
    2011
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    przetwarzanie siatkowe
    szeregowanie
    bezpieczeństwo
    computational grids
    scheduling
    non-cooperative games
    user behavior
    security
    meta-heuristics
    Opis:
    Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies, user privileges, etc. On the other, CGs have hierarchical nature and therefore any computational model should be able to effectively express the hierarchical architecture in the optimization model. Recently, researchers have been investigating the use of game theory for modeling user requirements regarding task and resource allocation in grid scheduling problems. In this paper we present two general non-cooperative game approaches, namely, the symmetric non-zero sum game and the asymmetric Stackelberg game for modeling grid user behavior defined as user requirements. In our game-theoretic approaches we are able to cast new requirements arising in allocation problems, such as asymmetric users relations, security and reliability restrictions in CGs. For solving the games, we designed and implemented GA-based hybrid schedulers for approximating the equilibrium points for both games. The proposed hybrid resolution methods are experimentally evaluated through the grid simulator under heterogeneity, and large-scale and dynamics conditions. The relative performance of the schedulers is measured in terms of the makespan and flowtime metrics. The experimental analysis showed high efficiency of meta-heuristics in solving the game-based models, especially in the case of an additional cost of secure task scheduling to be paid by the users.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2011, 21, 2; 243-257
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    ATiPreTA: An analytical model for time-dependent prediction of terrorist attacks
    Autorzy:
    Kebir, Oussama
    Nouaouri, Issam
    Rejeb, Lilia
    Ben Said, Lamjed
    Powiązania:
    https://bibliotekanauki.pl/articles/2172121.pdf
    Data publikacji:
    2022
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    terrorist attack
    attack classification
    mathematical modeling
    dynamic behavior simulation
    damage prediction
    atak terrorystyczny
    klasyfikacja ataku
    model matematyczny
    przewidywanie szkód
    Opis:
    In counter-terrorism actions, commanders are confronted with difficult and important challenges. Their decision-making processes follow military instructions and must consider the humanitarian aspect of the mission. In this paper, we aim to respond to the question: What would the casualties be if governmental forces reacted in a given way with given resources? Within a similar context, decision-support systems are required due to the variety and complexity of modern attacks as well as the enormous quantity of information that must be treated in real time. The majority of mathematical models are not suitable for real-time events. Therefore, we propose an analytical model for a time-dependent prediction of terrorist attacks (ATiPreTA). The output of our model is consistent with casualty data from two important terrorist events known in Tunisia: Bardo and Sousse attacks. The sensitivity and experimental analyses show that the results are significant. Some operational insights are also discussed.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2022, 32, 3; 495--510
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Construction of algebraic and difference equations with a prescribed solution space
    Autorzy:
    Moysis, L.
    Karampetakis, N. P.
    Powiązania:
    https://bibliotekanauki.pl/articles/330046.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algebraic equation
    difference equation
    behavior
    exact modeling
    autoregressive representation
    discrete time system
    higher order system
    równanie algebraiczne
    równanie różnicowe
    system czasu dyskretnego
    system wyższego rzędu
    Opis:
    This paper studies the solution space of systems of algebraic and difference equations, given as auto-regressive (AR) representations A(σ) β (k) = 0, where σ denotes the shift forward operator and A(σ) is a regular polynomial matrix. The solution space of such systems consists of forward and backward propagating solutions, over a finite time horizon. This solution space can be constructed from knowledge of the finite and infinite elementary divisor structure of A(σ) . This work deals with the inverse problem of constructing a family of polynomial matrices A(σ) such that the system A(σ) β (k) = 0 satisfies some given forward and backward behavior. Initially, the connection between the backward behavior of an AR representation and the forward behavior of its dual system is showcased. This result is used to construct a system satisfying a certain backward behavior. By combining this result with the method provided by Gohberg et al. (2009) for constructing a system with a forward behavior, an algorithm is proposed for computing a system satisfying the prescribed forward and backward behavior.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 1; 19-32
    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