Computer Sciences Commons^™

Application Of Guided Local Search (Gls) In Portfolio Optimization, Collether John

Tanzania Journal of Science

Portfolio optimization is a major activity in any operating business. Conventional portfolio optimization research makes simplifying assumptions; for example, they assume no constraint in how many assets one holds (cardinality constraint). They also assume no minimum and maximum holding sizes (holding size constraint). Once these assumptions are relaxed, conventional methods become inapplicable, and hence new methods are needed to tackle this challenge. Threshold Accepting is an established algorithm in the extended portfolio optimization problem. In this paper, an algorithm called Guided Local Search (GLS) is applied using an accurate and efficient designed hill climbing algorithm, named HC-C-R. GLS sitting on …

Why Romans Sometimes Wrote 8 As Viii, And Sometimes As Iix: A Possible Explanation, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Most of us are familiar with Roman numerals and with the standard way of describing numbers in the form of these numerals. What many people do not realize is that the actual ancient Romans often deviated from these rules. For example, instead of always writing the number 8 as VIII, i.e., 5 + 3, they sometimes wrote it as IIX, i.e., as 10 − 2. Some of such differences can be explained: e.g., the unusual way of writing 98 as IIC, i.e., as 100 − 2, can be explained by the fact that the Latin word for 98 literally means …

What Is The Logic Behind Cistercian Numbers?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In the 13-15 centuries, many European monasteries used an unusual number system developed originally by the Cistercian monks; later on, this system was used by winemakers. In this paper, we provide a possible explanation of why these particular symbols were used.

Computational Thinking In Mathematics And Computer Science: What Programming Does To Your Head, Al Cuoco, E. Paul Goldenberg

Journal of Humanistic Mathematics

How you think about a phenomenon certainly influences how you create a program to model it. The main point of this essay is that the influence goes both ways: creating programs influences how you think. The programs we are talking about are not just the ones we write for a computer. Programs can be implemented on a computer or with physical devices or in your mind. The implementation can bring your ideas to life. Often, though, the implementation and the ideas develop in tandem, each acting as a mirror on the other. We describe an example of how programming and …

Cassie Dibenedetti's Portfolio, Cassie Dibenedetti

Honors College Portfolios

The Data Science B.S. curriculum surpasses bare collection and interpretation of data. An expansion of these applications are foundational courses that include critical thinking, articulate translation, and data immersion. The mathematical pillar of the Data Science program teaches students fundamental calculus and statistical skills, and the computer science pillar teaches students the utilization of software when working with data. Most importantly, the data science pillar intertwines the two and teaches students to provide practical solutions to problems involving data.

This portfolio serves as a glimpse into the Data Science student’s curriculum. Viewers can observe the varying skills required of a …

How To Estimate Time Needed For Software Migration, Francisco Zapata, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we need to migrate the existing software package to a new programming language and/or a new operating system. In such a migration, it is important to be able to accurately estimate time needed for this migration: if we underestimate this time, we will lose money and may go bankrupt; if we overestimate this time, other companies who estimate more accuracy will outbid us, and we will lose the contract. The formulas currently used for estimating migration time often lead to underestimation. In this paper, we start with the main ideas behind the existing formulas, and show …

Distributions On An Interval As A Scale-Invariant Combination Of Scale-Invariant Functions: Theoretical Explanation Of Empirical Marchenko-Pastur-Type Distributions, Vladik Kreinovich, Kevin Alvarez, Chon Van Le

Departmental Technical Reports (CS)

In many practical situations, we know the lower and upper bounds L and U on possible values of a quantity x. In such situations, the probability distribution of this quantity is also located on the corresponding interval [L, U]. In many such cases, the empirical probability distribution has the form d(x) = const * (x − L)α− * (U − x)α+ * xα. In the particular case α− = α+ = 0.5 and α = −1, we get the Marchenko-Pastur distribution that describes the distribution of the eigenvalues of a random matrix. However, in some cases, the empirical distribution corresponds …

How To Gauge Reliability Of A Binary Classification Result: A Simple Case, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we need to make a binary decision based on the available data: whether an incoming email is a spam or not, whether to give a bank loan to a company, etc. In many such situations, we can (and do) use machine learning to come up with such a decision. The problem is that while the results of a machine learning model are not 100% reliable, the existing machine learning algorithms do not allow us to decide how reliable is each result. In this paper, for simple examples, we provide a technique for gauging this reliability.

