Results 31 to 40 of about 2,300,412 (294)
Explainable Artificial Intelligence Using Expressive Boolean Formulas
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
Correlated Boolean Operators for Uncertainty Logic
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
Implicit modeling of narrow vein type ore bodies based on Boolean combination constraints
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
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
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
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
Index sets and Boolean operations [PDF]
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
Optimization Method of Assembly Tolerance Types Based on Degree of Freedom
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
On the Structure of Events in Boolean Games [PDF]
Conventional Boolean games embody two important assumptions: (i) all events in the game occur simultaneously; and (ii) assignments to variables must be made in complete ignorance of the values assigned to other variables.
Bradfield, Julian; id_orcid +2 more
core
Symmetry‐Guided Multifunctional Acoustic System Based on Mechanically Actuated Sonic Crystals
This study presents the design, simulation, and experimental validation of amultifunctional acoustic metamaterial based on rotationally engineered sonic crystals.By tuning cylinder orientations, controllable band gaps and six distinct functionalities—including switching, topological insulation, beam splitting, and logic operations—areachieved ...
Yuanyan Zhao +2 more
wiley +1 more source

