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

Thermokinetic lattice Boltzmann model of nonideal fluids

We present a kinetic model for nonideal fluids, where the local thermodynamic pressure is imposed through appropriate rescaling of the particle's velocities, accounting for both long- and short-range effects and hence full thermodynamic consistency. The model features full Galilean invariance together with mass, momentum, and energy conservation and enables simulations ranging from subcritical to supercritical flows, which is illustrated on various benchmark flows such as anomalous shock waves or shock droplet interaction

Enhanced electron correlations at the SrxCa1-xVO3 surface

We report hard x-ray photoemission spectroscopy measurements of the electronic structure of the prototypical correlated oxide SrxCa1-xVO3. By comparing spectra recorded at different excitation energies, we show that 2.2 keV photoelectrons contain a substantial surface component, whereas 4.2 keV photoelectrons originate essentially from the bulk of the sample. Bulk-sensitive measurements of the O 2p valence band are found to be in good agreement with ab initio calculations of the electronic structure, with some modest adjustments to the orbital-dependent photoionization cross sections. The evolution of the O 2p electronic structure as a function of the Sr content is dominated by A-site hybridization. Near the Fermi level, the correlated V 3d Hubbard bands are found to evolve in both binding energy and spectral weight as a function of distance from the vacuum interface, revealing higher correlation at the surface than in the bulk

Fractional Operators, Dirichlet Averages, and Splines

Fractional differential and integral operators, Dirichlet averages, and splines of complex order are three seemingly distinct mathematical subject areas addressing different questions and employing different methodologies. It is the purpose of this paper to show that there are deep and interesting relationships between these three areas. First a brief introduction to fractional differential and integral operators defined on Lizorkin spaces is presented and some of their main properties exhibited. This particular approach has the advantage that several definitions of fractional derivatives and integrals coincide. We then introduce Dirichlet averages and extend their definition to an infinite-dimensional setting that is needed to exhibit the relationships to splines of complex order. Finally, we focus on splines of complex order and, in particular, on cardinal B-splines of complex order. The fundamental connections to fractional derivatives and integrals as well as Dirichlet averages are presented

Transition probabilities for general birth-death processes with applications in ecology, genetics, and evolution

A birth-death process is a continuous-time Markov chain that counts the number of particles in a system over time. In the general process with $n$ current particles, a new particle is born with instantaneous rate $\lambda_n$ and a particle dies with instantaneous rate $\mu_n$. Currently no robust and efficient method exists to evaluate the finite-time transition probabilities in a general birth-death process with arbitrary birth and death rates. In this paper, we first revisit the theory of continued fractions to obtain expressions for the Laplace transforms of these transition probabilities and make explicit an important derivation connecting transition probabilities and continued fractions. We then develop an efficient algorithm for computing these probabilities that analyzes the error associated with approximations in the method. We demonstrate that this error-controlled method agrees with known solutions and outperforms previous approaches to computing these probabilities. Finally, we apply our novel method to several important problems in ecology, evolution, and genetics

A Match in Time Saves Nine: Deterministic Online Matching With Delays

We consider the problem of online Min-cost Perfect Matching with Delays (MPMD) introduced by Emek et al. (STOC 2016). In this problem, an even number of requests appear in a metric space at different times and the goal of an online algorithm is to match them in pairs. In contrast to traditional online matching problems, in MPMD all requests appear online and an algorithm can match any pair of requests, but such decision may be delayed (e.g., to find a better match). The cost is the sum of matching distances and the introduced delays. We present the first deterministic online algorithm for this problem. Its competitive ratio is $O(m^{\log_2 5.5})$ $= O(m^{2.46})$, where $2 m$ is the number of requests. This is polynomial in the number of metric space points if all requests are given at different points. In particular, the bound does not depend on other parameters of the metric, such as its aspect ratio. Unlike previous (randomized) solutions for the MPMD problem, our algorithm does not need to know the metric space in advance

Analytical Solution of a Stochastic Content Based Network Model

We define and completely solve a content-based directed network whose nodes consist of random words and an adjacency rule involving perfect or approximate matches, for an alphabet with an arbitrary number of letters. The analytic expression for the out-degree distribution shows a crossover from a leading power law behavior to a log-periodic regime bounded by a different power law decay. The leading exponents in the two regions have a weak dependence on the mean word length, and an even weaker dependence on the alphabet size. The in-degree distribution, on the other hand, is much narrower and does not show scaling behavior. The results might be of interest for understanding the emergence of genomic interaction networks, which rely, to a large extent, on mechanisms based on sequence matching, and exhibit similar global features to those found here.Comment: 13 pages, 5 figures. Rewrote conclusions regarding the relevance to gene regulation networks, fixed minor errors and replaced fig. 4. Main body of paper (model and calculations) remains unchanged. Submitted for publicatio