Computer Sciences Commons^™

How To Make A Proof Of Halting Problem More Convincing: A Pedagogical Remark, Benjamin W. Robertson, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

As an example of an algorithmically undecidable problem, most textbooks list the impossibility to check whether a given program halts on given data. A usual proof of this result is based on the assumption that the hypothetical halt-checker works for all programs. To show that a halt-checker is impossible, we design an auxiliary program for which the existence of such a halt-checker leads to a contradiction. However, this auxiliary program is usually very artificial. So, a natural question arises: what if we only require that the halt-checker work for reasonable programs? In this paper, we show that even with such …

Introduction To The Usu Library Of Solutions To The Einstein Field Equations, Ian M. Anderson, Charles G. Torre

Tutorials on... in 1 hour or less

This is a Maple worksheet providing an introduction to the USU Library of Solutions to the Einstein Field Equations. The library is part of the DifferentialGeometry software project and is a collection of symbolic data and metadata describing solutions to the Einstein equations.

Degree And Neighborhood Conditions For Hamiltonicity Of Claw-Free Graphs, Zhi-Hong Chen

Scholarship and Professional Work - LAS

For a graph H , let σ t ( H ) = min { Σ i = 1 t d H ( v i ) | { v 1 , v 2 , … , v t } is an independent set in H } and let U t ( H ) = min { | ⋃ i = 1 t N H ( v i ) | | { v 1 , v 2 , ⋯ , v t } is an independent set in H } . We show that for a given number ϵ and given integers …

Optimal Layout For A Component Grid, Michael W. Ebert

Computer Science and Software Engineering

Several puzzle games include a specific type of optimization problem: given components that produce and consume different resources and a grid of squares, find the optimal way to place the components to maximize output. I developed a method to evaluate potential solutions quickly and automated the solving of the problem using a genetic algorithm.

A High Quality, Eulerian 3d Fluid Solver In C++, Lejon Anthony Mcgowan

Computer Science and Software Engineering

Fluids are a part of everyday life, yet are one of the hardest elements to properly render in computer graphics. Water is the most obvious entity when thinking of what a fluid simulation can achieve (and it is indeed the focus of this project), but many other aspects of nature, like fog, clouds, and particle effects. Real-time graphics like video games employ many heuristics to approximate these effects, but large-scale renderers aim to simulate these effects as closely as possible.

In this project, I wish to achieve effects of the latter nature. Using the Eulerian technique of discrete grids, I …

Interproximal Distance Analysis Of Stereolithographic Casts Made By Cad-Cam Technology: An In Vitro Study, Melanie Hoffman, Seok-Hwan Cho, Naveen K. Bansal

Mathematics, Statistics and Computer Science Faculty Research and Publications

Statement of problem

The accuracy of interproximal distances of the definitive casts made by computer-aided design and computer-aided manufacturing (CAD-CAM) technology is not yet known.

Purpose

The purpose of this in vitro study was to compare the interproximal distances of stereolithographic casts made by CAD-CAM technology with those of stone casts made by the conventional method.

Material and methods

Dentoform teeth were prepared for a single ceramic crown on the maxillary left central incisor, a 3-unit fixed dental prosthesis (FDP) on the second premolar for a metal-ceramic crown, and a maxillary right first molar for a metal crown. Twenty digital …

Dodrant-Homomorphic Encryption For Cloud Databases Using Table Lookup, Thomas Schwarz

Mathematics, Statistics and Computer Science Faculty Research and Publications

Users of large commercial databases increasingly want to outsource their database operations to a cloud service providers, but guaranteeing the privacy of data in an outsourced database has become the major obstacle to this move. Encrypting all data solves the privacy issue, but makes many operations on the data impossible in the cloud, unless the service provider has the capacity to decrypt data temporarily. Homomorphic encryption would solve this issue, but despite great and on-going progress, it is still far from being operationally feasible. In 2015, we presented what we now call dodrant-homomorphic encryption, a method that encrypts numeric values …

Distributed Evolution Of Spiking Neuron Models On Apache Mahout For Time Series Analysis, Andrew Palumbo

Annual Symposium on Biomathematics and Ecology Education and Research

No abstract provided.

Mean Square Consistency On Numerical Solutions Of Stochastic Wave Equation With Cubic Nonlinearities On 2d Rectangles, Haziem M. Hazaimeh

