Sheaves, local homeomorphisms and local sets as Hilbert locale modules

We give a thorough account of the various equivalent notions for \sheaf" on a locale, namely the separated and complete presheaves, the local home- omorphisms, and the local sets, and to provide a new approach based on quantale modules whereby we see that sheaves can be identi¯ed with certain Hilbert modules in the sense of Paseka. This formulation provides us with an interesting category that has immediate meaningful relations to those of sheaves, local homeomorphisms and local sets. The concept of B-set (local set over the locale B) present in [3] is seen as a simetric idempotent matrix with entries on B, and a map of B-sets as de¯ned in [8] is shown to be also a matrix satisfying some conditions. This gives us useful tools that permit the algebraic manipulation of B-sets. The main result is to show that the existing notions of \sheaf" on a locale B are also equivalent to a new concept what we call a Hilbert module with an Hilbert base. These modules are the projective modules since they are the image of a free module by a idempotent automorphism On the ¯rst chapter, we recall some well known results about partially ordered sets and lattices. On chapter two we introduce the category of Sup-lattices, and the cate- gory of locales, Loc. We describe the adjunction between this category and the category Top of topological spaces whose restriction to spacial locales give us a duality between this category and the category of sober spaces. We ¯nish this chapter with the de¯nitions of module over a quantale and Hilbert Module. Chapter three concerns with various equivalent notions namely: sheaves of sets, local homeomorphisms and local sets (projection matrices with entries on a locale). We ¯nish giving a direct algebraic proof that each local set is isomorphic to a complete local set, whose rows correspond to the singletons. On chapter four we de¯ne B-locale, study open maps and local homeo- morphims. The main new result is on the ¯fth chapter where we de¯ne the Hilbert modules and Hilbert modules with an Hilbert and show this latter concept is equivalent to the previous notions of sheaf over a locale.

Dualidade de Poincaré e invariantes cohomológicos

Pós-graduação em Matemática - IBILCE

Síntese, caracterização e avaliação da atividade biológica de metalofármacos de sulindaco com íons lantanídeos (III) no estado sólido

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

HCl gas gettering of 3d transition metals for crystalline silicon solar cell concepts

In order to reduce the costs of crystalline silicon solar cells, low-cost silicon materials like upgraded metallurgical grade (UMG) silicon are investigated for the application in the photovoltaic (PV) industry. Conventional high-purity silicon is made by cost-intensive methods, based on the so-called Siemens process, which uses the reaction to form chlorosilanes and subsequent several distillation steps before the deposition of high-purity silicon on slim high-purity silicon rods. UMG silicon in contrast is gained from metallurgical silicon by a rather inexpensive physicochemical purification (e.g., acid leaching and/or segregation). However, this type of silicon usually contains much higher concentrations of impurities, especially 3d transition metals like Ti, Fe, and Cu. These metals are extremely detrimental in the electrically active part of silicon solar cells, as they form recombination centers for charge carriers in the silicon band gap. This is why simple purification techniques like gettering, which can be applied between or during solar cell process steps, will play an important role for such low-cost silicon materials. Gettering in general describes a process, whereby impurities are moved to a place or turned into a state, where they are less detrimental to the solar cell. Hydrogen chloride (HCl) gas gettering in particular is a promising simple and cheap gettering technique, which is based on the reaction of HCl gas with transition metals to form volatile metal chloride species at high temperatures.rnThe aim of this thesis was to find the optimum process parameters for HCl gas gettering of 3d transition metals in low-cost silicon to improve the cell efficiency of solar cells for two different cell concepts, the standard wafer cell concept and the epitaxial wafer equivalent (EpiWE) cell concept. Whereas the former is based on a wafer which is the electrically active part of the solar cell, the latter uses an electrically inactive low-cost silicon substrate with an active layer of epitaxially grown silicon on top. Low-cost silicon materials with different impurity grades were used for HCl gas gettering experiments with the variation of process parameters like the temperature, the gettering time, and the HCl gas concentration. Subsequently, the multicrystalline silicon neighboring wafers with and without gettering were compared by element analysis techniques like neutron activation analysis (NAA). It was demonstrated that HCl gas gettering is an effective purification technique for silicon wafers, which is able to reduce some 3d transition metal concentrations by over 90%. Solar cells were processed for both concepts which could demonstrate a significant increase of the solar cell efficiency by HCl gas gettering. The efficiency of EpiWE cells could be increased by HCl gas gettering by approximately 25% relative to cells without gettering. First process simulations were performed based on a simple model for HCl gas gettering processes, which could be used to make qualitative predictions.

Experiments in abstract interpretation-based code certification for pervasive systems

