Modal logics have found applications in many diferent contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus. Here we investigate the extension of modal logics with propositional quantification modulo bisimulation (bisimulation quantification). We extend existing work on bisimulation quantified modal logic by considering the variety of logics that result by restricting the structures over which they are interpreted. We show this can be a natural extension of modal logic preserving the intuitions of both modal logic and propositional quantification. However, we also find cases where such intuitions are not preserved. We examine cases where the axioms of pure modal logic and propositional quantification are preserved and where bisimulation quantifiers preserve the decidability of modal logic. We translate a number of recent decidability results for monadic second-order logics into the context of bisimulation quantified modal logics, and show how these results can be used to generate a number of interesting bisimulation quantified modal logics.

<p>In this thesis we prove a strong conceptual completeness result for first-order continuous logic. Strong conceptual completeness was proved in 1987 by Michael Makkai for classical first-order logic, and states that it is possible to recover a first-order theory T by looking at functors originating from the category Mod(T) of its models. </p> <p> We then give a brief account of simple theories in continuous logic, and give a proof that the characterization of simple theories using dividing holds in continuous structures. These results are a specialization of well established results for thick cats which appear in [Ben03b] and in [Ben03a].</p> <p> Finally, we turn to the study of non-archimedean Banach spaces over non-trivially valued fields. We give a natural language and axioms to describe them, and show that they admit quantifier elimination, and are N0-stable. We also show that the theory of non-archimedean Banach spaces has only one N 1-saturated model in any cardinality. </p> / Thesis / Doctor of Philosophy (PhD)

No description available.

Esta pesquisa investiga o comportamento sintático dos quantificadores flutuantes no português brasileiro (PB), dentro do modelo teórico do Programa Minimalista (Chomsky 1995) da Sintaxe Gerativa, buscando atingir dois objetivos principais: (i) identificar as posições na sentença em que os quantificadores podem ou não flutuar e (ii) identificar a estrutura sintagmática interna das expressões quantificadas. Com Sportiche (1988) assumimos que a flutuação de quantificadores é derivada por movimentos sintáticos e com Valmala Elguea (2008) assumimos que este fenômeno é relacionado ao conteúdo informacional da sentença. Dessa forma, adotamos a cartografia de projeções informacionais (de tópico e foco) proposta por Rizzi (1997) para a periferia esquerda alta da sentença e por Belletti (2004) para a periferia esquerda baixa (acima de VP). Argumentando que é preciso distinguir os tipos categoriais dos quantificadores para explicar por que alguns são capazes de flutuar no interior da sentença e outros não, mostramos que os quantificadores que projetam a categoria QP, como cada (um) e todos, são capazes de flutuar, enquanto quantificadores que projetam uma categoria igual ou menor que DP, como muitos, poucos, vários e alguns, são incapazes de flutuar no PB. Mostramos ainda como as diferenças estruturais internas entre todos (cujo DP associado é um complemento de Q0) e cada (um) (cujo DP associado é analisado como um adjunto de QP) podem explicar seu comportamento distinto em relação a algumas possibilidades de flutuação, considerando o cálculo de Minimalidade Relativizada entre QP e DP. A flutuação de quantificadores é | 10 | analisada como resultado da interação entre a estrutura sintagmática interna de cada expressão quantificada e outras propriedades da gramática (universais e específicas da língua) operantes ao longo da derivação e envolvidas sobretudo na checagem de Caso e na satisfação dos Critérios de Tópico e Foco. As possibilidades de flutuação devem respeitar a assimetria entre a periferia esquerda alta e a periferia esquerda baixa do PB em relação ao licenciamento de elementos com ou sem Caso sintático: enquanto DPs, NumPs e NPs que não foram licenciados na sintaxe podem ser superficializados com Caso default na periferia alta, a periferia baixa apenas pode superficializar DPs, NumPs e NPs licenciados antes de Spell-Out. Assumimos que quantificadores de categoria QP, além de poderem ter seu Caso licenciado na sintaxe por checagem, podem se licenciar na superfície por Caso default ou por Transmissão de Caso seja na periferia alta, na periferia baixa ou na posição temática propriedade que lhes garante a capacidade de flutuação. Propomos uma análise uniforme em que estruturas flutuantes e não-flutuantes podem ser geradas a partir de um mesmo constituinte subjacente inserido na posição temática, sendo distintas por seu percurso derivacional. Dessa forma, esta análise simplifica e uniformiza algumas questões presentes na literatura sobre a flutuação de quantificadores. / This research investigates the syntactic behavior of floating quantifiers in Brazilian Portuguese (BP), in the framework of the Minimalist Program (Chomsky 1995), aiming at two main goals: (i) to identify the sentence positions in which quantifiers can or cannot float and (ii) to identify the internal phrase structure of quantified expressions. I assume with Sportiche (1988) that quantifier floating is derived through syntactic movement and with Valmala Elguea (2008) that this phenomenon is related to the informational content of the sentence. Thus, I adopt the cartography of informational projections (topic and focus) proposed by Rizzi (1997) for the high left periphery of the sentence and by Belletti (2004) for the low left periphery (above VP). I argue that in order to explain why some quantifiers are able to float inside the sentence and some are not, it is necessary to distinguish the categorial types of quantifiers. I show that quantifiers that project as QPs, like cada (um) each (one) and todos all, are able to float, whereas quantifiers that project as DPs or lower categories, like muitos many, poucos few, vários several and alguns some, are unable to float in BP. We also show how internal structural differences between todos (whose associate DP is a complement of Q0) and cada (um) (whose associate DP is analyzed as an adjunct of QP) can explain their different behavior regarding some floating possibilities, given the computation of Relativized Minimality between QP and DP. Quantifier floating is analyzed here as the result of the interaction between the internal phrase structure of each quantified expression and other properties of the grammar (both universal and language| 12 | specific), in particular Case-checking and Topic and Focus Criteria. Floating possibilities must respect the asymmetry between the high and the low left peripheries in BP regarding the licensing of elements with or without syntactic Case: whereas DPs, NumPs and NPs that have not been licensed in the syntax can surface with default Case in the high periphery, the low periphery can only host DPs, NumPs and NPs that have already been licensed before Spell- Out. I assume that QP-type quantifiers, besides being able to have their Case licensed in the syntax via Checking, can be licensed on the surface via default Case or Case Transmission regardless of whether they are in the high left periphery, in the low left periphery or in the thematic position which is in fact the property that provides them with the ability to float. We propose a uniform analysis in which both floated and non-floated structures can be generated from the same underlying constituent inserted in the thematic position, being distinguished by their derivational course. Therefore, this analysis simplifies and unifies some issues present in the literature on quantifier floating.

