Results 11 to 20 of about 148,474 (293)

Rough operations on Boolean algebras [PDF]

open access: yesInformation Sciences, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qi, G., Liu, Weiru
openaire   +3 more sources

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

Boolean operations between two colliding shells: a robust, exact, and simple method

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2017
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

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

On Defining SPARQL with Boolean Tensor Algebra [PDF]

open access: yes, 2015
The Resource Description Framework (RDF) represents information as subject-predicate-object triples. These triples are commonly interpreted as a directed labelled graph. We propose an alternative approach, interpreting the data as a 3-way Boolean tensor.
Metzler, Saskia, Miettinen, Pauli
core   +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

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

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

Efficient Groundness Analysis in Prolog [PDF]

open access: yes, 2002
Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs.
Howe, Jacob M., King, Andy
core   +4 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

Home - About - Disclaimer - Privacy