A specificity-enhanced time-resolved fluoroimmunoassay for zeranol employing the dry reagent all-in-one-well principle

A simple dry chemistry time-resolved fluorescence immunoassay (TR-FIA) method was developed for the measurement of zeranol in bovine urine samples. The samples were purified by immunoaffinity chromatography and a specificity-enhanced zeranol antibody was employed in the immunoassay. This resulted in a highly selective method, which had only negligible reactivity with Fusarium spp, toxins. The all-in-one-well dry chemistry concept made the assay very simple to use because all the assay-specific reagents were already present in the reaction wells in dry form. Only the addition of diluted sample extract was required to perform the competitive one-step TR-FIA and the results were available in less than 1 h. The analytical limit of detection (mean + 3s) for the immunoassay was 0.16 ng ml(-1) (n=12) and the functional limit of detection for the whole method, estimated by the analysis of zeranol-free samples, was 1.3 ng ml(-1) (n=20). The recovery of zeranol at the level of 2 ng ml(-1) was 99% (n=18) and the within-assay variation ranged between 4.5 and 9.0%.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

The temporal priority principle: at what age does this develop?

The temporal priority principle states that all causes must precede their effects. It is widely assumed that children's causal reasoning is guided by this principle from early in development. However, the empirical studies that have examined children's use of the principle, most of which were conducted some decades ago, in fact show inconsistent findings. Some researchers have argued that 3-year-olds reliably use this principle, whereas others have suggested that it is not until 5 years that children properly grasp the inviolability of the principle. To examine this issue, 100 children, 50 three-year-olds, and 50 four-year-olds, took part in a study in which they had to judge which of two causes yielded an effect. In the task, children saw one event (A), an effect (E), and then another event (B). The events A and B involved the rolling of balls down runways, and the effect E was a Jack-in-a-box popping up. The extent to which E left a visible trace was also varied, because comparisons across previous studies suggested that this may affect performance. As a group, 3- and 4-year-olds performed at above-chance levels, but performance improved with age. The nature of the effect did not have a significant impact on performance. Although some previous studies suggested that 3-year-olds may be more likely to choose B rather than A as a cause due to a recency effect, we found no evidence of this pattern of performance in the younger group. Potential explanations of the age-related improvement in performance are discussed. © 2013 Desmet.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

Elements of A New Framework for the principle of Equal Treatment of persons in EC Law

In June and November 2000, the European Parliament and the Council adopted two Directives referring to ‘the principle of equal treatment irrespective of’ in their title, one relating to racial and ethnic origin, the other to disability, age, religion and belief or sexual orientation. A thorough reform of Directive 76/207/EEC on the principle of equal treatment for women and men in employment matters is pending between the European Parliament's second reading and adoption while this is written. Community secondary legislation on equal treatment of persons has thus expanded in scope and number of reasons which must not serve as starting points for differentiation. Does this signify progress in legal protection against personal discrimination? While not providing a ready answer, this article proposes an analytical framework to answer this question, concentrating on conceptions of equality in general and in particular on the problems multi-dimensional discrimination might pose for the law.

Nonequilibrium Quantum Landauer Principle

Using the operational framework of completely positive, trace preserving operations and thermodynamic fluctuation relations, we derive a lower bound for the heat exchange in a Landauer erasure process on a quantum system. Our bound comes from a nonphenomenological derivation of the Landauer principle which holds for generic nonequilibrium dynamics. Furthermore, the bound depends on the nonunitality of dynamics, giving it a physical significance that differs from other derivations. We apply our framework to the model of a spin-1/2 system coupled to an interacting spin chain at finite temperature.