All Works

© The Authors, published by EDP Sciences, 2017. In this article we study the mean square consistency on numerical solutions of stochastic wave equations with cubic nonlinearities on two dimensional rectangles. In [8], we proved that the strong Fourier solution of these semi-linear wave equations exists and is unique on an appropriate Hilbert space. A linear-implicit Euler method is used to discretize the related Fourier coefficients. We prove that the linear-implicit Euler method applied to a solution of nonlinear stochastic wave equations in two dimensions is mean square consistency under the geometric condition.

Ideas And Graphs, Martin Zwick

Complex Systems Faculty Publications and Presentations

A graph can specify the skeletal structure of an idea, onto which meaning can be added by interpreting the structure.

This paper considers graphs (but not hypergraphs) consisting of four nodes, and suggests meanings that can be associated with several different directed and undirected graphs.

Drawing on Bennett's "systematics," specifically on the Tetrad that systematics offers as a model of 'activity,' the analysis here shows that the Tetrad is versatile model of problem-solving, regulation and control, and other processes.

Slides are available below.

The Double-Edged Sword: A Mixed Methods Study Of The Interplay Between Bipolar Disorder And Technology Use, Mark Matthews, Elizabeth Murnane, Jaime Snyder, Shion Guha, Pamara Chang, Gavin Doherty, Geri K. Gay

Mathematics, Statistics and Computer Science Faculty Research and Publications

Human behavior is increasingly reflected or acted out through technology. This is of particular salience when it comes to changes in behavior associated with serious mental illnesses including schizophrenia and bipolar disorder. Early detection is crucial for these conditions but presently very challenging to achieve. Potentially, characteristics of these conditions' traits and symptoms, at both idiosyncratic and collective levels, may be detectable through technology use patterns. In bipolar disorder specifically, initial evidence associates changes in mood with changes in technology-mediated communication patterns. However much less is known about how people with bipolar disorder use technology more generally in their lives, …

On Congruence Lattices Of Nilsemigroups, Alexander L. Popovich, Peter R. Jones

Mathematics, Statistics and Computer Science Faculty Research and Publications

We prove that the congruence lattice of a nilsemigroup is modular if and only if the width of the semigroup, as a poset, is at most two, and distributive if and only if its width is one. In the latter case, such semigroups therefore coincide with the nil Δ">Δ Δ -semigroups. It is further shown that if a finitely generated nilsemigroup has modular congruence lattice, then the semigroup is finite.

Neuronal Correlation Parameter In The Idea Of Thermodynamic Entropy Of An N-Body Gravitationally Bounded System, Ioannis Haranas, Ioannis Gkigkitzis, Ilias S. Kotsireas, Carlos Austerlitz

Physics and Computer Science Faculty Publications

Understanding how the brain encodes information and performs computation requires statistical and functional analysis. Given the complexity of the human brain, simple methods that facilitate the interpretation of statistical correlations among different brain regions can be very useful. In this report we introduce a numerical correlation measure that may serve the interpretation of correlational neuronal data, and may assist in the evaluation of different brain states. The description of the dynamical brain system, through a global numerical measure may indicate the presence of an action principle which may facilitate a application of physics principles in the study of the human …

Circumferences Of 3-Connected Claw-Free Graphs, Ii, Zhi-Hong Chen

Scholarship and Professional Work - LAS

For a graph H , the circumference of H , denoted by c ( H ) , is the length of a longest cycle in H . It is proved in Chen (2016) that if H is a 3-connected claw-free graph of order n with δ ≥ 8 , then c ( H ) ≥ min { 9 δ − 3 , n } . In Li (2006), Li conjectured that every 3-connected k -regular claw-free graph H of order n has c ( H ) ≥ min { 10 k − 4 , n } . Later, Li posed …

An Efficient Image Segmentation Algorithm Using Neutrosophic Graph Cut, Florentin Smarandache, Yanhui Guo, Yaman Akbulut, Abdulkadir Sengur, Rong Xia

Branch Mathematics and Statistics Faculty and Staff Publications

