Mobile application developers should be able to specify how applications can adapt to changing conditions, and to later reconfigure the application to suit new circumstances. Event-based communication have been advocated to facilitate such dynamic changes. Event-based models, however, are fragmented, which makes it difficult to understand the dependencies between components. A process-oriented methodology overcomes this issue, by specifying dependencies according to a process model. This paper describes a methodology that combines the comprehensibility and manageability of control from process-oriented methodologies, with the flexibility of event-based communication. This enables fine-grained adaptation of process-oriented applications.

Developing effective and efficient negotiation mechanisms for real-world applications such as e-business is challenging because negotiations in such a context are characterized by combinatorially complex negotiation spaces, tough deadlines, very limited information about the opponents, and volatile negotiator preferences. Accordingly, practical negotiation systems should be empowered by effective learning mechanisms to acquire dynamic domain knowledge from the possibly changing negotiation contexts. This article illustrates our adaptive negotiation agents, which are underpinned by robust evolutionary learning mechanisms to deal with complex and dynamic negotiation contexts. Our experimental results show that GA-based adaptive negotiation agents outperform a theoretically optimal negotiation mechanism that guarantees Pareto optimal. Our research work opens the door to the development of practical negotiation systems for real-world applications. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 41–72, 2006.

There are many ways of achieving scalable dynamic web content. In previous work we have focused on dynamic content degradation using a standard architecture and a design-time "Just In Case" methodology. In this paper, we address certain shortcomings witnessed in our previous work by using an alternate coordination-based architecture, which has interesting applicability to run-time web server adaptation. We first establish the viability of using this architecture for high-volume dynamic web content generation. In doing so, we establish its ability to maintain high throughput in overload conditions. We go on to show how we used the architecture to achieve a "Just In Time" adaptation to achieve dynamic web content degradation in a running web application server.

A process-oriented composite application aggregates functionality from a number of other applications and coordinates these applications according to a process model. Traditional approaches to develop process-oriented composite application rely on statically defined process models that are deployed into a process management engine. This approach has the advantage that application designers and users can comprehend the dependencies between the applications involved in the composition by referring to the process model. A major disadvantage however is that once deployed the behaviour of every execution of the composite application is expected to abide by its process model until this model is changed and re-deployed. This makes it difficult to enrich the application with even minor features, to plug-in new applications into the composition, or to hot-fix the composite application to meet special circumstances or demands (e.g. to personalise the application). This paper describes a technique for translating a process-oriented application into an event-based application which is more amenable to such runtime adaptation. The process-based and event-based views of the application can then co-exist and be synchronised offline if the changes become permanent and it is found desirable to reflect them in the process model.

Mobile devices have received much research interest in recent years. Mobility raises new issues such as more dynamic context, limited computing resources, and frequent disconnections. A middleware infrastructure for mobile computing must handle all these issues properly. In this project we propose a middleware, called 3DMA, to support mobile computing. We introduce three requirements, distribution, decoupling and decomposition as central issues for mobile middleware. 3DMA uses a space based middleware, which facilitates the implementation of decoupled behavior and support for disconnected operation and context awareness. This is done by defining a set of “workers” which are able to act on the users behalf either: to reduce load on the mobile device, and/or to support disconnected behavior. In order to demonstrate aspects of the middleware architecture we then consider the development of a commonly used mobile application.

When a new electronic service is composed from existing ones, the characteristics of the component services will naturally have a major influence on both the functional and the non-functional characteristics of the composite service. When more than one service satisfies the specified functional requirements of a given component for a composite service, these services can be differentiated on the basis of their non-functional properties. To ensure proper evaluation of various composition options, we propose to estimate the corresponding non-functional properties of a composite service during design time by taking into account the characteristics of the candidate services and the composition constructs used to integrate these services. In this paper, we describe the specification and estimation of the invocation cost based on different pricing models and the composition constructs possible in the workflow patterns for composite services.

