Zobrazeno 1 - 10
of 2 792
pro vyhledávání: '"A. A. Rot"'
Autor:
A. A. Rotkovich, D. I. Tishkevich, S. A. German, A. A. Bondaruk, S. V. Leonchik, E. S. Dashkevich, V. M. Fedosyuk, A. V. Trukhanov
Publikováno v:
Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, Vol 21, Iss 6, Pp 5-13 (2024)
Сomposite materials based on the epoxy resin–W system with varying W content (0–80 %) were obtained using the method of chemical curing. Microstructural investigations of the samples showed that with increasing W content there is a more uniform
Externí odkaz:
https://doaj.org/article/ec6f0c77608a470d99f55bbdfa5a1d8c
The paper "Sorting with Bialgebras and Distributive Laws" by Hinze et al. uses the framework of bialgebraic semantics to define sorting algorithms. From distributive laws between functors they construct pairs of sorting algorithms using both folds an
Externí odkaz:
http://arxiv.org/abs/2412.08362
Autor:
Kocsis, Bálint, Rot, Jurriaan
Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a complete test suite, which guarantees that if an implementation satisfy
Externí odkaz:
http://arxiv.org/abs/2411.13412
The Kantorovich distance is a widely used metric between probability distributions. The Kantorovich-Rubinstein duality states that it can be defined in two equivalent ways: as a supremum, based on non-expansive functions into [0, 1], and as an infimu
Externí odkaz:
http://arxiv.org/abs/2411.12333
While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is currently missing.
Externí odkaz:
http://arxiv.org/abs/2410.14460
Probabilistic programs are a powerful and convenient approach to formalise distributions over system executions. A classical verification problem for probabilistic programs is temporal inference: to compute the likelihood that the execution traces sa
Externí odkaz:
http://arxiv.org/abs/2407.10465
Active automata learning (AAL) is a method to infer state machines by interacting with black-box systems. Adaptive AAL aims to reduce the sample complexity of AAL by incorporating domain specific knowledge in the form of (similar) reference models. S
Externí odkaz:
http://arxiv.org/abs/2406.19714
We define a framework for incorporating alternation-free fixpoint logics into the dual-adjunction setup for coalgebraic modal logics. We achieve this by using order-enriched categories. We give a least-solution semantics as well as an initial algebra
Externí odkaz:
http://arxiv.org/abs/2405.00237
Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability for a wide
Externí odkaz:
http://arxiv.org/abs/2404.16588
In this paper, two mesh-free CFD solvers for pore-scale fluid flow through porous media are considered, namely the Lattice Boltzmann Method with the two relaxation time collision term and the direct Navier-Stokes solver under the artificial compressi
Externí odkaz:
http://arxiv.org/abs/2404.14195