Structure of norbornene-fused 3,1-oxazine double cycloadducts

Pentacyclic isoxazolines were obtained by the cycloaddition of benzonitrile oxide to norbornene-azetidinone-fused 3,1-oxazines. The constitutions of two of the isomers obtained, and the configurations and conformations of all products, were determined by means of ¹H and ¹³C NMR spectroscopy and DNOE experiments.     

Optimal Control in Heterogeneous Domain Decomposition Methods for Advection-Diffusion Equations

New domain decomposition methods (DDM) based on optimal control approach are introduced for the coupling of first and second order equations on overlapping subdomains. Several cost functionals and control functions are proposed. Uniqueness and existence results are proved for the coupled problem, and the convergence of iterative processes is analyzed. The work was supported by the Russian Foundation for Basic Research (04-01-00615) and it was partly carried out while the first author was visiting the IACS at EPFL.     

On Gittins’ index theorem in continuous time

We give a new and comparably short proof of Gittins’ index theorem for dynamic allocation problems of the multi-armed bandit type in continuous time under minimal assumptions. This proof gives a complete characterization of optimal allocation strategies as those policies which follow the current leader among the Gittins indices while ensuring that a Gittins index is at an all-time low whenever the associated project is not worked on exclusively. The main tool is a representation property of Gittins index processes which allows us to show that these processes can be chosen to be pathwise lower semi-continuous from the right and quasi-lower semi-continuous from the left. Both regularity properties turn out to be crucial for our characterization and the construction of optimal allocation policies.     

On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.