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

Digital Commons Network™

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

2006

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 15931 - 15960 of 16305

Full-Text Articles in Entire DC Network

Graph Reconstruction Numbers, Jennifer Baldwin Jan 2006

Graph Reconstruction Numbers, Jennifer Baldwin

Theses

One of the most important open questions in graph theory is the graph reconstruction conjecture, first proposed by P. J. Kelly and S. M. Ulam in 1941. The conjecture states that every graph with at least 3 vertices is reconstructible if there exists some multi-subset of vertex-deleted subgraphs that reconstructs G uniquely up to isomorphism. This project computes the existential and universal reconstruction numbers for all graphs of order at most nine. The existential reconstruction number is the number of vertex-deleted subgraphs, or cards, required to reconstruct G uniquely up to isomorphism. The universal reconstruction number is the minimum num- …

Go to article

Mfs: M2mi File System, Ravi Bhatia Jan 2006

Mfs: M2mi File System, Ravi Bhatia

Theses

The M2MI File System is a Virtual File System designed for ad hoc networks. It uses M2MI/M2MP to perform ad hoc communication. The file system comprises of several file system instances spread across the network. Each file system instance furnishes a partial state, contributing to the complete structure of the file system. Hence MFS is a union of several file system instances collaborating with each other. The file system facilitates four file operations: ADD, REMOVE, LIST, and READ. The operation ADD allows a user to import a file from the local file system into MFS. It also permits the creation …

Go to article

Real-Time Scheduling Algorithms, Task Visualization, Kevin Churnetski Jan 2006

Real-Time Scheduling Algorithms, Task Visualization, Kevin Churnetski

Theses

Real-time systems are computer systems that require responses to events within specified time limits or constraints. Many real-time systems are digital control systems comprised entirely of binary logic or a microprocessor dedicated to one software application that is its own operating system. In recent years, the reliability of general-purpose real-time operating systems (RTOS) consisting of a scheduler and system resource management have improved. In this project, I write a real-time simulator, a workload generator, analysis tools, several test cases, and run and interpret results. My experiments focus on providing evidence to support the claim that for the Rate Monotonic scheduling …

Go to article

Emotion In Flocking, Katherine Law Jan 2006

Emotion In Flocking, Katherine Law

Theses

Behavioral animation is a category of computer animation that enables objects to determine their own actions. This saves an animator from having to determine every detail of movement for each object in the animation. As the number of objects within an animation increases, specifying the position of each object becomes increasingly difficult. Flocking is an example of behavioral animation. Some examples of flocking can be seen in movies, such as the stampede of the antelopes in The Lion King, the herds of dinosaurs in Jurassic Park, and the massive battle scenes in The Lord of the Rings. In this project, …

Go to article

A Comparison Of Web Development Technologies: Webobjects Vs. Asp.Net, Adnan Al-Ghourabi Jan 2006

A Comparison Of Web Development Technologies: Webobjects Vs. Asp.Net, Adnan Al-Ghourabi

Theses

There are at least two competing technologies for Web applications development: ASP.NET by Microsoft and WebObjects by Apple. The IBuySpy application, a web portal that has been developed by the ASP.NET team at Microsoft using the .NET framework, illustrates the best practices for developing ASP.NET applications, in terms of modular design, caching, user authentication and authorization, and state management. In this project, a similar application was developed in WebObjects so that both technologies can be compared in terms of system architecture, frameworks, reusability, development environment and tools, security, and implementation.

Go to article

The Study Of Ramsey Numbers R(C_K, C_K, C_K), Yan Li Jan 2006

The Study Of Ramsey Numbers R(C_K, C_K, C_K), Yan Li

Theses

The Ramsey number r(C_k, C_k, C_k), denoted as r_3(C_k), is the smallest positive integer n such that any edge coloring with three colors of the complete graph on n vertices must contain at least one monochromatic cycle C_k. In this project, most literature on the Ramsey numbers r_3(C_k) are overviewed. Algorithms to check if a graph G contains any specific path or cycle and to construct extremal graphs for cycle C_k are developed. All good 3-colorings of complete graph K_10 are constructed to verify the value of Ramsey number r_3(C_4). Ramsey number value of r_3(C_3) is verified by direct point …

