Beef manual for 4-H club members

Cover title

Quantitative Treatment of Decoherence

We outline different approaches to define and quantify decoherence. We argue that a measure based on a properly defined norm of deviation of the density matrix is appropriate for quantifying decoherence in quantum registers. For a semiconductor double quantum dot qubit, evaluation of this measure is reviewed. For a general class of decoherence processes, including those occurring in semiconductor qubits, we argue that this measure is additive: It scales linearly with the number of qubits.Comment: Revised version, 26 pages, in LaTeX, 3 EPS figure

Feedback Vertex Sets in Tournaments

We study combinatorial and algorithmic questions around minimal feedback vertex sets in tournament graphs. On the combinatorial side, we derive strong upper and lower bounds on the maximum number of minimal feedback vertex sets in an n-vertex tournament. We prove that every tournament on n vertices has at most 1.6740^n minimal feedback vertex sets, and that there is an infinite family of tournaments, all having at least 1.5448^n minimal feedback vertex sets. This improves and extends the bounds of Moon (1971). On the algorithmic side, we design the first polynomial space algorithm that enumerates the minimal feedback vertex sets of a tournament with polynomial delay. The combination of our results yields the fastest known algorithm for finding a minimum size feedback vertex set in a tournament

On the Effectiveness of Sampling for Evolutionary Optimization in Noisy Environments

Sampling has been often employed by evolutionary algorithms to cope with noise when solving noisy real-world optimization problems. It can improve the estimation accuracy by averaging over a number of samples, while also increasing the computation cost. Many studies focused on designing efficient sampling methods, and conflicting empirical results have been reported. In this paper, we investigate the effectiveness of sampling in terms of rigorous running time, and find that sampling can be ineffective. We provide a general sufficient condition under which sampling is useless (i.e., sampling increases the running time for finding an optimal solution), and apply it to analyzing the running time performance of (1+1)-EA for optimizing OneMax and Trap problems in the presence of additive Gaussian noise. Our theoretical analysis indicates that sampling in the above examples is not helpful, which is further confirmed by empirical simulation results

Search for direct production of charginos and neutralinos in events with three leptons and missing transverse momentum in √s = 7 TeV pp collisions with the ATLAS detector

A search for the direct production of charginos and neutralinos in final states with three electrons or muons and missing transverse momentum is presented. The analysis is based on 4.7 fb−1 of proton–proton collision data delivered by the Large Hadron Collider and recorded with the ATLAS detector. Observations are consistent with Standard Model expectations in three signal regions that are either depleted or enriched in Z-boson decays. Upper limits at 95% confidence level are set in R-parity conserving phenomenological minimal supersymmetric models and in simplified models, significantly extending previous results

A sensorimotor control framework for understanding emotional communication and regulation

JHGW and CFH are supported by the Northwood Trust. TEVR was supported by a National Health and Medical Research Council (NHMRC) Early Career Fellowship (1088785). RP and MW were supported by the the Australian Research Council (ARC) Centre of Excellence for Cognition and its Disorders (CE110001021)Peer reviewedPublisher PD