864 Result(s)
within
English
Ben Ep**er
Article
Computer Science
-
Article
A model for optimizing indexed file structures
Multilevel indexes have long been used for accessing records in sorted files. Given the access cost at each level, the total cost of retrieving a record from the file can be substantially reduced by selecting ...
-
Article
The verification and synthesis of data structures
The concept of machine extension is a commonly used technique for implementing complex software: sets of object classes and operations on these objects are defined and used, often in a layered fashion, to cons...
-
Article
Toward a theory of encoded data structures and data translation
Several models of data base systems have distinguished levels of abstraction ranging from the high-level entity set model down to the low-level physical device level. This paper presents a model for describing...
-
Article
Exploratory experiments in programmer behavior
The techniques of cognitive psychological experimentation can help resolve specific issues in programming and explore the broader issues of programmer behavior. This paper describes the methodological question...
-
Article
Ianov pushdown schemes are contained in boolean recursive schemes
The class of Ianov schemes augmented by a pushdown memory is effectively translatable into the class of right linear boolean monadic recursive schemes. This proves a conjecture of Tokura, Kasami and Furuta [3].
-
Article
Syntactic/semantic interactions in programmer behavior: A model and experimental results
This paper presents a cognitive framework for describing behaviors involved in program composition, comprehension, debugging, modification, and the acquisition of new programming concepts, skills, and knowledg...
-
Article
“U. S. Science in international perspective”
This is an investigation of the relationship between the institutional structure of American science and its position in world science, as shown byScience Indicators — 1976. It concludes that, compared to other c...
-
Article
The temporal logic of branching time
A temporal logic is defined which contains both linear and branching operators. The underlying model is the tree of all possible computations. The following metatheoretical results are proven: 1) an exponentia...
-
Article
Choice coordination with limited failure
The Choice Coordination Problem requiresn asynchronous processes to reach a common choice of one out ofk possible alternatives. Processes communicate viak shared variables. Up tot, t<n, of the processes may fail ...
-
Article
Number of references in biochemistry and other fields; A case study of the Journal of Biological Chemistry throughout 1910–1985
Large samples of papers published in theJournal of Biological Chemistry in all decades and in some mid-decades werechecked in order to study the referencing pattern, throughout the period 1910–1985, in an interna...
-
Article
Develo** control and integration software for flexible manufacturing systems
The slow growth of computer-integrated manufacturing is attributed to the complexity of designing and implementing their control and integration software. This article expands on a methodology for designing an...
-
Article
‘Big history’ for big science? Critical review of history of CERN
-
Article
The micro gallery at the national gallery of London
-
Article
Phase transitions in associative memory networks
Ideas from random graph theory are used to give an heuristic argument that associative memory structure depends discontinuously on pattern recognition ability. This argument suggests that there may be a certai...
-
Article
On the power of randomization in on-line algorithms
Against in adaptive adversary, we show that the power of randomization in on-line algorithms is severely limited! We prove the existence of an efficient “simulation” of randomized on-line algorithms by determi...
-
Article
A new measure for the study of on-line algorithms
An accepted measure for the performance of an on-line algorithm is the “competitive ratio“ introduced by Sleator and Tarjan. This measure is well motivated and has led to the development of a mathematical theo...
-
Article
Some thoughts on Akin's spiteful computer
Akin's determinism paradox involves a physical system that predicts its own behavior, and then “spitefully” defies it. Here this paradox is reformulated in purely computational language, in terms of virtual ma...
-
Article
Propositional semantics for disjunctive logic programs
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs. We show that a...
-
Article
Optimal template matching by nonorthogonal image expansion using restoration
In this paper we present a novel approach for template matching. The basic principle is expansion matching and it entails signal expansion into a set of nonorthogonal templatesimilar basis functions. The coeff...
-
Article
Using true concurrency to model execution of parallel programs
Parallel execution of a programR (intuitively regarded as a partial order) is usually modeled by sequentially executing one of the total orders (interleavings) into which it can be embedded. Our work deviates fro...
