Results 11  20
of
4,703
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract

Cited by 280 (11 self)
 Add to MetaCart
We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x, y)to(x, x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We
Refining learned repertoire for percussion instruments in an elementary setting. Manuscript submitted for publication
, 2006
"... The purpose of this study was to examine teaching effectiveness in an elementary music setting using student achievement as a dependent measure. Because Orff Schulwerk instruction is one of the most prevalent pedagogies in elementary music education, this study examined the rehearsal strategies of r ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The purpose of this study was to examine teaching effectiveness in an elementary music setting using student achievement as a dependent measure. Because Orff Schulwerk instruction is one of the most prevalent pedagogies in elementary music education, this study examined the rehearsal strategies
Elementary Set Theory.............................................................................3 Relations...................................................................................................4 Equivalence Relations........................
"... Benutzung der CREACOMP Software.......................................................2 ..."
Abstract
 Add to MetaCart
Benutzung der CREACOMP Software.......................................................2
A Tableau Calculus for Integrating FirstOrder Reasoning with Elementary Set Theory Reasoning
, 2000
"... In this paper we describe an approach to integrate rstorder reasoning with strati ed set theory reasoning, resulting into a technique which allows to lift decision procedures for ground theories to 98sentences and combine them also with elementary set constructs, such as union, intersection, ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper we describe an approach to integrate rstorder reasoning with strati ed set theory reasoning, resulting into a technique which allows to lift decision procedures for ground theories to 98sentences and combine them also with elementary set constructs, such as union, intersection
ARTICLES Young Children’s Changing Conceptualizations of Brain Function: Implications for Teaching Neuroscience in Early Elementary Settings
"... Research Findings: Two exploratory studies explored young children’s views of brain function and whether these views can be modified through exposure to a brief classroom intervention. In Study 1, children aged 4–13 years reported that the brain is used for ‘‘thinking,’ ’ although older children wer ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
no effect on children’s responses to stories involving the magical transformation of a protagonist’s brain. Practice or Policy: Basic aspects of brain function can be taught at the elementary level without requiring a great deal of specialized knowledge on the part of teachers. Such instruction could form
Orthographic processing in visual word recognition: a multiple readout model, Psychol
 518–565. Edwards et al. / Cognitive Brain Research 24 (2005) 648–662 661
, 1996
"... A model of orthographic processing is described that postulates readout from different information dimensions, determined by variable response criteria set on these dimensions. Performance in a perceptual identification task is simulated as the percentage of trials on which a noisy criterion set on ..."
Abstract

Cited by 266 (34 self)
 Add to MetaCart
recognition. When skilled readers move their gaze across lines of printed text in order to make sense of letter sequences and spaces, it is very likely that for each word an elementary set of operations is repeated in the brain. These operations compute a form representation of the physical signal, match
An elementary proof of the JohnsonLindenstrauss Lemma
, 1999
"... The JohnsonLindenstrauss lemma shows that a set of n points in high dimensional Euclidean space can be mapped down into an O(log n=ffl 2 ) dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 \Sigma ffl). In this note, we prove this lemma using ..."
Abstract

Cited by 152 (1 self)
 Add to MetaCart
The JohnsonLindenstrauss lemma shows that a set of n points in high dimensional Euclidean space can be mapped down into an O(log n=ffl 2 ) dimensional Euclidean space such that the distance between any two points changes by only a factor of (1 \Sigma ffl). In this note, we prove this lemma using
Stubborn Sets for Reduced State Space Generation
 Proceedings of the Tenth International Conference on Application and Theory of Petri Nets
, 1989
"... ABSTRACT The "stubborn set " theory and method for generating reduced state spaces is presented. The theory takes advantage of concurrency, or more generally, of the lack of interaction between transitions, captured by the notion of stubborn sets. The basic method preserves all terminal st ..."
Abstract

Cited by 189 (2 self)
 Add to MetaCart
ABSTRACT The "stubborn set " theory and method for generating reduced state spaces is presented. The theory takes advantage of concurrency, or more generally, of the lack of interaction between transitions, captured by the notion of stubborn sets. The basic method preserves all terminal
Realtime logics: complexity and expressiveness
 INFORMATION AND COMPUTATION
, 1993
"... The theory of the natural numbers with linear order and monadic predicates underlies propositional linear temporal logic. To study temporal logics that are suitable for reasoning about realtime systems, we combine this classical theory of in nite state sequences with a theory of discrete time, via ..."
Abstract

Cited by 252 (16 self)
 Add to MetaCart
a monotonic function that maps every state to its time. The resulting theory of timed state sequences is shown to be decidable, albeit nonelementary, and its expressive power is characterized by! regular sets. Several more expressive variants are proved to be highly undecidable. This framework
SetTheoretical and Other Elementary Models of the lambdacalculus
 Theoretical Computer Science
, 1993
"... Part 1 of this paper is the previously unpublished 1972 memorandum [43], with editorial changes and some minor corrections. Part 2 presents what happened next, together with some further development of the material. The first part begins with an elementary settheoretical model of the ficalculus. F ..."
Abstract

Cited by 46 (0 self)
 Add to MetaCart
Part 1 of this paper is the previously unpublished 1972 memorandum [43], with editorial changes and some minor corrections. Part 2 presents what happened next, together with some further development of the material. The first part begins with an elementary settheoretical model of the fi
Results 11  20
of
4,703