Proof carrying code (PCC) is a general is originally a roof in ñrst-order logic of certain vermethodology for certifying that the execution of an un- ification onditions and the checking process involves trusted mobile code is safe. The baste idea is that the ensuring that the certifícate is indeed a valid ñrst-order code supplier attaches a certifícate to the mobile code proof. which the consumer checks in order to ensure that the The main practical difñculty of PCC techniques is in code is indeed safe. The potential benefit is that the generating safety certiñeates which at the same time: i) consumer's task is reduced from the level of proving to allow expressing interesting safety properties, ii) can be the level of checking. Recently, the abstract interpre- generated automatically and, iii) are easy and efficient tation techniques developed, in logic programming have to check. In [1], the abstract interpretation techniques been proposed as a basis for PCC. This extended ab- [5] developed in logic programming1 are proposed as stract reports on experiments which illustrate several is- a basis for PCC. They offer a number of advantages sues involved in abstract interpretation-based certifica- for dealing with the aforementioned issues. In particution. First, we describe the implementation of our sys- lar, the xpressiveness of existing abstract domains will tem in the context of CiaoPP: the preprocessor of the be implicitly available in abstract interpretation-based Ciao multi-paradigm programming system. Then, by code certification to deñne a wide range of safety propermeans of some experiments, we show how code certifi- ties. Furthermore, the approach inherits the automation catión is aided in the implementation of the framework. and inference power of the abstract interpretation en- Finally, we discuss the application of our method within gines used in (Constraint) Logic Programming, (C)LP. the área, of pervasive systems

A Semantic-Based Approach to Attain Reproducibility of Computational Environments in Scientic Work ows: A Case Study

Reproducible research in scientic work ows is often addressed by tracking the provenance of the produced results. While this approach allows inspecting intermediate and nal results, improves understanding, and permits replaying a work ow execution, it does not ensure that the computational environment is available for subsequent executions to reproduce the experiment. In this work, we propose describing the resources involved in the execution of an experiment using a set of semantic vocabularies, so as to conserve the computational environment. We dene a process for documenting the work ow application, management system, and their dependencies based on 4 domain ontologies. We then conduct an experimental evaluation sing a real work ow application on an academic and a public Cloud platform. Results show that our approach can reproduce an equivalent execution environment of a predened virtual machine image on both computing platforms.

The fruits of victory : have our statesmen won the peace our soldiers fought for? /

"Reprinted from the June issue of the U.D.C."

E. D. Morel, the man and his work,

Mode of access: Internet.

Mrs. Wood's novels /

Includes various editions.

Captain Dreams : and other stories /;

Captain Dreams, by Capt. C. King.--The ebb-tide, by Lieut. A.H. Sydenham.--White lilies, by A.K. Hamilton.--A strange wound, by Lieut. W.H. Hamilton.--The story of Alcatraz, by Lieut. A.H. Sydenham.--The other fellow, by R. Monckton-Dene.--Buttons, by Captain J.G. Leefe.

The African problem and the peace settlement /

Bibliographical footnotes.

Conjugate Compositions in Even-Dimensional Affinely Connected Spaces without a Torsion

Let in even-dimensional a±nely connected space without a torsion A2m be given a composition Xm£Xm by the affinor a¯ ®. The affinor b¯ ®, determined with the help of the eigen-vectors of the matrix (a¯ ®), de¯nes the second composition Ym £ Y m. Conjugate compositions are introduced by the condition: the a±nors of any of both compositions transform the vectors from the one position of the composition, generated by the other a±nor, in the vectors from the another its position. It is proved that the compositions de¯ne by a±nors a¯ ® and b¯ ® are conjugate. It is proved also that if the composition Xm£Xm is Cartesian and composition Ym£Y m is Cartesian or chebyshevian, or geodesic than the space A2m is affine.

Common priors for generalized type spaces

The notion of common prior is well-understood and widely-used in the incomplete information games literature. For ordinary type spaces the common prior is defined. Pinter and Udvari (2011) introduce the notion of generalized type space. Generalized type spaces are models for various bonded rationality issues, for nite belief hierarchies, unawareness among others. In this paper we dene the notion of common prior for generalized types spaces. Our results are as follows: the generalization (1) suggests a new form of common prior for ordinary type spaces, (2) shows some quantum game theoretic results (Brandenburger and La Mura, 2011) in new light.

Toxic Legacies, Slow Violence, and Environmental Injustice at Giant Mine, Northwest Territories

For fifty years (1949–99) the now-abandoned Giant Mine in Yellowknife emitted arsenic air and water pollution into the surrounding environment. Arsenic pollution from Giant Mine had particularly acute health impacts on the nearby Yellowknives Dene First Nation (YKDFN), who were reliant on local lakes, rivers, and streams for their drinking water, in addition to frequent use of local berries, garden produce, and medicine plants. Currently, the Canadian government is undertaking a remediation project at Giant Mine to clean up contaminated soils and tailings on the surface and contain 237,000 tonnes of arsenic dust that are stored underground at the Giant Mine. Using documentary sources and statements of Yellowknives Dene members before various public hearings on the arsenic issue, this paper examines the history of arsenic pollution at Giant Mine as a form of “slow violence,” a concept that reconfigures the arsenic issue not simply as a technical problem, but as a historical agent of colonial dispossession that alienated an Indigenous group from their traditional territory. The long-term storage of arsenic at the former mine site means the effects of this slow violence are not merely historical, but extend to the potentially far distant future.