Browsing by Subject "Higher-order"

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    20-fs 1.6-mJ pulses from a cw-diode-pumped single-stage 1-kHz Yb amplifier
    (OSA, 2010) Andriukaitis, G.; Kartashov, D.; Pugzlys, A.; Lorenc, D.; Baltuska, A.; Giniunas, L.; Danielius, R.; İlday, Ömer Fatih
    200-fs 2.5-mJ pulses from a fiber-oscillator-seeded DPSS Yb:CaF2 MOPA are spectrally broadened in Ar and recompressed to 20 fs using a pair of LAK14 prisms. Multi-millijoule 12-fs pulses are feasible upon higher-order spectral phase correction.
  • Thumbnail Image
    ItemOpen Access
    All-aluminum hierarchical plasmonic surfaces in the infrared
    (The Optical Society, 2016) Ayas S.; Bakan, G.; Dana, A.
    All-Aluminum metal-insulator-metal resonator structures withmultiple metal-insulator stacks showing resonances in the mid-infrared(MIR) are fabricated. Ultrathin native Al2O3 is used as the insulator layersenabling simple fabrication of the resonator structures. The structures withtwo oxide layers exhibit two distinct resonances in the MIR. Simulation ofthese structures shows confinement of magnetic field to the thicker bottomoxide at the shorter wavelength resonance and to the thinner top oxide at theother resonance. Simulations of higher order hierarchical structures with 3 and 4 oxide layers show multispectral response with precise control of theoxide thicknesses. The studied structures show great potential for IRapplications that require durability and multispectral characteristics.
  • Thumbnail Image
    ItemOpen Access
    On correct program schemas
    (Springer, Berlin, Heidelberg, 1998) Flener, Pierre; Lau, K. K.; Ornaghi, M.
    We present our work on the representation and correctness of program schemas, in the context of logic program synthesis. Whereas most researchers represent schemas purely syntactically as higher-order expressions, we shall express a schema as an open rst-order theory that axiomatises a problem domain, called a specication framework, containing an open program that represents the template of the schema. We will show that using our approach we can dene a meaningful notion of correctness for schemas, viz. that correct program schemas can be expressed as parametric specication frameworks containing templates that are steadfast, i.e. programs that are always correct provided their open relations are computed correctly. © Springer-Verlag Berlin Heidelberg 1998.