Operational retrieval of trace gases concentrations from IASI spectra

info:eu-repo/semantics/nonPublished

Operational retrieval of trace gases concentrations from IASI spectra

info:eu-repo/semantics/nonPublished

Calibrating single-ended fiber-optic Raman spectra distributed temperature sensing data.

Hydrologic research is a very demanding application of fiber-optic distributed temperature sensing (DTS) in terms of precision, accuracy and calibration. The physics behind the most frequently used DTS instruments are considered as they apply to four calibration methods for single-ended DTS installations. The new methods presented are more accurate than the instrument-calibrated data, achieving accuracies on the order of tenths of a degree root mean square error (RMSE) and mean bias. Effects of localized non-uniformities that violate the assumptions of single-ended calibration data are explored and quantified. Experimental design considerations such as selection of integration times or selection of the length of the reference sections are discussed, and the impacts of these considerations on calibrated temperatures are explored in two case studies.

A new method based on Markov chains for deriving SB2 orbits directly from their spectra

info:eu-repo/semantics/published

Vibration-rotation pattern in acetylene. II. Introduction of Coriolis coupling in the global model and analysis of emission spectra of hot acetylene around 3 microns

This paper was selected by the editors of the Journal of Chemical Physics as one of the few of the many notable JCP articles published in 2009 that present ground-breaking research

Vibration-rotation pattern in acetylene: Introduction of Coriolis coupling in the global model and analysis of emission spectra of hot acetylene around 3 µm

info:eu-repo/semantics/nonPublished

Coherence Properties of Supercontinuum Spectra Generated in Photonic Crystal and Tapered Optical Fibers

Numerical simulations have been used in studies of the temporal and spectral features of supercontinuum generation in photonic crystal and tapered optical fibers. In particular, an ensemble average over multiple simulations performed with random quantum noise on the input pulse allows the coherence of the supercontinuum to be quantified in terms of the dependence of the degree of first-order coherence on the wavelength. The coherence is shown to depend strongly on the input pulse's duration and wavelength, and optimal conditions for the generation of coherent supercontinua are discussed. © 2002 Optical Society of America.

Fundamental Amplitude Noise Limitations to Supercontinuum Spectra Generated in a Microstructured Fiber

Broadband supercontinuum spectra are generated in a microstructured fiber using femtosecond laser pulses. Noise properties of these spectra are studied through experiments and numerical simulations based on a generalized stochastic nonlinear Schrödinger equation. In particular, the relative intensity noise as a function of wavelength across the supercontinuum is measured over a wide range of input pulse parameters, and experimental results and simulations are shown to be in good quantitative agreement. For certain input pulse parameters, amplitude fluctuations as large as 50% are observed. The simulations clarify that the intensity noise on the supercontinuum arises from the amplification of two noise inputs during propagation - quantum-limited shot noise on the input pulse, and spontaneous Raman scattering in the fiber. The amplification factor is a sensitive function of the input pulse parameters. Short input pulses are critical for the generation of very broad supercontinua with low noise.

Fundamental Amplitude Noise Limitations to Supercontinuum Spectra Generated in a Microstructured Fiber: Erratum

0

Erratum: Fundamental amplitude noise limitations to supercontinuum spectra generated in a microstructured fiber (Appl. Phys. B (2003) 77 (269-277))

SCOPUS: er.j

Parallel dynamic graph-partitioning for unstructured meshes

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

A multilevel algorithm for force-directed graph drawing

We describe a heuristic method for drawing graphs which uses a multilevel technique combined with a force-directed placement algorithm. The multilevel process groups vertices to form clusters, uses the clusters to define a new graph and is repeated until the graph size falls below some threshold. The coarsest graph is then given an initial layout and the layout is successively refined on all the graphs starting with the coarsest and ending with the original. In this way the multilevel algorithm both accelerates and gives a more global quality to the force- directed placement. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on a number of examples ranging from 500 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 30 seconds for a 10,000 vertex graph to around 10 minutes for the largest graph. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.

A multilevel algorithm for force-directed graph-drawing

We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated recursively to create a hierarchy of increasingly coarse graphs, G0, G1, …, GL. The coarsest graph, GL, is then given an initial layout and the layout is refined and extended to all the graphs starting with the coarsest and ending with the original. At each successive change of level, l, the initial layout for Gl is taken from its coarser and smaller child graph, Gl+1, and refined using force-directed placement. In this way the multilevel framework both accelerates and appears to give a more global quality to the drawing. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on examples ranging in size from 10 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 12 seconds for a 10,000 vertex graph to around 5-7 minutes for the largest graphs. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.