Browsing Computer Science Masters Papers by Issue Date

Now showing items 21-40 of 255

    • Development Tools for Content Creation in Virtual Environments 

      Hokanson, Guy Eric (North Dakota State University, 2010)
      lmmersive Virtual Environments (IVEs) for education are designed and implemented to enable students to learn complicated concepts in an exploratory and inquiry based manner. The environments are constructed so that ...

    • Alternative Clustering Algorithms in Sensor Networks 

      Gupta, Divya (North Dakota State University, 2010)
      A wireless sensor network is composed of a large number of tiny sensor nodes that can be deployed in a variety of environments like battle fields, water, large fields, and the like, and can transmit data to a Base station ...

    • A Free and Flexible Poker Environment 

      DeBilt, Daniel George (North Dakota State University, 2010)
      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 ...

    • A Clustering Approach to Improving Test Case Prioritization: An Industrial Case Study 

      Carlson, Ryan Curtis (North Dakota State University, 2010)
      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 ...

    • eTablaTutor - The Electronic Tabla Leaming Game 

      Bhowmick, Dibakar (North Dakota State University, 2010)
      Tabla is a percussion instrument widely used in Indian classical music both as a solo instrument and as an accompaniment to vocal or instrumental music. Learning Tabla, like learning any musical instrument, is very much ...

    • Teaching Encryption: A Learning Theory Approach 

      Bhogadi, Manu Kishore (North Dakota State University, 2010)
      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 ...

    • Neutralization of Conflict Areas Using an Ant Colony Heuristic Approach 

      Bapanpally, Pavan Kumar (North Dakota State University, 2010)
      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, ...

    • Design and Implementation of Social Networking Website Features 

      Aakula, Srikanth Goud (North Dakota State University, 2010)
      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 ...

    • The Grid Scan Heuristic for Extending Lifetime in Wireless Sensor Networks 

      Pachva, Srikar (North Dakota State University, 2011)
      Wireless Sensor Networks, consisting of sensing devices which sense the environment and communicate information among each other, is an emergent field in wireless networking with many potential applications. Efficiency of ...

    • Multi-Agent Based Simulation of an Unmanned Aerial Vehicles System 

      Murugesan, Karthiksivaram (North Dakota State University, 2011)
      The rapid growth of using Unmanned Aerial Vehicles (UAV) for civilian and military applications has promoted the development of research in many areas. Most of the unmanned aerial vehicles in use are manually controlled. ...

    • Multi-Style Web Content Restructuring for Efficient Mobile Web Browsing 

      Xia, Xiaojun (North Dakota State University, 2011)
      Mobile devices such as smart phones, PDAs, and tablets are getting more and more popular every day. As a result, more people tend to use mobile devices to access Web contents. Therefore, mobile browsing becomes an important ...

    • Discovering Complex Relationships between Drugs and Diseases 

      Sharma, Ranjana (North Dakota State University, 2011)
      Finding the complex semantic relations between existing drugs and new diseases will help in the drug development in a new way. Most of the drugs which have found new uses have been discovered due to serendipity. Hence, the ...

    • Job Aggregation Search Engine 

      Sundaram, Anita (North Dakota State University, 2011)
      In this paper we describe the design and implementation of a Job Aggregation Search Engine (JASE) that acts as a one-stop-shop for listing recently posted jobs across top multiple job search engines. There are multiple job ...

    • DOM Structure Based Web Pattern Mining 

      Pillarikuppam, Naresh (North Dakota State University, 2011)
      A rapid expansion in the Web has motivated several studies to understand and recognize the implementation structure underlying the interface. Though the presentation of the Web pages looks different, those Web pages may ...

    • Algorithms for Coverage Improvement in a Sensor Network 

      Maddi, Sunil Reddy (North Dakota State University, 2011)
      Sensors are devices which have the ability to receive and respond to a signal. These sensors, when used as a group, form a sensor network. Sensors in a sensor network can communicate and transmit data. In the early stages ...

    • Shortest Path in a Wireless Sensor Network with Multiple Sensor Failures 

      Poreddy, Sandeep Reddy (North Dakota State University, 2011)
      This paper shows how a shortest path can be obtained in a wireless sensor network, between a source sensor and a destination sensor, in a hop-by-hop fashion, considering multiple sensor failures along the path of data ...

    • Demonstrating Bid Rigging with a Shopping Agent Application Using JADE 

      Sivanandam, Dinesh (North Dakota State University, 2011)
      This paper presents the implementation of a shopping-cart agent that demonstrated collusion in online bidding. Collusion is an agreement between two or more persons, sometimes illegal and therefore secretive, to limit open ...

    • Graph Data Conversion and Tree Visualization 

      Guduru, Srinivas (North Dakota State University, 2011)
      The first part of the paper is converting graph data format from GXL to GraphML. GXL and GraphML are both XML-based languages for representing graph data. The HP page segmentation tool produces output graph data in GXL ...

    • Analysis of Security Vulnerabilities in Web Applications using Threat Modeling 

      Kondamarri, Samuel Sudhakar (North Dakota State University, 2011)
      Software security issues have been a major concern to the cyberspace community; therefore, a great deal of research on security testing has been performed, and various security testing techniques have been developed. A ...

    • Positioning of Relay Stations in Wireless Sensor Networks 

      Koganti, Nikhil (North Dakota State University, 2011)
      A sensor is a device which can detect or measure a physical property and which records, indicates, or otherwise responds to the signal received. A wireless sensor in a network can communicate with the sensors located within ...