Related papers: Classification of constraints using chain by chain…

We present a novel approach for constrained Bayesian inference. Unlike current methods, our approach does not require convexity of the constraint set. We reduce the constrained variational inference to a parametric optimization over the…

Dirac formalism of Hamiltonian constraint systems is studied for the noncommutative Abelian Proca field. It is shown that the system of constraints are of second class in agreement with the fact that the Proca field is not guage invariant.…

We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…

We consider a second degree algebraic curve describing a general conic constraint imposed on the motion of a massive spinless particle. The problem is trivial at classical level but becomes involved and interesting in its quantum…

We propose a general method for deformation quantization of any second-class constrained system on a symplectic manifold. The constraints determining an arbitrary constraint surface are in general defined only locally and can be components…

Many problems in operations research require that constraints be specified in the model. Determining the right constraints is a hard and laborsome task. We propose an approach to automate this process using artificial intelligence and…

Resource-constrained classification tasks are common in real-world applications such as allocating tests for disease diagnosis, hiring decisions when filling a limited number of positions, and defect detection in manufacturing settings…

This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…

Let $\text{Ch}$ be the category of (possibly unbounded) chain complexes of abelian groups. In this note we construct the standard Quillen model structure on $\text{Ch}$, by a method that is somewhat different from the standard one.…

We show that classical chaining bounds on the suprema of random processes in terms of entropy numbers can be systematically improved when the underlying set is convex: the entropy numbers need not be computed for the entire set, but only…

We considered the problem how to handle the exploding number of possibilities to be sorted into irreducible classes by using a clustering tool when its input capacity cannot accommodate the total number of the possibility. Concrete…

A method of constructing a class of bihamiltonian structures is presented. Elements of this class are generalizations of the so-called bihamiltonian structures of general position on odd-dimensional manifolds. The method consists in a…

We describe a novel classifier with a tree structure, designed using information theory concepts. This Information Network is made of information nodes, that compress the input data, and multiplexers, that connect two or more input nodes to…

Programs to solve so-called constraint problems are complex pieces of software which require many design decisions to be made more or less arbitrarily by the implementer. These decisions affect the performance of the finished solver…

We provide a simultaneous derivation of the Dirac bracket and of the equations of motion for second-class constrained systems when the constraints are time-dependent. The necessity of time-dependent gauge-fixing conditions is shown in the…

We construct solutions of the vacuum vector constraint equations on manifolds with cylindrical ends.

Constraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In the context of sequential pattern mining, a large…

Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the…

Network classification aims to group networks (or graphs) into distinct categories based on their structure. We study the connection between classification of a network and of its constituent nodes, and whether nodes from networks in…

The main result of the paper is the classification of all (nonassociative) algebras of level two, i.e. such algebras that maximal chains of nontrivial degenerations starting at them have length two. During this classification we obtain an…