Computer Sciences Commons^™

Analysis Of 2016-17 Major League Soccer Season Data Using Poisson Regression With R, Ian D. Campbell

Undergraduate Theses and Capstone Projects

To the outside observer, soccer is chaotic with no given pattern or scheme to follow, a random conglomeration of passes and shots that go on for 90 minutes. Yet, what if there was a pattern to the chaos, or a way to describe the events that occur in the game quantifiably. Sports statistics is a critical part of baseball and a variety of other of today’s sports, but we see very little statistics and data analysis done on soccer. Of this research, there has been looks into the effect of possession time on the outcome of a game, the difference …

Preservice Mathematics Teachers' Conceptions And Enactments Of Modeling Standards, Hyunyi Jung, Jill Newton

Mathematics, Statistics and Computer Science Faculty Research and Publications

Mathematical modeling has been highlighted recently as Common Core State Standards for Mathematics [CCSSM] included Model with Mathematics as one of the Standards for Mathematical Practices [SMP] and a modeling strand in the high school standards. This common aspect of standards across most states in the U.S. intended by CCSSM authors and policy makers seems to mitigate the diverse notions of mathematical modeling. When we observed secondary mathematics preservice teachers [PSTs] who learned about the SMP and used CCSSM modeling standards to plan and enact lessons, however, we noted differences in their interpretations and enactments of the standards, despite their …

Exact Sampling And Prefix Distributions, Sebastian Oberhoff

Theses and Dissertations

This thesis explores some new means to generate random numbers without incurring any numerical

inaccuracies along the way. In the context of continuous distributions this leads to the discussion of

