The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives: Extract-A-Bit, which splits a test tube into two test tubes according to the value of a particular bit x, Merge-Two-Tubes, and Detect-Emptiness. If perfect, these operations can test
Computation with error injection
β Scribed by K.-Y. Fung; Brian D. Goble
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 641 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this paper a particular framework for the parameter identification (calibration) of constitutive models is discussed. The framework involves the formulation of an optimization problem as the stationarity condition for a Lagrangian, whose arguments include an additional costate field
In this paper, we consider a numerical enclosure method with guaranteed Loo error bound for the solutions of obstacle problems. Using the finite-element approximations and the explicit a priori error estimates for obstacle problems, we present an effective verification procedure that automatically g