We propose Hetero-Labeled LDA (hLLDA), a novel semi-supervised topic model, which can learn from multiple types of labels such as document labels and feature labels (i.e., heterogeneous labels), and also accommodate labels for only a subset of classes (i.e., partial labels). This addresses two major limitations in existing semi-supervised learning methods: they can incorporate only one type of ...

Social media has quickly established itself as an important means that people, NGOs and governments use to spread information during natural or man-made disasters, mass emergencies and crisis situations. Given this important role, real-time analysis of social media contents to locate, organize and use valuable information for disaster management is crucial. In this paper, we propose self-learni...

Deep generative models trained with large amounts of unlabelled data have proven to be powerful within the domain of unsupervised learning. Many real life data sets contain a small amount of labelled data points, that are typically disregarded when training generative models. We propose the Cluster-aware Generative Model, that uses unlabelled information to infer a latent representation that mo...

As real-time embedded systems integrate more and more functionality, they are demanding increasing amounts of computational power that can only be met by deploying them on powerful multi-core architectures. Efficient task allocation and scheduling on such architectures is paramount. Multicore scheduling algorithms for independent real-time tasks has been the focus of much research over the year...

The Hierarchical Scheduling Framework (HSF) has been introduced as a design-time framework to enable compositional schedulability analysis of embedded software systems with real-time properties. In this paper a software system consists of a number of semi-independent components called subsystems. Subsystems are developed independently and later integrated to form a system. To support this desig...

Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges to x in such a way that the ratios of the approximation errors are bounded by h. In this paper we discuss the h-monotonic computability of semi-computable real numbers which are limits of monotone computable sequences ...

In this paper, we investigate cooperative traffic light control for multiple intersections based on semi-realtime processing. As urban traffic congestion problems is increasingly aggravating, existing traffic light controllers can no longer satisfy the rising demands for efficiently easing traffic pressure. In this paper, we propose an adaptive traffic light control algorithm based on semi-real...

A proof of Thompson’s conjecture for real semi-simple Lie groups has been given by Kapovich, Millson, and Leeb. In this note, we give another proof of the conjecture by using a theorem of Alekseev, Meinrenken, and Woodward from symplectic geometry.

We address the problem of deriving meaningful semantic index information for a multi-media database using a semi-structured document model. We show how our framework, called feature grammars, can be used to (1) exploit third-party interpretation modules for real-world unstructured components, and (2) use context-free grammars to convert such poorly or unstructured input to semi-structured outpu...

Real solution classification of parametric polynomial systems is a crucial problem in real quantifier elimination which interests Volker Weispfenning and others. In this paper, we present a stepwise refinement algorithm for real solution classifications of a class of parametric systems consisting of polynomial equations, inequalities and inequations. For an input system, the algorithm outputs t...