Go to article

Tuple Board: A New Distributed Computing Paradigm For Mobile Ad Hoc Networks, Chaithanya Bondada Jan 2006

Tuple Board: A New Distributed Computing Paradigm For Mobile Ad Hoc Networks, Chaithanya Bondada

Theses

In this project, we introduce a new distributed computing paradigm called "tuple board" which is based on the tuple space abstraction originated by Gelernter and the blackboard architecture popular in distributed artificial intelligence. Most prominent implementations of tuple space systems including JavaSpaces and T-Spaces follow a centralized architecture where the space itself resides on a server, akin to a database server. Recently, researchers have attempted to develop decentralized architectures for tuple space systems. Some work includes LIME and PeerSpaces. In our opinion, the traditional implementation of tuple spaces is not well suited for ad hoc networks where devices frequently lose …

Go to article

R(W5 , K5) = 27, Joshua Stinehour Jan 2006

R(W5 , K5) = 27, Joshua Stinehour

Theses

The two-color Ramsey number R(G , H) is defined to be the smallest integer n such that any graph F on n vertices contains either a subgraph isomorphic to G or the complement of F contains a subgraph isomorphic to H. Ramsey numbers serve to quantify many of the existing theorems of Ramsey theory, which looks at large combinatorial objects for certain given smaller combinatorial objects that must be present. In 1989 George R. T. Hendry presented a table of two-color Ramsey numbers R(G , H) for all pairs of graphs G and H having at most five vertices. This …

Go to article

Distributed Objects In C#, Xiaoyun Xie Jan 2006

Distributed Objects In C#, Xiaoyun Xie

Theses

Today more and more programs run over a collection of autonomous computers linked by a network and are designed to produce an integrated computing facility. Java Distributed Objects (JDO) proposed by Dr. Axel T. Schreiner builds an infrastructure which allows distributed program components to communicate over a network in a transparent, reliable, efficient, and generic way. JDO was originally intended as a teaching device to assess design parameters for distributed objects. This project focuses on porting JDO, which is implemented in Java on Sun's JDK, to C# on Microsoft's .NET. On one hand, it builds an infrastructure in C# that …

Go to article

A Dynamic Web Server Based Appointment Calendar, Jane Zhong Jan 2006

A Dynamic Web Server Based Appointment Calendar, Jane Zhong

Theses

The most advanced server side technology, Microsoft .NET Framework and Microsoft SQL, will be used to develop a dynamic web server based calendar to handle appointment and meeting scheduling. It s a new calendar in architecture and functions compared to the traditional calendars. The existing commercial calendars, such as Outlook calendar, iCal and MeetingMaker, have a common weakness: unique calendar software should be installed in the user s computer. They are all not web based calendars. Some existing web calendars, like Yahoo calendar, have very limited functions. In this proposal, a web server based calendar is proposed to overcome this …

Go to article

Group Data Communication With M2mi, Kay Cheng Jan 2006

Group Data Communication With M2mi, Kay Cheng

Theses

The Anhinga Project is developing an infrastructure that supports board range of collaborative systems running on small proximal wireless devices in ad-hoc networks. The core of Anhinga Infrastructure is a new method invocation technology called the Many-to-Many Invocation (M2MI). In this technology, every method invocation is broadcasted through the network and all the objects that implement the same method execute it. M2MI is layered on a new network protocol, Many-to-Many Protocol (M2MP), which is designed for broadcasting messages within small wireless devices in Ad hoc network. In this project, I will provide three different design patterns of M2MI-based collaborative systems, …

Go to article

Master's Project Website: A Comparison Of Several Server-Side Technologies, Prabhakaran Nagarajan Jan 2006

Master's Project Website: A Comparison Of Several Server-Side Technologies, Prabhakaran Nagarajan

Theses

Any Graduate student in the Computer Science department at RIT has to complete either a Thesis or Project as part of their degree requirements. A common repository that allows students to browse project / thesis work already undertaken by RIT alumni will help students looking for project ideas or faculty interests. There currently exists a Masters project web site, designed and implemented by Dr. Schreiner using Java servlets. This project aims to select two technologies that are either extensively used, and/or are defining technologies of the future, and re-implement the Masters project website, with the aim of comparing the implementations. …

