Results 31 to 40 of about 145,870 (284)
Linear operators that preserve Boolean rank of Boolean matrices [PDF]
Let \(A,B,C\) be Boolean matrices such that \(A=BC\), and let \(k\) be the number of columns of \(B\) (equal to the number of rows of \(C\)). For given \(A\), the minimum \(k\) for which \(B,C\) exist is called the Boolean rank of \(A\). In [Linear Algebra Appl. 59, 55--77 (1984; Zbl 0536.20044)] \textit{L. B. Beasley} and \textit{N. J. Pullman} showed
Beasley, LeRoy B., Song, Seok-Zun
openaire +2 more sources
Frequency-domain ultrafast passive logic: NOT and XNOR gates
Typically, Boolean logic gates have to compromise between high speed and low energy consumption which can become limiting at scale. Here, the authors demonstrate architectures for NOT and XNOR gates that enable simultaneous low power and fast operation.
Reza Maram +8 more
doaj +1 more source
Optimization Method of Assembly Tolerance Types Based on Degree of Freedom
The automatic generation of tolerance specifications is an important aspect of achieving digital product design. An obvious feature of the current automatic generation of tolerance based on rule reasoning is that all tolerance types will be inferred for ...
Guanghao Liu, Meifa Huang, Leilei Chen
doaj +1 more source
Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
Boolean operations between two colliding shells: a robust, exact, and simple method
Boolean operations are classic procedures in computer-aided design, and allow the creation of complex objects by combining simple objects. Although Boolean operations are trivial in implicit surface representations, they are problematic in polygonal ...
Jerome CHARTON +2 more
doaj +1 more source
Term-Level Reasoning in Support of Bit-blasting [PDF]
GL is a verified tool for proving ACL2 theorems using Boolean methods such as BDD reasoning and satisfiability checking. In its typical operation, GL recursively traverses a term, computing a symbolic object representing the value of each subterm.
Sol Swords
doaj +1 more source
Generating and Searching Families of FFT Algorithms [PDF]
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT).
Haynal, Heidi, Haynal, Steve
core
The exponential map in non-commutative probability
The wrapping transformation $W$ is a homomorphism from the semigroup of probability measures on the real line, with the convolution operation, to the semigroup of probability measures on the circle, with the multiplicative convolution operation.
Anshelevich, Michael, Arizmendi, Octavio
core +1 more source
Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials
Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai +2 more
wiley +1 more source
Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco +8 more
wiley +1 more source

