Introducing a new concept of (α, β)-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 ≤ α ≤ 1, nor more than β ≥ 1, times its fair share, this paper provides a framework to optimize efficiency (utilization, throughput or revenue) subject to fairness constraints in a general telecommunications network for an arbitrary fairness crit...

In 1978, Rivest, Adleman and Dertouzos asked for algebraic systems for which useful privacy homomorphisms exist. To date, the only acknownledged result is noise based encryption combined with bootstrapping. Before that, there were several failed attempts. We prove that fully homomorphic schemes are impossible for several algebraic structures. Then we develop a characterisation of all fully homo...

Partial-order reduction methods form a collection of state exploration techniques set to relieve the stateexplosion problem in concurrent program verification. One such method is implemented in the verification tool SPIN. Its use often reduces significantly the memory and time needed for verifying local and termination properties of concurrent programs and, moreover, for verifying that concurre...

multidimensional data clustering, data mining, very large databases, parallel algorithms, distributed computing Data clustering is one of the fundamental techniques in scientific data analysis and data mining. It partitions a data set into groups of similar items, as measured by some distance metric. Over the years, data set sizes have grown rapidly with the exponential growth of computer stora...

LetG= (V ,E) be a 2-connected simple graph and let dG(u, v) denote the distance between two vertices u, v in G. In this paper, it is proved: if the inequality dG(u) + dG(v) |V (G)| − 1 holds for each pair of vertices u and v with dG(u, v) = 2, then G is Hamiltonian, unless G belongs to an exceptional class of graphs. The latter class is described in this paper. Our result implies the theorem of...

While Chip Multiprocessors (CMP) with Thread-Level Speculation (TLS) have become the subject of intense research, processor designers in industry have reservations about their practical implementation. An often cited complaint is that TLS is too energy-inefficient to compete against conventional superscalars. This paper challenges the commonly-held view that TLS is energy inefficient. We identi...

Bruce and Waldman make an important contribution regarding the Samaritan dilemma: the expectations of inheritance motivates the younger generation at the margin in the direction of welfare reducing behavior. However, these authors misinterpret the standard analysis on this matter as prediction instead of explanation; confuse governmental subsidies with private charitable giving, and uncriticall...

In order to improve hammerhead ribozyme efficiency and specificity, we have analyzed, both in vitro and in vivo, the activity of a series of ribozyme/substrate combinations that have the same target sequence but differ in the length of the ribozyme/substrate duplex or in their structure, i.e., the total length of the RNA. In vitro, we have found that optimal kcat/Km (at 37 degrees C) is obtaine...

A traffic simulation and assignment model is used to compute the social costs of congestion in five English towns, together with potential road charges. The social costs of congestion are measured by the deadweight loss and computed as the area between the marginal social cost and inverse demand curves between the actual and efficient levels of traffic. Potential road charges are computed as th...