Physical Sciences and Mathematics Commons^™

Classification Of Major Solar Flares From Extremely Imbalanced Multivariate Time Series Data Using Minimally Random Convolutional Kernel Transform, Kartik Saini, Khaznah Alshammari, Shah Muhammad Hamdi, Soukaina Filali Boubrahimi

Computer Science Faculty and Staff Publications

Solar flares are characterized by sudden bursts of electromagnetic radiation from the Sun’s surface, and are caused by the changes in magnetic field states in active solar regions. Earth and its surrounding space environment can suffer from various negative impacts caused by solar flares, ranging from electronic communication disruption to radiation exposure-based health risks to astronauts. In this paper, we address the solar flare prediction problem from magnetic field parameter-based multivariate time series (MVTS) data using multiple state-of-the-art machine learning classifiers that include MINImally RandOm Convolutional KErnel Transform (MiniRocket), Support Vector Machine (SVM), Canonical Interval Forest (CIF), Multiple Representations Sequence …

Combining Empirical And Physics-Based Models For Solar Wind Prediction, Rob Johnson, Soukaina Filali Boubrahimi, Omar Bahri, Shah Muhammad Hamdi

Computer Science Faculty and Staff Publications

Solar wind modeling is classified into two main types: empirical models and physics-based models, each designed to forecast solar wind properties in various regions of the heliosphere. Empirical models, which are cost-effective, have demonstrated significant accuracy in predicting solar wind at the L1 Lagrange point. On the other hand, physics-based models rely on magnetohydrodynamics (MHD) principles and demand more computational resources. In this research paper, we build upon our recent novel approach that merges empirical and physics-based models. Our recent proposal involves the creation of a new physics-informed neural network that leverages time series data from solar wind predictors to …

On The Computability Of Primitive Recursive Functions By Feedforward Artificial Neural Networks, Vladimir A. Kulyukin

Computer Science Faculty and Staff Publications

We show that, for a primitive recursive function h(x, t), where x is a n-tuple of natural numbers and t is a natural number, there exists a feedforward artificial neural network 𝔑(x, t), such that for any n-tuple of natural numbers z and a positive natural number m, the first m + 1 terms of the sequence {h(z, t)} are the same as the terms of the tuple (𝔑(z, 0), ... ,𝔑(z, m)).

Contemporary Art Authentication With Large-Scale Classification, Todd Dobbs, Abdullah-Al-Raihan Nayeem, Isaac Cho, Zbigniew Ras

Computer Science Faculty and Staff Publications

Art authentication is the process of identifying the artist who created a piece of artwork and is manifested through events of provenance, such as art gallery exhibitions and financial transactions. Art authentication has visual influence via the uniqueness of the artist’s style in contrast to the style of another artist. The significance of this contrast is proportional to the number of artists involved and the degree of uniqueness of an artist’s collection. This visual uniqueness of style can be captured in a mathematical model produced by a machine learning (ML) algorithm on painting images. Art authentication is not always possible …

A Novel Fuzzy Relative-Position-Coding Transformer For Breast Cancer Diagnosis Using Ultrasonography, Yanhui Guo, Ruquan Jiang, Xin Gu, Heng-Da Cheng, Harish Garg

Computer Science Faculty and Staff Publications

Breast cancer is a leading cause of death in women worldwide, and early detection is crucial for successful treatment. Computer-aided diagnosis (CAD) systems have been developed to assist doctors in identifying breast cancer on ultrasound images. In this paper, we propose a novel fuzzy relative-position-coding (FRPC) Transformer to classify breast ultrasound (BUS) images for breast cancer diagnosis. The proposed FRPC Transformer utilizes the self-attention mechanism of Transformer networks combined with fuzzy relative-position-coding to capture global and local features of the BUS images. The performance of the proposed method is evaluated on one benchmark dataset and compared with those obtained by …

Accuracy Vs. Energy: An Assessment Of Bee Object Inference In Videos From On-Hive Video Loggers With Yolov3, Yolov4-Tiny, And Yolov7-Tiny, Vladimir A. Kulyukin, Aleksey V. Kulyukin

Computer Science Faculty and Staff Publications

A continuing trend in precision apiculture is to use computer vision methods to quantify characteristics of bee traffic in managed colonies at the hive's entrance. Since traffic at the hive's entrance is a contributing factor to the hive's productivity and health, we assessed the potential of three open-source convolutional network models, YOLOv3, YOLOv4-tiny, and YOLOv7-tiny, to quantify omnidirectional traffic in videos from on-hive video loggers on regular, unmodified one- and two-super Langstroth hives and compared their accuracies, energy efficacies, and operational energy footprints. We trained and tested the models with a 70/30 split on a dataset of 23,173 flying bees …

