Mathematics Commons^™

Algorithms For Solving The Discrete Logarithm Problem, Ryan Edward Whaley

Online Theses and Dissertations

In mathematics, there are often many procedures to solve or prove the same problem. The discrete logarithm is one of these problems. The baby step, giant step algorithm and Pollard's kangaroo algorithm are two algorithms that attempt to solve discrete logarithm problems. Explanations on what these two algorithms are will be discussed as well as examples of each algorithm. In addition to these two algorithms, a modified form of Pollard's kangaroo algorithm will be provided with results. Throughout the text, Mathematica programs will be presented that simulate each of the three algorithms above.

An Incremental Reseeding Strategy For Clustering, Xavier Bresson, Huiyi Hu, Thomas Laurent, Arthur Szlam, James Von Brecht

Mathematics, Statistics and Data Science Faculty Works

In this work we propose a simple and easily parallelizable algorithm for multiway graph partitioning. The algorithm alternates between three basic components: diffusing seed vertices over the graph, thresholding the diffused seeds, and then randomly reseeding the thresholded clusters. We demonstrate experimentally that the proper combination of these ingredients leads to an algorithm that achieves state-of-the-art performance in terms of cluster purity on standard benchmarks datasets. Moreover, the algorithm runs an order of magnitude faster than the other algorithms that achieve comparable results in terms of accuracy. We also describe a coarsen, cluster and refine approach similar to GRACLUS and …

Crossed Modules Of Racks, Alissa S. Crans, Friedrich Wagemann

Mathematics, Statistics and Data Science Faculty Works

We generalize the notion of a crossed module of groups to that of a crossed module of racks. We investigate the relation to categorified racks, namely strict 2-racks, and trunk-like objects in the category of racks, generalizing the relation between crossed modules of groups and strict 2-groups. Then we explore topological applications. We show that by applying the rack-space functor, a crossed module of racks gives rise to a covering. Our main result shows how the fundamental racks associated to links upstairs and downstairs in a covering fit together to form a crossed module of racks.

Complete Bipartite Graphs Whose Topological Symmetry Groups Are Polyhedral, Blake Mellor

Mathematics, Statistics and Data Science Faculty Works

We determine for which n, the complete bipartite graph K_n,n has an embedding in S³ whose topological symmetry group is isomorphic to one of the polyhedral groups: A₄, A₅, or S₄.

Robust Noise Attenuation Under Stochastic Noises And Worst-Case Unmodelled Dynamics, Araz Hashemi, Ben G. Fitzpatrick, Le Yi Wang, George Yin

Mathematics, Statistics and Data Science Faculty Works

This paper investigates noise attenuation problems for systems with unmodelled dynamics and unknown noise characteristics. A unique methodology is introduced that employs signal estimation in one phase, followed by control design for noise rejection. The methodology enjoys certain advantages in its simple control design process, accommodation of unmodelled dynamics, and non-conservative noise rejection performance. Under mild information on unmodelled dynamics, we first derive robust performance bounds on noise attenuation with respect to unmodelled dynamics without noise estimation errors. Then more general results are presented for systems that are subject to both stochastic signal estimation errors and unmodelled dynamics. Examples are …

Hom Quandles, Alissa S. Crans, Sam Nelson

Mathematics, Statistics and Data Science Faculty Works

If A is an abelian quandle and Q is a quandle, the hom set Hom(Q,A) of quandle homomorphisms from Q to A has a natural quandle structure. We exploit this fact to enhance the quandle counting invariant, providing an example of links with the same counting invariant values but distinguished by the hom quandle structure. We generalize the result to the case of biquandles, collect observations and results about abelian quandles and the hom quandle, and show that the category of abelian quandles is symmetric monoidal closed.

Simulation Of The Sampling Distribution Of The Mean Can Mislead, Ann E. Watkins, Anna E. Bargagliotti, Christine Franklin

Mathematics, Statistics and Data Science Faculty Works

Although the use of simulation to teach the sampling distribution of the mean is meant to provide students with sound conceptual understanding, it may lead them astray. We discuss a misunderstanding that can be introduced or reinforced when students who intuitively understand that “bigger samples are better” conduct a simulation to explore the effect of sample size on the properties of the sampling distribution of the mean. From observing the patterns in a typical series of simulated sampling distributions constructed with increasing sample sizes, students reasonably—but incorrectly—conclude that, as the sample size, n, increases, the mean of the (exact) sampling …

