65 resultados para Constraint solving


Relevância:

30.00% 30.00%

Publicador:

Resumo:

Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature subscription involves choosing and sequencing features from a catalogue and is subject to constraints that prevent undesirable feature interactions at run-time. When the subscription requested by a user is inconsistent, one problem is to find an optimal relaxation, which is a generalisation of the feedback vertex set problem on directed graphs, and thus it is an NP-hard task. We present several constraint programming formulations of the problem. We also present formulations using partial weighted maximum Boolean satisfiability and mixed integer linear programming. We study all these formulations by experimentally comparing them on a variety of randomly generated instances of the feature subscription problem.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new approach to evaluating all multiple complex roots of analytical function f(z) confined to the specified rectangular domain of complex plane has been developed and implemented in Fortran code. Generally f (z), despite being holomorphic function, does not have a closed analytical form thereby inhibiting explicit evaluation of its derivatives. The latter constraint poses a major challenge to implementation of the robust numerical algorithm. This work is at the instrumental level and provides an enabling tool for solving a broad class of eigenvalue problems and polynomial approximations.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A flexible, mass-conservative numerical technique for solving the advection-dispersion equation for miscible contaminant transport is presented. The method combines features of puff transport models from air pollution studies with features from the random walk particle method used in water resources studies, providing a deterministic time-marching algorithm which is independent of the grid Peclet number and scales from one to higher dimensions simply. The concentration field is discretised into a number of particles, each of which is treated as a point release which advects and disperses over the time interval. The dispersed puff is itself discretised into a spatial distribution of particles whose masses can be pre-calculated. Concentration within the simulation domain is then calculated from the mass distribution as an average over some small volume. Comparison with analytical solutions for a one-dimensional fixed-duration concentration pulse and for two-dimensional transport in an axisymmetric flow field indicate that the algorithm performs well. For a given level of accuracy the new method has lower computation times than the random walk particle method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

From perspective of structure synthesis, certain special geometric constraints, such as joint axes intersecting at one point or perpendicular to each other, are necessary in realizing the end-effector motion of kinematically decoupled parallel manipulators (PMs) along individual motion axes. These requirements are difficult to achieve in the actual system due to assembly errors and manufacturing tolerances. Those errors that violate the geometric constraint requirements are termed “constraint errors”. The constraint errors usually are more troublesome than other manipulator errors because the decoupled motion characteristics of the manipulator may no longer exist and the decoupled kinematic models will be rendered useless due to these constraint errors. Therefore, identification and prevention of these constraint errors in initial design and manufacturing stage are of great significance. In this article, three basic types of constraint errors are identified, and an approach to evaluate the effects of constraint errors on decoupling characteristics of PMs is proposed. This approach is illustrated by a 6-DOF PM with decoupled translation and rotation. The results show that the proposed evaluation method is effective to guide design and assembly.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a simple framework in which both the exchange rate disconnect and forward bias puzzles are simultaneously resolved. The flexible-price two-country monetary model is extended to include a consumption externality with habit persistence. Habitpersistence is modeled using Campbell Cochrane preferences with ‘deep’ habits along the lines of the work of Ravn, Schmitt-Grohe and Uribe. By deep habits, we mean habits defined over goods rather than countries. The model is simulated using the artificial economy methodology. It offers a neo-classical explanation of the Meese–Rogoff puzzle and mimics the failure of fundamentals to explain nominal exchange rates in a linear setting. Finally, the model naturally generates the negative slope in the standard forward market regression.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The article surveys the interrupted experience of devolution in Northern Ireland since 1999 and draws a number of comparisons between the first devolved Assembly and Executive and their successors elected in 2007. It underlines the significance of the changed political, electoral and paramilitary context in the period leading up to the 2007 Assembly election which, together with a number of procedural changes effected by the 2006 St Andrews Agreement, enabled the restoration of power-sharing devolution to occur. Against the background of its legislative and policy record and the wider altered state of Northern Ireland, it concludes that the contrived consociational model of governance can work, up to a point, but perhaps as much because of the politics of constraint than consociationalism's much vaunted promise to reflect and engender the politics of accommodation.