Results 21 to 30 of about 14,682 (204)

Transformation Method for Solving System of Boolean Algebraic Equations

open access: yesMathematics, 2021
In recent years, various methods and directions for solving a system of Boolean algebraic equations have been invented, and now they are being very actively investigated. One of these directions is the method of transforming a system of Boolean algebraic
Dostonjon Barotov   +6 more
doaj   +1 more source

Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020
Combinational circuits (combinational parts of sequential circuits) are considered. Masking of internal nodes faults with applying sub-circuit, inputs of which are connected to the circuit inputs and outputs — to the circuit proper internal nodes, is ...
Matrosova, Angela Yu.   +2 more
doaj   +1 more source

Fast Calculation Algorithm of Approximations in Rough Sets Based on Matrices [PDF]

open access: yesJisuanji gongcheng, 2023
The calculation of upper and lower approximations is the core issue in rough set theory. Matrices can provide an efficient method for calculating the upper and lower approximations of concepts in rough set models.
XU Yi, HOU Di
doaj   +1 more source

A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions

open access: yesAxioms, 2019
In this paper, we present four product operations to construct cryptographic boolean functions from smaller ones with predictable Walsh spectrum. A lot of cryptographic properties of boolean functions can be presented by their Walsh spectrum.
Modjtaba Ghorbani   +3 more
doaj   +1 more source

BoolSurf

open access: yesACM Transactions on Graphics, 2022
We port Boolean set operations between 2D shapes to surfaces of any genus, with any number of open boundaries. We combine shapes bounded by sets of freely intersecting loops, consisting of geodesic lines and cubic Bézier splines lying on a surface. We compute the arrangement of shapes directly on the surface and assign integer labels to the cells of ...
Riso M.   +5 more
openaire   +1 more source

Arbitrary Polygons Boolean Operation Based on GPU Rasterization [PDF]

open access: yesJisuanji 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

Linear operators that preserve Boolean rank of Boolean matrices [PDF]

open access: yesCzechoslovak 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]

open access: yesScientific 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

Universal logic-in-memory cell enabling all basic Boolean algebra logic

open access: yesScientific 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

Transition Complexity of Incomplete DFAs [PDF]

open access: yesElectronic 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

Home - About - Disclaimer - Privacy