Esta pesquisa investiga o comportamento sintático dos quantificadores flutuantes no português brasileiro (PB), dentro do modelo teórico do Programa Minimalista (Chomsky 1995) da Sintaxe Gerativa, buscando atingir dois objetivos principais: (i) identificar as posições na sentença em que os quantificadores podem ou não flutuar e (ii) identificar a estrutura sintagmática interna das expressões quantificadas. Com Sportiche (1988) assumimos que a flutuação de quantificadores é derivada por movimentos sintáticos e com Valmala Elguea (2008) assumimos que este fenômeno é relacionado ao conteúdo informacional da sentença. Dessa forma, adotamos a cartografia de projeções informacionais (de tópico e foco) proposta por Rizzi (1997) para a periferia esquerda alta da sentença e por Belletti (2004) para a periferia esquerda baixa (acima de VP). Argumentando que é preciso distinguir os tipos categoriais dos quantificadores para explicar por que alguns são capazes de flutuar no interior da sentença e outros não, mostramos que os quantificadores que projetam a categoria QP, como cada (um) e todos, são capazes de flutuar, enquanto quantificadores que projetam uma categoria igual ou menor que DP, como muitos, poucos, vários e alguns, são incapazes de flutuar no PB. Mostramos ainda como as diferenças estruturais internas entre todos (cujo DP associado é um complemento de Q0) e cada (um) (cujo DP associado é analisado como um adjunto de QP) podem explicar seu comportamento distinto em relação a algumas possibilidades de flutuação, considerando o cálculo de Minimalidade Relativizada entre QP e DP. A flutuação de quantificadores é | 10 | analisada como resultado da interação entre a estrutura sintagmática interna de cada expressão quantificada e outras propriedades da gramática (universais e específicas da língua) operantes ao longo da derivação e envolvidas sobretudo na checagem de Caso e na satisfação dos Critérios de Tópico e Foco. As possibilidades de flutuação devem respeitar a assimetria entre a periferia esquerda alta e a periferia esquerda baixa do PB em relação ao licenciamento de elementos com ou sem Caso sintático: enquanto DPs, NumPs e NPs que não foram licenciados na sintaxe podem ser superficializados com Caso default na periferia alta, a periferia baixa apenas pode superficializar DPs, NumPs e NPs licenciados antes de Spell-Out. Assumimos que quantificadores de categoria QP, além de poderem ter seu Caso licenciado na sintaxe por checagem, podem se licenciar na superfície por Caso default ou por Transmissão de Caso seja na periferia alta, na periferia baixa ou na posição temática propriedade que lhes garante a capacidade de flutuação. Propomos uma análise uniforme em que estruturas flutuantes e não-flutuantes podem ser geradas a partir de um mesmo constituinte subjacente inserido na posição temática, sendo distintas por seu percurso derivacional. Dessa forma, esta análise simplifica e uniformiza algumas questões presentes na literatura sobre a flutuação de quantificadores. / This research investigates the syntactic behavior of floating quantifiers in Brazilian Portuguese (BP), in the framework of the Minimalist Program (Chomsky 1995), aiming at two main goals: (i) to identify the sentence positions in which quantifiers can or cannot float and (ii) to identify the internal phrase structure of quantified expressions. I assume with Sportiche (1988) that quantifier floating is derived through syntactic movement and with Valmala Elguea (2008) that this phenomenon is related to the informational content of the sentence. Thus, I adopt the cartography of informational projections (topic and focus) proposed by Rizzi (1997) for the high left periphery of the sentence and by Belletti (2004) for the low left periphery (above VP). I argue that in order to explain why some quantifiers are able to float inside the sentence and some are not, it is necessary to distinguish the categorial types of quantifiers. I show that quantifiers that project as QPs, like cada (um) each (one) and todos all, are able to float, whereas quantifiers that project as DPs or lower categories, like muitos many, poucos few, vários several and alguns some, are unable to float in BP. We also show how internal structural differences between todos (whose associate DP is a complement of Q0) and cada (um) (whose associate DP is analyzed as an adjunct of QP) can explain their different behavior regarding some floating possibilities, given the computation of Relativized Minimality between QP and DP. Quantifier floating is analyzed here as the result of the interaction between the internal phrase structure of each quantified expression and other properties of the grammar (both universal and language| 12 | specific), in particular Case-checking and Topic and Focus Criteria. Floating possibilities must respect the asymmetry between the high and the low left peripheries in BP regarding the licensing of elements with or without syntactic Case: whereas DPs, NumPs and NPs that have not been licensed in the syntax can surface with default Case in the high periphery, the low periphery can only host DPs, NumPs and NPs that have already been licensed before Spell- Out. I assume that QP-type quantifiers, besides being able to have their Case licensed in the syntax via Checking, can be licensed on the surface via default Case or Case Transmission regardless of whether they are in the high left periphery, in the low left periphery or in the thematic position which is in fact the property that provides them with the ability to float. We propose a uniform analysis in which both floated and non-floated structures can be generated from the same underlying constituent inserted in the thematic position, being distinguished by their derivational course. Therefore, this analysis simplifies and unifies some issues present in the literature on quantifier floating.

