Relevant bibliographies by topics / Unification / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Unification.

Dissertations / Theses on the topic 'Unification'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 September 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Unification.'

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

Galán, García María Ángeles. "Categorical Unification." Doctoral thesis, Umeå University, Computing Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245.

Full text
Abstract:

This thesis deals with different aspects towards many-valued unification which have been studied in the scope of category theory. The main motivation of this investigation comes from the fact that in logic programming, classical unification has been identified as the provision of coequalizers in Kleisli categories of term monads. Continuing in that direction, we have used categorical instrumentations to generalise the classical concept of a term. It is expected that this approach will provide an appropriate formal framework for useful developments of generalised terms as a basis for many-valued logic programming involving an extended notion of terms.

As a first step a concept for generalised terms has been studied. A generalised term is given by a composition of monads that again yields a monad, i.e. compositions of powerset monads with the term monad provide definitions for generalised terms. A composition of monads does, however, not always produce a monad. In this sense, techniques for monads composition provide a helpful tool for our concerns and therefore the study of these techniques has been a focus of this research.

The composition of monads make use of a lot of equations. Proofs become complicated, not to mention the challenge of understanding different steps of the equations. In this respect, we have studied visual techniques and show how a graphical approach can provide the support we need.

For the purpose of many-valued unification, similarity relations, generalised substitutions and unifiers have been defined for generalised terms.

APA, Harvard, Vancouver, ISO, and other styles
2

Wilbanks, John W. (John Winston). "Linear Unification." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc500971/.

Full text
Abstract:
Efficient unification is considered within the context of logic programming. Unification is explained in terms of equivalence classes made up of terms, where there is a constraint that no equivalence class may contain more than one function term. It is demonstrated that several well-known "efficient" but nonlinear unification algorithms continually maintain the said constraint as a consequence of their choice of data structure for representing equivalence classes. The linearity of the Paterson-Wegman unification algorithm is shown largely to be a consequence of its use of unbounded lists of pointers for representing equivalences between terms, which allows it to avoid the nonlinearity of "union-find".
APA, Harvard, Vancouver, ISO, and other styles
3

Galán, Garcia Maria Ángeles. "Categorical unification /." Umeå : Univ, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hum, Herbert Hing-Jing. "A linear unification processor /." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63790.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Astorga-Saenz, Francisco Antonio. "Coupling constants and unification." Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5668/.

Full text
Abstract:
The first part of this work gives a general background for the ideas involved in the research presented in this thesis. Coupling constants, Renor-malisation Group Equation, Grand Unified Theories (GUTs) and Super symmetry (SUSY) are briefly introduced. Following this, we analyse the unification parameters M(_GUT) and l/α(_GUT) as functions of the number of fermion families (F) and Higgs boson multiplets (S). Analytical and numerical solutions to the leading and next-to-leading order evolution equation for the couplings a, are obtained. This is done in the context of the Standard Model embedded in SU(5), SUSY SU(5) and L-R SO(IO). In all these GUTs, the first order analytical approach proves itself a useful probe to examine the structure of M(_GUT) and l/α(_GUT) in terms of the variables F and S. General trends remain the same after including second order corrections to the evolution equations. Recent precision data for the coupling constants allow more definitive conclusions to be reached. We find that restrictions on the unification parameters constrain F and S in such a way that SU(5) is ruled out by constraints on 5 (in agreement with previous results), F is severely limited in SUSY SU(5) and, unlike SUSY SU(5), an acceptable unification scenario can still be obtained when Higgs bosons are ignored in L-R SO(IO). The structures of the latter two GUTs are found to be very different although some features are common to both.
APA, Harvard, Vancouver, ISO, and other styles
6

Dalvi, Sameera. "The Bundeswehr after unification." Thesis, University of Southampton, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.340317.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jansson, Henrik. "Unification in Particle Physics." Thesis, Uppsala universitet, Högenergifysik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-295813.

Full text
Abstract:
During the twentieth century, particle physics developed into a cornerstone of modern physics, culminating in the Standard Model. Even though this theory has proved to be of extraordinary power, it is still incomplete in several respects. It is our aim in this bachelor thesis to discuss some possible theories beyond the Standard Model, the main focus being on Grand Unified Theories, while also taking a look at attempts of further unication via discrete family symmetry. At the heart of all these theories lies the concept of local gauge invariance, which is introduced as a fundamental principle, followed by an overview of the Standard Model itself. No theory has so far managed to unify all elementary particles and their interactions, but some interesting features are highlighted. We also give a hint at some possible paths to go in the future in the quest for a unication in particle physics.
Under 1900-talet utvecklades partikelfysiken till en av de fundamentala teorierna inom fysiken, och kom att sammanfattas i den s.k. Standardmodellen. Även om denna modell rönt exceptionella framgånger vad gäller beskrivningen av elementarpartiklar och deras växelverkan, är den fortfarande ofullständig på flera sätt. Syftet med denna kandidatuppsats är att diskutera möjliga teorier bortom Standardmodellen såsom Storförenande Teorier och diskreta familjesymmetrier vars avsikt är att koppla samman de tre familjerna av fermioner i Standardmodellen. Men först introduceras idén om lokal gaugeinvarians, vilken ligger till grund for dessa teorier, varpå en översikt av Standardmodellen följer. Ingen teori har ännu lyckats ge en helt tillfredsställande bild av elementarpartiklar och deras interaktion, men en del intressanta egenskaper hos föreslagna teorier belyses i denna uppsats. Slutligen ges en del spekulativa förslag på väger att gå i framtida försök till föreningar inom partikelfysiken.
APA, Harvard, Vancouver, ISO, and other styles
8

