The recent U.S.–China trade conflicts cast new light on the role of policies in global value chains (GVCs). Contrary to expectation that restrictions lead shrinking or disruption GVCs, our article posits unintended consequences (both and agreements) are amplified by prevalence organizational complexity GVCs. We anchor argument historical evolution three classic GVCs – apparel, automobiles, elec...

In this paper, we show how existing adaptive educational hypermedia systems can be enhanced by policies. In traditional systems, the adaptation is based on predefined user and domain models and fairly restricted adaptation rules. Policies allow for sophisticated and flexible adaptation rules, provided by multiple stakeholders. We present the benefits and feasibility of the approach with AHA! as...

Wireless sensor networks (WSNs) are employed in different domains and applications. The resource constraint on such networks, many times composed of hundreds to thousands of devices, and the requirement of autonomous operation become their management a challenging task. This work applies policies, a well-known approach in network management, in the core task of routing in autonomous WSNs. Polic...

In a computational grid environment, a common practice is try to allocate an entire parallel job onto a single participating site. Sometimes a parallel job, upon its submission, cannot fit in any single site due to the occupation of some resources by running jobs. How the job scheduler handles such situations is an important issue which has the potential to further improve the utilization of gr...

Most adaptive systems have compensation mechanisms for recovering from or preventing failures. However, sometimes a compensation is not essential. Hence, diagnosing and compensating each and every one of their failures may be ineffective. Rather than polluting a requirements specification with fine grained definition of failure-handling conditions, this work aims to increase the flexibility of ...

This paper describes and evaluates the Confidence-based Dual Reinforcement Q-Routing algorithm (CDRQ-Routing) for adaptive packet routing in communication networks. CDRQ-Routing is based on the Qlearning framework of Q-Routing. The main contribution of this work is the increased quantity and improved quality of exploration in CDRQ-Routing, which lead to faster adaptation and better routing poli...

We describe a framework for reasoning about adaptive systems in Open Service Architectures, a framework from which conversation policies may be defined. The goal is to exemplify how we have used conversation policies for design purposes, and how we gained from limiting the context by only considering a fixed set of actors, information models, and stages of the adaptation process.

The problem of the target localization with noise is considered. The target is a sample from a continuous random variable with known distribution and the goal is to locate this target with minimum mean squared error. The localization scheme or policy proceeds by queries, or questions, weather or not the target belongs to some subset as it is addressed in the 20-question framework. These subsets...

Due to limited buffers and highly unpredictable traffic loads, the design of effective buffer management policies that minimize cell loss is critical to ATM networks. We outline the important characteristics of optimal buffer control policies for a single node, and using a dynamic programming formulation for a simple two-node network, gain insights into the much harder general multi-node proble...