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.     

GDME-based methodology for the determination of free formaldehyde in cosmetics and hygiene products containing formaldehyde releasers

Analytical and Bioanalytical Chemistry - Formaldehyde is often applied in the industrial production of different products, such as textiles, insulation materials, or cosmetics, due to its...     

On the effects of the packet size distribution on the packet loss process

Real-time multimedia applications have to use forward error correction (FEC) anderror concealment techniques to cope with losses in today’s best-effort Internet. The efficiency of these solutions is known however to depend on the correlation between losses in the media stream. In this paper we investigate how the packet size distribution affects the packet loss process, that is, the distribution of the number of lost packets in a block, the related FEC performance and the average loss run length. We present mathematical models for the loss process of the MMPP+M/D/1/K and the MMPP+M/M/1/K queues; we validate the models via simulations, and compare the results to simulation results with an MPEG-4 coded video trace. We conclude that the deterministic packet size distribution (PSD) not only results in lower stationary loss probability than the exponential one, but also gives a less correlated loss process, both at a particular average link load and at a particular stationary loss probability as seen by the media stream.Our results show that for applications that can only measure the packet loss probability, the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior. Our results show that the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior and thus can improve the queuing performance by decreasing the variance of its PSD.     

On Burst Length Distribution and Preemption Probabilities in OBS Networks with Burst Segmentation

Recently, preemption techniques have attracted considerable attention as a means to provide differentiated quality of service in optical burst switching (OBS) networks. This paper is focused on the analysis of preemption probabilities for bursts within the same priority class. As proposed by Vokkarane and Jue ((2003)* IEEE J Select Areas Commun 21(7): 1198–1209) an incoming burst will preempt the burst in service, within the same priority class, if the residual length of the burst in service is smaller than the incoming burst length. For a general case with wavelength conversion, the preemption probability of contending bursts with a generic service distribution, not necessarily exponential, is analyzed. First, we show that the size distribution for the preempting bursts is shifted to larger values, in comparison to the original burst size distribution. Second, we obtain an upper and lower bound for the preemption probability. Finally, the asymptotic behavior of the OBS switch is analyzed showing that preemption will always occur for a very large number of wavelengths.     

Spectral boundary controllability of networks of strings

In this Note we give a necessary and sufficient condition for the spectral controllability from one simple node of a general network of strings that undergoes transversal vibrations in a sufficiently large time. This condition asserts that no eigenfunction vanishes identically on the string that contains the controlled node. The proof combines the Beurling–Malliavin's theorem and an asymptotic formula for the eigenvalues of the network. The optimal control time may be characterized as twice the sum of the lengths of all the strings of the network. To cite this article: R. Dáger, E. Zuazua, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 545–550.