Measures Of Tactical Efficiency In Water Polo, James Graham, John Mayberry

College of the Pacific Faculty Articles

We present a notational analysis of offensive tactics commonly employed in elite men's water polo and address three questions related to this objective: which tactics are most effective?, which tactical performance indicators best classify the winning team?, and how accurate are predictive models based on these performance indicators? We define a new statistic, Efficiency Rating, which quantifies the importance of a tactic via a weighted average of direct and indirect goals generated by its use. By this measure, direct shot is the most efficient even strategy despite being employed far less frequently than centre or perimeter tactics. We address our …

Central Configurations In The Collinear 5-Body Problem, Muhammad Shoaib, Anoop Sivasankaran, Abdulrehman Kashif

Turkish Journal of Mathematics

We study the inverse problem of central configuration of collinear general 4- and 5-body problems. A central configuration for n-body problems is formed if the position vector of each particle with respect to the center of mass is a common scalar multiple of its acceleration. In the 3-body problem, it is always possible to find 3 positive masses for any given 3 collinear positions given that they are central. This is not possible for more than 4-body problems in general. We consider a collinear 5-body problem and identify regions in the phase space where it is possible to choose positive …

Prospect Theory Preferences In Noncooperative Game Theory, Philip Leclerc

Theses and Dissertations

The present work seeks to incorporate a popular descriptive, empirically grounded model of human preference under risk, prospect theory, into the equilibrium theory of noncooperative games. Three primary, candidate definitions are systematically identified on the basis of classical characterizations of Nash Equilibrium; in addition, three equilibrium subtypes are defined for each primary definition, in order to enable modeling of players' reference points as exogenous and fixed, slowly and myopically adaptive, highly flexible and non-myopically adaptive. Each primary equilibrium concept was analyzed both theoretically and empirically; for the theoretical analyses, prospect theory, game theory, and computational complexity theory were all summoned …

Comparing Skew Schur Functions: A Quasisymmetric Perspective, Peter R. W. Mcnamara

Faculty Journal Articles

Reiner, Shaw and van Willigenburg showed that if two skew Schur functions s_A and s_B are equal, then the skew shapes $A$ and $B$ must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a much weaker condition than Schur equality: that s_A and s_B have the same support when expanded in the fundamental quasisymmetric basis F. Surprisingly, there is significant evidence supporting a conjecture that the converse is also true.

In fact, we work in terms of inequalities, showing that if the F-support of s_{A …}

Ramp Loss Svm With L1-Norm Regularizaion, Eric Hess

Theses and Dissertations

The Support Vector Machine (SVM) classification method has recently gained popularity due to the ease of implementing non-linear separating surfaces. SVM is an optimization problem with the two competing goals, minimizing misclassification on training data and maximizing a margin defined by the normal vector of a learned separating surface. We develop and implement new SVM models based on previously conceived SVM with L_1-Norm regularization with ramp loss error terms. The goal being a new SVM model that is both robust to outliers due to ramp loss, while also easy to implement in open source and off the shelf mathematical programming …

Robust Calibration Of Cameras With Telephoto Lens Using Regularized Least Squares, Mingpei Liang, Xinyu Huang, Chung-Hao Chen, Gaolin Zheng, Alade Tokuta

Electrical & Computer Engineering Faculty Publications

Cameras with telephoto lens are usually used to recover details of an object that is either small or located far away from the cameras. However, the calibration of this kind of cameras is not as accurate as the one of cameras with short focal lengths that are commonly used in many vision applications. This paper has two contributions. First, we present a first-order error analysis that shows the relation between focal length and estimation uncertainties of camera parameters. To our knowledge, this error analysis with respect to focal length has not been studied in the area of camera calibration. Second, …

Generator Polynomial Formulation For Parallel Counters With Applications, Lee A. Belfore Ii

Electrical & Computer Engineering Faculty Publications

Parallel counters have been studied for several decades as a component in high speed multipliers and multi-operand adder circuits. Using a generator polynomial as a formalism for describing parallel counters in the general case, parallel counter properties can be derived and inferred. Furthermore, the structure and decomposition of the generator polynomial can suggest different implementation strategies. These include simple implementations of (7,3) and (15,4) parallel counters. By grouping factors, the design of a fast (7,3) parallel counter is presented. Finally, the generator polynomial is extended to permit factors of different weights. This extension provides a means for describing the design …