Degandt, Catherine. "Justice allemande et unification." Lille 2, 1996. http://www.theses.fr/1996LIL20008.

Full text
Abstract:
L'unification de la republique federale d'allemagne et de la republique democratique allemande a provoque la disparition de l'ensemble du systeme judiciaire est-allemand. Les annciennes juridictions ont progressivement laisse place aux institutions judiciaires de l'ouest, dont l'installation fut amplement facilitee par une aide massive des anciens lander occidentaux. Le personnel judiciaire a, quant a lui, subi les affres d'une vague d'epuration, qui obligea les personnes licenciees a une reconversion professionnelle (pas toujours souhaitee par les professions "d'accueil") et contraignit les personnes recrutees a une formation et une adaptation rapide, tant aux structures nouvelles qu'aux collegues venus de l'ouest, jeunes ou moins jeunes, entamant ou redemarrant une carriere. The unification of the german democratic republic with the federal republic of germany has caused all of the east german judicial system to disappear. The old jurisdictions progressively gave way to the western judicial institutions, the setting up of which was made easier to a large extent by a massive help from the old west lander. The judicial personnel was, for his part, subjected to a wave of purge which compelled the dismissed persons to a professional reconversion (not always wished by the "reception" professions) and forced the recruited persons to be trained and rapidly get used to the new structures as well as their colleagues from the west, whether young or older, beginning a career or strating it again.
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Boo-Kyoon. "Korean unification : problems and solutions /." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA294327.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ferrero, Elisa. "Unification of radio-loud AGN." Diss., lmu, 2005. http://nbn-resolving.de/urn:nbn:de:bvb:19-30879.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

Cosme, Nicolas. "Matter asymmetry and gauge unification." Doctoral thesis, Universite Libre de Bruxelles, 2004. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211132.

Full text
Abstract:
Pourquoi reste-t-il de la matière dans l’univers ?Depuis la découverte de l’anti-matière, miroir de la matière dont nous sommes constitués et s’annihilant de prime abord parfaitement avec cette dernière, ce mystère stimule l’étude des propriétés communes et distinctes entre particules et anti-particules.

Dans ce cadre, il a été établi au vu des interactions dites de jauge (en particulier les interactions électrofaibles) que la symétrie intrinsèque entre particules et anti-particules est la combinaison subtile du conjugué de charge (C) et de la parité d’espace (P) :la symétrie CP. Ainsi, un comportement distinct entre matière et anti-matière est caractérisé au niveau fondamental par une violation de CP.

D’une part, une telle violation a été mise en évidence expérimentalement dans la désintégration de mesons K et B, où la production de particules dans certains canaux est favorisée. D’autre part, la violation de CP est l’une des conditions requises à la création d’un excès de matière durant l’évolution de l’univers.

Dans la présente thèse, nous étudions deux aspects de cette asymétrie entre matière et anti-matière.

Tout d’abord, un scénario de création d’un excès de matière dans l’évolution de l’univers basé sur la désintégration de neutrinos lourds est étudié. Les récents résultats expérimentaux sur l’existence d’une masse pour les neutrinos rendent très attractif ce scénario. Bien que le schéma général repose uniquement sur les interactions liées à la masse des particules (secteur scalaire), nous le prolongeons ici dans la perspective plus naturelle de l’unification des interactions de jauge, seule motivation complète à l’inclusion de neutrinos lourds dans le spectre des particules. L’inclusion d’interactions de jauge liées aux neutrinos lourds complète ainsi la description. Les résultats tirés sur les paramètres de masse des neutrinos, grandes inconnues de la physique des particules, s’en voient modifiés de manière importante.

Ensuite, la question de l’origine de la violation de CP est posée. En effet, dans la description standard des interactions faibles, la violation de CP est explicite et résulte uniquement de la liberté pour les couplages de masse (couplages de Yukawa) d’être des nombres complexes. Ainsi, aucune compréhension fondamentale sur la différence de comportement entre particules et anti-particules n’est apportée.

Nous proposons dans ce sens une source de violation de CP par la compactification d’une théorie de jauge dans un espace de dimensions étendues. A partir de couplages réels, une valeur classique de la composante supplémentaire des bosons de jauge fournit une masse effective complexe aux fermions. Les conditions de l’obtention d’une violation de CP physique sont alors étudiées. Nous identifions la structure minimale pour rendre compte des interactions électrofaibles tout en incluant une source de violation de CP dans ce contexte. L’unification avec les interactions fortes est alors établie dans une structure qui apporte une lumière différente sur les schémas d’unification usuels.


Doctorat en sciences, Spécialisation physique
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles
12

