In this paper we investigate which constraints may be derived from a given set of constraints. We show that, given a set of relations R, all of which are invariant under some set of permutations P, it is possible to derive any other relation which is invariant under P, using only the projection, Cartesian product, and selection operators, together with the eeective domain of R, provided that th...

One measure of geometrical complexity of a spatial curve is the average of the number of crossings appearing in its planar projection. The mean number of crossings averaged over some directions have been numerically evaluated for N-noded ring polymers with a fixed knot type. When N is large, the average crossing number of ring polymers under the topological constraint is smaller than that of no...

Powerful consistency techniques, such as AC* and FDAC*, have been developed for Weighted Constraint Satisfaction Problems (WCSPs) to reduce the space in solution search, but are restricted to only unary and binary constraints. On the other hand, van Hoeve et al. developed efficient graph-based algorithms for handling soft constraints as classical constraint optimization problems. We prove that ...

An estimator design problem is considered which involves both L 2 (least squares) and H ~ (worst-case frequency-domain) aspects. Specifically, the goal of the problem is to minimize an L 2 state-estimation error criterion subject to a prespecified H a constraint on the state-estimation error. The H ~ estimation-error constraint is embedded within the optimization process by replacing the covari...

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Linear Project Second Order-Cone Programme Zhenhua Li, Wenling Zhao *1,2 School of Science,Shandong University of Technology, Zibo,255091,China [email protected] Abstract In recent years cone constraint optimization problems has been favored by scholars, especially for the second-order cone constraints programming problem,the...

Motivated by a recent paper of Louko and Molgado, we consider a simple system with a single classical constraint R(q) = 0. If ql denotes a generic solution to R(q) = 0, our examples include cases where R(ql) 6= 0 (regular constraint) and R(ql) = 0 (irregular constraint) of varying order as well as the case where R(q) = 0 for an interval, such as a ≤ q ≤ b. Quantization of irregular constraints ...

We study multidimensional quadrilateral lattices satisfying simultaneously two inte-grable constraints: a quadratic constraint and the projective Moutard constraint. When the lattice is two dimensional and the quadric under consideration is the Möbius sphere one obtains, after the stereographic projection, the discrete isothermic surfaces defined by Bobenko and Pinkall by an algebraic constrain...

Surrogate reasoning is reasoning whose task is partially taken over by operations on external aids, such as sentences, diagrams, physical models, mathematical models, and computers. Drawing on the basic concepts in situation theory, we present a semi-formal model of surrogate reasoning. We claim that the relative advantages and disadvantages of different forms of surrogate reasoning can be expl...

We study multidimensional quadrilateral lattices satisfying simultaneously two inte-grable constraints: a quadratic constraint and the projective Moutard constraint. When the lattice is two dimensional and the quadric under consideration is the Möbius sphere one obtains, after the stereographic projection, the discrete isothermic surfaces defined by Bobenko and Pinkall by an algebraic constrain...

Human pose recognition algorithm for monocular video was proposed to model human part parameters using video features combination with 3D motion capture data. Firstly Constant Part Appearance (CPA) Models and threedimensional motion data projection constraint graph structure was defined. To simplify the reasoning process, a constraint graph of the spanning tree construction algorithm and the ba...