Results 21 to 30 of about 12,280 (264)
Correlated Boolean Operators for Uncertainty Logic
, 2022 We present a correlated \textit{and} gate which may be used to propagate uncertainty and dependence through Boolean functions, since any Boolean function may be expressed as a combination of \textit{and} and \textit{not} operations. We argue that the \textit{and} gate is a bivariate copula family, which has the interpretation of constructing bivariate ...
Enrique Miralles-Dolz +3 more
openaire +4 more sources
Explainable Artificial Intelligence Using Expressive Boolean Formulas
Machine Learning and Knowledge Extraction, 2023 We propose and implement an interpretable machine learning classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit scoring and diagnosis of medical conditions.
Gili Rosenberg +8 more
doaj +1 more source
Index sets and Boolean operations [PDF]
Proceedings of the American Mathematical Society, 1982 Hay’s thesis asserts that every naturally defined class of sets of natural numbers contains an index set which is 1 1 -complete for that class and that every index set is 1 1 -complete for some naturally defined class. We formalize "naturally defined" as "effective Boolean" and establish the thesis as a Metatheorem.
openaire +1 more source
Implicit modeling of narrow vein type ore bodies based on Boolean combination constraints
Scientific 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
Engineering 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
Nature 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
Journal 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
Applied 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
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
Boolean operations between two colliding shells: a robust, exact, and simple method
Journal 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