Des nombreuses applications de méthodes formelles se fondent sur les solveurs SMT pour valider automatiquement les conditions à vérifier et fournissent des certificats de leurs résultats. Nous visons à la fois à améliorer l'efficacité des solveurs SMT et à accroître leur fiabilité. Notre première contribution est un cadre uniforme pour le raisonnement avec des formules quantifiées dans les solveurs SMT, dans lequel généralement diverses techniques d'instanciation sont utilisées. Nous montrons que les principales techniques d'instanciation peuvent être jetées dans ce cadre. Le cadre repose sur le problème de l'E-ground (dis)unification. Nous présentons une procédure de décision pour résoudre ce problème en pratique: Fermeture de congruence avec variables libres (CCFV}). Nous mesurons l'impact de CCFV dans les solveurs SMT veriT et CVC4. Nous montrons que nos implémentations présentent des améliorations par rapport aux approches à la fine pointe de la technologie. Notre deuxième contribution est un cadre pour le traitement des formules tout en produisant des preuves détaillées. Les principaux composants de notre cadre de production de preuve sont un algorithme de récurrence contextuelle générique et un ensemble extensible de règles d'inférence. Avec des structures de données appropriées, la génération des preuves ne crée que des frais généraux linéaires et les vérifications peuvent être vérifiées en temps linéaire. Nous avons également mis en œuvre l'approche en veriT. Cela nous a permis de simplifier considérablement la base du code tout en augmentant le nombre de problèmes pour lesquels des preuves détaillées peuvent être produites / In many formal methods applications it is common to rely on SMT solvers to automatically discharge conditions that need to be checked and provide certificates of their results. In this thesis we aim both to improve their efficiency of and to increase their reliability. Our first contribution is a uniform framework for reasoning with quantified formulas in SMT solvers, in which generally various instantiation techniques are employed. We show that the major instantiation techniques can be all cast in this unifying framework. Its basis is the problem of E-ground (dis)unification, a variation of the classic rigid E-unification problem. We introduce a decision procedure to solve this problem in practice: Congruence Closure with Free Variables (CCFV). We measure the impact of optimizations and instantiation techniques based on CCFV in the SMT solvers veriT and CVC4, showing that our implementations exhibit improvements over state-of-the-art approaches in several benchmark libraries stemming from real world applications. Our second contribution is a framework for processing formulas while producing detailed proofs. The main components of our proof producing framework are a generic contextual recursion algorithm and an extensible set of inference rules. With suitable data structures, proof generation creates only a linear-time overhead, and proofs can be checked in linear time. We also implemented the approach in veriT. This allowed us to dramatically simplify the code base while increasing the number of problems for which detailed proofs can be produced

