Results 81 to 90 of about 148,474 (293)

De Vries powers: a generalization of Boolean powers for compact Hausdorff spaces [PDF]

open access: yes, 2013
We generalize the Boolean power construction to the setting of compact Hausdorff spaces. This is done by replacing Boolean algebras with de Vries algebras (complete Boolean algebras enriched with proximity) and Stone duality with de Vries duality.
Bezhanishvili, Guram   +3 more
core  

Memristive Physical Reservoir Computing

open access: yesAdvanced Science, EarlyView.
Memristors’ nonlinear dynamics and input‐dependent memory effects make them ideal candidates for high‐performance physical reservoir computing (RC). Based on their conductance modulation, memristors can be classified as electronic or optoelectronic types.
Dian Jiao   +9 more
wiley   +1 more source

RATEX: A Scalable RNA‐Based Platform for Logical and Multi‐Layered Cellular Programming

open access: yesAngewandte Chemie, EarlyView.
RATEX integrated ribosome‐mediated transcription control with synthetic RNA regulators, enabling simultaneous processing of RNA, metabolite, and small‐molecule inputs through complex logic operations within a single transcript. The platform achieves up to 1,492‐fold gene regulation, multi‐input hybrid logic gates, RNA‐programmed signaling cascades, and
Hyunseop Goh   +3 more
wiley   +2 more sources

Organic Thin‐Film Transistors for Neuromorphic Computing

open access: yesAdvanced Electronic Materials, EarlyView.
Organic thin‐film transistors (OTFTs) are reviewed for neuromorphic computing applications, highlighting their power‐efficient, and biological time‐scale operation. This article surveys OFET and OECT devices, compares them with memristors and CMOS, analyzes how fabrication parameters shape spike‐based metrics, proposes standardized characterization ...
Luke McCarthy   +2 more
wiley   +1 more source

Constructing Conditional Plans by a Theorem-Prover

open access: yes, 2011
The research on conditional planning rejects the assumptions that there is no uncertainty or incompleteness of knowledge with respect to the state and changes of the system the plans operate on.
Rintanen, J.
core   +1 more source

Correlated Boolean Operators for Uncertainty Logic

open access: yes, 2022
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   +3 more sources

Fundamental Challenges, Physical Implementations, and Integration Strategies for Ising Machines in Large‐Scale Optimization Tasks

open access: yesAdvanced Electronic Materials, EarlyView.
Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley   +1 more source

Bottom‐Up Coacervate‐Based Artificial Cells: Integrating Cellular Hallmarks into Complex Life‐Like Systems

open access: yesAngewandte Chemie, EarlyView.
Current interest in artificial cell research underscores its potential to deepen our understanding of life's fundamental processes. This review highlights advances in bottom‐up coacervate‐based artificial cell engineering via combined integration of cellular hallmarks.
Arjan Hazegh Nikroo   +3 more
wiley   +2 more sources

Optical computing by injection-locked lasers

open access: yes, 2017
A programmable optical computer has remained an elusive concept. To construct a practical computing primitive equivalent to an electronic Boolean logic, one should find a nonlinear phenomenon that overcomes weaknesses present in many optical processing ...
Chipouline, Arkadi   +6 more
core  

Boolean Graph Operator B

open access: yesProcedia Computer Science, 2015
AbstractLet G be a simple (p, q) graph with vertex set V(G) and edge set E(G). B is a graph with vertex set V(G) ∪ E(G) and two vertices are adjacent if and only if they correspond to two non adjacent vertices of G, a vertex and an edge not incident to it in G. For simplicity, denote this graph by BG(G), Boolean graph of G.
Bhanumathi, M., Kavitha, M.
openaire   +1 more source

Home - About - Disclaimer - Privacy