Spelling suggestions: "subject:"tet 1heory"" "subject:"tet atheory""
181 |
Analysis of Memory Interference in Buffered Multi-processor Systems in Presence of Hot Spots and Favorite MemoriesSen, Sanjoy Kumar 08 1900 (has links)
In this thesis, a discrete Markov chain model for analyzing memory interference in multiprocessors, is presented.
|
182 |
Equivalent Sets and Cardinal NumbersHsueh, Shawing 12 1900 (has links)
The purpose of this thesis is to study the equivalence relation between sets A and B: A o B if and only if there exists a one to one function f from A onto B. In Chapter I, some of the fundamental properties of the equivalence relation are derived. Certain basic results on countable and uncountable sets are given. In Chapter II, a number of theorems on equivalent sets are proved and Dedekind's definitions of finite and infinite are compared with the ordinary concepts of finite and infinite. The Bernstein Theorem is studied and three different proofs of it are given. In Chapter III, the concept of cardinal number is introduced by means of two axioms of A. Tarski, and some fundamental theorems on cardinal arithmetic are proved.
|
183 |
Interactions between combinatorics, lie theory and algebraic geometry via the Bruhat ordersProctor, Robert Alan January 1981 (has links)
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Bibliography: leaves 100-102. / by Robert Alan Proctor. / Ph.D.
|
184 |
Topology and combinatorics of ordered setsWalker, James William January 1981 (has links)
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE. / Bibliography: p. 135-138. / by James William Walker. / Ph.D.
|
185 |
Existence of laws with given marginals and specified supportShortt, Rae Michael Andrew January 1982 (has links)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1982. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND SCIENCE / Bibliography: leaves 106-109. / by Rae Michael Andrew Shortt. / Ph.D.
|
186 |
Linear regularity of closed sets in Banach spaces. / CUHK electronic theses & dissertations collectionJanuary 2004 (has links)
by Zang Rui. / "Nov 2004." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (p. 78-82) / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web. / Abstracts in English and Chinese.
|
187 |
Permutation Groups and Puzzle Tile Configurations of Instant Insanity IIJustus, Amanda N 01 May 2014 (has links)
The manufacturer claims that there is only one solution to the puzzle Instant Insanity II. However, a recent paper shows that there are two solutions. Our goal is to find ways in which we only have one solution. We examine the permutation groups of the puzzle and use modern algebra to attempt to fix the puzzle. First, we find the permutation group for the case when there is only one empty slot at the top. We then examine the scenario when we add an extra column or an extra row to make the game a 4 × 5 puzzle or a 5 x 4 puzzle, respectively. We consider the possibilities when we delete a color to make the game a 3 × 3 puzzle and when we add a color, making the game a 5 × 5 puzzle. Finally, we determine if solution two is a permutation of solution one.
|
188 |
Mathematical Reasoning and the Inductive Process: An Examination of The Law of Quadratic ReciprocityMittal, Nitish 01 June 2016 (has links)
This project investigates the development of four different proofs of the law of quadratic reciprocity, in order to study the critical reasoning process that drives discovery in mathematics. We begin with an examination of the first proof of this law given by Gauss. We then describe Gauss’ fourth proof of this law based on Gauss sums, followed by a look at Eisenstein’s geometric simplification of Gauss’ third proof. Finally, we finish with an examination of one of the modern proofs of this theorem published in 1991 by Rousseau. Through this investigation we aim to analyze the different strategies used in the development of each of these proofs, and in the process gain a better understanding of this theorem.
|
189 |
AN INTRODUCTION TO BOOLEAN ALGEBRASSchardijn, Amy 01 December 2016 (has links)
This thesis discusses the topic of Boolean algebras. In order to build intuitive understanding of the topic, research began with the investigation of Boolean algebras in the area of Abstract Algebra. The content of this initial research used a particular notation. The ideas of partially ordered sets, lattices, least upper bounds, and greatest lower bounds were used to define the structure of a Boolean algebra. From this fundamental understanding, we were able to study atoms, Boolean algebra isomorphisms, and Stone’s Representation Theorem for finite Boolean algebras. We also verified and proved many properties involving Boolean algebras and related structures.
We then expanded our study to more thoroughly developed theory. This comprehensive theory was more abstract and required the use of a different, more universal, notation. We continued examining least upper and greatest lower bounds but extended our knowledge to subalgebras and families of subsets. The notions of cardinality, cellularity, and pairwise disjoint families were investigated, defined, and then used to understand the Erdös-Tarski Theorem.
Lastly, this study concluded with the investigation of denseness and incomparability as well as normal forms and the completion of Boolean algebras.
|
190 |
Fuzzy approaches to speech and peaker recognitionTran, Dat Tat, n/a January 2000 (has links)
Stastical pattern recognition is the most successful approach to automatic speech and
speaker recognition (ASASR). Of all the statistical pattern recognition techniques, the hidden
Markov model (HMM) is the most important. The Gaussian mixture model (GMM)
and vector quantisation (VQ) are also effective techniques, especially for speaker recognition
and in conjunction with HMMs. for speech recognition.
However, the performance of these techniques degrades rapidly in the context of insufficient
training data and in the presence of noise or distortion. Fuzzy approaches with their
adjustable parameters can reduce such degradation.
Fuzzy set theory is one of the most, successful approaches in pattern recognition, where,
based on the idea of a fuzzy membership function, fuzzy C'-means (FCM) clustering and
noise clustering (NC) are the most, important techniques.
To establish fuzzy approaches to ASASR, the following basic problems are solved. First,
a time-dependent fuzzy membership function is defined for the HMM. Second, a general
distance is proposed to obtain a relationship between modelling and clustering techniques.
Third, fuzzy entropy (FE) clustering is proposed to relate fuzzy models to statistical models.
Finally, fuzzy membership functions are proposed as discriminant functions in decison
making.
The following models are proposed: 1) the FE-HMM. NC-FE-HMM. FE-GMM. NC-FEGMM.
FE-VQ and NC-FE-VQ in the FE approach. 2) the FCM-HMM. NC-FCM-HMM.
FCM-GMM and NC-FCM-GMM in the FCM approach, and 3) the hard HMM and GMM
as the special models of both FE and FCM approaches. Finally, a fuzzy approach to speaker
verification and a further extension using possibility theory are also proposed.
The evaluation experiments performed on the TI46, ANDOSL and YOHO corpora showbetter
results for all of the proposed techniques in comparison with the non-fuzzy baseline
techniques.
|
Page generated in 0.0842 seconds