Segmentation is considered as an important step in image processing and computer vision applications, which divides an input image into various non-overlapping homogenous regions and helps to interpret the image more conveniently. This paper presents an efficient image segmentation algorithm using neutrosophic graph cut (NGC). An image is presented in neutrosophic set, and an indeterminacy filter is constructed using the indeterminacy value of the input image, which is defined by combining the spatial information and intensity information. The indeterminacy filter reduces the indeterminacy of the spatial and intensity information. A graph is defined on the image and the weight for …

Involute Analysis: Virtual Discourse, Memory Systems And Archive In The Involutes Of Thomas De Quincey, Kimberley A. Garcia

Dissertations, Theses, and Capstone Projects

Thomas De Quincey’s involutes inform metaphysical thought on memory and language, particularly concerning multiplicity and the virtual, repetition and difference. When co-opting the mathematic and mechanic involute in Suspiria de Profundis, De Quincey generates an interdisciplinary matrix for the semiotics underpinning his philosophy of language and theory of memory and experience. Involutes entangle and reproduce. De Quincey’s involute exposes the concrete and actual through which all experience accesses the abstract or virtual. The materiality of their informatics and technics provides a literary model and theoretical precursor to a combination of archive and systems theory. The textuality of involute system(s)—both …

Morphogenesis And Growth Driven By Selection Of Dynamical Properties, Yuri Cantor

Dissertations, Theses, and Capstone Projects

Organisms are understood to be complex adaptive systems that evolved to thrive in hostile environments. Though widely studied, the phenomena of organism development and growth, and their relationship to organism dynamics is not well understood. Indeed, the large number of components, their interconnectivity, and complex system interactions all obscure our ability to see, describe, and understand the functioning of biological organisms.

Here we take a synthetic and computational approach to the problem, abstracting the organism as a cellular automaton. Such systems are discrete digital models of real-world environments, making them more accessible and easier to study then their physical world …

Improving The Accuracy For The Long-Term Hydrologic Impact Assessment (L-Thia) Model, Anqi Zhang, Lawrence Theller, Bernard A. Engel

The Summer Undergraduate Research Fellowship (SURF) Symposium

Urbanization increases runoff by changing land use types from less impervious to impervious covers. Improving the accuracy of a runoff assessment model, the Long-Term Hydrologic Impact Assessment (L-THIA) Model, can help us to better evaluate the potential uses of Low Impact Development (LID) practices aimed at reducing runoff, as well as to identify appropriate runoff and water quality mitigation methods. Several versions of the model have been built over time, and inconsistencies have been introduced between the models. To improve the accuracy and consistency of the model, the equations and parameters (primarily curve numbers in the case of this model) …

Predicting Locations Of Pollution Sources Using Convolutional Neural Networks, Yiheng Chi, Nickolas D. Winovich, Guang Lin

The Summer Undergraduate Research Fellowship (SURF) Symposium

Pollution is a severe problem today, and the main challenge in water and air pollution controls and eliminations is detecting and locating pollution sources. This research project aims to predict the locations of pollution sources given diffusion information of pollution in the form of array or image data. These predictions are done using machine learning. The relations between time, location, and pollution concentration are first formulated as pollution diffusion equations, which are partial differential equations (PDEs), and then deep convolutional neural networks are built and trained to solve these PDEs. The convolutional neural networks consist of convolutional layers, reLU layers …

Efficient Parameter-Estimating Algorithms For Symmetry-Motivated Models: Econometrics And Beyond, Vladik Kreinovich, Anh H. Ly, Olga Kosheleva, Songsak Sriboonchitta

Departmental Technical Reports (CS)

It is known that symmetry ideas can explain the empirical success of many non-linear models. This explanation makes these models theoretically justified and thus, more reliable. However, the models remain non-linear and thus, identification or the model's parameters based on the observations remains a computationally expensive nonlinear optimization problem. In this paper, we show that symmetry ideas can not only help to select and justify a nonlinear model, they can also help us design computationally efficient almost-linear algorithms for identifying the model's parameters.

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log₂(α)³ + 16.5log₂(α)² + …

Vertex Weighted Spectral Clustering, Mohammad Masum

Electronic Theses and Dissertations

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to …

Implant Treatment In The Predoctoral Clinic: A Retrospective Database Study Of 1091 Patients, Soni Prasad, Christopher Hambrook, Eric Reigle, Katherine Sherman, Naveen K. Bansal, Arthur F. Hefti

Mathematics, Statistics and Computer Science Faculty Research and Publications

