Theory and Algorithms Commons^™

An Underground Radio Wave Propagation Prediction Model For Digital Agriculture, Abdul Salam

Faculty Publications

Underground sensing and propagation of Signals in the Soil (SitS) medium is an electromagnetic issue. The path loss prediction with higher accuracy is an open research subject in digital agriculture monitoring applications for sensing and communications. The statistical data are predominantly derived from site-specific empirical measurements, which is considered an impediment to universal application. Nevertheless, in the existing literature, statistical approaches have been applied to the SitS channel modeling, where impulse response analysis and the Friis open space transmission formula are employed as the channel modeling tool in different soil types under varying soil moisture conditions at diverse communication distances …

Orca Travel Grant Recipient An Interview With Emily Hoard, Emily Hoard

Steeplechase: An ORCA Student Journal

No abstract provided.

3d Procedural Maze & Cave Generation, Jacob Sharp

Student Scholar Showcase

The goal of this project is to generate a maze or cave procedurally so that a player may be able to explore infinitely without a reoccurring pattern. The project also utilizes Virtual Reality (VR); the user will be able to put on a VR Headset and become more immersed in a procedural environment. One of the challenges that needed to be overcome was simple random number generators did not generate natural looking worlds. Introducing VR to the project created the additional challenge of preventing the user from becoming motion sick. These challenges were both addressed through many hours of research …

Improved Evolutionary Support Vector Machine Classifier For Coronary Artery Heart Disease Prediction Among Diabetic Patients, Narasimhan B, Malathi A Dr

Library Philosophy and Practice (e-journal)

Soft computing paves way many applications including medical informatics. Decision support system has gained a major attention that will aid medical practitioners to diagnose diseases. Diabetes mellitus is hereditary disease that might result in major heart disease. This research work aims to propose a soft computing mechanism named Improved Evolutionary Support Vector Machine classifier for CAHD risk prediction among diabetes patients. The attribute selection mechanism is attempted to build with the classifier in order to reduce the misclassification error rate of the conventional support vector machine classifier. Radial basis kernel function is employed in IESVM. IESVM classifier is evaluated through …

Dynamic Lazy Grounding In Answer Set Programming, Brian Hodges

Computer Science Graduate Research Workshop

No abstract provided.

Automatic Program Rewriting For Non-Ground Answer Set Programs, Nicholas Hippen

Computer Science Graduate Research Workshop

No abstract provided.

Cyber Security- A New Secured Password Generation Algorithm With Graphical Authentication And Alphanumeric Passwords Along With Encryption, Akash Rao

Electrical & Computer Engineering Theses & Dissertations

Graphical passwords are always considered as an alternative of alphanumeric passwords for their better memorability and usability [1]. Alphanumeric passwords provide an adequate amount of satisfaction, but they do not offer better memorability compared to graphical passwords [1].

On the other hand, graphical passwords are considered less secured and provide better memorability [1]. Therefore many researchers have researched on graphical passwords to overcome the vulnerability. One of the most significant weaknesses of the graphical passwords is "Shoulder Surfing Attack," which means, sneaking into a victim's computer to learn the whole password or part of password or some confidential information. Such …

Question Answering With Textual Sequence Matching, Shuohang Wang

Dissertations and Theses Collection (Open Access)

Question answering (QA) is one of the most important applications in natural language processing. With the explosive text data from the Internet, intelligently getting answers of questions will help humans more efficiently collect useful information. My research in this thesis mainly focuses on solving question answering problem with textual sequence matching model which is to build vectorized representations for pairs of text sequences to enable better reasoning. And our thesis consists of three major parts.

In Part I, we propose two general models for building vectorized representations over a pair of sentences, which can be directly used to solve the …

Efficient Algorithms For Solving Aggregate Keyword Routing Problems, Qize Jiang, Weiwei Sun, Baihua Zheng, Kunjie Chen

Research Collection School Of Computing and Information Systems

With the emergence of smart phones and the popularity of GPS, the number of point of interest (POIs) is growing rapidly and spatial keyword search based on POIs has attracted significant attention. In this paper, we study a more sophistic type of spatial keyword searches that considers multiple query points and multiple query keywords, namely Aggregate Keyword Routing (AKR). AKR looks for an aggregate point m together with routes from each query point to m. The aggregate point has to satisfy the aggregate keywords, the routes from query points to the aggregate point have to pass POIs in order to …

The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team OP (CTOP) which arises in the logistics industry. In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the objective is to find a path for each vehicle in order to maximize the total collected score, without violating the capacity and time budget. We propose an Iterated Local Search (ILS) algorithm for solving the CTOP. Two strategies, either accepting a new solution as …

Maximizing Multifaceted Network Influence, Yuchen Li, Ju Fan, George V. Ovchinnikov, Panagiotis Karras

Research Collection School Of Computing and Information Systems

An information dissemination campaign is often multifaceted, involving several facets or pieces of information disseminating from different sources. The question then arises, how should we assign such pieces to eligible sources so as to achieve the best viral dissemination results? Past research has studied the problem of Influence Maximization (IM), which is to select a set of k promoters that maximizes the expected reach of a message over a network. However, in this classical IM problem, each promoter spreads out the same unitary piece of information. In this paper, we propose the Optimal Influential Pieces Assignment (OIPA) problem, which is …

Two-On-One Pursuit With A Non-Zero Capture Radius, Patrick J. Wasz

Theses and Dissertations

