Computer Sciences Commons^™

Characterizations Of Pareto, Weibull And Power Function Distributions Based On Generalized Order Statistics, M. Ahsanullah, Gholamhossein Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

Characterizations of probability distributions by different regression conditions on generalized order statistics has attracted the attention of many researchers. We present here, characterization of Pareto and Weibull distributions based on the conditional expectation of generalized order statistics extending the characterization results reported by Jin and Lee (2014). We also present a characterization of the power function distribution based on the conditional expectation of lower generalized order statistics.

Accuracy And Precision Of Occlusal Contacts Of Stereolithographic Casts Mounted By Digital Interocclusal Registrations, Jason T. Krahenbuhl, Seok-Hwan Cho, Jon Patrick Irelan, Naveen K. Bansal

Mathematics, Statistics and Computer Science Faculty Research and Publications

Statement of problem

Little peer-reviewed information is available regarding the accuracy and precision of the occlusal contact reproduction of digitally mounted stereolithographic casts.

Purpose

The purpose of this in vitro study was to evaluate the accuracy and precision of occlusal contacts among stereolithographic casts mounted by digital occlusal registrations.

Material and methods

Four complete anatomic dentoforms were arbitrarily mounted on a semi-adjustable articulator in maximal intercuspal position and served as the 4 different simulated patients (SP). A total of 60 digital impressions and digital interocclusal registrations were made with a digital intraoral scanner to fabricate 15 sets of mounted stereolithographic …

An Algorithm For The Machine Calculation Of Minimal Paths, Robert Whitinger

Electronic Theses and Dissertations

Problems involving the minimization of functionals date back to antiquity. The mathematics of the calculus of variations has provided a framework for the analytical solution of a limited class of such problems. This paper describes a numerical approximation technique for obtaining machine solutions to minimal path problems. It is shown that this technique is applicable not only to the common case of finding geodesics on parameterized surfaces in R³, but also to the general case of finding minimal functionals on hypersurfaces in Rⁿ associated with an arbitrary metric.

Unfolding Convex Polyhedra Via Radially Monotone Cut Trees, Joseph O'Rourke

Computer Science: Faculty Publications

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut is infinitesimally opened by the curvature at the vertices along the path. It is shown that a class of planar, triangulated convex domains always have a radially monotone spanning forest, a forest that can be found by an essentially greedy algorithm. This algorithm can be mimicked in 3D and applied to polyhedra inscribed in a sphere. Although the algorithm does …

Ciliate Codon Translator Program Manual, Quentin D. Altemose

Mathematics Summer Fellows

Understanding the evolutionary history of organisms allows us to better comprehend selective pressures and their effects on larger populations. In our study, we focused on analyzing the DNA of ciliate groups, which are single celled protozoans characterized by the presence of cilia on their outer membrane. We utilized the DNA of the organisms to analyze the changes in population genotype over time. We tested existing evolutionary models (designed to represent natural genetic variation over time in populations) against our data to identify the model with the best fit and likelihood. From the DNA and the evolutionary model with the highest …

Efficient Algorithms And Applications In Topological Data Analysis, Junyi Tu

USF Tampa Graduate Theses and Dissertations

Topological Data Analysis (TDA) is a new and fast growing research field developed over last two decades. TDA finds many applications in computer vision, computer graphics, scientific visualization, molecular biology, and material science, to name a few. In this dissertation, we make algorithmic and application contributions to three data structures in TDA: contour trees, Reeb graphs, and Mapper. From the algorithmic perspective, we design a parallel algorithm for contour tree construction and implement it in OpenCL. We also design and implement critical point pairing algorithms to compute persistence diagrams directly from contour trees, Reeb graphs, and Mapper. In terms of …

Why 3-D Space? Why 10-D Space? A Possible Simple Geometric Explanation, Vladik Kreinovich

Departmental Technical Reports (CS)

In physics, the number of observed spatial dimensions (three) is usually taken as an empirical fact, without a deep theoretical explanation. In this paper, we provide a possible simple geometric explanation for the 3-D character of the proper space. We also provide a simple geometric explanation for the number of additional spatial dimensions that some physical theories use. Specifically, it is known that for some physical quantities, the 3-D space model with point-wise particles leads to meaningless infinities. To avoid these infinities, physicists have proposed that particles are more adequately described not as 0-D points, but rather as 1-D strings …

