Balanced ternary number representation and arithmetic, based on the symmetric radix-3 digit set {−1, 0, +1}, has been studied at various times in the history of computing. Among established advantages of balanced ternary arithmetic are representational symmetry, favourable error characteristics and rounding by truncation. In this study, we show an additional advantage: that of lower-error trunc...

Reducing cost of material handling has been a big challenge for companies. Flexible manufacturing system employed automated guided vehicles (AGV) to maintain efficiency and flexibility. This paper presents a new non-linear mathematical programming model to group n machines into N loops, to make an efficient configuration for AGV system in Tandem layout. The model minimizes bot...

We make two contributions to cooperative game theory, both of which rely heavily on linear programming duality theory. First, we introduce a fairness criterion on service providers, which we call No Subsidy. This condition ensures that a subset of the users is not overcharged in order to subsidize another set of users. We completely characterize cost functions that allow cost sharing mechanisms...

edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

Salmonella hadar is now the second commonest serotype isolated from cases of food poisoning in England and Wales. Turkeys are the main reservoir of the organism and there is an urgent need to eradicate it from the breeding stocks; though this would be expensive, the cost must be balanced against the cost of treating the human disease.

We consider optimization problems for complex systems in which the cost function has a multivalleyed landscape. We introduce a new class of dynamical algorithms which, using a suitable annealing procedure coupled with a balanced greedy-reluctant strategy drive the systems towards the deepest minimum of the cost function. Results are presented for the Sherrington-Kirkpatrick model of spin-glasses.

We investigate cost-sharing mechanisms for scheduling cost-sharing games. We assume that the demand is general—that is, each player can be allocated one of several levels of service. We show how to design mechanisms for these games that are weakly group strategyproof, approximately budget-balanced, and approximately efficient, using approximation algorithms for the underlying scheduling problem...

Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we support range queries through a balanced tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B-tree design that efficiently stores clustered data while maintainin...

In this article, we show that the projection-free, snapshot-based, balanced truncation method can be applied directly to unstable systems. We prove that even for unstable systems, the unmodified balanced proper orthogonal decomposition algorithm theoretically yields a converged transformation that balances the Gramians (including the unstable subspace). We then apply the method to a spatially d...

Inventory situations, introduced in Meca et al. (2004), study how a collective of firms can minimize its joint inventory cost by means of cooperation. Depending on the information revealed by the individual firms, they analyze two related cooperative TU games: inventory cost games and holding cost games, and focus on proportional division mechanisms to share the joint cost. It turns out that ho...