Search results for "CONSTRAINT"

On embedding Boolean as a subtype of integer

1990

Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems

1997

In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.

Extended constrained deformations: a new sculpturing tool

1999

Modelling tools tend to virtual sculpturing, in which a basic object is deformed by user supplied actions. The model we present aims to be generic: whatever the geometric description of the object, we can deform it to satisfy location constraints. Our model deforms the whole space, the image of a point is a blend of deformation functions with a projection matrix which allows the satisfaction of the constraints. The user can define the extent of the deformation (i.e. the part of the object to be deformed), the shape of the deformation function to create profiles and the displacement of the constraint points to be satisfied.

Group Nonnegative Matrix Factorization with Sparse Regularization in Multi-set Data

2021

Constrained joint analysis of data from multiple sources has received widespread attention for that it allows us to explore potential connections and extract meaningful hidden components. In this paper, we formulate a flexible joint source separation model termed as group nonnegative matrix factorization with sparse regularization (GNMF-SR), which aims to jointly analyze the partially coupled multi-set data. In the GNMF-SR model, common and individual patterns of particular underlying factors can be extracted simultaneously with imposing nonnegative constraint and sparse penalty. Alternating optimization and alternating direction method of multipliers (ADMM) are combined to solve the GNMF-S…

LCL - A Graphical Meta-Language for Specification of Language Constraints

2015

The Object Constraint Language (OCL) is commonly used for constraints in meta-model-based language specifications. However, it may be advantageous to have a domain-specific constraint meta-language optimised for language specifications. A survey of OCL usage in language specifications has been performed, in order to gain an understanding of common constraint patterns. This is used as a starting point for defining a new meta-language for language constraints, Language Constraint Language (LCL), that has an intuitive graphical syntax.

Energy-Efficient Binary Power Control with Bit Error Rate Constraint in MIMO-OFDM Wireless Communication Systems

2012

Motivated by the demand for energy efficiency improvement in mobile communication industry, we explore an idea of optimizing energy efficiency for MIMO-OFDM wireless communication systems while maintaining users' quality of service (QoS) requirement. Based on the binary power control scheme,a power allocation criterion for energy efficiency optimization is derived under the total power constraint. From a bit error rate (BER) point of view, a protection constraint is configured to guarantee the system QoS. With the aim of energy efficiency optimization under QoS guarantee in MIMO-OFDM wireless communication systems, an energy-efficient binary power control with BER constraint (EBPCB) algorith…

A Metamodeling Approach to Evolution

2001

With the increasing complexity of systems being modeled, analysis & design move towards more and more abstract methodologies. Most of them rely on metamodeling tools that employ multi-view models and the four-layer metamodeling architecture. Our idea is to use the metamodeling approach to classify and to constraint the possible evolutions of an information system with the effect to improve both detection of evolution conflicts and disciplined reuse. Within the domain of UML metamodeling, a refinement of the metamodel-level classification is proposed that includes bases for defining a metric of the evolution (in terms of distance between metamodels).

Reptation and constraint release

1991

Abstract The reptation and constraint release models are discussed by considering three recent experimental examples: (1) the diffusion of hydrogenated polybutadiene in matrices of molecular weights raning between 1 ⩽ Mw / Me ⩽ 253; (2) the diffusion of polystyrene (PS) chains in matrices of star branched PS; (3) the diffusion of very long PS chains in chemically cross-linked PS-networks. It is concluded that the reptation and constraint release models are applicable, but ‘constraint release’ should be understood in a wider sense allowing for non-reptative removal of barriers to lateral chain motion. The analysis of the third example proves that lateral modes of motion have a negligible inf…

Chebyshev’s Method on Projective Fluids

2020

We demonstrate the acceleration potential of the Chebyshev semi-iterative approach for fluid simulations in Projective Dynamics. The Chebyshev approach has been successfully tested for deformable bodies, where the dynamical system behaves relatively linearly, even though Projective Dynamics, in general, is fundamentally nonlinear. The results for more complex constraints, like fluids, with a particular nonlinear dynamical system, remained unknown so far. We follow a method describing particle-based fluids in Projective Dynamics while replacing the Conjugate Gradient solver with Chebyshev’s method. Our results show that Chebyshev’s method can be successfully applied to fluids and potentially…

Numerical decomposition of geometric constraints

2005

Geometric constraint solving is a key issue in CAD/CAM. Since Owen's seminal paper, solvers typically use graph based decomposition methods. However, these methods become difficult to implement in 3D and are misled by geometric theorems. We extend the Numerical Probabilistic Method (NPM), well known in rigidity theory, to more general kinds of constraints and show that NPM can also decompose a system into rigid subsystems. Classical NPM studies the structure of the Jacobian at a random (or generic) configuration. The variant we are proposing does not consider a random configuration, but a configuration similar to the unknown one. Similar means the configuration fulfills the same set of inci…