scholarly journals IMPROVING THE AUTOMATIC PROCUREMENT OF WEB SERVICES USING CONSTRAINT PROGRAMMING

2005 ◽  
Vol 14 (04) ◽  
pp. 439-467 ◽  
Author(s):  
ANTONIO RUIZ–CORTÉS ◽  
OCTAVIO MARTÍN–DÍAZ ◽  
AMADOR DURÁN ◽  
M. TORO
Keyword(s):  
Web Services ◽  
Internal Consistency ◽  
Constraint Programming ◽  
Experimental Results ◽  
Objective Functions ◽  
Run Time ◽  
Linear Objective Functions ◽  
Best Offer

Software solutions to automate the procurement of web services are gaining importance when technology evolves, the number of providers increases and the needs of the clients become more complex. There are several proposals in this field, but they all have important drawbacks, namely: many of them are not able to check offers and demands for internal consistency; selecting the best offer usually relies on evaluating linear objective functions, which is quite a naive solution; the language to express offers is usually less expressive than the language to express demands; and, last but not least, providers cannot impose constraints on their clients. In this article, we present a solution to overcome these problems that relies on constraint programming; furthermore, we present a run-time framework, some experimental results, and a comparison with other proposals.

Compiler-Aided Run-Time Performance Speed-Up in Super-Scalar Processor

10.28945/3391 ◽  
2009 ◽  
Author(s):  
Moshe Pelleh
Keyword(s):  
Embedded Systems ◽  
Embedded System ◽  
General Purpose ◽  
Experimental Results ◽  
Medium Size ◽  
Organic System ◽  
Software Application ◽  
Organic Systems ◽  
Special Cases ◽  
Run Time

In our world, where most systems become embedded systems, the approach of designing embedded systems is still frequently similar to the approach of designing organic systems (or not embedded systems). An organic system, like a personal computer or a work station, must be able to run any task submitted to it at any time (with certain constrains depending on the machine). Consequently, it must have a sophisticated general purpose Operating System (OS) to schedule, dispatch, maintain and monitor the tasks and assist them in special cases (particularly communication and synchronization between them and with external devices). These OSs require an overhead on the memory, on the cache and on the run time. Moreover, generally they are task oriented rather than machine oriented; therefore the processor's throughput is penalized. On the other hand, an embedded system, like an Anti-lock Braking System (ABS), executes always the same software application. Frequently it is a small or medium size system, or made up of several such systems. Many small or medium size embedded systems, with limited number of tasks, can be scheduled by our proposed hardware architecture, based on the Motorola 500MHz MPC7410 processor, enhancing its throughput and avoiding the software OS overhead, complexity, maintenance and price. Encouraged by our experimental results, we shall develop a compiler to assist our method. In the meantime we will present here our proposal and the experimental results.

scholarly journals Measuring the technical efficiency of local banks in UAE using rough bi-level linear programming technique

2015 ◽  
Vol 1 (1) ◽  
pp. 26
Author(s):  
Doaa Wafik ◽  
O. E. Emam
Keyword(s):  
Decision Making ◽  
Linear Programming ◽  
Technical Efficiency ◽  
Auxiliary Problem ◽  
Optimal Solution ◽  
Objective Functions ◽  
Programming Technique ◽  
Decision Making Problem ◽  
Linear Objective Functions ◽  
Linear Programming Technique

The aim of this paper is to use a bi-level linear programming technique with rough parameters in the constraints, for measuring the technical efficiency of local banks in UAE and Egypt, while the proposed linear objective functions will be maximized for different goals. Based on Dauer's and Krueger's goal programmingmethod, the described approach was developed to deal with the bi-level decision-making problem. The concept of tolerance membership function together was used to generate the optimal solution for the problem under investigation. Also an auxiliary problem is discussed to illustrate the functionality of the proposed approach.

Multi-Vehicle Missions

2008 ◽  
pp. 1-22
Author(s):  
Johan Baltié ◽  
Eric Bensana ◽  
Patrick Fabiani ◽  
Jean-Loup Farges ◽  
Stéphane Millet ◽  
...  
Keyword(s):  
Artificial Intelligence ◽  
Constraint Programming ◽  
Management System ◽  
Experimental Results ◽  
Application Domain ◽  
Research Directions ◽  
Air Defense ◽  
Mission Management ◽  
Unmanned Combat Air Vehicles ◽  
Air Vehicles

This chapter deals with the issues associated with the autonomy of vehicle fleets, as well as some of the dimensions provided by an Artificial Intelligence (AI) solution. This presentation is developed using the example of a suppression of enemy air defense mission carried out by a group of Unmanned Combat Air Vehicles (UCAV). The environment of the Mission Management System (MMS) includes the theatre of operations, vehicle sub-systems and the MMS of other UCAV. An MMS architecture, organized around a database, including reactive and deliberative layers is described in detail. The deliberative layer includes a distributed mission planner developed using constraint programming and an agent framework. Experimental results demonstrate that the MMS is able, in a bounded time, to carry out missions, to activate the contingent behaviors, to decide whether to plan or not. Some research directions remain open in this application domain of AI.

Enhancing UML Models

2009 ◽  
pp. 1581-1602
Author(s):  
Iris Reinhartz-Berger ◽  
Arnon Sturm
Keyword(s):  
Internal Consistency ◽  
Domain Analysis ◽  
Domain Model ◽  
Experimental Results ◽  
Modeling Language ◽  
Modeling Languages ◽  
Domain Modeling ◽  
System Requirements ◽  
Uml Models

UML has been largely adopted as a standard modeling language. The emergence of UML from different modeling languages that refer to various system aspects causes a wide variety of completeness and correctness problems in UML models. Several methods have been proposed for dealing with correctness issues, mainly providing internal consistency rules but ignoring correctness and completeness with respect to the system requirements and the domain constraints. In this article, we propose addressing both completeness and correctness problems of UML models by adopting a domain analysis approach called application-based domain modeling (ADOM). We present experimental results from our study which checks the quality of application models when utilizing ADOM on UML. The results advocate that the availability of the domain model helps achieve more complete models without reducing the comprehension of these models.

Sign in / Sign up

Export Citation Format

Share Document