On Correspondences Between Feedforward Artificial Neural Networks On Finite Memory Automata And Classes Of Primitive Recursive Functions, Vladimir A. Kulyukin

Computer Science Faculty and Staff Publications

When realized on computational devices with finite quantities of memory, feedforward artificial neural networks and the functions they compute cease being abstract mathematical objects and turn into executable programs generating concrete computations. To differentiate between feedforward artificial neural networks and their functions as abstract mathematical objects and the realizations of these networks and functions on finite memory devices, we introduce the categories of general and actual computabilities and show that there exist correspondences, i.e., bijections, between functions computable by trained feedforward artificial neural networks on finite memory automata and classes of primitive recursive functions.

Ambient Electromagnetic Radiation As A Predictor Of Honey Bee (Apis Mellifera) Traffic In Linear And Non-Linear Regression: Numerical Stability, Physical Time And Energy Efficiency, Vladimir Kulyukin, Daniel Coster, Anastasiia Tkachenko, Daniel Hornberger, Aleksey V. Kulyukin

Computer Science Faculty and Staff Publications

Since bee traffic is a contributing factor to hive health and electromagnetic radiation has a growing presence in the urban milieu, we investigate ambient electromagnetic radiation as a predictor of bee traffic in the hive’s vicinity in an urban environment. To that end, we built two multi-sensor stations and deployed them for four and a half months at a private apiary in Logan, Utah, U.S.A. to record ambient weather and electromagnetic radiation. We placed two non-invasive video loggers on two hives at the apiary to extract omnidirectional bee motion counts from videos. The time-aligned datasets were used to evaluate 200 …

A Practical Model Of Student Engagement While Programming, John M. Edwards, Kaden Hart, Christopher M. Warren

Computer Science Faculty and Staff Publications

We consider the question of how to predict whether a student is on or off task while working on a computer programming assignment using elapsed time since the last keystroke as the single independent variable. In this paper we report results of an empirical study in which we intermittently prompted CS1 students working on a programming assignment to self-report whether they were engaged in the assignment at that moment. Our regression model derived from the results of the study shows power-law decay in the engagement rate of students with increasing time of keyboard inactivity ranging from a nearly 80% engagement …

A Look Into User Privacy And Third-Party Applications In Facebook, Sovantharith Seng, Mahdi Nasrullah Al-Ameen, Matthew Wright

Computer Science Faculty and Staff Publications

Purpose

A huge amount of personal and sensitive data are shared on Facebook, which makes it a prime target for attackers. Adversaries can exploit third-party applications connected to a user’s Facebook profiles (i.e. Facebook apps) to gain access to this personal information. Users’ lack of knowledge and the varying privacy policies of these apps make them further vulnerable to information leakage. However, little has been done to identify mismatches between users’ perceptions and the privacy policies of Facebook apps. This paper aims to address this challenge in the work.

Design/methodology/approach

The authors conducted a lab study with 31 participants, where …

A First Look Into Users’ Perceptions Of Facial Recognition In The Physical World, Sovantharith Seng, Mahdi Nasrullah Al-Ameen, Matthew Wright

Computer Science Faculty and Staff Publications

Facial recognition (FR) technology is being adopted in both private and public spheres for a wide range of reasons, from ensuring physical safety to providing personalized shopping experiences. It is not clear yet, though, how users perceive this emerging technology in terms of usefulness, risks, and comfort. We begin to address these questions in this paper. In particular, we conducted a vignette-based study with 314 participants on Amazon Mechanical Turk to investigate their perceptions of facial recognition in the physical world, based on thirty-five scenarios across eight different contexts of FR use. We found that users do not have a …

An Optimal Deterministic Algorithm For Geodesic Farthest-Point Voronoi Diagrams In Simple Polygons, Haitao Wang

Computer Science Faculty and Staff Publications