Su, Yang M. Eng Massachusetts Institute of Technology. "File system unification using LatticeFS." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53145.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 57-58).
LatticeFS is a namespace unification system designed to merge multiple source file systems into a single working file system. atticeFS can be used to merge multiple software package directories, work with multiple file systems as if they are one, and share a single storage medium among multiple machines. On a high level, LatticeFS takes as input an arbitrary number of file system paths, and mounts a new virtual drive that will appear to the user as a union of the input file systems. Of course, attempting to combine multiple file systems will inevitably be met with conflicts. Situations in which multiple input file systems contain files/directories with the same name will be common in large systems; which file/directory should the user be exposed to in this case? Previous work such as UnionFS solved the problem by giving each input file system a strict priority value, and when a conflict occurred, the file/directory with the highest priority was the one shown to the user. In LatticeFS, we have introduced a plug-in system in which different strategies for resolving conflicts can be easily swapped in and out; additionally, handlers for special file types can also be "plugged" into the system. This paper describes and evaluates all aspects of LatticeFS in detail.
by Yang Su.
M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
13

Alyafai, Yahya. "Gulf Cooperation Council monetary unification." Kansas State University, 2011. http://hdl.handle.net/2097/9191.

Full text
Abstract:
Master of Arts
Department of Economics
Steven P. Cassou
In this report, I investigate the possibility of a monetary unification among the Arab States. The Gulf Cooperation Council (GCC) states that include Bahrain, Saudi Arabia, Qatar, UAE, Kuwait and Oman are coming together on the basis of common ethnicity, religion, culture, traditions, and monetary issues. This research will discuss different factors upon which the monetary unification and the birth of a new currency depend. For comparison to the Euro, I closely examined different factors such as inflation rates, exchange rates, trade, etc. over the past decade. As stated, this examination was done to see how these factors compare with those of the Euro region to determine if a similar monetary unification among the GCC states is possible. The target date for launching the new GCC currency was January 1, 2010; however that date has long passed. Although the above mentioned factors are favorable to currency unification of the GCC states, ample time is necessary to achieve such a herculean feat. After all, the Europeans did not achieve the unification of the Euro in one night. One hurdle to unification is that the GCC states still need to control the inflation rates in their own economies. Other economic factors, such as trade, have been favorable for all the GCC states, and all the states have been doing well in terms of the U.S. dollar (USD). Although unification may not have met the January 1, 2010 goal, the GCC will still be observing the economic factors and considering other possible scenarios. All the GCC countries vow to achieve this unification.
APA, Harvard, Vancouver, ISO, and other styles
14

Popowich, Frederick Paul. "Reflexives and tree unification grammar." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/12793.

Full text
Abstract:
Although there has been a great deal of research into identifying the constraints responsible for the distribution of reflexive pronouns (like himself, herself, themselves), accounts of reflexivisation are often based entirely on syntactic factors. Furthermore, it is usually assumed that a reflexive and its antecedent (i.e. the noun phrase to which a reflexive pronoun 'refers') must be from the same sentence, and the anaphoric relationship between a reflexive and its antecedent is often established based on a complete structural analysis of the sentence containing them. In this thesis, we propose a treatment of reflexives in which an anaphoric relationship between pronoun and antecedent can be established based on information contained in partial structures associated with linguistic expressions. There is no need to obtain a complete structural analysis before performing anaphora resolution, and information obtained from anaphora resolution can be used to constrain possible analyses. In presenting an account for the distribution of locally bound reflexives in English and of long distance reflexives in Icelandic, we will see that the same general treatment will be applicable to local as well as non-local reflexive anaphoric phenomena. Our first goal is to establish the constraints that are relevant for the distribution of reflexive pronouns. Then a declarative unification-based linguistic framework will be introduced in which these constraints can be stated. Within a declarative framework, constraints can be stated independent from any processing strategy. The basic grammar structures of this framework will be partial specifications of trees, and the framework will require only a single grammar rule to combine these partial specifications. Finally, we will illustrate how various phenomena associated with reflexive pronouns can be accounted for in this framework. We will provide an account for the distribution of reflexives appearing in complement causes, picture-noun constructions, possessives, unbounded dependency constructions, prepositional phrases, and constructions where reflexives can have either 'sloppy' or 'strict' readings.
APA, Harvard, Vancouver, ISO, and other styles
15

Klay, Francis. "Unification dans les théories syntaxiques." Nancy 1, 1992. http://www.theses.fr/1992NAN10331.

Full text
Abstract:
L'objectif de cette thèse est l'étude d'une sous-classe des théories équationnelles appelée classe des théories syntaxiques. Après avoir introduit les notions de base, un ensemble de règles pour l'unification par décomposition dans les théories syntaxiques est donné. Ensuite, c'est le lien entre syntaxicité et système formel de la logique équationnelle qui est développé. Par ailleurs, un lien entre unification et syntaxicité est exposé. Une conséquence de ce résultat est: une théorie est syntaxique si elle est finitaire pour l'unification. Vient alors la question de savoir si la syntaxicité est une propriété décidable. Nous montrons que ce n'est malheureusement pas le cas, et ceci même en imposant des conditions très restrictives. Un résultat du même ordre est démontre pour la validité uniforme du problème du mot dans les théories syntaxiques. Suite à ces résultats d'indécidabilité, différentes restrictions sont étudiées. Finalement, la décidabilité du filtrage et de l'unification est démontrée pour certaines sous-classes de théories syntaxiques
APA, Harvard, Vancouver, ISO, and other styles
16

