To see the other types of publications on this topic, follow the link: Equivalence theorem.
Dissertations / Theses on the topic 'Equivalence theorem'
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 'Equivalence theorem.'
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
Törnkvist, Robin. "Tychonoff's theorem and its equivalence with the axiom of choice." Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-107423.
Full textAbstract:
In this essay we give an elementary introduction to topology so that we can prove Tychonoff’s theorem, and also its equivalence with the axiom of choice.Denna uppsats tillhandahåller en grundläggande introduktion till topologi för att sedan bevisa Tychonoff’s theorem, samt dess ekvivalens med urvalsaxiomet.
2
Barra, Aleams. "Equivalence Theorems and the Local-Global Property." UKnowledge, 2012. http://uknowledge.uky.edu/math_etds/5.
Full textAbstract:
In this thesis we revisit some classical results about the MacWilliams equivalence theorems for codes over fields and rings. These theorems deal with the question whether, for a given weight function, weight-preserving isomorphisms between codes can be described explicitly. We will show that a condition, which was already known to be sufficient for the MacWilliams equivalence theorem, is also necessary. Furthermore we will study a local-global property that naturally generalizes the MacWilliams equivalence theorems. Making use of F-partitions, we will prove that for various subgroups of the group of invertible matrices the local-global extension principle is valid.
3
Pllaha, Tefjol. "Equivalence of Classical and Quantum Codes." UKnowledge, 2019. https://uknowledge.uky.edu/math_etds/59.
Full textAbstract:
In classical and quantum information theory there are different types of error-correcting codes being used. We study the equivalence of codes via a classification of their isometries. The isometries of various codes over Frobenius alphabets endowed with various weights typically have a rich and predictable structure. On the other hand, when the alphabet is not Frobenius the isometry group behaves unpredictably. We use character theory to develop a duality theory of partitions over Frobenius bimodules, which is then used to study the equivalence of codes. We also consider instances of codes over non-Frobenius alphabets and establish their isometry groups. Secondly, we focus on quantum stabilizer codes over local Frobenius rings. We estimate their minimum distance and conjecture that they do not underperform quantum stabilizer codes over fields. We introduce symplectic isometries. Isometry groups of binary quantum stabilizer codes are established and then applied to the LU-LC conjecture.
4
Van, Zyl Jacobus Visser. "On the Latimer-MacDuffee theorem for polynomials over finite fields." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6581.
Full textAbstract:
Thesis (PhD (Mathematical Sciences))--University of Stellenbosch, 2011.Includes bibliography.
ENGLISH ABSTRACT: Latimer & MacDuffee showed in 1933 that there is a one-to-one correspondence between equivalence classes of matrices with a given minimum polynomial and equivalence classes of ideals of a certain ring. In the case where the matrices are taken over the integers, Behn and Van der Merwe developed an algorithm in 2002 to produce a representative in each equivalence class. We extend this algorithm to matrices taken over the ring Fq[T] of polynomials over a finite field and prove a modified version of the Latimer-MacDuffee theorem which holds for proper equivalence classes of matrices.
AFRIKAANSE OPSOMMING: Latimer & MacDuffee het in 1933 bewys dat daar 'n een-tot-een korrespondensie is tussen ekwivalensieklasse van matrikse met 'n gegewe minimumpolinoom en ekwivalensieklasse van ideale van 'n sekere ring. In die geval waar die matrikse heeltallige inskrywings het, het Behn en Van der Merwe in 2002 'n algoritme ontwikkel om verteenwoordigers in elke ekwivalensieklas voort te bring. Ons brei hierdie algoritme uit na die geval van matrikse met inskrywings in die ring Fq[T] van polinome oor 'n eindige liggaam en ons bewys 'n gewysigde weergawe van die Latimer-MacDuffee stelling wat geld vir klasse van streng ekwivalente matrikse.
5
Ling, Chen. "THREE ESSAYS ON DIFFERENTIAL GAMES AND RESOURCE ECONOMICS." Doctoral diss., University of Central Florida, 2010. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/3887.
Full textAbstract:
This dissertation consists of three chapters on the topic of differential games and resource economics. The first chapter extends the envelope theorem to the class of discounted infinite horizon differential games that posses locally differentiable Nash equilibria. The theorems cover both the open-loop and feedback information structures, and are applied to a simple analytically solvable linear-quadratic game. The results show that the conventional interpretation of the costate variable as the shadow value of the state variable along the equilibrium path is only valid for feedback Nash equilibria, but not for open-loop Nash equilibria. The specific linear-quadratic structure provides some extra insights on the theorem. For example, the costate variable is shown to uniformly overestimate the shadow value of the state variable in the open-loop case, but the growth rate of the costate variable are the same as the shadow value under open-loop and feedback information structures. Chapter two investigates the qualitative properties of symmetric open-loop Nash equilibria for a ubiquitous class of discounted infinite horizon differential games. The results show that the specific functional forms and the value of parameters used in the game are crucial in determining the local asymptotic stability of steady state, the steady state comparative statics, and the local comparative dynamics. Several sufficient conditions are provided to identify a local saddle point type of steady state. An important steady state policy implication from the model is that functional forms and parameter values are not only quantitatively important to differentiate policy tools, but they are also qualitatively important. Chapter three shifts the interests to the lottery mechanism for rationing public resources. It characterizes the optimal pricing strategies of lotteries for a welfare-maximization agency. The optimal prices are shown to be positive for a wide range of individual private value distributions, suggesting that the sub-optimal pricing may result in a significant efficiency loss and that the earlier studies under zero-pricing may need to be re-examined. In addition, I identify the revenue and welfare equivalency propositions across lottery institutions. Finally, the numerical simulations strongly support the findings.Ph.D.
Department of Economics
Business Administration
Economics PhD
6
Klymchuk, Tetiana. "Stratification theory of matrix pairs under equivalence and contragredient equivalence." Doctoral thesis, Universitat Politècnica de Catalunya, 2019. http://hdl.handle.net/10803/667132.
Full textAbstract:
We develop the theory of perturbations of matrix pencils basing on their miniversal deformations. Several applications of this theory are given.
All possible Kronecker pencils that are canonical forms of pencils in an arbitrary small neighbourhood of a given pencil were described by A. Pokrzywa (Linear Algebra Appl., 1986). His proof is very abstract and unconstructive. Even more abstract proof of Pokrzywa’s theorem was given by K. Bongartz (Advances in Mathematics, 1996); he uses the representation theory of finite dimensional algebras.
The main purpose of this thesis is to give a direct, constructive, and rather elementary proof of Pokrzywa’s theorem. We first show that it is sufficient to prove Pokrzywa’s theorem only for pencils that are direct sums of at most two indecomposable Kronecker pencils. Then we prove Pokrzywa’s theorem for such pencils. The latter problem is very simplified due to the following observation: it is sufficient to find Kronecker's canonical forms of only those pencils that are obtained by miniversal perturbations of a given pencil. We use miniversal deformations of matrix pencils that are given by M. I. García-Planas and V. V. Sergeichuk (Linear Algebra Appl., 1999) because their deformations have many zero entries unlike the miniversal deformations given by A. Edelman, E. Elmroth, and B. Kagstrom (SIAM J. Matrix Anal. Appl., 1997). Thus, we give not only all possible Kronecker’s canonical forms, but also the corresponding deformations of a given pencil, which is important for applications of this theory.
P. Van Dooren (Linear Algebra Appl., 1979) constructed an algorithm for computing all singular summands of Kronecker’s canonical form of a matrix pencil. His algorithm uses only unitary transformations, which improves its numerical stability. We extend Van Dooren’s algorithm both to square complex matrices under consimilarity transformations and to pairs of complex matrices under mixed equivalence.
We describe all pairs (A, B) of m-by-n and n-by-m complex matrices for which the product CD is a versal deformation of AB, in which (C, D) is the miniversal deformation of (A, B) under contragredient equivalence given by M. I. García-Planas and V. V. Sergeichuk (Linear Algebra Appl., 1999).
We find all canonical matrix pairs (A, B) under contragredient equivalence, for which the first order induced perturbations are nonzero for all nonzero miniversal deformations of (A, B). This problem arises in the theory of differential matrix equations dx= ABx.
A complex matrix pencil is called structurally stable if there exists its neighbourhood in which all pencils are strictly equivalent to it. We describe all complex matrix pencils that are structurally stable. We show that there are no pairs of complex matrices that are structurally stable with respect to contragredient equivalence.Es desenvolupa la teoria de pertorbacions de feixos de matrius a partir de les seves deformacions miniversals. Es donen diverses aplicacions d'aquesta teoria. A. Pokrzywa (Linear Algebra Appl., 1986) va descriure tots els possibles feixos en la seva forma de Kronecker que són formes canòniques dels feixos que es poden trobar en un petit entorn arbitrari d'un feix prèviament determinat. La demostració que presentava és molt abstracta i no constructiva. K. Bongartz (Advances in Mathematics, 1996) va donar una demostració encara més abstracta del teorema de Pokrzywa; utilitzant resultats de la teoria de representació d'àlgebres de dimensió finita. L’objectiu principal de aquesta tesi és presentar una demostració directa, constructiva i bastant elemental del teorema de Pokrzywa. Primer, es demostra que per a provar el teorema de Pokrzywa és suficient provar-lo solament per a feixos que són sumes directes de, com màxim, dos feixos de Kronecker indescomponibles. Per a continuació, provar el teorema de Pokrzywa per aquests feixos. L’últim problema es simplifica molt degut a la següent observació: és suficient per trobar les formes canòniques de Kronecker de només aquells feixox que s’obtenen de deformacions miniversals d’un feix determinat. Utilitzem les deformacions de feixos de matrius obtingudes per MI García-Planas i VV Sergeichuk (Linear Algebra Appl., 1999) perquè les seves deformacions tenen moltes entrades nul·les, a diferència de les deformacions miniversals obtingudes per A. Edelman, E. Elmroth i B. Kagstrom (SIAM J. Matrix Anal. Appl., 1997). Per tant, no solament donem totes les formes canòniques de Kronecker possibles, sinó també les deformacions corresponents a un feix prèviament fixat, la qual cosa és important per a les aplicacions d’aquesta teoria. P. Van Dooren (Linear Algebra Appl., 1979) va construir un algoritme per calcular tots els sumands singulars de la forma canònica de Kronecker, d’un feix de matrius. El seu algoritme utilitza solament transformacions unitàries, el que millora la seva estabilitat numèrica. Estenem l’algoritme de Van Dooren tant a matrius complexes quadrades respecte transformacions de cosimilaritat com a parells de matrius complexes respecte l’equivalència mixta. Descrivim tots els parells (A, B) de matrius complexes m per n i n per m, per les quals el producte CD és una deformació versal de AB, en la que (C, D) és la deformació miniversal de (A, B) respecte l’equivalència contragredient donada per MI García-Planas y VV Sergeichuk (Linear Algebra Appl., 1999). Descrivim tots los pares de matrius canòniques (A, B) respecte l’equivalència contragredient, per les quals les pertorbacions de primer ordre induïdes són diferents de cero para totes les deformacions miniversals no nul·les d¿(A, B). Aquest problema apareix en la teoria de les equacions matricials diferencials dx = ABx. Un feix de matrius complexes es diu estructuralment estable si existeix un entorn en el que tots els feixos són equivalents a ell respecte una relació d’equivalència considerada. Descrivim tots els feixos de matrius complexes que són estructuralment estables respecte la equivalència estricta. Mostrem que no hi ha parelles de matrius complexes que són estructuralment estables respecto l’equivalència contragredient.
7
Jacinto, Bruno. "Necessitism, contingentism and theory equivalence." Thesis, University of St Andrews, 2016. http://hdl.handle.net/10023/8814.
Full textAbstract:
Two main questions are addressed in this dissertation, namely: 1. What is the correct higher-order modal theory; 2. What does it take for theories to be equivalent. The whole dissertation consists of an extended argument in defence of the joint truth of two higher-order modal theories, namely, Plantingan Moderate Contingentism, a higher-order necessitist theory advocated by Plantinga (1974) and committed to the contingent being of some individuals, and Williamsonian Thorough Necessitism, a higher-order necessitist theory advocated by Williamson (2013) and committed to the necessary being of every possible individual. The case for the truth of these two theories relies on defences of the following metaphysical theses: i) Thorough Serious Actualism, according to which no things could have been related and yet be nothing, ii) Higher-Order Necessitism, according to which necessarily, every higher-order entity is necessarily something. It is shown that Thorough Serious Actualism and Higher-Order Necessitism are both implicit commitments of very weak logical theories. Prima facie, Plantingan Moderate Contingentism and Williamsonian Thorough Necessitism are jointly inconsistent. The argument for their joint truth thus relies also on showing i) their equivalence, and ii) that the dispute between Plantingans and Williamsonians is merely verbal. The case for i) and ii) relies on the Synonymy Account, an account of theory equivalence developed and defended in the dissertation. According to the account, theories are equivalent just in case they have the same structure of entailments and commitments, and the occupiers of the places in that structure are the same propositions. An immediate consequence of the Synonymy Account is that proponents of synonymous theories are engaged in merely verbal disputes. The Synonymy Account is also applied to the debate between noneists and Quineans, revealing that what is in question in that debate is what are the expressive resources available to describe the world.
8
Fretwell, Paul. "Equivalence transformations in linear systems theory." Thesis, Loughborough University, 1986. https://dspace.lboro.ac.uk/2134/33259.
Full textAbstract:
There is growing interest in infinite frequency structure of linear systems, and transformations preserving this type of structure. Most work has been centred around Generalised State Space (GSS) systems. Two constant equivalence transformations for such systems are Rosenbrock's Restricted System Equivalence (RSE) and Verghese's Strong Equivalence (str.eq.). Both preserve finite and infinite frequency system structure. RSE is over restrictive in that it is constrained to act between systems of the same dimension. While overcoming this basic difficulty str.eq. on the other hand has no closed form description. In this work all these difficulties have been overcome. A constant pencil transformation termed Complete Equivalence (CE) is proposed, this preserves finite elementary divisors and non-unity infinite elementary divisors. Applied to GSS systems CE yields Complete System Equivalence (CSE) which is shown to be a closed form description of str.eq. and is more general than RSE as it relates systems of different dimensions. Equivalence can be described in terms of mappings of the solution sets of the describing differential equations together with mappings of the constrained initial conditions. This provides a conceptually pleasing definition of equivalence. The new equivalence is termed Fundamental Equivalence (FE) and CSE is shown to be a matrix characterisation of it. A polynomial system matrix transformation termed Full Equivalence (fll.e.) is proposed. This relates general matrix polynomials of different dimensions while preserving finite and infinite frequency structure. A definition of infinite zeros is also proposed along with a generalisation of the concept of infinite elementary divisors (IED) from matrix pencils to general polynomial matrices. The IED provide an additional method of dealing with infinite zeros.
9
Groenewald, Suzanne Anél. "Reflector modelling of MTR cores making use of normalised generalised equivalence theory." Thesis, North-West University, 2012. http://hdl.handle.net/10394/9054.
Full textAbstract:
This research focuses on modelling reflectors in typical material testing reactors (MTRs). Reflectors present some challenges to the usual approach to full-core calculational models. Diffusion theory is standardly used in full-core calculations and is known to be inaccurate in regions where the flux is anisotropic, for example within the reflectors. Thus, special consideration should be given to reflector models. In this research, normalised generalised equivalence theory is used to homogenise cross-sections and calculate equivalent nodal parameters and albedo boundary conditions for the reflector surrounding a typical MTR reactor. Various studies have shown that equivalence theory can be used to accurately generate equivalent nodal parameters for the core and reflector regions of large reactors, such as pressurised and boiling water reactors, in one dimension and for two neutron energy groups. This has not been tested for smaller reactors where leakage, environment sensitivity and multi-group spectrum dependency are much larger.
The SAFARI-1 MTR reactor is modelled in this work. A thirty day operational cycle is simulated for this reactor, using the nodal diffusion code MGRAC. NGET reflector equivalent nodal parameters are calculated using the codes NEWT and EQUIVA. The impact of different reflector models are evaluated, based on their effect on the core power, flux distribution, reactivity and neutron leakage over the duration of the operational cycle.
It is found that homogenisation introduces some environment dependencies in the reflector parameters, particularly in the corners of the reactor core. In full-core calculations, the reflector parameters show some sensitivity to the in-core reflector structures, but not the fuel composition. A practical reflector model for SAFARI-1 is proposed, which proves that NGET equivalence theory can be used for multi-group reflector modelling in a small MTR reactor. This approach to reflector modelling simplifies the core model, increases the accuracy of a diffusion calculation, and increases the efficiency (shorter calculational time and better convergence behaviour) of computer simulations.Thesis (MSc (Engineering Sciences in Nuclear Engineering))--North-West University, Potchefstroom Campus, 2013.
10
Merisi, Piercarlo. "Ring equivalences from Morita theory." Thesis, University of Exeter, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.307287.
Full text
11
Lengrand, Stéphane. "Normalisation & equivalence in proof theory & type theory /." St Andrews, 2007. http://hdl.handle.net/10023/319.
Full text
12
Lengrand, Stéphane J. E. "Normalisation & equivalence in proof theory & type theory." Thesis, University of St Andrews, 2006. http://hdl.handle.net/10023/319.
Full textAbstract:
At the heart of the connections between Proof Theory and Type Theory, the Curry-Howard correspondence provides proof-terms with computational features and equational theories, i.e. notions of normalisation and equivalence. This dissertation contributes to extend its framework in the directions of proof-theoretic formalisms (such as sequent calculus) that are appealing for logical purposes like proof-search, powerful systems beyond propositional logic such as type theories, and classical (rather than intuitionistic) reasoning. Part I is entitled Proof-terms for Intuitionistic Implicational Logic. Its contributions use rewriting techniques on proof-terms for natural deduction (Lambda-calculus) and sequent calculus, and investigate normalisation and cut-elimination, with call-by-name and call-by-value semantics. In particular, it introduces proof-term calculi for multiplicative natural deduction and for the depth-bounded sequent calculus G4. The former gives rise to the calculus Lambdalxr with explicit substitutions, weakenings and contractions that refines the Lambda-calculus and Beta-reduction, and preserves strong normalisation with a full notion of composition of substitutions. The latter gives a new insight to cut-elimination in G4. Part II, entitled Type Theory in Sequent Calculus develops a theory of Pure Type Sequent Calculi (PTSC), which are sequent calculi that are equivalent (with respect to provability and normalisation) to Pure Type Systems but better suited for proof-search, in connection with proof-assistant tactics and proof-term enumeration algorithms. Part III, entitled Towards Classical Logic, presents some approaches to classical type theory. In particular it develops a sequent calculus for a classical version of System F_omega. Beyond such a type theory, the notion of equivalence of classical proofs becomes crucial and, with such a notion based on parallel rewriting in the Calculus of Structures, we compute canonical representatives of equivalent proofs.
13
Wang, Hui. "Error equivalence theory for manufacturing process control." [Tampa, Fla.] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0002252.
Full text
14
Garcia, Anna Rosio. "Relating Relations: The Impact of Equivalence-Equivalence Training on Analogical Reasoning." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5372.
Full textAbstract:
A well-researched line showing equivalence performances in a wide variety of areas has been conducted in the field of Behavior Analysis (BA). One area demonstrates that relating relations is a behavioral account of analogical thinking. Relating relations may have implications for the development of analogical training given that analogical reasoning is seen as the foundation of intelligence yet research in this area is limited. A protocol by Stewart, Barnes-Holmes, and Weil (2009) was developed to train children in analogical reasoning using equivalence-equivalence relations. The purpose of this study was to evaluate an equivalence-equivalence training protocol based on Stewart et al. (2009) and test whether the protocol was effective in training equivalence-equivalence responding to 7 and 8-year-old children. A secondary purpose was to test whether training in equivalence-equivalence responding increased performances on analogical tests. All five participants were dismissed throughout the study. Participant 1 was dismissed during the pre-assessments and all other participants were dismissed during intervention. Because none of the participants passed the equivalence-equivalence training, increases in performance in analogical testes were not analyzed. Individual performance data from training are examined and analyzed to provide an account of the failures to pass the equivalence-equivalence protocol.
15
Guo, Xiuzhan. "Monadicity, purity and descent equivalence /." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ59136.pdf.
Full text
16
Wang, Xiaohui. "Singularity Theory of Strategy Functions Under Dimorphism Equivalence." The Ohio State University, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=osu1426460461.
Full text
17
Burns, Marie Pacelli. "Clinical applications of stimulus equivalence and relational frame theory." Thesis, University of Ulster, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393766.
Full text
18
Siegl, Erhard (Erhard Martin) Carleton University Dissertation Mathematics and statistics. "Equivalence of categorical calculus theories based on smoothness and boundedness." Ottawa, 1994.
Find full text
19
Rocha, Maria Margarita. "Tutte-Equivalent Matroids." CSUSB ScholarWorks, 2018. https://scholarworks.lib.csusb.edu/etd/759.
Full textAbstract:
We begin by introducing matroids in the context of finite collections of vectors from a vector space over a specified field, where the notion of independence is linear independence. Then we will introduce the concept of a matroid invariant. Specifically, we will look at the Tutte polynomial, which is a well-defined two-variable invariant that can be used to determine differences and similarities between a collection of given matroids. The Tutte polynomial can tell us certain properties of a given matroid (such as the number of bases, independent sets, etc.) without the need to manually solve for them. Although the Tutte polynomial gives us significant information about a matroid, it does not uniquely determine a matroid. This thesis will focus on non-isomorphic matroids that have the same Tutte polynomial. We call such matroids Tutte-equivalent, and we will study the characteristics needed for two matroids to be Tutte-equivalent. Finally, we will demonstrate methods to construct families of Tutte-equivalent matroids.
20
Boykin, Charles Martin. "The Study of Translation Equivalence on Integer Lattices." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4345/.
Full textAbstract:
This paper is a contribution to the study of countable Borel equivalence relations on standard Borel spaces. We concentrate here on the study of the nature of translation equivalence. We study these known hyperfinite spaces in order to gain insight into the approach necessary to classify certain variables as either being hyperfinite or not. In Chapter 1, we will give the basic definitions and examples of spaces used in this work. The general construction of marker sets is developed in this work. These marker sets are used to develop several invariant tilings of the equivalence classes of specific variables . Some properties that are equivalent to hyperfiniteness in the certain space are also developed. Lastly, we will give the new result that there is a continuous injective embedding from certain defined variables.
21
Ardila, Rene. "Morita equivalence of W*-correspondences and their Hardy algebras." Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/5703.
Full textAbstract:
Muhly and Solel developed a notion of Morita equivalence for C*- correspondences, which they used to show that if two C*-correspondences E and F are Morita equivalent then their tensor algebras $\mathcal{T}_{+}(E)$ and $\mathcal{T}_{+}(F)$ are (strongly) Morita equivalent operator algebras. We give the weak* version of this result by considering (weak) Morita equivalence of W*-correspondences and employing Blecher and Kashyap's notion of Morita equivalence for dual operator algebras. More precisely, we show that weak Morita equivalence of W*-correspondences E and F implies weak Morita equivalence of their Hardy algebras $H^{\infty}(E)$ and $H^{\infty}(F)$.
We give special attention to W*-graph correspondences and show a number of results related to their Morita equivalence. We study how different representations of a W*-algebra give rise to Morita equivalent objects. For example, we show that if (E,A) is a W*-graph correspondence and we have two faithful normal representations $\sigma$ and $\tau$ of A, then the commutants of the induced representions $\sigma ^{\ms{F}(E)}(H^{\infty}(E))$ and $\tau ^{\ms{F}(E)}(H^{\infty}(E))$ are weakly Morita equivalent dual operator algebras.
We also develop a categorical approach to Morita equivalence of W*- correspondences. This involves building categories of covariant representations and studying the groups $Aut(\mathbb{D}({(E^{\sigma}})^*)$ and $Aut(H^{\infty}(E))$ (the automorphism groups of the unit ball of intertwiners and the Hardy algebra). In this regard, we advance the work of Muhly and Solel by showing new results about these groups, their matrix representation and their algebraic properties.
22
Tse, Wilfred See Foon. "Linear equivalents of nonlinear systems." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26652.
Full textAbstract:
Consider the following nonlinear system
[Formula Omitted]
where ϰ ∈ Rⁿ, f, ℊ₁,…,ℊｍ are C∞ function in Rⁿ and ℎ is a C∞ function in R⍴, all defined on a neighborhood of 0. The problem of finding a necessary and sufficient condition such that system (1) can be transformed to a linear controllable system by a state coordinate change and feedback has been studied
quite well. In this thesis, we first discuss a few different approaches to this problem and eventually we will show that the slightly different versions of the necessary and sufficient condition discovered are equivalent. Next we consider
system (1) with all սi,= 0 together with system (2), and study the dual problem of transforming it to a linear observable system by a state and output coordinate change. Finally, we consider briefly system (l) and (2) with nonzero սi and study the problem of transforming it to a linear system that is both completely controllable and observable. Examples are given and applications to local stabilization and estimation are discussed.Science, Faculty of
Mathematics, Department of
Graduate
23
Kida, Yoshikata. "The mapping class group from the viewpoint of measure equivalence theory." 京都大学 (Kyoto University), 2006. http://hdl.handle.net/2433/144152.
Full textAbstract:
Kyoto University (京都大学)0048
新制・課程博士
博士(理学)
甲第12175号
理博第3069号
新制||理||1457(附属図書館)
24011
UT51-2006-J168
京都大学大学院理学研究科数学・数理解析専攻
(主査)助教授 泉 正己, 教授 河野 明, 助教授 加藤 毅
学位規則第4条第1項該当
24
Jaber, Guilhem. "A logical study of program equivalence." Thesis, Nantes, Ecole des Mines, 2014. http://www.theses.fr/2014EMNA0124/document.
Full textAbstract:
Prouver l’équivalence de programmes écrits dans un langage fonctionnel avec références est un problème notoirement difficile. L’objectif de cette thèse est de proposer un système logique dans lequel de telles preuves peuvent être formalisées, et dans certains cas inférées automatiquement. Dans la première partie, une méthode générique d’extension de la théorie des types dépendants est proposée, basée sur une interprétation du forcing vu comme une traduction de préfaisceaux de la théorie des types. Cette extension dote la théorie des types de constructions récursives gardées, qui sont utilisées ensuite pour raisonner sur les références d’ordre supérieure. Dans une deuxième partie, nous définissons une sémantique des jeux nominale opérationnelle pour un langage avec références d’ordre supérieur. Elle marie la structure catégorique de la sémantique des jeux avec une représentation sous forme de traces de la dénotation des programmes, qui se calcule de manière opérationnelle et dispose donc de bonnes propriétés de modularité. Cette sémantique nous permet ensuite de prouver la complétude de relations logiques à la Kripke définit de manière directe, via l’utilisation de types récursifs gardés, sans utilisation de la biorthogonalité. Une telle définition directe nécessite l’utilisation de mondes omniscient et un contrôle fin des locations divulguées. Finalement, nous introduisons une logique temporelle qui donne un cadre pour définir ces relations logiques à la Kripke. Nous ramenons alors le problème de l’équivalence contextuelle à la satisfiabilité d’une formule de cette logique générée automatique, c’est à dire à l’existence d’un monde validant cette formule. Sous certaines conditions, cette satisfiabilité peut être décidée via l’utilisation d’un solveur SMT. La complétude de notre méthode devrait permettre d’obtenir des résultats de décidabilité pour l’équivalence contextuelle de certains fragment du langage considéré, en fournissant un algorithme pour construire de tels mondesProving program equivalence for a functional language with references is a notoriously difficult problem. The goal of this thesis is to propose a logical system in which such proofs can be formalized, and in some cases inferred automatically. In the first part, a generic extension method of dependent type theory is proposed, based on a forcing interpretation seen as a presheaf translation of type theory. This extension equips type theory with guarded recursive constructions, which are subsequently used to reason on higher-order references. In the second part, we define a nominal game semantics for a language with higher-order references. It marries the categorical structure of game semantics with a trace representation of denotations of programs, which can be computed operationally and thus have good modularity properties. Using this semantics, we can prove the completeness of Kripke logical relations defined in a direct way, using guarded recursive types, without using biorthogonality. Such a direct definition requires omniscient worlds and a fine control of disclosed locations. Finally, we introduce a temporal logic which gives a framework to define these Kripke logical relations. The problem of contextual equivalence is then reduced to the satisfiability of an automatically generated formula defined in this logic, i.e. to the existence of a world validating this formula. Under some conditions, this satisfiability can be decided using a SMT solver. Completeness of our methods opens the possibility of getting decidability results of contextual equivalence for some fragments of the language, by giving an algorithm to build such worlds
25
Salamati, Zahra. "Designing Interaction Equivalency in Distance Education." Thesis, Högskolan i Borås, Institutionen Handels- och IT-högskolan, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:hb:diva-16887.
Full textAbstract:
The fundamental advancement of information technology has given rise to distance education industry hence it has helped to the popularity of distance education among people. However, for employing innovative and advanced tools universities need financial resources. Reaching to these resources is not easy and accessible. Interaction equivalency theorem can be a good solution for overcoming the financial problems but designers are reluctant to utilize it because they think that education quality will decrease due to lack of teacher interaction. This study demonstrated that students’ perception toward interaction equivalency is positive as long as they have high level of interdependency with other students. Without this level of, students are not motivated in order to continue their courses. This study by providing techno-pedagogical design and IS design theory for support of IE helps e-learning practitioners who want to design an acceptable distance educational system with limited financial resources.Program: Magisterutbildning i informatik
26
Pace, Dennis. "Axiom of Choice: Equivalences and Applications." Youngstown State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1340993084.
Full text
27
Hai, Ling. "Modelling Wave Power by Equivalent Circuit Theory." Doctoral thesis, Uppsala universitet, Elektricitetslära, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-265270.
Full textAbstract:
The motion of ocean waves can be captured and converted into usable electricity. This indicates that wave power has the potential to supply electricity to grids like wind or solar power. A point absorbing wave energy converter (WEC) system has been developed for power production at Uppsala University. This system contains a semi-submerged buoy on the water surface driving a linear synchronous generator placed on the seabed. The concept is to connect many small units together, to form a wave farm for large-scale electricity generation. A lot of effort has gone into researching how to enhance the power absorption from each WEC unit. These improvements are normally done separately for the buoy, the generator or the electrical system, due to the fact that modelling the dynamic behavior of the entire WEC system is complicated and time consuming. Therefore, a quick, yet simple, assessment tool is needed. This thesis focuses on studying the use of the equivalent circuit as a WEC system modelling tool. Based on the force analysis, the physical elements in an actual WEC system can be converted into electrical components. The interactions between the regular waves, the buoy, and the Power Take-off mechanism can be simulated together in one circuit network. WEC performance indicators like the velocity, the force, and the power can be simulated directly from the circuit model. Furthermore, the annual absorbed electric energy can be estimated if the wave data statistics are known. The linear and non-linear equivalent circuit models developed in this thesis have been validated with full scale offshore experimental results. Comparisons indicate that the simplest linear circuit can predict the absorbed power reasonably well, while it is not so accurate in estimating the peak force in the connection line. The non-linear circuit model generates better estimations in both cases. To encourage researchers from different backgrounds to adapt and apply the circuit model, an instruction on how to establish a non-linear equivalent circuit model is supplied, as well as on how to apply the model to accelerate the decision making process when planning a WEC system.
28
Ge, Yuzhen. "Homotopy algorithms for the H² and the combined H²/H[infinity] model order reduction problems /." This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-09292009-020303/.
Full textAbstract:
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1993.On t.p. "[infinity]" appears as the infinity symbol and is superscript. Vita. Abstract. Includes bibliographical references (leaves 51-54). Also available via the Internet.
29
Mortiss, Genevieve. "Average co-ordinate entropy and a non-singular version of restricted orbit equivalence." [Sydney : University of New South Wales], 1997. http://www.library.unsw.edu.au/~thesis/adt-NUN/public/adt-NUN1998.0001/index.html.
Full text
30
Kaimanovich, Vadim, Klaus Schmidt, and Klaus Schmidt@univie ac at. "Ergodicity of cocycles. 1: General Theory." ESI preprints, 2000. ftp://ftp.esi.ac.at/pub/Preprints/esi936.ps.
Full text
31
Gabbay, Murdoch James. "A theory of inductive definitions with α-equivalence : semantics, implementation, programming language." Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620988.
Full text
32
Craft, Colin N. "Applications of a Model-Theoretic Approach to Borel Equivalence Relations." Thesis, University of North Texas, 2019. https://digital.library.unt.edu/ark:/67531/metadc1538768/.
Full textAbstract:
The study of Borel equivalence relations on Polish spaces has become a major area of focus within descriptive set theory. Primarily, work in this area has been carried out using the standard methods of descriptive set theory. In this work, however, we develop a model-theoretic framework suitable for the study of Borel equivalence relations, introducing a class of objects we call Borel structurings. We then use these structurings to examine conditions under which marker sets for Borel equivalence relations can be concluded to exist or not exist, as well as investigating to what extent the Compactness Theorem from first-order logic continues to hold for Borel structurings.
33
Hopkins, David G. B. "Game semantics based equivalence checking of higher-order programs." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:bd68eb38-4159-475f-9a3c-0d6b9de7155a.
Full textAbstract:
This thesis examines the use of game semantics for the automatic equivalence checking of higher-order programs. Game semantics has proved to be a powerful method for constructing fully abstract models of logics and programming languages. Furthermore, the concrete nature of the semantics lends itself to algorithmic analysis. The game-semantic model can be used to identify fragments of languages which have a decidable observational equivalence problem. We investigate decidability results for different languages as well as the efficiency of these algorithms in practice. First we consider the call-by-value higher-order language with state, RML. This can be viewed as a canonical restriction of Standard ML to ground-type references. The O-strict fragment of RML is the largest set of type sequents for which, in the game-semantic denotation, justification pointers from O-moves are always uniquely reconstructible from the underlying move sequence. The O-strict fragment is surprisingly expressive, including higher-order types and difficult examples from the literature. By representing strategies as Visibly Pushdown Automata (VPA) we show that observational equivalence of O-strict terms is decidable (and in fact is ExpTime-complete). We then consider extensions of the O-strict fragment. Adding general recursion or using most non-O-strict types leads to undecidability. However, a limited form of recursion can be added while still preserving decidability (although the full power of DPDA is required). Next we examine languages with non-local control. This involves adding call/cc to our language and is known to correspond to dropping the game-semantic bracketing condition. In the call-by-name game-semantic model of Idealized Algol (IA), in which answers cannot justify questions, the visibility condition still implies a form of weak bracketing. By making bracketing violations explicit we show that we can still model the entire third-order fragment using VPA. We have also implemented tools based on these algorithms. Our model checkers Homer and Hector perform equivalence checking for third-order IA and O-strict RML respectively. Homer uses a naive explicit state method whereas Hector takes advantage of on-the-fly model checking. Our tools perform well on small yet challenging examples. On negative instances, the on-the-fly approach allows Hector to outperform Homer. To improve their performance, we also consider using ideas from symbolic execution. We propose a representation for finite automata using transitions labelled with formulas and guards which aims to take advantage of the symmetries of the game-semantic model so that strategies can be represented compactly. We refer to this representation as Symbolically Executed Automata (SEA). Using SEA allows much larger data types to be handled but is not as effective on larger examples with small data types.
34
Khaliq, Shameem Nyla. "A complete test of Hulin's psychometric theory of measurement equivalence on translated tests." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ59755.pdf.
Full text
35
Crespo, Jonathan. "Monoidal equivalence of locally compact quantum groups and application to bivariant K-theory." Thesis, Clermont-Ferrand 2, 2015. http://www.theses.fr/2015CLF22621/document.
Full textAbstract:
Les travaux présentés dans cette thèse concernent l'équivalence monoïdale de groupes quantiques localement compacts et ses applications. Nous généralisons au cas localement compact et régulier, deux résultats importants concernant les actions de groupes quantiques compacts. Soient G1 et G2 deux groupes quantiques localement compacts réguliers et monoïdalement équivalents. Nous développons un procédé d'induction des actions qui permet d'établir une équivalence canonique des catégories dont les objets sont les actions continues de G1 et G2 sur les C*-algèbres. Comme application de ce résultat, nous obtenons une équivalence canonique des catégories de KK-Théorie équivariante pour G1 et G2. Nous introduisons et étudions une notion d'actions sur les C*-algèbres, de groupoïdes quantiques mesurés sur une base finie. La preuve de la seconde équivalence s'appuie alors sur une version du théorème de bidualité de Takesaki-Takai pour les actions de groupoïdes quantiques mesurés sur une base finie. Enfin, nous terminons en définissant et étudiant une notion de modules hilbertiens équivariants pour des actions de groupoïdes quantiques mesurés sur une base finieThis dissertation deals with the notion of monoidal equivalence of locally compact quantum groups and its applications. We generalize to the case of regular locally compact quantum groups, two important resultst concerning the actions of compact quantum groups. Let G1 and G2 be two regular locally compact quantum groups monoidally equivalent. We develop an induction procedure and we build an equivalence of the categories, whose objects are the continuous actions of G1 and G2 on C*-algebras. As an application of this result, we obtain a canonical equivalence of the categories of equivariant KK-theory for actions of G1 and G2. We introduce and investigate a notion of actions on C*-algebras of mesured quantum groupoids on a finite basis. The proof of the second equivalence relies on a version of the Takesaki-Takai duality theorem for continuous actions of measured quantum groupoids on a finite basis. We conclude by defining and studying a notion of equivariant Hilbert modules for actions of mesured quantum groupoids on a finite basis
36
Ndiweni, Odilo. "The classification of some fuzzy subgroups of finite groups under a natural equivalence and its extension, with particular emphasis on the number of equivalence classes." Thesis, University of Fort Hare, 2007. http://hdl.handle.net/10353/88.
Full textAbstract:
In this thesis we use the natural equivalence of fuzzy subgroups studied by Murali and Makamba [25] to characterize fuzzy subgroups of some finite groups. We focus on the determination of the number of equivalence classes of fuzzy subgroups of some selected finite groups using this equivalence relation and its extension. Firstly we give a brief discussion on the theory of fuzzy sets and fuzzy subgroups. We prove a few properties of fuzzy sets and fuzzy subgroups. We then introduce the selected groups namely the symmetric group 3 S , dihedral group 4 D , the quaternion group Q8 , cyclic p-group pn G = Z/ , pn qm G = Z/ + Z/ , p q r G Z Z Z n m = / + / + / and pn qm r s G = Z/ + Z/ + Z/ where p,q and r are distinct primes and n,m, s Î N/ . We also present their subgroups structures and construct lattice diagrams of subgroups in order to study their maximal chains. We compute the number of maximal chains and give a brief explanation on how the maximal chains are used in the determination of the number of equivalence classes of fuzzy subgroups. In determining the number of equivalence classes of fuzzy subgroups of a group, we first list down all the maximal chains of the group. Secondly we pick any maximal chain and compute the number of distinct fuzzy subgroups represented by that maximal chain, expressing each fuzzy subgroup in the form of a keychain. Thereafter we pick the next maximal chain and count the number of equivalence classes of fuzzy subgroups not counted in the first chain. We proceed inductively until all the maximal chains have been exhausted. The total number of fuzzy subgroups obtained in all the maximal chains represents the number of equivalence classes of fuzzy subgroups for the entire group, (see sections 3.2.1, 3.2.2, 3.2.6, 3.2.8, 3.2.9, 3.2.15, 3.16 and 3.17 for the case of selected finite groups). We study, establish and prove the formulae for the number of maximal chains for the groups pn qm G = Z/ + Z/ , p q r G Z Z Z n m = / + / + / and pn qm r s G = Z/ + Z/ + Z/ where p,q and r are distinct primes and n,m, s Î N/ . To accomplish this, we use lattice diagrams of subgroups of these groups to identify the maximal chains. For instance, the group pn qm G = Z/ + Z/ would require the use of a 2- dimensional rectangular diagram (see section 3.2.18 and 5.3.5), while for the group pn qm r s G = Z/ + Z/ + Z/ we execute 3- dimensional lattice diagrams of subgroups (see section 5.4.2, 5.4.3, 5.4.4, 5.4.5 and 5.4.6). It is through these lattice diagrams that we identify routes through which to carry out the extensions. Since fuzzy subgroups represented by maximal chains are viewed as keychains, we give a brief discussion on the notion of keychains, pins and their extensions. We present propositions and proofs on why this counting technique is justifiable. We derive and prove formulae for the number of equivalence classes of the groups pn qm G = Z/ + Z/ , p q r G Z Z Z n m = / + / + / and pn qm r s G = Z/ + Z/ + Z/ where p,q and r are distinct primes and n,m, s Î N/ . We give a detailed explanation and illustrations on how this keychain extension principle works in Chapter Five. We conclude by giving specific illustrations on how we compute the number of equivalence classes of a fuzzy subgroup for the group p2 q2 r 2 G = Z/ + Z/ + Z/ from the number of fuzzy subgroups of the group p q r G = Z/ + Z/ + Z/ 1 2 2 . This illustrates a general technique of computing the number of fuzzy subgroups of G = Z/ + Z/ + Z/ from the number of fuzzy subgroups of 1 -1 = / + / + / pn qm r s G Z Z Z . Our illustration also shows two ways of extending from a lattice diagram of 1 G to that of G .
37
Rakotonirina, Itsaka. "Efficient verification of observational equivalences of cryptographic processes : theory and practice." Electronic Thesis or Diss., Université de Lorraine, 2021. http://www.theses.fr/2021LORR0052.
Full textAbstract:
Cette thèse porte sur l’analyse des protocoles cryptographiques. Ce sont des suites d’instructions permettant d’interagir à distance avec un interlocuteur tout en protégeant le contenu sensible de la communication d’une potentielle tierce partie malveillante. Des cas classiques où la confidentialité et l’intégrité de la communication sont critiques sont, parmi d’autres, les paiements et services de santé en ligne, ou le vote électronique. Nous étudions les notions de sécurité définies techniquement par des équivalences observationnelles (ce qui inclut, entre autres, la confidentialité, l’anonymat ou la non-traçabilité). Nous avons conçu un programme, DeepSec, qui, à partir de la description d’un protocole pour un nombre fixé de participants, vérifie de manière entièrement automatisée si le protocole offre une garantie de sécurité donnée de ce type. Nous démontrons ensuite la capacité de cet outil à analyser des scenarios d’attaques complexes à travers plusieurs exemples. Dans un deuxième temps, nous présentons une technique d’optimisation reposant sur l’exploitation de symétries dans les preuves de sécurité. Typiquement, les participants ayant des rôles similaires dans le protocole ont souvent les mêmes instructions à suivre, ce qui induit des tâches redondantes lors de l’analyse. Sur plusieurs exemples, l’utilisation de cette technique d’optimisation a permis de réduire le temps d’analyse de DeepSec de plusieurs ordres de magnitude. Enfin, nous avons également étudié l’aspect théorique du problème afin de déterminer dans quelle mesure l’algorithme de DeepSec pouvait être amélioré (peut-on rendre l’outil plus rapide ?) ou rendu plus expressif (peut-on rendre l’outil capable d’analyser plus de protocoles, i.e., nous débarrasser de certaines de ses limitations ?). Nous avons pour cela fait une analyse de complexité calculatoire complète de l’algorithme de DeepSec, et l’avons intégré à une revue détaillée de l’état de l’art des résultats de complexité dans des contextes similaires. Cette revue minutieuse nous a permis de mettre au jour des variations subtiles dans la formalisation du problème à travers la littérature — parfois ayant un impact sur sa complexité. Nous y incluons de nouveaux résultats et améliorons certains ce ceux passés en revue, offrant une compréhension plus claire du problèmeThis thesis studies the analysis of cryptographic protocols. They are sequences of instructions permitting to interact with a recipient remotely while protecting the sensitive content of the communication from a potential malicious third party. Classical cases where the confidentiality and the integrity of the communication are critical are, among others, online payments and medical-service booking, or electronic voting. We study notions of security defined technically by observational equivalences (which includes among others confidentiality, anonymity or non-traceability). We designed a program, DeepSec, which, from the description of a protocol for a fixed number of participants, verifies in a fully-automated way whether the protocol offers a security guarantee of this type. We demonstrate the ability of this tool to analyse complex attack scenarios through several examples. After that, we present an optimization technique exploiting symmetries in security proofs. Typically, participants with similar roles in the protocol often have similar instructions to follow, inducing redundant work during the analysis. On several examples, using this technique allowed to reduce the analysis time of DeepSec by several orders of magnitude. Finally, we also studied the theoretical aspect the problem in order to determine to which extent DeepSec’s algorithm could be improved (can we make the tool faster?) or made more expressive (can we get rid of some of the limitations of the tool?). For that we carried out a complete analysis of the computational complexity of DeepSec’s algorithm, and integrated it to a detailed survey of the state of the art regarding complexity results in similar contexts. This meticulous survey allowed us to expose subtle variations in how the problem is formalised across the literature—sometimes impacting its complexity. We also include new results and improve some of the surveyed ones, resulting in a clearer understanding of the problem
38
Gómez-Sánchez, A. Luis. "An easy and remarkable inequality derived from (actually equivalent to) Fermat's last theorem." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/95669.
Full text
39
Foster, Carol Lynn. "Algorithms, abstraction and implementation : a massively multilevel theory of strong equivalence of complex systems." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/6591.
Full textAbstract:
This thesis puts forward a formal theory of levels and algorithms to provide a foundation for those terms as they are used in much of cognitive science and computer science. Abstraction with respect to concreteness is distinguished from abstraction with respect to detail, resulting in three levels of concreteness and a large number of algorithmic levels, which are levels of detail and the primary focus of the theory. An algorithm or ideal machine is a set of sequences of states defining a particular level of detail. Rather than one fundamental ideal machine to describe the behaviour of a complex system, there are many possible ideal machines, extending Turing's approach to reflect the multiplicity of system descriptions required to express more than weak input-output equivalence of systems. Cognitive science is concerned with stronger equivalence; e.g., do two models go through the same states at some level of description? The state-based definition of algorithms serves as a basis for such strong equivalence and facilitates formal renditions of abstraction and implementation as relations between algorithms. It is possible to prove within the new framework whether or not one given algorithm is a valid implementation of another, or whether two unequal algorithms have a common abstraction, for example. Some implications of the theory are discussed, notably a characterisation of connectionist versus classical models.
40
Silguero, Russell V. "Do contingency-conflicting elements drop out of equivalence classes? Re-testing Sidman's (2000) theory." Thesis, University of North Texas, 2015. https://digital.library.unt.edu/ark:/67531/metadc848078/.
Full textAbstract:
Sidman's (2000) theory of stimulus equivalence states that all positive elements in a reinforcement contingency enter an equivalence class. The theory also states that if an element from an equivalence class conflicts with a programmed reinforcement contingency, the conflicting element will drop out of the equivalence class. Minster et al. (2006) found evidence suggesting that a conflicting element does not drop out of an equivalence class. In an effort to explain maintained accuracy on programmed reinforcement contingencies, the authors seem to suggest that participants will behave in accordance with a particular partitioning of the equivalence class which continues to include the conflicting element. This hypothesis seems to explain their data well, but their particular procedures are not a good test of the notion of "dropping out" due to the pre-establishment of equivalence classes before the conflicting member entered the class. The current experiment first developed unpartitioned equivalence classes and only later exposed participants to reinforcement contingencies that conflicted with pre-established equivalence classes. The results are consistent with the notion that a partition developed such that the conflicting element had dropped out of certain subclasses of the original equivalence class. The notion of a partitioning of an equivalence class seems to provide a fuller description of the phenomenon Sidman (1994, 2000) described as "dropping out" of an equivalence class.
41
Mortiss, Genevieve Catherine Mathematics UNSW. "Average co-ordinate entropy and a non-singular version of restricted orbit equivalence." Awarded by:University of New South Wales. Mathematics, 1997. http://handle.unsw.edu.au/1959.4/17823.
Full textAbstract:
A notion of entropy is defined for the non-singular action of finite co-ordinate changes on X - the infinite product of two- point spaces. This quantity - average co-ordinate or AC entropy - is calculated for product measures and G-measures on X, and an equivalence relation is established for which AC entropy is an invariant. The Inverse Vitali Lemma is discussed in a measure preserving context, and it is shown that for a certain class of measures on X known as odometer bounded, the result will still hold for odometer actions. The foundations for a non-singular version of Rudolph's restricted orbit equivalence are established, and a size for non-singular orbit equivalence is introduced. It is shown that provided the Inverse Vitali Lemma still holds, the non-singular orbit equivalence classes can be described using this new size.
42
Roberts, Creta M. "Promoting generalization of coin value relations with young children via equivalence class formation." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1137578.
Full textAbstract:
Sidman and Tailby (1982) established procedures to analyze the nature of stimulus to stimulus relations established by conditional discriminations. Their research describes specific behavioral tests to determine the establishment of properties that define the relations of equivalence. An equivalence relation requires the demonstration of three conditional relations: reflexivity, symmetry, and transitivity. The equivalence stimulus paradigm provides a method to account for novel responding. The research suggests that equivalence relations provide a more efficient and effective approach to the assessment, analysis, and instruction of skills. The present research examined the effectiveness of the formation of an equivalence class in teaching young children coin value relations. The second aspect of the study was to determine if there was a relationship between equivalence class formation and generalization of the skills established to other settings. Five children, 4- and 5-years old, were selected to participate in the study based on their lack of skills in the area of coin values and purchasing an item with dimes or quarters equaling fifth cents. The experimental task was presented on a Macintosh computer with HyperCard programming. The experimental stimuli consisted of pictures of dimes, quarters, and Hershey candy bars presented in match-to-sample procedures. Two conditional discriminations were taught (if A then B and if B then C.). The formation of an equivalence class was evaluated by if C then A. Generalization across settings was tested after the formation of an equivalence class by having the children purchase a Hershey candy bar with dimes at a play store. A multiple baseline experimentaldesign was used to demonstrate a functional relationship between the formation of an equivalence class and generalization of skills across settings. The present research provides supportive evidence that coin value relations can be taught to young children using equivalence procedures. The study also demonstrated generalization of novel, untaught stimuli across settings, after the formation of an equivalence class. A posttest on generalization across settings was conducted 3 months after the study. Long-term stability of equivalence relations was demonstrated by three of the subjects.Department of Special Education
43
Kashcheyeva, Olga S. "Monomialization of strongly prepared morphisms to surfaces /." free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p3091935.
Full text
44
Perera, Simon. "Grothendieck rings of theories of modules." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/grothendieck-rings-of-theories-of-modules(897cbbd9-77b6-47fb-8cf8-d15c7432e61b).html.
Full textAbstract:
We consider right modules over a ring, as models of a first order theory. We explorethe definable sets and the definable bijections between them. We employ the notionsof Euler characteristic and Grothendieck ring for a first order structure, introduced byJ. Krajicek and T. Scanlon in [24]. The Grothendieck ring is an algebraic structurethat captures certain properties of a model and its category of definable sets.If M is a module over a product of rings A and B, then M has a decomposition into a direct sum of an A-module and a B-module. Theorem 3.5.1 states that then the Grothendieck ring of M is the tensor product of the Grothendieck rings of the summands.Theorem 4.3.1 states that the Grothendieck ring of every infinite module over afield or skew field is isomorphic to Z[X].Proposition 5.2.4 states that for an elementary extension of models of anytheory, the elementary embedding induces an embedding of the corresponding Grothendieck rings. Theorem 5.3.1 is that for an elementary embedding of modules, we have the stronger result that the embedding induces an isomorphism of Grothendieck rings.We define a model-theoretic Grothendieck ring of the category Mod-R and explorethe relationship between this ring and the Grothendieck rings of general right R-modules. The category of pp-imaginaries, shown by K. Burke in [7] to be equivalentto the subcategory of finitely presented functors in (mod-R; Ab), provides a functorial approach to studying the generators of theGrothendieck rings of R-modules. It is shown in Theorem 6.3.5 that whenever R andS are Morita equivalent rings, the rings Grothendieck rings of the module categories Mod-R and Mod-S are isomorphic.Combining results from previous chapters, we derive Theorem 7.2.1 saying that theGrothendieck ring of any module over a semisimple ring is isomorphic to a polynomialring Z[X1,...,Xn] for some n.
45
Koolage, W. John. "An analysis of empirical equivalence, its foundation, the evidence-theory distinction, and its entailment, underdetermination." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape9/PQDD_0006/MQ45074.pdf.
Full text
46
Belisle, Jordan. "A Theory of Relational Density." OpenSIUC, 2018. https://opensiuc.lib.siu.edu/dissertations/1556.
Full textAbstract:
Relational Density Theory describes quantifiable higher-order properties governing relational framing of verbal organisms. Consistent with Newtonian classical mechanics, the theory posits that relational networks, and relating itself, will demonstrate the higher-order emergent properties of density, volume, and mass. Thus, networks that contain more relations (volume) that are stronger (density) will be more resistant to change (i.e., contain greater mass; mass = volume * density). Consistent with Newton’s law of gravity, networks that contain greater mass will also demonstrate force, accelerating the acquisition of new relations beyond that accounted for by direct acting contingencies, therefore demonstrating emergent self-organization that is highly susceptible to small changes at initial conditions. The current set of experiments provides initial proof of concept data for foundational principles introduced in the theory. Experiment 1 (N = 6) models the volumetric mass density formula, predicting that networks with greater volume and density will be more resistant to change (i.e., contain greater mass) when counterconditioning is applied to a subset of derived relations contained within experimentally established networks. Results were consistent with theoretical predictions based on density on 10 of 12 occasions, and resistance appeared greater for relations operating at greater volume. Experiment 2 (N = 6) extended directly from Experiment 1, generating a density differential through exposure at initial training conditions, and utilizing response time as a measure of relational density. Results again demonstrated successful prediction of resistance corresponding with the emergent density differential on 10 of 12 occasions, along with overall greater resistance corresponding with and volumetric increases. Experiment 3 (N = 9) demonstrated that relational volume can detract from relational density when accurate responding is near 100%, and that network density is predictive of class mergers when no merged responding is ever reinforced, suggesting that network mass can exert force on relational responding in the absence of any experimental conditioning (i.e., gravity). Taken together, results have radical implications for understanding the self-emergent nature of complex human behavior, with applications in therapy and treatment, as well as in understanding the human condition more broadly.
47
Bose, Partha. "An evaluation of classical and refined equivalent-single-layer laminate theories." Thesis, This resource online, 1995. http://scholar.lib.vt.edu/theses/available/etd-06112009-063723/.
Full text
48
Craig, Stephen Bartholomew. "Implicit Theories and Beta Change in Longitudinal Evaluations of Training Effectiveness: An Investigation Using Item Response Theory." Diss., Virginia Tech, 2002. http://hdl.handle.net/10919/27627.
Full textAbstract:
Golembiewski, Billingsly, and Yeager (1976) conceptualized three distinct types of change that might result from development interventions, called alpha, beta, and gamma change. Recent research has found that beta and gamma change do occur as hypothesized, but the phenomena are somewhat infrequent and the precise conditions under which they occur have not been established. This study used confirmatory factor analysis and item response theory to identify gamma and beta change on a multidimensional, multisource managerial performance appraisal instrument and to examine relations among the change types, training program content, and raters' implicit theories of performance. Results suggested that coverage in training was a necessary but not sufficient condition for beta and gamma change to occur. Further, although gamma change was detected only in the trainee group, beta change was detected in self-ratings from trainees and in ratings collected from their superiors. Because trainees' superiors were involved in post-training follow-up, this finding was interpreted as a possible diffusion of treatments effect (Campbell & Stanley, 1963). Contrary to expectations, there were no interpretable relations between raters' implicit theories of performance and either of the change types. Perhaps relatedly, more implicit theory change was detected among individuals providing observer ratings than in the trainees themselves. The implications of these findings for future research on plural change were discussed.Ph. D.
49
Heyman, Joseph Lee. "On the Computation of Strategically Equivalent Games." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1561984858706805.
Full text
50
Metcalfe, Marta J. "Teaching phonics skills to young children via the formation of generalized equivalence classes." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1137509.
Full textAbstract:
An equivalence class exists if the stimuli that comprise the class are related by the properties of reflexivity, symmetry, and transitivity. Through these properties, new behavior that has not been taught emerges. For example, when taught to match Set A stimuli to Set B stimuli and to match Set A stimuli to Set C stimuli, if equivalence classes have formed, subjects will (with no explicit instruction) match Set B stimuli to Set C and Set C stimuli to Set B stimuli. Although equivalence classes have been studied extensively, few studies have considered the application of this technology to educational concerns. The purpose of this study was (a) to determine if phonics skills could effectively and efficiently be taught to young children through the formation of equivalence classes and (b) to investigate the generality of those acquired skills. Using a conditional discrimination procedure, children were taught to match printed letters to dictated phonetic sounds and to match the initial sound of pictured items to dictated phonetic sounds. Test results indicated that equivalence classes had emerged and that generalization did occur. The children could match the initial sound of pictured items to printed letters and vice versa and could name letter sounds and initial sounds of pictured items. During generality testing, each child could identify the initial sound of several novel pictured items and could sound out the letters within the words. However, reading did not occur. Only 1 of 5 children could blend the sounds of letters into recognizable words. A significant difficulty encountered throughout the study was maintaining the children's motivation, possibly due to the children's inexperience in attending to academic tasks. This study did, however, demonstrate that the formation of equivalence classes is an effective and efficient method for teaching phonics and that the formation of generalized equivalence classes is effective in extending those taught relations to novel stimuli.Department of Special Education