Face à une méconnaissance de la variabilité intraspécifique des traits fonctionnels végétaux, ce travail visait à la quantifier, comprendre le rôle des gradients environnementaux sur celle-ci, quantifier son importance relative vis-à-vis de la variabilité interspécifique et tester son impact sur le calcul d'indices de diversité fonctionnelle et un modèle de dynamique de la végétation. Suivant une stratégie d'échantillonnage stratifiée et hiérarchique, nous avons collecté des traits sur seize espèces communes d'une vallée alpine française. Nous avons montré qu'il existait une forte variabilité intraspécifique des traits. Celle-ci était plus faible que la variabilité interspécifique, mais non négligeable, elle résultait en partie d'effets environnementaux, pouvait être expliquée par les modèles d'habitat de chaque espèce et modifiait fortement le calcul des indices de diversité fonctionnelle. En conclusion la variabilité fonctionnelle intraspécifique devrait être plus souvent considérée.

In 2009, Cobb County School District (CCSD) and Georgia Institute of Technology (Georgia Tech) received a competitive federal grant to implement an idle and tailpipe emission reduction program in the CCSD bus fleet. The project is designed to reduce school bus idling by installing GPS and idle detection systems in the bus, providing bus dispatchers with a web system to track vehicle activity and idling in real-time, and to automatically shut off the engine when idle thresholds at specific locations are exceeded. A team of Georgia Tech researchers is implementing the anti-idle program and estimating the emissions and fuel savings from the project using approved modeling methods. This thesis presents the results of the emission modeling process, as well as an analysis of baseline school bus idling activity. EPA's MOVES mobile source emission model was used to develop emission rates for school buses for each operating mode, which are defined by the instantaneous vehicle speed, acceleration and scaled tractive power. Local data for Cobb County and Atlanta were collected and input into the MOVES model. The pollutants modeled include carbon dioxide, carbon monoxide, particulate matter (coarse and fine), oxides of nitrogen, and gaseous hydrocarbons. The vehicle activity data collected through the GPS and communications equipment installed in the buses were classified into the operating mode bins for each second of recorded data, and multiplied by the corresponding emission rate to determine the total modal emissions before and after project implementation. Preliminary results suggest that thousands of gallons of diesel fuel and thousands of dollars can be saved with the project, improving overall fleet fuel efficiency by 2%, as well as reducing emissions in some categories by as much as 38%.