Delsart, Bertrand. "E-unification en démonstration automatique." Grenoble INPG, 1994. http://tel.archives-ouvertes.fr/tel-00005085.

Full text
Abstract:
Depuis les travaux de Martelli et Montanari en 1982, la resolution de problemes de E-unification s'effectue souvent par transformation de systemes d'equations. L'objectif de cette these est de presenter des nouvelles regles de transformations qui de- crivent de facon unifiee comment appliquer des axiomes a la ra- cine des termes. Les proprietes theoriques de ces regles sont etablies (correction, completude. . . ). Nous prouvons egalement que cette approche, basee sur la notion de presentations strictement resolventes, est plus generale que des algorithmes tres connus (Root-Rewriting [J. Gallier & W. Snyder ], Mutation Syntaxique [C. Kirchner ]). Une analyse du comportement de ces regles per- met d'etablir l'inter^et de l'application d'axiomes a la racine et de definir le type de presentations strictement resolventes qui devraient fournir les meilleurs resultats. Ces presentations sont generees automatiquement. Pour ce faire, nous introduisons la notion de completion strictement resolvente. Elle permet de definir les proprietes theoriques des regles de completion donnees. Differentes strategies sont etu- diees, allant d'une strategie qui termine toujours a la strategie (parfois divergente) conduisant a une presentation tres efficace. Des recherches theoriques peuvent s'effectuer dans ce (nouveau) formalisme general. Elles s'appliquent aux algorithmes subsumes par cette approche. Par exemple, les avantages vis a vis du parallelisme sont etablis et conduisent a une presentation compacte de l'ensemble des unificateurs. Des optimisations theoriques plus complexes sont egalement etudiees. La detection des instanciations inutiles des variables lors de l'unification d'un terme avec les t^etes de regles est la plus importante. Elle permet d'etablir la completude des solutions donnees pour un probleme m^eme si la presentation n'est pas strictement resol- vente (completion divergente). Les resultats experimentaux mettent en valeur la simplicite et la generalite de cette nouvelle approche. Sa generalite permet egalement de comparer les differents algorithmes et de justifier l'utilisation de la strategie non complete de generation des re- gles. L'etude de cas particuliers montre que l'on peut ainsi ob- tenir des resultats tres interessants en un temps tout a fait raisonnable. On peut donc envisager d'utiliser ce module de E- unification au sein d'un demonstrateur
Since Martelli and Montanari's work in 1982, E-unification problems are often considered are set of equations. This thesis presents new transformation rules which describe application of axioms at the root of the terms. The theoretical properties are established (soundness, completeness,. . . ). We also prove that this approach, based on strictly resolvent presentations, is more general than well known algorithms (Root-Rewriting [J. Gallier & W. Snyder], Syntactic mutation [C. Kirchner]). The analysis of the behavior of these rules proves the interest of the applica- tion of axioms at the root and suggests which strictly resolvent presentations should give the best results. These presentations are generated automatically. The theoreti- cal properties of the given completion rules are proved thanks to the notion of strictly resolvent completion. Different strategies are studied, going from a terminating strategy to a (potentially divergent) strategy resulting in very efficient presentations. Theoretical researches can be done in this (new) general frame- work. They apply to the subsumed algorithms. For instance, paral- lelism is studied and leads to a compact presentation of the com- puted unifiers. Other more complex optimisations are also stu- died. The detection of useless instanciations while unifying with the left hand-side of a rule is the most important. It is useful to prove the completeness of the solution found for a given prob- lem when the presentation is not strictly resolvent (divergent completion). Experimental results show the simplicity and the generality of this new approach. Its generality allows comparison with other well-known algorithms and justifies the usefulness of the diver- gent strategy. The study of particular cases proves that it leads to very interesting results in a reasonable time. Thus, this E- unification procedure can be used in a theorem prover
APA, Harvard, Vancouver, ISO, and other styles
17

Beaven, John L. "Lexicalist unification-based machine translation." Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/19993.

Full text
Abstract:
A novel approach to Machine Translation (MT) called Shake-and-Bake, is presented, which exploits recent advances in Computational Linguistics in terms of the rise of lexicalist unification-based grammar theories. It is argued that it overcomes many deficiencies of current methods, such as those based on transfer rules, interlingual representations, and isomorphic grammars. The key advantages are a greater modularity of the monolingual components, which can be written with great independence of each other, using purely monolingual considerations. They can be used for parsing and generation, and may be used for multi-lingual translation systems. The two monolingual components involved in translation are put into correspondence by means of a bilingual lexicon which contains information similar to what one might expect to find in an ordinary bilingual dictionary. The approach is demonstrated by presenting very different Unification Categorial Grammars from small fragments of English and Spanish. Although their coverage is small, they have been chosen to contain linguistically interesting phenomena known to be difficult in MT, such as word order variation and clitic placement. These monolingual grammars are put into correspondence by means of a bilingual lexicon. The Shake-and-Bake approach to MT consists of parsing the Source Language in any usual way, then looking up the words in the bilingual lexicon, and finally generating from the set of translations of these words, but allowing the Target Language grammar to instantiate the relative word ordering, taking advantage of the fact that the parse produces lexical and phrasal signs which are highly constrained (specifically in the semantics). The main algorithm presented for generation is a variation on the well-known CKY one used for parsing.
APA, Harvard, Vancouver, ISO, and other styles
18