prex distributions { discrete distributions that fully capture a continuous distribution by describing

their initial digits. These are rst studied graphically, then analytically, which also leads to a general

examination of the behavior of the distribution of trailing digits of continuous distributions. Finally,

some slightly novel, related results from the theory of computation are presented.

Secure Multiparty Protocol For Differentially-Private Data Release, Anthony Harris

Boise State University Theses and Dissertations

In the era where big data is the new norm, a higher emphasis has been placed on models which guarantees the release and exchange of data. The need for privacy-preserving data arose as more sophisticated data-mining techniques led to breaches of sensitive information. In this thesis, we present a secure multiparty protocol for the purpose of integrating multiple datasets simultaneously such that the contents of each dataset is not revealed to any of the data owners, and the contents of the integrated data do not compromise individual’s privacy. We utilize privacy by simulation to prove that the protocol is privacy-preserving, …

Characterizations And Infinite Divisibility Of Certain Recently Introduced Distributions Iv, Gholamhossein G. Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

Certain characterizations of recently proposed univariate continuous distributions are presented in different directions. This work contains a good number of reintroduced distributions and may serve as a source of preventing the reinvention and/or duplication of the existing distributions in the future.

The Kumaraswamy Marshall-Olkin Log-Logistic Distribution With Application, Selen Cakmakyapan, Gamze Ozel, Yehia Mousa Hussein El Gebaly, Gholamhossein G. Hamedani

Mathematics, Statistics and Computer Science Faculty Research and Publications

In this paper, we define and study a new lifetime model called the Kumaraswamy Marshall-Olkin log-logistic distribution. The new model has the advantage of being capable of modeling various shapes of aging and failure criteria. The new model contains some well-known distributions as special cases such as the Marshall-Olkin log-logistic, log-logistic, lomax, Pareto type II and Burr XII distributions. Some of its mathematical properties including explicit expressions for the quantile and generating functions, ordinary moments, skewness, kurtosis are derived. The maximum likelihood estimators of the unknown parameters are obtained. The importance and flexibility of the new model is proved empirically …

Physical Applications Of The Geometric Minimum Action Method, George L. Poppe Jr.

Dissertations, Theses, and Capstone Projects

This thesis extends the landscape of rare events problems solved on stochastic systems by means of the \textit{geometric minimum action method} (gMAM). These include partial differential equations (PDEs) such as the real Ginzburg-Landau equation (RGLE), the linear Schroedinger equation, along with various forms of the nonlinear Schroedinger equation (NLSE) including an application towards an ultra-short pulse mode-locked laser system (MLL).

Additionally we develop analytical tools that can be used alongside numerics to validate those solutions. This includes the use of instanton methods in deriving state transitions for the linear Schroedinger equation and the cubic diffusive NLSE.

These analytical solutions are …

Multi Self-Adapting Particle Swarm Optimization Algorithm (Msapso)., Gerhard Koch

Electronic Theses and Dissertations

The performance and stability of the Particle Swarm Optimization algorithm depends on parameters that are typically tuned manually or adapted based on knowledge from empirical parameter studies. Such parameter selection is ineffectual when faced with a broad range of problem types, which often hinders the adoption of PSO to real world problems. This dissertation develops a dynamic self-optimization approach for the respective parameters (inertia weight, social and cognition). The effects of self-adaption for the optimal balance between superior performance (convergence) and the robustness (divergence) of the algorithm with regard to both simple and complex benchmark functions is investigated. This work …

Putting Fürer's Algorithm Into Practice With The Bpas Library, Linxiao Wang

Electronic Thesis and Dissertation Repository

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as other disciplines. In 1971, Schönhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most n bits to O(log n log log n). In 2007, Martin Fürer presented a new algorithm that runs in O (n log n · 2 ^O(log* n)) , where log*n is the iterated logarithm of n. We explain how we can put Fürer’s ideas into practice for multiplying polynomials over a prime field Z/pZ, which characteristic is a Generalized Fermat prime of …

Efficient Reduced Bias Genetic Algorithm For Generic Community Detection Objectives, Aditya Karnam Gururaj Rao

Theses

The problem of community structure identification has been an extensively investigated area for biology, physics, social sciences, and computer science in recent years for studying the properties of networks representing complex relationships. Most traditional methods, such as K-means and hierarchical clustering, are based on the assumption that communities have spherical configurations. Lately, Genetic Algorithms (GA) are being utilized for efficient community detection without imposing sphericity. GAs are machine learning methods which mimic natural selection and scale with the complexity of the network. However, traditional GA approaches employ a representation method that dramatically increases the solution space to be searched by …

Graph Pebbling: Doppelgangers And Lemke Graphs, Mark Powers

17th Annual Celebration of Undergraduate Research and Creative Performance (2018)

Graph pebbling is a mathematical game played on a connected graph. A configuration places a nonnegative number of pebbles on each vertex. A move between a pair of adjacent vertices removes two pebbles from one vertex and places one pebble on the other. A configuration is solvable if a sequence of pebbling moves can be made to place a pebble on any given vertex. The pebbling number of a graph is the minimum number of pebbles so that any configuration is solvable. A graph satisfies the two-pebbling property if any configuration of more than twice the pebbling number minus the …

Quantum Attacks On Modern Cryptography And Post-Quantum Cryptosystems, Zachary Marron

Senior Honors Theses

Cryptography is a critical technology in the modern computing industry, but the security of many cryptosystems relies on the difficulty of mathematical problems such as integer factorization and discrete logarithms. Large quantum computers can solve these problems efficiently, enabling the effective cryptanalysis of many common cryptosystems using such algorithms as Shor’s and Grover’s. If data integrity and security are to be preserved in the future, the algorithms that are vulnerable to quantum cryptanalytic techniques must be phased out in favor of quantum-proof cryptosystems. While quantum computer technology is still developing and is not yet capable of breaking commercial encryption, these …

Near-Optimal Control Of Switched Systems With Continuous-Time Dynamics Using Approximate Dynamic Programming, Tohid Sardarmehni

Mechanical Engineering Research Theses and Dissertations

Optimal control is a control method which provides inputs that minimize a performance index subject to state or input constraints [58]. The existing solutions for finding the exact optimal control solution such as Pontryagin’s minimum principle and dynamic programming suffer from curse of dimensionality in high order dynamical systems. One remedy for this problem is finding near optimal solution instead of the exact optimal solution to avoid curse of dimensionality [31]. A method for finding the approximate optimal solution is through Approximate Dynamic Programming (ADP) methods which are discussed in the subsequent chapters.

In this dissertation, optimal switching in switched …

Economics Of Commitment: Why Giving Away Some Freedom Makes Sense, Vladik Kreinovich, Olga Kosheleva, Mahdokhat Afravi, Genesis Bejarano, Marisol Chacon

Departmental Technical Reports (CS)

In general, the more freedom we have, the better choices we can make, and thus, the better possible economic outcomes. However, in practice, people often artificially restrict their future options by making a commitment. At first glance, commitments make no economic sense, and so their ubiquity seems puzzling. Our more detailed analysis shows that commitment often makes perfect economic sense: namely, it is related to the way we take future gains and losses into account. With the traditionally assumed exponential discounting, commitment indeed makes no economic sense, but with the practically observed hyperbolic discounting, commitment is indeed often economically beneficial.

Why Under Stress Positive Reinforcement Is More Effective? Why Optimists Study Better? Why People Become Restless? Simple Utility-Based Explanations, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we use the utility-based approach to decision making to provide simple answers to the following three questions: Why under stress positive reinforcement is more effective? Why optimists study better? Why people become restless?

How Interval Measurement Uncertainty Affects The Results Of Data Processing: A Calculus-Based Approach To Computing The Range Of A Box, Andrew Pownuk, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical applications, we are interested in the values of the quantities y₁, ..., y_m which are difficult (or even impossible) to measure directly. A natural idea to estimate these values is to find easier-to-measure related quantities x₁, ..., x_n and to use the known relation to estimate the desired values y_i. Measurements come with uncertainty, and often, the only thing we know about the actual value of each auxiliary quantity x_i is that it belongs to the interval [X_i − Δ_i, X_i + Δ_{i …}

Why Bellman-Zadeh Approach To Fuzzy Optimization, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many cases, we need to select the best of the possible alternatives, but we do not know for sure which alternatives are possible and which are not possible. Instead, for each alternative x, we have a subjective probability p(x) that this alternative is possible. In 1970, Richard Bellman and Lotfi Zadeh proposed a heuristic method for selecting an alternative under such uncertainty. Interestingly, this method works very well in many practical applications, while similarly motivated alternative formulas do not work so well. In this paper, we explain the empirical success of the Bellman-Zadeh approach by showing that its formulas …

Volume 10, Taylor Hogg, Tiffany Carter, Brandyn Johnson, Haleigh James, Josh Baker, Tyler Cernak, Kirsten Bauer, Allie Snavely, Mary Zell Galen, Eric Powell, Thomas Wise, Katie Kinsey, Beth Barbolla, Maeleigh Ferlet, Rebecca Morra, Michala Day, Alexandra Evangelista, Max Flores, Harley Hodges, Clardene Jones, Harrison Samaniego, Jamesha Watson, Abby Gargiulo, Heather Green, Haley Klepatzki, Juan Guevara, Dani Bondurant, Michael Joseph Link Jr., Pamela Dahl, Maeve Losen, Charlotte Murphey

Incite: The Journal of Undergraduate Scholarship

Introduction Dr. Roger A. Byrne

An Analysis of Media Framing in Cases of Violence Against Women by Taylor Hogg

Writing in the Discipline of Nursing by Tiffany Carter

Photography by Brandyn Johnson

The Hidden Life of Beef Cattle: A Study of Cattle Welfare on Traditional Ranches and Industrial Farms by Haleigh James

Bloodworth's by Josh Baker and Tyler Cernak

Prosimians: Little Bodies, Big Significance by Kirsten Bauer

Skinformed by Allie Snavely

Coopertition and Gracious Professionalism: The Effects of First Robotics Folklore and Culture on the Stem Community by Mary Zell Galen

Tilt by Eric Powell And Thomas Wise

The Millennial …

Understanding Natural Keyboard Typing Using Convolutional Neural Networks On Mobile Sensor Data, Travis Siems

Computer Science and Engineering Theses and Dissertations

Mobile phones and other devices with embedded sensors are becoming increasingly ubiquitous. Audio and motion sensor data may be able to detect information that we did not think possible. Some researchers have created models that can predict computer keyboard typing from a nearby mobile device; however, certain limitations to their experiment setup and methods compelled us to be skeptical of the models’ realistic prediction capability. We investigate the possibility of understanding natural keyboard typing from mobile phones by performing a well-designed data collection experiment that encourages natural typing and interactions. This data collection helps capture realistic vulnerabilities of the security …

Text Classification Of Installation Support Contract Topic Models For Category Management, William C. Sevier

Theses and Dissertations

Air Force Installation Contracting Agency manages nearly 18 percent of total Air Force spend, equating to approximately 57 billion dollars. To improve strategic sourcing, the organization is beginning to categorize installation-support spend and assign accountable portfolio managers to respective spend categories. A critical task in this new strategic environment includes the appropriate categorization of Air Force contracts into newly created, manageable spend categories. It has been recognized that current composite categories have the opportunity to be further distinguished into sub-categories leveraging text analytics on the contract descriptions. Furthermore, upon establishing newly constructed categories, future contracts must be classified into these …

Why Zipf's Law: A Symmetry-Based Explanation, Daniel Cervantes, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we have probability distributions for which, for large values of the corresponding quantity x, the probability density has the form ρ(x) ~ x^−αfor some α > 0. While, in principle, we have laws corresponding to different α, most frequently, we encounter situations -- first described by Zipf for linguistics -- when α is close to 1. The fact that Zipf's has appeared frequently in many different situations seems to indicate that there must be some fundamental reason behind this law. In this paper, we provide a possible explanation.

A Survey On Network Security-Related Data Collection Technologies, Huaqing Lin, Zheng Yan, Yu Chen, Lifang Zhang

Faculty Publications, Information Systems & Technology

Security threats and economic loss caused by network attacks, intrusions, and vulnerabilities have motivated intensive studies on network security. Normally, data collected in a network system can reflect or can be used to detect security threats. We define these data as network security-related data. Studying and analyzing security-related data can help detect network attacks and intrusions, thus making it possible to further measure the security level of the whole network system. Obviously, the first step in detecting network attacks and intrusions is to collect security-related data. However, in the context of big data and 5G, there exist a number of …

Supporting Accurate Interpretation Of Self-Administered Medical Test Results For Mobile Health: Assessment Of Design, Demographics, And Health Condition, Jess C. Hohenstein, Eric P.S. Baumer, Lindsay Reynolds, Elizabeth L. Murnane, Dakota O'Dell, Seoho Lee, Shion Guha, Yu Qi, Erin Rieger, Geri K. Gay

Mathematics, Statistics and Computer Science Faculty Research and Publications

Background: Technological advances in personal informatics allow people to track their own health in a variety of ways, representing a dramatic change in individuals’ control of their own wellness. However, research regarding patient interpretation of traditional medical tests highlights the risks in making complex medical data available to a general audience.

Objective: This study aimed to explore how people interpret medical test results, examined in the context of a mobile blood testing system developed to enable self-care and health management.

Methods: In a preliminary investigation and main study, we presented 27 and 303 adults, respectively, with hypothetical results from several …

Italian Folk Multiplication Algorithm Is Indeed Better: It Is More Parallelizable, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Traditionally, many ethnic groups had their own versions of arithmetic algorithms. Nowadays, most of these algorithms are studied mostly as pedagogical curiosities, as an interesting way to make arithmetic more exciting to the kids: by applying to their patriotic feelings -- if they are studying the algorithms traditionally used by their ethic group -- or simply to their sense of curiosity. Somewhat surprisingly, we show that one of these algorithms -- a traditional Italian multiplication algorithm -- is actually in some reasonable sense better than the algorithm that we all normally use -- namely, it is easier to parallelize.

Statistical Analysis Of Network Change, Teresa D. Schmidt, Martin Zwick

Systems Science Faculty Publications and Presentations

Networks are rarely subjected to hypothesis tests for difference, but when they are inferred from datasets of independent observations statistical testing is feasible. To demonstrate, a healthcare provider network is tested for significant change after an intervention using Medicaid claims data. First, the network is inferred for each time period with (1) partial least squares (PLS) regression and (2) reconstructability analysis (RA). Second, network distance (i.e., change between time periods) is measured as the mean absolute difference in (1) coefficient matrices for PLS and (2) calculated probability distributions for RA. Third, the network distance is compared against a reference distribution …

Summary Of The Special Issue “Neutrosophic Information Theory And Applications” At “Information” Journal, Florentin Smarandache, Jun Ye

Branch Mathematics and Statistics Faculty and Staff Publications

Over a period of seven months (August 2017–February 2018), the Special Issue dedicated to “Neutrosophic Information Theory and Applications” by the “Information” journal (ISSN 2078-2489), located in Basel, Switzerland, was a success. The Guest Editors, Prof. Dr. Florentin Smarandache from the University of New Mexico (USA) and Prof. Dr. Jun Ye from the Shaoxing University (China), were happy to select—helped by a team of neutrosophic reviewers from around the world, and by the “Information” journal editors themselves—and publish twelve important neutrosophic papers, authored by 27 authors and coauthors. There were a variety of neutrosophic topics studied and used by the …

Gradient Estimation For Attractor Networks, Thomas Flynn

Dissertations, Theses, and Capstone Projects

It has been hypothesized that neural network models with cyclic connectivity may be more powerful than their feed-forward counterparts. This thesis investigates this hypothesis in several ways. We study the gradient estimation and optimization procedures for several variants of these networks. We show how the convergence of the gradient estimation procedures are related to the properties of the networks. Then we consider how to tune the relative rates of gradient estimation and parameter adaptation to ensure successful optimization in these models. We also derive new gradient estimators for stochastic models. First, we port the forward sensitivity analysis method to the …

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

Ronald Greenberg

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

Some Applications Of Sophisticated Mathematics To Randomized Computing, Ronald I. Greenberg

Ronald Greenberg

No abstract provided.

Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg

Ronald Greenberg

Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …