Commutative, idempotent groupoids and the

Abstract not found

Abstract — We consider minimum variance estimation within the sparse linear Gaussian model (SLGM). A sparse vector is to be estimated from a linearly transformed version embedded in Gaussian noise. Our analysis is based on the theory of reproducing kernel Hilbert spaces (RKHS). After a characterization of the RKHS associated with the SLGM, we derive a lower bound on the minimum variance achievable by estimators with a prescribed bias function, including the important special case of unbiased estimation. This bound is obtained via an orthogonal projection of the prescribed mean function onto a subspace of the RKHS associated with the SLGM. It provides an approximation to the minimum achievable variance (Barankin bound) that is tighter than any known bound. Our bound holds for an arbitrary system matrix, including the overdetermined and underdetermined cases. We specialize

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.

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

and backchase

The recent discovery of dark energy has prompted an investigation of ways in which the accelerated expansion of the universe can be realized. In this dissertation, we present two separate projects related to dark energy. The first project analyzes a class of braneworld models in which multiple branes float in a five-dimensional anti-de Sitter bulk, while the second investigates a class of dark energy models from an effective field theory perspective. Investigations of models including extra dimensions have led to modifications of gravity involving a number of interesting features. In particular, the Randall-Sundrum model is well-known for achieving an amelioration of the hierarchy problem. However, the basic model relies on Minkowski branes and is subject to solar system constraints in the absence of a radion stabilization mechanism. We present a method by which a four-dimensional low-energy description can be obtained for braneworld scenarios, allowing for a number of generalizations to the original models. This method is applied to orbifolded and uncompactified N-brane models, deriving an effective four-dimensional action. The parameter space of this theory is constrained using observational evidence, and it is found that the generalizations do not weaken solar system constraints on the original model. Furthermore, we find that general

First, I would like to thank to Dimka Karastoyanova and Mariano Cilia for all the fruitful discussions, their guidance and support through the course of this project. Thanks also to Prof. Alejandro Buchmann who sponsored my stay at Technische Universität Darmstadt during the spring of 2004. The special thanks go to my advisor, Mariano Cilia, who has made all this possible. Finally, I’d like to thank to my family for all these years of support.

Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely

eingereicht an der