Storage Resource Managers (SRMs) are middleware components whose function is to provide dynamic space allocation and file management of shared storage components on the Grid. They complement Compute Resource Managers and Network Resource Managers in providing storage reservation and dynamic information on storage availability for the planning and execution of a Grid job. SRMs manage two types o...

Supervisory control for deadlock-free resource allocation has been an active area of manufacturing systems research. Most work, however, assumes that allocated resources do not fail. Little research has addressed allocating resources that may fail. Automated manufacturing systems have many types of components that may fail unexpectedly. We develop robust controllers for single unit resource all...

To understand the evolution of diverse species, theoretical studies using a Lotka-Volterra type direct competition model had shown that concentrated distributions of species in continuous trait space often occurs. However, a more mechanistic approach is preferred because the competitive interaction of species usually occurs not directly but through competition for resource. We consider a chemos...

Whether animals live in groups can be influenced by numerous direct benefits, such as cooperative hunting, predator avoidance or alloparental care, as well as by direct disadvantages, such as elevated parasite burdens or infanticide risk [1]. Here, we focus instead on an alternative factor, namely, how the availability of RESOURCES (see Glossary) in the environment influences grouping behavior....

Whether animals live in groups can be influenced by numerous direct benefits, such as cooperative hunting, predator avoidance or alloparental care, as well as by direct disadvantages, such as elevated parasite burdens or infanticide risk [1]. Here, we focus instead on an alternative factor, namely, how the availability of RESOURCES (see Glossary) in the environment influences grouping behavior....

We present an improved simulation of space and reversal bounded Turing machines by width and depth bounded uniform circuits. (All resource bounds hold simultaneously.) An S(n) space, R(n) reversal bounded deterministic k-tape Turing machine can be simulated by a uniform circuit of O(R(n) log2S(n)) depth and O(S(n) k) width. Our proof is cleaner, and has slightly better resource bounds than the ...

In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. This analysis has been successfully applied to many standard algorithms but is limited to bounds that are linear in the size of the input. Here we extend this system to polynomial resource bounds. An automatic amortiz...

Future human space exploration will require large amounts of resources for shielding and building materials, propellants, and consumables. A space-based resource economy could produce, transport, and store resource at distributed locations such as the lunar surface, stable orbits, or Lagrange points to avoid Earth‟s deep gravity well. Design challenges include decentralized operation and manage...