One of the basic facts known for discrete-time Markov decision processes is that, if probability distribution an initial state fixed, then every policy it easy to construct a (randomized) with same marginal distributions state-action pairs as original policy. This equality implies that values major objective criteria, including expected discounted total costs and average rewards per unit time, ...

We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state ρ which is “reasonably close” to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of ρ and a maximally entangled state. They wish to “purify” ρ using local operations and classical communication and create a state that is arbitrarily cl...

We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state ρ which is “reasonably close” to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of ρ and a maximally entangled state. They wish to “purify” ρ using local operations and classical communication and create a state that is arbitrarily cl...

Horizontal cells form an electrically coupled network for the transmission of inhibitory signals in the outer retina. In teleosts, horizontal cell coupling is modulated by the neurotransmitter dopamine. Using voltage-clamped pairs of teleost horizontal cells, we have examined the effects of dopamine on the conductance and gating properties of the cell-to-cell channels that mediate electrical sy...

We describe an integrated approach to vagueness and uncertainty within a propositional logic setting and based on a combination of three valued logic and probability. Three valued valuations are employed in order to model explicitly borderline cases and in this context we give an axiomatic characterisation of two well known three valued models; supervaluations and Kleene valuations. We then dem...

In this paper we study the problem of sorting under forbidden comparisons where some pairs of elements may not be compared (forbidden pairs). Along with the set of elements V the input to our problem is a graph G(V,E), whose edges represents the pairs that we can compare in constant time. Given a graph with n vertices and m = ( n 2 ) − q edges we propose the first nontrivial deterministic algor...

The consistency method has been established as the standard strategy for extracting high quality translation rules in statistical machine translation (SMT). However, no attention has been drawn to why this method is successful, other than empirical evidence. Using concepts from graph theory, we identify the relation between consistency and components of graphs that represent word-aligned senten...

A set of four manipulanda were presented to four Cebus monkeys, individually, and later in pairs. Step 1 provided an estimate of each S's probability of operating each item, while Step 2 determined whether pairing the items would disturb the ordinal relations among individual response probabilities. Both procedures provided information necessary for testing the assumption that a reinforcer is s...

Prediction of RNA tertiary structure from sequence is an important problem, but generating accurate structure models for even short sequences remains difficult. Predictions of RNA tertiary structure tend to be least accurate in loop regions, where non-canonical pairs are important for determining the details of structure. Non-canonical pairs can be predicted using a knowledge-based model of str...

Competitive fighting was obtained in pairs of like-sexed laboratory rats by placing a single piece of food into the food hopper following 48 hr. of food deprivation. The fighting was characterized by offensive sideways posture, full aggressive posture, and bite and kick attack. Tests were conducted at 110-120 days of age on pairs of animals that had been housed together since weaning. Fighting ...