MorphoLogic’s Humor morphological analyzer engine has been used for the development of several high-quality computational morphologies, among them ones for complex agglutinative languages. However, Humor’s closed source licensing scheme has been an obstacle to making these resources widely available. Moreover, there are other limitations of the rule-based Humor engine: lack of support for morph...

This article provides a brief review of recent developments in Markov chain Monte Carlo methodology. The methods discussed include the standard Metropolis-Hastings algorithm, the Gibbs sampler, and various special cases of interest to practitioners. It also devotes a section on strategies for improving mixing rate of MCMC samplers, e.g., simulated tempering, parallel tempering, parameter expans...

In this article, we unveil a new property of linear interference cancellation detectors. Particularly, we focus in this study on the linear parallel interference cancellation (LPIC) detector and show that it exhibits a semi-convergence property. The roots of the semi-convergence behavior of the LPIC detector are clarified and the necessary conditions for its occurrence are determined. In additi...

We describe a simple method for certifying that an experimental device prepares a desired quantum state ρ. Our method is applicable to any pure state ρ, and it provides an estimate of the fidelity between ρ and the actual (arbitrary) state in the lab, up to a constant additive error. The method requires measuring only a constant number of Pauli expectation values, selected at random according t...

Abstract There is a plurality of formal constraints for aggregating probabilities group individuals. Different characterise different families aggregation rules. In this paper, we focus on the linear and geometric opinion pooling rules which consist in linear, respectively, weighted averaging individuals’ probabilities. For these families, it debated weights exactly are to be chosen. By applyin...

The article presents an analytic method for designing Pareto-optimal selection systems where the applicants belong to a mixture of candidate populations. The method is useful in both applied and research settings. In an applied context, the present method is the first to assist the selection practitioner when deciding on 6 major selection design issues: (1) the predictor subset, (2) the selecti...

Due to the nature of textual data the application of association rule mining in text corpora has attracted the focus of the research scientific community for years. In this paper we demonstrate a system that can efficiently mine association rules from text. The system annotates terms using several annotators, and extracts text association rules between terms or categories of terms. An additiona...

The implementation of a system for person tracking is often a compromise between sophisticated tracking algorithms and simplicity (to achieve the desired frame rate on standard PCs). In this paper, we propose a fuzzy-based rule system for tracking people using simple segmentation algorithms. The system allows integration of heuristics in the tracking algorithm, adjusted by means of weighting fu...

Web usage mining has gained more popularity among researchers in discovering the users browsing behavior mining the web server log that records all the users’ transactions activities. In this paper, we developed a usage model for predictions based on association rule. Similarity between items contained in the active user profile will be calculated upon the matched rules and finally the top-N mo...

Rare variant association studies are at a critical inflexion point with the increasing availability of exome-sequencing data. A popular test of association is the sequence kernel association test (SKAT). Weights are embedded within SKAT to reflect the hypothesized contribution of the variants to the trait variance. Correct weighting is expected to boost power, and yet the correct weights are ge...