Results 61 to 70 of about 1,024,245 (290)
, 2018 The brain, which uses redundancy and continuous learning to overcome the unreliability of its components, provides a promising path to building computing systems that are robust to the unreliability of their constituent nanodevices.
Grollier, Julie +3 more
core +2 more sources
Inferring Microscopic Kinetic Rates from Stationary State Distributions. [PDF]
, 2014 We present a principled approach for estimating the matrix of microscopic transition probabilities among states of a Markov process, given only its stationary state population distribution and a single average global kinetic observable.
Dill, Ken A, Dixit, Purushottam D
core +2 more sources
Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications
FEBS Open Bio, EarlyView.This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley +1 more source
Experience on material implication computing with an electromechanical memristor emulator [PDF]
, 2016 Memristors are being considered as a promising emerging device able to introduce new paradigms in both data storage and computing. In this paper the authors introduce the concept of a quasi-ideal experimental device that emulates the fundamental behavior
Escudero López, Manuel +5 more
core +1 more source
FEBS Open Bio, EarlyView.Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source
An Improved Physarum polycephalum Algorithm for the Shortest Path Problem
The Scientific World Journal, 2014 Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mould P.
Xiaoge Zhang +5 more
doaj +1 more source
CAD Adjacency Computation Using Validated Numerics
, 2017 We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operations e.g.
Strzebonski, Adam
core +1 more source
FEBS Open Bio, EarlyView.This review provides an overview of bio‐based polymer sources, their unique functional properties and their environmental impact, and addresses their role as sustainable alternatives. It discusses end‐of‐life options, including composting and anaerobic digestion for renewable energy.
Sabina Kolbl Repinc +8 more
wiley +1 more source
Delay constraint minimum interruption routing algorithm for mobile satellite network
Tongxin xuebao, 2006 By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path（SDCOP）algorithm,which could obtain a path to sat-isfy the delay constraint ...
ZHANG Tao, LIU Zhong-kan, ZHANG Jun
doaj +2 more sources
Fault tolerant hypercube computer system architecture [PDF]
, 1989 A fault-tolerant multiprocessor computer system of the hypercube type comprising a hierarchy of computers of like kind which can be functionally substituted for one another as necessary is disclosed.
Chow, Edward, Madan, Herb S.
core +1 more source