85,844 research outputs found
Exotic hadrons at hadron colliders
In this proceeding, an overview of the recent progress of the exotic hadrons
studies at hadron colliders is presented, including the experimental
measurement results from CMS, LHCb, CDF and D0. The talk covers the physics
properties study of X(3872); the search for Y(4140) state etc; the recent
result of Z(4430); and also the extended study to bottomonium sector.Comment: Presented at the 2014 Flavor Physics and CP Violation (FPCP-2014),
Marseille, France, May 26-30 2014, 9 pages, 9 figures. This talk also
contains material of LHCb, D0 and CD
Projection Onto A Simplex
This mini-paper presents a fast and simple algorithm to compute the
projection onto the canonical simplex . Utilizing the Moreau's
identity, we show that the problem is essentially a univariate minimization and
the objective function is strictly convex and continuously differentiable.
Moreover, it is shown that there are at most n candidates which can be computed
explicitly, and the minimizer is the only one that falls into the correct
interval
Space Shuffle: A Scalable, Flexible, and High-Bandwidth Data Center Network
Data center applications require the network to be scalable and
bandwidth-rich. Current data center network architectures often use rigid
topologies to increase network bandwidth. A major limitation is that they can
hardly support incremental network growth. Recent work proposes to use random
interconnects to provide growth flexibility. However routing on a random
topology suffers from control and data plane scalability problems, because
routing decisions require global information and forwarding state cannot be
aggregated. In this paper we design a novel flexible data center network
architecture, Space Shuffle (S2), which applies greedy routing on multiple ring
spaces to achieve high-throughput, scalability, and flexibility. The proposed
greedy routing protocol of S2 effectively exploits the path diversity of
densely connected topologies and enables key-based routing. Extensive
experimental studies show that S2 provides high bisectional bandwidth and
throughput, near-optimal routing path lengths, extremely small forwarding
state, fairness among concurrent data flows, and resiliency to network
failures
Optimal Jackknife for Discrete Time and Continuous Time Unit Root Models
Maximum likelihood estimation of the persistence parameter in the discrete time unit root model is known for suffering from a downward bias. The bias is more pronounced in the continuous time unit root model. Recently Chambers and Kyriacou (2010) introduced a new jackknife method to remove the fiÂ…rst order bias in the estimator of the persistence parameter in a discrete time unit root model. This paper proposes an improved jackknife estimator of the persistence parameter that works for both the discrete time unit root model and the continuous time unit root model. The proposed jackknife estimator is optimal in the sense that it minimizes the variance. Simulations highlight the performance of the proposed method in both contexts. They show that our optimal jackknife reduces the variance of the jackknife method of Chambers and Kyriacou by at least 10% in both cases.Bias reduction, Variance reduction, Vasicek model, Long-span Asymptotics, Autoregression
- …