Aircraft flight deck synthetic vision systems (SVS) always provide a “clear day” view and hence have the potential to improve safety in commercial aviation. Approach, landing, and taxi operations will most readily profit from the SVS capabilities. A part-task simulation study provided data on pilot performance using a baseline and an SVS-equipped flight deck. One effect of adding the separate S...

To compensate for item nonresponse, hot deck imputation procedures replace missing values with values that occur in the sample. Fractional hot deck imputation replaces each missing observation with a set of imputed values and assigns a weight to each imputed value. Under the model in which observations in an imputation cell are independently and identically distributed, fractional hot deck impu...

Multiple imputation procedures (MI) are a useful tool to adjust for item non-response but are often based on fully parametric assumptions, such as multivariate normality. For many applications such assumptions may not hold in practice, for example if the data are skewed and affected by rounding and truncation effects. Hot deck imputation methods, however, make less or no assumptions about under...

Concrete infrastructure systems require large capital investments and resource flows to construct and maintain. An integrated life cycle assessment and cost model was developed to evaluate infrastructure sustainability, and compare alternative materials and designs using environmental, economic and social indicators. The model is applied to two alternative concrete bridge deck designs: one a co...

Shu e a deck of n cards numbered 1 through n. Deal out the rst c cards into a hand. A player then repeatedly chooses one of the cards from the hand, inserts it into a binary search tree, and then adds the next card from deck to the hand (if the deck is empty). When the player nally runs out of cards, how deep can the search tree be? This problem is motivated by concurrent insertions by c proces...

We study the Gilbert-Shannon-Reeds model for riffle shuffles and ask ’How many times must a deck of cards be shuffled for the deck to be in close to random order?’. In 1992, Bayer and Diaconis gave a solution which gives exact and asymptotic results for all decks of practical interest, e.g. a deck of 52 cards. But what if one only cares about the colors of the cards or disregards the suits focu...

The problem of finding the flow over a finite flat plate aligned with a uniform free stream is revisited. Multigrid is used to obtain accurate numerical solutions up to a Reynolds number of 4000. Fourier boundary conditions keep the computational domain small, with no loss of accuracy. Near the trailing edge, excellent agreement with first-order triple-deck theory is found. However, previous co...