Complex-Valued Time-Series Correlation Increases Sensitivity In Fmri Analysis, Mary C. Kociuba, Daniel B. Rowe

Mathematics, Statistics and Computer Science Faculty Research and Publications

Purpose

To develop a linear matrix representation of correlation between complex-valued (CV) time-series in the temporal Fourier frequency domain, and demonstrate its increased sensitivity over correlation between magnitude-only (MO) time-series in functional MRI (fMRI) analysis.

Materials and Methods

The standard in fMRI is to discard the phase before the statistical analysis of the data, despite evidence of task related change in the phase time-series. With a real-valued isomorphism representation of Fourier reconstruction, correlation is computed in the temporal frequency domain with CV time-series data, rather than with the standard of MO data. A MATLAB simulation compares the Fisher-z transform …

Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper provides tips for LEGO robot construction involving bracing or gear meshing along a diagonal using standard Botball kits.

Cayley Graphs Of Semigroups And Applications To Hashing, Bianca Sosnovski

Dissertations, Theses, and Capstone Projects

In 1994, Tillich and Zemor proposed a scheme for a family of hash functions that uses products of matrices in groups of the form $SL_2(F_{2^n})$. In 2009, Grassl et al. developed an attack to obtain collisions for palindromic bit strings by exploring a connection between the Tillich-Zemor 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 considered as platform for the scheme. We will also …

Treatment With Actriib-Mfc Produces Myofiber Growth And Improves Lifespan In The Acta1 H40y Murine Model Of Nemaline Myopathy, Jennifer E. Tinklenberg, Hui W. Meng, Lin J. Yang, Fujun Liu, Raymond G. Hoffmann, Mahua Dasgupta, Kenneth P. Allen, Alan H. Beggs, Edna C. Hardeman, R. Scott Pearsall, Robert H. Fitts, Michael W. Lawlor

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Construction Of Energy Preserving Qmf, Jian-Ao Lian, Yonghui Wang

Applications and Applied Mathematics: An International Journal (AAM)

Recently, a family of perfect reconstruction (PR) quadrature mirror filterbanks (QMF) with finite impulse response filters (FIR) from systems of biorthogonal refinable functions and wavelets were introduced and also applied to image processing. However, a detailed procedure was absent. The main objective of this paper is to present extensive examples that will provide a thorough process of construction of the new family of PR QMF with FIR filterbanks. These new filters are linearphase due to the symmetry property of their corresponding biorthogonal refinable functions and wavelets. In addition, these filters have odd lengths so that the symmetric extension can be …

Certain Operations On Bipolar Fuzzy Graph Structures, Muhammad Akram, Rabia Akmal

Applications and Applied Mathematics: An International Journal (AAM)

A graph structure is a useful tool in solving the combinatorial problems in different areas of computer science and computational intelligence systems. A bipolar fuzzy graph structure is a generalization of a bipolar fuzzy graph. In this paper, we present several different types of operations, including composition, Cartesian product, strong product, cross product, and lexicographic product on bipolar fuzzy graph structures. We also investigate some properties of operations.

Testing Multiple Hypotheses With Skewed Alternatives, Naveen K. Bansal, Gholamhossein G. Hamedani, Mehdi Maadooliat

Mathematics, Statistics and Computer Science Faculty Research and Publications

In many practical cases of multiple hypothesis problems, it can be expected that the alternatives are not symmetrically distributed. If it is known a priori that the distributions of the alternatives are skewed, we show that this information yields high power procedures as compared to the procedures based on symmetric alternatives when testing multiple hypotheses. We propose a Bayesian decision theoretic rule for multiple directional hypothesis testing, when the alternatives are distributed as skewed, under a constraint on a mixed directional false discovery rate. We compare the proposed rule with a frequentist's rule of Benjamini and Yekutieli (2005) using simulations. …

The Contributions Of Anatol Rapoport To Game Theory, Erika Simpson

Political Science Publications

Game theory is used to rationally and dispassionately examine the strategic behaviour of nations, especially superpower behaviour. This article explains how basic game theory - at its simplest level - was used by Anatol Rapoport to generate ideas about how to enhance world peace. Rapoport was at the forefront of the game theoreticians who sought to conceptualize strategies that could promote international cooperation. Accordingly, the basic logic of game theory is explained using the game models of ‘Chicken’ and ‘Prisoner’s Dilemma’. These models were used by Rapoport in his books and lectures in simple and complex ways. Then Rapoport’s revolutionary …

