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ę "przewidywanie" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
A vehicle-track-soil dynamic interaction problem in sequential and parallel formulation
Autorzy:
Kogut, J.
Ciurej, H.
Powiązania:
https://bibliotekanauki.pl/articles/907759.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
modelowanie numeryczne
identyfikacja
przewidywanie wibracji
numerical modeling
identification
vibrations prediction
Opis:
Some problems regarding numerical modeling of predicted vibrations excited by railway traffic are discussed. Model formulation in the field of structural mechanics comprises a vehicle, a track (often in a tunnel) and soil. Time consuming computations are needed to update large matrices at every discrete step. At first, a sequential Matlab code is generated. Later on, the formulation is modified to use grid computing, thereby a significant reduction in computational time is expected.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 295-303
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Least-squares estimation for a long-horizon performance index
Autorzy:
Janiszowski, K. B.
Powiązania:
https://bibliotekanauki.pl/articles/911215.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
identyfikacja
estymacja metodą najmniejszych kwadratów
przewidywanie
identification
least squares estimation
prediction
recursive scheme
Opis:
Estimation of a parametric, discrete-time model for a SISO dynamic plant, derived for minimisation of a performance index determined as a sum of squared prediction errors within some time horizon is considered. A formula for a Long-Horizon Least-Squares (LHLS) off-line solution as well as a theorem for an LHLS recursive on-line scheme are derived. The LHLS scheme reveals some features of Least-Squares (LS) estimation and Instrumental-Variable (IV) estimation. An algorithm for the on-line LHLS scheme is presented and compared with LS and IV estimation schemes for a linear, second-order system. The fast convergence of the derived LHLS on-line scheme is demonstrated in the case of detecting changes in parameters of a non-stationary system.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 559-573
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ł:
A combinatorial approach in predicting the outcome of tennis matches
Autorzy:
Šarčević, Ana
Vranić, Mihaela
Pintar, Damir
Powiązania:
https://bibliotekanauki.pl/articles/2055160.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
binomial distribution
final score prediction
independent distribution
identical distribution
predictive model
rozkład dwumianowy
przewidywanie wyniku końcowego
rozkład identyczny
model predykcji
Opis:
Tennis, as one of the most popular individual sports in the world, holds an important role in the betting world. There are two main categories of bets: pre-match betting, which is conducted before the match starts, and live betting, which allows placing bets during the sporting event. Betting systems rely on setting sports odds, something historically done by domain experts. Setting odds for live betting represents a challenge due to the need to follow events in real-time and react accordingly. In tennis, hierarchical models often stand out as a popular choice when trying to predict the outcome of the match. These models commonly leverage a recursive approach that aims to predict the winner or the final score starting at any point in the match. However, recursive expressions inherently contain computational complexity which hinders the efficiency of methods relying on them. This paper proposes a more resource-effective alternative in the form of a combinatorial approach based on a binomial distribution. The resulting accuracy of the combinatorial approach is identical to that of the recursive approach while being vastly more efficient when considering the execution time, making it a superior choice for live betting in this domain.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 3; 525--538
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New self-checking booth multipliers
Autorzy:
Hunger, M.
Marienfeld, D.
Powiązania:
https://bibliotekanauki.pl/articles/907920.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
mnożnik Booth'a
samokontrola działania
przewidywanie parzystości
Booth multiplier
self-checking
parity-prediction
carry-dependent adder
1-out-of-5 code
Opis:
This work presents the first self-checking Booth-3 multiplier and a new self-checking Booth-2 multiplier using parity prediction. We propose a method which combines error-detection of Booth-3 (or Booth-2) decoder cells and parity prediction. Additionally, code disjointness is ensured by reusing logic for partial product generation. Parity prediction is applied to a carry-save-adder with the standard sign-bit extension. In this adder almost all cells have odd fanouts and faults are detected by the parity. Only one adder cell has an even fanout in the case of Booth-3 multiplication. Especially, for even-number Booth-2 multipliers parity prediction becomes efficient. Since that prediction slightly differs from previous work which describes CSA-folded adders, formulas to predict the parity are developed here. The proposed multipliers are compared experimentally with existing solutions. Only 102% of the area of Booth-2 without error detection is needed for the self-checking Booth-3 multiplier.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 319-328
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards a health-aware fault tolerant control of complex systems: A vehicle fleet case
Autorzy:
Lipiec, Bogdan
Mrugalski, Marcin
Witczak, Marcin
Stetter, Ralf
Powiązania:
https://bibliotekanauki.pl/articles/2172125.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
FTCD
modeling bearings degradation
remaining useful life prediction
health aware fault tolerant control
Takagi-Sugeno model
przewidywanie pozostałego czasu pracy
model Takagi-Sugeno
Opis:
The paper deals with the problem of health-aware fault-tolerant control of a vehicle fleet. In particular, the development process starts with providing the description of the process along with a suitable Internet-of-Things platform, which enables appropriate communication within the vehicle fleet. It also indicates the transportation tasks to the designated drivers and makes it possible to measure their realization times. The second stage pertains to the description of the analytical model of the transportation system, which is obtained with the max-plus algebra. Since the vehicle fleet is composed of heavy duty machines, it is crucial to monitor and analyze the degradation of their selected mechanical components. In particular, the components considered are ball bearings, which are employed in almost every mechanical transportation system. Thus, a fuzzy logic Takagi–Sugeno approach capable of assessing their time-to-failure is proposed. This information is utilized in the last stage, which boils down to health-aware and fault-tolerant control of the vehicle fleet. In particular, it aims at balancing the exploitation of the vehicles in such a way as to maximize they average time-to-failure. Moreover, the fault-tolerance is attained by balancing the use of particular vehicles in such a way as to minimize the effect of possible transportation delays within the system. Finally, the effectiveness of the proposed approach is validated using selected simulation scenarios involving vehicle-based transportation tasks.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 4; 619--634
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    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