Computer Science Masters Papers

Permanent URI for this collectionhdl:10365/32552

Browse

Now showing 1 - 20 of 256

N-gram-based Search Procedure
(North Dakota State University, 2009) Woznica, Szymon
Efficient querying and discovery of meaningful patterns in data becomes more and more important with accelerating growth of data published every day on the Internet. Tree pruning-based algorithms used in most popular search programs have troubles when dealing with infrequent query strings, limiting the number of returned results that might be of interest to the user. Furthermore, the existing tools are not capable of finding data patterns that could inform the user about the frequency of occurrence and location of a specific set of words in large, user-defined sets of textual data, in an efficient manner. In this paper, we present a new search tool, which is based on n-grams and modern software technologies. Our tool can efficiently index word n-grams existing in large sets of user-defined, textual data and subsequently assist users in querying the text corpus, helping them to find hidden patterns and their locations in the input data, effectively. We describe an algorithm for extracting word n-grams with a parameter "n" equal to two, three and four, and demonstrate how it can be leveraged by the end-user of the search tool to mine data in a new way. The presented tool offers a unique feature that allows the user to search a set of n-grams, extracted from abstracts of biomedical publications obtained from the U.S. National Library of Medicine (NLM), filtering the search result by words existing in the English language. The data tier of the search tool is based on the Microsoft SQL Server 2008 supported by a set of Common Language Runtime (CLR) functions and Transact Structured Query Language (T-SQL) based stored procedures, whereas the business logic and the user interface utilizes C# .NET 3.5 libraries to support regular expression patterns, database connection (LINQ to SQL) and multithreaded system operations.
A Graphical Tool for Test Generation from State Models
(North Dakota State University, 2009) Wu, Qjpeng
This paper presented a graphical tool for generating test cases based on state models. The tool provides users with a user-friendly model editor to create their state model in a tree view structure. The tree based state model can then be saved to a disk in the form of an xml file and any existing model file can be loaded back into the tool. Two different traverse algorithms are explored by this tool, state based coverage and transition based coverage. The tool implements both algorithms and is capable of generating test paths based on different traversal algorithms. The tool also provides a code generation process that walks through these test paths and generates test cases in any one of the supported .NET based programming languages specified by the user. Lastly, the tool can generate a Visual Studio compatible model file based on the same state model created by the user. This model serves as a good visual representation of the state model created by the user in the model editor. The same state model is represented in three different forms, tree based state model in model editor, xml based state model in an xml file and graphical based state model in Visual Studio. An example is used to demonstrate the usage of this tool and the algorithms used behind the scene.
Mobile Sensor movement using Simulated Annealing
(North Dakota State University, 2009) Yamparala, Sri Harsha
Movement of mobile sensor nodes is an important aspect in wireless sensor networks, and there is considerable research underway into the design of mobile sensor movement algorithms for wireless sensor networks. Various mobile sensor movement algorithms have been proposed using different combinatorial optimization techniques such as Tahu Search, Ant Colony Optimization, and Genetic Algorithms. In this paper we present a mobile sensor movement Algorithm for Heterogenenous Sensor Networks using a Simulated annealing search technique. This paper also discusses the various factors that are taken into account while making a decision about the movement of a mobile sensor node in the event of a sensor node failure. With the help of Simulated annealing, a Movement Algorithm is proposed with an Annealing schedule that is suitable for Heterogeneous Sensor Networks, and its performance is evaluated for various sensor deployment scenarios in Heterogenenous Sensor Networks.
Teaching Encryption: A Learning Theory Approach
(North Dakota State University, 2010) Bhogadi, Manu Kishore
Bloom's taxonomy for cognitive domain is an effective taxonomy for structured learning. The six levels in Bloom's taxonomy for cognitive domain are based on the levels of difficulty. This paper focuses on teaching communication security and encryption by applying Bloom's taxonomy in the creation of educational materials and assessments. Delivering education material to the mobile phones is made possible with the advancement of mobile technologies, and the use of mobile technologies in teaching is gaining popularity because of its benefits. In this paper, delivering educational material to the mobile phones is experimented with by using a flash cards application for android based mobile phones. Experiential learning is learning by doing, is active, motivating and enables learners to retain knowledge to a greater extent. This paper provides a tool to learn RSA public key cryptographic algorithm through experiential learning.
A Free and Flexible Poker Environment
(North Dakota State University, 2010) DeBilt, Daniel George
This paper introduces a framework and software that allows poker players to create and play original and custom poker games, through a TCP/IP connection, for free. This paper describes how the concept of playing usercreated poker games over the Internet is not known to currently exist in a flexible, private, and free environment and also critiques what currently does exist and is available for use. This paper also summarizes the software development process used and the deliverables that ultimately led to a working software application. Future version features and application extensions are also discussed that may enhance the user experience, as well as future research projects.
Automatic Evaluation of Mobile Web Pages
(North Dakota State University, 2010) Sehgal, Ankita
The use of mobile devices to access the information on the World Wide Web is growing rapidly. The growth has created a surge in the number of webpages being designed for mobile devices. In order to support efficient mobile browsing, some markup languages (e.g., WML and XHTML Mobile Profile) and standards (Mobile Web Best Practices) have been developed to specifically support the rendering of information on mobile devices. Evaluating the mobile webpages manually against the guidelines requires a tremendous amount of work. This research paper focuses on automatic evaluation of mobile webpages, a process which offers many advantages in terms of saving time, reducing costs and many others. In this paper, an extensive inspection of the 46 most popular mobile websites, according to Mobile Web Best Practices using MobileOK checker [WMC09], has been conducted. The results have been provided and analyzed to make specific and general suggestions to improve the design and development of mobile websites. We believe that the analysis will help developers produce more user-friendly mobile websites while considering the Mobile Web Best Practices. Furthermore, the paper also presents a generic approach to represent the W3C Mobile Web Guidelines as an XML schema, which provides flexibility to design rule schemas in an open format; the schemas can be added to an automated tool that is used to evaluate the mobile webpages. The XML schema can also be used to redesign the rule if there is a change in the guidelines.
A Technique to Detect a Black Hole in Ad Hoc Networks
(North Dakota State University, 2010) Suravarapu, Vijay Anand
Mobile Ad Hoc Networks (MANETs) are important because they are widely used in war zones, rescue missions and other civilian applications where it is almost impossible to use any other networks. MANETs are temporary networks where nodes are allowed to join or leave the network at any point in ~ime. Though MANETs offer flexibility, self maintenance and dynamic topology, they suffer from limited resources, have less computational power and are susceptible to attacks. Due to the dynamic nature of MANETs, the secure transmission of data is one of the key issues in MANETs. Thus there is a need to safeguard the network from internal as well as external security threats. In this paper, I attempt to improve the security environment of one of the most popular routing protocols in MANETs, the Ad Hoc On Demand Distance Vector Routing Protocol (AODV). AODV is a reactive protocol which guarantees loop free routes during the transmission of data, and the focus of this paper is mainly to secure the AODV protocol against black hole attacks. This paper proposes the Forward Reaching Black Hole Detection algorithm (FRBD) to detect single black holes in MANETs that are based on the AODV routing protocol. This paper presents a solution that includes slight modifications in the functioning of the AODV protocol. I demonstrate the proposed solution on a specially developed Java based simulation tool. The paper examines the black hole detection capabilities of the FRBD algorithm by applying it on randomly generated problem instances. These instances vary based on the total number of nodes, paths and the location of the black hole node. Our analysis shows that the FRBD algorithm effectively detects single black holes in the network and thus improves the overall security of MANETs.
Graduate Student Progress Tracking System
(North Dakota State University, 2010) Thalloji, Pramodh Kumar
In this paper, I propose and implement an application to track the graduate student progress in various Computer Science and Software Engineering graduate programs. This application will provide lists of students who in a given year or semester did not fulfill any of the numbered requirements of their programs. It will provide a list of students who passed the comprehensive or qualifier exams in that year or semester. It will also list the students who have taken longer than the time limit mandated by the Graduate School to complete their plan of study. This application was developed with the assumption that the database models the original PeopleSoft database. This application shall be modified to use the registrar's PeopleSoft database and get the information associated with students.
Smart Robotic Arm Control through Autonomous Object Detection and Retrieval
(North Dakota State University, 2010) Mahodaya, Vicky Ramnath
This paper outlines the design and development of a robotic arm that can automatically detect and locate an object within its working envelope, reach to the object, grab the object with the aid of force feedback, bring it back to the user and transition back to user-control mode. A smart robotic arm like this can be used to control a brain computer interface (BCI) enabled prosthetic arm. This could be done by controlling the arm's coarse motion using BCI signals to the arm in manual mode while the fine motion control required for object capturing and retrieval could be performed by the smart robotic arm upon automatic detection of the object. The smart robotic arm was developed by interfacing force, distance and position sensors with a robotic arm possessing three actuated joints. Using feedback control and direct-inverse kinematic equations, the arm was controlled to perform autonomous object detection and retrieval.
A Network Optimization Solver for Routing in Wireless Sensor Networks
(North Dakota State University, 2010) Samaraweera, Shaminda Asela
Many wireless sensor network applications require energy efficient communication between nodes in the network. Sensor networks are of limited resources. Due to this limitation, the routing between the nodes is one of the important aspects of the life span of the total network. Optimization of the routing algorithm is therefore an important decision point in the design of the sensor network. Our study establishes that optimization can increase the life span of the network. We implement an optimization algorithm in the total network, which is capable of saving energy on communication. The energy saving in communication helped us to increase the life span of the network.
Advanced Computational Ratings for College Football Teams
(North Dakota State University, 2010) Hensley, Joel Michael
This paper explores the subject of rating systems applied to the world of college football. Current rating system methodologies are examined, and four rating systems are developed and evaluated in a program. The Hensley Rating system is introduced as a new method. The details of each of these systems are discussed, and the results are analyzed and evaluated using data from the college football seasons of 2000 - 2009.
A Clustering Approach to Improving Test Case Prioritization: An Industrial Case Study
(North Dakota State University, 2010) Carlson, Ryan Curtis
Regression testing is an important activity for controlling the quality of a software product, but it accounts for a large proportion of the costs of software. We believe that an understanding of the underlying relationships in data about software systems, including data correlations and patterns, could provide information that would help improve regression testing techniques. As an initial approach to investigating the relationships in massive data in software repositories, in this paper, we consider a clustering approach to help improve test case prioritization. We implemented new prioritization techniques that incorporate a clustering approach and utilize history data on real faults and code complexity. To assess our approach, we conducted empirical studies using an industrial software product, Microsoft Dynamics Ax, which contains real faults. Our results show that test case prioritization that utilizes a clustering approach can improve the rate of fault detection of test suites, and reduce the number of faults that slip through testing when testing activities are cut short and test cases must be omitted due to time constraints.
A Data Visualization Tool to Identify Patterns Formed by Subsets of Data
(North Dakota State University, 2010) Osmani, Md Golam Morshed
An object may be identified by its properties which may comprise both continuous data values and categorical data values. Sometimes a particular property (categorical) value may select a group of objects which have similarity in their attributes (continuous). This feature is observed in gene data sets as well as other multivariate data sets. This paper presents a tool to identify patterns formed by data subsets based upon some categorical attributes. The tool reads data from various data sources, filters data according to supplied criteria and shows them as a Parallel Coordinates graph which a user can manipulate to find the relation between data subsets by changing the selection criteria. The user is given a choice to change values of the various categorical columns and to select a subset of data to find out their similarity. This tool can be used both in desktop and web environments. The class library is implemented in C# and also ported to Java to make it widely available. Other application developers can also use this library in their application to have this functionality readily available.
REND: Reliable and Energy-Efficient Node-Disjoint Paths in Wireless Sensor Networks
(North Dakota State University, 2010) Yanteru, Siva
In wireless sensor networks, finding most reliable and most efficient paths between source node and destination node is considered NP hard problem. We can increase reliability by ability to find node-disjoint alternate path when there is any disruption in the path from source to destination. If we can find reliable paths by keeping efficiency in consideration then we can increase both reliability and efficiency of paths between source and destination. In this paper, we present routing protocol for finding two node-disjoint paths between each pair of nodes in a wireless sensor networks. In proposed protocol, each and every node has the same procedure. In this paper, we compare proposed protocol to traditional shortest path algorithm to find shortest path (diverse shortest path). A diverse shortest path has been proven most efficient. as it can compute node-disjoint paths connecting a source node to a destination nude with minimum total energy. However. computing node-disjoint path connecting source node to destination node in this approach may not be reliable. as it may not find second shortest path al I the time. We proposed node-disjoint path algorithm to find reliability of node-disjoint paths in wireless sensor networks. B) implementation of node-disjoint path algorithm on wire less sensor networks. Reliability has definitely increased. By implementing efficient node-disjoint path algorithm on wireless sensor networks. We improved energy consumption significantly.
Neutralization of Conflict Areas Using an Ant Colony Heuristic Approach
(North Dakota State University, 2010) Bapanpally, Pavan Kumar
In this paper, we present a unique approach to solve the Neutralization of Conflict Areas problem using an Ant Colony Optimization technique. The Neutralization of Conflict Areas is a known problem, and over the years, considerable research has been conducted to find strategies [7] to solve the problem. To effectively deal with this kind of problem, many search algorithms and techniques have been proposed. The Ant Colony Optimization technique has been very successful in solving problems such as the travelling salesman problem, vehicle routing problem, and routing and scheduling problems. The suggested approach to the problem presented here is to find routes for conflict areas and then neutralize the conflict areas. To find routes to conflict areas, we used the concept of a Dynamic Source Routing protocol. To find the shortest paths, we used the Ant Colony Optimization technique. The goal of this paper is to suggest a swarm-based approach to find conflict areas, neutralize conflict areas, and recruit help from other resource units when needed to neutralize conflict areas. The proposed solution has been implemented in a simulator. We simulate how two different sets of cooperating ants called explorer ants and worker ants, with different operational abilities work together in finding and neutralizing conflict areas and also in getting help from other resources areas. The solution can be visualized using a graphical user interface. The framework that we implement will allow for experimentation with a wide variety of experimental parameters.
XGraphML-A Tool for Transforming UML to GraphML
(North Dakota State University, 2010) Raavi, Sandeep
This paper proposes and implements XGraphML, a tool which transforms a file from a UML format to a GraphML using XSLT and JAXP technologies. The tool connects ArgoUML with VEGGIE through this transformation. ArgoUML is an open-source tool used to model software artifacts through UML diagrams and uses UML as a standard saving mechanism. On the other hand, VEGGIE (i.e., the Visual Environment for Graph Grammar Induction and Engineering) utilizes GraphML as a standard saving mechanism. XGraphML takes a UML file as input and produces a corresponding GraphML file. Based on XGraphML, software engineers use ArgoUML to model software artifacts and then pass the designed model to VEGGIE for further analysis. A stylesheet is used to transform UML format to a GraphML. The stylesheet is processed using the XGraphML tool that has been introduced through this paper. XGraphML provides a way to transform one major graph format to another. This tool is built on the base of Java, which is one of the most common programming languages and enhances extendibility for further use. Furthermore, a graphical user interface has been implemented which enables the users to view the transformation on the screen and then save it to the desired location on the system.
Electronic Payment System Decision Support with Bloom's Taxonomy
(North Dakota State University, 2010) Mattaparthy, Harika
The primary goal of this paper is to develop an online course that enables students to learn about electronic payment systems by applying Bloom's taxonomy. There are six levels in Bloom's taxonomy, with knowledge representing the simplest level and evaluation representing the highest and most complex level. These levels of intellectual behavior are vital in learning. To help students understand and analyze the concepts of electronic payment systems, three labs have been developed that map with the lower levels of Bloom's taxonomy. The first lab introduces students to the electronic payment system concepts; the second lab helps them understand the difference between the Amazon and PayPal payment systems; and the third lab recommends a payment system that best fits with their online business based on the choices made.
Design and Implementation of Social Networking Website Features
(North Dakota State University, 2010) Aakula, Srikanth Goud
People want to communicate and interact with each other over the internet. There are various websites which are helpful for this kind of socializing. The popularity and adaptability of each website depends on the features it provides to its users. This paper deals with some of features which help users extend their social-networking experience. A social-networking website is designed and developed with features targeting different areas of the social-networking environment like networking, technical support, and profile. This paper focuses on developing features which shall extend the social-networking experience of the user rather than building an entire social-networking website. The website that is developed shows the workings of the above-mentioned features in a socialnetworking website environment. The result of the paper is a working website with the features mentioned and a survey to get feedback from users. The users' satisfaction level with the features implemented can be obtained from the survey.
A Software Agent System for Private Email
(North Dakota State University, 2010) Mukka, Hari K.
The primary concerns in existing Email and instant messaging systems are authentication processes, privacy and security issues. These messaging systems transfer the message content through servers using protocols like the Simple Message Transfer Protocol (SMTP), Post Office Protocol (POP), and Internet Message Access Protocol (IMAP) to allow users to communicate. During these processes, messages are being stored on the servers which can be easily accessed by the network administrator. Invasion of privacy, integrity of Email content, lack of authentication, and unprotected back-up of messages stored · on servers could be common underlying problems in the existing architecture. The goal of this paper is to build· an Email messaging system which would offer better privacy and security of Email content to users. The application can be viewed as a source of communication for people in a private club. In this paper we propose three different designs for building an email messaging system using the Java Agent Development Environment (platform to provide communication between agents) framework. Our application mainly uses intelligent software agents. The three Designs primarily implement two kinds of software agents, a Facilitator Agent and P-Mail (PrivateMail) agent. Based on the Design and architecture these agents act accordingly to meet the user requirements and provide better security and privacy. Finally we conclude by evaluating the three designs by assessing their performance.
Design of the Photo Album Ontology
(North Dakota State University, 2010) Sarker, Mridula
At present, growing demand of the management of huge volume of web contents, especially photos, require the software tools, which can store, index and retrieve the photos from the repository more efficiently. In this paper, we proposed a design solution using the semantic web technology. The goal is to integrate this knowledge-based ontology into the photo management system to improve the experience of the user's accessibility in the photo warehouse. Most of the existing photo album management software tools are built using the convention of traditional approaches, such as key-word based search or low-level image annotation approaches, which make it difficult to retrieve the user's desired photo successfully. To access those stored photos and retrieve them in an efficient manner, we designed an ontology-based photo album, which will allow the users to find their necessary information, in this case, photos effectively. Query language like Simple Protocol and Resource Query Language (SPARQL) is used to initiate the query within the photo repository. Our experience shows that this domain knowledge-based concept can improve the photo retrieval experience fruitfully.

Browse

Browsing Computer Science Masters Papers by Issue Date