Results 1 to 10 of about 794 (137)
Higher-Order Interactions and Their Duals Reveal Synergy and Logical Dependence beyond Shannon-Information [PDF]
Information-theoretic quantities reveal dependencies among variables in the structure of joint, marginal, and conditional entropies while leaving certain fundamentally different systems indistinguishable. Furthermore, there is no consensus on the correct
Abel Jansma
doaj +2 more sources
Monotone, free, and boolean cumulants: A shuffle algebra approach [PDF]
final ...
Kurusch Ebrahimi-Fard +1 more
exaly +4 more sources
A pipeline for megahertz X‐ray photon correlation spectroscopy on soft matter samples at the MID instrument of European XFEL [PDF]
We present a standardized and highly automated pipeline for megahertz X‐ray photon correlation spectroscopy (MHz‐XPCS) on soft‐matter samples at the MID instrument of the European XFEL. The workflow addresses AGIPD petabyte‐scale data handling, detector‐artifact correction, correlation analysis and FAIR data output, enabling routine MHz‐XPCS with ...
Aliaksandr Leonau +30 more
wiley +2 more sources
In \cite{BH20} an elegant choice-free construction of a canonical extension of a boolean algebra $B$ was given as the boolean algebra of regular open subsets of the Alexandroff topology on the poset of proper filters of $B$. We make this construction point-free by replacing the Alexandroff space of proper filters of $B$ with the free frame $\mathcal{L}$
G Bezhanishvili +2 more
exaly +5 more sources
Digital Circuit Design Utilizing Equation Solving over ‘Big’ Boolean Algebras [PDF]
A task frequently encountered in digital circuit design is the solution of a two-valued Boolean equation of the form h(X,Y,Z)=1, where h: B_2^(k+m+n)→ B_2 and X,Y, and Z are binary vectors of lengths k, m, and n, representing inputs, intermediary values,
Ali Muhammad Ali Rushdi, Waleed Ahmad
doaj +1 more source
Free skew Boolean algebras [PDF]
We study the structure and properties of free skew Boolean algebras (SBAs). For finite generating sets, these free algebras are finite and we give their representation as a product of primitive algebras and provide formulas for calculating their cardinality.
Ganna Kudryavtseva, Jonathan Leech
openaire +2 more sources
Control systems theory revisited: new insights on the brain clocks of time-to-action
To outline the complex biological rhythms underlying the time-to-action of goal-oriented behavior in the adult brain, we employed a Boolean Algebra model based on Control Systems Theory.
Sari Goldstein Ferber +3 more
doaj +1 more source
The Algebraic Sets of Broad Algebras
The paper is devoted to the questions of algebraic geometry of universal algebras, more precisely, to the structures of algebraic sets of this algebras. It is introduced the concept of broad universal algebra.
A.G. Pinus
doaj +1 more source
Representing free Boolean algebras [PDF]
Summary: Partitioner algebras are defined in [\textit{J. E. Baumgartner} and \textit{M. Weese}, Trans. Am. Math. Soc. 274, 619-630 (1982; Zbl 0515.03032)] and are natural tools for studying the properties of maximal almost disjoint families of subsets of \(\omega\).
Dow, Alan, Nyikos, Peter
openaire +2 more sources
De Morgan Functions and Free De Morgan Algebras
It is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone ...
Movsisyan Yu. M. +2 more
doaj +1 more source

