Results 1 to 10 of about 595,275 (166)
Non-cascade random walks in solid-state high harmonic generation [PDF]
Random walks—both classical and quantum—unlocked new possibilities in search algorithms and information processing. Although linear photonic systems, with flexible tunability and multiple degrees of freedom, have served as efficient carriers for random ...
Zitan Zuo +7 more
doaj +2 more sources
On Generalized Random Railways [PDF]
We consider a random generalized railway defined as a random 3-regular multigraph where some vertices are regarded as switches that only allow traffic between certain pairs of attached edges. It is shown that the probability that the generalized railway is functioning is linear in the proportion of switches.
Hans Garmo +2 more
openaire +2 more sources
Some simple varieties of trees arising in permutation analysis [PDF]
After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees.
Mathilde Bouvel +2 more
doaj +1 more source
Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers [PDF]
We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ non ...
Frédérique Bassino, Cyril Nicaud
doaj +1 more source
Modelling Bimodal Data Using a Multivariate Triangular-Linked Distribution
Bimodal distributions have rarely been studied although they appear frequently in datasets. We develop a novel bimodal distribution based on the triangular distribution and then expand it to the multivariate case using a Gaussian copula. To determine the
Daan de Waal +3 more
doaj +1 more source
HIGHER RANDOMNESS AND GENERICITY [PDF]
We use concepts of continuous higher randomness, developed in Bienvenuet al.[‘Continuous higher randomness’, J. Math. Log. 17(1) (2017).], to investigate$\unicode[STIX]{x1D6F1}_{1}^{1}$-randomness. We discuss lowness for$\unicode[STIX]{x1D6F1}_{1}^{1}$-randomness, cupping with$\unicode[STIX]{x1D6F1}_{1}^{1}$-random sequences, and an analogue of the ...
NOAM GREENBERG, BENOIT MONIN
openaire +3 more sources
Object grammars and random generation [PDF]
This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars.
I. Dutour, Jean-Marc Fedou
doaj +3 more sources
Boltzmann Oracle for Combinatorial Systems [PDF]
Boltzmann random generation applies to well-defined systems of recursive combinatorial equations. It relies on oracles giving values of the enumeration generating series inside their disk of convergence.
Carine Pivoteau +2 more
doaj +1 more source
Combinatorial specification of permutation classes [PDF]
This article presents a methodology that automatically derives a combinatorial specification for the permutation class $\mathcal{C} = Av(B)$, given its basis $B$ of excluded patterns and the set of simple permutations in $\mathcal{C}$, when these sets ...
Frédérique Bassino +4 more
doaj +1 more source
Generation S-box and P-layer For PRESENT Algorithm Based On 6D Hyper Chaotic System
In the era of data-driven applications and resource-constrained devices, the need for lightweight algorithms has become increasingly important. Lightweight algorithms refer to computational techniques that strike a balance between efficiency and ...
Mohammed D. Taha, Khalid A. Hussein
doaj +1 more source

