Since the invention of AVL trees in 1962, many kinds of binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing after an insertion or deletion takes O(1) amortized time and O(1) rotations worst-case. But the design space of balanced trees has not been fully explored. We continue the exploration. Our contributions are three. We systematically study the...

While many Asian emerging markets now run current account surpluses, reducing Asia’s overall excess savings is largely about modifying growth patterns and saving–investment balances in China. China accounts for about half of the total GDP in Asia ex-Japan but over two-thirds of the region’s total savings and current account surplus. One feature shared by all Asian economies is the surge in corp...

The soybean seed's protein content and composition are regulated by both genetics and physiology. Overt seed protein content is specified by the genotype's genetic framework and is selectable as a breeding trait. Within the genotype-specified protein content phenotype soybeans have the capacity to rebalance protein composition to create differing proteomes. Soybeans possess a relatively standar...

Bike-sharing services are flourishing in Smart Cities worldwide. They provide a low-cost and environment-friendly transportation alternative and help reduce traffic congestion. However, these new services are still under development, and several challenges need to be solved. A major problem is the management of rebalancing trucks in order to ensure that bikes and stalls in the docking stations ...

This study develops inter-temporal dynamic asset allocation with stochastic volatility (DAASV) models. The DAASV models integrate the stochastic volatility feature inherent in asset returns into the allocation procedure. By applying the DAASV, an investor can more efficiently diversify the unsystematic risks, so as to achieve better performance. We demonstrate that the DAASV models dominate the...

We give, for any reasonable function f, a scheme for rebalancing a binary search tree with amortized O(f(n)) work per update while guaranteeing a height bounded by dlog(n+1)+1=f(n)e for all n. As a corollary, in the semi-dynamic case, height dlog(n+1)e can be guaranteed with amortized O(log n) work per insertion. Both results match existing lower bounds, and hence provide an exact characterizat...

Monte Carlo simulations are used to demonstrate that a very attractive tax-based trading strategy is to realize all capital losses, using excess losses to offset realized gains to rebalance the portfolio. This strategy increases the mean and median return by taking advantage of the tax-deductibility of losses, and mitigates risk by allowing low-cost portfolio rebalancing. This portfolio rebalan...

When search trees are made relaxed, balance constraints are weakened such that updates can be made without immediate rebalancing. This can lead to a speed-up in some circumstances. However, the weakened balance constraints also make it more challenging to prove complexity results for relaxed structures. In our opinion, one of the simplest and most intuitive presentations of balanced search tree...

This paper considers the competitive issues raised by the continuing evolution of public switched telephone network development toward an open data network. Adopting a platform hierarchy set forth by the National Research Council, the paper agrees that some higher level services may indeed reduce traditional telephone company revenues, but argues that it would be counterproductive for regulator...