Forster, Brian A. "Korean unification the way forward." Thesis, Monterey, Calif. : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/March/09Mar%5FForster.pdf.

Full text
Abstract:
Thesis (M.A. in Security Studies (Far East, Southeast Asia, and Pacific))--Naval Postgraduate School, March 2009.
Thesis Advisor(s): Weiner, Robert. "March 2009." Description based on title screen as viewed on April 23, 2009. Author(s) subject terms: Korean unification, The Republic of Korea, The Democratic People's Republic of Korea, economic interdependence, special economic zones, free trade area, collapse. Includes bibliographical references (p. 87-92). Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
19

Abeyesinghe, Anura Yamesh Preskill John P. "Unification of quantum information theory /." Diss., Pasadena, Calif. : Caltech, 2006. http://resolver.caltech.edu/CaltechETD:etd-05252006-222551.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Lee, Jae-Suk. "Rethinking the Korean unification question /." Online version, 1996. http://bibpurl.oclc.org/web/34467.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Frielingsdorf, Jolinde. "Transitional criminal justice after German Unification and its international impact." Thesis, University of the Western Cape, 2010. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_5649_1362393925.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Stegeman, Jennie Marie. "Unification through tourism Cincinnati's riverfront revitalization /." Cincinnati, Ohio : University of Cincinnati, 2005. http://www.ohiolink.edu/etd/view.cgi?acc%5Fnum=ucin1114198767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Senoguz, Vedat Nefer. "Aspects of inflationary models and unification." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 114 p, 2007. http://proquest.umi.com/pqdweb?did=1251906411&sid=1&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Cornel, Christian. "East German broadcasting and social unification." Thesis, Goldsmiths College (University of London), 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.252021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
25

Schmitz, Jonathan L. "The economic implications of Korean unification." Thesis, Monterey, California. Naval Postgraduate School, 2002. http://hdl.handle.net/10945/5844.

Full text
Abstract:
Approved for public release; distribution unlimited
A major area of concern for Korean unification is the immense cost it will impose on South Korea. To lessen this burden, South Korea will need to initiate policy reforms that can ease the financial stress and repercussions of unification and create an integrated economic community with North Korea. At the same time, North Korea will need to create an environment that is conducive to economic integration by accepting and adopting reform measures that can build the foundation for a market economy. The two largest factors to any economic reform strategy in North Korea would be to overcome the changes to the political-belief system that drives the current economy and the strong link between the state and masses. A policy of engagement will create an environment in which inter-Korean dialogue and mutual cooperation could lead to a transformed, opened North Korea. The unification of Germany and Yemen offer pros and cons as well as similarities and dissimilarities to Korea to form certain conclusions, predictions, and prescriptions. The case studies of China and Vietnam provide a detailed analysis of planned economies transitioning to market economies. From these case studies, several conclusions are drawn regarding the implications of economic unification.
APA, Harvard, Vancouver, ISO, and other styles
26

Osborne, Miles. "Learning unification-based natural language grammars." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Surridge, M. "Unification through coset-space dimensional reduction." Thesis, University of Southampton, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Zeraschi, Maria. "Elizabeth Barrett Browning and Italian unification." Thesis, University of Wales Trinity Saint David, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.683326.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Briaud, Daniel. "Substitutions explicites et unification d'ordre supérieur." Nancy 1, 1997. http://www.theses.fr/1997NAN10251.

Full text
Abstract:
Les lambda-calculs à substitutions explicites fournissent un cadre formel pour l'étude de la théorie des substitutions. Ils constituent ainsi un pont entre le lambda-calcul et les programmes. Notre contribution, composée de deux volets, porte sur l'étude en soi des lambda-calculs à substitutions explicites et sur l'emploi d'un tel calcul comme pont entre théorie et pratique. Le premier volet a pour but l'explicitation de la eta-réduction, le second à trait à l'unification d'ordre supérieur. Notre travail sur la eta-réduction se résume ainsi. La beta-réduction du lambda-calcul distingue certaines fonctions extensionnellement égales. En ajoutant la règle de eta-réduction, on obtient une égalité extensionnelle. Nous définissons et étudions une règle eta opératoire et indépendante d'un calcul a substitutions explicites donne. Ceci nous conduit à une variante non-conditionnelle de eta, nommée eta. Nous montrons que la réduction générée est une extension conservative de la beta-eta-réduction, cela sur l'ensemble des lambda-termes typables avec l'intersection. Le second problème qui nous intéresse, l'unification d'ordre supérieur, consiste à résoudre des équations entre lambda-termes simplement types. Sa programmation demeure difficile à vérifier car l'algorithme classique est formellement défini au moyen de la substitution du lambda-calcul. Décrire une procédure d'unification d'ordre supérieur à l'aide de substitutions explicites établit une passerelle entre l'unification d'ordre supérieur et son implantation. Une approche précédente se fonde sur le système lambda-sigma' et s'appuie sur la composition et la confluente ouverte. Notre approche, basée sur le système lambda-upsilon, montre que ni l'une ni l'autre ne sont nécessaires pour exprimer l'unification d'ordre supérieur au moyen d'un lambda-calcul à substitutions explicites. Notre travail à ce sujet simplifie, sur plusieurs plans, les travaux précédents sur ce thème
APA, Harvard, Vancouver, ISO, and other styles
30

