The infinite HMM for unsupervised PoS tagging

We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing the number of hidden states in unsupervised Markov models for PoS tagging. We experiment with two non-parametric priors, the Dirichlet and Pitman-Yor processes, on the Wall Street Journal dataset using a parallelized implementation of an iHMM inference algorithm. We evaluate the results with a variety of clustering evaluation metrics and achieve equivalent or better performances than previously reported. Building on this promising result we evaluate the output of the unsupervised PoS tagger as a direct replacement for the output of a fully supervised PoS tagger for the task of shallow parsing and compare the two evaluations. © 2009 ACL and AFNLP.

Moment asymptotic stability of stochastic hybrid delay systems

in this paper we investigate the moment asymptotic stability for the nonlinear stochastic hybrid delay systems. Sufficient criteria on the stabilization and robust stability are also established for linear stochastic hybrid delay systems. Copyright © 2005 IFAC.

An Infinite Latent Attribute Model for Network Data

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently available models can be classified by whether clusters are disjoint or are allowed to overlap. These models can explain a "flat" clustering structure. Hierarchical Bayesian models provide a natural approach to capture more complex dependencies. We propose a model in which objects are characterised by a latent feature vector. Each feature is itself partitioned into disjoint groups (subclusters), corresponding to a second layer of hierarchy. In experimental comparisons, the model achieves significantly improved predictive performance on social and biological link prediction tasks. The results indicate that models with a single layer hierarchy over-simplify real networks.

Balanced realisations of all-pass systems using exact arithmetic with application to the approximation of delay systems

Numerically well-conditioned state-space realisations for all-pass systems, such as Padé approximations to exp(-s), are derived that can be computed using exact integer arithmetic. This is then applied to the a series of functions of exp(-s). It is also shown that the H-infinity norm of the transfer function from the input to the state of a balanced realisation of the Padé approximation of exp(-s) is unity. © 2012 IEEE.

Primary antibody deficiency and diagnostic delay.

AIMS: To assess the occurrence of diagnostic delay in primary antibody deficiency in the period 1989-2002, since a similar study in 1989, and to assess the impact of UK national guidelines communicated in 1995. METHODS: A retrospective case note review was performed of 89 consecutive patients with antibody deficiency referred to a regional referral centre for clinical immunology in north west England and north Wales. The delay in diagnosis and the estimated resulting morbidity in terms of infections were assessed. RESULTS: Fifty six of the 89 patients experienced delay in diagnosis. The overall median delay was 2 years (mean, 4.4), resulting in substantial morbidity (equivalent to two major infections and one minor infection). This shows a moderate improvement since the previous study in 1989 and since the introduction of UK national guidelines in 1995. Respiratory infections are the most frequent presenting infections, and respiratory physicians the most common source of referral. CONCLUSIONS: There is still considerable delay in the diagnosis of primary antibody deficiency, but the data suggest an improvement in practice since the previous study in 1989 and the distribution of national guidelines in 1995.

On the time delay in continuous in-cylinder sampling from IC engines

When gas sample is continuously drawn from the cylinder of an internal combustion engine, the sample that appears at the end of the sampling system corresponds to the in-cylinder content sometime ago because of the finite transit time which is a function of the cylinder pressure history. This variable delay causes a dispersion of the sample signal and makes the interpretation of the signal difficult An unsteady flow analysis of a typical sampling system was carried out for selected engine loads and speeds. For typical engine operation, a window in which the delay is approximately constant may be found. This window gets smaller with increase in engine speed, with decrease in load, and with the increase in exit pressure of the sampling system.

Local stability results for the collective behaviors of infinite populations of pulse-coupled oscillators

In this paper, we investigate the behavior of pulse-coupled integrate-and-fire oscillators. Because the stability analysis of finite populations is intricate, we investigate stability results in the approximation of infinite populations. In addition to recovering known stability results of finite populations, we also obtain new stability results for infinite populations. In particular, under a weak coupling assumption, we solve for the continuum model a conjecture still prevailing in the finite dimensional case. © 2011 IEEE.

A perturbation approach to the stabilization of nonlinear cascade systems with time-delay

The effect of bounded input perturbations on the stability of nonlinear globally asymptotically stable delay differential equations is analyzed. We investigate under which conditions global stability is preserved and if not, whether semi-global stabilization is possible by controlling the size or shape of the perturbation. These results are used to study the stabilization of partially linear cascade systems with partial state feedback.

The Supervised IBP: Neighbourhood Preserving Infinite Latent Feature Models

We propose a probabilistic model to infer supervised latent variables in the Hamming space from observed data. Our model allows simultaneous inference of the number of binary latent variables, and their values. The latent variables preserve neighbourhood structure of the data in a sense that objects in the same semantic concept have similar latent values, and objects in different concepts have dissimilar latent values. We formulate the supervised infinite latent variable problem based on an intuitive principle of pulling objects together if they are of the same type, and pushing them apart if they are not. We then combine this principle with a flexible Indian Buffet Process prior on the latent variables. We show that the inferred supervised latent variables can be directly used to perform a nearest neighbour search for the purpose of retrieval. We introduce a new application of dynamically extending hash codes, and show how to effectively couple the structure of the hash codes with continuously growing structure of the neighbourhood preserving infinite latent feature space.