Theory and Algorithms Commons^™

Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector

LSU Doctoral Dissertations

In recent years, the study of autonomous entities such as unmanned vehicles has begun to revolutionize both military and civilian devices. One important research focus of autonomous entities has been coordination problems for autonomous robot swarms. Traditionally, robot models are used for algorithms that account for the minimum specifications needed to operate the swarm. However, these theoretical models also gloss over important practical details. Some of these details, such as time, have been considered before (as epochs of execution). In this dissertation, we examine these details in the context of several problems and introduce new performance measures to capture practical …

Ubjective Information And Survival In A Simulated Biological System, Tyler S. Barker, Massimiliano Pierobon, Peter J. Thomas

School of Computing: Faculty Publications

Information transmission and storage have gained traction as unifying concepts to characterize biological systems and their chances of survival and evolution at multiple scales. Despite the potential for an information-based mathematical framework to offer new insights into life processes and ways to interact with and control them, the main legacy is that of Shannon’s, where a purely syntactic characterization of information scores systems on the basis of their maximum information efficiency. The latter metrics seem not entirely suitable for biological systems, where transmission and storage of different pieces of information (carrying different semantics) can result in different chances of survival. …

Engr 692 Section 66: Randomized Algorithms, Yixin Chen

GMAS Course Syllabi

No abstract provided.

A Super Fast Algorithm For Estimating Sample Entropy, Weifeng Liu, Ying Jiang, Yuesheng Xu

Mathematics & Statistics Faculty Publications

: Sample entropy, an approximation of the Kolmogorov entropy, was proposed to characterize complexity of a time series, which is essentially defined as − log(B/A), where B denotes the number of matched template pairs with length m and A denotes the number of matched template pairs with m + 1, for a predetermined positive integer m. It has been widely used to analyze physiological signals. As computing sample entropy is time consuming, the box-assisted, bucket-assisted, x-sort, assisted sliding box, and kd-tree-based algorithms were proposed to accelerate its computation. These algorithms require O(N²) or …

Understanding The Mechanism Of Deep Learning Frameworks In Lesion Detection For Pathological Images With Breast Cancer, Wei-Wen Hsu, Chung-Hao Chen, Chang Hao, Yu-Ling Hou, Xiang Gao, Yun Shao, Xueli Zhang, Jingjing Wang, Tao He, Yanhong Tai

Electrical & Computer Engineering Faculty Publications

With the advances of scanning sensors and deep learning algorithms, computational pathology has drawn much attention in recent years and started to play an important role in the clinical workflow. Computer-aided detection (CADe) systems have been developed to assist pathologists in slide assessment, increasing diagnosis efficiency and reducing misdetections. In this study, we conducted four experiments to demonstrate that the features learned by deep learning models are interpretable from a pathological perspective. In addition, classifiers such as the support vector machine (SVM) and random forests (RF) were used in experiments to replace the fully connected layers and decompose the end-to-end …

Algorithm Selection For The Team Orienteering Problem, Mustafa Misir, Aldy Gunawan, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

This work utilizes Algorithm Selection for solving the Team Orienteering Problem (TOP). The TOP is an NP-hard combinatorial optimization problem in the routing domain. This problem has been modelled with various extensions to address different real-world problems like tourist trip planning. The complexity of the problem motivated to devise new algorithms. However, none of the existing algorithms came with the best performance across all the widely used benchmark instances. This fact suggests that there is a performance gap to fill. This gap can be targeted by developing more new algorithms as attempted by many researchers before. An alternative strategy is …

Assessing Photogrammetry Artificial Intelligence In Monumental Buildings’ Crack Digital Detection, Said Maroun, Mostafa Khalifa, Nabil Mohareb

Architecture and Planning Journal (APJ)

