La réduction de la taille des transistors et des tensions d’alimentations permettent de concevoir des circuits intégrés de plus en plus complexes. Cependant, en abordant les limites de l’intégration des transistors et en fleuretant avec les tensions d’alimentation minimale, la fiabilité des circuits n’est plus garantie : des erreurs dues aux perturbations environnementales peuvent apparaitre. L’apparition de ces erreurs affectent le comportement du circuit et peuvent, par intermittence ou de façon permanente, le rendre inapte à rendre le service pour lequel il a été conçu. Par conséquent, il est de plus en plus important de considérer les effets de ces erreurs dans la conception des futurs circuits. L’objectif de la thèse est de traiter la fiabilité des systèmes numériques et d’introduire de nouvelles techniques de tolérance aux pannes permettant de construire des applications de traitement de signal fiables sur un électronique peu fiable. Un exemple d’application a été considéré durant la thèse : les modules de poursuite dans un récepteur GPS. Ces modules contiennent un ensemble d’applications de traitement de signal avec des exigences de fiabilité différentes : fonction de corrélation, boucles de rétroactions, machines d’états, générateurs de codes et de porteuses. À partir d’une version standard d’un récepteur GPS, des mécanismes de redondance ont été proposés et ajoutés pour concevoir un récepteur GPS plus tolérant aux erreurs. Un circuit intégré (ASIC) sera conçu en utilisant une technologie 28 nm pour valider les performances de ces techniques et faire les tests de mesures de consommation d’énergie. Au cours de la thèse, une plate-forme d’émulation a été conçue pour préparer l’environnement expérimental à utiliser une fois l’ASIC fondu. / There is continual motivation to scale down transistors size and to reduce the supply voltage of the circuits. However, by approaching the limits of transistor scaling and operating at a minimal supply voltage, circuit reliability has emerged as a critical concern. Circuits become more and more susceptible to errors due to Process, Voltage and Temperature (PVT) variations. Occurrence of errors can affect the behavior of circuits and generate a permanent system failure. Therefore, it is increasingly important to deal with errors effects in order to keep future devices working properly. The objective of the thesis is to address the reliability in digital systems and introduce new fault tolerant techniques to perform reliable signal processing applications on unreliable hardware. An example of application has been considered in the thesis: the tracking process of GPS receivers. It contains a very interesting set of different signal processing problem with different requirements of reliability: Correlation process, tracking loops (recursive operations), state machine, Gold and carrier generators. Starting from a noiseless GPS receiver, redundant mechanisms have been proposed and added to design a more resilient GPS receiver tolerant to errors. An Application-Specific Integrated Circuit (ASIC) will be designed, based on thesis results, using the 28 nm technology to validate the performances of the proposed techniques performances. During the thesis, an emulation platform was designed to prepare the experimental environment for the ASIC.

This thesis is aimed at generalizing notions of rings to modules. In par-ticular, notions of completely prime ideals, s-prime ideals, 2-primal rings and nilpotency of elements of rings are respectively generalized to completely prime submodules and classical completely prime submodules, s-prime submodules, 2-primal modules and nilpotency of elements of modules. Properties and rad-icals that arise from each of these notions are studied.

La thèse présente une construction de variétés holomorphiquement symplectiques singulières comme fibrations lagrangiennes. Celles-ci sont des variétés de Prym compactifiées relatives associées aux courbes sur des surfaces symplectiques avec une involution antisymplectique. Elles sont identifiées au lieu fixe d'une involution symplectique sur des espaces de modules de faisceaux de dimension 1. Un exemple explicite d'une variété symplectique irréductible de dimension 6 singulière et sans résolution symplectique est décrit pour une surface K3 qui est un revêtement double d'une surface cubique. Pour surfaces abéliennes, une variation de la construction est étudiée pour obtenir des variétés symplectiques irréductibles: variétés 0-Prym compactifiées relatives. Un résultat partiel est obtenu pour involutions sans points fixes: soit la variété 0-Prym est birationnelle à une variété symplectique irréductible de K3[n]-type, soit elle n'admet pas de résolutions symplectiques. / The thesis presents a construction of singular holomorphically symplectic varieties as Lagrangian fibrations. They are relative compactified Prym varieties associated to curves on symplectic surfaces with an antisymplectic involution. They are identified with the fixed locus of a symplectic involution on singular moduli spaces of sheaves of dimension 1. An explicit example, giving a singular irreducible symplectic 6-fold without symplectic resolutions, is described for a K3 surface which is the double cover of a cubic surface. In the case of abelian surfaces, a variation of this construction is studied to get irreducible symplectic varieties: relative compactified 0-Prym varieties. A partial classification result is obtained for involutions without fixed points: either the 0-Prym variety is birational to an irreducible symplectic variety of K3[n]-type, or it does not admit symplectic resolutions.

<p>Packaging of high density integrated circuits offers many challenges in the electronics industry today. Advanced requirements for high performance computing are starting to take advantage of multichip modules that are smaller in size and weight, use less energy, and cost less than prior technologies. This project and report provides a summary of the processes of multichip module packaging and describes some of the companies and their technologies currently involved in the industry today. An advanced computer system is proposed that would require a high density multichlp module. Functional requirements and performance specifications are identified for the system.</p> <p> Many design decisions are required to determine the best integrated circuit package for the system, with trade-off analysis being key in the selection process. One comparative analysis worthy of study is the evaluation of high density interconnection alternatives. Two technologies of multichip module designs are compared using the Analytic Hierarchy Process. Main attributes of the alternatives are chosen that are key to thp design and have significant differences. The attributes are defined in detail and weighted based on their importance to the model. Performance data is also used in the comparisons of alternatives.</p> <p> A spreadsheet program was developed to quickly enter the weighted values and performance data, perform the matrix calculations, and determine the final rankings of the alternatives. Sensitivity analysis was then applied to determine what effect a change in the value of a particular attribute had on the outcome of the rankings. Results of the sensitivity analysis for key attributes are graphically plotted.</p> / Master of Science

