Στα πλαίσια της παρούσας διπλωματικής εργασίας συλλέχθηκαν τα μετεωρολογικά δεδομένα της ευρύτερης περιοχής του Αιγίου, διεξήχθησαν μηνιαίες μετρήσεις στάθμης ενώ κατά τον Οκτώβριο του 2008 έγινε δειγματοληψία νερού από πηγάδια της περιοχής, με στόχο να μελετηθούν οι υδρογεωλογικές και υδροχημικές συνθήκες που επικρατούν στην περιοχή και να καθοριστούν οι παράμετροι του υδρολογικού ισοζυγίου. Η περιοχή μελέτης ανήκει στον νομό Αχαΐας και αποτελεί τμήμα της Κορινθιακής Τάφρου. Το υπόβαθρο της περιοχής δομείται από τους σχηματισμούς της ζώνης Ωλονού-Πίνδου που έχουν επιφανειακή εμφάνιση σε υψηλότερα υψόμετρα, ενώ το πεδινό τμήμα της περιοχής καλύπτεται Πλειο-Πλειστοκαινικούς και Τεταρτογενής σχηματισμούς. Ο συντελεστής εξατμισοδιαπνοής για την περιοχή έρευνας έχει τιμή 0,77 και το πλεόνασμα νερού εμφανίζεται τους μήνες Ιανουάριο έως Μάρτιο, Νοέμβριο και Δεκέμβριο. Η μεγαλύτερη διακύμανση της στάθμης του υδροφόρου παρατηρείται στα 1,15 (m) και η υδραυλική κλίση που υπολογίστηκε κυμαίνεται από 4‰ ‐6‰. Τέλος τα υπόγεια νερά της περιοχής είναι δυνατόν να ομαδοποιηθούν σε δυο κύριους υδροχημικούς τύπους Ca‐HCO3 και Ca-Mg‐Na‐SO4‐HCO3. / In the frames of this study the climatological data of the broader area of Aigion were collected. Moreover, water level measurements and groundwater sampling has been carried out in order to define the hydrochemical and hydrogeological that prevail in the study area. The water balance of the area was also estimated. The study area is located in Achaia prefecture and consists a part of the Corinth Trench. The bedrock of the study area consists of the formations of Olonos-Pindos zone that out crop in the mountainous part, whereas the Neogene and Quaternary formations cover the lowlands of the study area. The evaporotranspiration coefficient is 0.77 and there is a surplus of water during the periods January-March and November-December. The highest variance of water level of the aquifer was 1.15 (m) and the hydraulic gradient ranges between 4‰ ‐6‰. Finally, the groundwater samples of the study area can be classified into two hydrochemical types Ca‐HCO3 και Ca-Mg‐Na‐SO4‐HCO3.

Le but principal de cette thèse est de définir une extension de la traduction de double-négation de Gödel à tous les types tronqués, dans le contexte de la théorie des types homotopique. Ce but utilisera des théories déjà existantes, comme la théorie des faisceaux de Lawvere-Tierney, quenous adapterons à la théorie des types homotopiques. En particulier, on définira le fonction de faisceautisation de Lawvere-Tierney, qui est le principal théorème présenté dans cette thèse.Pour le définir, nous aurons besoin de concepts soit déjà définis en théorie des types, soit non existants pour l’instant. En particulier, on définira une théorie des colimits sur des graphes, ainsi que leur version tronquée, et une notion de modalités tronquées basée sur la définition existante de modalité.Presque tous les résultats présentés dans cette thèse sont formalisée avec l’assistant de preuve Coq, muni de la librairie [HoTT/Coq] / The main goal of this thesis is to define an extension of Gödel not-not translation to all truncated types, in the setting of homotopy type theory. This goal will use some existing theories, like Lawvere-Tierney sheaves theory in toposes, we will adapt in the setting of homotopy type theory. In particular, we will define a Lawvere-Tierney sheafification functor, which is the main theorem presented in this thesis.To define it, we will need some concepts, either already defined in type theory, either not existing yet. In particular, we will define a theory of colimits over graphs as well as their truncated version, and the notion of truncated modalities, based on the existing definition of modalities.Almost all the result presented in this thesis are formalized with the proof assistant Coq together with the library [HoTT/Coq]

