This paper develops a new and natural parallel vector model, and shows that for all k ≥ 1, the languages recognizable in O(log n) time and polynomial work in the model are exactly those in NC. Some improvements to other simulations in parallel models and reversal complexity are given.

Large volume HPGe detectors are commonly used in applications that require good energy resolution and high detection efficiency, but are expensive and difficult to grow. Clover detectors consisting of 4 smaller crystals in a common cryostat are a possible alternative, but traditionally require complex readout electronics. In contrast, the DGF Pixie-4 is a compact, digital spectrometer providing...

We propose a definition of QNC, the quantum analog of the efficient parallel class NC. We exhibit several useful gadgets and prove that various classes of circuits can be parallelized to logarithmic depth, including circuits for encoding and decoding standard quantum errorcorrecting codes, or more generally any circuit consisting of controllednot gates, controlled π-shifts, and Hadamard gates. ...

In this paper we report on the ISMIR 2004 Audio Description Contest. We first detail the contest organization, evaluation metrics, data and infrastructure. We then provide the details and results of each contest in turn. Published papers and algorithm source codes are given when originally available. We finally discuss some aspects of these contests and propose ways to organize future, improved...

Objective(s): Fabrication of scaffolds with improved mechanical properties and favorable cellular compatibility is crucial for many tissue engineering applications. This study was aimed to improve mechanical and biological properties of polycaprolactone (PCL), which is a common biocompatible and biodegradable synthetic polymer in tissue engineering. Nanofibrillated chitosan (NC) was used as a n...

This paper derives a tight asymptotic upper bound on the maximum volume M∗(n, ) of length-n codes for memoryless channels subject to an average decoding error probability : M(n, ) = exp{nC − √nV Φ−1( ) + 1 2 log n + An, + o(1)} where C is Shannon capacity, V is channel dispersion, Φ is the tail probability of the normal distribution, and An, is a bounded sequence that can be explicitly identifi...

Starting from 2D Euclidean quantum gravity, we show that one recovers 2D Lorentzian quantum gravity by removing all baby universes. Using a peeling procedure to decompose the discrete, triangulated geometries along a one-dimensional path, we explicitly associate with each Euclidean space-time a (generalized) Lorentzian spacetime. This motivates a map between the parameter spaces of the two theo...

The fundamental difference between the data-hiding and watermark signature verification problems was highlighted in a 2001 paper by Steinberg and Merhav. In data hiding, the maximum number of messages that can be reliably decoded is essentially 2 , where n is the host sequence length and C is the data-hiding capacity. A dramatically different result is obtained for signature verification: in pr...