Results 111 to 120 of about 4,892,723 (368)
Computable structures on topological manifolds [PDF]
arXiv, 2017 We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL manifolds respectively.
arxiv
FEBS Letters, EarlyView.UDP‐glucuronic acid 4‐epimerase (UGAepi) catalyzes NAD+‐dependent interconversion of UDP‐glucuronic acid (UDP‐GlcA) and UDP‐galacturonic acid (UDP‐GalA) via C4‐oxidation, 4‐keto‐intermediate rotation, and C4‐reduction. Here, Borg et al. examined the role of the substrate's carboxylate group in the enzymic mechanism by analyzing NADH‐dependent reduction
Annika J. E. Borg +2 more
wiley +1 more source
Computing with Functionals—Computability Theory or Computer Science?
Bulletin of Symbolic Logic, 2006 AbstractWe review some of the history of the computability theory of functionals of higher types, and we will demonstrate how contributions from logic and theoretical computer science have shaped this still active subject.
openaire +3 more sources
FEBS Letters, EarlyView.Glutaredoxin (Grx) 3 proteins contain a thioredoxin domain and one to three class II Grx domains. These proteins play a crucial role in iron homeostasis in eukaryotic cells. In human Grx3, at least one of the two Grx domains, together with the thioredoxin domain, is essential for its function in iron metabolism.
Laura Magdalena Jordt +4 more
wiley +1 more source
Computational models for parallel computers [PDF]
Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences, 1988 Computational models define the usage patterns of a computer. They can be used to derive the architecture of the machine, provide guidelines for programming tools, and suggest how the machine should be used in applications. Identifying computational models is especially important for parallel computers, because their architectures and usages are still ...
openaire +2 more sources
, 2019 The Turing Machine is the paradigmatic case of computing machines, but there are others, such as Artificial Neural Networks, Table Computing, Relational-Indeterminate Computing and diverse forms of analogical computing, each of which based on a ...
Pineda, Luis A.
core
FEBS Letters, EarlyView.Dimeric pyruvate formate‐lyase cleaves pyruvate using a radical‐based mechanism. G734 serves as a radical storage location, and the radical is transferred to the catalytic C419 residue. Mutation of the C418‐C419 pair causes loss of enzyme activity, but does not impede radical introduction onto G734. Therefore, cis‐ but not trans‐radical transfer occurs
Michelle Kammel +2 more
wiley +1 more source
ACM Computing Surveys, 1985 Computer animation may be defined as a technique in which the illusion of movement is created by displaying on a screen or recording on a device a series of individual states of a dynamic scene. The key issue of computer animation is defining motion, commonly known as motion control methods (MCMs).
Magnenat Thalmann, N, Thalmann, D
openaire +5 more sources
Real-number Computability from the Perspective of Computer Assisted Proofs in Analysis [PDF]
arXiv, 2017 Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
arxiv
FEBS Letters, EarlyView.To explore the impact of the overexpression of the multidrug‐transporter P‐glycoprotein (ABCB1) on membrane fluidity, we compared the transversal gradient of mobility and microviscosity in plasma membranes of drug‐sensitive Chinese hamster ovary cells (AuxB1) and their multidrug‐resistant derivatives (B30) using the fluorescent n‐(9‐anthroyloxy) fatty ...
Roger Busche +2 more
wiley +1 more source