7 resultados para JIT, Just-in-Time
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
An application of the heterogeneous variables system prediction method to solving the time series analysis problem with respect to the sample size is considered in this work. It is created a logical-and-probabilistic correlation from the logical decision function class. Two ways is considered. When the information about event is kept safe in the process, and when it is kept safe in depending process.
Resumo:
In the presented work the problem of generalized natural environment model of emergency monitoring is presented. The approach, based on using CASE-based technologies is proposed for methodology development in solving this problem. Usage of CASE-based technology and knowledge databases allow for quick and interactive monitoring of current natural environment state and allow to develop adequate model for just-in- time possible emergency modeling.
Resumo:
MSC 2010: 34A08 (main), 34G20, 80A25
Resumo:
Multitype branching processes (MTBP) model branching structures, where the nodes of the resulting tree are particles of different types. Usually such a process is not observable in the sense of the whole tree, but only as the “generation” at a given moment in time, which consists of the number of particles of every type. This requires an EM-type algorithm to obtain a maximum likelihood (ML) estimate of the parameters of the branching process. Using a version of the inside-outside algorithm for stochastic context-free grammars (SCFG), such an estimate could be obtained for the offspring distribution of the process.
Resumo:
2000 Mathematics Subject Classification: 60J80, 60J85, 62P10, 92D25.
Resumo:
2000 Mathematics Subject Classification: 62J05, 62G35
Resumo:
We describe an approach for recovering the plaintext in block ciphers having a design structure similar to the Data Encryption Standard but with improperly constructed S-boxes. The experiments with a backtracking search algorithm performing this kind of attack against modified DES/Triple-DES in ECB mode show that the unknown plaintext can be recovered with a small amount of uncertainty and this algorithm is highly efficient both in time and memory costs for plaintext sources with relatively low entropy. Our investigations demonstrate once again that modifications resulting to S-boxes which still satisfy some design criteria may lead to very weak ciphers. ACM Computing Classification System (1998): E.3, I.2.7, I.2.8.