Results 11 to 20 of about 1,460,452 (290)
Inference of a probabilistic Boolean network from a single observed temporal sequence [PDF]
, 2007 The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states.
Xiao, Y. +3 more
core +4 more sources
Electroforming-Free, Self-Rectifying Selector-Only Memory With Diffusive Cu-Ion Dynamics for Logic-In-Memory Computing. [PDF]
Adv Sci (Weinh)Electroforming‐free, self‐rectifying switching with polarity‐dependent threshold modulation is realized in selector‐only memory through Cu‐ion migration in a bilayer stacked dual functional materials. Ultrafast rupturing of Cu filament enables drift‐free operation with high stability.
Kim JK +7 more
europepmc +2 more sources
Quantum algorithms for testing and learning Boolean functions [PDF]
, 2013 We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Floess, Dominik +2 more
core +1 more source
Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 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
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 more
core +1 more source
DIMENSIONAL ADJUSTMENTS FOR BOOLEAN OPERATIONS [PDF]
, 2021 One of the benefits of the 3MF language is that it allows to encode a single geometry representation when multiple instances of the same object are willed to be printed.
INC, HP
core +1 more source
Highlighting Women in Operations Research and Their Achievements [PDF]
, 2021 The article of record may be found at https://www.mors.org/Publications/PhalanxThe Women in MORS Community of Practice is highlighting groundbreaking women in operations research (OR) past and present.
Carlucci, Renee, Henningsen, Jacqueline
core +2 more sources
Fast Calculation Algorithm of Approximations in Rough Sets Based on Matrices [PDF]
Jisuanji 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
ACM 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
A Graph Theoretic Approach to Construct Desired Cryptographic Boolean Functions
Axioms, 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