We study competition and cooperation among a group of storage units. We show that as the number of storages increases, the profit of storages approaches zero under Nash competition. We propose two ways in which storages can achieve non-zero profit and show that they are optimal in the sense that storages achieve the maximum possible profit. The first is a decentralized approach in which storage...

A mail survey of 1,200 farms across 16 states was conducted to identify the number, type, and size of manure storages per farm, as well as safety-related behaviors or actions related to entry into confined-space manure storage and handling facilities. Respondents provided data on 297 storage units and facilities, with approximately 75% reporting up to three storages per farm operation. Dimensio...

Data centric storages for sensor networks have been proposed to efficiently process multi-dimensional range queries as well as exact matches. Usually, a sensor network does not process only one type of the query, but processes various types of queries such as range queries, exact matches and skyline queries. Therefore, a sensor network based on a data centric storage for range queries and exact...

Emissions odors, gases, and dust from livestock production facilities arise primarily from three sources; buildings, manure storages, and land application (1). Emissions from buildings and storages form a baseline emission level. Eliminating emissions from one of the sources will likely not eliminate emissions entirely. Control technologies often address only one of the three sources. Many of t...

Ontologies have become a fully competitive knowledge storing systems. However, programmatic access to them lacks standardization common to relational databases. This thesis proposes a software layer capable of unifying access to different ontology storages. In cooperation with persistence provider implementation JOPA, developed at the Czech Technical University in Prague, it should significantl...

Linear Indexed Grammars (LIGs) can be used to describe nonlocal dependencies. The indexing mechanism however can only account for dependencies that are nested. In natural languages one can easily nd examples in which this simple model cannot be applied straightforwardly. In this paper I will show that a formalism tting better to linguistic structures can be obtained by using a sequence of pushd...

in a multi-secret sharing scheme, several secret values are distributed among a set of n participants.in 2000 chien et al.'s proposed a (t; n) multi-secret sharing scheme. many storages and publicvalues required in chien's scheme. motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the lagrange interpolation formula for polynomials andcip...

Active distributed storages need to assure both consistency and dynamic data support, in addition to availability, confidentiality and resiliency. Further, since storage durability suffers in untrusted and unreliable environments, it becomes crucial to (a) select the most reliable set of servers to assure data retrievability and (b) dynamically identify errant servers and restore the data to en...