Go to article

Genetic Music, Ryan Becker Jan 2006

Genetic Music, Ryan Becker

Theses

Algorithmic music composition has long been an active area of research in computer science, but the need for a human element only recently began to be more widely acknowledged. Interactive Evolutionary Computing (IEC), made popular by Karl Sims, effectively solves many high dimension problems, like music composition, involving creative and subjective elements. This work applies several Genetic Algorithm (GA) and Genetic Programming (GP) approaches, inspired by Karl Sims, to algorithmic music composition. The implementation of these IEC algorithms is described and their effectiveness compared.

Go to article

Web-Based 3-D Theatre Seating Charts And Ticket Reservation Application, Patrick Henstebeck Jan 2006

Web-Based 3-D Theatre Seating Charts And Ticket Reservation Application, Patrick Henstebeck

Theses

Seating charts for theatres and stadia have always been an important part of buying tickets to a staged event, despite offering little information about the view from any particular seat. While the internet has increased the potential to provide this information, most official arena websites and online ticket brokers still only provide the standard two-dimensional diagram whose detail is limited to the approximate location of each section and which offers no guidance as to the height or slope of the section, nor any warning of any obstructing objects that would depreciate a seat s true value. The few three-dimensional models …

Go to article

Algorithms For Bounding Folkman Numbers, Jonathan Coles Jan 2006

Algorithms For Bounding Folkman Numbers, Jonathan Coles

Theses

For an undirected, simple graph G, we write G -> (a_1,...,a_k)^v (G -> (a_1,...,a_k)^e) if for every vertex (edge) k-coloring, a monochromatic K_(a_i) is forced in some color i in {1,...,k}. The vertex (edge) Folkman number is defined as F_v(a_1,...,a_k;p) = min{|V(G)| : G -> (a_1,...,a_k;p)^v, K_p not in G} F_e(a_1,...,a_k;p) = min{|V(G)| : G -> (a_1,...,a_k;p)^e, K_p not in G} for p > max{a_1,...,a_k}. Folkman showed in 1970 that these numbers always exist for valid values of p. This thesis concerns the computation of a new result in Folkman number theory, namely that F_v(2,2,3;4)=14. Previously, the bounds stood at 10 <= F_v(2,2,3;4) <= 14, proven by Nenov in 2000. To achieve this new result, specialized algorithms were executed on the computers of the Computer Science network in a distributed processing effort. We discuss the mathematics and algorithms used in the computation. We also discuss ongoing research into the computation of the value of F_e(3,3;4). The current bounds stand at 16 <= F_e(3,3;4) <= 3e10^9. This number was once the subject of an Erd s prize---claimed by Spencer in 1988.

Go to article

Group Key Agreement Protocols With Implicit Key Authentication, Jisoo Kim Jan 2006

Group Key Agreement Protocols With Implicit Key Authentication, Jisoo Kim

Theses

There have been numerous studies performed on secure group communication over unsecured channels such as the Internet and ad-hoc network. Most of the results are focused on cryptographic methods to share secret keys within the group. In the real world, however, we cannot establish an application for group communication without considering authentication of each peer (group member) since the adversary could digitally disguise itself and intrude into the key sharing process without valid membership. Therefore, authentication is an inevitable component for any secure communication protocols as well as peer group communication. In the classical design of group key protocols, each …

Go to article

Electronic Voting System For Rit Student Government Elections, Sungho Maeung Jan 2006

Electronic Voting System For Rit Student Government Elections, Sungho Maeung

Theses

Recent studies argue that traditional voting systems do not encourage increased voter participation due to constraints in time, location, accuracy, and, accessibility. To ensure the rights of a democratic society and to enhance and secure the voting rights of citizens by surpassing all the limitations of the traditional voting system, the development of an electronic voting system is an attractive solution. Research on secure electronic voting systems has been conducted for at least the past two decades. We propose to develop an electronic voting system, called the Rochester Institute of Technology Student Government Election System (SGEES) based on Damgard et …

Go to article

Managing The Acm Programming Contest, Navin Bhaskar Jan 2006

Managing The Acm Programming Contest, Navin Bhaskar