Purpose: This retrospective study was conducted at the Marquette University School of Dentistry to (1) characterize the implant patient population in a predoctoral clinic, (2) describe the implants inserted, and (3) provide information on implant failures.

Materials and Methods: The study cohort included 1091 patients who received 1918 dental implants between 2004 and 2012, and had their implants restored by a crown or a fixed dental prosthesis. Data were collected from patient records, entered in a database, and summarized in tables and figures. Contingency tables were prepared and analyzed by a chi-squared test. The cumulative survival probability of implants was …

An Analysis Of The Application Of Simplified Silhouette To The Evaluation Of K-Means Clustering Validity, Fei Wang, Hector-Hugo Franco-Penya, John D. Kelleher, John Pugh, Robert J. Ross

Conference papers

Silhouette is one of the most popular and effective internal measures for the evaluation of clustering validity. Simplified Silhouette is a computationally simplified version of Silhouette. However, to date Simplified Silhouette has not been systematically analysed in a specific clustering algorithm. This paper analyses the application of Simplified Silhouette to the evaluation of k-means clustering validity and compares it with the k-means Cost Function and the original Silhouette from both theoretical and empirical perspectives. The theoretical analysis shows that Simplified Silhouette has a mathematical relationship with both the k-means Cost Function and the original Silhouette, while empirically, we show that …

Merging Peg Solitaire In Graphs, John Engbers, Ryan Weber

Mathematics, Statistics and Computer Science Faculty Research and Publications

Peg solitaire has recently been generalized to graphs. Here, pegs start on all but one of the vertices in a graph. A move takes pegs on adjacent vertices x and y, with y also adjacent to a hole on vertex z, and jumps the peg on x over the peg ony to z, removing the peg on y. The goal of the game is to reduce the number of pegs to one.

We introduce the game merging peg solitaire on graphs, where a move takes pegs on vertices x and z (with a hole on y) and merges them to …

A Perspective On The Challenges And Issues In Developing Biomarkers For Human Allergic Risk Assessments, Ying Mu, Dianne E. Godar, Stephen Merrill

Mathematics, Statistics and Computer Science Faculty Research and Publications

No abstract provided.

Conflict-Free Vertex Coloring Of Planar Graphs, Shawn Seymour

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

The conflict-free coloring problem is a variation of the vertex coloring problem, a classical NP-hard optimization problem. The conflict-free coloring problem aims to color a possibly proper subset of vertices such that there is a unique color within the closed neighborhood (a vertex and its neighbors) of every vertex. This paper presents recent findings and heuristics to solve the conflict-free coloring problem on both general graphs and planar graphs.

How To Use Absolute-Error-Minimizing Software To Minimize Relative Error: Practitioner's Guide, Afshin Gholamy, Vladik Kreinovich

Departmental Technical Reports (CS)

In many engineering and scientific problems, there is a need to find the parameters of a dependence from the experimental data. There exist several software packages that find the values for these parameters -- values for which the mean square value of the absolute approximation error is the smallest. In practice, however, we are often interested in minimizing the mean square value of the relative approximation error. In this paper, we show how we can use the absolute-error-minimizing software to minimize the relative error.

Practical Need For Algebraic (Equality-Type) Solutions Of Interval Equations And For Extended-Zero Solutions, Ludmila Dymova, Pavel Sevastjanov, Andrzej Pownuk, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main problems in interval computations is solving systems of equations under interval uncertainty. Usually, interval computation packages consider united, tolerance, and control solutions. In this paper, we explain the practical need for algebraic (equality-type) solutions, when we look for solutions for which both sides are equal. In situations when such a solution is not possible, we provide a justification for extended-zero solutions, in which we ignore intervals of the type [−a, a].

Granular Approach To Data Processing Under Probabilistic Uncertainty, Andrzej Pownuk, Vladik Kreinovich

Departmental Technical Reports (CS)

In many real-life situations, uncertainty can be naturally described as a combination of several components, components which are described by probabilistic, fuzzy, interval, etc. granules. In such situations, to process this uncertainty, it is often beneficial to take this granularity into account by processing these granules separately and then combining the results.

In this paper, we show that granular computing can help even in situations when there is no such natural decomposition into granules: namely, we can often speed up processing of uncertainty if we first (artificially) decompose the original uncertainty into appropriate granules.