Highly Selective Copper‐Catalyzed Asymmetric [3+2] Cycloaddition of Azomethine Ylides with Acyclic 1,3‐Dienes

The first examples of the catalytic asymmetric 1,3‐dipolar cycloaddition of azomethine ylides with acyclic activated 1,3‐dienes (and 1,3‐enynes) are described. Under copper catalysis, a selective cycloaddition at the terminal γ,δ‐C?C bond is observed. In addition, depending on the ligand used, either the exo or the endo adduct can be obtained with high selectivity. Under appropriate reaction conditions, the acyclic 1,6‐addition product is detected, suggesting a stepwise mechanism. The resulting C4‐alkenyl‐substituted pyrrolidines are suitable substrates for further access to polycyclic systems, as highlighted by the preparation of hexahydrochromeno[4,3‐b]pyrrole and the tetracyclic core of the alkaloid gracilamine.     

Influence of the sulfonate countercation on the thermal stability of nafion perfluorosulfonate membranes

We report a strong dependence of the thermal stability of Nafion® perfluorosulfonate ionomer on the nature of the counterion associated with the fixed sulfonate site. These results were obtained using thermal gravimetric analysis on a series of alkali metal and alkyl ammonium cation-exchanged Nafion films. We have found that the temperature of decomposition of Nafion is inversely dependent on the size of the exchanged cation; i.e., Nafion films show improved thermal stability as the size of the counter cation decreases. We attribute this inverse relationship of thermal stability with counterion size to an initial decomposition reaction which is strongly influenced by the strength of the sulfonate-coun-terion interaction. © 1993 John Wiley & Sons, Inc.     

Randomized greedy matching

We consider a randomized version of the greedy algorithm for finding a large matching in a graph. We assume that the next edge is always randomly chosen from those remaining. We analyze the performance of this algorithm when the input graph is fixed. We show that there are graphs for which this Randomized Greedy Algorithm (RGA) usually only obtains a matching close in size to that guaranteed by worst-case analysis (i.e., half the size of the maximum). For some classes of sparse graphs (e.g., planar graphs and forests) we show that the RGA performs significantly better than the worst-case. Our main theorem concerns forests. We prove that the ratio to maximum here is at least 0.7690…, and that this bound is tight.     

Infrared picosecond absorption spectroscopy of microcrystalline silicon: separation between carrier recombination in crystalline and amorphous fractions

We have studied ultra-fast carrier dynamics of photo-excited carriers in hydrogenated microcrystalline silicon prepared by a very high frequency glow-discharge technique. We report on direct observation of two types of dynamics using selective photo-excitation in picosecond pump and probe measurements. One type of the observed dynamics has been found to be independent of the sample preparation, while the other reflects the relative weights of crystalline and amorphous fractions. We propose a simple rate-equation model that describes the carrier dynamics in microcrystalline silicon in terms of the composition of those in Si microcrystallites and in the a-Si:H tissue which surrounds the microcrystallites. The model without any fitting parameters reproduces the experimental data very well when the dynamics are scaled with relative volume fractions as obtained from Raman spectra. Received: 23 November 2000 / Accepted: 17 March 2001 / Published online: 23 May 2001     

Some remarks to multivariate regression model

Some remarks to problems of point and interval estimation, testing and problems of outliers are presented in the case of multivariate regression model. This work was supported by the Council of Czech Government J14/98:153100011.     

An interior–exterior Schwarz algorithm and its convergenceUn algorithme de Schwarz intérieur–extérieur et sa convergence

In this work we study the solution of Laplace's equation in a domain with holes by an iteration consisting of splitting the problem in an exterior one, around the holes, plus an interior problem in the unholed domain. We show the existence of a decomposition of the solution when the exterior problem is represented by means of a single-layer protential. Also, for the three-dimensional case and with some adjustments for the two-dimensional case, we prove convergence of the method by writing the iteration as a Jacobi iteration for an operator equation and studying the spectrum of the iteration operator. To cite this article: R. Celorrio et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 923–926.