Topological Duality And Lattice Expansions, I: A Topological Construction Of Canonical Extensions, M. Andrew Moshier, Peter Jipsen

Mathematics, Physics, and Computer Science Faculty Articles and Research

The two main objectives of this paper are (a) to prove purely topological duality theorems for semilattices and bounded lattices, and (b) to show that the topological duality from (a) provides a construction of canonical extensions of bounded lattices. In previously known dualities for semilattices and bounded lattices, the dual spaces are compact 0-dimensional spaces with additional algebraic structure. For example, semilattices are dual to 0-dimensional compact semilattices. Here we establish dual categories in which the spaces are characterized purely in topological terms, with no additional algebraic structure. Thus the results can be seen as generalizing Stone's duality for distributive …

Topological Duality And Lattice Expansions, Ii: Lattice Expansions With Quasioperators, M. Andrew Moshier, Peter Jipsen

Mathematics, Physics, and Computer Science Faculty Articles and Research

The main objective of this paper (the second of two parts) is to show that quasioperators can be dealt with smoothly in the topological duality established in Part I. A quasioperator is an operation on a lattice that either is join preserving and meet reversing in each argument or is meet preserving and join reversing in each argument. The paper discusses several common examples, including orthocomplementation on the closed subspaces of a fixed Hilbert space (sending meets to joins), modal operators auS and a- on a bounded modal lattice (preserving joins, resp. meets), residuation on a bounded residuated lattice (sending …

Krein-Langer Factorization And Related Topics In The Slice Hyperholomorphic Setting, Daniel Alpay, Fabrizio Colombo, Irene Sabadini

Mathematics, Physics, and Computer Science Faculty Articles and Research

We study various aspects of Schur analysis in the slice hyperholomorphic setting. We present two sets of results: first, we give new results on the functional calculus for slice hyperholomorphic functions. In particular, we introduce and study some properties of the Riesz projectors. Then we prove a Beurling-Lax type theorem, the so-called structure theorem. A crucial fact which allows to prove our results, is the fact that the right spectrum of a quaternionic linear operator and the point S-spectrum coincide. Finally, we study the Krein-Langer factorization for slice hyperholomorphic generalized Schur functions. Both the Beurling-Lax type theorem and the Krein-Langer …

Maximal Arcs, Above And Beyond, Diego Domenzain-Gonzale

Dissertations, Master's Theses and Master's Reports - Open

This report explores combinatorial structures in Finite Geometries by giving known constructions of maximal arcs; using maximal arcs to construct two-weight codes, partial geometries, strongly regular graphs and LDPC codes; a review on how to generalize maximal arcs to higher dimensions through Perp-Systems; and an effort in finding constructions of new Perp-Systems.

High Performance, Low Cost Subspace Decomposition And Polynomial Rooting For Real Time Direction Of Arrival Estimation: Analysis And Implementation, Mrudula V. Athi

Dissertations, Master's Theses and Master's Reports - Open

This thesis develops high performance real-time signal processing modules for direction of arrival (DOA) estimation for localization systems. It proposes highly parallel algorithms for performing subspace decomposition and polynomial rooting, which are otherwise traditionally implemented using sequential algorithms. The proposed algorithms address the emerging need for real-time localization for a wide range of applications. As the antenna array size increases, the complexity of signal processing algorithms increases, making it increasingly difficult to satisfy the real-time constraints. This thesis addresses real-time implementation by proposing parallel algorithms, that maintain considerable improvement over traditional algorithms, especially for systems with larger number of antenna …

Adaptive Wavelet Discretization Of Tensor Products In H-Tucker Format, Mazen Ali

Masters Theses

"In previous work, the solution to a system of coupled parabolic PDEs, modeling the price of a CDO, was approximated numerically. Due to the nature of the problem, the system involved a large number of equations such that the parameters cannot be stored explicitly. The authors combined the data sparse H-Tucker storage format with the Galerkin method to approximate the solution, using wavelets for the space discretization together with time stepping (Method of Lines). The aforementioned approximation is of the linear kind, i.e., using a nonadaptive method. In this work, three methods for solving such systems adaptively are presented, together …