Monitoring the packet gap of real-time packet traffic

Real-time packet traffic is characterized by a strict deadline on the end-to-end time delay and an upper bound on the information loss. Due to the high correlation among consecutive packets, the individual packet loss does not well characterize the performance of real-time packet sessions. An additional measure of packet loss is necessary to adequately assess the quality of each real-time connection. The additional measure considered here is the average number of consecutively lost packets, also called the average packet gap. We derive a closed form for the average packet gap for the multiclassG/G/m/B queueing system in equilibrium and show that it only depends on the loss behavior of two consecutive packets. This result considerably simplifies the monitoring process of real-time packet traffic sessions. If the packet loss process is markovian, the consecutive packet loss has a geometric distribution.     

Olefin terpolymerizations. II. 4-vinylcyclohexene and cyclooctadiene

4-Vinylcyclohexene (VCH) and cyclooctadiene (COD) were investigated as termonomers in EPDM (ethylene/propylene/diene) synthesis by using rac-ethylenebis (1-η⁵-indenyl) zir-conium dichloride ( 1 ) as a catalyst precursor. Homopolymerizations of VCH, vinylcycloh-exane and cyclohexene were compared. The parameter K_πκ_p, which is the apparent rate constant for Ziegler-Natta polymerization, is about the same for VCH and vinylcyclohexanebut is 10 times smaller for cyclohexene. Therefore, the linear olefinic double bond is more active than the cyclic internal double bond. VCH reduces ethylene polymerization rate but not propylene polymerization rate in copolymerizations. In terpolymerizations, VCH tends to suppress ethylene incorporation especially at elevated polymerization temperature and Lowers the polymer MW by about two-fold. COD has very low activity as a termonomer. © 1995 John Wiley & Sons, Inc.     

Lévy processes and their subordination in matrix Lie groups

Lévy processes in matrix Lie groups are studied. Subordination (random time change) is used to show that quasi-invariance of the Brownian motion in a Lie group induces absolute continuity of the laws of the corresponding pure jump processes. These results are applied to several examples which are discussed in detail.     

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.     

Exact Max-SAT solvers for over-constrained problems

We present a new generic problem solving approach for over-constrained problems based on Max-SAT. We first define a Boolean clausal form formalism, called soft CNF formulas, that deals with blocks of clauses instead of individual clauses, and that allows one to declare each block either as hard (i.e., must be satisfied by any solution) or soft (i.e., can be violated by some solution). We then present two Max-SAT solvers that find a truth assignment that satisfies all the hard blocks of clauses and the maximum number of soft blocks of clauses. Our solvers are branch and bound algorithms equipped with original lazy data structures, powerful inference techniques, good quality lower bounds, and original variable selection heuristics. Finally, we report an experimental investigation on a representative sample of instances (random 2-SAT, Max-CSP, graph coloring, pigeon hole and quasigroup completion) which provides experimental evidence that our approach is very competitive compared with the state-of-the-art approaches developed in the CSP and SAT communities. Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.     

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.