Results 81 to 90 of about 2,853,210 (289)
Stabilization of random Boolean networks
, 2010 This paper considers the stabilization of random Boolean networks. We first give a survey on the semi-tensor product approach to Boolean (control) networks, which is a new technique developed by us.
null Xiaoming Hu +5 more
core +1 more source
A Generative Neuro‐Symbolic AI for Protein Sequence Design
Advanced Science, EarlyView.We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne +12 more
wiley +1 more source
Contextual Random Boolean Networks
, 2003 We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [Gershenson, 2002] as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global properties of the same networks, namely the average number of attractors and the average percentage of states in ...
Carlos Gershenson +2 more
openaire +3 more sources
Integration of Reconfigurable p‐Bit and 1R Crossbar Array for Memristive Probabilistic Computing
Advanced Science, EarlyView.A memristive probabilistic computing system is demonstrated by integrating stochastic p‐bits based on volatile memristors with a 1R crossbar array encoding interaction weights. The system performs weighted‐sum operations across the array and updates p‐bits iteratively.
Keunho Soh +7 more
wiley +1 more source
Approximation of Boolean Networks
, 2012 The problem of approximation to large-scale Boolean networks is considered. First, we assume a large-scale Boolean network is aggregated into several sub-networks.
Daizhan Cheng +7 more
core +1 more source
Spatially Encoded Protocell Network for Non‐Cascaded Parallel Biocomputation
Advanced Science, EarlyView.A non‐cascaded, hydrogel‐based proteinosome computational platform is developed, in which redox‐responsive proteinosomes serve as local computing units within a shared reaction–diffusion field. Reductant inputs, countered by an auxiliary glucose gradient, regulate spatially patterned proteinosome disruption, and generate population‐level boundaries ...
Shuqi Wu, Liangfei Tian
wiley +1 more source
Boolean networks synchronism sensitivity and XOR circulant networks convergence time [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In this paper are presented first results of a theoretical study on the role of non-monotone interactions in Boolean automata networks. We propose to analyse the contribution of non-monotony to the diversity and complexity in their dynamical behaviours ...
Mathilde Noual +2 more
doaj +1 more source
Finite-time observability of probabilistic Boolean multiplex control networks [PDF]
summary:This paper investigates the finite-time observability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, the finite-time observability of the PBMCNs is converted into the set reachability issue according to the parallel ...
Cui, Yuxin, Shan, Yunxiao, Li, Shu
core +1 more source
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
Probabilistic Computing via Gate‐Tunable Random Telegraph Noise
Advanced Science, EarlyView.Intrinsic random telegraph noise in metal–oxide–semiconductor field‐effect transistors is harnessed to create gate‐tunable probabilistic bits. By modulating carrier‐trapping dynamics, the device produces stochastic binary outputs with a continuous bias‐to‐probability transfer.
Gyungwon Yun +8 more
wiley +1 more source