A reversible infinite HMM using normalised random measures

We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.Comment: 9 pages, 6 figure

The Nappi-Witten string in the light-cone gauge

Some of the motivations for as well as the main points of the quantization of the Nappi Witten string in the light cone gauge are reviewed.Comment: 21 pages, Plain Tex, to appear in the E.P. Wigner memorial volume of Acta Physica Hungaric

SiGMa: Simple Greedy Matching for Aligning Large Knowledge Bases

The Internet has enabled the creation of a growing number of large-scale knowledge bases in a variety of domains containing complementary information. Tools for automatically aligning these knowledge bases would make it possible to unify many sources of structured knowledge and answer complex queries. However, the efficient alignment of large-scale knowledge bases still poses a considerable challenge. Here, we present Simple Greedy Matching (SiGMa), a simple algorithm for aligning knowledge bases with millions of entities and facts. SiGMa is an iterative propagation algorithm which leverages both the structural information from the relationship graph as well as flexible similarity measures between entity properties in a greedy local search, thus making it scalable. Despite its greedy nature, our experiments indicate that SiGMa can efficiently match some of the world's largest knowledge bases with high precision. We provide additional experiments on benchmark datasets which demonstrate that SiGMa can outperform state-of-the-art approaches both in accuracy and efficiency.Comment: 10 pages + 2 pages appendix; 5 figures -- initial preprin

NGC 3603 - a Local Template for Massive Young Clusters

We present a study of the star cluster associated with the massive Galactic HII region NGC3603 based on near-IR broad-- and narrowband observations taken with ISAAC/VLT under excellent seeing conditions (<0.4''). We discuss color-color diagrams and address the impact of the high UV flux on the disk evolution of the low-mass stars.Comment: 3 pages, 3 figures. To appear in the Proceedings of IAU Symposium 207 "Extragalactic Star Clusters", eds. E. Grebel, D. Geisler and D. Minitt

Vestibular neuritis: Vertigo and the high-acceleration vestibulo-ocular reflex

Abstract : Patients after vestibular neuritis (VN) often report persistent dizziness and disequilibrium. We correlated persistent symptoms with sustained impairment of the high-acceleration horizontal vestibulo-ocular reflex as determined by quantitative searchcoil head-impulse testing (qHIT). In 47 patients, qHIT was recorded 0-60 months and symptoms assessed with the Yardley Vertigo Symptom Scale short form ≥ 18 months after VN onset. No correlation between the magnitude of high-acceleration vestibular impairment and the severity of vertigo symptoms was observed. The lack of a symptom-qHIT correlation suggests that defective compensation at a more rostral level in the central nervous system may be responsible for protracted symptoms in VN patient

Models of Social Groups in Blogosphere Based on Information about Comment Addressees and Sentiments

This work concerns the analysis of number, sizes and other characteristics of groups identified in the blogosphere using a set of models identifying social relations. These models differ regarding identification of social relations, influenced by methods of classifying the addressee of the comments (they are either the post author or the author of a comment on which this comment is directly addressing) and by a sentiment calculated for comments considering the statistics of words present and connotation. The state of a selected blog portal was analyzed in sequential, partly overlapping time intervals. Groups in each interval were identified using a version of the CPM algorithm, on the basis of them, stable groups, existing for at least a minimal assumed duration of time, were identified.Comment: Gliwa B., Ko\'zlak J., Zygmunt A., Models of Social Groups in Blogosphere Based on Information about Comment Addressees and Sentiments, in the K. Aberer et al. (Eds.): SocInfo 2012, LNCS 7710, pp. 475-488, Best Paper Awar