Browsing Computer Science by Issue Date
Now showing items 1-20 of 416
-
N-gram-based Search Procedure
(North Dakota State University, 2009)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 ... -
Mobile Sensor movement using Simulated Annealing
(North Dakota State University, 2009)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 ... -
A Graphical Tool for Test Generation from State Models
(North Dakota State University, 2009)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 ... -
A Closed Form Optimization Model for The Conflict Neutralization Problem
(North Dakota State University, 2010)In this study, we proposed a novel closed form optimization model for the Conflict Neutralization Problem (CKP) and implemented an efficient algorithm for solving the problem. A novel tableau representation of the CNP ... -
Kakuro Solver Application
(North Dakota State University, 2010)In this paper, the application called KakuroSolver is presented that solves Kakuro, the popular logical puzzle that combines Sudoku and crossword. The application accepts a Kakuro puzzle with any size; it then either ... -
The Web Based Meeting Scheduler
(North Dakota State University, 2010)In this paper I present a Web based Meeting Scheduler which is a web-based easy to use group calendar application for scheduling events, reserving meeting rooms and scheduling meetings. Meetings and events may be scheduled ... -
Outlier Identification in Sensor Network Clock Synchronization
(North Dakota State University, 2010)We first present a survey of clock synchronization research that describes the problem and various challenges to implementing an efficient protocol for clock synchronization in sensor networks. We then present several ... -
REND: Reliable and Energy-Efficient Node-Disjoint Paths in Wireless Sensor Networks
(North Dakota State University, 2010)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 ... -
A Technique to Detect a Black Hole in Ad Hoc Networks
(North Dakota State University, 2010)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 ... -
Complex Relation Discovery from the Semantic Web
(North Dakota State University, 2010)The vision or the Semantic Web undertakes an extension or the current Web, in which machines can understand all the data. The nature of Semantic Web data is relationship-centric and is very complex. In this study we aimed ... -
Graduate Student Progress Tracking System
(North Dakota State University, 2010)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 ... -
Automatic Evaluation of Mobile Web Pages
(North Dakota State University, 2010)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 ... -
Design of the Photo Album Ontology
(North Dakota State University, 2010)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 ... -
A Network Optimization Solver for Routing in Wireless Sensor Networks
(North Dakota State University, 2010)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 ... -
Anonymity and Hostile Node Identification in Wireless Sensor Networks
(North Dakota State University, 2010)In many secure wireless network attack scenarios, the source of a data packet is as sensitive as the data it contains. Existing work to provide source anonymity in wireless sensor networks (WSN) are not frugal in terms ... -
XGraphML-A Tool for Transforming UML to GraphML
(North Dakota State University, 2010)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 ... -
A Data Visualization Tool to Identify Patterns Formed by Subsets of Data
(North Dakota State University, 2010)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 ... -
Dynamic Algorithms for Sensor Scheduling and Adversary Path Prediction
(North Dakota State University, 2010)In this thesis we describe three new dynamic, real time and robust sensor scheduling algorithms for intruder tracking and sensor scheduling. We call them Tactic Association Based Algorithm (TABA), Tactic Case Based ... -
A Software Agent System for Private Email
(North Dakota State University, 2010)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 ... -
Virtual-Experiment-Driven Process Model (VEDPM)
(North Dakota State University, 2010)Computer simulations are the last resort for many complex problems such as swarm applications. However, to the best of the author's knowledge, there is no convincing work in proving ''What You Simulate ls What You See'' ...