We derive bounds on the size of an independent set based on eigenvalues. This generalizes a result due to Delsarte and Hoffman. We use this to obtain new bounds on the independence number of the Erdős-Rényi graphs. We investigate further properties of our bounds, and show how our results on the Erdős-Rényi graphs can be extended to other polarity graphs.

We present a new approach to the source separation problem for multiple speech signals. Using the extra visual information of the speaker’s face, the method aims to extract an acoustic speech signal from other acoustic signals by exploiting its coherence with the speaker’s lip movements. We define a statistical model of the joint probability of visual and spectral audio input for quantifying th...

Given a projective plane Σ and a polarity θ of Σ, the corresponding polarity graph is the graph whose vertices are the points of Σ, and two distinct points p1 and p2 are adjacent if p1 is incident to p θ 2 in Σ. A well-known example of a polarity graph is the Erdős-Rényi orthogonal polarity graph ERq, which appears frequently in a variety of extremal problems. Eigenvalue methods provide an uppe...

We present a language-independent and unsupervised algorithm for the segmentation of words into morphs. The algorithm is based on a new generative probabilistic model, which makes use of relevant prior information on the length and frequency distributions of morphs in a language. Our algorithm is shown to outperform two competing algorithms, when evaluated on data from a language with agglutina...

The Entity Linking (EL) task is concerned with linking entity mentions in a text collection with their corresponding knowledgebase entries. The majority of approaches have focused on EL over English text collections. However, some approaches propose language-independent or multilingual approaches to perform EL over texts in many languages. In this paper, our goal is to see how well EL systems p...

We present an O(1.1034) algorithm computing a maximum independent set of a graph with maximal degree 3. This result improves currently best upper bound of O(1.1255) for the problem obtained by Chen et al [2].

Stationary Subspace Analysis (SSA) [3] is an unsupervised learning method that finds subspaces in which data distributions stay invariant over time. It has been shown to be very useful for studying non-stationarities in various applications [5, 10, 4, 9]. In this paper, we present the first SSA algorithm based on a full generative model of the data. This new derivation relates SSA to previous w...

Shadowing has become a well-known method to improve learners’ overall proficiency. Our previous studies realized automatic scoring of shadowing speech using HMM phoneme posteriors, called GOP (Goodness of Pronunciation) and learners’ TOEIC scores were predicted adequately. In this study, we enhance our studies from multiple angles: 1) a much larger amount of shadowing speech is collected, 2) ma...

The objective of this work was to develop bioadhesive topical gel of Aceclofenac with the help of response-surface approach. Experiments were performed according to a 3-level factorial design to evaluate the effects of two independent variables [amount of Poloxamer 407 (PL-407 = X1) and hydroxypropylmethyl cellulose K100 M (HPMC = X2)] on the bioadhesive character of gel, rheological property o...

Knowledge and information workers work as individuals within virtual team structures. Those teams may be small, or they may in fact form part of larger groups which continue to share similar objectives. Knowledge workers therefore acquire and manage personal and group information which they may choose to manage themselves using Personal and small-Group Information Management tools and technique...