Automated design of minimum drag light aircraft fuselages and nacelles

The constrained minimization algorithm of Vanderplaats is applied to the problem of designing minimum drag faired bodies such as fuselages and nacelles. Body drag is computed by a variation of the Hess-Smith code. This variation includes a boundary layer computation. The encased payload provides arbitrary geometric constraints, specified a priori by the designer, below which the fairing cannot shrink. The optimization may include engine cooling air flows entering and exhausting through specific port locations on the body

Localization of Denaturation Bubbles in Random DNA Sequences

We study the thermodynamic and dynamic behaviors of twist-induced denaturation bubbles in a long, stretched random sequence of DNA. The small bubbles associated with weak twist are delocalized. Above a threshold torque, the bubbles of several tens of bases or larger become preferentially localized to \AT-rich segments. In the localized regime, the bubbles exhibit ``aging'' and move around sub-diffusively with continuously varying dynamic exponents. These properties are derived using results of large-deviation theory together with scaling arguments, and are verified by Monte-Carlo simulations.Comment: TeX file with postscript figure

A note on the invariant distribution of a quasi-birth-and-death process

The aim of this paper is to give an explicit formula of the invariant distribution of a quasi-birth-and-death process in terms of the block entries of the transition probability matrix using a matrix-valued orthogonal polynomials approach. We will show that the invariant distribution can be computed using the squared norms of the corresponding matrix-valued orthogonal polynomials, no matter if they are or not diagonal matrices. We will give an example where the squared norms are not diagonal matrices, but nevertheless we can compute its invariant distribution

Stability of Service under Time-of-Use Pricing

We consider "time-of-use" pricing as a technique for matching supply and demand of temporal resources with the goal of maximizing social welfare. Relevant examples include energy, computing resources on a cloud computing platform, and charging stations for electric vehicles, among many others. A client/job in this setting has a window of time during which he needs service, and a particular value for obtaining it. We assume a stochastic model for demand, where each job materializes with some probability via an independent Bernoulli trial. Given a per-time-unit pricing of resources, any realized job will first try to get served by the cheapest available resource in its window and, failing that, will try to find service at the next cheapest available resource, and so on. Thus, the natural stochastic fluctuations in demand have the potential to lead to cascading overload events. Our main result shows that setting prices so as to optimally handle the {\em expected} demand works well: with high probability, when the actual demand is instantiated, the system is stable and the expected value of the jobs served is very close to that of the optimal offline algorithm.Comment: To appear in STOC'1

Exit times in non-Markovian drifting continuous-time random walk processes

By appealing to renewal theory we determine the equations that the mean exit time of a continuous-time random walk with drift satisfies both when the present coincides with a jump instant or when it does not. Particular attention is paid to the corrections ensuing from the non-Markovian nature of the process. We show that when drift and jumps have the same sign the relevant integral equations can be solved in closed form. The case when holding times have the classical Erlang distribution is considered in detail.Comment: 9 pages, 3 color plots, two-column revtex 4; new Appendix and references adde