Given a set S of m point sites in a simple polygon P of n vertices, we consider the problem of computing the geodesic farthest-point Voronoi diagram for S in P. It is known that the problem has an Ω(n + m log m) time lower bound. Previously, a randomized algorithm was proposed [Barba, SoCG 2019] that can solve the problem in O(n + m log m) expected time. The previous best deterministic algorithms solve the problem in O(n log log n + m log m) time [Oh, Barba, and Ahn, …

On Improving The Memorability Of System-Assigned Recognition-Based Passwords, Mahdi Nasrullah Al-Ameen, Sonali T. Marne, Kanis Fatema, Matthew Wright, Shannon Scielzo

Computer Science Faculty and Staff Publications

User-chosen passwords reflecting common strategies and patterns ease memorization but offer uncertain and often weak security, while system-assigned passwords provide higher security guarantee but suffer from poor memorability. We thus examine the technique to enhance password memorability that incorporates a scientific understanding of long-term memory. In particular, we examine the efficacy of providing users with verbal cues—real-life facts corresponding to system-assigned keywords. We also explore the usability gain of including images related to the keywords along with verbal cues. In our multi-session lab study with 52 participants, textual recognition-based scheme offering verbal cues had a significantly higher login success …

Machine Learning-Based Signal Degradation Models For Attenuated Underwater Optical Communication Oam Beams, Patrick L. Neary, Abbie T. Watnik, K. Peter Judd, James R. Lindle, Nicholas S. Flann

Computer Science Faculty and Staff Publications

Signal attenuation in underwater communications is a problem that degrades classification performance. Several novel CNN-based (SMART) models are developed to capture the physics of the attenuation process. One model is built and trained using automatic differentiation and another uses the radon cumulative distribution transform. These models are inserted in the classifier training pipeline. It is shown that including these attenuation models in classifier training significantly improves classification performance when the trained model is tested with environmentally attenuated images. The improved classification accuracy will be important in future OAM underwater optical communication applications.

A Robust Structured Tracker Using Local Deep Features, Mohammadreza Javanmardi, Amir Hossein Farzaneh, Xiaojun Qi

Computer Science Faculty and Staff Publications

Deep features extracted from convolutional neural networks have been recently utilized in visual tracking to obtain a generic and semantic representation of target candidates. In this paper, we propose a robust structured tracker using local deep features (STLDF). This tracker exploits the deep features of local patches inside target candidates and sparsely represents them by a set of templates in the particle filter framework. The proposed STLDF utilizes a new optimization model, which employs a group-sparsity regularization term to adopt local and spatial information of the target candidates and attain the spatial layout structure among them. To solve the optimization …

Application Of Digital Particle Image Velocimetry To Insect Motion: Measurement Of Incoming, Outgoing, And Lateral Honeybee Traffic, Sarbajit Mukherjee, Vladimir Kulyukin

Computer Science Faculty and Staff Publications

The well-being of a honeybee (Apis mellifera) colony depends on forager traffic. Consistent discrepancies in forager traffic indicate that the hive may not be healthy and require human intervention. Honeybee traffic in the vicinity of a hive can be divided into three types: incoming, outgoing, and lateral. These types constitute directional traffic, and are juxtaposed with omnidirectional traffic where bee motions are considered regardless of direction. Accurate measurement of directional honeybee traffic is fundamental to electronic beehive monitoring systems that continuously monitor honeybee colonies to detect deviations from the norm. An algorithm based on digital particle image velocimetry is proposed …

Data-Driven Multiscale Modeling Reveals The Role Of Metabolic Coupling For The Spatio-Temporal Growth Dynamics Of Yeast Colonies, Jukka Intosalmi, Adrian C. Scott, Michelle Hays, Nicholas Flann, Olli Yli-Harja, Harri Lähdesmäki, Aimée M. Dudley, Alexander Skupin

Computer Science Faculty and Staff Publications

Background: Multicellular entities like mammalian tissues or microbial biofilms typically exhibit complex spatial arrangements that are adapted to their specific functions or environments. These structures result from intercellular signaling as well as from the interaction with the environment that allow cells of the same genotype to differentiate into well-organized communities of diversified cells. Despite its importance, our understanding how this cell–cell and metabolic coupling lead to functionally optimized structures is still limited.

Results: Here, we present a data-driven spatial framework to computationally investigate the development of yeast colonies as such a multicellular structure in dependence on metabolic capacity. For this …

On Video Analysis Of Omnidirectional Bee Traffic: Counting Bee Motions With Motion Detection And Image Classification, Vladmir Kulyukin, Sarbajit Mukherjee

Computer Science Faculty and Staff Publications

Omnidirectional bee traffic is the number of bees moving in arbitrary directions in close proximity to the landing pad of a given hive over a given period of time. Video bee traffic analysis has the potential to automate the assessment of omnidirectional bee traffic levels, which, in turn, may lead to a complete or partial automation of honeybee colony health assessment. In this investigation, we proposed, implemented, and partially evaluated a two-tier method for counting bee motions to estimate levels of omnidirectional bee traffic in bee traffic videos. Our method couples motion detection with image classification so that motion detection …

Enabling Multi-Hop Remote Method Invocation In Device-To-Device Networks, Minh Le, Stephen Clyde, Young‑Woo Kwon

Computer Science Faculty and Staff Publications

To avoid shrinking down the performance and preserve energy, low-end mobile devices can collaborate with the nearby ones by offloading computation intensive code. However, despite the long research history, code offloading is dilatory and unfit for applications that require rapidly consecutive requests per short period. Even though Remote Procedure Call (RPC) is apparently one possible approach that can address this problem, the RPC-based or message queue-based techniques are obsolete or unwieldy for mobile platforms. Moreover, the need of accessibility beyond the limit reach of the device-to-device (D2D) networks originates another problem. This article introduces a new software framework to overcome …

Toward Audio Beehive Monitoring: Deep Learning Vs. Standard Machine Learning In Classifying Beehive Audio Samples, Vladmir Kulyukin, Sarbajit Mukherjee, Prakhar Amlathe

Computer Science Faculty and Staff Publications

Electronic beehive monitoring extracts critical information on colony behavior and phenology without invasive beehive inspections and transportation costs. As an integral component of electronic beehive monitoring, audio beehive monitoring has the potential to automate the identification of various stressors for honeybee colonies from beehive audio samples. In this investigation, we designed several convolutional neural networks and compared their performance with four standard machine learning methods (logistic regression, k-nearest neighbors, support vector machines, and random forests) in classifying audio samples from microphones deployed above landing pads of Langstroth beehives. On a dataset of 10,260 audio samples where the training and testing …

Modeling De Novo Granulation Of Anaerobic Sludge, Anna Doloman, Honey Varghese, Charles D. Miller, Nicholas Flann

Computer Science Faculty and Staff Publications

Background: A unique combination of mechanical, physiochemical and biological forces influences granulation during processes of anaerobic digestion. Understanding this process requires a systems biology approach due to the need to consider not just single-cell metabolic processes, but also the multicellular organization and development of the granule.

Results: In this computational experiment, we address the role that physiochemical and biological processes play in granulation and provide a literature-validated working model of anaerobic granule de novo formation. The agent-based model developed in a cDynoMiCs simulation environment successfully demonstrated a de novo granulation in a glucose fed system, with the average specific methanogenic …

Separating Overlapped Intervals On A Line, Shimin Li, Haitao Wang

Computer Science Faculty and Staff Publications

Given n intervals on a line ℓ, we consider the problem of moving these intervals on ℓ such that no two intervals overlap and the maximum moving distance of the intervals is minimized. The difficulty for solving the problem lies in determining the order of the intervals in an optimal solution. By interesting observations, we show that it is sufficient to consider at most n "candidate" lists of ordered intervals. Further, although explicitly maintaining these lists takes Ω(n²) time and space, by more observations and a pruning technique, we present an algorithm that can compute an optimal …

Computer Vision–Based Orthorectification And Georeferencing Of Aerial Image Sets, Mohammadreza Faraji, Xiaojun Qi, Austin Jensen

Computer Science Faculty and Staff Publications

Generating a georeferenced mosaic map from unmanned aerial vehicle (UAV)imagery is a challenging task. Direct and indirect georeferencing methods may fail to generate an accurate mosaic map due to the erroneous exterior orientation parameters stored in the inertial measurement unit (IMU), erroneous global positioning system (GPS) data, and difficulty inlocating ground control points (GCPs) or having a sufficient number of GCPs. This paperpresents a practical framework to orthorectify and georeference aerial images using the robustfeatures-based matching method. The proposed georeferencing process is fully automatic and does not require any GCPs. It is also a near real-time process which can be …

On The Geodesic Centers Of Polygonal Domains, Haitao Wang

Computer Science Faculty and Staff Publications

In this paper, we study the problem of computing Euclidean geodesic centers of a polygonal domain P of n vertices. We give a necessary condition for a point being a geodesic center. We show that there is at most one geodesic center among all points of P that have topologically-equivalent shortest path maps. This implies that the total number of geodesic centers is bounded by the size of the shortest path map equivalence decomposition of P, which is known to be O(n^{10}). One key observation is a pi-range property on shortest path lengths when points are moving. With these observations, …

Ε-Kernel Coresets For Stochastic Points, Haitao Wang, Lingxiao Huang, Jian Li, Jeff Mark Phillips

Computer Science Faculty and Staff Publications

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over such data. In this paper, we initiate the study of constructing epsilon-kernel coresets for uncertain points. We consider uncertainty in the existential model where each point's location is fixed but only occurs with a certain probability, and the locational model where each point has a probability distribution describing its location. An epsilon-kernel coreset approximates the width of a point set in any direction. We consider approximating the …

Unsupervised Saliency Estimation Based On Robust Hypotheses, Fei Xu, Min Xian, H. D. Cheng, Jianrui Ding, Yingtao Zhang

Computer Science Faculty and Staff Publications

Visual saliency estimation based on optimization models is gaining increasing popularity recently. In this paper, we formulate saliency estimation as a quadratic program (QP) problem based on robust hypotheses. First, we propose an adaptive center-based bias hypothesis to replace the most common image center-based center-bias. It calculates the weighted center by utilizing local contrast which is much more robust when the objects are far away from the image center. Second, we model smoothness term on saliency statistics of each color. It forces the pixels with similar colors to have similar saliency statistics. The proposed smoothness term is more robust than …