Computational Aspects of Optional P\'{o}lya Tree

Optional P\'{o}lya Tree (OPT) is a flexible non-parametric Bayesian model for density estimation. Despite its merits, the computation for OPT inference is challenging. In this paper we present time complexity analysis for OPT inference and propose two algorithmic improvements. The first improvement, named Limited-Lookahead Optional P\'{o}lya Tree (LL-OPT), aims at greatly accelerate the computation for OPT inference. The second improvement modifies the output of OPT or LL-OPT and produces a continuous piecewise linear density estimate. We demonstrate the performance of these two improvements using simulations

An integrated approach with new strategies for QSAR models and lead optimization

Compound testing set for huAChE collected from Guo et al. (PDF 52 kb

Demonstration of efficient scheme for generation of "Event Ready" entangled photon pairs from single photon source

We present a feasible and efficient scheme, and its proof-of-principle demonstration, of creating entangled photon pairs in an event-ready way using only simple linear optical elements and single photons. The quality of entangled photon pair produced in our experiment is confirmed by a strict violation of Bell's inequality. This scheme and the associated experimental techniques present an important step toward linear optics quantum computation.Comment: 4 pages, 4 figure