Computer Sciences Commons^™

Generalizing Math Word Problem Solvers Via Solution Diversification, Zhenwen Liang, Jipeng Zhang, Lei Wang, Yan Wang, Jie Shao, Xiangliang Zhang

Research Collection School Of Computing and Information Systems

Current math word problem (MWP) solvers are usually Seq2Seq models trained by the (one-problem; one-solution) pairs, each of which is made of a problem description and a solution showing reasoning flow to get the correct answer. However, one MWP problem naturally has multiple solution equations. The training of an MWP solver with (one-problem; one-solution) pairs excludes other correct solutions, and thus limits the generalizability of the MWP solver. One feasible solution to this limitation is to augment multiple solutions to a given problem. However, it is difficult to collect diverse and accurate augment solutions through human efforts. In this paper, …

Completeness Of Nominal Props, Samuel Balco, Alexander Kurz

Engineering Faculty Articles and Research

We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are equivalent. This equivalence is then extended to symmetric monoidal theories and nominal monoidal theories, which allows us to transfer completeness results between ordinary and nominal calculi for string diagrams.

Determining The Proportionality Of Ischemic Stroke Risk Factors To Age, Elizabeth Hunter, John D. Kelleher

Articles

While age is an important risk factor, there are some disadvantages to including it in a stroke risk model: age can dominate the risk score and lead to over-or under-predictions in some age groups. There is evidence to suggest that some of these disadvantages are due to the non-proportionality of other risk factors with age, eg, risk factors contribute differently to stroke risk based on an individual’s age. In this paper, we present a framework to test if risk factors are proportional with age. We then apply the framework to a set of risk factors using Framingham heart study data …

Interval-Valued And Set-Valued Extensions Of Discrete Fuzzy Logics, Belnap Logic, And Color Optical Computing, Victor L. Timchenko, Yury P. Kondratenko, Vladik Kreinovich

Departmental Technical Reports (CS)

It has been recently shown that in some applications, e.g., in ship navigation near a harbor, it is convenient to use combinations of basic colors -- red, green, and blue -- to represent different fuzzy degrees. In this paper, we provide a natural explanation for the efficiency of this empirical fact: namely, we show that it is reasonable to consider discrete fuzzy logics, it is reasonable to consider their interval-valued and set-valued extensions, and that a set-valued extension of the 3-values logic is naturally equivalent to the use of color combinations.

Designing An Optimal Medicine Cocktail Is Np-Hard, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

In many cases, a combination of different drugs -- known as a medicine cocktail -- is more effective against a disease than each individual drug. It is desirable to find the most effective cocktail. This problem can be naturally formulated as a problem of maximizing a quadratic expression under the condition that all the unknowns (concentrations of different medicines) are non-negative. At first glance, it may seem that this problem is feasible -- since a similar economic problem of finding the optimal investment portfolio is known to be feasible. However, it turns out that the cocktail problem is different: it …

A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman

HMC Senior Theses

We can think of a pixel as a particle in three dimensional space, where its x, y and z coordinates correspond to its level of red, green, and blue, respectively. Just as a particle’s motion is guided by physical rules like gravity, we can construct rules to guide a pixel’s motion through color space. We can develop striking visuals by applying these rules, called dynamical systems, onto images using animation engines. This project explores a number of these systems while exposing the underlying algebraic structure of color space. We also build and demonstrate a Visual DJ circuit board for …

Why Fractional Fuzzy, Mehran Mazandarani, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situation, control experts can only formulate their experience by using imprecise ("fuzzy") words from natural language. To incorporate this knowledge in automatic controllers, Lotfi Zadeh came up with a methodology that translate the informal expert statements into a precise control strategy. This methodology -- and its following modifications -- is known as fuzzy control. Fuzzy control often leads to a reasonable control -- and we can get an even better control results by tuning the resulting control strategy on the actual system. There are many parameters that can be changes during tuning, so tuning usually is rather …

A Mode Sum Regularization Prescription In Quantum Field Theory In Curved Spacetimes In Higher Dimensions And For Charged Scalar Fields, Eoin Scanlon

Academic Posters Collection

Semi-classical gravity combines classical treatment of the gravitational field with quantum mechanical treatment of matter fields. A significant challenge however is the divergence contained within the stress-energy tensor when solving the semi-classical Einstein equations. This work extends to higher dimensions an extremely efficient method for renormalizing the stress-energy tensor of a quantum scalar field in spherically-symmetric black hole spacetimes, thereby removing the divergences. The method applies to a scalar field with arbitrary field parameters. The utility of the method is demonstrated by computing the renormalized stress-energy tensor for a scalar field in the Schwarzschild black hole spacetime for odd dimensions.

