Results 11 to 20 of about 146 (117)
Notions and applications of algorithmic randomness [PDF]
Algorithmic randomness uses computability theory to define notions of randomness for infinite objects such as infinite binary sequences. The different possible definitions lead to a hierarchy of randomness notions. In this thesis we study this hierarchy,
Vermeeren, Stijn
core +6 more sources
A mathematical theory of synchronous concurrent algorithms [PDF]
A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock.
Thompson, Benjamin Criveli
core +9 more sources
A hierarchy of ramified theories below primitive recursive arithmetic [PDF]
The arithmetical theory EA(I;O) developed by Çagman, Ostrin and Wainer ([18] and [48]) provides a formal setting for the variable separation of Bellantoni-Cook predicative recursion [6].
Spoors, Elliott John
core +6 more sources
Hardware acceleration of number theoretic transform for zk‐SNARK
An FPGA‐based hardware accelerator with a multi‐level pipeline is designed to support the large‐bitwidth and large‐scale NTT tasks in zk‐SNARK. It can be flexibly scaled to different scales of FPGAs and has been equipped in the heterogeneous acceleration system with the help of HLS and OpenCL.
Haixu Zhao +6 more
wiley +1 more source
A Convenient Category of Domains [PDF]
topological spaces, generalising the usual ω-continuous dcppos of domain theory. Our category supports all the standard constructions of domain theory, including the solution of recursive domain equations.
Ingo Battenfeld +6 more
core +1 more source
Assessment of Gibbs Free Energy Calculation in PI‐Controlled Heating
For description and control of chemical processes in lab or industry thermodynamic variable Gibbs free energy provides opportunity to compare and interpret phenomena, even on a quantitative level. In a case study for PI‐controlled heating, impacts on its limits from control delay until parameter quantization are highlighted and assessed.
Jannik Dutschke +4 more
wiley +1 more source
ABSTRACT This paper develops Masked Asset–Regime Scenario Diffusion (MARS‐Diff), a leakage‐disciplined framework for probabilistic forecasting of multiday portfolio losses. The framework combines a regularized heterogeneous autoregressive model with exogenous predictors (HAR‐X) as its anchor, a train‐only masked representation of a high‐dimensional ...
Çağlar Sözen, Mervenur Sözen
wiley +1 more source
Institutional Diversity in Banking and Economic Complexity
ABSTRACT In this paper, we test whether institutional diversity in banking systems is beneficial to economic complexity, using data for Italian provinces in the period 1998–2017. We compute different indexes that consider diversity from an ownership, institutional, business model and competition point of view and find that higher diversity has a ...
Beniamino Pisicoli
wiley +1 more source
Catalan Bounds for Symmetric Strength‐Two Orthogonal Arrays
ABSTRACT A Hamming shell construction is a two‐level array obtained by taking every binary vector of a given Hamming weight a prescribed number of times, for each weight in turn. Such arrays are invariant under all permutations of the factors, and they are strength‐two orthogonal arrays exactly when the multiplicities satisfy three linear constraints ...
Ruwan C. Karunanayaka
wiley +1 more source
The Strong Nash‐Williams Orientation Theorem for Rayless Graphs
ABSTRACT In 1960, Nash‐Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of arc‐disjoint directed paths between any two vertices is at least half the number of undirected edge‐disjoint paths between them (rounded down).
Max Pitz, Jacob Stegemann
wiley +1 more source

