46,736 research outputs found

    Laser cleaning of the output window in a laser ignition system for gas turbines

    Get PDF
    Laser ignition (LI) of both liquid fuels and gaseous combustible mixtures in gas turbines offers the potential for reduced emissions and increased reliability. During the combustion process, carbon and other by-products accumulate on the walls of the combustion chamber. For laser based ignition systems, this could potentially reduce the transmissive properties of the output window required for transmission of the laser radiation into the combustion chamber. Presented in this paper is an empirical study into the laser cleaning of an output window for the removal of accumulated carbon prior to laser ignition, with the mechanism of removal discussed

    GENERATION OF FORESTS ON TERRAIN WITH DYNAMIC LIGHTING AND SHADOWING

    Get PDF
    The purpose of this research project is to exhibit an efficient method of creating dynamic lighting and shadowing for the generation of forests on terrain. In this research project, I use textures which contain images of trees from a bird’s eye view in order to create a high scale forest. Furthermore, by manipulating the transparency and color of the textures according to the algorithmic calculations of light and shadow on terrain, I provide the functionality of dynamic lighting and shadowing. Finally, by analyzing the OpenGL pipeline, I design my code in order to allow efficient rendering of the forest

    Lagrangian spheres in Del Pezzo surfaces

    Full text link
    Lagrangian spheres in the symplectic Del Pezzo surfaces arising as blow-ups of the complex projective plane in 4 or fewer points are classified up to Lagrangian isotopy. Unlike the case of the 5-point blow-up, there is no Lagrangian knotting.Comment: 48 pages, 2 figures; referee's corrections and suggestions incorporated

    The Fixed Point Property for Posets of Small Width

    Full text link
    The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are linearly indecomposable are examined to see which are minimal automorphic. Part of a problem of Niederle from 1989 is thus solved

    Chain Decomposition Theorems for Ordered Sets (and Other Musings)

    Full text link
    A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can be partitioned into chains in a ``strong'' way, is proved. The result is motivated by a conjecture of Graham's concerning probability correlation inequalities for linear extensions of finite posets
    • …
    corecore