SC-PROV: A Provenance Vocabulary for Social Computation

The research described here is supported by the award made by the RCUK Digital Economy programme to the dot.rural Digital Economy Hub; award reference: EP/G066051/1.

Molecular computation: RNA solutions to chess problems

We have expanded the field of “DNA computers” to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the “Knight problem,” which asks generally what configurations of knights can one place on an n × n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 × 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine “bits” or placeholders in a combinatorial RNA library. We recovered a set of “winning” molecules that describe solutions to this problem.

Computation of Surface Electrical Potentials of Plant Cell Membranes : Correspondence to Published Zeta Potentials from Diverse Plant Sources

A Gouy-Chapman-Stern model has been developed for the computation of surface electrical potential (ψ0) of plant cell membranes in response to ionic solutes. The present model is a modification of an earlier version developed to compute the sorption of ions by wheat (Triticum aestivum L. cv Scout 66) root plasma membranes. A single set of model parameters generates values for ψ0 that correlate highly with published ζ potentials of protoplasts and plasma membrane vesicles from diverse plant sources. The model assumes ion binding to a negatively charged site (R− = 0.3074 μmol m−2) and to a neutral site (P0 = 2.4 μmol m−2) according to the reactions R− + IΖ ⇌ RIΖ−1 and P0 + IΖ ⇌ PIΖ, where IΖ represents an ion of charge Ζ. Binding constants for the negative site are 21,500 m−1 for H+, 20,000 m−1 for Al3+, 2,200 m−1 for La3+, 30 m−1 for Ca2+ and Mg2+, and 1 m−1 for Na+ and K+. Binding constants for the neutral site are 1/180 the value for binding to the negative site. Ion activities at the membrane surface, computed on the basis of ψ0, appear to determine many aspects of plant-mineral interactions, including mineral nutrition and the induction and alleviation of mineral toxicities, according to previous and ongoing studies. A computer program with instructions for the computation of ψ0, ion binding, ion concentrations, and ion activities at membrane surfaces may be requested from the authors.

The evolution of emergent computation.

A simple evolutionary process can discover sophisticated methods for emergent information processing in decentralized spatially extended systems. The mechanisms underlying the resulting emergent computation are explicated by a technique for analyzing particle-based logic embedded in pattern-forming systems. Understanding how globally coordinated computation can emerge in evolution is relevant both for the scientific understanding of natural information processing and for engineering new forms of parallel computing systems.

Efficient tool path computation using multi-core GPUs

Tool path generation is one of the most complex problems in Computer Aided Manufacturing. Although some efficient strategies have been developed, most of them are only useful for standard machining. However, the algorithms used for tool path computation demand a higher computation performance, which makes the implementation on many existing systems very slow or even impractical. Hardware acceleration is an incremental solution that can be cleanly added to these systems while keeping everything else intact. It is completely transparent to the user. The cost is much lower and the development time is much shorter than replacing the computers by faster ones. This paper presents an optimisation that uses a specific graphic hardware approach using the power of multi-core Graphic Processing Units (GPUs) in order to improve the tool path computation. This improvement is applied on a highly accurate and robust tool path generation algorithm. The paper presents, as a case of study, a fully implemented algorithm used for turning lathe machining of shoe lasts. A comparative study will show the gain achieved in terms of total computing time. The execution time is almost two orders of magnitude faster than modern PCs.

Mr. Monis's computation about printing his Hebrew Grammar, [ca. 1734]

A one-page handwritten computation by Judah Monis for printing the Hebrew Grammar and binding it in sheep and calf skins. The document was written on one folio-sized leaf that is torn in two pieces.

Multiple precision computation of Legendre functions.

"C00-1469-0167."

Speeding up computation in two-dimensional iterative arrays /

"UILU-ENG 80 1720."-- Cover, p. 1.

Sociopathic knowledge bases : correct knowledge can be harmful even given unlimited computation /

"College of Engineering, UILU-ENG-89-1757."

Analog computation with random pulse sequences.

Vita.

An arithmetic unit for on-line computation /

Vita.

A study of certain factors affecting computation times in designing optimal NOR networks by the implicit enumeration method using the feed-forward formulation /

Bibliography: p. 27-29.

Computation of four color irreducibility /

Vita.

Semi-annual technical report of the Center for Advanced Computation : October 1, 1972 - March 31, 1973 /

Includes bibliographies (p. 17-18).

Graphical specification of computation,

Vita.