To see the other types of publications on this topic, follow the link: Types of intersections.
Dissertations / Theses on the topic 'Types of intersections'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Types of intersections.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
SAYAG, EMILIE. "Types intersections simples." Paris 7, 1997. http://www.theses.fr/1997PA077286.
Full textAbstract:
Le typage statique polymorphe est un trait majeur des langages fonctionnels tels que ml. Cependant, les liens entre les types statiques polymorphes inferes par le compilateur et les types dynamiques en cours d'execution est un probleme important pour le developpement de ces langages, par exemple pour des outils de mise au point des programmes. Afin d'apporter un cadre theorique a ce probleme, nous etudions la relation entre inference de type et beta-reduction a travers l'etude complete d'un nouveau systeme de types intersections, appeles types intersections simples. En effet, les systemes de types intersections permettent de typer une large classe de lambda-termes, et semblent donc suffisamment expressifs pour servir de base a l'etude de la reconstruction dynamique de types. Nous commencons par montrer que notre systeme de types possede les proprietes les plus importantes des systemes de types intersections classiques : caracterisation des termes normalisables et normalisables en tete, correction par rapport a un modele de termes, existence d'un type principal pour les lambda-termes normalisables. Nous donnons ensuite une description detaillee de la structure des types principaux, puis un algorithme de reconstruction d'une forme normale a partir d'un type principal. Nous prouvons ainsi l'equivalence entre formes normales et types principaux. La connaissance de la structure des types principaux nous permet alors de simplifier la definition de l'operation d'expansion et de justifier theoriquement cette definition. Nous proposons enfin un semi-algorithme d'inference base sur une reecriture des types. Cette reecriture met en evidence l'equivalence entre l'inference de types et la beta-reduction, puisqu'alors inferer un type pour un lambda-terme revient a mettre un type en forme normale et donc a simuler la normalisation du lambda-terme.
2
Vial, Pierre. "Opérateurs de typage non-idempotents, au delà du lambda-calcul." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCC038/document.
Full textAbstract:
L'objet de cette thèse est l'extension des méthodes de la théorie des types intersections non-idempotents, introduite par Gardner et de Carvalho, à des cadres dépassant le lambda-calcul stricto sensu.- Nous proposons d'abord une caractérisation de la normalisation de tête et de la normalisation forte du lambda-mu calcul (déduction naturelle classique) en introduisant des types unions non-idempotents. Comme dans le cas intuitionniste, la non-idempotence nous permet d'extraire du typage des informations quantitatives ainsi que des preuves de terminaison beaucoup plus élémentaires que dans le cas idempotent. Ces résultats nous conduisent à définir une variante à petits pas du lambda-mu-calcul, dans lequel la normalisation forte est aussi caractérisée avec des méthodes quantitatives. - Dans un deuxième temps, nous étendons la caractérisation de la normalisation faible dans le lambda-calcul pur à un lambda-calcul infinitaire étroitement lié aux arbres de Böhm et dû à Klop et al. Ceci donne une réponse positive à une question connue comme le problème de Klop. À cette fin, il est nécessaire d'introduire conjointement un système (système S) de types infinis utilisant une intersection que nous qualifions de séquentielle, et un critère de validité servant à se débarrasser des preuves dégénérées auxquelles les grammaires coinductives de types donnent naissance. Ceci nous permet aussi de donner une solution au problème n°20 de TLCA (caractérisation par les types des permutations héréditaires). Il est à noter que ces deux problèmes n'ont pas de solution dans le cas fini (Tatsuta, 2007).- Enfin, nous étudions le pouvoir expressif des grammaires coinductives de types, en dehors de tout critère de validité. Nous devons encore recourir au système S et nous montrons que tout terme est typable de façon non triviale avec des types infinis et que l'on peut extraire de ces typages des informations sémantiques comme l'ordre (arité) de n'importe quel lambda-terme. Ceci nous amène à introduire une méthode permettant de typer des termes totalement non-productifs, dits termes muets, inspirée de la logique du premier ordre. Ce résultat prouve que, dans l'extension coinductive du modèle relationnel, tout terme a une interprétation non vide. En utilisant une méthode similaire, nous montrons aussi que le système S collapse surjectivement sur l'ensemble des points de ce modèle<br>In this dissertation, we extend the methods of non-idempotent intersection type theory, pioneered by Gardner and de Carvalho, to some calculi beyond the lambda-calculus.- We first present a characterization of head and strong normalization in the lambda-mu calculus (classical natural deduction) by introducing non-idempotent union types. As in the intuitionistic case, non-idempotency allows us to extract quantitative information from the typing derivations and we obtain proofs of termination that are far more elementary than those in the idempotent case. These results leads us to define a small-step variant of the lambda-mu calculus, in which strong normalization is also characterized by means of quantitative methods.- In the second part of the dissertation, we extend the characterization of weak normalization in the pure lambda-calculus to an infinitary lambda-calculus narrowly related to Böhm trees, which was introduced by Klop et al. This gives a positive answer to a question known as Klop's problem. In that purpose, it is necessary to simultaneously introduce a system (system S) featuring infinite types and resorting to an intersection operator that we call sequential, and a validity criterion in order to discard unsound proofs that coinductive grammars give rise to. This also allows us to give a solution to TLCA problem #20 (type-theoretic characterization of hereditary permutations). It is to be noted that those two problem do not have a solution in the finite case (Tatsuta, 2007).- Finally, we study the expressive power of coinductive type grammars, without any validity criterion. We must once more resort to system S and we show that every term is typable in a non-trivial way with infinite types and that one can extract semantical information from those typings e.g. the order (arity) of any lambda-term. This leads us to introduce a method that allows typing totally unproductive terms (the so-called mute terms), which is inspired from first order logic. This result establishes that, in the coinductive extension of the relational model, every term has a non-empty interpretation. Using a similar method, we also prove that system S surjectively collapses on the set of points of this model
3
Pellissier, Luc. "Réductions et approximations linéaires." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCD088.
Full textAbstract:
De nombreux outils syntaxiques et sémantiques ont été développés pour l'étude de la dynamique des preuves et des programmes au cours des cinquante dernières années. Nous montrons ici que parmi ces outils – en particulier les types intersections et certaines sémantiques bien connues – de nombreux peuvent être définis au travers d'approximations linéaires de la manière suivante : pour un langage donné, on définit d'abord une notion d'approximation qui associe à un terme du langage un ensemble (généralement infini) d'approximants ayant un comportement dynamique dérivé de celui du terme ; puis on définit les outils usuels sur les approximants, ce qui est grandement simplifié par la linéarité, et enfin, on ramène cette construction au terme de départ. Définir une notion d'approximation cohérente avec la dynamique nécessite de présenter les langages étudiés dans un cadre 2- catégorique. Ce cadre permet d'exprimer comment les constructions sur les approximants donnent la construction générale (par une variation sur la construction de Grothendieck dans le cas des types intersections, et par des extensions de Kan dans le cas des sémantiques) et est suffisamment général pour englober les systèmes de types intersections caractérisant des propriétés de normalisation pour différentes variantes du λ-calcul (par nom, par valeur et le λμ- calcul) ainsi que la plupart des sémantiques issues de la logique linéaire.Enfin, on s'intéresse aux limites des approximants en étudiant dans quelles situations un terme est ou non caractérisé par certaines de ses approximations<br>Non communiqué
4
Rencelj, Marco. "The methodology for predicting the expected level of traffic safety in the different types of level intersections." Doctoral thesis, Università degli studi di Trieste, 2009. http://hdl.handle.net/10077/3154.
Full textAbstract:
2007/2008<br>Traffic accidents cause high material and human losses, what is reflected in society. The logical result is the need for efficient road safety in designing a new and the existing road system. Slovenia is, like other new EU Member States, aware of its tasks for improving traffic safety. In accordance with very clear demands of European transport policy about road safety – that is an EU recommendation of halving the number of road accident victims in the European Union by 2010 – Slovenia has also put into its national program a decision to halve the number of dead casualties on Slovenian roads. Unfortunately, the current situation in the field of road safety in Slovenia is - despite the highly ambitious plans - still not satisfactory. It has to be admitted that traffic safety in Slovenia has been improved during the last years but we still have not achieved the objectives of reducing road accidents, injured participants or dead casualties.
One of the "steps" to achieved desired level is also to improve existent road infrastructure. Road infrastructure improvement supposed to be applied to "black spots" first. For safety management it is well known, that we have three main motives for safety management: economic effectiveness, professional and institutional responsibility, and fairness. Survey among 25 EU states about estimating the most effective short, medium, and long term measures - both at national level and at EU level - shown, that measures related to infrastructure safety management (such as high-risk site management - black spot management), road safety audit and road safety inspection, are generally recognized as a high priority. While high-risk site management is a short-term measure, other infrastructure safety management measures make their impact in the medium to long term.
One of the possible approaches to identification of "safety problems" (safety deficiencies: accident frequency, accident rate, accident severity) is also use of accident prediction models (APM). With those models and use of various criteria we can detect not only "black spots" but also "larger targets".
A large number of "statistical predictive safety models" are described in the literature. Many attempts were done to use those models to establish a relationship between various traffic parameters and the number of accidents at road sections or road intersections. For statistical safety prediction models it is often suggested that accident occurrences are discrete, sporadic and random in nature. Thereby it is suggested to use Poisson regression models. The variation in accident occurrence is also considered to be due in part to the systematic variation in identified traffic measures such is traffic flow rates, measures of speed and intersection design parameters. Discrete, Poisson or negative binomial distributions are usefully applied to estimate the number of accidents that occur at road sections / intersections over a particular period of time. For accident prediction modeling the "generalized linear modeling" approach has been found to be particularly useful. This approach accounts for the fact that the dependent variable (e.g. number of accidents) does not need to be normally distributed (as is often the approach to describe the relationship between accident frequency and traffic flows on major and minor roads at intersections).
For the purpose of this work I collect different types of data for 60 level intersections on state road network in Slovenia. I divide those intersections into four different groups: 3-leg without left turn lanes on major road, 3-leg with left turn lanes on major road, 4-leg without left turn lanes on major road and 4-leg with left turn lanes on major road. All intersections were in rural area - outside urban area - with limited influence (or no influence at all) of pedestrians or / and cyclists. For observed intersections I collect different types of needed data: data about traffic accident for last 5 years (from 2002 - 2006), data about traffic (AADT on major and minor road), data about geometrical elements of the intersections, alignment of legs and other needed data (lane / shoulder width, speed limit, lighting, present of left / right turn lanes, type of terrain etc.)
After study of relevant literature I consider two different types of APM, which seemed to be correct and useful for my research work. I evaluate those different types of APM and made calculation for data which I obtained. At the end I made the correlation between those models with use of an empirical Bayesin method for calculating adjusted accident frequency.<br>XXI Ciclo<br>1973
5
Almonte-Valdivia, Ana. "Level-of-Service and Traffic Safety Relationship: An Exploratory Analysis of Signalized Intersections and Multiland High-Speed Arterial Corridors." Master's thesis, University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3372.
Full textAbstract:
Since its inception in 1965, the Level-of-Service (LOS) has proved to be an important and practical "quality of service" indicator for transportation facilities around the world, widely used in the transportation and planning fields. The LOS rates these facilities' traffic operating conditions through the following delay-based indicators (ordered from best to worst conditions): A, B, C, D, E and F. This LOS rating has its foundation on quantifiable measures of effectiveness (MOEs) and on road users' perceptions; altogether, these measures define a LOS based on acceptable traffic operating conditions for the road user, implying that traffic safety is inherent to this definition. However, since 1994 safety has been excluded from the LOS definition since it cannot be quantified nor explicitly defined. The latter has been the motivation for research based on the LOS-Safety relationship, conducted at the University of Central Florida (UCF). Using data from two of the most studied transportation facility types within the field of traffic safety, signalized intersections and multilane high-speed arterial corridors, the research conducted has the following main objectives: to incorporate the LOS as a parameter in several traffic safety models, to extend the methodology adopted in previous studies to the subject matter, and to provide a platform for future transportation-related research on the LOS-Safety relationship. A meticulous data collection and preparation process was performed for the two LOS-Safety studies comprising this research. Apart from signalized intersections' and multilane-high speed arterial corridors' data, the other required types of information corresponded to crashes and road features, both obtained from FDOT's respective databases. In addition, the Highway Capacity Software (HCS) and the ArcGIS software package were extensively used for the data preparation. The result was a representative and robust dataset for each LOS-Safety study, to be later tested and analyzed with appropriate statistical methods. Regarding the LOS-Safety study for signalized intersections, two statistical techniques were used. The Generalized Estimating Equations (GEEs), the first technique, was used for the analyses considering all periods of a regular weekday (i.e. Monday through Friday): Early Morning, A.M. Peak, Midday, P.M. Peak and Late Evening; the second technique considered was the Negative Binomial, which was used for performing an individual analysis per period of the day. On the other hand, the LOS-Safety study for multilane high-speed arterial corridors made exclusive use of the Negative Binomial technique. An appropriate variable selection process was required for the respective model building and calibration procedures; the resulting models were built upon the six following response variables: total crashes, severe crashes, as well as rear-end, sideswipe, head-on and angle plus left-turn crashes. The final results proved to be meaningful for the understanding of traffic congestion effects on road safety, and on how they could be useful within the transportation planning scope. Overall, it was found that the risk for crash occurrence at signalized intersections and multilane high-speed arterial corridors is quite high between stable and unacceptable operating conditions; it was also found that this risk increases as it becomes later in the day. Among the significant factors within the signalized intersection-related models were LOS for the intersection as a whole, cycle length, lighting conditions, land use, traffic volume (major and minor roads), left-turn traffic volume (major road only), posted speed limit (major and minor roads), total number of through lanes (major and minor roads), overall total and total number of left-turn lanes (major road only), as well as county and period of the day (dummy variables). For multilane-high speed arterial corridors, the final models included LOS for the road section, average daily traffic (ADT), total number of through lanes in a single direction, total length of the road section, pavement surface type, as well as median and inside shoulder widths. A summary of the overall results per study, model implications and each LOS indicator is presented. Some of the final recommendations are to develop models for other crash types, to perform a LOS-Safety analysis at the approach-level for signalized intersections, as well as one that incorporates intersections within the arterial corridors' framework.<br>M.S.<br>Department of Civil and Environmental Engineering<br>Engineering and Computer Science<br>Civil Engineering MS
6
De, Benedetti Erika. "Linear logic, type assignment systems and implicit computational complexity." Thesis, Lyon, École normale supérieure, 2015. http://www.theses.fr/2015ENSL0981/document.
Full textAbstract:
La complexité implicite (ICC) vise à donner des caractérisations de classes de complexité dans des langages de programmation ou des logiques, sans faire référence à des bornes sur les ressources (temps, espace mémoire). Dans cette thèse, nous étudions l’approche de la logique linéaire à la complexité implicite. L’objectif est de donner des caractérisations de classes de complexité, à travers des variantes du lambda-calcul qui sont typables dans de tels systèmes. En particulier, nous considérons à la fois une perspective monovalente et une perspective polyvalente par rapport à l’ICC. Dans le premier cas, le but est de caractériser une hiérarchie de classes de complexité à travers un lambda-calcul élémentaire typé dans la logique linéaire élémentaire (ELL), où la complexité ne dépend que de l’interface d’un programme, c’est à dire son type. La deuxième approche rend compte à la fois des fonctions calculables en temps polynomial et de la normalisation forte, à travers des termes du lambda-calcul pur qui sont typés dans un système inspiré par la logique linéaire Soft (SLL); en particulier, par rapport à l’approche logique ordinaire, ici nous abandonnons la modalité “!” en faveur de l’emploi des types stratifiés, vus comme un raffinement des types intersection non associatifs, afin d’améliorer la typabilité et, en conséquence, l’expressivité. Enfin, nous explorons l’utilisation des types intersection, privés de certaines de leurs propriétés, vers une direction plus quantitative que l’approche qualitative habituelle, afin d’obtenir une borne sur le calcul de lambda-termes purs, en obtenant en plus une caractérisation de la normalisation forte<br>In this thesis we explore the linear logic approach to implicit computational complexity, through the design of type assignment systems based on light linear logic, or heavily inspired by them, with the purpose of giving a characterization of one or more complexity classes, through variants of lambda-calculi which are typable in such systems. In particular, we consider both a monovalent and a polyvalent perspective with respect to ICC. In the first one the aim is to characterize a hierarchy of complexity classes through an elementary lambda-calculus typed in Elementary Linear Logic (ELL), where the complexity depends only on the interface of a term, namely its type. The second approach gives an account of both the functions computable in polynomial time and of strong normalization, through terms of pure lambda-calculus which are typed in a system inspired by Soft Linear Logic (SLL); in particular, with respect to the usual logical take, in the latter we give up the “!” modality in favor of employing stratified types as a refinement of non-associative intersection types, in order to improve typability and, as a consequence, expressivity.Finally we explore the use of intersection types, deprived of some of their usual properties, towards a more quantitative approach rather than the usual qualitative one, namely in order to compute a bound on the computation of pure lambda-terms, obtaining in addition a characterization of strong normalization
7
Stolze, Claude. "Types union, intersection, et dépendants dans le lambda-calcul explicitement typé." Thesis, Université Côte d'Azur (ComUE), 2019. http://www.theses.fr/2019AZUR4104.
Full textAbstract:
Le sujet de cette thèse est sur le lambda-calcul décoré avec des types, communément appelé « lambda-calcul typé à la Church ». Nous étudions des versions de ce lambda-calcul muni de types intersections, tels que ceux décrits dans le livre « Lambda-calculus with types » de Barendregt, Dekkers et Statman ; les types unions, qui ont été introduits par Plotkin, MacQueen et Sethi ; et les types dépendants, tels qu'ils ont été décrits par Plotkin, Harper et Honsell lorsqu'ils ont introduit le Logical Framework d'Edinbourgh LF. Les types intersections et unions sont un moyen d'exprimer du polymorphisme ad hoc et sont une alternative au polymorphisme paramétrique de Girard. Les types dépendants ont été introduits pour formaliser la logique intuitionniste avec la correspondance de Curry-Howard. Le système de types obtenu peut être enrichi avec une relation de soutypage décidable. La combinaison de ces trois disciplines de type donne lieu à une famille de calculs qui peuvent être paramétrés et classifiés. Nous appelons le système générique le Delta-calcul. Nous discutons ensuite des décisions de conception qui nous ont amené à la formulation de ces calculs, nous étudions leur métathéorie, et nous présentons divers exemples d'applications avant de présenter une implémentation logicielle du Delta-calcul, avec une description des algorithmes de vérification de type, de raffinement, de soutypage, d'évaluation, ainsi que de l'interface en ligne de commande. Ce travail de recherche peut être vu comme un petit pas franchi dans la direction d'une théorie des types alternative pour définir du polymorphisme dans les langages de programmation et dans les assistants de preuve interactifs<br>The subject of this thesis is about lambda-calculus decorated with types, usually called "Church-style typed lambda-calculus". We study this lambda-calculus enhanced with Intersection types, as described by Barendregt, Dekkers and Statman in the book "Lambda-calculus with Types"; Union types, as introduced by Plotkin, MacQueen and Sethi; and Dependent types, as described by Plotkin, Harper and Honsell when they introduced the Edinburgh Logical Framework LF. Intersection and union types are a way to express ad hoc polymorphism and are an alternative to the parametric polymorphism of Girard. Dependent types were introduced as a way to formalize intuitionistic logic using the "proof-as-lambda-terms / formulas-as-types" Curry-Howard principle. The resulting type system can be enriched with a decidable subtyping relation. Combining these three type disciplines gives rise to a family of calculi that can be parametrized and classified: we call the resulting system the Delta-calculus. We then discuss the design decisions which have led us to the formulation of these calculi, study their metatheory, and provide various examples of applications; and we finally present a software implementation of the Delta-calculus, with a description of the type checker, the refinement algorithm, the subtyping algorithm, the evaluation algorithm and the command-line interface. This work can be understood as a little step toward an alternative type theory to defining polymorphic programming languages and interactive proof assistants
8
Ramsay, Steven J. "Intersection types and higer-order model checking." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:46b7bc70-3dfe-476e-92e7-245b7629ae4e.
Full textAbstract:
Higher-order recursion schemes are systems of equations that are used to define finite and infinite labelled trees. Since, as Ong has shown, the trees defined have a decidable monadic second order theory, recursion schemes have drawn the attention of research in program verification, where they sit naturally as a higher-order, functional analogue of Boolean programs. Driven by applications, fragments have been studied, algorithms developed and extensions proposed; the emerging theme is called higher-order model checking. Kobayashi has pioneered an approach to higher-order model checking using intersection types, from which many recent advances have followed. The key is a characterisation of model checking as a problem of intersection type assignment. This dissertation contributes to both the theory and practice of the intersection type approach. A new, fixed-parameter polynomial-time decision procedure is described for the alternating trivial automaton fragment of higher-order model checking. The algorithm uses a novel, type-directed form of abstraction refinement, in which behaviours of the scheme are distinguished according to the intersection types that they inhabit. Furthermore, by using types to reason about acceptance and rejection simultaneously, the algorithm is able to converge on a solution from two sides. An implementation, Preface, and an extensive body of evidence demonstrate empirically that the algorithm scales well to schemes of several thousand rules. A comparison with other tools on benchmarks derived from current practice and the related literature puts it well beyond the state-of-the-art. A generalisation of the intersection type approach is presented in which higher-order model checking is seen as an instance of exact abstract interpretation. Intersection type assignment is used to characterise a general class of safety checking problems, defined independently of any particular representation (such as automata) for a class of recursion schemes built over arbitrary constants. Decidability of any problem in the class is an immediate corollary. Moreover, the work looks beyond whole-program verification, the traditional territory of model checking, by giving a natural treatment of higher-type properties, which are sets of functions.
9
Silvia, Gilezan. "Intersection types in lambda calculus and logic." Phd thesis, Univerzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, 1993. https://www.cris.uns.ac.rs/record.jsf?recordId=73293&source=NDLTD&language=en.
Full text
10
Lovas, William. "Refinement Types for Logical Frameworks." Research Showcase @ CMU, 2010. http://repository.cmu.edu/dissertations/74.
Full textAbstract:
The logical framework LF and its metalogic Twelf can be used to encode and reason about a wide variety of logics, languages, and other deductive systems in a formal, machine-checkable way.
Recent studies have shown that ML-like languages can profitably be extended with a notion of subtyping called refinement types. A refinement type discipline uses an extra layer of term classification above the usual type system to more accurately capture certain properties of terms.
I propose that adding refinement types to LF is both useful and practical. To support the claim, I exhibit an extension of LF with refinement types called LFR,work out important details of itsmetatheory, delineate a practical algorithmfor refinement type reconstruction, andpresent several case studies that highlight the utility of refinement types for formalized mathematics. In the end I find that refinement types and LF are a match made in heaven: refinements enable many rich new modes of expression, and the simplicity of LF ensures that they come at a modest cost.
11
ZIMMER, Pascal. "Récursion généralisée et inférence de types avec intersection." Phd thesis, Université de Nice Sophia-Antipolis, 2004. http://tel.archives-ouvertes.fr/tel-00006314.
Full textAbstract:
Dans une première partie, nous définissons un nouveau langage à base fonctionnelle et avec récursion généralisée, en utilisant le système de types avec degrés de Boudol pour éliminer les récursions dangereuses. Ce langage est ensuite étendu par des enregistrements récursifs, puis par des mixins, permettant ainsi de mêler totalement les paradigmes fonctionnels et objets. Nous présentons également une implémentation, MlObj, ainsi que la machine abstraite servant à son exécution.<br /><br />Dans une deuxième partie, nous présentons un nouvel algorithme d'inférence pour les systèmes de types avec intersection, dans le cadre d'une extension du lambda-calcul. Après avoir prouvé sa correction, nous étudions sa généralisation aux références et à la récursion, nous le comparons aux algorithmes d'inférence déjà existants, notamment à celui de Système I, et nous montrons qu'il devient décidable à rang fini.
12
Nishida, Yuki. "Typed Software Contracts with Intersection and Nondeterminism." Kyoto University, 2020. http://hdl.handle.net/2433/253520.
Full text
13
Borg, Peter. "Some set intersection theorems of extremal type." Thesis, Open University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.486248.
Full text
14
Hritcu, Cătălin [Verfasser], and Michael [Akademischer Betreuer] Backes. "Union, intersection, and refinement types and reasoning about type disjointness for security protocol analysis / Cătălin Hritcu. Betreuer: Michael Backes." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2012. http://d-nb.info/1052292569/34.
Full text
15
Rahli, Vincent. "Investigations in intersection types : confluence, and semantics of expansion in the λ-calculus, and a type error slicing method". Thesis, Heriot-Watt University, 2011. http://hdl.handle.net/10399/2453.
Full textAbstract:
Type systems were invented in the early 1900s to provide foundations for Mathematics where types were used to avoid paradoxes. Type systems have then been developed and extended throughout the years to serve different purposes such as efficiency or expressiveness. The λ-calculus is used in programming languages, logic, mathematics, and linguistics. Intersection types are a kind of types used for building semantic models of the λ-calculus and for static analysis of computer programs. The confluence property was used to prove the λ-calculus’ consistency and the uniqueness of normal forms. Confluence is useful to show that logics are sensibly designed, and to make equality decision procedures for use in theorem provers. Some proofs of the λ-calculus’ confluence are based on syntactic concepts (reduction relations and λ-term sets) and some on semantic concepts (type interpretations). Part I of this thesis presents an original syntactic proof that is a simplification of a semantic proof based on a sound type interpretation w.r.t. an intersection type system. Our proof can be seen as bridging some semantic and syntactic proofs. Expansion is an operation on typings (pairs of type environments and result types) in type systems for the λ-calculus. It was introduced to prove that the principal typing property (i.e., that every typable term has a strongest typing) holds in intersection type systems. Expansion variables were introduced to simplify the expansion mechanism. Part II of this thesis presents a complete realisability semantics w.r.t. an intersection type system with infinitely many expansion variables. This represents the first study on semantics of expansion. Providing sound (and complete) realisability semantics allows one to study the algorithmic behaviour of typed λ-terms through their types w.r.t. a type system. We believe such semantics will cast some light on the not yet well understood expansion operation. Intersection types were used in a type error slicer for the SML programming language. Existing compilers for many languages have confusing type error messages. Type error slicing (TES) helps the programmer by isolating the part of a program contributing to a type error (a slice). TES was initially done for a tiny toy language (the λ-calculus with polymorphic let-expressions). Extending TES to a full language is extremely challenging, and for SML we needed a number of innovations. Some issues would be faced for any language, and some are SML-specific but representative of the complexity of language-specific issues likely to be faced for other languages. Part III of this thesis solves both kinds of issues and presents an original, simple, and general constraint system for providing type error slices for ill-typed programs. We believe TES helps demystify language features known to confuse users.
16
Bernadet, Alexis. "Non idempotent-intersection types to refine strong normalisation with quantitative information." Palaiseau, Ecole polytechnique, 2014. https://tel.archives-ouvertes.fr/tel-01099657/document.
Full textAbstract:
Nous étudions des systèmes de typage avec des types intersections non-idempotents pour des variantes du lambda-calcul et nous discutons de leurs propriétés et de leurs applications. Outre le lambda-calcul lui-même, les variantes sont un lambda-calcul avec des substitutions explicites et un lambda-calcul avec des constructeurs, du filtrage et un opérateur de point fixe. Les sytèmes de typage que l'on présente caractérisent les termes fortement normalisables. Mais nous montrons également qu'un jugement de typage d'un terme donne des informations quantitatives : une mesure triviale sur l'arbre de typage d'unlambda-terme quelconque donne une borne sur la taille de la plus longue séquence de beta-reductions depuis ce lambda-terme jusqu'à sa forme normale. Nous raffinons cette approche pour obtenir un résultat plus précis: certains systèmes de typages, sous certaines conditions, donnent même une mesure exacte de cette plus longue séquence de beta-reductions, et le type du terme donne des informations sur la forme normale de ce terme. De plus, en utilisant des filtres, ces systèmes de typage peuvent être utilisés pour définir une sémantique dénotationnelle<br>We study systems of non-idempotent intersection types for different variants of the lambda-calculus and we discuss properties and applications. Besides the pure lambda-calculus itself, the variants are a λ-calculus with explicit substitutions and a lambda-calculus with constructors, matching and a fixpoint operator. The typing systems we introduce for these calculi all characterize strongly normalising terms. But we also show that, by dropping idempotency of intersections, typing a term provides quantitative information about it: a trivial measure on its typing tree gives a bound on the size of the longest beta-reduction sequence from this term to its normal form. We explore how to refine this approach to obtain finer results: some of the typing systems, under certain conditions, even provide the exact measure of this longest beta-reduction sequence, and the type of a term gives information on the normal form of this term. Moreover, by using filters, these typing systems can be used to define a denotational semantics
17
Glanc, Pierre. "Approximation numérique de l'équation de Vlasov par des méthodes de type remapping conservatif." Phd thesis, Université de Strasbourg, 2014. http://tel.archives-ouvertes.fr/tel-00904887.
Full textAbstract:
Cette thèse présente l'étude et le développement de méthodes numériques pour la résolution d'équations de transport, en particulier d'une méthode de remapping bidimensionnel dont un avantage important par rapport aux algorithmes existants est la propriété de conservation de la masse. De nombreux cas-tests permettront de comparer ces approches entre elles ainsi qu'à des méthodes de référence. On s'intéressera en particulier aux équations dites de Vlasov-Poisson et du Centre-Guide, qui apparaissent très classiquement dans le cadre de la physique des plasmas.
18
Brock, Erin Lynn. "Please Type Here: Digital Petitions and the Intersections of the Web and Democracy." Miami University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=miami1408023321.
Full text
19
Ghosh, Rhea. "On intersecting 2-brane solutions in Type IIA supergravity theory /." Connect to online version, 2005. http://ada.mtholyoke.edu/setr/websrc/pdfs/www/2005/123.pdf.
Full text
20
Cooper, Susan Marie. "Subsets of complete intersections in P2, their Hilbert functions and associated 2-type vectors." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ52982.pdf.
Full text
21
Carter, Cassandra G. "All the Single Ladies| How the Intersections of Race and Family Type Influence Health." Thesis, State University of New York at Albany, 2016. http://pqdtopen.proquest.com/#viewpdf?dispub=10142600.
Full textAbstract:
<p> Decreasing rates of marriage and the delay of motherhood or decision to forsake childbearing altogether are emergent trends in the United States. Historically, shifts in family composition have always been important, yet the increase in the number of unmarried and child-free adults is rarely acknowledged by health researchers. Race and family type will be used to investigate the health of Black and White unmarried, childless women (SWANS), using intersectional theory, the Social Determinants of Health, and the Sojourner Model. The frequencies of poor health outcomes are analyzed to determine if family type influences health outcomes, and if so, does this differ by race. Using secondary data from the 2010-2013 Integrated Health Interview Series (IHIS) and binary logistic regression, results indicate that the main independent variables of race and family types interact to differentiate health outcomes. </p><p> This work uncovers race as a master status for Black women. Black married childfree women have better health outcomes relative to Black SWANS, with the exception of self-rated health. Black married parents are less likely to report adverse health conditions than Black married childfree and SWANS. Among Whites, all family types are in poorer health, when compared to married parents. </p><p> Notably, both Black and White SWANS experience the lowest rates of poor emotional health. These findings persist despite adjusting for demographic and socio-economic characteristics that are known to influence health. The analysis further underscores the importance of focusing on intra-racial variations in marriage and health and give added support to feminist arguments regarding the methodological and conceptual challenges to studying women who exist on the margins of society and Black women in general. Taken altogether, the results move toward an examination of health and family policies to identify areas for potential policy change and SWAN-advocacy.</p>
22
Latinsky, Andrew. "Showcasing Self: An Intersectional Analysis of Body Type Presentation in Online Daters." Master's thesis, University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5658.
Full textAbstract:
Using data collected from the online dating site Match.com, this paper performs a content analysis examining the relationships between race, gender, and sexuality as both independent variables and as intersections on impression management strategies in online dating. Impression management strategies form a foundational core of how people interact with others in social situations. This analysis focuses on impression management strategies by examining how people advertise their body type in a public arena. Analysis also draws upon the types of bodies these people desire in an ideal date, as a second method of looking at the norms surrounding the ideal body type for a given group. Drawing upon intersectionality theories, this paper looks at potential biases in previous online dating literature towards white heterosexuals. Taking this idea into account, this analysis utilizes 892 profiles from major urban centers within the United States, approximately equal in the numbers of whites and blacks, gay/lesbians and heterosexuals, and men and women, in order to examine underrepresented populations in previous online dating literature. Findings show that body type norms based on intersectional race and gender literature appear to be more accurate predictors of proclaimed body type than only those using gender literatures. In addition, sexuality, race, and gender interactions appear to have an effect in the terminology an online dater uses in describing both themselves and the types of bodies desired in ideal dates. Contrary to prior online dating and gender literature, findings also indicate a greater willingness of women compared to men to use terms that indicate their body might be overweight. Theoretical explanations look at how positions relative to hegemonic power may be an overriding influence in the importance of body type impression management strategies.<br>M.A.<br>Masters<br>Sociology<br>Sciences<br>Applied Sociology
23
Tramel, Rebecca. "New stability conditions on surfaces and new Castelnuovo-type inequalities for curves on complete-intersection surfaces." Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/20990.
Full textAbstract:
Let X be a smooth complex projective variety. In 2002, [Bri07] defined a notion of stability for the objects in Db(X), the bounded derived category of coherent sheaves on X, which generalized the notion of slope stability for vector bundles on curves. There are many nice connections between stability conditions on X and the geometry of the variety. In 2012, [BMT14] gave a conjectural stability condition for threefolds. In the case that X is a complete intersection threefold, the existence of this stability condition would imply a Castelnuovo-type inequality for curves on X. I give a new Castelnuovo-type inequality for curves on complete intersection surfaces of high degree. I then show how this bound would imply the bound conjectured in [BMT14] if a weaker bound could be shown for curves of lower degree. I also construct new stability conditions for surfaces containing a curve C whose self-intersection is negative. I show that these stability conditions lie on a wall of the geometric chamber of Stab(X), the stability manifold of X. I then construct the moduli space Mσ (OX) of σ-semistable objects of class [OX] in K0(X) after wall-crossing.
24
Ott, Tassilo. "Aspects of stability and phenomenology in type IIA orientifolds with intersecting D6-branes." Doctoral thesis, [S.l.] : [s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968772889.
Full text
25
Goodsell, Mark Dayvon. "One loop phenomenology of type II string theory : intersecting d-branes and noncommutativity." Thesis, Durham University, 2007. http://etheses.dur.ac.uk/2915/.
Full textAbstract:
We examine one loop amplitudes for open and closed strings in certain D-brane configurations, and investigate the consequences for phenomenology. Initially we consider open strings at D6-brane intersections. We develop techniques for one-loop diagrams. The one-loop propagator of chiral intersection states is calculated exactly and its finiteness is shown to be guaranteed by RR tadpole cancellation. The result is used to demonstrate the expected softening of power law running of Yukawa couplings at the string scale. We also develop methods to calculate arbitrary TV-point functions at one-loop, including those without gauge bosons in the loop. These techniques are also applicable to heterotic orbifold models. One issue of the intersecting D6-brane models is that the Yukawa couplings of the simpler models suffer from the so-called "rank one" problem - there is only a single non-zero mass and no mixing. We consider the one-loop contribution of E2-instantons to Yukawa couplings on intersecting D6-branes, and show that they can provide a solution. In addition they have the potential to provide a geometric explanation for the hierarchies observed in the Yukawa couplings. In order to do this we provide the necessary quantities for instanton calculus in this class of background. We then explore how the IR pathologies of noncommutative field theory are resolved when the theory is realized as open strings in background B-fields: essentially, since the IR singularities are induced by UV/IR mixing, string theory brings them under control in much the same way as it does the uv singularities. We show that at intermediate scales (where the Selberg-Witten limit is a good approximation) the theory reproduces the noncommutative field theory with all the (un)usual features such as UV/IR mixing, but that outside this regime, in the deep infra-red, the theory flows continuously to the commutative theory and normal Wilsoman behaviour is restored. The resulting low energy physics resembles normal commutative physics, but with additional suppressed Lorentz violating operators. We also show that the phenomenon of UV/IR mixing occurs for the graviton as well, with the result that, in configurations where Planck's constant receives a significant one-loop correction (for example brane-induced gravity), the distance scale below which gravity becomes non-Newtonian can be much greater than any compact dimensions.
26
Neatherway, Robin Philip. "Higher-order model checking with traversals." Thesis, University of Oxford, 2014. http://ora.ox.ac.uk/objects/uuid:240bd517-1582-45f9-86c3-eb30f85757de.
Full textAbstract:
Higher-order recursion schemes are a powerful model of functional computation that grew out of traditional recursive program schemes and generalisations of grammars. It is common to view recursion schemes as generators of possibly-infinite trees, which Ong showed to have a decidable monadic second order theory and opened the door to applications in verification. Kobayashi later presented an intersection type characterisation of the model checking problem, on which most subsequent applied work is based. In recent work, recursion schemes have been considered to play a role similar to Boolean programs in verification of first-order imperative programs: a natural target for abstraction of programs with very large or infinite data domains. In this thesis we focus on the development of model checking algorithms for variants of recursion schemes. We start our contributions with a model checking algorithm inspired by the fully abstract game semantics of recursion schemes, but specified as a goal-directed approach to intersection type inference, that offers a unification of the views of Ong and Kobayashi. We build on this largely theoretical contribution with two orthogonal extensions and practical implementations. First, we develop a new extension of recursion schemes: higher-order recursion schemes with cases, which add non-determinism and a case construct operating over a finite data domain. These additions provide us with a more natural and succinct target for abstraction from functional programs: encoding data using functions inevitably results in an increase in the order and arity of the scheme, which have a direct impact on the worst-case complexity of the problem. We characterise the model checking problem using a novel intersection and union type system and give a practical algorithm for type inference in this system. We have carried out an empirical evaluation of the implementation --- the tool T<sub>RAV</sub>MC --- using a variety of problem instances from the literature and a new suite of problem instances derived via an abstraction-refinement procedure from functional programs. Second, we extend our approach from safety properties to all properties expressible in monadic second order logic using alternating parity tree automata as our specification language. We again provide an implementation and an empirical evaluation, which shows that despite the challenges accompanying liveness properties our tool scales beyond the current state of the art.
27
Keller, Joanne Marie. "ANALYSIS OF TYPE AND SEVERITY OF TRAFFIC CRASHES AT SIGNALIZED INTERSECTIONS USING TREE-BASED REGRESSION AND ORDERED PROBIT MODELS." Master's thesis, University of Central Florida, 2004. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4382.
Full textAbstract:
Many studies have shown that intersections are among the most dangerous locations of a roadway network. Therefore, there is a need to understand the factors that contribute to traffic crashes at such locations. One approach is to model crash occurrences based on configuration, geometric characteristics and traffic. Instead of combining all variables and crash types to create a single statistical model, this analysis created several models that address the different factors that affect crashes, by type of collision as well as injury level, at signalized intersections. The first objective was to determine if there is a difference between important variables for models based on individual crash types or severity levels and aggregated models. The second objective of this research was to investigate the quality and completeness of the crash data and the effect that incomplete data has on the final results. A detailed and thorough data collection effort was necessary for this research to ensure the quality and completeness of this data. Multiple agencies were contacted and databases were crosschecked (i.e. state and local jurisdictions/agencies). Information (including geometry, configuration and traffic characteristics) was collected for a total of 832 intersections and over 33,500 crashes from Brevard, Hillsborough and Seminole Counties and the City of Orlando. Due to the abundance of data collected, a portion was used as a validation set for the tree-based regression. Hierarchical tree-based regression (HTBR) and ordered probit models were used in the analyses. HTBR was used to create models for the expected number of crashes for collision type as well as injury level. Ordered probit models were only used to predict crash severity levels due to the ordinal nature of this dependent variable. Finally, both types of models were used to predict the expected number of crashes. More specifically, tree-based regression was used to consider the difference in the relative importance of each variable between the different types of collisions. First, regressions were only based on crashes available from state agencies to make the results more comparable to other studies. The main finding was that the models created for angle and left turn crashes change the most compared to the model created from the total number of crashes reported on long forms (restricted data usually available at state agencies). This result shows that aggregating the different crash types by only estimating models based on the total number of crashes will not predict the number of expected crashes as accurately as models based on each type of crash separately. Then, complete datasets (full dataset based on crash reports collected from multiple sources) were used to calibrate the models. There was consistently a difference between models based on the restricted and complete datasets. The results in this section show that it is important to include minor crashes (usually reported on short forms and ignored) in the dataset when modeling the number of angle or head-on crashes and less important to include minor crashes when modeling rear-end, right turn or sideswipe crashes. This research presents in detail the significant geometric and traffic characteristics that affect each type of collision. Ordered probit models were used to estimate crash injury severity levels for three different types of models; the first one based on collision type, the second one based on intersection characteristics and the last one based on a significant combination of factors in both models. Both the restricted and complete datasets were used to create the first two model types and the output was compared. It was determined that the models based on the complete dataset were more accurate. However, when compared to the tree-based regression results, the ordered probit model did not predict as well for the restricted dataset based on intersection characteristics. The final ordered probit model showed that crashes involving a pedestrian/bicyclist have the highest probability of a severe injury. For motor vehicle crashes, left turn, angle, head-on and rear-end crashes cause higher injury severity levels. Division (a median) on the minor road, as well as a higher speed limit on the minor road, was found to lower the expected injury level. This research has shed light on several important topics in crash modeling. First of all, this research demonstrated that variables found to be significant in aggregated crash models may not be the same as the significant variables found in models based on specific crash types. Furthermore, variables found to be significant in crash type models typically changed when minor crashes were added to complete the dataset. Thirdly, ordered probit models based on significant crash-type and intersection characteristic variables have greater crash severity prediction power, especially when based on the complete dataset. Lastly, upon comparison between tree-based regression and ordered probit models, it was found that the tree-based regression models better predicted the crash severity levels.<br>M.S.<br>Department of Civil and Environmental Engineering<br>Engineering and Computer Science<br>Civil and Environmental Engineering
28
Malmusi, Davide 1980. "Determinants of social inequalities in selfrated health: analysis at the intersection of gender, class and migration type." Doctoral thesis, Universitat Pompeu Fabra, 2012. http://hdl.handle.net/10803/116733.
Full textAbstract:
This dissertation aims to describe social inequalities in self-rated health in an integrated framework of gender, social class and immigration, and to identify the main intermediary factors and health problems that contribute to these inequalities. Three cross-sectional studies were performed with data from surveys of the general population residing in Catalonia and Spain in 2006. Migration from poor regions of Spain to Catalonia emerged as a health inequality dimension in addition to and interaction with gender and social class, highlighting the transitory nature of the ‘healthy immigrant effect’ partially observed in foreign immigrants. Material and economic resources made major contributions to all three types of health inequalities: individual income made the greatest contribution to gender inequalities; household material assets and financial difficulties to migration-related inequalities; and both to social class inequalities. Poorer self-rated health of women was showed to be not an issue of perception but a precise reflection of the higher burden of chronic conditions they suffered compared to men, such as musculoskeletal, mental and other pain disorders, which could be targets for a health system responsive to gender inequalities. Intersections between axes of inequality created complex social locations with unique consequences on health.
29
Titze, Tobias, and Christian Chmelik. "Configurational entropy and intersection blocking effects in multicomponent systems in MFI-type zeolites studied by IR Microscopy." Universitätsbibliothek Leipzig, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-185456.
Full text
30
Titze, Tobias, and Christian Chmelik. "Configurational entropy and intersection blocking effects in multicomponent systems in MFI-type zeolites studied by IR Microscopy." Diffusion fundamentals 16 (2011) 58, S. 1-2, 2011. https://ul.qucosa.de/id/qucosa%3A13801.
Full text
31
Jelena, Ivetić. "Intesection types and resource control in the intuitionistic sequent lambda calculus." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2013. http://dx.doi.org/10.2298/NS20131009IVETIC.
Full textAbstract:
This thesis studies computational interpretations of the intuitionistic sequentcalculus with implicit and explicit structural rules, with focus on the systemswith intersection types. The contributions of the thesis are grouped into threeparts. In the first part intersection types are introduced into the lambdaGentzen calculus. The second part presents an extension of the lambdaGentzen calculus to a term calculus with resource control, i.e. with explicitoperators for contraction and weakening, and apropriate intersection typeassignment system which characterises strong normalisation in the proposedcalculus. In the third part both previously studied calculi are integrated intoone framework by introducing the notion of the resource control cube.<br>Ова дисертација се бави рачунским интерпретацијамаинтуиционистичког секвентног рачуна са имплицитним и експлицитнимструктурним правилима, са фокусом на типске системе са пресеком.Оригинални резултати тезе су груписани у три целине. У првом делу сутипови са пресеком уведени у lambda Gentzen рачун. Други деопредставља проширење lambda Gentzen рачуна на формални рачун саконтролом ресурса, тј. са експлицитним операторима контракције ислабљења, као и одговарајући типски систем са пресеком којикарактерише јаку нормализацију у уведеном рачуну. У трећем делу обарачуна су интегрисана у заједнички оквир увођењем структуре resourcecontrol cube.<br>Ova disertacija se bavi računskim interpretacijamaintuicionističkog sekventnog računa sa implicitnim i eksplicitnimstrukturnim pravilima, sa fokusom na tipske sisteme sa presekom.Originalni rezultati teze su grupisani u tri celine. U prvom delu sutipovi sa presekom uvedeni u lambda Gentzen račun. Drugi deopredstavlja proširenje lambda Gentzen računa na formalni račun sakontrolom resursa, tj. sa eksplicitnim operatorima kontrakcije islabljenja, kao i odgovarajući tipski sistem sa presekom kojikarakteriše jaku normalizaciju u uvedenom računu. U trećem delu obaračuna su integrisana u zajednički okvir uvođenjem strukture resourcecontrol cube.
32
Fortney, Stoni Lin. "The Intersection of Urbanicity, Race, Diagnoses, Type of Residence, and Access to Services for Individuals with Intellectual Disabilities and Developmental Disabilities." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1554995471441475.
Full text
33
Ecker, Jill [Verfasser]. "Type IIA string theory on T 6/(Z2 × Z6 × OmegaR) : Model building and string phenomenology with intersecting D6-branes / Jill Ecker." Mainz : Universitätsbibliothek Mainz, 2016. http://d-nb.info/1110986408/34.
Full text
34
Witkowski, Lukas Thomas. "Sequestering of Kähler moduli in type IIB string theory." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:6f5c8a99-26ca-401b-ad42-7bd3bf873f80.
Full textAbstract:
In this thesis we employ string perturbation theory in toroidal orbifold models to study aspects of supersymmetry breaking in type IIB string theory. First, we determine the dependence of physical Yukawa couplings on blow-up moduli in models with D3-branes at orbifold singularities. Blow-up moduli are scalar fields describing the size of small blow-up cycles in the compactification geometry. In models implementing moduli stabilisation these fields can acquire F-terms and break supersymmetry. We examine the moduli-dependence of physical Yukawa couplings at string tree-level by computing disk correlation functions involving a Yukawa interaction of visible sector fields and an arbitrary number of blow-up moduli. We perform the calculation for one blow-up insertion explicitly and find that the correlation function vanishes if the blow-up modulus is associated with a small cycle distant to the visible sector. For more than one blow-up insertion we show that all such correlation functions are exponentially suppressed by the compactification volume. We explain how these results are relevant to suppressing soft terms to scales parametrically below the gravitino mass. Further, we determine corrections to holomorphic Yukawa couplings on D3-branes at an orbifold singularity due to non-perturbative effects such as gaugino condensation on a stack of D7-branes. This can be done by calculating a one-loop threshold correction to the gauge coupling on the D7-branes. We show that, if present, the new contributions to Yukawa couplings are not aligned with the tree-level couplings. As the new Yukawa couplings contribute to soft A-terms they are sources of flavour-changing neutral currents. Last we discuss an effect unrelated to supersymmetry breaking. We show that orbifold models with D3-branes at orbifold singularities can exhibit kinetic mixing of different massless Abelian factors. For this to be possible, the relevant U(1) factors have to be associated with more than one orbifold singularity.
35
Wahi, Rabbani Rash-ha. "Towards an understanding of the factors associated with severe injuries to cyclists in crashes with motor vehicles." Thesis, Queensland University of Technology, 2018. https://eprints.qut.edu.au/121426/1/Rabbani%20Rash-Ha_Wahi_Thesis.pdf.
Full textAbstract:
This thesis aimed to develop statistical models to overcome limitations in police-reported data to better understand the factors contributing to severe injuries in bicycle motor-vehicle crashes. In low-cycling countries such as Australia, collisions with motor vehicles are the major causes of severe injuries to cyclists and fear of collisions prevents many people from taking up cycling. The empirical results obtained from the models provide valuable insights to assist transport and enforcement agencies to improve cyclist safety.
36
Handschin, Charles. "Spectroscopie EUV résolue temporellement à l'échelle femtoseconde par imagerie de vecteur vitesse et génération d'harmoniques d'ordres élevés." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00944627.
Full textAbstract:
Cette thèse fait l'étude expérimentale de dynamiques de relaxations ultrarapides au sein d'atomes et de molécules (Ar, NO2, C2H2). Les méthodes expérimentales qui sont utilisées sont basées sur l'interaction d'un rayonnement laser avec le système atomique ou moléculaire étudié et font intervenir le processus de génération d'harmoniques d'ordres élevés, ainsi que la spectrométrie d'imagerie de vecteur vitesse. Au cours de cette thèse, deux approchesexpérimentales de type pompe-sonde ont été mises en œuvre. Une première approche exploitela sensibilité du processus de génération d'harmoniques à la structure électronique dumilieu pour la sonder. Cette méthode a été utilisée sur la molécule de dioxyde d'azote pourobserver sa relaxation électronique à travers l'intersection conique des états X2A1-A2B2suite à une excitation autour de 400 nm. Une seconde approche utilise le rayonnementharmonique comme source de photons dans le domaine de l'extrême ultraviolet (EUV)pour exciter ou sonder les espèces d'intérêt. Cette approche a été couplée avec l'utilisationd'un spectromètre d'imagerie de vecteur vitesse (VMIS), qui a été développé durant lathèse. Des expériences menées sur un système modèle comme l'argon ont permis de validerle dispositif expérimental, qui a ensuite été mis en application pour étudier la photodissociationde la molécule d'acétylène, après excitation autour de 9,3 eV du complexe deRydberg 3d-4s. Les deux méthodes mises en œuvre permettent toutes-deux de réaliserdes études dynamiques résolues en temps à l'échelle femtoseconde.
37
Rossignol, Sophie. "La reconnaissance des discriminations multiples en droit du travail français : état des lieux et perspectives." Thesis, Strasbourg, 2017. http://www.theses.fr/2017STRAA010.
Full textAbstract:
La non-discrimination est une notion en constante évolution. Elle se doit d’être réceptive aux nouvelles formes discriminatoires vécues par les travailleurs afin de garantir un niveau de protection juridique conforme aux exigences internationales et nationales. En ce sens, les discriminations multiples sont un parfait exemple. Il s’agit de situations dans lesquelles interviennent et interagissent plusieurs motifs prohibés. Or, le concept de discriminations multiples, issu des sciences sociales, n’est théorisé en droit que depuis les années 1980. Si elles sont inconnues du droit positif, la doctrine et la pratique tendent à souligner la nécessité de leur reconnaissance juridique. Saisies par le droit du travail, elles posent de nombreuses questions quant à leur définition et leur mise en oeuvre. Leur étude va permettre de délivrer une approche différente de l’exigence de non-discrimination en droit du travail mais également des objectifs de diversité en entreprise<br>Anti-discrimination law is always evolving. It must be receptive to new types of discrimination against workers to guarantee a level of legal protection consistent with international and national standards. In that sense, multiple discriminations are a perfect example. They take place when several protected characteristics occur and interact with each other. The concept of multiple discriminations arises from social sciences but has only been legally theorized since the 80s. If French law does not consider them, jurisprudence and practice tends to underline the necessity of a legal acknowledgment. Seized by employment law, multiple discriminations pose many questions with regard to their definition and implementation. Nonetheless, studying them offers a different approach to the duty to not discriminate at work, and to insuring diversity in the workplace
38
Milliet, Cédric. "Propriétés algébriques des structures menues ou minces, rang de Cantor Bendixson, espaces topologiques généralisés." Phd thesis, Université Claude Bernard - Lyon I, 2009. http://tel.archives-ouvertes.fr/tel-00442772.
Full textAbstract:
Les structures menues apparaissent dans les années 1960 de paire avec la conjecture de Vaught, dont elles sont les seuls contre-exemples possibles. Les structures minces sont introduites par Belegradek, et englobent à la fois les structures minimales et menues. Il est bien connu que les ensembles définissables d'une structure mince sont rangés par le rang de Cantor-Bendixson, lorsque l'on fixe un ensemble fini de paramètres. L'étude de ces structures est rendue difficile par le fait que si l'on augmente cet ensemble de paramètres, le rang croît, et on ne sait maîtriser sa croissance. Nous présentons des propriétés de calcul de ce rang, une condition de chaîne descendante locale sur les groupes définissables (par des formules faisant intervenir des paramètres de la clôture algébrique d'un ensemble fini), ainsi qu'une notion de presque stabilisateur local. Nous en déduisons des propriétés algébriques des structures minces : un corps mince de caractéristique positive est localement de dimension finie sur son centre (une réponse au problème 6.1.5 de Wagner, Simple Theories), et un groupe mince infini a un sous groupe abélien infini (cela répond en particulier à la question 2.8 de Wagner, "Groups in simple theories"). Nous nous intéressons ensuite aux structures menues infiniment définissables, et montrons que les groupes d'arité finie infiniment définissables (par des formules n'utilisant que les paramètres d'un ensemble fini) sont l'intersection de groupes définissables (réponse au problème 6.1.14 du livre de Wagner). Nous étendons le résultat aux demi-groupes, anneaux, corps, catégories et groupoïdes infiniment définissables (toujours avec un nombre fini de paramètres), et donnons des résultats de définissabilité locale pour les groupes et corps simples et menus, infiniment définissables sur un ensemble quelconque de paramètres. Enfin, nous réintroduisons le rang de Cantor dans son contexte topologique et montrons que la dérivée de Cantor peut être vue comme un opérateur de dérivation dans un semi-anneau d'espaces topologiques. Dans l'idée de trouver un rang de Cantor global pour les théories stables, nous essayons de nous débarrasser du mot dénombrable omniprésent lorsque l'on fait de la topologie, en le remplaçant par un cardinal régulier k. Nous développons une notion d'espace k-métrique, de k-topologie, de k-compacité etc. et montrons un k-analogue du lemme de métrisabilité d'Urysohn, et du théorème de Cantor-Bendixson.
39
Thach, Thida. "La représentation de la violence faite aux femmes dans 'Un dimanche à la piscine à Kigali' de Gil Courtemanche et 'Je m’appelle Bosnia' de Madeleine Gagnon." Thesis, Université d'Ottawa / University of Ottawa, 2014. http://hdl.handle.net/10393/31460.
Full textAbstract:
La violence faite aux femmes est une réalité encore très présente, surtout dans les sociétés patriarcales, même après des décennies de lutte féministe. C’est aussi un thème privilégié en littérature. La présente thèse propose justement une analyse de ce thème à travers deux romans assez récents qui mettent tous deux de l’avant des aspects particuliers de la question : Un dimanche à la piscine à Kigali de Gil Courtemanche et Je m’appelle Bosnia de Madeleine Gagnon. Nous tenterons de cerner les différentes formes de violences à l’œuvre dans les deux narrations : la violence faite aux filles, celle faite aux femmes, et enfin la violence spécifique qu’engendrent les conflits armés avec le viol comme arme de guerre. Nous proposerons une analyse intersectionnelle de ces formes de violences afin de mesurer les représentations et les répercussions des notions de classe et de race eu égard aux toiles de fond différentes des deux romans : le génocide chez Courtemanche, le nettoyage ethnique chez Gagnon. Nous aborderons aussi les narrations sous l’angle de l’agentivité. Dans des sociétés fondamentalement patriarcales, quel pouvoir peuvent espérer avoir les personnages féminins sur leur destin personnel et collectif? Y a-t-il pour ces femmes fictives des stratégies possibles pour atteindre une liberté d’action, si mince soit-elle?
40
Yen, Yu, and 顏愉. "Applying Bayesian Models to Analyze Motorcycle Crashes at Signalized Intersections by Collision Types." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/81763885410742482808.
Full textAbstract:
碩士<br>國立臺灣大學<br>土木工程學研究所<br>103<br>Since the motorcycle is the most common type of vehicle used in Taiwan, it accounts for the largest proportion of all of Taiwan’s vehicles. Consequently, it is important to accurately understand the frequency of motorcycle crashs. However, the mixed traffic characterists (including motorcycles and cars) on Taiwan’s roads increses the difficulty of modeling such crashes. The objective of this study is to identify the impact factors of crashes at signalized intersections. This study applied Bayesian models in an effort to analyze motorcycle crashes according to the following common collision types that occur at signal-controlled intersection: through with right turn, through with opposing left turn, right angle, and sideswipe from the same direction. A total of 128 approaches to 32 four-leg intersections in Taiwan were used for this analysis. Two Bayesian models, the Hierarchical Poisson-gamma and Poisson-lognormal models, were explored. Compared to DIC, the Hierarchical Poisson-gamma model was found to be better than the Poisson-lognormal model for all four collision types. The results of this study show the relationship between the crash frequency of motorcycles and the intersection characteristics that occur in mixed-traffic flows, which is representative of the unique road designs and traffic control methods common in Taiwan (including the presence of express / slow traffic dividers, the number of motorcycle permit lanes, and the number of fast lanes). The results indicate that different collision types can be attributed to different accident factors. The results also show that an accident factor analysis performed according to collision type can be useful in describing the targeted causes. It is expected that the results of this study will help to develop more effective corresponding safety countermeasures in areas of Southeast Asia faced with such mixed traffic flows, such as Taiwan, China, and Viennam.
41
Pereira, Mário José Parreira. "Liquid Intersection Types." Master's thesis, 2014. https://repositorio-aberto.up.pt/handle/10216/75622.
Full text
42
Pereira, Mário José Parreira. "Liquid Intersection Types." Dissertação, 2014. https://repositorio-aberto.up.pt/handle/10216/75622.
Full text
43
Treglia, Riccardo. "The computational core: reduction theory and intersection type discipline." Doctoral thesis, 2022. https://hdl.handle.net/2318/1886182.
Full textAbstract:
Moving from the abstract definition of monads, we introduce a version of the
call-by-value computational λ-calculus based on Wadler’s variant, without let, and
with unit and bind operators. We call the calculus computational core and study its
reduction, and prove it confluent. In particular, the reduction rules are the relation
obtained by orienting the monadic laws from left to right. The rules induced by
associativity and identity make the behaviour of the reduction, and the study of
its operational properties, non- trivial. This happens in the setting of any monadic
lambda-calculus, independently of the syntactic representation of the calculus that
internalizes them. Hence, the focus of our operational analysis is on two crucial
properties: returning a value and having a normal form. The cornerstone of our
analysis is factorization results. Weak factorization can be achieved by considering
the surface reduction relation, a contextual closure of calculi based on linear logic.
We expose the operational role of the rules associated with the monadic laws of
identity and associativity. We then analyze the property of having a normal form
(normalization), and then a family of normalizing strategies, i.e. sub-reductions
that are guaranteed to reach a normal form, if any exists. To deal with that we
rely on a quantitative analysis of the number of βc-steps.
In a second part, we study a Curry style type assignment system for the computational
core. We introduce an intersection type system inspired by Barendregt,
Coppo, and Dezani system for ordinary untyped λ-calculus, establishing type
invariance under conversion. Finally, we introduce a notion of convergence, which
is precisely related to reduction, and characterize convergent terms via their types.
In the last part, we study the semantics of an untyped lambda-calculus equipped
with operators representing read and write operations from and to a global store.
We adopt the monadic approach to model side-effects and treat read and write as
algebraic operations over a monad. We introduce an operational semantics.
The intersection type assignment system is indeed derived by solving a suitable
domain equation in the category of omega-algebraic lattices; the solution consists
of a filter-model generalizing the well known construction for ordinary lambdacalculus.
Then the type system is obtained out of the term interpretations into
the filter-model itself. The so obtained type system satisfies the “type-semantics”
property (the semantics of a term is precisely the set of types that can be assigned
to it) by construction.
Finally, we prove that types are invariant under reduction and expansion of
term and state configurations, and characterize convergent terms via their typings.
44
Chuang, Che Wei, and 莊哲維. "A Study of Combined Road Type and Collision Diagram to Improve on Hazardous Intersections." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/18696295084905124423.
Full textAbstract:
碩士<br>國立臺灣大學<br>土木工程學研究所<br>102<br>Most studies of hazard intersection improvements use statistics and analyze features of hazard intersection, then give rough suggestions, such as add warning signs, paint guiding markings, or implementation strict traffic law enforcement. But they don’t discuss or study from practical road types. Currently, the main improved measures emphasis on the use of signs and markings such as warning and guidance devices, or adjust seconds of signals. For the whole intersection design, sight distance, driving route, it failed to effectively integrate into the improvement measures, so let improved efficiency discounted.
Thence, this research is based on the characteristics of different type of road intersection to combine collision diagrams corresponding to similar intersection for improvement strategies. The research selects 20 accident-prone intersections to plan improved measures for each corresponding intersections type in Kaohsiung City.
Currently, for improvement measures of the accident prone intersection, not yet
have a more complete procedure. The research references collision diagrams to combine with different type of intersection to design. By road type classifications and improved phase, to execute design of road space and clear obstacles of sight distance, the research tries to establish improvements of the correspondence the causes of the major intersection. It is expected to reduce about 60% accidents, caused by the improper road geometric design, signals design, and signs and markings problems.
We can found that there are different improvement ways for different road type, and the main design principle is that keeps close to orthogonal intersection, provide sufficient all red and yellow time (clearance time), provide good signs and markings guide, and so on. To ensure that the process of driving through the intersection to have good vision, sufficient green time, and appropriate stop space and through space, etc.
In accordance with the principles of design will be able to effectively improve the accident problem in hazard intersection.
45
Ferrara, Christine Therese. "Metabolic Pathways of Type 2 Diabetes intersection of Genetics, Transcriptomics, and Metabolite Profiling." Diss., 2008. http://hdl.handle.net/10161/694.
Full text
46
Noguchi, Kimihiro. "Combination of Levene-Type Tests and a Finite-Intersection Method for Testing Trends in Variances." Thesis, 2009. http://hdl.handle.net/10012/4365.
Full textAbstract:
The problem of detecting monotonic increasing/decreasing trends in variances from k samples is widely met in many applications, e.g. financial data analysis, medical and environmental studies. However, most of the tests for equality of variances against ordered alternatives rely on the assumption of normality. Such tests are often non-robust to departures from normality, which eventually leads to unreliable conclusions. In this thesis, we propose a combination of a robust Levene-type test and a finite-intersection method, which relaxes the assumption of normality. The new combined procedure yields a more accurate estimate of sizes of the test and provides competitive powers. In addition, we discuss various modifications of the proposed test for unbalanced design cases. We present theoretical justifications of the new test and illustrate its applications by simulations and case studies.
47
Campbell, John R. "The use and impact of crash type and vehicle damage on intersection crash severity rankings." 2005. http://catalog.hathitrust.org/api/volumes/oclc/62521636.html.
Full textAbstract:
Thesis (M.S.)--University of Wisconsin--Madison, 2005.<br>Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (p. 73-75).
48
Deng, Jun active 2013. "A novel approach to modeling and predicting crash frequency at rural intersections by crash type and injury severity level." Thesis, 2013. http://hdl.handle.net/2152/23634.
Full textAbstract:
Safety at intersections is of significant interest to transportation professionals due to the large number of possible conflicts that occur at those locations. In particular, rural intersections have been recognized as one of the most hazardous locations on roads.
However, most models of crash frequency at rural intersections, and road segments in general, do not differentiate between crash type (such as angle, rear-end or sideswipe) and injury severity (such as fatal injury, non-fatal injury, possible injury or property damage only). Thus, there is a need to be able to identify the differential impacts of intersection-specific and other variables on crash types and severity levels. This thesis builds upon the work of Bhat et al., (2013b) to formulate and apply a novel approach for the joint modeling of crash frequency and combinations of crash type and injury severity. The proposed framework explicitly links a count data model (to model crash frequency) with a discrete choice model (to model combinations of crash type and injury severity), and uses a multinomial probit kernel for the discrete choice model and introduces unobserved heterogeneity in both the crash frequency model and the discrete choice model, while also accommodates excess of zeros. The results show that the type of traffic control and the number of entering roads are the most important determinants of crash counts and crash type/injury severity, and the results from our analysis underscore the value of our proposed model for data fit purposes as well as to accurately estimate variable effects.<br>text
49
Ott, Tassilo [Verfasser]. "Aspects of stability and phenomenology in type IIA orientifolds with intersecting D6-branes / von Tassilo Ott." 2003. http://d-nb.info/968772889/34.
Full text
50
Bhargava, Sandeep. "Realizations of BC(r)-graded intersection matrix algebras with grading subalgebras of type B(r), r greater than or equal to 3 /." 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:NR45986.
Full textAbstract:
Thesis (Ph.D.)--York University, 2008. Graduate Programme in Mathematics and Statistics.<br>Typescript. Includes bibliographical references (leaves 275-278). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:NR45986