Abs t rac t . A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et al. (Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems, pp. 258-267, January 1995), we study the precise impact of the behavior of processors' clocks with respect to real time...

The results here are based on formulae in the two appendices in R. Schack, C. M. Caves, and G. M. D’Ariano, “Hypersensitivity to perburbation in the quantum kicked top,” Phys. Rev. E 50, 972–987 (1994). The relevant equations in the two appendices are (A18) and (B5)–(B6). A preliminary version of the analysis here can be found at the end of Sec. V of R. Schack and C. M. Caves, “Information-theo...

The shape of performance curves and their plasticity define how individuals and populations respond to environmental variability. In theory, maximum performance decreases with an increase in performance breadth. However, reversible acclimation may counteract this generalist-specialist trade-off, because performance optima track environmental conditions so that there is no benefit of generalist ...

This report describes my method of increasing the capacity of any wireless network through the application of MIMO technology. The Shannon capacity of wireless networks has been calculated in different instances by MATLAB. Using Simulink, the various parameters of a wireless Rayleigh Multipath fading channel are calculated. This is done in order to experimentally prove the advantages of a MIMO ...

We discuss the options in developing a design flow for asynchronous circuits using a deep submicron technology based on standard commercial EDA tools. The flow starts with a synthesizable HDL specification, using the standard synchronous mechanisms, and produces a fabricatable layout GDSII form. It addresses the electro-magnetic interference, power, performance and timing-convergence issues by ...

Given a weighted undirected network with arbitrary node names, we present a family of routing schemes characterized by an integral parameter κ ≥ 1. The scheme uses Õ(n logD) space routing table at each node, and routes along paths of linear stretch O(κ), where D is the normalized diameter of the network. When D is polynomial in n, the scheme has asymptotically optimal stretch factor. With the s...

Is the Quantity-Quality Trade-off a Trade-off for All, None, or Some? Although the theoretical trade-off between the quantity and quality of children is wellestablished, empirical evidence supporting such a causal relationship − particularly on child health − is limited. We use two measures of child health to asses the quantity-quality tradeoff across the entire distribution. Using data from th...

In this paper we describe optimal trade-offs between time and space complexity of Merkle tree traversals with their associated authentication paths, improving on the previous results of M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo [Fractal Merkle tree representation and traversal, in: RSA Cryptographers Track, RSA Security Conference, 2003] and M. Szydlo [Merkle tree traversal in log spa...

Despite the prominence of the risk-incentives trade-off in the agency theory, empirical evidence provides at best a mixed result. In this paper, we argue that these mixed results may be attributed to the heterogeneity of risk aversion magnitude among the agents and the outside options available on the market. We show that when an increase of the uncertainty amplifies the riskiness of principal’...

Trade-off (aka Pareto) curves are typically used to represent the trade-off among different objectives in multiobjective optimization problems. Although trade-off curves are exponentially large for typical combinatorial optimization problems (and infinite for continuous problems), it was observed in [PY1] that there exist polynomial size approximations for any > 0, and that under certain genera...