38 research outputs found

    Orbital Observations of Dust Lofted by Daytime Convective Turbulence

    Get PDF
    Over the past several decades, orbital observations of lofted dust have revealed the importance of mineral aerosols as a climate forcing mechanism on both Earth and Mars. Increasingly detailed and diverse data sets have provided an ever-improving understanding of dust sources, transport pathways, and sinks on both planets, but the role of dust in modulating atmospheric processes is complex and not always well understood. We present a review of orbital observations of entrained dust on Earth and Mars, particularly that produced by the dust-laden structures produced by daytime convective turbulence called “dust devils”. On Earth, dust devils are thought to contribute only a small fraction of the atmospheric dust budget; accordingly, there are not yet any published accounts of their occurrence from orbit. In contrast, dust devils on Mars are thought to account for several tens of percent of the planet’s atmospheric dust budget; the literature regarding martian dust devils is quite rich. Because terrestrial dust devils may temporarily contribute significantly to local dust loading and lowered air quality, we suggest that martian dust devil studies may inform future studies of convectively-lofted dust on Earth

    Linear complementarity algorithms for infinite games

    No full text
    The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have not been previously studied in the context of infinite games, and they offer alternatives to the classical strategy-improvement algorithms. The two algorithms are described purely in terms of discounted games, thus bypassing the reduction from the games to LCPs, and hence facilitating a better understanding of the algorithms when applied to games. A family of parity games is given, on which both algorithms run in exponential time, indicating that in the worst case they perform no better for parity, average-reward, or discounted games than they do for general P-matrix LCPs
    corecore