In this paper, we revisit the "Two Cutters and Fugitive Ship" differential game that was addressed by Isaacs, but move away from point capture. We consider a two-on-one pursuit-evasion differential game with simple motion and pursuers endowed with circular capture sets of radius l > 0. The regions in the state space where only one pursuer effects the capture and the region in the state space where both pursuers cooperatively and isochronously capture the evader are characterized, thus solving the Game of Kind. Concerning the Game of Degree, the algorithm for the synthesis of the optimal state feedback strategies of the …

A Generalized Phase Gradient Autofocus Algorithm, Aaron Evers

Theses and Dissertations

The phase gradient autofocus (PGA) algorithm has seen widespread use and success within the synthetic aperture radar (SAR) imaging community. However, its use and success has largely been limited to collection geometries where either the polar format algorithm (PFA) or range migration algorithm is suitable for SAR image formation. In this work, a generalized phase gradient autofocus (GPGA) algorithm is developed which is applicable with both the PFA and backprojection algorithm (BPA), thereby directly supporting a wide range of collection geometries and SAR imaging modalities. The GPGA algorithm preserves the four crucial signal processing steps comprising the PGA algorithm, while …

The Effect Of Modeling Simultaneous Events On Simulation Results, John M. Carboni

Theses and Dissertations

This thesis explores the method that governs the prioritizing process for simultaneous events in relation to simulation results for discrete-event simulations. Specifically, it contrasts typical discrete-event simulation (DES) execution algorithms with how events are selected and ordered by the discrete-event system specification (DEVS) formalism. The motivation for this research stems from a desire to understand how the selection of events affects simulation output (i.e., response). As a particular use case, we briefly investigate the processing of simultaneous events by the Advanced Framework for Simulation, Integration and Modeling (AFSIM), a military discrete-event combat modeling and simulation package. To facilitate the building …

Performance Analysis Of Angle Of Arrival Algorithms Applied To Radiofrequency Interference Direction Finding, Taylor S. Barber

Theses and Dissertations

Radiofrequency (RF) interference threatens the functionality of systems that increasingly underpin the daily function of modern society. In recent years there have been multiple incidents of intentional RF spectrum denial using terrestrial interference sources. Because RF based systems are used in safety-of-life applications in both military and civilian contexts, there is need for systems that can quickly locate these interference sources. In order to meet this need, the Air Force Research Laboratory Weapons Directorate is sponsoring the following research to support systems that will be able to quickly geolocate RF interferers using passive angle-of-arrival estimation to triangulate interference sources. This …

Pascal's Triangle Modulo N And Its Applications To Efficient Computation Of Binomial Coefficients, Zachary Warneke

Honors Program: Senior Projects (Public)

In this thesis, Pascal's Triangle modulo n will be explored for n prime and n a prime power. Using the results from the case when n is prime, a novel proof of Lucas' Theorem is given. Additionally, using both the results from the exploration of Pascal's Triangle here, as well as previous results, an efficient algorithm for computation of binomial coefficients modulo n (a choose b mod n) is described, and its time complexity is analyzed and compared to naive methods. In particular, the efficient algorithm runs in O(n log(a)) time (as opposed to …

Use Of Exploratory Data Analysis And Visualization In Identification Of Commingled Human Remains, Vivek Bhat Hosmat

UNO Student Research and Creative Activity Fair

The field of Exploratory data analysis and Visualization is revolutionizing the way we perceive things. At times, Visualization is seen as a subset of Exploratory data analysis and then there are branches in Visualization, types, technologies, tools which makes one feel that Visualization is a standalone pillar. Either way, they both work well together to extract meaningful information from almost any kind of data. These fields can very well be the stepping stone for in-depth or conclusive research. They can direct research based on facts and observations rather than one’s intuition or even a brute force technique. This project was …

Quantum Computing Is Here To Stay, Manoj Thulasidas

MITB Thought Leadership Series

QUANTUM COMPUTING is emerging from university laboratories and entering the industry arena at a painfully slow pace. The measured and deliberate progress is understandable given its complexity and promise. The stakes are high, because quantum computing presents the tantalising prospect of solving problems previously considered completely insoluble

Distributed Gibbs: A Linear-Space Sampling-Based Dcop Algorithm, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau, Roie Zivan

Research Collection School Of Computing and Information Systems

Researchers have used distributed constraint optimization problems (DCOPs) to model various multi-agent coordination and resource allocation problems. Very recently, Ottens et al. proposed a promising new approach to solve DCOPs that is based on confidence bounds via their Distributed UCT (DUCT) sampling-based algorithm. Unfortunately, its memory requirement per agent is exponential in the number of agents in the problem, which prohibits it from scaling up to large problems. Thus, in this article, we introduce two new sampling-based DCOP algorithms called Sequential Distributed Gibbs (SD-Gibbs) and Parallel Distributed Gibbs (PD-Gibbs). Both algorithms have memory requirements per agent that is linear in …

Semantic And Influence Aware K-Representative Queries Over Social Streams, Yanhao Wang, Yuchen Li, Kianlee Tan

Research Collection School Of Computing and Information Systems

Massive volumes of data continuously generated on social platforms have become an important information source for users. A primary method to obtain fresh and valuable information from social streams is social search. Although there have been extensive studies on social search, existing methods only focus on the relevance of query results but ignore the representativeness. In this paper, we propose a novel Semantic and Influence aware k-Representative (k-SIR) query for social streams based on topic modeling. Specifically, we consider that both user queries and elements are represented as vectors in the topic space. A k-SIR query retrieves a set of …