Atmospheric chemistry of diazomethane – an experimental and theoretical study

The kinetics of the O₃, OH and NO₃ radical reactions with diazomethane were studied in smog chamber experiments employing long-path FTIR and PTR-ToF-MS detection. The rate coefficients were determined to be k _CH2NN+O3?=?(3.2?±?0.4)?×?10^?17 and k _CH2NN+OH?=?(1.68?±?0.12)?×?10^?10 cm³ molecule^?1 s^?1 at 295?±?3?K and 1013?±?30 hPa, whereas the CH₂NN?+?NO₃ reaction was too fast to be determined in the static smog chamber experiments. Formaldehyde was the sole product observed in all the reactions. The experimental results are supported by CCSD(T*)-F12a/aug-cc-pVTZ//M062X/aug-cc-pVTZ calculations showing the reactions to proceed exclusively via addition to the carbon atom. The atmospheric fate of diazomethane is discussed.     

Accredited dose measurements for validation of radiation sterilized products

The activities and services of the accredited Risø High Dose Reference Laboratory are described. The laboratory operates according to the European standard EN 45001 regarding Operation of Testing Laboratories, and it fulfills the requirements of being able to deliver traceable dose measurements for control of radiation sterilization. The accredited services include:

1. 1. Irradiation of dosimeters and test samples with cobalt-60 gamma rays.

2. 2. Irradiation of dosimeters and test samples with 10 MeV electrons.

3. 3. Issue of and measurement with calibrated dosimeters.

4. 4. Measurement of the dosimetric parameters of an irradiation facility.

5. 5. Measurement of absorbed dose distribution in irradiated products.

The paper describes these services and the procedures necessary for their execution.     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

Entropy estimate for high-dimensional monotonic functions

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of d-dimensional bounded monotonic functions under L^p norms. It is interesting to see that both the metric entropy and bracketing entropy have different behaviors for p<d/(d-1) and p>d/(d-1). We apply the new bounds for bracketing entropy to establish a global rate of convergence of the MLE of a d-dimensional monotone density.     

An algorithm for computing Jordan chains and inverting analytic matrix functions

We present an efficient algorithm for obtaining a canonical system of Jordan chains for an n × n regular analytic matrix function A(λ) that is singular at the origin. For any analytic vector function b(λ), we show that each term in the Laurent expansion of A(λ)⁻¹b(λ) may be obtained from the previous terms by solving an (n + d) × (n+d) linear system, where d is the order of the zero of det A(λ) at λ = 0. The matrix representing this linear system contains A(0) as a principal submatrix, which can be useful if A(0) is sparse. The last several iterations can be eliminated if left Jordan chains are computed in addition to right Jordan chains. The performance of the algorithm in floating point and exact (rational) arithmetic is reported for several test cases. The method is shown to be forward stable in floating point arithmetic.     

Adaptive application of operators in standard representation

Recently adaptive wavelet methods have been developed which can be shown to exhibit an asymptotically optimal accuracy/work balance for a wide class of variational problems including classical elliptic boundary value problems, boundary integral equations as well as certain classes of noncoercive problems such as saddle point problems. A core ingredient of these schemes is the approximate application of the involved operators in standard wavelet representation. Optimal computational complexity could be shown under the assumption that the entries in properly compressed standard representations are known or computable in average at unit cost. In this paper we propose concrete computational strategies and show under which circumstances this assumption is justified in the context of elliptic boundary value problems. Dedicated to Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A25, 41A46, 65F99, 65N12, 65N55. This work has been supported in part by the Deutsche Forschungsgemeinschaft SFB 401, the first and third author are supported in part by the European Community's Human Potential Programme under contract HPRN-CT-202-00286 (BREAKING COMPLEXITY). The second author acknowledges the financial support provided through the European Union's Human Potential Programme, under contract HPRN-CT-2002-00285 (HASSIP) and through DFG grant DA 360/4–1.     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

Design and Cold Tests of Asymmetric Quasioptical Resonators

This paper presents the design and test of asymmetric quasioptical resonators for gyrotron applications, where most of the diffraction output coupling comes from the smaller of two mirrors. A computer code based on scalar diffraction theory is used to calculate the resonator losses and the electric field near the mirrors. Resonators with mirror separations approaching confocal have reduced side lobes in the diffraction patterns, which should allow for better power transmission and focusing. Cold tests have been performed at 94 and 141 GHz to measure the quality factor of the asymmetric resonators as a function of mirror separation and mirror misalignment. Typical resonator parameters include 65 cm mirror separation, 1-3% output coupling and 85% of the losses from the small mirror. A half-symmetric resonator with one flat and one curved mirror has also been investigated. The calculated values of Q are in reasonably good agreement with the cold test measurements.