Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

University of Nebraska at Omaha

Theses/Dissertations

2014

Articles 1 - 8 of 8

Full-Text Articles in Entire DC Network

Analyzing Shakespeare’S Plays In A Network Perspective, Vikas Thotakuri Dec 2014

Analyzing Shakespeare’S Plays In A Network Perspective, Vikas Thotakuri

Student Work

Networks are popular models for representing interactions between entities in systems, such as in sociology, bioinformatics, and epidemiology. The entities in the networks are represented as vertices and their pair-wise interactions are represented as edges [1]. Many network metrics such as degree centrality (number of connections of an entity) and betweenness centrality (number of shortest paths passing through the entity) have been developed to rank the entities according to their importance [7] [10].Social networks are generally modeled on only one type of relation. Groups are open-ended, which means the number of participants and the time frame are not finite. Time …


Modeling And Tracking Relative Movement Of Object Parts, Praneeth Talluri Dec 2014

Modeling And Tracking Relative Movement Of Object Parts, Praneeth Talluri

Student Work

Video surveillance systems play an important role in many civilian and military applications, for the purposes of security and surveillance. Object detection is an important component in a video surveillance system, used to identify possible objects of interest and to generate data for tracking and analysis purposes. Not much exploration has been done to track the moving parts of the object which is being tracked. Some of the promising techniques like Kalman Filter, Mean-shift algorithm, Matching Eigen Space, Discrete Wavelet Transform, Curvelet Transform, Distance Metric Learning have shown good performance for keeping track of moving object.

Most of this work …


The Quasigroup Block Cipher And Its Analysis, Matthew J. Battey May 2014

The Quasigroup Block Cipher And Its Analysis, Matthew J. Battey

Student Work

This thesis discusses the Quasigroup Block Cipher (QGBC) and its analysis. We first present the basic form of the QGBC and then follow with improvements in memory consumption and security. As a means of analyzing the system, we utilize tools such as the NIST Statistical Test Suite, auto and crosscorrelation, then linear and algebraic cryptanalysis. Finally, as we review the results of these analyses, we propose improvements and suggest an algorithm suitable for low-cost FPGA implementation.


The Application Of Graph Theory To Access Control Systems, Eric Brown Apr 2014

The Application Of Graph Theory To Access Control Systems, Eric Brown

Student Work

Computer systems contain vital information that must be protected. One of the crucial aspects of protection is access control. A review of some of the research into ways in which access to the information in computers can be controlled focuses on a question about safety. The safety question asks, “Can a user ever gain access to a resource for which he is not authorized?” This question cannot be answered in general because of the unbounded, unrestricted nature of a general-purpose access control system. It can be answered only for systems that are specifically designed to restrict the actions that can …


Automated Oracle Generation Via Denotational Semantics, Liang Cao Apr 2014

Automated Oracle Generation Via Denotational Semantics, Liang Cao

Student Work

Software failure detection is typically done by comparing the running behaviors from a software under test (SUT) against its expected behaviors, called test oracles. In this paper, we present a formal approach to specifying test oracles in denotational semantics for systems with structured inputs. The approach introduces formal semantic evaluation rules, based on the denotational semantics methodology, defined on each productive grammar rule. We extend our grammar-based test generator, GENA, with automated test oracle generation. We provide three case studies of software testing: (i) a benchmark of Java programs on arithmetic calculations, (ii) an open source software on license identification, …


Program Comprehension Of Aspect-Oriented Programs, Jeffrey Steenbock Apr 2014

Program Comprehension Of Aspect-Oriented Programs, Jeffrey Steenbock

Student Work

The aim of aspect-oriented development has been to address the issue of software reuse outside the domain of established object-oriented techniques within the challenging realm of similar cross-cutting concerns. By decoupling the concerns from the core functionality, aspect-oriented developed software results in a smaller code base and reduced code duplication. This decoupling though presents new challenges to the software development process. The process of separating concerns impacts the developers established engineering inclinations as well as existing, established notations, such as UML, that developers are familiar with utilizing for both designing and understanding the implemented software systems. This thesis will study …


Test-Driven Learning In High School Computer Science, Ryan Stejskal Apr 2014

Test-Driven Learning In High School Computer Science, Ryan Stejskal

Student Work

Test-driven development is a style of software development that emphasizes writing tests first and running them frequently with the aid of automated testing tools. This development style is widely used in the software development industry to improve the rate of development while reducing software defects. Some computer science educators are adopting the test-driven development approach to help improve student understanding and performance on programming projects. Several studies have examined the benefits of teaching test-driven programming techniques to undergraduate student programmers, with generally positive results. However, the usage of test-driven learning at the high school level has not been studied to …


Multi-Robot Coverage With Dynamic Coverage Information Compression, Zachary L. Wilson Mar 2014

Multi-Robot Coverage With Dynamic Coverage Information Compression, Zachary L. Wilson

Student Work

This work considers the problem of coverage of an initially unknown environment by a set of autonomous robots. A crucial aspect in multi-robot coverage involves robots sharing information about the regions they have already covered at certain intervals, so that multiple robots can avoid repeated coverage of the same area. However, sharing the coverage information between robots imposes considerable communication and computation overhead on each robot, which increases the robots’ battery usage and overall coverage time. To address this problem, we explore a novel coverage technique where robots use an information compression algorithm before sharing their coverage maps with each …