Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 25 for “"Euclidean algorithm"”.
-
Roots of univariate polynomials via the euclidean algorithm
In this paper, we will consider univariate polynomials with real coefficients in degrees three, four, and five in great detail. Polynomial conditions will be found in terms of the coefficients of the univariate polynomial that will be able to describe the configuration of the roots. These …
-
Practicality of algorithmic number theory
This report discusses some of the uses of algorithms within number theory. Topics examined include the applications of algorithms in the study of cryptology, the Euclidean Algorithm, prime generating functions, and the connections between algorithmic number theory and high school algebra.
-
Methods for Computing the Greatest Common Divisor and Applications in Mathematical Programming.
… for use on a computer and compared with the Euclidean algorithm. Computational results and applications are given.
-
Wavelet Factorization and Related Polynomials
… of the discrete wavelet transform (DWT) for the algorithms of Daubechies and Sweldens and Mallat. Nearest neighbor lifting is a specific form of the general lifting scheme that improves the lifting algorithm by optimizing the number of efficient memory accesses. Nearest neighbor lifting …
-
Cayley Graphs of Semigroups and Applications to Hashing
… functions and maximal length chains in the Euclidean algorithm for polynomials over $F_2$. In this work, we present a new proposal for hash functions based on Cayley graphs of semigroups. In our proposed hash function, the noncommutative semigroup of linear functions under composition is …
-
Computing a Basis for an Integer Lattice
… are equal to their gcd. The classical extended Euclidean algorithm and fast variants such as the half-gcd algorithm give efficient algorithmic solutions. In this thesis, we give a fast algorithm to solve the simplest — but not trivial — extension of the scalar extended gcd problem on two …
-
The dynamics of Pythagorean Triples
… the unit interval and show a connection to the Euclidean algorithm. We show that the dynamical system is conservative and ergodic.
-
STUDY ON THE PATTERN RECOGNITION ENHANCEMENT FOR MATRIX FACTORIZATIONS WITH AUTOMATIC RELEVANCE DETERMINATION
… is to propose a new technique combining the algorithm Expectation Maximization (EM) with Automatic Relevance Determination (ARD) to discover the ground truth basis of datasets, and then to compare my new proposed technique to the others such as: traditional NMF, sparseness constraint and …
-
Towards a practical and secure biometric authentication system
… practical decoders based on the Berlekamp-Massey algorithm and the Euclidean algorithm, and provide the first implementation of a Reed-Solomon decoder for the Fuzzy Vault scheme. Our implementation results indicate that the traditional Berlekamp-Massey algorithm may not be as suitable and …
-
Evolution, computer simulation, and human mate selection
… Three studies in Chapter 3 compare several algorithms for how our mate selection psychology could translate our many individual preferences into mating decisions. Data from agent-based models and real human couples suggest that human mate preferences are integrated into feelings of …
-
Systolic design space exploration of EEA-based inversion over binary and ternary fields
… field operation in ECC. The two predominant algorithms for computing finite field inversion are Fermat’s Little Theorem (FLT) and Extended Euclidean Algorithm (EEA). EEA is reported to be the most efficient inversion algorithm in terms of performance and power consumption. This dissertation …
-
Evaluating Performance and Efficiency of a 16-bit Substitution Box on an FPGA
… is a sponge based Authenticated Encryption (AE) algorithm which provides both authenticity and confidentiality. It was developed through a joint effort between the Rochester Institute of Technology and the former Harris Corporation, now L3Harris. The MK-3 algorithm has a state that is 512 bits …
-
Ab initio nanostructure determination
… the edges in a network have weights equal to the Euclidean distance between their endpoints. A method, called Tribond, for the reconstruction of the locations of the nodes of the network given only the edge weights of the Euclidean network is presented. The timing results indicate that the …
-
Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>)
… eliminating global data interconnects. Recursive algorithms with regular data flows are suitable for systolization. The computation of multiplicative inversion using algorithms based on EEA (Extended Euclidean Algorithm) are particularly suitable for systolization. Implementations based on EEA …
-
Ham sandwiches, staircases and counting polynomials
… one is recursive and closely related to the Euclidean Algorithm. These geometric observations have several applications. First, they lead to a new proof of Barvinok's Theorem in dimension 2. Second, they yield a recursion formula for Dedekind-Carlitz polynomials. Third, they allow us to …
-
Egyptian fractions
Egyptian fractions are what we know as unit fractions that are of the form 1/n - with the exception, by the Egyptians, of 2/3. Egyptian fractions have actually played an important part in mathematics history with its primary roots in number theory. This paper will trace the history of Egyptian …
-
Egyptian fractions
Egyptian fractions are what we know as unit fractions that are of the form 1/n - with the exception, by the Egyptians, of 2/3. Egyptian fractions have actually played an important part in mathematics history with its primary roots in number theory. This paper will trace the history of Egyptian …
-
Action Recognition Based on Multi-Level Representation of 3D Shape
A novel algorithm is proposed in this thesis for recognizing human actions using a combination of two shape descriptors, one of which is a 3D Euclidean distance transform and the other based on the Radon transform. This combination captures the necessary variations from the space time shape for …
-
Αλγοριθμικές διαδικασίες ως κύρια μαθηματική γνώση: διδασκαλία και μάθησή τους στο δημοτικό σχολείο
Algorithms are a main and essential part of procedural knowledge in Mathematics. Indeed, Mathematics, in a broad sense, is only algorithms. Algorithms, according to the modern conceptual definition, do not have the meaning of exclusively standardized procedures, such as performing arithmetic …
Page 1 of 2