Feedback, Learning Outcomes And Mathematics Anxiety In A Digital Game Based Learning Approach In Mathematics Education, André Almo

Academic Posters Collection

Feedback is a crucial part of learning, and an essential element in digital game-based learning approaches, in which digital games - known as 'serious games' - are used to deliver educational content. Feedback features respond to players' actions within the game, providing them with information and guidance, as well as potentially impacting their learning, motivation and engagement. However, these features may be designed differently, since they include various distinct characteristics and dimensions. This work proposes a new taxonomy for feedback features in serious games, with an emphasis in game design aspects, in order to provide clearer descriptions and distinctions of …

The Power Of Supercomputing Applied To Fractal Image Generation, Charlin Me Duff

Mathematics Senior Capstones

This project looks into how parallelism benefits the runtime of generating large fractal images. First, it explains what the Julia and Mandelbrot Sets are, who discovered them, and how they are calculated. Following that is an introduction to supercomputers, parallel computing, and Cal Poly Humboldt’s very own supercomputer. Once groundwork is laid, I explain my process of adapting a fractal image generation program from serial computing to different levels of parallelism. After that, is an analysis of the effects of levels of parallelism on the runtime of large fractal image generation. This paper concludes with a reflection on the project …

A Study Of The Local Deep Galerkin Method For The Modified Cahn Hilliard Equation, Shi Wen Wong

Electronic Theses and Dissertations

Solving higher order partial differential equations (PDEs) can often prove to be a challenging task due to the involvement of higher-order derivatives of the unknown function, particularly for complex problems. The higher the order of the PDE, the more challenging it becomes to obtain an analytical solution. In such cases, alternative numerical methods are often used, such as finite element method or finite difference method. However, these methods can be computationally expensive and require a significant amount of mathematical expertise to implement. In recent times, there has been significant progress in applying neural networks to various fields, including the solution …

Novel Architectures And Optimization Algorithms For Training Neural Networks And Applications, Vasily I. Zadorozhnyy

Theses and Dissertations--Mathematics

The two main areas of Deep Learning are Unsupervised and Supervised Learning. Unsupervised Learning studies a class of data processing problems in which only descriptions of objects are known, without label information. Generative Adversarial Networks (GANs) have become among the most widely used unsupervised neural net models. GAN combines two neural nets, generative and discriminative, that work simultaneously. We introduce a new family of discriminator loss functions that adopts a weighted sum of real and fake parts, which we call adaptive weighted loss functions. Using the gradient information, we can adaptively choose weights to train a discriminator in the direction …

Bifurcation Levels Of The Integral Manifolds Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem, first proposed by Isaac Newton, is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It has significance to many areas of science, including physics and computer science, and is crucial in understanding how the universe works. In fact, it was a primary motivation for Newton's development of calculus. An important application of the N-body problem is within celestial mechanics and involves how planets and other celestial bodies move with mutual gravitational attraction. It is important in developing how satellites behave in space using complicated …

Peer-To-Peer Energy Trading In Smart Residential Environment With User Behavioral Modeling, Ashutosh Timilsina

Theses and Dissertations--Computer Science

Electric power systems are transforming from a centralized unidirectional market to a decentralized open market. With this shift, the end-users have the possibility to actively participate in local energy exchanges, with or without the involvement of the main grid. Rapidly reducing prices for Renewable Energy Technologies (RETs), supported by their ease of installation and operation, with the facilitation of Electric Vehicles (EV) and Smart Grid (SG) technologies to make bidirectional flow of energy possible, has contributed to this changing landscape in the distribution side of the traditional power grid.

Trading energy among users in a decentralized fashion has been referred …

Object Detection And Image Categorization By Transferring Commonsense Knowledge With Premises And Quantifiers, Irina Chernyavsky

Theses, Dissertations and Culminating Projects

Domestic, or household robots, are autonomous robots designed to make our home-life easier by performing chores and mundane tasks such as cleaning, or cooking. Currently domestic robots are specialized to complete a specific task and, therefore, are confined by factors such as mobility, size, and complexity. With the fast development of computer vision and robotics, the need for more compact, advanced and multi-task robots has emerged. Therefore, the robot needs to be multi-functional, able to discern the environment and the tasks. The aim of this paper is to categorize images in domestic robots as relevant to the culinary, laundry, vacuum …

Clusters, Curves, And Centroids: Stellar Flare Morphology In The Ultraviolet, Vera Berger

Pomona Senior Theses

