background: cervical spine sustains most of thevertebral column injuries, among other injuries, the disc degeneration and damage that lead to replacement of the damaged disc with cage or artificial disc. methods: the c4 to c6 vertebrae of a normal subject and a person with interbody fusion cage were 3d modelled and then analyzed using finite element method. the results of maximum stress and str...

This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a chain of lexicographic ordering constraint within a generic geometric constraint kernel, the four latter ...

Constraint satisfaction has been the subject of many studies. Different areas of research have tried to solve all kind of constraint problems. Here we will look at a general model for constraint satisfaction problems in the form of binary constraint satisfaction. The problems generated from this model are studied in the research area of constraint programming and in the research area of evoluti...

A new language, called constraint CNF, is proposed. It integrates propositional logic with constraints stemming from constraint programming. A family of algorithms is designed to solve problems expressed in constraint CNF. These algorithms build on techniques from both propositional satisfiability and constraint programming. The result is a uniform language and an algorithmic framework, which a...

In this work we study the variational inequality problem in finite dimensional spaces. The constraint set we consider has the structure of semi-infinite programming. Standard convergence analysis for outer approximation methods includes boundedness of the constraint set, or, alternatively, coerciveness of the data. Using recession tools, we are able to replace these assumptions by the hypothese...

The per-sample zero-dispersion channel model of the optical fiber is considered. It shown that capacity uniquely achieved by an input probability distribution has continuous uniform phase and discrete amplitude takes on finitely many values. This result holds when subject to general cost constraints, include a peak constraint joint average constraint.

We consider the problem of minimizing a convex separable logarithmic function over a region defined by a convex inequality constraint or linear equality constraint, and twosided bounds on the variables (box constraints). Such problems are interesting from both theoretical and practical point of view because they arise in somemathematical programming problems as well as in various practical prob...