Limet, Sébastien. "Unification dans la programmation logico-equationnelle." Orléans, 1996. http://www.theses.fr/1996ORLE2068.

Full text
Abstract:
L'objectif de cette these est d'ameliorer la terminaison de l'unification semantique afin d'augmenter la declarativite des implantations des langages logico-equationnels. L'unification semantique etant indecidable, il est impossible de resoudre ce probleme de maniere definitive. Par consequent, dans cette these, nous avons etudie la terminaison de l'unification semantique sous deux aspects : l'un pratique en proposant une procedure d'e-unification dont le but est d'eviter les calculs inutiles, l'autre plus theorique en cherchant les restrictions necessaires pour toujours terminer. La premiere contribution de cette these est donc une procedure d'e-unification appelee surreduction conditionnelle dirigee par un graphe de termes. Le principe de cette procedure est d'utiliser un graphe de termes qui fait une approximation finie de l'ensemble des derivations de surreduction possibles afin d'eviter les calculs inutiles. En procedant ainsi, on peut empecher certaines boucles infinies. Nous comparons de maniere theorique la terminaison de notre procedure par rapport a d'autres algorithmes d'e-unification et nous presentons quelques resultats pratiques donnes par l'implantation de la surreduction dirigee. Dans le second volet de cette these, nous presentons des restrictions syntaxiques sur le probleme d'unification qui sont necessaires pour garantir la decidabilite de l'unifiabilite modulo un systeme de reecriture, autrement dit pour decider si le probleme d'unification que l'on resoud, a au moins une solution. Puis nous presentons un algorithme d'e-unification original base sur les langages d'arbres qui permet de decider l'unifiabilite. Cet algorithme introduit une nouvelle sorte de grammaire d'arbres qui permet de generer des langages contextuels et qui permet de representer finiment des ensembles infinis de solutions.
APA, Harvard, Vancouver, ISO, and other styles
31

BELALA, YACINE. "Systemes de production et unification connexionnistes." Paris 11, 1992. http://www.theses.fr/1992PA112441.

Full text
Abstract:
Le travail de recherche effectue dans le cadre de cette these est consacre a la representation et au traitement de connaissances symboliques par des architectures connexionnistes. La premiere partie de ce travail a ete motivee par la necessite de disposer d'un outil de diagnostic rapide et sur. Suivant ces criteres, nous avons defini un systeme de production ou les regles de production sont distribuees dans un reseau connexionniste. L'approche que nous avons suivie consiste a utiliser une meme unite pour contenir des informations relatives a plusieurs regles et a proposer un moyen d'acceder a chaque regle en particulier. Les regles sont par ailleurs evaluees par plusieurs unites ce qui a pour effet d'accroitre la robustesse du systeme de production. Le second volet de ce memoire aborde de facon restreinte les logiques d'ordre superieur, plus precisement la logique des predicats du premier ordre, et notamment la theorie de l'unification. Une approche connexionniste permettant d'unifier en parallele deux ou plusieurs termes est proposee. L'architecture retenue est une architecture modulaire constituee de reseaux relies entre eux de maniere hierarchique. L'unification des deux termes est realisee par l'intermediaire de la propagation de l'activite entre les unites de ces reseaux
APA, Harvard, Vancouver, ISO, and other styles
32

AMIOT, GILLES. "Unification et logique du second ordre." Paris 7, 1994. http://www.theses.fr/1994PA077003.

Full text
Abstract:
Cette these est une etude de l'unification et de ses rapports et liens avec la theorie de la demonstration. Premierement, nous regardons en details les problemes de decision pour l'unification des termes du second ordre en situant avec precision la frontiere qui separe la decidabilite de l'indecidabilite. Nous appliquons alors ces resultats au cas des predicats du second ordre et obtenons un resultat d'indecidabilite. Deuxiemement, nous montrons les liens existants entre la e-unification rigide et la logique lineaire du second ordre par un codage direct et simple. Finalement, nous appliquons ces resultats au cas de la logique lineaire multiplicative (et multiplicative-additive) du second ordre avec quantification du premier ordre pour en obtenir l'indecidabilite des que le langage contient une constante de fonction d'arite au moins egale a deux
APA, Harvard, Vancouver, ISO, and other styles
33

STEGEMAN, JENNIE M. "UNIFICATION THROUGH TOURISM: CINCINNATI'S RIVERFRONT REVITALIZATION." University of Cincinnati / OhioLINK, 2005. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1114198767.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Wagner, Christina. "James and Shakespeare: Unification through Mapping." Cleveland State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=csu1431114265.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Comon-Lundh, Hubert. "Unification et disunification : théorie et applications." Grenoble INPG, 1988. http://tel.archives-ouvertes.fr/tel-00331263.

