‎in this paper, using the idea of convexificators, we study boundedness and nonemptiness of lagrange multipliers satisfying the first order necessary conditions. we consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. within this context, define generalized mangasarian-fromovitz constraint qualification and show t...

In this paper, we propose a new full-fuzzy video ratecontrol algorithm (RCA) for variable bit rate (VBR) videoapplications. The proposed RCA provides high qualitycompressed video with a low degree computational complexity.By controlling the quantization parameter (QP) on a picturebasis, it produces VBR video bit streams. The proposed RCAhas been implemented on the JM H.264/AVC video codec andth...

When developing large information systems, several forms of data quality checks and controls have to be specified. However, today’s object databases only provide very limited support for constraint definition, which causes software engineers to implement data quality controls such as consistency checks and exception handling in the application code. Given that it is common for several applicati...

We present an extension of the Soft Concurrent Constraint language that allows the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: retract(c) reduces the current store by c, updateX(c) transactionally relaxes all the constraints of the store that deal with the variables in the set X, and then adds a constraint c; nask(c) tests if c is not en...

Specifications are key to improving software reliability as well as documenting precisely the intended behavior of software. Writing specifications is still perceived as expensive. Of course, writing implementations is at least as expensive, but is hardly questioned because there is currently no real alternative. Our goal is to give specifications a more balanced role compared to implementation...

Web services have emerged as a popular technology for integrating distributed applications. A Web service composition is a description of how different Web services can interoperate in order to perform more complex tasks. QoS for composite Web services has attracted interests from both research and industrial communities. In this paper, we propose an agent-based solution for the QoS composition...

This paper presents a generic anytime forward-search constraint-based algorithm for solving planning problems expressed in the CNT framework (Constraint Network on Timelines). It is generic because it allows many kinds of search to be covered, from complete tree search to greedy search. It is anytime because some parameter settings, together with domain-specific knowledge, allow high quality pl...

In recent years, new software architectures have been developed in which components can be bound and unbound dynamically as the context demands. This capacity to dynamically adapt the software’s structure, behaviour and quality of service should make resilience easier to achieve by allowing systems to respond more flexibly to changing environmental contexts. However, because the decision of how...