Resource utilization by earthworms affects soil C and N dynamics and further colonization of invasive earthworms. By applying 13C-labeled Tabebuia heterophylla leaves and 15N-labeled Andropogon glomeratus grass, we investigated resource utilization by three earthworm species (invasive endogeic Pontoscolex corethrurus, native anecic Estherella sp., and native endogeic Onychochaeta borincana) and...

Cloud computing providers have recently begun o‚ering container instances, which provide an ecient route to application deployment within a lightweight, isolated and well-de€ned execution environment. Cloud providers currently o‚er Container Service Platforms (CSPs), which support the ƒexible orchestration of containerised applications. Existing CSP frameworks do not o‚er any form of intellige...

Queuing network techniques are effective for evaluating the performance of computer systems. We discuss a queuing network technique for computer systems with multiple memory resource requirements. When a job arrives from outside the network, it occupies one of the memory resources and executes CPU and I/O processing in the network occupying the memory. When the job completes the CPU and I/O pro...

We study a sequential resource allocation problem between a fixed number of arms. On each iteration the algorithm distributes a resource among the arms in order to maximize the expected success rate. Allocating more of the resource to a given arm increases the probability that it succeeds, yet with a cutoff. We follow Lattimore et al. (2014) and assume that the probability increases linearly un...

M ulti-scale resource selection m odeling is used to identify factors th a t limit species distributions across scales o f space and time. This m ulti-scale nature o f hab ita t suitability com plicates the translation o f inferences to single, spatial depictions o f hab ita t required for conservation o f species. W e estim ated resource selection functions (R SFs) across three scales for a th...

We present two constraints that partition the vertices of an undirected n-vertex, m-edge graph G = (V, E) into a set of vertex-disjoint trees. The first is the resource-forest constraint, where we assume that a subset R ⊆ V of the vertices are resource vertices. The constraint specifies that each tree in the forest must contain at least one resource vertex. This is the natural undirected counte...