794 resultados para Distributed Representations
Resumo:
In this paper we study the approximate controllability of control systems with states and controls in Hilbert spaces, and described by a second-order semilinear abstract functional differential equation with infinite delay. Initially we establish a characterization for the approximate controllability of a second-order abstract linear system and, in the last section, we compare the approximate controllability of a semilinear abstract functional system with the approximate controllability of the associated linear system. (C) 2008 Elsevier Ltd. All rights reserved.
Resumo:
We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.
Resumo:
A 250-mum-diameter fiber of ytterbium-doped ZBLAN (fluorine combined with Zr, Ba, La, Al, and Na) has been cooled from room temperature. We coupled 1.0 W of laser light from a 1013-nm diode laser into the fiber. We measured the temperature of the fiber by using both fluorescence techniques and a microthermocouple. These microthermocouple measurements show that the cooled fiber can be used to refrigerate materials brought into contact with it. This, in conjunction with the use of a diode laser as the light source, demonstrates that practical solid-state laser coolers can be realized. (C) 2001 Optical Society of America.
Resumo:
Studies of delayed nonmatching-to-sample (DNMS) performance following lesions of the monkey cortex have revealed a critical circuit of brain regions involved in forming memories and retaining and retrieving stimulus representations. Using event-related functional magnetic resonance imaging (fMRI), we measured brain activity in 10 healthy human participants during performance of a trial-unique visual DNMS task using novel barcode stimuli. The event-related design enabled the identification of activity during the different phases of the task (encoding, retention, and retrieval). Several brain regions identified by monkey studies as being important for successful DNMS performance showed selective activity during the different phases, including the mediodorsal thalamic nucleus (encoding), ventrolateral prefrontal cortex (retention), and perirhinal cortex (retrieval). Regions showing sustained activity within trials included the ventromedial and dorsal prefrontal cortices and occipital cortex. The present study shows the utility of investigating performance on tasks derived from animal models to assist in the identification of brain regions involved in human recognition memory.
Resumo:
We generalize the basic concepts of the positive-P and Wigner representations to unstable quantum-optical systems that are based on nonorthogonal quasimodes. This lays the foundation for a quantum description of such systems, such as, for example an unstable cavity laser. We compare both representations by calculating the tunneling times for an unstable resonator optical parametric oscillator.
Resumo:
We detail the automatic construction of R matrices corresponding to (the tensor products of) the (O-m\alpha(n)) families of highest-weight representations of the quantum superalgebras Uq[gl(m\n)]. These representations are irreducible, contain a free complex parameter a, and are 2(mn)-dimensional. Our R matrices are actually (sparse) rank 4 tensors, containing a total of 2(4mn) components, each of which is in general an algebraic expression in the two complex variables q and a. Although the constructions are straightforward, we describe them in full here, to fill a perceived gap in the literature. As the algorithms are generally impracticable for manual calculation, we have implemented the entire process in MATHEMATICA; illustrating our results with U-q [gl(3\1)]. (C) 2002 Published by Elsevier Science B.V.
Resumo:
University students spelled low-frequency words to dictation and subsequently made lexical decisions to them. In Experiment I, lexical decisions were slower on words students had spelled incorrectly relative to words they had spelled correctly, and there A as a larger repetition benefit 101 incorrectly spelled words. In experiment 2, the latency advantage for items spelled correctly was replicated when words were presented for only 200 ms and also in a spelling recognition task, In Experiment 3. masked identity and form priming effects were similar for words that had been spelled correctly and incorrectly, Item spelling accuracy tracked word frequency effects in the way chat it combined with repetition and priming effects. we inter that an individuals learning with a word's orthography underlies word frequency and item spelling accuracy effects and that a single orthographic lexicon serves visual word recognition and spelling. (C) 2000 Elsevier Science (USA).