Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. In this paper, we extend the principle of symmetry to dominance in Not-Equals Constraint Networks and show how dominated values are detected and eliminated at each node of the search tree. A Linear time complexity algor...

where f : Rn → R and g : Rn → Rp are nonlinear continuous functions and Ω = {x ∈ Rn : −∞ < l ≤ x ≤ u < ∞}. Problems with equality constraints, h(x) = 0, can be reformulated into the above form by converting into a couple of inequality constraints h(x)− β ≤ 0 and −h(x)− β ≤ 0, where β is a small positive relaxation parameter. Since we do not assume that the objective function f is convex, the pr...

We describe new techniques to allow constraint driven design using spatial augmented reality (SAR), using projectors to animate a physical prop. The goal is to bring the designer into the visual working space, interacting directly with a dynamic design, allowing for intuitive interactions, while gaining access to affordance through the use of physical objects. We address the current industrial ...

designing and producing a proper fusion construction is the most important problem of producing large quantities of a properly folded functional protein. this construction should have all necessary components of a real gene. a good designed fusion gene construction could be cloned into a good and suitable host. clostridium perfringens is an important pathogen of humans and livestock and produce...

The design structure matrix (DSM) and its formal counterpart, the augmented constraint network (ACN), have been used to explicitly model software design decisions, design rules and the resulting modular structure. To address the difficulty of modeling software design in terms of decisions, we formally define the decisions and their assumption relations embedded within UML class diagrams and aut...

The use of random samples to approximate properties of geometric configurations has been an influential idea for both combinatorial and algorithmic purposes. This chapter considers two related notions—ǫ-approximations and ǫ-nets—that capture the most important quantitative properties that one would expect from a random sample with respect to an underlying geometric configuration. An example pro...

Regularized and stabilized sequential quadratic programming methods are two classes of sequential quadratic programming (SQP) methods designed to resolve the numerical and theoretical difficulties associated with ill-posed or degenerate nonlinear optimization problems. Recently, a regularized SQP method has been proposed that provides a strong connection between augmented Lagrangian methods and...

We present a new particle tracking algorithm for accurately resolving large deformation and rotational motion fields, which takes advantage of both local global algorithms. call this method ScalE Rotation Invariant Augmented Lagrangian Particle Tracking (SerialTrack). This builds an iterative scale rotation invariant topology-based feature vector each within multi-scale algorithm. The kinematic...

We give a $(1+\epsilon)$-approximate distance oracle with $O(1)$ query time for an undirected planar graph $G$ with $n$ vertices and non-negative edge lengths. For $\epsilon>0$ and any two vertices $u$ and $v$ in $G$, our oracle gives a distance $\tilde{d}(u,v)$ with stretch $(1+\epsilon)$ in $O(1)$ time. The oracle has size $O(n\log n ((\log n)/\epsilon+f(\epsilon)))$ and pre-processing time $...

In this study, the performance of the modified subgradient algorithm (MSG) to solve the 0-1 quadratic knapsack problem (QKP) is examined. The MSG is proposed by Gasimov for solving dual problems constructed with respect to sharp Augmented Lagrangian function. The MSG has some important proven properties. For example, it is convergent, and it guarantees the zero duality gap for the problems such...