We describe the systems we have used for participating in Subtasks D (binary quantification) and E (ordinal quantification) of SemEval-2016 Task 4 “Sentiment Analysis in Twitter”. The binary quantification system uses a “Probabilistic Classify and Count” (PCC) approach that leverages the calibrated probabilities obtained from the output of an SVM. The ordinal quantification approach uses an ord...

LZW Algorithm is the most popular dictionary-based adaptive text compression scheme [l]. In LZW algorithm, a changing dictionary contains common strings that have been encountered so far in the text. Motivation of this research is to explore an on-line variablelength binary encoding. We apply this encoding to LZW codes for remedy of the problem that we discussed in our earlier paper in DCC’95 [...

Non –crossing set partitions are counted by the Catalan numbers and have been extensively studied in mathematics. We introduce the concept of a non-crossing tree partition and then use generating functions to count the number non-crossing tree partitions in Ordered and Binary Phylogenetic trees. In addition, we explore the connection between convexity, tree partitions and independent sets. Last...

We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to minimise global interprocessor communication costs. The second is a new ring ordering which may be implemented e ciently on an ordinary binary tree. By combining these two orderings, an e cient new ordering, well suited f...

A central limit theorem for binary tree is numerically examined. Two types of central limit theorem for higher-order branches are formulated. A topological structure of a binary tree is expressed by a binary sequence, and the Horton-Strahler indices are calculated by using the sequence. By fitting the Gaussian distribution function to our numerical data, the values of variances are determined a...

The so-called binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive than the well known binary perfect phylogeny. Here, we focus on the notion of (binary) persistent characters, i.e. characters that can be realized on a phylogenetic tree by at most one 0 → 1 transition followed by at most one 1 → 0 transition ...

Multiple sensor fusion and binary decision tree classifiers have been used to successfully solve many real world problems. These topics are usually studied separately. Fusion of binary decision tree classifiers in a multiple sensor environment has received very little attention. In this paper, we formulate the problem, investigate its scope, outline some issues associated with decision tree cla...