We analyze the impact of a contract's length, callability, amortization and original discount by arbitrage methods. Among instruments that are callable without penalty, longer instruments command a higher interest rate because the borrower possesses the option of repaying relatively more slowly. However, the rate on longer self-amortizing loans cannot be substantially larger than for shorter on...

This paper studies throughput maximization in networks with dynamically changing congestion. First, we give a new and simple analysis of an existing model where the bandwidth available to a flow varies multiplicatively over time. The main contribution however is the introduction of a novel model for dynamics based on concepts of network calculus. This model features a limited form of amortizati...

Cuckoo hashing combines multiple-choice hashing with the power to move elements, providing hash tables with very high space utilization and low probability of overflow. However, inserting a new object into such a hash table can take substantial time, requiring many elements to be moved. While these events are rare and the amortized performance of these data structures is excellent, this shortco...

A simple dynamic framework is used to show how consolidation plans that are robust and effective at capacity output can be undermined by demand failure. If the market panics and interest rates rise, the process can indeed become dynamically unstable. Tightening fiscal policy to reassure financial markets can lead to a low level “consolidation trap”, however. Better that the Central Bank acts to...

The facility is located in Colorado Springs and consists of three BART-eligible dry-bottom, wallfired boilers (Units 5, 6, and 7). These boilers fire a variety of coal types, including coal from the southern Powder River Basin, ColoWyo coal (from northwestern Colorado), 20-Mile Foidel Creek coal (northwestern Colorado), and West Elk coal (western Colorado). Due to equipment limitations, these b...

ONLINE BIN STRETCHING is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as an optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for ONLINE BIN STRETCHING with a stretching factor of 1.5 for any number of bins. We build o...