Results 31 to 40 of about 13,872 (307)

A Hierarchy of Algebras for Boolean Subsets [PDF]

open access: yes, 2020
We present a collection of axiom systems for the construction of Boolean subalgebras of larger overall algebras. The subalgebras are defined as the range of a complement-like operation on a semilattice. This technique has been used, for example, with the
Möller, Bernhard   +3 more
core   +1 more source

Implicit modeling of narrow vein type ore bodies based on Boolean combination constraints

open access: yesScientific Reports, 2022
In this paper, we implement an automatic modeling method for narrow vein type ore bodies based on Boolean combination constraints. Different from the direct interpolation approach, we construct the implicit functions of the hanging wall and foot wall ...
Deyun Zhong   +3 more
doaj   +1 more source

RG-Based (k, n)-Threshold Visual Cryptography with Abilities of OR and XOR Decryption

open access: yesEngineering Proceedings, 2023
A (k, n) visual cryptography (VCS) is used to build a system for secret sharing. The system divides a secret image (S) into n shares and recovers S by stacking shares bigger than or equal to k, while shares below k provide no information about S.
Yu-Ru Lin, Justie Su-Tzu Juan
doaj   +1 more source

Frequency-domain ultrafast passive logic: NOT and XNOR gates

open access: yesNature Communications, 2020
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

Nondeterminism and boolean operations in pda's

open access: yesJournal of Computer and System Sciences, 1978
AbstractThere are nondeterministic context-free languages that cannot be expressed as a Boolean formula over deterministic context-free languages. The closure of the context-free languages under intersection does not yield closure under complementation.
openaire   +1 more source

Optimization Method of Assembly Tolerance Types Based on Degree of Freedom

open access: yesApplied Sciences, 2023
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

Idealising mesh modelling for haptic enabled services and operands

open access: yes, 2012
Communicating the knowledge and science of product engineering, analysis and manufacturing planning is an area of continued research driven by the digital economy.
Arnez, Victor   +9 more
core   +1 more source

Deciphering transcriptional plasticity in pancreatic ductal adenocarcinoma reveals alterations in sensory neuron innervation

open access: yesMolecular Oncology, EarlyView.
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

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

The Boolean pivot operation M-matrices, and reducible matrices

open access: yes, 1993
Let A be a Boolean n × n matrix, and let G = (N, U) be the corresponding diagraph, where N ≔ {1,…,n} is the set of vertices and U ⊂ N × N is the set of arcs of G.
H. Väliaho, Väliaho, H.
core   +1 more source

Home - About - Disclaimer - Privacy