With a novel sample of 495 high-cadence light curves for stellar flares in the near-ultraviolet, I explore similarity measures, clustering algorithms, averaging methods, and curve fitting techniques for time series. This work seeks to provide insight into whether stellar flares are similar across stars, if we can identify physically meaningful patterns in their light curves, and how to construct a comprehensive model for flares. I construct the first empirical template for flare light curves in the ultraviolet, and compute ``average elements" of flares displaying complex features such as quasi-periodic oscillations and multipeak structures. Developing accurate models for flares in the …

Machine-Assisted Discovery Of Integrable Symplectic Mappings, T. Zolkin, Y. Kharkov, S. Nagaitsev

Physics Faculty Publications

We present a new automated method for finding integrable symplectic maps of the plane. These dynamical systems possess a hidden symmetry associated with an existence of conserved quantities, i.e., integrals of motion. The core idea of the algorithm is based on the knowledge that the evolution of an integrable system in the phase space is restricted to a lower-dimensional submanifold. Limiting ourselves to polygon invariants of motion, we analyze the shape of individual trajectories thus successfully distinguishing integrable motion from chaotic cases. For example, our method rediscovers some of the famous McMillan-Suris integrable mappings and ultradiscrete Painlevé equations. In total, …

Generalized Sparse Bayesian Learning And Application To Image Reconstruction, Jan Glaubitz, Anne Gelb, Guohui Song

Mathematics & Statistics Faculty Publications

Image reconstruction based on indirect, noisy, or incomplete data remains an important yet challenging task. While methods such as compressive sensing have demonstrated high-resolution image recovery in various settings, there remain issues of robustness due to parameter tuning. Moreover, since the recovery is limited to a point estimate, it is impossible to quantify the uncertainty, which is often desirable. Due to these inherent limitations, a sparse Bayesian learning approach is sometimes adopted to recover a posterior distribution of the unknown. Sparse Bayesian learning assumes that some linear transformation of the unknown is sparse. However, most of the methods developed are …

The Mceliece Cryptosystem As A Solution To The Post-Quantum Cryptographic Problem, Isaac Hanna

Senior Honors Theses

The ability to communicate securely across the internet is owing to the security of the RSA cryptosystem, among others. This cryptosystem relies on the difficulty of integer factorization to provide secure communication. Peter Shor’s quantum integer factorization algorithm threatens to upend this. A special case of the hidden subgroup problem, the algorithm provides an exponential speedup in the integer factorization problem, destroying RSA’s security. Robert McEliece’s cryptosystem has been proposed as an alternative. Based upon binary Goppa codes instead of integer factorization, his cryptosystem uses code scrambling and error introduction to hinder decrypting a message without the private key. This …

Modeling Repairable System Failure Data Using Nhpp Reliability Growth Mode., Eunice Ofori-Addo

EWU Masters Thesis Collection

Stochastic point processes have been widely used to describe the behaviour of repairable systems. The Crow nonhomogeneous Poisson process (NHPP) often known as the Power Law model is regarded as one of the best models for repairable systems. The goodness-of-fit test rejects the intensity function of the power law model, and so the log-linear model was fitted and tested for goodness-of-fit. The Weibull Time to Failure recurrent neural network (WTTE-RNN) framework, a probabilistic deep learning model for failure data, is also explored. However, we find that the WTTE-RNN framework is only appropriate failure data with independent and identically distributed interarrival …

Co-Designing Elementary-Level Computer Science And Mathematics Lessons: An Expansive Framing Approach, Umar Shehzad, Jody Clarke-Midura, Kimberly Beck, Jessica Shumway, Mimi Recker

Publications

This study examines how a rural-serving school district aimed to provide elementary-level computer science (CS) by offering instruction during students’ computer lab time. As part of a research-practice partnership, cross-context mathematics and CS lessons were co-designed to expansively frame and highlight connections across – as opposed to integration within – the two subjects. Findings indicated that most students who engaged with the lessons across the lab and classroom contexts reported finding the lessons interesting, seeing connections to their mathematics classes, and understanding the programming. In contrast, a three-level logistic regression model showed that students who only learned about mathematics connections …

The History Of The Enigma Machine, Jenna Siobhan Parkinson

History Publications

The history of the Enigma machine begins with the invention of the rotor-based cipher machine in 1915. Various models for rotor-based cipher machines were developed somewhat simultaneously in different parts of the world. However, the first documented rotor machine was developed by Dutch naval officers in 1915. Nonetheless, the Enigma machine was officially invented following the end of World War I by Arthur Scherbius in 1918 (Faint, 2016).