Natural and human-made disasters have significant impacts on monumental buildings, threatening them from being deteriorated. If no rapid consolidations took into consideration traumatic accidents would endanger the existence of precious sites. In this context, Beirut's enormous 4th of August 2020 explosion damaged an estimated 640 historical monuments, many volunteers assess damages for more than a year to prevent the more crucial risk of demolitions. This research aims to assist the collaboration ability among photogrammetry science, Artificial Intelligence Model (AIM) and Architectural Coding to optimize the process for better coverage and scientific approach of data specific to the crack disorders to …

The Global Rise Of Online Devices, Cyber Crime And Cyber Defense: Enhancing Ethical Actions, Counter Measures, Cyber Strategy, And Approaches, Naresh Kshetri

Dissertations

The rise of online devices, online users, online shopping, online gaming, and online teaching has ultimately given rise to online attacks and online crimes. As cases of COVID-19 seem to increase day by day, so do online crimes and attacks (as many sectors and organizations went 100% online). Technological advancements and cyber warfare already generated many ethical issues, as internet users increasingly need ethical cyber defense strategies.

Individual internet users have challenges on their end; and on the other end, nation states (some secretly, some openly), are investing in robot weapons and autonomous weapons systems (AWS). New technologies have combined …

Using Temporal Session Types To Analyze Time Complexities Of Concurrent Programs, Joseph M. Walbran

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

Das et al. develop a method for analyzing the time complexity of concurrent, message-passing algorithms. Their method is based on adding timing information to datatypes. Specifically, they use a family of datatypes called session types; these constrain the structure of interactions that may take place over a channel of communication. In Das’s system, the timing properties of an algorithm can be verified by a typechecker: if the timing information in the session types is mismatched, the computer will report a type error. In their paper, Das et al. develop the theory for such a typechecker, but do not provide an …

The Impact Of Dynamic Difficulty Adjustment On Player Experience In Video Games, Chineng Vang

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

Dynamic Difficulty Adjustment (DDA) is a process by which a video game adjusts its level of challenge to match a player’s skill level. Its popularity in the video game industry continues to grow as it has the ability to keep players continuously engaged in a game, a concept referred to as Flow. However, the influence of DDA on games has received mixed responses, specifically that it can enhance player experience as well as hinder it. This paper explores DDA through the Monte Carlo Tree Search algorithm and Reinforcement Learning, gathering feedback from players seeking to understand what about DDA is …

Scheduling Aircraft Departures To Avoid Enroute Congestion, Johannes Martinez

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

When scheduled flights are forecast to overcrowd sections of enroute airspace, an air traffic control authority may need to delay departures. Mixed integer linear programming can be used to compute a schedule that resolves the congestion while bringing the sum of all delays to a minimum. Standard linear programming constraint formulations for such scheduling problems, however, have poor run times for instances of realistic size. A new constraint formulation based on cycles and paths through a route graph reduces run times in computational experiments. It shows particularly strong performance for schedules that approach the worst-case solution times in standard formulations.

Fighting Gerrymandering By Automating Congressional Redistricting, Jacob Jenness

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

Gerrymandering is a political problem that the United States has had for more than 200 years. Politicians have taken the dull and routine process of drawing congressional districts and turned it into a highly-partisan process. However, with recent improvements in redistricting algorithms, researchers Harry Levin and Sorelle Friedler have introduced their recursive Divide and Conquer Redistricting Algorithm. This algorithm has the potential to automate the process of congressional redistricting, thereby removing the potential for bias. By utilizing a set of partitioning and swapping algorithms, the Divide and Conquer Redistricting Algorithm achieves desirable goals, such as low population deviation, and high …

Reducing Loading On The Contralateral Limb Using Human-In-The-Loop Optimization, Siena Senatore

UNO Student Research and Creative Activity Fair

In most everyday activities, we head towards a specific goal by updating our choices for a more direct path. However, there are specific clinical tasks where taking the direct path is more challenging. Clinical investigations of optimizing a prosthesis involve the assessment of multiple parameter settings through trial and error rather than goal-directed optimization. We investigate if a human-in-the-loop optimization algorithm can guide manual alterations to a prosthesis-simulating device to reduce the ground reaction force on the contralateral limb. In most participants, the optimal condition reduced the loading rate on the contralateral limb compared to the initial condition tested. These …

