A picture of the Yang-Mills deconfinement transition and its lattice verification

In the framework of the center vortex picture of confinement, the nature of the deconfining phase transition is studied. Using recently developed techniques which allow to associate a center vortex configuration with any given lattice gauge configuration, it is demonstrated that the confining phase is a phase in which vortices percolate, whereas the deconfined phase is a phase in which vortices cease to percolate if one considers an appropriate slice of space-time.Comment: 9 pages, 3 ps figures included via epsfig; invited talk presented by M. Engelhardt at the Eleventh International Light-Cone Workshop on "New directions in Quantum Chromodynamics", Kyungju, Korea, 21.-25.6.99, to appear in the proceeding

Center vortices of Yang-Mills theory at finite temperatures

Recent lattice calculations performed at zero temperature and in the maximal center gauge indicate that quark confinement can be understood in this gauge as due to fluctuations in the number of magnetic vortices piercing a given Wilson loop. This development has led to a revival of the vortex condensation theory of confinement. For a SU(2) gauge group, we show that also at finite temperatures, center vortices are the relevant collective infrared degrees of freedom determining the long-range static quark potential; in particular, their dynamics reflect the transition to the deconfining phase.Comment: 14 pages, 6 figures, numerics completely overhauled w.r.t. original version, physical conclusions unchange

Quantum gauge fixing and vortex dominance

We introduce quantum gauge fixing (QGF) as a new class of gauge fixings. While the maximal center gauge might not show vortex dominance, the confining properties of the vortices observed in past lattice calculations are argued to have been obtained in a gauge more akin to QGF than to the strict maximal center gauge.Comment: talk presented at LATTICE99(confinement), Pisa, Italy, 3 pages, 2 figures, LaTeX using espcrc2.st

Morphine nitrate and morphine acetate

n/

Effects of Violent Video Game Exposure on Aggressive Behavior, Aggressive thought Accessibility, and Aggressive Affect among Adults with and without Autism Spectrum Disorder

Recent mass shootings have prompted the idea among some members of the public that exposure to violent video games can have a pronounced effect on individuals with autism spectrum disorder (ASD). Empirical evidence for or against this claim currently is absent. To address this issue, adults with and without ASD were assigned to play a violent or nonviolent version of a customized first-person shooter video game, after which responses on three aggression-related outcome variables (aggressive behavior, aggressive thought accessibility, and aggressive affect) were assessed. Results showed strong evidence that adults with ASD are not differentially affected by acute exposure to violent video games compared to typically developing adults. Moreover, model comparisons showed modest evidence against any effect of violent game content whatsoever. Findings from the current experiment suggest that societal concerns over whether violent game exposure has a unique effect on adults with autism are not supported by evidence

Interaction of confining vortices in SU(2) lattice gauge theory

Center projection of SU(2) lattice gauge theory allows to isolate magnetic vortices as confining configurations. The vortex density scales according to the renormalization group, implying that the vortices are physical objects rather than lattice artifacts. Here, the binary correlations between points at which vortices pierce a given plane are investigated. We find an attractive interaction between the vortices. The correlations show the correct scaling behavior and are therefore physical. The range of the interaction is found to be (0.4 +/- 0.2) fm, which should be compared with the average planar vortex density of approximately 2 vortices/fm^2. We comment on the implications of these results for recent discussions of the Casimir scaling behavior of higher dimensional representation Wilson loops in the vortex confinement picture.Comment: 9 pages LaTeX, 2 ps figures included via eps

Routing of airplanes to two runways: monotonicity of optimal controls

We consider the problem of routing incoming airplanes to two runways of an airport. Due to air turbulence, the necessary separation time between two successive landing operations depends on the types of the airplanes. When viewed as a queueing problem, this means that we have dependent service times. The aim is to minimise waiting times of aircrafts. We consider here a model where arrivals form a stochastic process and where the decision maker does not know anything about future arrivals. We formulate this as a problem of stochastic dynamic programming and investigate monotonicity of optimal routing strategies with respect e.g. to the workload of the runways. We show that an optimal strategy is monotone (i.e. of switching type) only in a restricted case where decisions depend on the state of the runways only and not on the type of the arriving aircraft. Surprisingly, in the more realistic case where this type is also known to the decision maker, monotonicity need not hold

On the waiting time of arriving aircrafts and the capacity of airports with one or two runways

In this paper we examine a model for the landing procedure of aircrafts at an airport. The characteristic feature here is that due to air turbulence the safety distance between two landing aircrafts depends on the types of these two machines. Hence, an eficient routing of the aircraft to two runways may reduce their waiting time. First, we use M/SM/1 queues (with dependent service times) to model a single runway. We give the stability condition and a formula for the average waiting time of the aircrafts. Moreover, we derive easy to compute bounds on the waiting times by comparison to simpler queuing systems. In particular we study the effect of neglecting the dependency of the service times when using M/G/1-models. We then consider the case of two runways with a number of heuristic routing strategies such as coin flipping, type splitting, Round Robin and variants of the join-the-least-load rule. These strategies are analyzed and compared numerically with respect to the average delay they cause. It turns out that a certain modication of join-the-least-load gives the best results

A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions

The sheer amounts of biological data that are generated in recent years have driven the development of network analysis tools to facilitate the interpretation and representation of these data. A fundamental challenge in this domain is the reconstruction of a protein-protein subnetwork that underlies a process of interest from a genome-wide screen of associated genes. Despite intense work in this area, current algorithmic approaches are largely limited to analyzing a single screen and are, thus, unable to account for information on condition-specific genes, or reveal the dynamics (over time or condition) of the process in question. Here we propose a novel formulation for network reconstruction from multiple-condition data and devise an efficient integer program solution for it. We apply our algorithm to analyze the response to influenza infection in humans over time as well as to analyze a pair of ER export related screens in humans. By comparing to an extant, single-condition tool we demonstrate the power of our new approach in integrating data from multiple conditions in a compact and coherent manner, capturing the dynamics of the underlying processes.Comment: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013