M.A. Plan B Theses- Mathematics DepartmentNo Descriptionhttps://hdl.handle.net/10125/232562024-10-08T00:53:33Z2024-10-08T00:53:33Z291Generalized Analytic ContinuationToyofuku, Justinhttps://hdl.handle.net/10125/295132024-09-18T13:13:23Z2012-01-01T00:00:00Zdc.title: Generalized Analytic Continuation
dc.contributor.author: Toyofuku, Justin
dc.description.abstract: Analytic continuation is the extension of the domain of a given analytic function in the complex plane, to a larger domain of the complex plane. This process has been utilized in many other areas of mathematics, and has given mathematicians new insight into some of the world’s hardest problems. This paper will cover more general forms of analytic continuation, which will be referred to as generalized analytic continuations. The paper will closely follow William Ross’ and Harold Shapiro’s book “Generalized Analytic Continuation” [14], with the proofs worked out with more detail, and a few generalizations are made regarding the Poincare example in Section 3.3.
2012-01-01T00:00:00ZInformation Processing and Energy Dissipation in NeuronsMcIntosh, Lanehttps://hdl.handle.net/10125/295102024-08-11T13:19:35Z2012-01-01T00:00:00Zdc.title: Information Processing and Energy Dissipation in Neurons
dc.contributor.author: McIntosh, Lane
dc.description.abstract: We investigate the relationship between thermodynamic and information theoretic inefficiencies in an individual neuron model, the adaptive exponential integrate-and-fire neuron. Recent work has revealed that minimization of energy dissipation is tightly related to optimal information processing, in the sense that a system has to compute a maximally predictive model. In this thesis we justify the extension of these results to the neuron and quantify the neuron’s thermodynamic and information processing inefficiencies.
2012-01-01T00:00:00ZAn Iterated Version of the Generalized Singular Value Decomposition for the Joint Analysis of Two High-Dimensional Data SetsZeinalzadeh, Ashkanhttps://hdl.handle.net/10125/295082024-09-03T13:15:56Z2013-01-01T00:00:00Zdc.title: An Iterated Version of the Generalized Singular Value Decomposition for the Joint Analysis of Two High-Dimensional Data Sets
dc.contributor.author: Zeinalzadeh, Ashkan
dc.description.abstract: In this work, we developed a new computational algorithm for the integrated analysis of high-dimensional data sets based on the Generalized Singular Value Decomposition(GSVD). We developed an iterative version of the Generalized Singular Value Decomposition (IGSVD) that jointly analyzes two data matrices to identify signals that correlate the rows of two matrices. The IGSVD has been validated on simulated and real genomic data sets and results on simulated show that the algorithm is able to sequentially detect multiple simulated signals that were embedded in high levels of background noise. Results on real DNA microarray data from normal and tumor tissue samples indicate that the IGSVD detects signals that are biologically relevant to the initiation and progression of liver cancer.
2013-01-01T00:00:00ZNondeterministic Finite State ComplexityHyde, Kayleighhttps://hdl.handle.net/10125/295072024-08-23T13:22:31Z2013-01-01T00:00:00Zdc.title: Nondeterministic Finite State Complexity
dc.contributor.author: Hyde, Kayleigh
dc.description.abstract: We define a new measure of complexity for finite strings using nondeterministic finite automata, called nondeterministic automatic complexity and denoted AN(x). In this paper we prove some basic results for AN(x), give upper and lower bounds, estimate it for some specific strings, begin to classify types of strings with small complexities, and provide AN(x) for |x| ≤ 8.
2013-01-01T00:00:00ZValidating a Food Frequency Questionnaire for GuamChong, Marie Q.https://hdl.handle.net/10125/295062024-09-11T13:20:11Z2012-01-01T00:00:00Zdc.title: Validating a Food Frequency Questionnaire for Guam
dc.contributor.author: Chong, Marie Q.
2012-01-01T00:00:00ZGeometric Path Planning for a Lego AUVAndonian, Michaelhttps://hdl.handle.net/10125/295042024-08-07T13:16:11Z2012-01-01T00:00:00Zdc.title: Geometric Path Planning for a Lego AUV
dc.contributor.author: Andonian, Michael
dc.description.abstract: For the last thirty years or so, differential geometry and control theory have merged and grown together to produce extraordinary results. When applied to mechanical systems, one sees a system waiting to be exploited for its inherent geometric properties. In this paper, we present the equations of motion for a submerged rigid body from a geometric point of view and use tools from differential geometry to provide solutions to the motion planning problem for an autonomous underwater vehicle. Specifically, the geometry allows us to deduce permissible motions for a vehicle that is underactuated purely from the available degrees of freedom. The geometric equations of motion are then used to path plan for a cost-effective Lego vehicle through simulations and actual implementation as providing a proof of concept.
2012-01-01T00:00:00ZThe snowflake decoding algorithmWalker, Catherinehttps://hdl.handle.net/10125/259312024-07-28T00:04:06Z2012-01-01T00:00:00Zdc.title: The snowflake decoding algorithm
dc.contributor.author: Walker, Catherine
dc.description.abstract: This paper describes an automated algorithm for generating a group code using any unitary group, initial vector, and generating set that satisfy a necessary condition. Examples with exceptional complex reflection groups, as well as an analysis of the decoding complexity, are also included.
dc.description: Plan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2012
2012-01-01T00:00:00ZExtending lp--decoding for permutation codes from euclidean to Kendall tau metricKong, Justinhttps://hdl.handle.net/10125/259302024-08-15T13:23:33Z2012-01-01T00:00:00Zdc.title: Extending lp--decoding for permutation codes from euclidean to Kendall tau metric
dc.contributor.author: Kong, Justin
dc.description.abstract: Invented in the 1960’s, permutation codes have reemerged in recent years as a topic of great interest because of properties making them attractive for certain modern technological applications. In 2011 a decoding method called LP (linear programming) decoding was introduced for a class of permutation codes with a Euclidean distance induced metric. In this paper we comparatively analyze the Euclidean and Kendall tau metrics, ultimately providing conditions and examples for which LP-decoding methods can be extended to permutation codes with the Kendall tau metric. This is significant since contemporary research in permutation codes and their promising applications has incorporated the Kendall tau metric.
dc.description: Plan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2012
2012-01-01T00:00:00ZOn Kaneko congruencesChi, Mingjinghttps://hdl.handle.net/10125/259292024-08-23T13:10:16Z2012-01-01T00:00:00Zdc.title: On Kaneko congruences
dc.contributor.author: Chi, Mingjing
dc.description.abstract: We present a proof of certain congruences modulo powers of an odd prime for the coefficients of a series produced by repeated application of U -operator to a certain weakly holomorphic modular form. This kind of congruences were first observed by Kaneko as a result of numerical experiments, and later proved in a different (but similar) case by Guerzhoy [6]. It is interesting to note that, in our case, the congruences become different, both experimentally and theoretically, depending on whether the prime is congruent to 1 or 3 modulo 4.
dc.description: Plan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2012
2012-01-01T00:00:00ZMultimetric continuous model theoryCaulfield, Erinhttps://hdl.handle.net/10125/259282024-09-09T13:15:12Z2012-01-01T00:00:00Zdc.title: Multimetric continuous model theory
dc.contributor.author: Caulfield, Erin
dc.description.abstract: In this paper, we study metric structures with a finite number of metrics by extending the model theory developed by Ben Yaacov et al. in themonograph Model theory for metric structures. We first define a metric structure with finitely many metrics, develop the theory of ultraproducts of multimetric structures, and prove some classical model-theoretic theorems about saturation for structures with multiple metrics. Next, we give a characterization of axiomatizability of certain classes of multimetric structures. Finally, we discuss potential avenues of research regarding structures with multiple metrics.
dc.description: Plan B paper, M.A., Mathematics, University of Hawaii at Manoa, 2012
2012-01-01T00:00:00Z