The intention in designing data structures with relaxed balance, such as chromatic search trees, is to facilitate fast updating on shared-memory asynchronous parallel architectures. To obtain this, the updating and rebalancing have been uncoupled, so extensive locking in connection with updates is avoided. In this paper, we prove that only an amortized constant amount of rebalancing is necessar...

1 We consider the operation of automated mobility-on-demand systems, whereby users share access to a fleet 2 of self-driving vehicles. In these systems, rebalancing, the process by which the supply of empty vehicles is 3 periodically realigned with the demand for transport, is carried out by a fleet operator. Where much of the 4 rebalancing literature skews to the theoretical or simulation-base...

The traditional Markowitz MVO approach is based on a single-period model. Single period models do not utilize any data or decisions beyond the rebalancing time horizon with the result that their policies are myopic in nature. For long-term investors, multi-period optimization offers the opportunity to make wait-and-see policy decisions by including approximate forecasts and long-term policy dec...

The aim of this paper is to justify the use of constant mix investment strategies as an approximation for periodically rebalanced investment strategies. In Dhaene et al. (2005), general optimization problems are solved in a lognormal framework by deriving convex order bounds based on comonotonicity. The multi-period optimal portfolio selection problems discussed in Dhaene et al. (2005) are solv...

The ontogeny of seed structure and the accumulation of seed storage substances is the result of a determinant genetic program. Using RNA interference, the synthesis of soybean (Glycine max) glycinin and conglycinin storage proteins has been suppressed. The storage protein knockdown (SP-) seeds are overtly identical to the wild type, maturing to similar size and weight, and in developmental onto...