Alternative subtraction scheme using Nagy Soper dipoles

We present an alternative subtraction scheme for the treatment of infrared divergences in NLO QCD calculations. In this scheme, the number of transformations is greatly reduced with respect to the standard subtraction scheme by Catani and Seymour. We discuss the general setup of the scheme as well as first applications to NLO processes at hadron and lepton colliders.Comment: 6 pages, 1 figure, presented at RADCOR 0

Entanglement scaling in critical two-dimensional fermionic and bosonic systems

We relate the reduced density matrices of quadratic bosonic and fermionic models to their Green's function matrices in a unified way and calculate the scaling of bipartite entanglement of finite systems in an infinite universe exactly. For critical fermionic 2D systems at T=0, two regimes of scaling are identified: generically, we find a logarithmic correction to the area law with a prefactor dependence on the chemical potential that confirms earlier predictions based on the Widom conjecture. If, however, the Fermi surface of the critical system is zero-dimensional, we find an area law with a sublogarithmic correction. For a critical bosonic 2D array of coupled oscillators at T=0, our results show that entanglement follows the area law without corrections.Comment: 4 pages, 4 figure

Impact of edge-removal on the centrality betweenness of the best spreaders

The control of epidemic spreading is essential to avoid potential fatal consequences and also, to lessen unforeseen socio-economic impact. The need for effective control is exemplified during the severe acute respiratory syndrome (SARS) in 2003, which has inflicted near to a thousand deaths as well as bankruptcies of airlines and related businesses. In this article, we examine the efficacy of control strategies on the propagation of infectious diseases based on removing connections within real world airline network with the associated economic and social costs taken into account through defining appropriate quantitative measures. We uncover the surprising results that removing less busy connections can be far more effective in hindering the spread of the disease than removing the more popular connections. Since disconnecting the less popular routes tend to incur less socio-economic cost, our finding suggests the possibility of trading minimal reduction in connectivity of an important hub with efficiencies in epidemic control. In particular, we demonstrate the performance of various local epidemic control strategies, and show how our approach can predict their cost effectiveness through the spreading control characteristics.Comment: 11 pages, 4 figure

Controlling internal barrier in low loss BaTiO3 supercapacitors

Supercapacitor behavior has been reported in a number of oxides including reduced BaTiO3 ferroelectric ceramics. These so-called giant properties are however not easily controlled. We show here that the continuous coating of individual BaTiO3 grains by a silica shell in combination with spark plasma sintering is a way to process bulk composites having supercapacitor features with low dielectric losses and temperature stability. The silica shell acts both as an oxidation barrier during the processing and as a dielectric barrier in the final composite

Weak Parity

We study the query complexity of Weak Parity: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+eps fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for Weak Parity that makes only O(n/log^0.246(1/eps)) queries, as well as a quantum algorithm that makes only O(n/sqrt(log(1/eps))) queries. We also prove a lower bound of Omega(n/log(1/eps)) in both cases; and using extremal combinatorics, prove lower bounds of Omega(log n) in the randomized case and Omega(sqrt(log n)) in the quantum case for any eps>0. We show that improving our lower bounds is intimately related to two longstanding open problems about Boolean functions: the Sensitivity Conjecture, and the relationships between query complexity and polynomial degree.Comment: 18 page