Results 11 to 20 of about 20,622 (217)
Ukrainian Mathematical Journal, 2020 In the present paper, we give a series of definitions and properties of Lifting Dynamical Systems (LDS) corresponding to the notion of deterministic diffusion. We present heuristic explanations of the mechanism of formation of deterministic diffusion in LDS and the anomalous deterministic diffusion in the case of transportation in long billiard ...
Nizhnik, L. P., Nizhnik, I. L.
openaire +2 more sources
Training Deterministic Parsers with Non-Deterministic Oracles [PDF]
Transactions of the Association for Computational Linguistics, 2013 Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are deterministic and incomplete in the sense that they assume a unique canonical path through the transition system and are only valid as long as the parser does not stray ...
Yoav Goldberg, Joakim Nivre
openaire +2 more sources
Non-deterministic functions as non-deterministic processes
, 2021 Summary: We study encodings of the \(\lambda\)-calculus into the \(\pi\)-calculus in the unexplored case of calculi with \textit{non-determinism} and \textit{failures}. On the sequential side, we consider \(\lambda^\lightning_\oplus\), a new non-deterministic calculus in which intersection types control resources (terms); on the concurrent side, we ...
Joseph W. N. Paulus +2 more
openaire +4 more sources
Proceedings of the IEEE, 2011 For the purposes of this paper, gossiping is a distributed process whose purpose is to enable the members of a group of autonomous agents to asymptotically determine, in a decentralized manner, the average of the initial values of their scalar gossip variables.
Ji Liu 0001 +4 more
openaire +2 more sources
Deterministic Concurrent Systems [PDF]
, 2021 20 pages, 1 table, 6 figures, 13 bibliographical ...
openaire +2 more sources
Deterministic Algorithms for Solving Boolean Polynomial Equations Based on Channel Coding Theory
IEEE Access, 2020 Solving the satisfiability problems of Boolean polynomial equations is still an open challenge in the fields of mathematics and computer science.
Guangfu Wu +5 more
doaj +1 more source
Journal of Advances in Modeling Earth Systems, 2019 The cloud‐permitting model (CPM) of the superparameterized Community Atmosphere Model (SP‐CAM) is a stochastic parameterization. As reported in a companion paper, we have created a variant of SP‐CAM, called MP‐CAM, that uses the averaged feedback of 10 ...
Todd R. Jones +2 more
doaj +1 more source
The Deterministic Information Bottleneck [PDF]
Neural Computation, 2017 Lossy compression and clustering fundamentally involve a decision about which features are relevant and which are not. The information bottleneck method (IB) by Tishby, Pereira, and Bialek ( 1999 ) formalized this notion as an information-theoretic optimization problem and proposed an optimal trade-off between throwing away as many bits as possible ...
DJ Strouse, David J. Schwab
openaire +4 more sources
Frontiers in Mechanical Engineering, 2019 With emerging research on the dynamics of extreme fire behavior, it is increasingly important for wind models, used in operational fire prediction, to accurately capture areas of complex flow across rugged terrain. Additionally, the emergence of ensemble
Rachael Quill +5 more
doaj +1 more source
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017 Timing attacks have been a continuous threat to users' privacy in modern browsers. To mitigate such attacks, existing approaches, such as Tor Browser and Fermata, add jitters to the browser clock so that an attacker cannot accurately measure an event.
Yinzhi Cao +3 more
openaire +2 more sources