This paper is the continuation of [11] where the rotation construction of left-continuous triangular norms was presented. Here the class of triangular subnorms and a second construction, called rotation-annihilation, are introduced: Let T1 be a left-continuous triangular norm. If T1 has no zero divisors then let T2 be a left-continuous rotation invariant t-subnorm. If T1 has zero divisors then ...

Several studies have demonstrated the effectiveness of Haar wavelets in reducing large amounts of data down to compact wavelet synopses that can be used to obtain fast, accurate approximate query answers. While Haar wavelets were originally designed for minimizing the overall root-mean-squared (i.e., L2-norm) error in the data approximation, the recently-proposed idea of probabilistic wavelet s...

In this paper, we explore the IBM Model with a `0-norm prior to the semantic parsing which parses a sentence to its corresponding meaning representation, and compare two supervised probabilistic Combinatory Categorial Grammar (PCCG) online learning approaches that are Unification-Based Learning (UBL) method and Factored Unification-Based Learning (FUBL) one. Specially, we extend manually GeoQue...

The partition function is fundamental for probabilistic graphical models—it is required for inference, parameter estimation, and model selection. Evaluating this function corresponds to discrete integration, namely a weighted sum over an exponentially large set. This task quickly becomes intractable as the dimensionality of the problem increases. We propose an approximation scheme that, for any...

In this paper, we show that the popular C-SVM, soft-margin support vector classifier is equivalent to minimization of Buffered Probability of Exceedance (bPOE) by introducing a new SVM formulation, called the EC-SVM, which is derived as a bPOE minimization problem. Since it is derived from a simple bPOE minimization problem, the EC-SVM is simple to interpret with a meaningful free parameter, op...

in this paper, a new enhanced version of the particle swarm optimization (pso) is presented. an important modification is made by adding probabilistic functions into pso, and it is named probabilistic particle swarm optimization (ppso). since the variation of the velocity of particles in pso constitutes its search engine, it should provide two phases of optimization process which are: explorati...

Sparse coding consists in representing signals as sparse linear combinations of atoms selected from a dictionary. We consider an extension of this framework where the atoms are further assumed to be embedded in a tree. This is achieved using a recently introduced tree-structured sparse regularization norm, which has proven useful in several applications. This norm leads to regularized problems ...

Most of works related to vector quantization with structured codebooks deal with i.i.d. signal assumptions. We have shown in previous works that this hypothesis limited the efficiency of such coders applied on real signals. Indeed, we have proposed the use of a vector dead zone (VDZ) which outperforms previous schemes. The VDZ takes advantage of sparsity and clustering properties of sources lik...

A key focus of contemporary agent-oriented research and engineering is on open multiagent systems composed of truly autonomous, interacting agents. This poses new challenges, as entities in open systems are usually more or less mentally opaque (e.g., possibly insincere), and can enter and leave the system at will. Thus interactions among such blackor gray-box entities usually imply more or less...

In the recent PhD thesis of Bouw, an algorithm is examined that computes the group structure of the principal units of a p-adic number €eld completion. In the same thesis, this algorithm is used to compute Hilbert norm residue symbols. In the present paper, we will demonstrate two other applications. Œe €rst application is the computation of an important invariant of number €eld completions, ca...