Theory and Algorithms Commons^™

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 …

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 …

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 …

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 …

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 …

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

Mirai Bot Scanner Summation Prototype, Charles V. Frank Jr.

Masters Theses & Doctoral Dissertations

The Mirai botnet deploys a distributed mechanism with each Bot continually scanning for a potential new Bot Victim. A Bot continually generates a random IP address to scan the network for discovering a potential new Bot Victim. The Bot establishes a connection with the potential new Bot Victim with a Transmission Control Protocol (TCP) handshake. The Mirai botnet has recruited hundreds of thousands of Bots. With 100,000 Bots, Mirai Distributed Denial of Service (DDoS) attacks on service provider Dyn in October 2016 triggered the inaccessibility to hundreds of websites in Europe and North America (Sinanović & Mrdovic, 2017). A month …

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 …

A Theoretical Model Of Underground Dipole Antennas For Communications In Internet Of Underground Things, Abdul Salam, Mehmet C. Vuran, Xin Dong, Christos Argyropoulos, Suat Irmak

Faculty Publications

The realization of Internet of Underground Things (IOUT) relies on the establishment of reliable communication links, where the antenna becomes a major design component due to the significant impacts of soil. In this paper, a theoretical model is developed to capture the impacts of change of soil moisture on the return loss, resonant frequency, and bandwidth of a buried dipole antenna. Experiments are conducted in silty clay loam, sandy, and silt loam soil, to characterize the effects of soil, in an indoor testbed and field testbeds. It is shown that at subsurface burial depths (0.1-0.4m), change in soil moisture impacts …

Smart Parking Systems Design And Integration Into Iot, Charles M. Menne

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

This paper looks at two smart parking reservation algorithms, and examines the ongoing efforts to connect smart systems of different domains in a city's infrastructure. The reservation algorithms are designed to improve the performance of smart parking systems. The first algorithm considers the distance between parking areas and the number of free parking spaces in determining a parking space. The second algorithm uses distance between parking areas and driver destination, parking price, and the number of unoccupied spaces for each parking area. Neither of these smart parking systems cover how they could fit into a larger scale smart system. As …

Bilateral Dependency Neural Networks For Cross-Language Algorithm Classification, Duy Quoc Nghi Bui, Yijun Yu, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Algorithm classification is to automatically identify the classes of a program based on the algorithm(s) and/or data structure(s) implemented in the program. It can be useful for various tasks, such as code reuse, code theft detection, and malware detection. Code similarity metrics, on the basis of features extracted from syntax and semantics, have been used to classify programs. Such features, however, often need manual selection effort and are specific to individual programming languages, limiting the classifiers to programs in the same language.To recognise the similarities and differences among algorithms implemented in different languages, this paper describes a framework of Bilateral …

Send Hardest Problems My Way: Probabilistic Path Prioritization For Hybrid Fuzzing, Lei Zhao, Yue Duan, Jifeng Xuan

Research Collection School Of Computing and Information Systems

Hybrid fuzzing which combines fuzzing and concolic execution has become an advanced technique for software vulnerability detection. Based on the observation that fuzzing and concolic execution are complementary in nature, the state-of-the-art hybrid fuzzing systems deploy ``demand launch'' and ``optimal switch'' strategies. Although these ideas sound intriguing, we point out several fundamental limitations in them, due to oversimplified assumptions. We then propose a novel ``discriminative dispatch'' strategy to better utilize the capability of concolic execution. We design a novel Monte Carlo based probabilistic path prioritization model to quantify each path's difficulty and prioritize them for concolic execution. This model treats …

A Sampling Approach For Proactive Project Scheduling Under Generalized Time-Dependent Workability Uncertainty, Wen Song, Donghun Kang, Jie Zhang, Zhiguang Cao, Hui Xi

Research Collection School Of Computing and Information Systems

In real-world project scheduling applications, activity durations are often uncertain. Proactive scheduling can effectively cope with the duration uncertainties, by generating robust baseline solutions according to a priori stochastic knowledge. However, most of the existing proactive approaches assume that the duration uncertainty of an activity is not related to its scheduled start time, which may not hold in many real-world scenarios. In this paper, we relax this assumption by allowing the duration uncertainty to be time-dependent, which is caused by the uncertainty of whether the activity can be executed on each time slot. We propose a stochastic optimization model to …

Dish: Democracy In State Houses, Nicholas A. Russo

Master's Theses

In our current political climate, state level legislators have become increasingly impor- tant. Due to cuts in funding and growing focus at the national level, public oversight for these legislators has drastically decreased. This makes it difficult for citizens and activists to understand the relationships and commonalities between legislators. This thesis provides three contributions to address this issue. First, we created a data set containing over 1200 features focused on a legislator’s activity on bills. Second, we created embeddings that represented a legislator’s level of activity and engagement for a given bill using a custom model called Democracy2Vec. Third, we …

Improving Vix Futures Forecasts Using Machine Learning Methods, James Hosker, Slobodan Djurdjevic, Hieu Nguyen, Robert Slater

SMU Data Science Review

The problem of forecasting market volatility is a difficult task for most fund managers. Volatility forecasts are used for risk management, alpha (risk) trading, and the reduction of trading friction. Improving the forecasts of future market volatility assists fund managers in adding or reducing risk in their portfolios as well as in increasing hedges to protect their portfolios in anticipation of a market sell-off event. Our analysis compares three existing financial models that forecast future market volatility using the Chicago Board Options Exchange Volatility Index (VIX) to six machine/deep learning supervised regression methods. This analysis determines which models provide best …

A Comparative Evaluation Of Recommender Systems For Hotel Reviews, Ryan Khaleghi, Kevin Cannon, Raghuram Srinivas

SMU Data Science Review

There has been increasing growth in deployment of recommender systems across Internet sites, with various models being used. These systems have been particularly valuable for review sites, as they seek to add value to the user experience to gain market share and to create new revenue streams through deals. Hotels are a prime target for this effort, as there is a large number for most destinations and a lot of differentiation between them. In this paper, we present an evaluation of two of the most popular methods for hotel review recommender systems: collaborative filtering and matrix factorization. The accuracy of …