No description available.

In the first chapter we give an outline of classical KRULL rings as in SAMUEL (1964), BOURBAKI (1965) and FOSSUM (1973). In the second chapter we introduce two notions important to our treatment of KRULL theory. The first is injective modules and.the second torsion theories. We then look at injective modules over Noetherian rings as in MATLIS [1958] and then over KRULL rings as in BECK [1971]. We show that for a KRULL ring there is a torsion theory (N,M) where N is the pseudo-zero modules and M the set of N-torsion-free (BECK calls these co-divisorial) modules. From LAMBEK [1971] there is a full abelian sub category C, namely the category of N-torsion-free, N-divisible modules, with exact reflector. We show in C (I) every direct sum of injective modules is injective and (II) C has global dimension at most one. It is these two properties that we exploit in the third chapter to give another characterization of KRULL rings. Then we generalize this to rings with zero-divisors and find that (i) R has to be reduced (ii) the ring is KRULL if and only if it is a finite product of fields and KRULL domains (iii) the injective envelope of the ring is semi-simple artinian. We then generalize the ideas to rings of higher dimension.

In this thesis project, I have explored ways to reach spatial complexity through the use of a simple system of volumetric building elements. The ambition has been to draw an apartment building with emphasis on a variety in the apartment layouts as well as to let the functions of circulation, which I define as both shared and private functions such as stairs, elevators and passages, become an integrated part of the architectural expression. The volumetric building element, with proportions derived from our infrastructural norms as it requires transformation on a truck, is today an ubiquitous object or even an architectural typology of its own. When they are assembled, it can both become a system of similar parts or one new, larger object. The project has then also been a search for an architectural ambivalence between hiding and exposing the fact that a building is the outcome of a system.

Programmers want to write modular programs to increase maintainability and create abstractions, but modularity hampers optimizations, especially when modules are compiled separately or written in different languages. In languages with syntactic extension capabilities, each module in a program can be written in a separate language, and the module system must ensure that the modules interoperate correctly. In Racket, the module system ensures this by separating module code into phases for runtime and compile-time and allowing phased imports and exports inside modules. We present an algorithm, called demodularization, that combines all executable code from a phased modular program into a single module that can then be optimized as a whole program. The demodularized programs have the same behavior as their modular counterparts but are easier to optimize. We show that programs maintain their meaning through an operational semantics of the demodularization process and verify that performance increases by comparing modular Racket programs to the equivalent demodularized and optimized programs. We use the existing Racket optimizer to optimize the demodularized programs by decompiling them into an intermediate form that the optimizer uses. We also demonstrate a dead code elimination optimization that dramatically reduces the file size of demodularized Racket programs.

Proposal for a student housing complex at Stockholm University Campus.

Since the discovery in the early 1950's, frames have emerged as an important tool in signal processing, image processing, data compression and sampling theory etc. Today, powerful tools from operator theory and Banach space theory are being introduced to the study of frames producing deep results in frame theory. In recent years, many mathematicians generalized the frame theory from Hilbert spaces to Hilbert C*-modules and got significant results which enrich the theory of frames. Also there is growing evidence that Hilbert C*-modules theory and the theory of wavelets and frames are tightly related to each other in many aspects. Both research fields can benefit from achievements of the other field. Our purpose of this dissertation is to work on several basic problems on frames for Hilbert C*-modules. We first give a very useful characterization of modular frames which is easy to be applied. Using this characterization we investigate the modular frames from the operator theory point of view. A condition under which the removal of element from a frame in Hilbert C*-modules leaves a frame or a non-frame set is also given. In contrast to the Hilbert space situation, Riesz bases of Hilbert C*-modules may possess infinitely many alternative duals due to the existence of zero-divisors and not every dual of a Riesz basis is again a Riesz basis. We will present several such examples showing that the duals of Riesz bases in Hilbert $C^*$-modules are much different and more complicated than the Hilbert space cases. A complete characterization of all the dual sequences for a Riesz basis, and a necessary and sufficient condition for a dual sequence of a Riesz basis to be a Riesz basis are also given. In the case that the underlying C*-algebra is a commutative W*-algebra, we prove that the set of the Parseval frame generators for a unitary group can be parameterized by the set of all the unitary operators in the double commutant of the unitary group. Similar result holds for the set of all the general frame generators where the unitary operators are replaced by invertible and adjointable operators. Consequently, the set of all the Parseval frame generators is path-connected. We also prove the existence and uniqueness of the best Parseval multi-frame approximations for multi-frame generators of unitary groups on Hilbert C*-modules when the underlying C*-algebra is commutative. For the dilation results of frames we show that a complete Parseval frame vector for a unitary group on Hilbert C*-module can be dilated to a complete wandering vector. For any dual frame pair in Hilbert C*-modules, we prove that the pair are orthogonal compressions of a Riesz basis and its canonical dual basis for some larger Hilbert C*-module. For the perturbation of frames and Riesz bases in Hilbert C*-modules we prove that the Casazza-Christensen general perturbation theorem for frames in Hilbert spaces remains valid in Hilbert C*-modules. In the Hilbert space setting, under the same perturbation condition, the perturbation of any Riesz basis remains a Riesz basis. However, this no longer holds for Riesz bases in Hilbert C*-modules. We also give a complete characterization on all the Riesz bases for Hilbert C*-modules such that the perturbation (under Casazza-Christensen's perturbation condition) of a Riesz basis still remains a Riesz basis.