Hill's Diagrammatic Method And Reduced Graph Powers, Gregory D. Smith, Richard Hammack

Biology and Medicine Through Mathematics Conference

No abstract provided.

Counting Solutions To Discrete Non-Algebraic Equations Modulo Prime Powers, Abigail Mann

Mathematical Sciences Technical Reports (MSTR)

As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is thought that the functions that such schemes use have inverses that are computationally intractable. In relation to this, we are interested in counting the solutions to a generalization of the discrete logarithm problem modulo a prime power. This is achieved by interpolating to p-adic functions, and using Hensel's lemma, or other methods in the case of singular lifting, and the Chinese Remainder Theorem.

Statistical Analysis Of Binary Functional Graphs Of The Discrete Logarithm, Mitchell Orzech

Mathematical Sciences Technical Reports (MSTR)

The increased use of cryptography to protect our personal information makes us want to understand the security of cryptosystems. The security of many cryptosystems relies on solving the discrete logarithm, which is thought to be relatively difficult. Therefore, we focus on the statistical analysis of certain properties of the graph of the discrete logarithm. We discovered the expected value and variance of a certain property of the graph and compare the expected value to experimental data. Our finding did not coincide with our intuition of the data following a Gaussian distribution given a large sample size. Thus, we found the …

Decoding Of Non-Binary Multiple Insertion/Deletion Error Correcting Codes, Tuan Anh Le

Theses and Dissertations

Data that is either transmitted over a communication channel or stored in memory is not always completely error free. Many communication channels are subject to noise, and thus errors may occur during transmission from transmitter to receiver. For example, DRAM memory cell contents can change spuriously due to electromagnetic interference while magnetic flux can cause one or more bits to flip in magnetic storage devices. To combat these errors, codes capable of correcting insertion/deletion errors have been investigated.

Levenshtein codes are the foundation of this thesis. His codes, first constructed by Varshamov-Tenengol’ts, are capable of correcting one insertion/deletion error. Helberg …

Statistics In League Of Legends: Analyzing Runes For Last-Hitting, Brian M. Hook

Mathematics: Student Scholarship & Creative Works

While other sports have statisticians to evaluate players and their stats, in electronic sports there is a need for statisticians to evaluate different parts of the game. League of Legends is the most popular of ESports and is the focus of this discussion. The mechanic of focus here is runes which give boosts to the players stats in-game like being able to do extra damage. We will be finding the effectiveness of these runes by looking at gold efficiency, help with last hitting, and extra damage dealt through the use of Python.

Kings And Heirs: A Characterization Of The (2,2)-Domination Graphs Of Tournaments, Kim A. S. Factor, Larry J. Langley

Mathematics, Statistics and Computer Science Faculty Research and Publications

In 1980, Maurer coined the phrase king when describing any vertex of a tournament that could reach every other vertex in two or fewer steps. A (2,2)-domination graph of a digraph D, dom_2,2(D), has vertex set V(D), the vertices of D, and edge uv whenever u and v each reach all other vertices of D in two or fewer steps. In this special case of the (i,j)-domination graph, we see that Maurer’s theorem plays an important role in establishing which vertices form the kings that create some of the edges in dom_2,2(D). But of even more …

New Flexible Regression Models Generated By Gamma Random Variables With Censored Data, Elizabeth M. Hashimoto, Gauss M. Cordeiro, Edwin M. M. Ortega, Gholamhossein G. Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

We propose and study a new log-gamma Weibull regression model. We obtain explicit expressions for the raw and incomplete moments, quantile and generating functions and mean deviations of the log-gamma Weibull distribution. We demonstrate that the new regression model can be applied to censored data since it represents a parametric family of models which includes as sub-models several widely-known regression models and therefore can be used more effectively in the analysis of survival data. We obtain the maximum likelihood estimates of the model parameters by considering censored data and evaluate local influence on the estimates of the parameters by taking …

Self-Monitoring Practices, Attitudes, And Needs Of Individuals With Bipolar Disorder: Implications For The Design Of Technologies To Manage Mental Health, Elizabeth L. Murnane, Dan Cosley, Pamara Chang, Shion Guha, Ellen Frank, Geri K. Gay, Mark Matthews

Mathematics, Statistics and Computer Science Faculty Research and Publications