Theses

The Association for Computer Machinery (ACM) conducts an international collegiate programming contest held on an annual basis. Teams compete to solve multiple questions within the allotted six hour duration of the contest. A panel of judges grades the solutions online. The team that answers the maximum questions correctly wins the contest. This application will assist in the process of selection of winners of the programming contest. It will make the process of submission of solutions, and grading of the answers convenient. The ACM application is a Java based and web-enabled application and therefore platform independent.

Go to article

Myth- An Extension To C, Greg Rowe Jan 2006

Myth- An Extension To C, Greg Rowe

Theses

Myth is a programming language that is an extension of C. Myth adds modules, interfaces, tuple returns, and bit sets. These features are very helpful in nearly any programming environment. The Myth language as a whole is a good choice for embedded systems where resources are limited. Modules help organize code into logical groupings. Interfaces provide an automated mechanism to write reusable code. Tuple returns provide a simple mechanism for returning multiple values from a function. Bitsets make it easy to define logical groups of bit flags. Bisets are particularly useful in code that interfaces with hardware. The advantage of …

Go to article

N-Body Visualizations, William Mclaughlin Jan 2006

N-Body Visualizations, William Mclaughlin

Theses

In the age of technology and information, data calculations and visualizations are key to the communication and understanding of the world in which we live. It is sometimes difficult to display data in a way to make it clear and understanding, or is difficult to calculate the data to be displayed. The N-body problem has elements of both. The N-body problem is a set of N particles representing stars that move in response to the gravitational force generated by the N-1 other particles. There have been many attacks to this problem. The GRAPEcluster Project of RIT has developed software and …

Go to article

M2mimud, Robert Whitcomb Jan 2006

M2mimud, Robert Whitcomb

Theses

M2MIMud is a simple MUD (multi-user dungeon) type game that is designed to run on an ad hoc network of devices without the presence of any central server. It runs over Many-to-Many Invocation (M2MI), a distributed object system API that uses broadcasts and handles, rather than IP addresses, to communicate. Most existing multi-user computer games rely on a client-server architecture with a central server storing and maintaining the state of the game. In contrast, M2MIMud runs on an ad hoc network of devices with no central server. This paper describes M2MI and its use for serverless multi-user applications, discusses the …

Go to article

Ad Hoc Collaborative Photo Sharing With A Tuple Board, Yutao Cheng Jan 2006

Ad Hoc Collaborative Photo Sharing With A Tuple Board, Yutao Cheng

Theses

The tuple board is a new distributed computing paradigm based on the tuple space concept invented by Gelernter in 1985. Designed for ad hoc mobile wireless networks, tuple board is a serverless architecture that differs from the original client-server paradigm proposed in tuple space. In this project, Tuple Board, a tuple board implementation has been developed based on the M2MP protocol. Comparing to the previous implementation in Bondada's work, the following improvements have been made: (1) M2MP, instead of M2MI, is used as the underlying network protocol for data communication, (2) notification is available in the tuple board implementation for …

Go to article

Integrating Database And Data Stream Systems, Rutul Mashruwala Jan 2006

Integrating Database And Data Stream Systems, Rutul Mashruwala

Theses

Traditionally, Database systems are viewed as passive data storage. Finite data sets are stored in traditional Database Systems and retrieved when needed. But applications such as sensor networks, network monitoring, retail transactions, and others, produce infinite data sets. A new system is under research and development, known as Data Stream Management System (DSMS), to deal with the infinite data sets. In DSMS, Data stream is a continuous source of sequential data. In Object-Oriented languages, like C/C++ and Java, the concept of stream does exist. The stream is viewed as a channel to which data is being inserted at one end …

Go to article

Ad Hoc File System, Swarup Datta Jan 2006

Ad Hoc File System, Swarup Datta

Theses

Ad hoc File System (AFS) is middleware for peers wishing to share and access data in ad hoc fashion. AFS permits processes to export local files and import files shared by other processes. Communication between hosts is facilitated by the M2MI Framework, a novel paradigm for building collaborative systems. The API provided by AFS allows for data to be exported to the middleware, which become accessible to hosts running AFS. Interested peers can import exported data to their local system, allowing uniform access to local and remote files. Peers can also unexport and unimport data undoing effects of export and …

