This paper tests speech recognition using prosody dependent allophone models. The log likehoods of various prosodically labeled phonemes are calculated using Baum-Welsh re-estimation. These log likehoods are then compared to log likehoods of non-prosodically labeled phonemes. Based on the comparison of these log likehoods, it can be concluded that modeling all prosodic information directly in t...

This paper tests speech recognition using prosody dependent allophone models. The log likehoods of various prosodically labeled phonemes are calculated using Baum-Welsh re-estimation. These log likehoods are then compared to log likehoods of non-prosodically labeled phonemes. Based on the comparison of these log likehoods, it can be concluded that modeling all prosodic information directly in t...

BACKGROUND For the analysis of length-of-stay (LOS) data, which is characteristically right-skewed, a number of statistical estimators have been proposed as alternatives to the traditional ordinary least squares (OLS) regression with log dependent variable. METHODS Using a cohort of patients identified in the Australian and New Zealand Intensive Care Society Adult Patient Database, 2008-2009,...

In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: • concat – concatenates two strings, • split – splits a string into two at a given position, • compare – finds the lexicographical order (less, equal, greater) between two strings, • LCP – calculates the longest common prefix of two strings. We present an efficient data ...

We analyze greedy algorithms for broadcasting messages throughout a multi-hop wireless network, using a slot-based model that includes message collisions without collision detection. Our algorithms are split formally into two pieces: a high-level piece for broadcast and a low-level piece for contention management. We accomplish the split using abstract versions of the MAC layer to encapsulate t...

In this work, we describe a simple and efficient construction of a large subset S of Fp , where p is a prime, such that the set A(S) for any non-identity affine map A over Fp has small intersection with S . Such sets, called affine-evasive sets, were defined and constructed in [ADL14] as the central step in the construction of non-malleable codes against affine tampering over Fp , for a prime p...

Distinguishing Physical and Mathematical Knots and Links Joel Hass (joint work with Alexander Coward ) The theory of knots and links studies one-dimensional submanifolds of R. These are often described as loops of string, or rope, with their ends glued together. Real ropes however are not one-dimensional, but have a positive thickness and a finite length. Indeed, most physical applications of k...

The standing skyline continues to be a common cable logging configuration. In payload analysis it is usually assumed that the tagline (line connecting logs carriage) length held constant while yarding turn up corridor. We show this assumption severely limits load-carrying capacity for skylines operating with partial suspension. suggest smart carriage technology could markedly increase log load ...