Which Interval-Valued Alternatives Are Possibly Optimal If We Use Hurwicz Criterion, Marina Tuyako Mizukoshi, Weldon Lodwick, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, for each alternative i, we do not know the corresponding gain xi, we only know the interval [li,ui] of possible gains. In such situations, a reasonable way to select an alternative is to choose some value α from the interval [0,1] and select the alternative i for which the Hurwicz combination α*ui + (1 − α)*li is the largest possible. In situations when we do not know the user's α, a reasonable idea is to select all alternatives that are optimal for some α. In this paper, we describe a feasible algorithm for such a selection.

Data Processing Under Fuzzy Uncertainty: Towards More Accurate Algorithms, Marina Tuyako Mizukoshi, Weldon Lodwick, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Data that we process comes either from measurements or from experts -- or from the results of previous data processing that were also based on measurements and/or expert estimates. In both cases, the data is imprecise. To gauge the accuracy of the results of data processing, we need to take the corresponding data uncertainty into account. In this paper, we describe a new algorithm for taking fuzzy uncertainty into account, an algorithm that, for small number of inputs, leads to the same or even better accuracy than the previously proposed methods.

Non-Localized Physical Processes Can Help Speed Up Computations, Be It Hidden Variables In Quantum Physics Or Non-Localized Energy In General Relativity, Michael Zakharevich, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

While most physical processes are localized -- in the sense that each event can only affect events in its close vicinity -- many physicists believe that some processes are non-local. These beliefs range from more heretic -- such as hidden variables in quantum physics -- to more widely accepted, such as the non-local character of energy in General Relativity. In this paper, we attract attention to the fact that non-local processes bring in the possibility of drastically speeding up computations.

Graph Approach To Uncertainty Quantification, Hector A. Reyes, Cliff Joslyn, Vladik Kreinovich

Departmental Technical Reports (CS)

Traditional analysis of uncertainty of the result of data processing assumes that all measurement errors are independent. In reality, there may be common factor affecting these errors, so these errors may be dependent. In such cases, the independence assumption may lead to underestimation of uncertainty. In such cases, a guaranteed way to be on the safe side is to make no assumption about independence at all. In practice, however, we may have information that a few pairs of measurement errors are indeed independent -- while we still have no information about all other pairs. Alternatively, we may suspect that for …

Systems Approach Explains Why Low Heart Rate Variability Is Correlated With Depression (And Suicidal Thoughts), Francisco Zapata, Eric Smith, Vladik Kreinovich

Departmental Technical Reports (CS)

Depression is a serious medical problem. If diagnosed early, it can usually be cured, but if left undetected, it can lead to suicidal thoughts and behavior. The early stages of depression are difficult to diagnose. Recently, researchers found a promising approach to such diagnosis -- it turns out that depression is correlated with low heart rate variability. In this paper, we show that the general systems approach can explain this empirical relation.

An Argument In Favor Of Piecewise-Constant Membership Functions, Marina Tuyako Mizukoshi, Weldon Lodwick, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Theoretically, we can have membership functions of arbitrary shape. However, in practice, at any given moment of time, we can only represent finitely many parameters in a computer. As a result, we usually restrict ourselves to finite-parametric families of membership functions. The most widely used families are piecewise linear ones, e.g., triangular and trapezoid membership functions. The problem with these families is that if we know a nonlinear relation y = f(x) between quantities, the corresponding relation between membership functions is only approximate -- since for piecewise linear membership functions for x, the resulting membership function for y is not …

Will Nanotechnology Bring In The Judgement Day?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

There are many current and prospective positive aspects of nanotechnology. However, while we look forward to its future successes, we need to keep our eyes open and be prepared for what will really be a future shock: that quantum computing – an inevitable part of nanotechnology – will enable the future folks to read all our encrypted messages and thus, learn everything that we wanted to keep secret. This will be really the Judgement Day, when all our sins will be open to everyone. How we will react to it? Will this destroy our civilization? Let us hope that the …

Standard Interval Computation Algorithm Is Not Inclusion-Monotonic: Examples, Marina Tuyako Mizukoshi, Weldon Lodwick, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

When we usually process data, we, in effect, implicitly assume that we know the exact values of all the inputs. In practice, these values comes from measurements, and measurements are never absolutely accurate. In many cases, the only information about the actual (unknown) values of each input is that this value belongs to an appropriate interval. Under this interval uncertainty, we need to compute the range of all possible results of applying the data processing algorithm when the inputs are in these intervals. In general, the problem of exactly computing this range is NP-hard, which means that in feasible time, …