Serial conditional discrimination and temporal bisection in rats selectively lesioned in the dentate gyrus

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.

On the relation between the conditional moment closure and unsteady flamelets

We consider the relation between the conditional moment closure (CMC) and the unsteady flamelet model (FM). The CMC equations were originally constructed as global equations, while FM was derived asymptotically for a thin reaction zone. The recent tendency is to use FM-type equations as global equations. We investigate the possible consequences and suggest a new version of FM: coordinate-invariant FM (CIFM). Unlike FM, CIFM complies with conditional properties of the exact transport equations which are used effectively in CMC. We analyse the assumptions needed to obtain another global version of FM: representative interactive flamelets (RIF), from original FM and demonstrate that, in homogeneous turbulence, one of these assumptions is equivalent to the main CMC hypothesis.

Teleportation improvement by conditional measurements on the two-mode squeezed vacuum

We show that by making conditional measurements on the Einstein-Podolsky-Rosen (EPR) squeezed vacuum [T. Opatrny, G. Kurizki, and D.-G. Welsch, Phys. Rev. A 61, 032302 (2000)], one can improve the efficacy of teleportation for both the position-difference, momentum-sum, and number-difference, phase-sum continuous variable teleportation protocols. We investigate the relative abilities of the standard and conditional EPR states, and show that by conditioning we can improve the fidelity of teleportation of coherent states from below to above the (F) over bar =2/3 boundary, thereby achieving unambiguously quantum teleportation.

A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.

Effect of instructed extinction on verbal and autonomic indices of Pavlovian learning with fear-relevant and fear-irrelevant conditional stimuli

We investigated the effects of conditional stimulus fear-relevance and of instructed extinction on human Pavlovian conditioning as indexed by electrodermal responses and verbal ratings of conditional stimulus unpleasantness. Half of the participants (n = 64) were trained with pictures of snakes and spiders (fear-relevant) as conditional stimuli, whereas the others were trained with pictures of flowers and mushrooms (fear-irrelevant) in a differential aversive Pavlovian conditioning procedure. Half of the participants in each group were instructed after the completion of acquisition that no more unconditional stimuli were to be presented. Extinction of differential electrodermal responses required more trials after training with fear-relevant pictures. Moreover, there was some evidence that verbal instructions did not affect extinction of second interval electrodermal responses to fear-relevant pictures. However, neither fear-relevance nor instructions affected the changes in rated conditional stimulus pleasantness. This dissociation across measures is interpreted as reflecting renewal of Pavlovian learning.

Nondeterministic gates for photonic single-rail quantum logic

We discuss techniques for producing, manipulating, and measuring qubits encoded optically as vacuum- and single-photon states. We show that a universal set of nondeterministic gates can be constructed using linear optics and photon counting. We investigate the efficacy of a test gate given realistic detector efficiencies.

Conditional simulation of random fields by successive residuals

This paper presents a new approach to the LU decomposition method for the simulation of stationary and ergodic random fields. The approach overcomes the size limitations of LU and is suitable for any size simulation. The proposed approach can facilitate fast updating of generated realizations with new data, when appropriate, without repeating the full simulation process. Based on a novel column partitioning of the L matrix, expressed in terms of successive conditional covariance matrices, the approach presented here demonstrates that LU simulation is equivalent to the successive solution of kriging residual estimates plus random terms. Consequently, it can be used for the LU decomposition of matrices of any size. The simulation approach is termed conditional simulation by successive residuals as at each step, a small set (group) of random variables is simulated with a LU decomposition of a matrix of updated conditional covariance of residuals. The simulated group is then used to estimate residuals without the need to solve large systems of equations.

Addressing the facilities layout design problem through constraint logic programming

One of the most difficult problems that face researchers experimenting with complex systems in real world applications is the Facility Layout Design Problem. It relies with the design and location of production lines, machinery and equipment, inventory storage and shipping facilities. In this work it is intended to address this problem through the use of Constraint Logic Programming (CLP) technology. The use of Genetic Algorithms (GA) as optimisation technique in CLP environment is also an issue addressed. The approach aims the implementation of genetic algorithm operators following the CLP paradigm.

Hybrid fuzzy Monte Carlo and logic programming model for distribution network reconfiguration in the presence of outages

This paper presents a methodology for distribution networks reconfiguration in outage presence in order to choose the reconfiguration that presents the lower power losses. The methodology is based on statistical failure and repair data of the distribution power system components and uses fuzzy-probabilistic modelling for system component outage parameters. Fuzzy membership functions of system component outage parameters are obtained by statistical records. A hybrid method of fuzzy set and Monte Carlo simulation based on the fuzzy-probabilistic models allows catching both randomness and fuzziness of component outage parameters. Once obtained the system states by Monte Carlo simulation, a logical programming algorithm is applied to get all possible reconfigurations for every system state. In order to evaluate the line flows and bus voltages and to identify if there is any overloading, and/or voltage violation a distribution power flow has been applied to select the feasible reconfiguration with lower power losses. To illustrate the application of the proposed methodology to a practical case, the paper includes a case study that considers a real distribution network.