Caractérisation des problèmes conjoints de détection et d'estimation

Responses of soil biological processes to elevated atmospheric [CO2] and nitrogen addition in a poplar plantation

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:

RECHERCHES Elastographie par ondes de cisaillement

Abstract Supporting database schema evolution repre-sents a long-standing challenge of practical and theoretical importance for modern information systems. In this paper, we describe techniques and systems for automating the critical tasks of migrating the database and rewriting the legacy

de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:

by a fixed assignment of spectrum resources by regulatory agencies. This has resulted into a blind alley, as current wireless spectrum has become an expensive and a scarce resource. However, recent measurements in dense areas paint a very different picture: there is an actual underutilization

mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer n-sequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.

Abstract not found

Abstract not found