The Complexity Of Symmetry, Matthew Lemay

HMC Senior Theses

One of the main goals of theoretical computer science is to prove limits on how efficiently certain Boolean functions can be computed. The study of the algebraic complexity of polynomials provides an indirect approach to exploring these questions, which may prove fruitful since much is known about polynomials already from the field of algebra. This paper explores current research in establishing lower bounds on invariant rings and polynomial families. It explains the construction of an invariant ring for whom a succinct encoding would imply that NP is in P/poly. It then states a theorem about the circuit complexity partial …

Why Gradient Descent -- Not The Best Optimization Technique -- Works Best In Neural Networks: Qualitative Explanation, Jonatan Contreras, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In a usual Numerical Methods class, students learn that gradient descent is not an efficient optimization algorithm, and that more efficient algorithms exist, algorithms which are actually used in state-of-the-art numerical optimization packages. On the other hand, in solving optimization problems related to machine learning -- and, in particular, in currently most efficient deep learning -- gradient descent (in the form of backpropagation) is much more efficient than any of the alternatives that have been tried. How can we reconcile these two statements? In this paper, we explain that, in reality, there is no contradiction here. Namely, in usual applications …

Why Question-Based Reasoning Leads To Constructive Approach To Knowledge, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Once we have partial knowledge, what next question do we usually pursue? Empirical study shows, e.g., that if we know that A \/ B is true, but we do not know whether A is true or B is true, then the usual next step is to ask whether A is true or B is true. This selection of the next step is in line with the constructive approach to knowledge, in which when A \/ B is true, this means that we either know that A is true, or we know that B is true. In this paper, we provide …

Can Ideas Behind Ancient Egyptian Fractions Speed Up Modern Computers?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

To divide two numbers a and b, modern computers use an algorithm which is more efficient that what we humans normally do: they compute a*(1/b), where for all sufficiently small integers b, the inverse 1/b is pre-computed. For fractions, when both a and b are integers, this algorithm requires only one multiplication. Can we make the procedure even faster by not using multiplication at all? To do this, we need to represent each fraction as the sum of inverses -- which, interestingly, is how ancient Egyptians represented fractions.

Cross-Model Parameter Estimation In Epidemiology, Julia R. Fitzgibbons

Honors Theses and Capstones

No abstract provided.

Question Answering By Bert, Suman Karanjit

Student Academic Conference

No abstract provided.

Occam Software (And Manual) For Reconstructability Analysis, Martin Zwick, Kenneth Willett, Joe Fusion, Heather Alexander

Complex Systems Faculty Publications and Presentations

OCCAM is a Discrete Multivariate Modeling (DMM) tool based on the methodology of Reconstructability Analysis (RA). As an acronym it stands for Organizational Complexity Computation and Modeling, and the name is also a reference (with a non-standard spelling) to Ockham’s Razor. The principal programmers of its current version have been Kenneth Willett, Joe Fusion, and Heather Alexander. Ken Willett totally rewrote earlier versions of OCCAM. His version was originally called “OCCAM3” to distinguish it from these earlier OCCAM incarnations; the “3” has finally been dropped.

OCCAM’s typical use is to analyze data involving a large number of discrete variables, but …

Computational Utilities For The Game Of Simplicial Nim, Nelson Penn

Theses and Dissertations--Computer Science

Simplicial nim games, a class of impartial games, have very interesting mathematical properties. Winning strategies on a simplicial nim game can be determined by the set of positions in the game whose Sprague-Grundy values are zero (also zero positions). In this work, I provide two major contributions to the study of simplicial nim games. First, I provide a modern and efficient implementation of the Sprague-Grundy function for an arbitrary simplicial complex, and discuss its performance and scope of viability. Secondly, I provide a method to find a simple mathematical expression to model that function if it exists. I show the …

Ranked List Fusion And Re-Ranking With Pre-Trained Transformers For Arqmath Lab, Shaurya Rohatgi, Jian Wu, C. Lee Giles

Computer Science Faculty Publications

This paper elaborates on our submission to the ARQMath track at CLEF 2021. For our submission this year we use a collection of methods to retrieve and re-rank the answers in Math Stack Exchange in addition to our two-stage model which was comparable to the best model last year in terms of NDCG’. We also provide a detailed analysis of what the transformers are learning and why is it hard to train a math language model using transformers. This year’s submission to Task-1 includes summarizing long question-answer pairs to augment and index documents, using byte-pair encoding to tokenize formula and …

