Results 21 to 30 of about 1,460,452 (290)
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 +2 more sources
Arithmetic and Boolean Operations on Recursively Run-Length Compressed Natural Numbers [PDF]
Scientific Annals of Computer Science, 2014 We study arithmetic properties of a new tree-based canonical num- ber representation, recursively run-length compressed natural numbers, defined by applying recursively a run-length encoding of their binary digits.
P. Tarau
doaj +1 more source
Arbitrary Polygons Boolean Operation Based on GPU Rasterization [PDF]
Jisuanji gongcheng, 2018 The Boolean operation of arbitrary polygons is mostly based on the CPU grid method,because of the serialization of CPU,the raster process takes a long time.In order to solve the above problem,an algorithm for polygon Boolean operations based on the ...
GAO Yi,LUO Jianxin,QIU Hangping,WU Bo
doaj +1 more source
Universal logic-in-memory cell enabling all basic Boolean algebra logic
Scientific Reports, 2022 Among the promising approaches for implementing high-performance computing, reconfigurable logic gates and logic-in-memory (LIM) approaches have been drawing increased research attention.
Eunwoo Baek, Kyoungah Cho, Sangsig Kim
doaj +1 more source
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
Evolving sensitivity balances Boolean networks [PDF]
, 2012 We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman’s Ergodic Set and use it to study the long term dynamics of a BN. We
Turner, Matthew S. +9 more
core +2 more sources
Highlighting Women in Operations Research and Their Achievements [PDF]
, 2020 The article of record may be found at https://www.mors.org/Publications/PhalanxThe Women in MORS (WiM) Community of Practice (CoP) is highlighting groundbreaking women in operations research (OR) past and present. This article profiles Dr.
Stewart, Sarah +2 more
core +2 more sources
Transition Complexity of Incomplete DFAs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 In this paper, we consider the transition complexity of regular languages based on the incomplete deterministic finite automata. A number of results on Boolean operations have been obtained.
Yuan Gao, Kai Salomaa, Sheng Yu
doaj +1 more source
Boolean Differential Operators
, 2012 We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.
Catumba, Jorge, Díaz, Rafael
openaire +3 more sources
Современные информационные технологии и IT-образование, 2019 We consider vector mappings over the set of 0 and 1 given by the set of Boolean functions. Boolean functions included in the map are given in ANF. Having fixed the rule according to which the binary vectors are associated with the elements of a finite ...
Sergey A. Belov
doaj +1 more source