Objective To understand self-monitoring strategies used independently of clinical treatment by individuals with bipolar disorder (BD), in order to recommend technology design principles to support mental health management.

Materials and Methods Participants with BD (N = 552) were recruited through the Depression and Bipolar Support Alliance, the International Bipolar Foundation, and WeSearchTogether.org to complete a survey of closed- and open-ended questions. In this study, we focus on descriptive results and qualitative analyses.

Results Individuals reported primarily self-monitoring items related to their bipolar disorder (mood, sleep, finances, exercise, and social interactions), with an increasing trend towards the use of digital …

The Eagle Programming Language, Samuel G. Horlbeck Olsen

Mathematics, Statistics, and Computer Science Honors Projects

C remains the dominant systems programming language despite many new languages attempting to take its place. Modern languages generally value abstraction and safety over speed and direct control of hardware. They are therefore not well suited to the low-level tasks for which C was designed. This paper introduces a novel programming language, Eagle, which represents a fast, elegant alternative to C. It allows low-level programming while providing optional modern features like reference counting, closures, generators, and classes. In addition to specifying this language and reviewing the current alternatives, the paper describes the implementation of a working Eagle compiler. The language …

Bases For Mckay Centralizer Algebras, Lucas Gagnon

Mathematics, Statistics, and Computer Science Honors Projects

The finite subgroups of the special unitary group SU2 have been classified to be isomorphic to one of the following groups: cyclic, binary dihedral, binary tetrahedral, binary octahedral, and binary icosahedral, of order n, 4n, 24, 48, and 120, respectively. Associated to each group is a representation graph, which by the McKay correspondence is a Dynkin diagram of type Aˆ n−1, Dˆ n+2, Eˆ 6, Eˆ 7, or Eˆ 8. The centralizer algebra Zk(G) = EndG(V ⊗k ) is the algebra of transformations that commute with G acting on the k-fold tensor product of the defining representation V = C …

Building Voters: Exploring Interdependent Preferences In Binary Contexts, Ian Calaway

Mathematics, Statistics, and Computer Science Honors Projects

In this thesis we develop a new method for constructing binary preference orders for given interdependent structures, called characters. We introduce the preference space, which is a vector space of preference vectors. The preference vectors correspond to binary preference orders. We show that the hyperoctahedral group, Z2 o Sn, describes the symmetries of binary preferences orders and then define an action of Z2 o Sn on our preference vectors. We find a natural basis for a preference space. These basis vectors are indexed by subsets of proposals. We show that when completely separable binary preference vectors are decomposed using this …

Blossom: A Language Built To Grow, Jeffrey Lyman

Mathematics, Statistics, and Computer Science Honors Projects

No abstract provided.

Pooling Strength Amongst Limited Datasets Using Hierarchical Bayesian Analysis, With Application To Pyroclastic Density Current Mobility Metrics, Sarah E. Ogburn, James Berger, Eliza S. Calder, Danilo Lopes, Abani K. Patra, E. Bruce Pitman, Regis Rutarindwa, Elaine Spiller, Robert L. Wolpert

Mathematics, Statistics and Computer Science Faculty Research and Publications

In volcanology, the sparsity of datasets for individual volcanoes is an important problem, which, in many cases, compromises our ability to make robust judgments about future volcanic hazards. In this contribution we develop a method for using hierarchical Bayesian analysis of global datasets to combine information across different volcanoes and to thereby improve our knowledge at individual volcanoes. The method is applied to the assessment of mobility metrics for pyroclastic density currents in order to better constrain input parameters and their related uncertainties for forward modeling. Mitigation of risk associated with such flows depends upon accurate forecasting of possible inundation …

Variance Of Clusterings On Graphs, Thomas Vlado Mulc

Mathematical Sciences Technical Reports (MSTR)

Graphs that represent data often have structures or characteristics that can represent some relationships in the data. One of these structures is clusters or community structures. Most clustering algorithms for graphs are deterministic, which means they will output the same clustering each time. We investigated a few stochastic algorithms, and look into the consistency of their clusterings.

How To Predict Nesting Sites And How To Measure Shoreline Erosion: Fuzzy And Probabilistic Techniques For Environment-Related Spatial Data Processing, Stephen Escarzaga, Craig Tweedie, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we show how fuzzy and probabilistic techniques can be used in environment-related data processing. Specifically, we will show that these methods help in solving two environment-related problems: how to predict the birds' nesting sites and how to measure shoreline erosion.