Hybrid Tabu Search Algorithm For Unrelated Parallel Machine Scheduling In Semiconductor Fabs With Setup Times, Job Release, And Expired Times, Changyu Chen, Madhi Fathi, Marzieh Khakifirooz, Kan Wu

Research Collection School Of Computing and Information Systems

This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach …

Autonomous And Resilient Management Of All-Source Sensors For Navigation Integrity: A Comparison And Analysis, Niles A. Tate

Theses and Dissertations

When navigating using Global Navigation Satellite Systems (GNSS), multiple/redundant, synchronous pseudorange measurements are readily available. However, when navigating in a GNSS degraded and/or denied region, this is not guaranteed. In response to this challenge, the ANT Center developed a framework known as Autonomous and Resilient Management of All-source Sensors (ARMAS). The ARMAS framework is designed to be resilient towards data corruption caused from mismodeled, uncalibrated, and faulty sensors. This thesis further expands on this work by performing a comparison against a Residual-Based Receiver Autonomous Integrity Monitoring (RBRAIM) scheme using simulated and real flight data to evaluate each systems performance.

The Effect Of Using The Gamification Strategy On Academic Achievement And Motivation Towards Learning Problem-Solving Skills In Computer And Information Technology Course Among Tenth Grade Female Students, Mazyunah Almutairi, Prof. Ahmad Almassaad

International Journal for Research in Education

Abstract

This study aimed to identify the effect of using the gamification strategy on academic achievement and motivation towards learning problem-solving skills in computer and information technology course. A quasi-experimental method was adopted. The study population included tenth-grade female students in Al-Badi’ah schools in Riyadh. The sample consisted of 54 students divided into two equal groups: control group and experimental group. The study tools comprised an achievement test and the motivation scale. The results showed that there were statistically significant differences between the two groups in the academic achievement test in favor of the experimental group, with a large effect …

Numerical Treatment For Special Type Of Mixed Linear Delay Volterra Integro-Differential Equations, Atheer J. Kadhim

Emirates Journal for Engineering Research

The idea of research is a representation of the nonlinear pseudo-random generators using state-space equations that is not based on the usual description as shift register synthesis but in terms of matrices. Different types of nonlinear pseudo-random generators with their algorithms have been applied in order to investigate the output pseudo-random sequences. Moreover, two examples are given for conciliated the results of this representation.

Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel

CSB and SJU Distinguished Thesis

Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants known as RLWE and PLWE have been shown to be more efficient, but the increased structure can leave them vulnerable to attacks for certain instantiations. This work aims to identify specific cases where proposed cryptographic schemes based on PLWE work particularly poorly under a specific attack.

The Nature Of Numbers: Real Computing, Bradley J. Lucier

Journal of Humanistic Mathematics

While studying the computable real numbers as a professional mathematician, I came to see the computable reals, and not the real numbers as usually presented in undergraduate real analysis classes, as the natural culmination of my evolving understanding of numbers as a schoolchild. This paper attempts to trace and explain that evolution. The first part recounts the nature of numbers as they were presented to us grade-school children. In particular, the introduction of square roots induced a step change in my understanding of numbers. Another incident gave me insight into the brilliance of Alan Turing in his paper introducing both …

Robust Error Estimation Based On Factor-Graph Models For Non-Line-Of-Sight Localization, O. Arda Vanli, Clark N. Taylor

Faculty Publications

This paper presents a method to estimate the covariances of the inputs in a factor-graph formulation for localization under non-line-of-sight conditions. A general solution based on covariance estimation and M-estimators in linear regression problems, is presented that is shown to give unbiased estimators of multiple variances and are robust against outliers. An iteratively re-weighted least squares algorithm is proposed to jointly compute the proposed variance estimators and the state estimates for the nonlinear factor graph optimization. The efficacy of the method is illustrated in a simulation study using a robot localization problem under various process and measurement models and measurement …