University of Marne-la-Vallée

About: University of Marne-la-Vallée is a based out in . It is known for research contribution in the topics: Estimator & Context (language use). The organization has 831 authors who have published 1855 publications receiving 55316 citations.

Theoretical study of the C3S molecule

Abstract: For the most stable linear isomer of C3S in its X1Σ+ state a six-dimensional potential energy surface (PES) has been calculated ab initio by coupled cluster – connected triples (CCSD(T)) method. The analytic form of the PES has been transformed in a quartic force field in dimensionless normal coordinates and employed in calculations of spectroscopic constants using second-order perturbation theory. The PES and the full kinetic energy operator in internal coordinates have been used to calculate variationally the anharmonic ro-vibrational energies for J=0 and J=1. The two experimental band origins of C3S observed in the gas phase, ν1 and ν1+ν5−ν5, agree very well with the theoretical values. The anharmonic ro-vibrational levels, including the bending modes up to 2200 cm−1, are reported. The singlet ground state PES has a saddle point at about 1.25 eV above the linear minimum and two other higher lying cyclic local minima. The only dipole- and spin-allowed electronic transition between 0 and 5 eV is calculated to be the 1Π−X1Σ+ transition with a vertical transition energy of 353.2 nm in good agreement with the matrix value of 378 nm. The dissociative paths C + C2S, C2 + CS and C3 + S of low lying singlet and triplet states have been investigated.

Asymptotic Normality of Extreme Quantile Estimators Based on the Peaks-Over-Threshold Approach

Abstract: The POT (Peaks-Over-Threshold) approach consists of using the generalized Pareto distribution (GPD) to approximate the distribution of excesses over thresholds. In this article, we establish the asymptotic normality of the well-known extreme quantile estimators based on this POT method, under very general assumptions. As an illustration, from this result, we deduce the asymptotic normality of the POT extreme quantile estimators in the case where the maximum likelihood (ML) or the generalized probability-weighted moments (GPWM) methods are used. Simulations are provided in order to compare the efficiency of these estimators based on ML or GPWM methods with classical ones proposed in the literature.

Reflection-based implementation of Java extensions: the double-dispatch use-case

Abstract: Reflection-based libraries could sometimes be used to extend the expressive power of Java without modifying the language nor the virtual machine. In this paper, we present the advantages of this approach together with general guidelines allowing such implementations to be practicable. Then, we show how these principles have been applied to implement an efficient and general double-dispatch solution for Java.

Multiple sequence comparison: A peptide matching approach

Abstract: We present in this paper a peptide matching approach to the multiple comparison of a set of protein sequences This approach consists in looking for all the words that are common to q of these sequences, where q is a parameter

Pattern Matching and Text Compression Algorithms.

Abstract: Pattern matching is the problem of locating a specific pattern inside raw data. The pattern is usually a collection of strings described in some formal language. Applications require two kinds of solution depending upon which string, the pattern, or the text, is given first. Solutions based on the use of automata or combinatorial properties of strings are commonly implemented to preprocess the pattern. The notion of indices realized by trees or automata is used in the second kind of solutions. The aim of data compression is to provide representation of data in a reduced form in order to save both storage place and transmission time. There is no loss of information, the compression processes are reversible. Pattern-matching and text-compression algorithms are two important subjects in the wider domain of text processing. They apply to the manipulation of texts (word editors), to the storage of textual data (text compression), and to data retrieval systems (full text search). They are basic components used in implementations of practical softwares existing under most operating systems. Moreover, they emphasize programming methods that serve as paradigms in other fields of computer science (system or software design). Finally, they also play an important role in theoretical computer science by providing challenging problems. Although data are recorded in various ways, text remains the main way to exchange information. This is particularly evident in literature or linguistics where data are composed of huge corpora and dictionaries, but applies as well to computer science where a large amount of data is stored in linear files. And it is also the case, for instance, in molecular biology because biological molecules can often be approximated as sequences of nucleotides or amino acids. Furthermore, the quantity of available data in these fields tend to double every 18 months. This is the reason that algorithms must be efficient even if the speed and storage capacity of computers increase continuously.