Go to article

Faculty Scheduling Using Genetic Algorithms, Kevin Soule Jan 2006

Faculty Scheduling Using Genetic Algorithms, Kevin Soule

Theses

The problem of developing a class schedule for a faculty has been proven to be NP-complete. Therefore when the schedule is large enough, finding just one feasible solution can be impossible for any direct search algorithm within a reasonable time. This project is geared toward investigating the possibility of using genetic-based algorithms to solve faculty scheduling problems of 100 courses or larger quickly. Multiple versions of genetic algorithms and heuristics are tested. Many parameter levels for these algorithms are optimized for fastest convergence.

Go to article

Efficient Encryption On Limited Devices, Roderic Campbell Jan 2006

Efficient Encryption On Limited Devices, Roderic Campbell

Theses

Encryption algorithms have been used since the dawn of time to ensure secure communication over insecure communication channels. Once a secret encryption key is established and as long as the key remains secret, two parties can communicate freely over open channels. The question of how to obtain such a secret key is a large dilemma. Many methods of obtaining such keys have been tried from the most basic form of a one-on-one encounter to more advanced techniques like Diffie-Hellman. This paper compares three versions of the Diffie-Hellman key exchange protocol -- using arithmetic in the field of integers modulo a …

Go to article

Study Of Visualizations For N-Body Stellar Models, Christian Gray Jan 2006

Study Of Visualizations For N-Body Stellar Models, Christian Gray

Theses

The visualization of large datasets is invaluable to the advancement of scientific knowledge. N-Body problems produced large dataset that present several challenges to visualization. These challenges include over-plotting and self-obscuring data. Using the general visualization framework, Spiegel, five different visualization techniques are explored to solve these problems: slicing, projection, 3D projection, 3D density shells, and direct volume rendering. Each visualization looks to solve the problem in a slightly different manner while all have kernel density estimation as their starting point. While none of the visualization is ground breaking or perfectly solves the problems they do provide new insight allowing for …

Go to article

Hf-Dsr: Dynamic Source Routing For High Frequency Radio Networks, Michael Stringer Jan 2006

Hf-Dsr: Dynamic Source Routing For High Frequency Radio Networks, Michael Stringer

Theses

HF-DSR is an ad hoc routing protocol designed to operate efficiently over high frequency (HF) radio networks. Ad hoc routing protocols allow networks to provide dynamic routing between endpoints. In contrast, static routing schemes require networks to be configured with potential routes in advance. As such, ad hoc routing mechanisms can compensate for unanticipated factors such as radio frequency (RF) interference or node mobility. HF-DSR is largely based on Dynamic Source Routing (DSR), a level 3 ad hoc networking protocol that emits network control information on demand. HF-DSR incorporates portions of DSR which minimize the quantity of control information transmitted. …

Go to article

Routing In Anhinga, Aakash Chauhan Jan 2006

Routing In Anhinga, Aakash Chauhan

Theses

Anhinga project with Many-to-Many Protocol (M2MP) takes fundamentally different approach to resolve dynamic network topology in ad hoc networks. Instead of trying host-address based networking and routing to make work in ad hoc network environment, M2MP removes device address and groups. All messages goes to all devices within proximal area and each device decides whether and how to process the message based on message s content. [1] This project expands on this infrastructure by delivering these messages beyond sender device s broadcast range. The project implements Dynamic Source Routing (DSR) protocol based controlled flooding techniques. It also provides functionality for …

Go to article

Web Based Monitoring System In Wireless Sensor Networks, Kanishk Panwar Jan 2006

Web Based Monitoring System In Wireless Sensor Networks, Kanishk Panwar

Theses

Goal of the project is to develop a scalable web application to monitor a wireless sensor network. Wireless sensor network, an upcoming technology, is comprised of multiple data sensors that send back packets of information back to the base station. The sensor network runs on a real time operating system called TinyOS and the application is implemented using Moteiv Telos Revision B wireless sensors. The web application collects the reading from the base station and generates graphical representation of the readings for the front end and creates PDF reports when readings are not within defined thresholds. This application incorporates various …

Go to article

First Prev Next Last