Full text
Abstract:
Les règles de transformation des problèmes equationnels sont donnes permettant, en particulier, de décider de l'existence d'une solution fermée. Comme première application, il est montre comment calculer une grammaire pour le langage des termes fermes irréductibles par un système de réécriture. D'autres applications et extensions sont ensuite envisagées. En particulier, en programmation logique et dans les spécifications algébriques
APA, Harvard, Vancouver, ISO, and other styles
36

Comon, Hubert. "Unification et disunification théorie et applications." Grenoble : ANRT, 1988. http://catalogue.bnf.fr/ark:/12148/cb37593813b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Comon, Hubert Calmet Jacques. "Unification et disunification théorie et applications /." S.l. : Université Grenoble 1, 2008. http://tel.archives-ouvertes.fr/tel-00331263.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Corbett, Dan R. "Unification and constraints over conceptual structures." Title page, contents and summary only, 2000. http://web4.library.adelaide.edu.au/theses/09PH/09phc7889.pdf.

Full text
Abstract:
Bibliography: leaves 150-161. This thesis addresses two areas in the field of conceptual structures. The first is the unification of conceptual graphs, and the consequent work in projection and in type hierarchies... The second area of investigation is the definition of constraints, especially real-value constraints on the concept referents, with particular attention to handling constraints during the unification of conceptual graphs.
APA, Harvard, Vancouver, ISO, and other styles
39

Özer, Alp Deniz. "SO(10)-Grand Unification and Fermion Masses." Diss., lmu, 2005. http://nbn-resolving.de/urn:nbn:de:bvb:19-46957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Kostromov, Alexey V. "International unification of the law of agency." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ64286.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Schroeder, Susan Diane Moon Sun Myung. "The Unification Theological Seminary : an historical study /." Access Digital Full Text version, 1993. http://pocketknowledge.tc.columbia.edu/home.php/bybib/11396842.

Full text
Abstract:
Thesis (Ed.D.)--Teachers College, Columbia University, 1993.
Includes tables. Typescript; issued also on microfilm. Sponsor: Douglas Sloan. Dissertation Committee: William B. Kennedy. Includes bibliographical references (leaves 287-297).
APA, Harvard, Vancouver, ISO, and other styles
42

Giannopoulos, Araham Athanassiou. "On the unification of gravity and electromagnetism." Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338737.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Brown, Jason J. "Presentations of unification in a logical framework." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Tseng, Ian. "The Unification of Stylistic Form and Function." Research Showcase @ CMU, 2011. http://repository.cmu.edu/dissertations/71.

Full text
Abstract:
Great design is often the result of intelligent balancing of tradeoffs and leveraging of synergies between multiple product goals. While the engineering design community has numerous tools for managing the interface between functional goals in products, there are currently no formalized methods to concurrently manage stylistic form and functional requirements. The purpose of the work in this dissertation is to formalize ways to coordinate seemingly disparate but highly related goals of stylistic form and functional constraints in both computational design and for human designers. This work aims to provide a cohesive framework where both computational and cognitive findings are brought together to mutually inform and inspire the design process. First, this problem was approached computationally with the development of an Artificial Neural Network based machine learning system that allows consumer judgments of stylistic form to be modeled quantitatively. Coupling this quantitative model of stylistic form with a Genetic Algorithm enables computers to concurrently account for multiple objectives in the domains of stylistic form and function within the same quantitative framework. This coupling then opens the door for computers to automatically generate products that not only work well, but also look good doing it. Second, this problem was approached cognitively to explore ways to help human designers manage different goals of stylistic form and function more efficiently and effectively. An experiment was conducted which suggests that designers may sometimes have trouble fully utilizing knowledge they already have for managing different goals in design problems. This experiment shows evidence that analogical inspiration can help designers to overcome this knowledge block to more intelligently balance tradeoffs and leverage synergies in engineering design.
APA, Harvard, Vancouver, ISO, and other styles
45

Moraglio, Alberto. "Towards a geometric unification of evolutionary algorithms." Thesis, University of Essex, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.446045.

Full text
APA, Harvard, Vancouver, ISO, and other styles
46

Carroll, John Andrew. "Practical unification-based parsing of Natural Language." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.308272.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Williams, Philip James. "Unification-based constraints for statistical machine translation." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/9971.

Full text
Abstract:
Morphology and syntax have both received attention in statistical machine translation research, but they are usually treated independently and the historical emphasis on translation into English has meant that many morphosyntactic issues remain under-researched. Languages with richer morphologies pose additional problems and conventional approaches tend to perform poorly when either source or target language has rich morphology. In both computational and theoretical linguistics, feature structures together with the associated operation of unification have proven a powerful tool for modelling many morphosyntactic aspects of natural language. In this thesis, we propose a framework that extends a state-of-the-art syntax-based model with a feature structure lexicon and unification-based constraints on the target-side of the synchronous grammar. Whilst our framework is language-independent, we focus on problems in the translation of English to German, a language pair that has a high degree of syntactic reordering and rich target-side morphology. We first apply our approach to modelling agreement and case government phenomena. We use the lexicon to link surface form words with grammatical feature values, such as case, gender, and number, and we use constraints to enforce feature value identity for the words in agreement and government relations. We demonstrate improvements in translation quality of up to 0.5 BLEU over a strong baseline model. We then examine verbal complex production, another aspect of translation that requires the coordination of linguistic features over multiple words, often with long-range discontinuities. We develop a feature structure representation of verbal complex types, using constraint failure as an indicator of translation error and use this to automatically identify and quantify errors that occur in our baseline system. A manual analysis and classification of errors informs an extended version of the model that incorporates information derived from a parse of the source. We identify clause spans and use model features to encourage the generation of complete verbal complex types. We are able to improve accuracy as measured using precision and recall against values extracted from the reference test sets. Our framework allows for the incorporation of rich linguistic information and we present sketches of further applications that could be explored in future work.
APA, Harvard, Vancouver, ISO, and other styles
48

