A computational strategy for multiscale systems with applications to Lorenz 96 model

Numerical schemes for systems with multiple spatio-temporal scales are investigated. The multiscale schemes use asymptotic results for this type of systems which guarantee the existence of an effective dynamics for some suitably defined modes varying slowly on the largest scales. The multiscale schemes are analyzed in general, then illustrated on a specific example of a moderately large deterministic system displaying chaotic behavior due to Lorenz. Issues like consistency, accuracy, and efficiency are discussed in detail. The role of possible hidden slow variables as well as additional effects arising on the diffusive time-scale are also investigated. As a byproduct we obtain a rather complete characterization of the effective dynamics in Lorenz model.     

Domain decomposition for an asymptotic geological fault modeling

We present in this paper a domain decomposition method to treat faults in geological basin modeling. The particularity of this model is that the faults whose widths are very small in comparison with the basin size, are not characterized as subdomains any more but as interfaces between sedimentary blocks. The originality of this work lies in the formulation of this new fault model and in the definition and the computation of the interface conditions between the subdomains. To cite this article: E. Flauraud et al., C. R. Mecanique 331 (2003).     

Local algorithms in exterior tomography

Exterior tomographic data are taken over lines outside a central region, and such data occur in the industrial nondestructive evaluation of large objects such as rockets. We explain, using microlocal analysis, which singularities are well reconstructed from exterior data, and we explain how this phenomenon is reflected in the singular value decomposition for the exterior transform [E.T. Quinto, Singular value decompositions and inversion methods for the exterior Radon transform and a spherical transform, J. Math. Anal. Appl. 95 (1983) 437–448]. We extend Lambda Tomography to exterior data and to limited angle exterior data. The algorithm is tested on industrial data from Perceptics, Inc.     

A note on scheduling to meet two min-sum objectives

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ).     

Gas-phase thermal decomposition of peroxy-N-butyryl nitrate

The gas-phase thermal decomposition rate of peroxy-n-butyryl nitrate (n-C₃H₇C(O)OONO₂, PnBN) has been measured at ambient temperature (296 K) and 1 atm of air relative to that of peroxyacetyl nitrate (CH₃C(O)OONO₂, PAN) using mixtures of PAN (14–19 ppb), PnBN (22–46 ppb), and nitric oxide (1.35–1.90 ppm). The PnBN/PAN decomposition rate ratio was 0.773 ± 0.030. This ratio, together with a literature value of 3.0 × 10^?4 s^?1 for the thermal decomposition rate of PAN at 296 K, yields a PnBN thermal decomposition rate of (2.32 ± 0.09) × 10^?4 s^?1. The results are briefly discussed by comparison with data for other peroxyacyl nitrates and with respect to the atmospheric persistence of PnBN. © 1994 John Wiley & Sons, Inc.     

The Shapley value for cooperative games under precedence constraints

Cooperative games are considered where only those coalitions of players are feasible that respect a given precedence structure on the set of players. Strengthening the classical symmetry axiom, we obtain three axioms that give rise to a unique Shapley value in this model. The Shapley value is seen to reflect the expected marginal contribution of a player to a feasible random coalition, which allows us to evaluate the Shapley value nondeterministically. We show that every exact algorithm for the Shapley value requires an exponential number of operations already in the classical case and that even restriction to simple games is #P-hard in general. Furthermore, we outline how the multi-choice cooperative games of Hsiao and Raghavan can be treated in our context, which leads to a Shapley value that does not depend on pre-assigned weights. Finally, the relationship between the Shapley value and the permission value of Gilles, Owen and van den Brink is discussed. Both refer to formally similar models of cooperative games but reflect complementary interpretations of the precedence constraints and thus give rise to fundamentally different solution concepts.