The use of automation in complex a 1 erospace systems has helped to lessen operators' workload while increasing the precision and safety of certain tasks. ¥,owever, as automation changes physical work into cognitive work, it can also lead to complacency, a loss of situation aware11ess, and the degradation of skills. Dynamic task allocation in which the allocation of tasks between the human oper...

This paper makes two contributions. First, we introduce a model for evaluating the performanceof data allocation and replication algorithms in distributed databases. The model is comprehen-sive in the sense that it accounts for I/O cost, for communication cost, and, because of reliabilityconsiderations, for limits on the minimum number of copies of the object. The model captures...

The issue of management and allocation of resources in cloud computing environments, according to the breadth of scale and modern technology implementation, is a complicated issue. Issues such as: the heterogeneity of resources, resource dependencies to each other, the dynamics of the environment, virtualization, workload diversity as well as a wide range of management objectives of cloud servi...

Many distributed protocols arising in applications in on-line load balancing and dynamic resource allocation can be modeled by dynamic allocation processes related to the \balls into bin" problems. Traditionally the main focus of the research on dynamic allocation processes is on verifying whether a given process is stable, and if so, on analyzing its behavior in the limit (i.e., after suucient...

This paper analyzes the optimal dynamic asset allocation problem in economies with infrequent events and where the investment opportunities are stochastic and predictable. Analytical approximations are obtained, with which a thorough comparative study is performed on the impacts of jumps upon the dynamic decision. The model is then calibrated to the U.S. equity market. The comparative analysis ...

In the dynamic resource allocation problem, resources have to be allocated to a set of processes whose requests vary over time. We solve this problem through the idea of views. A view of a dynamic graph is a collection of static local views, where a local view deenes the neighborhood of a process. We specify the requirements of view computation, and present algorithms for computation of views. ...

DyTR is an approach to trust that goes beyond traditional authentication-based techniques, in which the trustworthiness of entities in a system adapts over time based on system events. Using a socio-cognitive model of trust, DyTR provides an adaptive trustassessment methodology that allocates resources dynamically to an initial level of credentials, continually assesses trust, and adaptively al...

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens...

This paper develops a continuous time portfolio optimization model where the mean returns of individual securities or asset categories are explicitly affected by underlying economic factors such as dividend yields, a firm's ROE, interest rates, and unemployment rates. The factors are Gaussian processes, and the drift coefficients for the securities are aEne hnctions of these factors. We employ ...

Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed to provide these guarantees as efficiently as possible since resources are limited. This paper presents an allocation method called Dynamic Search Algorithm (DSA+). DSA+ is an on-line algorithm that dynamically adjusts the resource allo...