High-quality services must keep working reliably and efficiently, and service compositions are no exception. As they integrate several internal and external services over the network, they need to be carefully designe...
详细信息
High-quality services must keep working reliably and efficiently, and service compositions are no exception. As they integrate several internal and external services over the network, they need to be carefully designed to meet their performance requirements. Current approaches assist developers in estimating whether the selected services can fulfill those requirements. However, they do not help developers define requirements for services lacking performance constraints and historical data. Manually estimating these constraints is a time-consuming process which might underestimate or overestimate the required performance, incurring in additional costs. This work presents the first version of two algorithms which infer the missing performance constraints from a service composition model. The algorithms are designed to spread equally the load across the composition according to the probability and frequency each service is invoked, and to check the consistency of the performance constraints of each service with those of the composition.
In this paper, we present a theoretical foundation for querying inductive databases, which can accommodate disparate mining tasks. We present a data mining algebra including some essential operations for manipulating ...
详细信息
Mobile collaborative learning is considered the next step of on-line collaborative learning by incorporating mobility as a key and breakthrough requirement. Indeed, the current wide spread of mobile devices and wirele...
详细信息
A number of techniques have been proposed for state-based testing. One well-known technique (criterion) is to traverse the graph representing the state machine and generate a so-called transition tree, in an attempt t...
详细信息
A number of techniques have been proposed for state-based testing. One well-known technique (criterion) is to traverse the graph representing the state machine and generate a so-called transition tree, in an attempt to exercise round trip paths, i.e., paths that start and end in the same state without any other repeating state. Several hypotheses are made when one uses this criterion: exercising paths in the tree, which do not always trigger complete round trip paths, is equivalent to covering round-trip paths; different traversal algorithms are equivalent. In this paper we investigate whether these assumptions hold in practice, and if they do not, we investigate their consequences. Results also lead us to propose a new transition tree construction algorithm that results in higher efficiency and lower cost.
Testing-as-a-service (TaaS) is a new model to provide testing capabilities to end users. Users save the cost of complicated maintenance and upgrade effort, and service providers can upgrade their services without impa...
详细信息
The International Workshop on the Web and Requirements engineering (WeRE) was held in conjunction with the 18 th International IEEE Requirements engineering Conference (RE'10) in Sydney (Australia) on September 2...
The International Workshop on the Web and Requirements engineering (WeRE) was held in conjunction with the 18 th International IEEE Requirements engineering Conference (RE'10) in Sydney (Australia) on September 28 2010. WeRE intends to be an international forum for exchanging ideas on both using Web technologies as a platform in the requirements engineering field, and applying requirements engineering in the development and use of websites. Papers focused on new domains and new experiences with the connection between requirements engineering and the Web were presented in WeRE.
Semantic Web service discovery and Semantic Web service composition can be considered as complementary techniques. Overcoming both those obstacles is the key to automatic generation of executable Semantic Web services...
详细信息
ISBN:
(纸本)9781424467280;9780769540221
Semantic Web service discovery and Semantic Web service composition can be considered as complementary techniques. Overcoming both those obstacles is the key to automatic generation of executable Semantic Web services process. In this paper, we propose a translator to realize the AIMO framework which is based on an AI-planning based approach called HTN-DL and Web Service Modeling Ontology (WSMO) that provides Semantic Web service discovery and composition. The AIMO Translator consists of four algorithms to translate each WSMO elements into corresponding elements of HTN-DL. Moreover, the proposed translator has been implemented and tested and the result shows that the AIMO Translator is performed and usable.
Sensors are emerging devices on a world leading to ubiquity and pervasiveness. For the sake of users' convenience, the organization of these sensors in operational networks must be done in an autonomic and self-su...
详细信息
Sensors are emerging devices on a world leading to ubiquity and pervasiveness. For the sake of users' convenience, the organization of these sensors in operational networks must be done in an autonomic and self-sustained way. This paper proposes BiO4SeL (Bio-Inspired Optimization for Sensor Network Lifetime), a biologically-inspired routing algorithm for sensor networks where the main goal is autonomy, while aiming to optimize the sensor networks' lifetime, i.e., the maximization of the full coverage duration. BiO4SeL is based on Swarm Intelligence, more specifically on Ant Colonies. Results show that BiO4SeL achieves its objectives when compared with similar approaches: ARAMA (Ant-based Routing Algorithm for Manets) and AODV (Ad-hoc On-demand Distance Vector).
Hot trace building plays an important role in enhancing the performance of dynamic binary translators, since in most cases 10% of code takes 90% of execution time of the whole program. Hot traces can promote the code ...
详细信息
暂无评论