Research in mobile devices have received extensive interest in recent years. Mobility raises new issues such as more dynamic context, limited computing resources, and frequent disconnections. To handle these issues, we propose a middleware, called 3DMA, which addresses three requirements: 1) decomposition, 2) distribution and 3) decoupling. 3DMA uses a space based approach combined with a set of "workers" which are able to act on the users behalf either to reduce load on the mobile device, or to support disconnected behavior. In order to demonstrate aspects of the middleware architecture we consider the development of a mobile application.

Dynamic Web content is increasing in popularity and, by its nature, is harder to scale than static content. As a result, dynamic Web content delivery degrades more rapidly than static content under similar client request rates. Many techniques have been explored for effectively handling heavy Web request traffic. In this paper, we concentrate on dynamic content degradation, believing that it offers a good balance between minimising total cost of ownership and maximising scalability. We describe an algorithm for dynamic content degradation that is easily implemented on top of existing mainstream Web application architectures. The algorithm is based on measuring the elapsed time of content generation. We demonstrate the algorithm’s adaptability against two traffic request patterns, and explore behavioural changes when varying the algorithm’s key parameters. We find our elapsed time based algorithm is better at recognising when the server is unloaded, that the supporting architecture limits the effectiveness of the algorithm and and that the algorithm must be configured pessimistically for best results under load.

Web service deployment is hampered by the possibility of sudden variations in request volumes. Mechanisms exist to enhance scalability in times of heavy load when the delivered content is static. However, web services typically involve dynamic content, delivered through application servers which may have little to no support for adapting to varying loads in order to ensure timely delivery. In this paper we discuss why scaling dynamic content delivery under load is difficult, we present a technique for controlled service degradation to achieve this scalability, and we present experimental results evaluating its benefits.

The rapid growth of information networks motivates the need for the development of technologies to assist in finding and understanding the set of information elements relevant to a task in large scale multidatabase networks. The research reported in this paper suggests the use of a logical model to facilitate pro-active elicitation of schema information from multiple heterogeneous information sources. This is accomplished by providing a consistent, logically organized view of information across multiple discrete heterogeneous sources. The model dynamically clusters databases in a logical space, so that the elements within a cluster have a high degree of semantic correlation. Once a database cluster is formed, we need only search a relatively small coherent areas to find relevant information, rather than the entire space of database schemas. The elicitation process is guided by a combination of lexical, structural and semantic aspects of schema items in order to capture more meaning both about the contents of a requested information item and about its placement within a given information context. Since communications target specific database clusters scalability is enhanced, searches are accelerated, and interactions in a large collection of databases becomes tractable.

In many large organizations there has been a proliferation of database systems to handle ever increasing volumes of information. In order to explore a potentially huge on-line information space, we must develop an architecture which allows for the dynamic data driven construction of inter-database node relationships in an incremental manner. In this paper we introduce the FINDIT architecture which uses informationmeta-types to provide a basis for such an organization and, consequently, provides a platform for interoperability. A distinction is made between theinformation andinter-node relationship spaces to achieve scalability. Tassili language primitives are used for the incremental building of dynamic inter-node relationships based upon usage considerations.

The evolution of heterogeneous and autonomous databases research has been slow compared to other areas of research. Part of the problem resides in the fact that bridging data semantics has been a difficult problem. Sharing data among disparate databases has mostly been achieved through some form of manual schema integration. The complexity of making autonomous heterogeneous databases smoothly interoperate is dependent on addressing two major issues. The first issue to address is what adequate levels of autonomy databases are guaranteed to keep, The second issue to address is what overhead cost is required to bridge database heterogeneity. The complexity of these two issues are closely dependent on how scalable multidatabase systems are. In this paper we introduce the FINDIT architecture which uses information meta-types to provide a basis for such an organization and, consequently, provides a platform For interoperability A distinction is made between the information and inter-node relationship spaces to achieve scalability. Tassili language primitives are used for the incremental building of dynamic inter-node relationships based upon usage considerations.