Mafi, Arash. "Grand unification, supersymmetry and a light gluino /." The Ohio State University, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=osu1486398528556463.

Full text
APA, Harvard, Vancouver, ISO, and other styles
49

BOUDET, ALEXANDRE. "Unification dans les melanges de theories equationnelles." Paris 11, 1990. http://www.theses.fr/1990PA112217.

Full text
Abstract:
Cette these traite du probleme de l'unification (ou resolution d'equations) dans le melange de theories equationnelles. L'unification joue un role fondamental en programmation logique, en reecriture, en demonstration automatique et en intelligence artificielle en general. L'unification modulo une theorie equationnelle a ete introduire par g. Plotkin en 1972. Elle permet de tenir compte d'axiomes tels que les axiomes d'associativite et commutativite dans le processus d'unification et de conserver les proprietes de terminaison qui sont perdues si on garde de tels axiomes. L'unification dans une theorie equationnelle est indecidable en general. Un exemple d'unification dans les melanges de theories est la resolution dans des extensions libres d'une theorie equationnelle e (melange de e et de la theorie vide). Un autre exemple est la resolution d'equations modulo des proprietes telles que l'associativite, la commutativite, l'idempotence, un element neutre ou absorbant, ou une combinaison de ces proprietes pour un certain nombre d'operateurs. Nous donnons une nouvelle solution pour le cas ou il n'y a pas d'axiomes non reguliers (i. E. , dont les deux membres ont des ensembles de variables differents) ni d'axiomes d'effondrement (i. E. , dont un membre est reduit a une variable). Cela donne un nouvel algorithme d'unification associative-commutative. Ce resultat est etendu aux problemes ouverts du melange d'une theorie simple (qui n'admet pas de solution aux equations entre un terme et un de ses sous-termes stricts) et d'une theorie arbitraire, puis au melange de theories arbitraires
APA, Harvard, Vancouver, ISO, and other styles
50

Echenim, Bertrand Mnacho. "Déduction et unification dans les théories permutatives." Grenoble INPG, 2005. https://tel.archives-ouvertes.fr/tel-00011236.

Full text
Abstract:
Il existe de nombreux démonstrateurs automatiques qui effectuent des raisonnements modulo une théorie équationnelle, c'est-à-dire enconsidérant non pas des termes, mais des classes d'équivalence de termes. En général, les travaux accomplis dans ce domaine ont pour but de concevoir des techniques pour faire de la déduction modulo une théorie particulière. Dans [Avenhaus & Plaisted, 2001], Jürgen Avenhaus et David Plaisted ont cherché à déterminer des techniques qui pourraient être employées dans le traitement non plus d'une théorie particulière, mais de toute une classe de théories équationnelles: les théories permutatives. Les auteurs ont introduit les notions de terme stratifié et d'ensemble stratifié, et décrit les procédures qui devraient être implémentées dans un démonstrateur automatique basé sur ces termes stratifiés. Les propriétés de régularité de ces théories font qu'il est possible d'employer des techniques efficaces de théorie algorithmique des groupes pour les traiter. Les auteurs espéraient que l'efficacité de ces techniques contrebalancerait le nombre élevé de clauses qui pourraient être générées dans un démonstrateur automatique basé sur ces termes stratifiés. Cependant, les algorithmes proposés pour faire de la déduction avec des termes stratifiés sont basés sur une énumération explicite des éléments des groupes, et sont donc exponentiels. Dans ce mémoire, nous développons les travaux d'Avenhaus et Plaisted, et modifions leur formalisme pour pouvoir faire l'usage le plus intensif possible des techniques de théorie algorithmique des groupes
There exist several theorem provers that perform deduction modulo an equational theory, i. E. By considering equivalence classes of terms, instead of ordinary terms. In general, most of the research carried out in this area focuses on determining new techniques to perform deduction modulo one particular theory. In [Avenhaus & Plaisted, 2001], Jürgen Avenhaus and David Plaisted sought for new techniques that could be used for the treatment of not one particular theory, but an entire class of equational theories: the so-called permutative theories. The authors introduced the notions of stratified terms and stratified sets, and described the procedures that should be implemented in a theorem prover based on stratified terms. Permutative theories enjoy several regularity properties that make it possible to use efficient techniques from computational group theory to deal with them. The authors hoped that the efficiency of these techniques would counterbalance the high number of clauses that could be generated by a theorem prover based on stratified terms. However, the algorithms they propose to perform deduction on stratified terms are based on an explicit enumeration of the elements of a group, and are therefore exponential. In this thesis, we develop Avenhaus and Plaisted's work, and adapt their formalism to make a more intensive use of group-theoretic tools
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'Unification' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography