Results 1  10
of
92
Continuity and discontinuity of behavioral inhibition and exuberance: Psychophysiological and behavioral influences across the first four years of life.
 Child Development,
, 2001
"... Abstract: Fourmonthold infants were screened (N = 433) for temperamental patterns thought to predict behavioral inhibition, including motor reactivity and the expression of negative affect. Those selected (N = 153) were assessed at multiple age points across the first 4 years of life for behavior ..."
Abstract

Cited by 124 (47 self)
 Add to MetaCart
of her costume for the child to realize that she was another experimenter whom he or she had met before. At 14 months, an index of inhibition was computed based on the infant's reactions to these unfamiliar stimuli. Standardized scores of the following measures were summed to create a single summary
An analog analogue of a digital quantum computation
"... We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form Ew〉〈w  where w 〉 is an unknown (normalized) state. We show how to discover ..."
Abstract

Cited by 55 (5 self)
 Add to MetaCart
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form Ew〉〈w  where w 〉 is an unknown (normalized) state. We show how to discover
Computing over the Reals: Where Turing meets Newton
 Notices of the American Mathematical Society
, 2004
"... The classical (Turing) theory of computation has been extraordinarily successful in providing the foundations and framework for theoretical computer science. Yet its dependence on 0s and 1s is fundamentally inadequate for providing such a foundation for modern scientific computation, in which most a ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
is the field of real numbers R, Newton’s algorithm, the paradigm algorithm of numerical analysis, fits naturally into our model of computation. Complexity classes P, NP and the fundamental question “Does P=NP? ” can be formulated naturally over an arbitrary ring R. The answer to the fundamental question
Theory of Computing Systems
"... Abstract. It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper we provide new analyses for several such dynamic randomized load balancing schemes. Our work ..."
Abstract
 Add to MetaCart
Abstract. It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper we provide new analyses for several such dynamic randomized load balancing schemes. Our work extends a previous analysis of the supermarket model, a model that abstracts a simple, efficient load balancing scheme in the setting where jobs arrive at a large system of parallel processors. In this model, customers arrive at a system of n servers as a Poisson stream of rate λn, λ<1, with service requirements exponentially distributed with mean 1. Each customer chooses d servers independently and uniformly at random from the n servers, and is served according to the First In First Out (FIFO) protocol at the choice with the fewest customers. For the supermarket model, it has been shown that using d = 2 choices yields an exponential improvement in the expected time a customer spends in the system over d = 1 choice (simple random selection) in equilibrium. Here we examine several variations, including constant service times and threshold models, where a customer makes up to d successive choices until finding one below a set threshold. Our approach involves studying limiting, deterministic models representing the behavior of these systems as the number of servers n goes to infinity. Results of our work include useful general theorems for showing that these deterministic systems are stable or converge exponentially to fixed points. We also demonstrate that allowing customers two choices instead of just one leads to exponential improvements in the expected time a customer spends in the system in several of the related models we study, reinforcing the concept that just two choices yields significant power in load balancing.
Unsupervised statistical learning underpins computational, behavioural, and neural manifestations of musical expectation.
 NeuroImage,
, 2010
"... The ability to anticipate forthcoming events has clear evolutionary advantages, and predictive successes or failures often entail significant psychological and physiological consequences. In music perception, the confirmation and violation of expectations are critical to the communication of emotio ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
melody using the frequency with which each one has followed the context in his/her previous musical experience. Highprobability notes are expected, while lowprobability notes are unexpected. We have developed a computational model that embodies this account of expectation. The model's goal
Dynamic network user equilibrium with elastic demand: Formulation, qualitative analysis and computation
"... This paper is concerned with the simultaneous routeanddeparture choice dynamic user equilibrium with elastic travel demand (EDUE), in which the trip matrix is determined endogenously. We present and prove a variational inequality (VI) formulation of EDUE in an infinitedimensional Hilbert space ..."
Abstract
 Add to MetaCart
EDUE, we employ the mathematical paradigms of differential variational inequality (Pang and Stewart, 2008) and optimal control theory to show that the EDUE of interest is equivalent to a fixedpoint problem in an extended Hilbert space. An iterative computational scheme is proposed based
Lightweight Cryptography: Cryptographic Engineering for a Pervasive World
 PH.D. THESIS
, 2009
"... Increasingly, everyday items are enhanced to pervasive devices by embedding computing power and their interconnection leads to Mark Weiser's famous vision of ubiquitous computing (ubicomp), which is widely believed to be the next paradigm in information technology.
The mass deployment of pervas ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
Increasingly, everyday items are enhanced to pervasive devices by embedding computing power and their interconnection leads to Mark Weiser's famous vision of ubiquitous computing (ubicomp), which is widely believed to be the next paradigm in information technology.
The mass deployment
LumiNet An Organic Interactive Illumination Network Diploma Thesis at the Media Computing Group
"... I hereby declare that I have created this work completely on my own and used no other sources or tools than the ones listed, and that I have marked any citations accordingly. Hiermit versichere ich, dass ich die vorliegende Arbeit selbständig verfasst und keine anderen als die angegebenen Quellen un ..."
Abstract
 Add to MetaCart
I hereby declare that I have created this work completely on my own and used no other sources or tools than the ones listed, and that I have marked any citations accordingly. Hiermit versichere ich, dass ich die vorliegende Arbeit selbständig verfasst und keine anderen als die angegebenen Quellen und Hilfsmittel benutzt sowie Zitate kenntlich gemacht habe.
hardware and mobile web technology Master of Science Thesis in Programme Computer Systems and Networks
, 2013
"... Digitising statistics handling through ..."
UINVARIANT SAMPLING 1 UInvariant Sampling: Extrapolation and Causal Interpolation from Generalized Samples
"... Abstract—Causal processing of a signal’s samples is crucial in online applications such as audio rate conversion, compression, tracking and more. This paper addresses the problems of predicting future samples and causally interpolating deterministic signals. We treat a rich variety of sampling me ..."
Abstract
 Add to MetaCart
Abstract—Causal processing of a signal’s samples is crucial in online applications such as audio rate conversion, compression, tracking and more. This paper addresses the problems of predicting future samples and causally interpolating deterministic signals. We treat a rich variety of sampling
Results 1  10
of
92