A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem in an "optimal" or "sufficient" sense. A formal model is presented for defining and studying such partial constraint satisfactio...

The Schrödinger equation is investigated in the Euclidean TaubNUT geometry. The bound states are degenerate and an extra degeneracy is due to the conserved Runge-Lenz vector. The existence of the extra conserved quantities, quadratic in four-velocities implies the possibility of separating variables in two different coordinate systems. The eigenvalues and the eigenvectors are given in both case...

DiCons is a dedicated language designed to be able to develop Internet applications more efficiently and with better quality. We focus on applications in the area of distributed consensus: several users strive to reach a common goal. Formal methods help to improve quality, and allow proving properties and correctness. In this paper we develop a Plotkin-style operational semantics.

in this paper, we present a full newton step feasible interior-pointmethod for circular cone optimization by using euclidean jordanalgebra. the search direction is based on the nesterov-todd scalingscheme, and only full-newton step is used at each iteration.furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.