Linear operators that preserve Boolean rank of Boolean matrices [PDF]
Czechoslovak Mathematical Journal, 2013 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 +4 more sources
Electroforming-Free, Self-Rectifying Selector-Only Memory With Diffusive Cu-Ion Dynamics for Logic-In-Memory Computing. [PDF]
Adv Sci (Weinh)Electroforming‐free, self‐rectifying switching with polarity‐dependent threshold modulation is realized in selector‐only memory through Cu‐ion migration in a bilayer stacked dual functional materials. Ultrafast rupturing of Cu filament enables drift‐free operation with high stability.
Kim JK +7 more
europepmc +2 more sources
Inference of a probabilistic Boolean network from a single observed temporal sequence [PDF]
, 2007 The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states.
Xiao, Y. +3 more
core +4 more sources
Probabilistic Computing via Gate-Tunable Random Telegraph Noise. [PDF]
Adv Sci (Weinh)Intrinsic random telegraph noise in metal–oxide–semiconductor field‐effect transistors is harnessed to create gate‐tunable probabilistic bits. By modulating carrier‐trapping dynamics, the device produces stochastic binary outputs with a continuous bias‐to‐probability transfer.
Yun G +8 more
europepmc +2 more sources
Inferring context-sensitive probablistic boolean networks from gene expression data under multi-biological conditions [PDF]
, 2007 In recent years biological microarrays have emerged as a high-throughput data acquisition technology in bioinformatics. In conjunction with this, there is an increasing need to develop frameworks for the formal analysis of biological pathways. A modeling
Marshall, Stephen, Yu, Le
core +4 more sources
Integration of Reconfigurable p-Bit and 1R Crossbar Array for Memristive Probabilistic Computing. [PDF]
Adv Sci (Weinh)A memristive probabilistic computing system is demonstrated by integrating stochastic p‐bits based on volatile memristors with a 1R crossbar array encoding interaction weights. The system performs weighted‐sum operations across the array and updates p‐bits iteratively.
Soh K +7 more
europepmc +2 more sources
A Usability Study on Widget Design for Selecting Boolean Operations
Multimodal Technologies and Interaction, 2022 Applying the correct set of Boolean operations is a fundamental task in constructive solid geometry (CSG), which is a staple in automated manufacturing systems.
Diogo Chambel Lopes +5 more
doaj +1 more source
Responsive Open Microfluidic Logic for Mechanical Computing. [PDF]
Adv Sci (Weinh)Coupling elasticity with capillarity transforms mechanical compression into binary fluidic states, enabling deterministic logic in open microfluidic circuits. This work demonstrates that computation can emerge from interactions between mechanic and fluidic domains, establishing a general strategy for embedding information processing directly within ...
Almog R, Pinchasik BE.
europepmc +2 more sources
Quantum algorithms for testing and learning Boolean functions [PDF]
, 2013 We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Floess, Dominik +2 more
core +1 more source
Rough operations on Boolean algebras [PDF]
Information Sciences, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guilin Qi, Weiru Liu
openaire +1 more source