Semantic, Integrated Keyword Search Over Structured And Loosely Structured Databases, Xinge Lu

Dissertations

Keyword search has been seen in recent years as an attractive way for querying data with some form of structure. Indeed, it allows simple users to extract information from databases without mastering a complex structured query language and without having knowledge of the schema of the data. It also allows for integrated search of heterogeneous data sources. However, as keyword queries are ambiguous and not expressive enough, keyword search cannot scale satisfactorily on big datasets and the answers are, in general, of low accuracy. Therefore, flat keyword search alone cannot efficiently return high quality results on large data with structure. …

A Distance Based Multisample Test For High-Dimensional Compositional Data With Applications To The Human Microbiome, Qingyang Zhang, Thy Dao

Mathematical Sciences Faculty Publications and Presentations

Background

Compositional data refer to the data that lie on a simplex, which are common in many scientific domains such as genomics, geology and economics. As the components in a composition must sum to one, traditional tests based on unconstrained data become inappropriate, and new statistical methods are needed to analyze this special type of data.

Results

In this paper, we consider a general problem of testing for the compositional difference between K populations. Motivated by microbiome and metagenomics studies, where the data are often over-dispersed and high-dimensional, we formulate a well-posed hypothesis from a Bayesian point of view and …

An Update On The Computational Theory Of Hamiltonian Period Functions, Bradley Joseph Klee

Graduate Theses and Dissertations

Lately, state-of-the-art calculation in both physics and mathematics has expanded to include the field of symbolic computing. The technical content of this dissertation centers on a few Creative Telescoping algorithms of our own design (Mathematica implementations are given as a supplement). These algorithms automate analysis of integral period functions at a level of difficulty and detail far beyond what is possible using only pencil and paper (unless, perhaps, you happen to have savant-level mental acuity). We can then optimize analysis in classical physics by using the algorithms to calculate Hamiltonian period functions as solutions to ordinary differential equations. The simple …

Development Of A Mobile Ten Frames App For Philippine K-12 Schools, Debbie Marie Versoza, Ma. Louise Antonette N. De Las Peñas, Jumela F. Sarmiento, Mark Anthony C. Tolentino, Mark L. Loyola

Mathematics Faculty Publications

This paper reports on the Quick Images app, whose design framework is informed by research on ten-structured thinking and gamification principles. Inclusivity was also a major consideration, especially in the context of a developing country. Thus, the app was made freely available and required only moderate system requirements. Pilot studies revealed that the app has the potential to promote children’s ability to see two-digit numbers in relation to tens and ones, which is a major goal of elementary school mathematics. Collaborations with the Philippine Department of Education to ensure the app’s sustained use are also discussed.

Discrete Models And Algorithms For Analyzing Dna Rearrangements, Jasper Braun

USF Tampa Graduate Theses and Dissertations

In this work, language and tools are introduced, which model many-to-many mappings that comprise DNA rearrangements in nature. Existing theoretical models and data processing methods depend on the premise that DNA segments in the rearrangement precursor are in a clear one-to-one correspondence with their destinations in the recombined product. However, ambiguities in the rearrangement maps obtained from the ciliate species Oxytricha trifallax violate this assumption demonstrating a necessity for the adaptation of theory and practice.

In order to take into account the ambiguities in the rearrangement maps, generalizations of existing recombination models are proposed. Edges in an ordered graph model …

Analyzing Yankees And Red Sox Sentiment Over The Course Of A Season, Connor Koch

Honors Projects in Data Science

This paper investigates data collected on twitter which references the Yankees or Red Sox during the 2020 Major League Baseball (MLB) season. The objective is to analyze the sentiment of tweets referencing the Yankees and Red Sox over the course of the season. In addition, an investigation of the networks within the data and the topics that were prevalent will be conducted. The 2020 MLB season was started late because of the COVID-19 pandemic and was a season like no other. The expectation of a dataset revolving around baseball is that the topics discussed would be about baseball. The findings …

A Natural Formalization Of Changing-One's-Mind Leads To Square Root Of "Not" And To Complex-Valued Fuzzy Logic, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