Identification of ignitable liquids in fire debris analysis using pattern recognition is an important step in determining the nature of a suspicious fire. Complex mixtures that make up ignitable liquids are susceptible to microbial degradation when fire debris evidence is presented in the form of soil. Microbial degradation results in a selective metabolism of certain classes of compounds required for identification of an ignitable liquid. Various ignitable liquids that may be used to initiate or propagate a fire contain different classes of organic compounds. These include normal alkanes, branched alkanes, cycloalkanes, aromatics, terpenes, and others. In this work, microbial degradation of nine ignitable liquids in soil was evaluated over a period of twenty-six days. The degradation of aromatic compounds in gasoline was faster with toluene and C2-alkylbenzenes than in C3-alkylbenzenes. However, the overall loss of aromatics made gasoline chromatographically unidentifiable. The complete loss of n-alkanes in medium and petroleum distillates resulted in patterns that resembled naphthenic-paraffinic products. Normal alkanes were more susceptible to microbial degradation than isoalkanes, which was specifically demonstrated in medium and heavy petroleum distillates. In diesel, pristane and phytane remained prominent in comparison to the normally prevalent n-alkanes, which could no longer be detected post-degradation. The degradation of isoalkanes and cycloalkanes was evaluated in a naphthenic-paraffinic product. Isoalkanes were degraded significantly faster than cycloalkanes. The remaining peaks in the naphthenic-paraffinic pattern consisted solely of cycloalkane compounds, and could no longer be classified as a naphthenic-paraffinic product. The terpene compounds in turpentine were also observed to be susceptible to degradation by microorganisms. The loss of !-pinene, limonene, and camphene was significantly noticeable in comparison to other terpene compounds, such as 1,4-cineole. Microbial biodegradation in different soil types was investigated. The difference in soil texture can affect the rate of metabolism of ignitable liquids due to the variance of available oxygen, nutrients and mobility of the microbial population. The degradation of isoalkanes, cycloalkanes, aromatics and heavier normal alkanes was faster in clay, whereas normal alkanes of lower molecular weight were degraded more readily in sand. There has been no explanation of this occurrence within the scientific literature, however it could be hypothesized that the difference in microbial flora and water saturation levels could affect the selective degradation between the two soil types. Fire debris evidence is often stored for long periods of time before analysis due to case backlogs. The storage condition of arson-related soil samples is a sensitive subject. If evidence, containing soil, is stored at room temperature, petroleum compounds in any ignitable liquid residues that are present will be degraded within a week. Therefore, it is important to freeze or refrigerate soil samples. The storage of both refrigerated and frozen soil samples containing gasoline were evaluated over six months. Less than 6% of the aromatic compounds distinctive of gasoline remained when stored at 5 °C, while minimal change was observed in the same compounds when stored at -15 °C. Microbial degradation of petroleum-based ignitable liquids is advantageous from the environmental perspective. However, within the forensic community the effect of microbial action could lead to misclassification or inability to identify the presence of an ignitable liquid in fire debris evidence.

We study the interplay between dependent types and computational effects, two important areas of modern programming language research. On the one hand, dependent types underlie proof assistants such as Coq and functional programming languages such as Agda, Idris, and F*, providing programmers a means for encoding detailed specifications of program behaviour using types. On the other hand, computational effects, such as exceptions, nondeterminism, state, I/O, probability, etc., are integral to all widely-used programming languages, ranging from imperative languages, such as C, to functional languages, such as ML and Haskell. Separately, dependent types and computational effects both come with rigorous mathematical foundations, dependent types in the effect-free setting and computational effects in the simply typed setting. Their combination, however, has received much less attention and no similarly exhaustive theory has been developed. In this thesis we address this shortcoming by providing a comprehensive treatment of the combination of these two fields, and demonstrating that they admit a mathematically elegant and natural combination. Specifically, we develop a core effectful dependently typed language, eMLTT, based on Martin-L¨of’s intensional type theory and a clear separation between (effect-free) values and (possibly effectful) computations familiar from simply typed languages such as Levy’s Call-By-Push-Value and Egger et al.’s Enriched Effect Calculus. A novel feature of our language is the computational S-type, which we use to give a uniform treatment of type-dependency in sequential composition. In addition, we define and study a class of category-theoretic models, called fibred adjunction models, that are suitable for defining a sound and complete interpretation of eMLTT. Specifically, fibred adjunction models naturally combine standard category-theoretic models of dependent types (split closed comprehension categories) with those of computational effects (adjunctions). We discuss and study various examples of these models, including a domain-theoretic model so as to extend eMLTT with general recursion. We also investigate a dependently typed generalisation of the algebraic treatment of computational effects by showing how to extend eMLTT with fibred algebraic effects and their handlers. In particular, we specify fibred algebraic effects using a dependently typed generalisation of Plotkin and Pretnar’s effect theories, enabling us to capture precise notions of computation such as state with location-dependent store types and dependently typed update monads. For handlers, we observe that their conventional term-level definition leads to unsound program equivalences becoming derivable in languages that include a notion of homomorphism, such as eMLTT. To solve this problem, we propose a novel type-based treatment of handlers via a new computation type, the user-defined algebra type, which pairs a value type (the carrier) with a family of value terms (the operations). This type internalises Plotkin and Pretnar’s insight that handlers denote algebras for a given equational theory of computational effects. We demonstrate the generality of our type-based treatment of handlers by showing that their conventional term-level presentation can be routinely derived, and this treatment provides a useful mechanism for reasoning about effectful computations. Finally, we show that these extensions of eMLTT can be soundly interpreted in a fibred adjunction model based on the families of sets fibration and models of Lawvere theories.

Inclusion is a term that, although seeming to have a commonly understood meaning, has changed its conceptual focus over the past 50 years. These changes emerge from the national shift in values and policy away from welfarism to post-welfarism and, more recently, austerity-as-ideology (Ignagni et al., 2015) - changes which have affected the societal territory, and the type of citizen into which inclusion is seen to be desirable. The effect on its application to primary schools has been to move away from a welfarist diversity discourse, in which opportunities were opened up for all children through a universalised education system, to the actuarial elitism of a standards discourse of post-welfarism, embodied in the form of National Curriculum learning expectations. It is the balancing of these two discourses within the context of three case-study primary schools that is the central focus of this research. It employs a mixed-method approach to gather data from children, staff and school leaders – including the use of photography to capture meanings of inclusion. It also uses a conceptual framework constructed from the canon of work of Pierre Bourdieu as the basis for interpreting and analysing the contextual uniqueness of inclusion within these schools. The research considers some overarching themes that arise from this analysis: inclusion as a means of social justice as it changed over the past 50 years to become synonymous with social mobility; the struggles of school leaders to find leadership pathways through the ‘tug’ of each discourse; the changing nature of citizenship and its effect upon inclusion as a means of induction into it and how this has impacted upon categorisations of children. Key to this has been the changing relationship between agent (child) and structure (school and government policy) with the latter currently demanding the compliance and conformity of the former. It is here that the current use of the term inclusion is misplaced, for it implies the integration of children into a structured system. It is this ‘messiness’ and confusion around the concept of inclusion that this research aims to clarify.

This thesis deals with the currently effective legislation on types of shares, which is still relatively new in the Czech Republic as the recodification took place approximately four years ago. The main act that is a subject to the examination of this thesis is the Act no. 90/2012 Coll., on Commercial Companies and Cooperatives (The Business Corporation Act), which provides the main regulation of shares. The aim of this thesis is to find out limits that restrict the contracting autonomy, which was widely broadened with the recodification of the Czech private law, in the process of creating different types of shares. The thesis is divided into four main chapters. First chapter introduces the shares as a type of securities or book-entry securities along with the main characteristics of a share. It also defines an important term for this thesis - the type of share - and the basic types of shares recognized explicitly by the Business Corporation Act. The second chapter concerns with the construction of the types of shares and its limits. It describes the contracting autonomy - one of the main principles of the private law - and different limits of this liberty. These include basic principles of the private law, commercial law principles and company law principles, the provisions of the Civil Code and...

A linguagem C não provê segurança espacial de memória: não garante que a memória acessada através de um ponteiro para um objeto, tal como um vetor, de fato pertence ao objeto em questão. Em vez disso, o programador é responsável por gerenciar informações de alocações e limites, e garantir que apenas acessos válidos à memória são realizados pelo programa. Por um lado, isso provê flexibilidade: o programador tem controle total sobre o layout dos dados em memória, e sobre o momento em que verificações são realizadas. Por outro lado, essa é uma fonte frequente de erros e vulnerabilidades de segurança em programas C. Diversas técnicas já foram propostas para prover segurança de memória em C. Tipicamente tais sistemas mantêm suas próprias informações de limites e instrumentam o programa para garantir que a segurança de memória não seja violada. Isso causa uma série de inconvenientes, tais como mudanças no layout de memória de estruturas de dados, quebrando assim a compatibilidade binária com bibliotecas externas, e/ou um aumento no consumo de memória. Uma abordagem diferente consiste em usar tipos dependentes para descrever a informação de limites já latente em programas C e assim permitir que o compilador use essa informação para garantir a segurança espacial de memória. Embora tais sistemas tenham sido propostos no passado, eles estão atrelados especificamente à linguagem C. Outras linguagens, como C++, sofrem de problemas similares de segurança de memória, e portanto poderiam se beneficiar de uma abordagem mais independente de linguagem. Este trabalho propõe Týr, uma transformação de código baseada em tipos dependentes para garantir a segurança espacial de memória de programas C ao nível LLVM IR. O sistema permite que o programador descreva no nível dos tipos as relações entre pointeiros e informação de limites já presente em programas C. Dessa maneira, Týr provê segurança espacial de memória verificando o uso consistente desses metadados pré-existentes, através de verificações em tempo de execução inseridas no programa guiadas pela informação de tipos dependentes. Ao trabalhar no nível mais baixo do LLVM IR, Týr tem por objetivo ser usável como uma fundação para segurança espacial de memória que possa ser facilmente estendida no futuro para outras linguagens compiláveis para LLVM IR, tais como C++ e Objective C. Demonstramos que Týr é eficaz na proteção contra violações de segurança espacial de memória, com um overhead de tempo de execução relativamente baixo e de consumo de memória próximo de zero, atingindo assim um desempenho competitivo com outros sistemas para segurança espacial de memória de uma maneira mais independente de linguagem. / The C programming language does not enforce spatial memory safety: it does not ensure that memory accessed through a pointer to an object, such as an array, actually belongs to that object. Rather, the programmer is responsible for keeping track of allocations and bounds information and ensuring that only valid memory accesses are performed by the program. On the one hand, this provides flexibility: the programmer has full control over the layout of data in memory, and when checks are performed. On the other hand, this is a frequent source of bugs and security vulnerabilities in C programs. A number of techniques have been proposed to provide memory safety in C. Typically such systems keep their own bounds information and instrument the program to ensure that memory safety is not violated. This has a number of drawbacks, such as changing the memory layout of data structures and thus breaking binary compatibility with external libraries and/or increased memory usage. A different approach is to use dependent types to describe the bounds information already latent in C programs and thus allow the compiler to use that information to enforce spatial memory safety. Although such systems have been proposed before, they are tied specifically to the C programming language. Other languages such as C++ suffer from similar memory safety problems, and thus could benefit from a more language-agnostic approach. This work proposes Týr, a program transformation based on dependent types for ensuring spatial memory safety of C programs at the LLVM IR level. It allows programmers to describe at the type level the relationships between pointers and bounds information already present in C programs. In this way, Týr ensures spatial memory safety by checking the consistent usage of this pre-existing metadata, through run-time checks inserted in the program guided by the dependent type information. By targeting the lower LLVM IR level, Týr aims to be usable as a foundation for spatial memory which could be easily extended in the future to other languages that can be compiled to LLVM IR, such as C++ and Objective C. We show that Týr is effective at protecting against spatial memory safety violations, with a reasonably low execution time overhead and nearly zero memory consumption overhead, thus achieving performance competitive with other systems for spatial memory safety, in a more language-agnostic way.

Made available in DSpace on 2014-10-09T12:26:13Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:10:32Z (GMT). No. of bitstreams: 0 / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / Dissertacao (Mestrado) / IPEN/D / Instituto de Pesquisas Energeticas e Nucleares - IPEN-CNEN/SP / FAPESP:05/58301-0

