Thesis (doctoral)--Rheinische-Friedrich-Wilhelms-Universität. / Title has symbol for mean partial differential operator. Includes bibliographical references.

This thesis deals with the problem of estimating statistical distributions from data. In the first part, the method of moments is used in combination with computational algebraic techniques in order to estimate parameters coming from local Dirac mixtures and their convolutions. The second part focuses on the nonparametric setting, in particular on combinatorial and algebraic aspects of the estimation of log-concave distributions.

No description available.

We use inequalities to design short universal algorithms that can be used to generate random variates from large classes of univariate continuous or discrete distributions (including all log-concave distributions). The expected time is uniformly bounded over all these distributions. The algorithms can be implemented in a few lines of high level language code. In opposition to other black-box algorithms hardly any setup step is required and thus it is superior in the changing parameter case. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

In this paper we describe a version of transformed density rejection that requires less uniform random numbers. Random variates below the squeeze are generated by inversion. For the expensive part between squeeze and density an algorithm that uses a coverering with triangles is introduced. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

We use inequalities to design short universal algorithms that can be used to generate random variates from large classes of univariate continuous or discrete distributions (including all log-concave distributions). The expected time is uniformly bounded over all these distributions for a particular generator. The algorithms can be implemented in a few lines of high level language code. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

Applying the ratio-of-uniforms method for generating random variates results in very efficient, fast and easy to implement algorithms. However parameters for every particular type of density must be precalculated analytically. In this paper we show, that the ratio-of-uniforms method is also useful for the design of a black-box algorithm suitable for a large class of distributions, including all with log-concave densities. Using polygonal envelopes and squeezes results in an algorithm that is extremely fast. In opposition to any other ratio-of-uniforms algorithm the expected number of uniform random numbers is less than two. Furthermore we show that this method is in some sense equivalent to transformed density rejection. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing

Dans cette thèse, nous nous intéressons aux espaces temps dit globalement hyperboliques Cauchy compacts. Ce sont des espaces temps qui admettent une fonction, dite fonction temps de Cauchy, propre qui croit strictement le long des courbes causales inextensibles. Les niveaux de telles fonctions sont des hypersurfaces de type espace appelées hypersurfaces de Cauchy. La donnée d'une fonction temps définit naturellement une famille à 1-paramètres d'espaces métriques. Notre but est d'étudier le comportement asymptomatique de ces familles d'espaces métriques Il y a deux cas de figure à considérer : le premier étant le comportement asymptomatique dans le passé ; le deuxième est celui du comportement asymptomatique dans le futur. Plus de conditions géométriques sur l'espace temps et les fonctions temps à considérer seront nécessaires / In this thesis we're interested in globally hyperbolic Cauchy compact space-times. These are space-times that possess a proper function, called Cauchy time function, which ist strictly increasing along inextensible causal curves. A Cauchy time function defines naturally a 1-parameter family of metric spaces. One asks the natural and important question of the asymptomatic behaviour of this family with respect to the time : when time goes to 0 and when it goes towards infinity. Of course additional geometric condition on the space-ime and the time function will be necessary for a more appropriate study

This thesis describes and develops two planarization algorithms for geographic routing and a geographic routing protocol for mobile ad hoc and sensor networks. As all nodes are mobile and there is no fixed infrastructure, the design of routing protocols is one of the most challenging issues in mobile ad hoc and sensor networks. In recent years, greedyface- greedy (GFG) geographic routing protocols have been widely used, which need nodes to construct planar graphs as the underlying graphs for face routing. Two kinds of planarization algorithms have been developed, idealized and realistic planarization algorithms, respectively. The idealized planarization algorithms make the ideal assumption that the original network graph is a unit-disk graph (UDG). On the other hand, the realistic planarization algorithms do not need the original network to be a UDG. We propose an idealized planarization algorithm, which constructs an Edge Constrained Localized Delaunay graph (ECLDel). Compared to the existing planarized localized Delaunay graph [42], the construction of an ECLDel graph is far simpler, which reduces the communication cost and saves the network bandwidth. We propose a Pre-Processed Cross Link Detection Protocol (PPCLDP), which generates a planar spanning subgraph of the original network graph in realistic environments with obstacles. The proposed PPCLDP outperforms the existing Cross Link Detection Protocol [32] with much lower communication cost and better convergence time. In GFG routing protocols, greedy routing may fail at concave nodes, in which case, face routing is applied to recover from the greedy routing failure. This may cause extra hops in routing in networks containing voids. We propose a Hill-Area-Restricted (HAR) routing protocol, which avoids the extra hops taken in the original GFG routing. Compared to the existing Node Elevation Ad hoc Routing [4], the proposed HAR guarantees the packet delivery and decreases the communication cost greatly.

.