We show that a natural formalization of the process of changing one's mind leads to such seemingly non-intuitive ideas as square root of "not" and complex-valued fuzzy degrees.

A Hybrid Agent-Based And Equation Based Model For The Spread Of Infectious Diseases, Elizabeth Hunter, Brian Mac Namee, John D. Kelleher

Articles

Both agent-based models and equation-based models can be used to model the spread of an infectious disease. Equation-based models have been shown to capture the overall dynamics of a disease outbreak while agent-based models are able to capture heterogeneous characteristics of agents that drive the spread of an outbreak. However, agent-based models are computationally intensive. To capture the advantages of both the equation-based and agent-based models, we create a hybrid model where the disease component of the hybrid model switches between agent-based and equation-based. The switch is determined using the number of agents infected. We first test the model at …

Controlling Aircraft Yaw Movement By Interval Type-2 Fuzzy Logic, Yamama Shafeek, Laith Majeed, Rasha Naji

Emirates Journal for Engineering Research

Aircraft yaw movement is essential in maneuvering; it has been controlled by some methods which achieved tracking but not fast enough. This paper performs the dynamic modeling of aircraft yaw movement and develops PI and PI-like interval type-2 fuzzy logic controller for the model. The mathematical model is derived by inserting the parameters values of single-engine Navion aircraft into standard equations. Using Matlab/ Simulink platform, the controllers' effectivity is tested and verified in two different cases; system without disturbance and when system is disturbed by some wind gust to investigate the system robustness. Simulation results show that PI controller response …

Espade: An Efficient And Semantically Secure Shortest Path Discovery For Outsourced Location-Based Services, Bharath K. Samanthula, Divyadharshini Karthikeyan, Boxiang Dong, K. Anitha Kumari

Department of Computer Science Faculty Scholarship and Creative Works

With the rapid growth of smart devices and technological advancements in tracking geospatial data, the demand for Location-Based Services (LBS) is facing a constant rise in several domains, including military, healthcare and transportation. It is a natural step to migrate LBS to a cloud environment to achieve on-demand scalability and increased resiliency. Nonetheless, outsourcing sensitive location data to a third-party cloud provider raises a host of privacy concerns as the data owners have reduced visibility and control over the outsourced data. In this paper, we consider outsourced LBS where users want to retrieve map directions without disclosing their location information. …

Period Estimation And Noise In A Neutrally Stable Stochastic Oscillator, Kevin R. Sanft, Ben F. M. Intoy

Spora: A Journal of Biomathematics

The periods of the orbits for the well-mixed cyclic three-species Lotka-Volterra model far away from the fixed point are studied. For finite system sizes, a discrete stochastic approach is employed and periods are found via wavelet analysis. As the system size is increased, a hierarchy of approximations ranging from Poisson noise to Gaussian noise to deterministic models are utilized. Based on the deterministic equations, a mathematical relationship between a conserved quantity of the model and the period of the population oscillations is found. Exploiting this property we then study the deterministic conserved quantity and period noise in finite size systems.

Some Generalizations Of Classical Integer Sequences Arising In Combinatorial Representation Theory, Sasha Verona Malone

Masters Theses & Specialist Projects

There exists a natural correspondence between the bases for a given finite-dimensional representation of a complex semisimple Lie algebra and a certain collection of finite edge-colored ranked posets, laid out by Donnelly, et al. in, for instance, [Don03]. In this correspondence, the Serre relations on the Chevalley generators of the given Lie algebra are realized as conditions on coefficients assigned to poset edges. These conditions are the so-called diamond, crossing, and structure relations (hereinafter DCS relations.) New representation constructions of Lie algebras may thus be obtained by utilizing edge-colored ranked posets. Of particular combinatorial interest are those representations whose corresponding …

Making Artificial Cips Data With A Generative Adversarial Neural Network, Austin Hedges

Fall Showcase for Research and Creative Inquiry

Polar mesospheric clouds (PMCs) have been studied for thirteen years by NASA's Aeronomy of Ice in the Mesosphere (AIM) satellite. The Cloud Imaging and Particle Size (CIPS) instrument onboard AIM has taken many images of PMCs over this time. Such a large number of images makes CIPS data ideal for training neural networks which require large datasets. CIPS images were used to train a Generative Adversarial Network (GAN) to train towards being able to generate purely artificial CIPS-like images.