In this work we address the optimizing control allocation problem for a nonlinear over-actuated time-varying system where parameters af ne in the dynamic actuator and effector model may be assumed unknown. In-stead of nding the optimal control allocation at each time instant, a dynamic approach is considered by constructing update-laws that represent asymptotically optimal allocation search and...

Current WCET analyses do not support dynamic memory allocation. This is mainly due to the unpredictability of the cache performance if standard memory allocators are used. We present a novel dynamic memory allocator that makes cache performance predictable and (de)allocates memory in constant time. It thereby enables WCET analysis in the presence of dynamic memory allocation.

Internet data centers host multiple Web applications on shared hardware resources. These data centers are typically provisioned to meet the expected peak demands of the hosted applications based on normal time-of-day effects. Such an over-provisioning approach is not robust to flash crowd scenarios, where the load increase of some hosted applications is much higher than their expected peak load...

This work addresses the control allocation problem for a nonlinear over-actuated time-varying system where parameters a¢ ne in the actuator dynamics and actuator force model may be assumed unknown. Instead of optimizing the control allocation at each time instant, a dynamic approach is considered by constructing update-laws that represent asymptotically optimal allocation search and adaptation....

A possible route to managing workload peaks facilitated by advances in technology is to use Dynamic Function Allocation, in other words to design work so that it is possible to switch adaptively between levels of automation. In the main, current approaches to Dynamic Function Allocation assume that functions are to be serviced as soon as possible, and in order of arrival. These methods utilise ...

In this work, we investigate the performance of distributed admission control with QoS provisioning and dynamical channel allocation for mobile/wireless networks, where co-channel reuse distance is considered as the only limiting factor to channel sharing. We first provide a QoS metric feasible for admission control with dynamically allocated channels. We then derive a criterion analytically us...

Emergency resource is important for people evacuation and property rescue when accident occurs. The relief efforts could be promoted by a reasonable emergency resource allocation schedule in advance. As the marine environment is complicated and changeful, the place, type, severity of maritime accident is uncertain and stochastic, bringing about dynamic demand of emergency resource. Considering ...

Power conservation and extending survival time are critical issues in mobile ad hoc networks, as the nodes are powered by battery only. In this paper, according to the mobility of nodes, the survival-time-based adaptive replica allocation algorithm is proposed. In the survival-time-based dynamic adaptive replica allocation algorithm, based on the locality of data access, the replica allocation ...

Future platforms are envisioned in which human-machine teams are able to share and trade tasks as demands in situations change. It seems that human-machine coordination has not received the attention it deserves by past and present approaches to task allocation. In this paper a simple way to make coordination requirements explicit is proposed and for dynamic task allocation a dual-route approac...

The coordination of dynamic task allocation based on available resources is very challenging in disaster domains under time, space and communication constraints. In addition, it is also very hard or even impossible to achieve tasks allocation by using a centralised manner with the global knowledge of the working environment. This paper presents a novel decentralised coordination approach for dy...