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

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

ges till offentlig granskning för avläggande av teknologie doktorsexamen fredagen

Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con-cepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, proper-ties, relations etc.) not completely but by means of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.

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

of scalability and maintainability. Hence, different approaches are based on Peer-to-Peer (P2P) technology. In particular, fast-paced NVEs stress these systems and most likely cause high overlay maintenance overhead. This Master’s Thesis presents a novel approach to spatial Publish/Subscribe (Pub/Sub) in P2P

of the spectrum by legacy sys-tems. Cognitive radio exhibits a tremendous promise for increasing the spectral efficiency for future wireless systems. Ideally, new secondary users would have a perfect panorama of the spectrum usage, and would opportunistically communicate over the available re-sources without

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 on advanced type-theoretic machinery that is not easily integrated into established theorem provers. We present Mtac, a lightweight but powerful extension to Coq that supports dependently typed tactic programming. Mtac tactics have access to all the features of ordinary Coq programming, as well as a new set of typed tactical primitives. We avoid the need to touch the trusted kernel type-checker of Coq by encapsulating uses of these new tactical primitives in a monad, and instrumenting Coq so that it executes monadic tactics during type inference. 1

m]]l]]s¶D]]¿÷mB]iv]b]oD]m¶¨]iv]§]iv]r]j]t¿rv]]irj]]t]]m] / | ap]]r¿]ÎNy]s¶D]]mb¶r]ix} Û]Ix]]rd]mb]} p—N]t]o%ism] in]ty]m] / || Û]Is]¡uÎc]rN]]riv]nd]p]*N]m]st¶ I always bow to Śri ̄ Śāradāmbā, the limitless ocean of the nectar of compassion, who bears a rosary, a vessel of nectar, the symbol

pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios