Results 31 to 40 of about 210,039 (279)
Algorithms for Quantum Branching Programs Based on Fingerprinting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs).
Farid Ablayev, Alexander Vasiliev
doaj +1 more source
Molecular 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
Stratification and enumeration of Boolean functions by canalizing depth [PDF]
, 2015 Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions.
He, Qijun, Macauley, Matthew
core +2 more sources
Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials
Advanced Engineering Materials, EarlyView.Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai +2 more
wiley +1 more source
A Method for Determining the Affine Equivalence of Boolean Functions
IEEE Access, 2019 Determining the affine equivalence of Boolean functions has significant applications in circuit and cryptography. Previous methods for determining this require a large amount of computation when Boolean functions are bent functions or when the truth ...
Ziyu Wang +3 more
doaj +1 more source
On the Robustness of NK-Kauffman Networks Against Changes in their Connections and Boolean Functions
, 2009 NK-Kauffman networks {\cal L}^N_K are a subset of the Boolean functions on N Boolean variables to themselves, \Lambda_N = {\xi: \IZ_2^N \to \IZ_2^N}. To each NK-Kauffman network it is possible to assign a unique Boolean function on N variables through ...
de Visser J. A. G. M. +4 more
core +1 more source
Dirichlet product for boolean functions [PDF]
Journal of Applied Mathematics and Computing, 2016 Boolean functions play an important role in many symmetric cryp-tosystems and are crucial for their security. It is important to design boolean functions with reliable cryptographic properties such as balanced-ness and nonlinearity. Most of these properties are based on specific structures such as Möbius transform and Algebraic Normal Form.
Nitaj, Abderrahmane +2 more
openaire +4 more sources
Advanced Functional Materials, EarlyView.Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco +8 more
wiley +1 more source
Construction and analysis of one class of cryptographic functions
Tongxin xuebao, 2013 A novel class of n+t -variable Boolean functions G (x,y) through adding t variables while concatenating t+ 1 Boolean functions (called basic function) was constructed and the Walsh spectrum and autocorrelation coefficient of G(x,y)were given.The ...
Zhi-hui OU, Ya-qun ZHAO, Xu LI
doaj +2 more sources
The number and probability of canalizing functions
, 2003 Canalizing functions have important applications in physics and biology. For example, they represent a mechanism capable of stabilizing chaotic behavior in Boolean network models of discrete dynamical systems.
Aldana +20 more
core +1 more source