We discuss non-Abelian bosonization of two and three dimensional fermions using a path-integral framework in which the bosonic action follows from the evaluation of the fermion determinant for the Dirac operator in the presence of a vector field. This naturally leads to the Wess-Zumino-Witten action for massless two-dimensional fermions and to a Chern-Simons action for very massive three dimens...

We discuss non-Abelian bosonization of two and three dimensional fermions using a path-integral framework in which the bosonic action follows from the evaluation of the fermion determinant for the Dirac operator in the presence of a vector field. This naturally leads to the Wess-Zumino-Witten action for massless two-dimensional fermions and to a Chern-Simons action for very massive three dimens...

A popular Bayesian nonparametric approach to survival analysis consists in modeling hazard rates as kernel mixtures driven by a completely random measure. In this paper we derive asymptotic results for linear and quadratic functionals of such random hazard rates. In particular, we prove central limit theorems for the cumulative hazard function and for the path–second moment and path–variance of...

In recent work we have developed a novel variational inference method for partially observed systems governed by stochastic differential equations. In this paper we provide a comparison of the Variational Gaussian Process Smoother with an exact solution computed using a Hybrid Monte Carlo approach to path sampling, applied to a stochastic double well potential model. It is demonstrated that the...

This paper presents a reformulation of bidirectional path-tracing that adequately divides the algorithm into processes efficiently executed in parallel on both the CPU and the GPU. We thus benefit from high-level optimization techniques such as double buffering, batch processing, and asyncronous execution, as well as from the exploitation of most of the CPU, GPU, and memory bus capabilities. Ou...

Today’s optimal path strategies are the more competitive the lower memory space and performance time they need. That is why the concept of hierarchical maps has been introduced to delegate the main part of long distance path determination to maps with levels as high as possible (larger regions ⇔ roads of higher levels). The size of the corresponding high level road graphs remains very tractable...

The ``height'' of a graph G is defined to be the number of steps to construct G by two simple graph operations. Let Bn be the graph obtained from an n-edge path by doubling each edge in parallel. Then, for any minor-closed class G of graphs, the following are proved to be equivalent: (1) Some Bn is not in G; (2) There is a number h such that every graph in G has height at most h; (3) G is well-...

Penn: There is a real need for more clinician-friendly screening tools. In one of our programs, the counselors have combined the most effective and efficient parts of several instruments into our own hybrid screener. We also have tried CAAPE, the Comprehensive Addictions and Psychological Evaluation developed by Dr. Norman Hoffman, which is designed specifically to diagnose co-occurring disorde...