Results 31 to 40 of about 5,235,728 (202)

Organic Electrochemical Transistors for Neuromorphic Bioelectronics: Materials and Manufacturing Technologies

Advanced Science, EarlyView.
Organic electrochemical transistors bridge biological ionic signaling and neuromorphic computation through volumetric electrochemical gating. This review connects Organic mixed ionic–electronic conductor materials, device architectures, and manufacturing technologies to show how geometry, ion transport, and fabrication strategies program plasticity ...
Hyunjin Lee, Jihyang Park, Xinyi Wang, Yueqi Deng, Jiashu Ren, Tao Zhou   +5 more
wiley   +1 more source

Physics‐Grounded Probabilistic Bits for Hardware‐Efficient Intelligent Inference and Optimization

Advanced Intelligent Systems, EarlyView.
Si–SiNx interface traps are harnessed as a complementary metal–oxide–semiconductor‐compatible source of controllable randomness for probabilistic bits. Pulse‐width‐programmed stochastic capture converts nanoscale defect dynamics into Boltzmann‐consistent binary outputs, while a physics‐based Simulation Program with Integrated Circuit Emphasis model ...
Dokyoung Lee, Jun‐Young Park, Joon‐Kyu Han, Sungho Kim   +3 more
wiley   +1 more source

Computing with Priced Information: game trees and the value dependent cost model [PDF]

, 2008
Cicalese F, Milanivc M. Computing with Priced Information: game trees and the value dependent cost model. Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik / Universität Bielefeld.
Cicalese, Ferdinando, Milanic, M., Milanivc, Martin, Cicalese, F.   +3 more
core  

Reductions for monotone Boolean circuits [PDF]

, 2008
The large class, say NLOG, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of O(nlogn) for their monotone circuit size, i.e., they have circuits with O(nlogn) AND/OR gates of fan-in two.
Tarui, Jun, Morizumi, Hiroki, Iwama, Kazuo   +2 more
core   +1 more source

On Dedekind's Problem: The Number of Monotone Boolean Functions [PDF]

Proceedings of the American Mathematical Society, 1969
with an = ce~nli, /3„ = e'(Iog w)/«1'2.The number \p(n) is equal to the number of ideals, or of antichains,or of monotone increasing functions into 0 and 1 definable on thelattice of subsets of an «-element set Sn. Here an ideal is a collectionI of subsets such that BEI, AEB implies ^4G£ an antichain is acollection of subsets no two of which are ...
openaire   +2 more sources

Interbody Wire for Reconfigurable Robots: Bridging Integrated Morphological Reconfiguration and Distributed Wire‐Mediated Cooperation

Advanced Intelligent Systems, EarlyView.
TwinX shows how a single interbody wire connecting two robots can support both integrated morphological reconfiguration and distributed wire‐mediated cooperation. When the robots dock, they reconfigure into different forms for locomotion and manipulation.
Shintaro Inoue, Kento Kawaharazuka, Keita Yoneda, Sota Yuzaki, Temma Suzuki, Kei Okada   +5 more
wiley   +1 more source

Counting unate and balanced monotone Boolean functions

CoRR, 2023
We show that the problem of counting the number of $n$-variable unate functions reduces to the problem of counting the number of $n$-variable monotone functions. Using recently obtained results on $n$-variable monotone functions, we obtain counts of $n$-variable unate functions up to $n=9$.
Aniruddha Biswas, Palash Sarkar 0001
openaire   +3 more sources

An Indicator‐Based Decision Framework for Circular Bioeconomy Transition in the Steel Industry: Integrating Multiphase Learning and Cooperative Game Modelling

Business Strategy and the Environment, EarlyView.
ABSTRACT Despite growing attention to the circular bioeconomy (CBE), the steel industry currently lacks a standardised, sectoral measurement framework to facilitate a low‐carbon transition. In this study, a decision‐support framework for evaluating CBE performance in the steel industry is proposed.
Ali Zamani Babgohari, Mohammadreza Sadeghi‐Moghadam, Hannan Amoozad Mahdiraji   +2 more
wiley   +1 more source

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits [PDF]

, 2000
Cancellations are known to be helpful in efficient algebraic computation of polynomials over fields. We define a notion of cancellation in Boolean circuits and define Boolean circuits that do not use cancellation to be non-cancellative.
Venkateswaran, H., Sengupta, Rimli
core   +1 more source

Approximating the noise sensitivity of a monotone Boolean function

CoRR, 2019
The noise sensitivity of a Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$ is one of its fundamental properties. A function of a positive noise parameter $δ$, it is denoted as $NS_δ[f]$. Here we study the algorithmic problem of approximating it for monotone $f$, such that $NS_δ[f] \geq 1/n^{C}$ for constant $C$, and where $δ$ satisfies $1/n \leq δ ...
Rubinfeld, Ronitt, Vasilyan, Arsen
openaire   +5 more sources