Results 11 - 20 of 37,738

Distributed Database Systems

by M. Tamer Özsu
"... this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability, and replica ..."
Abstract - Cited by 588 (26 self) - Add to MetaCart
this article, we discuss the fundamentals of distributed DBMS technology. We address the data distribution and architectural design issues as well as the algorithms that need to be implemented to provide the basic DBMS functions such as query processing, concurrency control, reliability

Wait-Free Synchronization

by Maurice Herlihy - ACM Transactions on Programming Languages and Systems , 1993
"... A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another lie ..."
Abstract - Cited by 851 (28 self) - Add to MetaCart
A wait-free implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a wait-free implementation of one data object from another

Bisimulation through probabilistic testing

by Kim G. Larsen, Arne Skou - in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL , 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract - Cited by 529 (14 self) - Add to MetaCart
We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily

Verbal reports as data

by K. Anders Ericsson, Herbert A. Simon - Psychological Review , 1980
"... The central proposal of this article is that verbal reports are data. Accounting for verbal reports, as for other kinds of data, requires explication of the mech-anisms by which the reports are generated, and the ways in which they are sensitive to experimental factors (instructions, tasks, etc.). W ..."
Abstract - Cited by 513 (3 self) - Add to MetaCart
information is shown to affect cognitive processes only if the instructions require verbalization of information that would not otherwise be attended to. From an analysis of what would be in STM at the time of report, the model predicts what can reliably be reported. The inaccurate reports found by other

The Skill Content of Recent Technological Change: An Empirical Exploration

by David H. Autor, Frank Levy, Richard J. Murnane , 2000
"... Recent empirical and case study evidence documents a strong association between the adoption of computers and increased use of college educated or non-production workers. With few exceptions, the conceptual link explaining how computer technology complements skilled labor or substitutes for unskille ..."
Abstract - Cited by 643 (28 self) - Add to MetaCart
of our framework is that, to a first approximation, computer capital substitutes for a limited and well-defined set of human activities, those involving repetitive information processing (cognitive) and routine manual tasks. This observation leads to a set of hypotheses that we test using samples

Transactional Memory: Architectural Support for Lock-Free Data Structures

by Maurice Herlihy, J. Eliot B. Moss
"... A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems asso ..."
Abstract - Cited by 1031 (27 self) - Add to MetaCart
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be prevented from operating on that object. In highly concurrent systems, lock-free data structures avoid common problems

Reliable Communication in the Presence of Failures

by Kenneth P. Birman, Thomas A. Joseph - ACM Transactions on Computer Systems , 1987
"... The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols at ..."
Abstract - Cited by 546 (18 self) - Add to MetaCart
The design and correctness of a communication facility for a distributed computer system are reported on. The facility provides support for fault-tolerant process groups in the form of a family of reliable multicast protocols that can be used in both local- and wide-area networks. These protocols

An integrated theory of the mind

by John R. Anderson, Daniel Bothell, Michael D. Byrne, Scott Douglass, Christian Lebiere, Yulin Qin - PSYCHOLOGICAL REVIEW , 2004
"... There has been a proliferation of proposed mental modules in an attempt to account for different cognitive functions but so far there has been no successful account of their integration. ACT-R (Anderson & Lebiere, 1998) has evolved into a theory that consists of multiple modules but also explain ..."
Abstract - Cited by 780 (73 self) - Add to MetaCart
There has been a proliferation of proposed mental modules in an attempt to account for different cognitive functions but so far there has been no successful account of their integration. ACT-R (Anderson & Lebiere, 1998) has evolved into a theory that consists of multiple modules but also

The Varieties of Reference

by Jeff Evans , 1982
"... Tracing the development of concepts of affect and emotion in mathematics education (ME) research is informative for research on teaching statistics. In both areas, early research focused on more stable aspects of affect- beliefs, values and attitudes- using surveys to study dimensionality, and corre ..."
Abstract - Cited by 544 (2 self) - Add to MetaCart
, and correlations with performance. In ME, a concern with gender differences led to focusing on “mathematics anxiety ” so as to provide a non-cognitive explanation for any gender differences in performance. McLeod (1992) proposed a spectrum of forms of affect, from beliefs (more stable, “cooler”) over to emotions

A standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity

by Joan Gay Snodgrass, Mary Vanderwart - JOURNAL OF EXPERIMENTAL PSYCHOLOGY: HUMAN LEARNING AND MEMORY , 1980
"... In this article we present a standardized set of 260 pictures for use in experiments investigating differences and similarities in the processing of pictures and words. The pictures are black-and-white line drawings executed according to a set of rules that provide consistency of pictorial represent ..."
Abstract - Cited by 663 (1 self) - Add to MetaCart
representation. The pictures have been standardized on four variables of central relevance to memory and cognitive processing: name agreement, image agreement, familiarity, and visual complexity. The intercorrelations among the four measures were low, suggesting that the) ' are indices of different
Results 11 - 20 of 37,738