Thesis (MA)--Stellenbosch University, 2001. / ENGLISH ABSTRACT: The visual landscape is a resource that should be managed sustainably. Sufficient tools for the effective management of visual landscapes are still lacking. Existing visualization software (including 3D Analyst) could be utilized as an aid in visual landscape management, but as such it lacks quantification functionalities. Geographical Information Systems (GIS) could effectively be used in the quantification of visual landscapes. The composition, value and experience of visual landscapes are complex and interrelated. Visual landscapes should be divided into physical and cognitive elements for management purposes. In the quantification of visual landscapes, the physical elements are effectively handled within a GIS. Insufficient research though, hampers the quantification of the visual landscape in terms of cognitive elements. Arc View GIS, including the 3D Analyst Extension, can be extended to quantify visual landscapes. Arc View's integrated development language, Avenue, was used to develop a new technique, namely The Visual Landscape Quantifier (VLQ). The VLQ-technique is an application based on a virtual landscape where a user can select observation and target locations. These locations are used to quantify the visual landscape in a chosen direction. Results are expressed as the percentage (%) of the visible land use in the selected visual landscape. The user can choose whether the results should be displayed as a list or as a graph. Wanted and unwanted elements in the landscape could be identified, aiding the management and planning of landscapes. Keywords: Visual landscape, landscape, Visual Landscape Quantifier, visualization, Arc View GIS, Avenue, Object Oriented Programming, 3D Analyst. / AFRIKAANSE OPSOMMING: Die visuele landskap is 'n hulpbron wat volhoubaar bestuur moet word, maar ongelukkig bestaan daar mm instrumente om dit effektief te bestuur. Bestaande visualiseringsprogrammatuur (insluitend Arc View 3D Analyst) kan as hulpmiddel dien in die bestuur van visuele landskappe, maar dit ontbreek kwantifiseringsfunksionaliteite. Geografiese Inligtingstelsels (GIS) kan effektief aangewend word in die kwantifisering van visuele landskappe. Die samestelling, waarde en hoe visuele landskappe ervaar word, is kompleks en interverwant. Om visuele landskappe meetbaar te maak, moet dit in fisiese en kognitiewe elemente opgebreek word. GIS hanteer die fisiese elemente van visuele landskappe effektief en gevolglik is die kwantifisering daarvan (in GIS) wel moontlik. Onvoldoende navorsing maak die kwantifisering van visuele landskappe, in terme van kognitiewe elemente, egter moeilik. ArcView GIS, insluitend die 3D Analyst-uitbreiding, kan aangepas word om visuele landskappe te kwantifiseer. 'n Nuwe tegniek, die Visual Landscape Quantifier (VLQ), is met ArcView se geïntegreerde programmeertaal, Avenue, ontwikkel. Die VLQ-tegniek berus op 'n virtuele landskap waarbinne die gebruiker toegelaat word om waarnemers- en teikenliggings te selekteer. As toepassing word die visuele landskap in die gekose rigting in terme van die persentasie (%) van sigbare grondgebruik in die geselekteerde landskap gekwantifiseer. Die gebruiker kan kies of die resultaat as 'n lys of as 'n grafiek voorgestel moet word. Moontlike gewenste of ongewenste elemente in die visuele landskap kan gevolglik geïdentifiseer word en so die bestuurs- en beplanningstaak ondersteun. Sleutelwoorde: Visuele landskap, landskap, Visual Landscape Quantifier, visualisering, ArcView GIS, Avenue, 3D Analyst, Object Oriented Programmering.

L'auteur n'a pas fourni de résumé en français / The end of chip frequency scaling capacity, due heat dissipation limitations, made manufacturers search for an alternative to sustain the processing capacity growth. The chosen solution was to increase the hardware parallelism, by packing multiple independent processors in a single chip, in a Multiple-Instruction Multiple-Data (MIMD) fashion, each with special instructions to operate over a vector of data, in a Single-Instruction Multiple-Data (SIMD) manner. Such paradigm change, brought to software developer the convoluted task of producing efficient and scalable applications. Programming languages and associated tools evolved to aid such task for new developed applications. But automated optimizations capable of coping with such a new complex hardware, from legacy, single threaded applications, is still lacking.To apply code transformations, either developers or compilers, require to assert that, by doing so, they are not changing the expected comportment of the application producing unexpected results. But syntactically poor codes, such as use of pointer parameters with multiple possible indirections, complex loop structures, or incomplete codes, make very hard to extract application behavior solely from the source code in what is called a static analyses. To cope with the lack of information extracted from the source code, many tools and research has been done in, how to use dynamic analyses, that does application profiling based on run-time information, to fill the missing information. The combination of static and dynamic information to characterize an application are called hybrid analyses. This works advocates for the use of hybrid analyses to be able to optimizations on loops, regions where most of computations are done. It proposes a framework capable of statically applying some complex loop transformations, that previously would be considered unsafe, by assuring their safe use during run-time with a lightweight test.The proposed framework uses application execution profiling to help the static loop optimizer to: 1) identify and classify program hot-spots, so as to focus only on regions vital for the execution time; 2) guide the optimizer in understanding the overall loop behavior, so as to reduce the valid loop transformations search space; 3) using instruction's memory access functions, it statically builds a lightweight run-time test that determine, based on the program parameters values, if a given optimization is safe to be used or not. It's applicability is shown by performing complex loop transformations into a variety of loops, obtained from applications of different fields, and demonstrating that the run-time overhead is insignificant compared to the loop execution time or gained performance, in the vast majority of cases.