A linguagem C não provê segurança espacial de memória: não garante que a memória acessada através de um ponteiro para um objeto, tal como um vetor, de fato pertence ao objeto em questão. Em vez disso, o programador é responsável por gerenciar informações de alocações e limites, e garantir que apenas acessos válidos à memória são realizados pelo programa. Por um lado, isso provê flexibilidade: o programador tem controle total sobre o layout dos dados em memória, e sobre o momento em que verificações são realizadas. Por outro lado, essa é uma fonte frequente de erros e vulnerabilidades de segurança em programas C. Diversas técnicas já foram propostas para prover segurança de memória em C. Tipicamente tais sistemas mantêm suas próprias informações de limites e instrumentam o programa para garantir que a segurança de memória não seja violada. Isso causa uma série de inconvenientes, tais como mudanças no layout de memória de estruturas de dados, quebrando assim a compatibilidade binária com bibliotecas externas, e/ou um aumento no consumo de memória. Uma abordagem diferente consiste em usar tipos dependentes para descrever a informação de limites já latente em programas C e assim permitir que o compilador use essa informação para garantir a segurança espacial de memória. Embora tais sistemas tenham sido propostos no passado, eles estão atrelados especificamente à linguagem C. Outras linguagens, como C++, sofrem de problemas similares de segurança de memória, e portanto poderiam se beneficiar de uma abordagem mais independente de linguagem. Este trabalho propõe Týr, uma transformação de código baseada em tipos dependentes para garantir a segurança espacial de memória de programas C ao nível LLVM IR. O sistema permite que o programador descreva no nível dos tipos as relações entre pointeiros e informação de limites já presente em programas C. Dessa maneira, Týr provê segurança espacial de memória verificando o uso consistente desses metadados pré-existentes, através de verificações em tempo de execução inseridas no programa guiadas pela informação de tipos dependentes. Ao trabalhar no nível mais baixo do LLVM IR, Týr tem por objetivo ser usável como uma fundação para segurança espacial de memória que possa ser facilmente estendida no futuro para outras linguagens compiláveis para LLVM IR, tais como C++ e Objective C. Demonstramos que Týr é eficaz na proteção contra violações de segurança espacial de memória, com um overhead de tempo de execução relativamente baixo e de consumo de memória próximo de zero, atingindo assim um desempenho competitivo com outros sistemas para segurança espacial de memória de uma maneira mais independente de linguagem. / The C programming language does not enforce spatial memory safety: it does not ensure that memory accessed through a pointer to an object, such as an array, actually belongs to that object. Rather, the programmer is responsible for keeping track of allocations and bounds information and ensuring that only valid memory accesses are performed by the program. On the one hand, this provides flexibility: the programmer has full control over the layout of data in memory, and when checks are performed. On the other hand, this is a frequent source of bugs and security vulnerabilities in C programs. A number of techniques have been proposed to provide memory safety in C. Typically such systems keep their own bounds information and instrument the program to ensure that memory safety is not violated. This has a number of drawbacks, such as changing the memory layout of data structures and thus breaking binary compatibility with external libraries and/or increased memory usage. A different approach is to use dependent types to describe the bounds information already latent in C programs and thus allow the compiler to use that information to enforce spatial memory safety. Although such systems have been proposed before, they are tied specifically to the C programming language. Other languages such as C++ suffer from similar memory safety problems, and thus could benefit from a more language-agnostic approach. This work proposes Týr, a program transformation based on dependent types for ensuring spatial memory safety of C programs at the LLVM IR level. It allows programmers to describe at the type level the relationships between pointers and bounds information already present in C programs. In this way, Týr ensures spatial memory safety by checking the consistent usage of this pre-existing metadata, through run-time checks inserted in the program guided by the dependent type information. By targeting the lower LLVM IR level, Týr aims to be usable as a foundation for spatial memory which could be easily extended in the future to other languages that can be compiled to LLVM IR, such as C++ and Objective C. We show that Týr is effective at protecting against spatial memory safety violations, with a reasonably low execution time overhead and nearly zero memory consumption overhead, thus achieving performance competitive with other systems for spatial memory safety, in a more language-agnostic way.

Made available in DSpace on 2014-10-09T12:26:13Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:10:32Z (GMT). No. of bitstreams: 0 / Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) / A análise de tintas e papéis é de grande interesse para a ciência e a interação tinta-papel é importante em vários níveis. A análise da tinta de um documento é extremamente importante para o estudo de diferentes aspectos, como adulterações e determinação da recentidade. Esses aspectos podem ser estudados analisando a tinta e o papel tanto fisicamente quanto quimicamente. Portanto, o desenvolvimento de uma técnica para a análise de tintas de caneta esferográfica e a determinação da recentidade de um documento é interessante para a Ciência Forense. No Brasil, cientistas forenses enfrentam todos os dias diversos casos que requerem a análise de tintas de caneta esferográfica, e não se tem nenhuma técnica onde a determinação da idade de uma tinta é possível. Os casos mais comuns onde há a necessidade da recentidade de um documento são fraudes em recibos de pagamento e de quitação de dívidas, preenchimento e assinatura de contratos, adulteração em documentos e em cheques. Neste trabalho, é discutida uma nova metodologia para a análise de tintas de canetas esferográficas e a sua utilização na determinação da recentidade de uma amostra de tinta de caneta esferográfica. Foram analisadas periodicamente amostras provenientes de diferentes países, como Estados Unidos, Canadá, Peru, Japão, Espanha e Grécia. Com os resultados obtidos, foram construídas curvas de degradação do solvente em função do tempo de preparo. Com as curvas, obtiveram-se as equações logarítmicas relativas. As equações propostas mostraram ser capazes de distinguir a idade relativa de uma tinta, com 20% de variação em relação ao valor teórico. Portanto, a principal conclusão deste trabalho é a metodologia proposta pode ser utilizada para determinar a idade relativa de uma tinta de caneta esferográfica. / Dissertacao (Mestrado) / IPEN/D / Instituto de Pesquisas Energeticas e Nucleares - IPEN-CNEN/SP / FAPESP:05/58301-0