Primitive rispetto all’ oscillazione

We study the real valued functions having a primitive with respect to the oscillation or a primitive with respect to the oscillation up to anegligible set.

---

---

Supported by MURST of Italy.     

Obstruction à la transversalité de lagrangiens

In this Note, we give a necessary and sufficient condition for Lagrangians in a symplectic vector bundle to be deformed stably into transversal Lagrangians. In the case of three Lagrangians, we show that the associated Grothendieck group can be identified with a Hermitian K-theory group. To cite this article: M. Karoubi, M.L. Lapa de Souza, C. R. Acad. Sci. Paris, Ser. I 342 (2006).     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

Zero weights and non-zero slacks: Different solutions to the same problem

This paper re-assesses three independently developed approaches that are aimed at solving the problem of zero-weights or non-zero slacks in Data Envelopment Analysis (DEA). The methods are weights restricted, non-radial and extended facet DEA models. Weights restricted DEA models are dual to envelopment DEA models with restrictions on the dual variables (DEA weights) aimed at avoiding zero values for those weights; non-radial DEA models are envelopment models which avoid non-zero slacks in the input-output constraints. Finally, extended facet DEA models recognize that only projections on facets of full dimension correspond to well defined rates of substitution/transformation between all inputs/outputs which in turn correspond to non-zero weights in the multiplier version of the DEA model. We demonstrate how these methods are equivalent, not only in their aim but also in the solutions they yield. In addition, we show that the aforementioned methods modify the production frontier by extending existing facets or creating unobserved facets. Further we propose a new approach that uses weight restrictions to extend existing facets. This approach has some advantages in computational terms, because extended facet models normally make use of mixed integer programming models, which are computationally demanding.     

Modulated DSC for gas hydrates analysis

Modulated DSC has been applied to the study of methane, ethane and propane hydrates at different hydrate and ice concentrations. The reversing component of the TMDSC curves, makes it possible to characterize such hydrates. Methane and ethane hydrates show the melting-decomposition peak at a temperatures higher than the ice contained in the sample, while propane hydrate melts and decomposes at lower temperature than the ice present in the sample. The hydrate peaks tend to disappear if the hydrate is stored at atmospheric pressure. Guest size and cavity occupation fix the heat of dissociation and stability of the hydrates, as confirmed by parallel tests on tetrahydrofurane hydrates.     

Effect of external Gaussian random field on phonon spectrum of linear atomic chains

We present the theoretical study of the effect of external random field characterized by a Gaussian probability distribution function on the continuous phonon spectrum of one-dimensional (1D) chain, based on the Jacobian matrix method. The cumulative effect of the random field and simple isotopic defect is studied analytically and numerically. The Gaussian random field removes a square-root divergence appearing in the phonon spectrum of ideal 1D chain. The impurity phonon DOS shows strong dependence on the variance and the mean of the random field and exhibits very different behavior from the non-random case: the continuous spectrum is expanded and the δ-peak, describing discrete impurity vibrations in the non-random chain with the impurity, falls into a continuous zone.     

CuPc molecules adsorbed on Au(1 1 0)-(1 × 2): growth morphology and evolution of valence band states

We present the growth morphology, the long-range ordering, and the evolution of the valence band electronic states of ultrathin films of copper phthalocyanine (CuPc) deposited on the Au(1 1 0)-(1 × 2) reconstructed surface, as a function of the organic molecule coverage. The low energy electron diffraction patterns present a (5 × 3) reconstruction from the early adsorption stages. High-resolution UV photoelectron spectroscopy data show the disappearance of the Au surface states related to the (1 × 2) reconstruction, and the presence of new electronic features related to the molecule-substrate interaction and to the CuPc molecular states. The CuPc highest occupied molecular orbital gradually emerges in the valence band, while the interface electronic states are quenched, upon increasing the coverage.     

A Genetic Algorithm for Solving a Capacitated p-Median Problem

Facility-location problems have several applications, such as telecommunications, industrial transportation and distribution. One of the most well-known facility-location problems is the p-median problem. This work addresses an application of the capacitated p-median problem to a real-world problem. We propose a genetic algorithm (GA) to solve the capacitated p-median problem. The proposed GA uses not only conventional genetic operators, but also a new heuristic “hypermutation” operator suggested in this work. The proposed GA is compared with a tabu search algorithm.