831 resultados para distributed conditional computation
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:
Carbon monoxide, the chief killer in fires, and other species are modelled for a series of enclosure fires. The conditions emulate building fires where CO is formed in the rich, turbulent, nonpremixed flame and is transported frozen to lean mixtures by the ceiling jet which is cooled by radiation and dilution. Conditional moment closure modelling is used and computational domain minimisation criteria are developed which reduce the computational cost of this method. The predictions give good agreement for CO and other species in the lean, quenched-gas stream, holding promise that this method may provide a practical means of modelling real, three-dimensional fire situations. (c) 2005 The Combustion Institute. Published by Elsevier Inc. All rights reserved.
Resumo:
Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.
Resumo:
We consider the case of two cavity modes of the electromagnetic field, which are coupled via the action of a parametric amplifier. The fields are allowed to leak from the cavity and homodyne measurement is performed on one of the modes. Because of the correlations between the modes, this leads to a reduction of the variance in a quadrature of the other mode, although no measurement is performed on it directly. We discuss how this relates to the Einstein-Podolky-Rosen Gedankenexperiment.
Resumo:
In a recent paper [16], one of us identified all of the quasi-stationary distributions for a non-explosive, evanescent birth-death process for which absorption is certain, and established conditions for the existence of the corresponding limiting conditional distributions. Our purpose is to extend these results in a number of directions. We shall consider separately two cases depending on whether or not the process is evanescent. In the former case we shall relax the condition that absorption is certain. Furthermore, we shall allow for the possibility that the minimal process might be explosive, so that the transition rates alone will not necessarily determine the birth-death process uniquely. Although we shall be concerned mainly with the minimal process, our most general results hold for any birth-death process whose transition probabilities satisfy both the backward and the forward Kolmogorov differential equations.
Resumo:
A straightforward method is proposed for computing the magnetic field produced by a circular coil that contains a large number of turns wound onto a solenoid of rectangular cross section. The coil is thus approximated by a circular ring containing a continuous constant current density, which is very close to the real situation when sire of rectangular cross section is used. All that is required is to evaluate two functions, which are defined as integrals of periodic quantities; this is done accurately and efficiently using trapezoidal-rule quadrature. The solution can be obtained so rapidly that this procedure is ideally suited for use in stochastic optimization, An example is given, in which this approach is combined with a simulated annealing routine to optimize shielded profile coils for NMR.
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:
In positive serial conditional discrimination, animals respond during a target stimulus when it is preceded by a feature stimulus, but they do not respond when the same target stimulus is presented alone. Moreover, the feature and target stimuli are separated from each other by an empty interval. The present work aimed to investigate if two durations (4 or 16s) of the same feature stimulus (light) could modulate the operant responses of rats to different levers (A and B) during a 5-s target stimulus (tone). In the present study, lever A was associated with the 4-s light, and lever B was associated with the 16-s light. A 5-s empty interval was included between the light and the tone. In the same training procedure, the rats were also presented with the 5-s tone without the preceding light stimuli. In these trials, the responses were not reinforced. We evaluated the hippocampal involvement of these behavioral processes by selectively lesioning the dentate gyrus with colchicine. Once trained, the rats were submitted to a test using probe trials without reinforcement. They were presented with intermediate durations of the feature stimulus (light) to obtain a temporal bisection curve recorded during the exposure to the target stimuli. The rats from both groups learned to respond with high rates during tones preceded by light and with low rates during tones presented alone, which indicated acquisition of the serial conditional discrimination. The rats were able to discriminate between the 4- and 16-s lights by correctly choosing lever A or B. In the test, the temporal bisection curves from both experimental groups showed a bisection point at the arithmetic mean between 4 and 16s. Such processes were not impaired by the dentate gyrus lesion. Thus, our results showed that different durations of a feature stimulus could result in conditional properties. However, this processing did not appear to depend on the dentate gyrus alone. (C) 2011 Published by Elsevier B.V.