Structure propagation for zero-shot learning

The key of zero-shot learning (ZSL) is how to find the information transfer model for bridging the gap between images and semantic information (texts or attributes). Existing ZSL methods usually construct the compatibility function between images and class labels with the consideration of the relevance on the semantic classes (the manifold structure of semantic classes). However, the relationship of image classes (the manifold structure of image classes) is also very important for the compatibility model construction. It is difficult to capture the relationship among image classes due to unseen classes, so that the manifold structure of image classes often is ignored in ZSL. To complement each other between the manifold structure of image classes and that of semantic classes information, we propose structure propagation (SP) for improving the performance of ZSL for classification. SP can jointly consider the manifold structure of image classes and that of semantic classes for approximating to the intrinsic structure of object classes. Moreover, the SP can describe the constrain condition between the compatibility function and these manifold structures for balancing the influence of the structure propagation iteration. The SP solution provides not only unseen class labels but also the relationship of two manifold structures that encode the positive transfer in structure propagation. Experimental results demonstrate that SP can attain the promising results on the AwA, CUB, Dogs and SUN databases

Joint Vertex Degrees in an Inhomogeneous Random Graph Model

In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly inhomogeneous distribution, only when the degrees are large can we reasonably approximate the joint counts as independent. The proofs are based on Stein's method and the Stein-Chen method with a new size-biased coupling for such inhomogeneous random graphs, and hence bounds on distributional distance are obtained. Finally we illustrate that apparent (pseudo-) power-law type behaviour can arise in such inhomogeneous networks despite not actually following a power-law degree distribution.Comment: 30 pages, 9 figure

A large-scale one-way quantum computer in an array of coupled cavities

We propose an efficient method to realize a large-scale one-way quantum computer in a two-dimensional (2D) array of coupled cavities, based on coherent displacements of an arbitrary state of cavity fields in a closed phase space. Due to the nontrivial geometric phase shifts accumulating only between the qubits in nearest-neighbor cavities, a large-scale 2D cluster state can be created within a short time. We discuss the feasibility of our method for scale solid-state quantum computationComment: 5 pages, 3 figure

Vacuum polarization for neutral particles in 2+1 dimensions

In 2+1 dimensions there exists a duality between a charged Dirac particle coupled minimally to a background vector potential and a neutral one coupled nonminimally to a background electromagnetic field strength. A constant uniform background electric current induces in the vacuum of the neutral particle a fermion current which is proportional to the background one. A background electromagnetic plane wave induces no current in the vacuum. For constant but nonuniform background electric charge, known results for charged particles can be translated to give the induced fermion number. Some new examples with infinite background electric charge are presented. The induced spin and total angular momentum are also discussed.Comment: REVTeX, 7 pages, no figur

Mass Spectrum and Bounds on the Couplings in Yukawa Models With Mirror-Fermions

The $\rm SU(2)_L\otimes SU(2)_R$ symmetric Yukawa model with mirror-fermions in the limit where the mirror-fermion is decoupled is studied both analytically and numerically. The bare scalar self-coupling $\lambda$ is fixed at zero and infinity. The phase structure is explored and the relevant phase transition is found to be consistent with a second order one. The fermionic mass spectrum close to that transition is discussed and a first non-perturbative estimate of the influence of fermions on the upper and lower bounds on the renormalized scalar self-coupling is given. Numerical results are confronted with perturbative predictions.Comment: 7 (Latex) page

Finite-Volume Two-Pion Amplitudes in the I=0 Channel

We perform a calculation in one-loop chiral perturbation theory of the two-pion matrix elements and correlation functions of an I=0 scalar operator, in finite and infinite volumes for both full and quenched QCD. We show that major difficulties arise in the quenched theory due to the lack of unitarity. Similar problems are expected for quenched lattice calculations of $K \to \pi \pi$ amplitudes with $\Delta I=1/2$. Our results raise the important question of whether it is consistent to study $K\to\pi\pi$ amplitudes beyond leading order in chiral perturbation theory in quenched or partially quenched QCD.Comment: Version to appear on Phys. Lett. B, with only very minor and stylistic change

Asymptotic optimality of maximum pressure policies in stochastic processing networks

We consider a class of stochastic processing networks. Assume that the networks satisfy a complete resource pooling condition. We prove that each maximum pressure policy asymptotically minimizes the workload process in a stochastic processing network in heavy traffic. We also show that, under each quadratic holding cost structure, there is a maximum pressure policy that asymptotically minimizes the holding cost. A key to the optimality proofs is to prove a state space collapse result and a heavy traffic limit theorem for the network processes under a maximum pressure policy. We extend a framework of Bramson [Queueing Systems Theory Appl. 30 (1998) 89--148] and Williams [Queueing Systems Theory Appl. 30 (1998b) 5--25] from the multiclass queueing network setting to the stochastic processing network setting to prove the state space collapse result and the heavy traffic limit theorem. The extension can be adapted to other studies of stochastic processing networks.Comment: Published in at http://dx.doi.org/10.1214/08-AAP522 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

THE IMPACT OF RESEARCH LED AGRICULTURAL PRODUCTIVITY GROWTH ON POVERTY REDUCTION IN AFRICA, ASIA AND LATIN AMERICA

Twenty percent of the world population, or 1.2 billion live on less than $1 per day; 70$144 and in Asia $180, or 50 cents per day, but this is covered by output growth. By contrast, the per capita cost for the richer countries of Latin America is over$11,000.Agricultural Productivity, Poverty Reduction, Food Security and Poverty, Research and Development/Tech Change/Emerging Technologies, 011, 013, 015,