Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Thesis (12)
- Deaf students (7)
- Visualization (6)
- M2MI (5)
- Ad hoc networking (4)
-
- Distributed systems (4)
- Serverless systems (4)
- ASL (3)
- Complementary (3)
- Computer engineering (3)
- Cryptography (3)
- Design and construction (3)
- Genetic algorithms (3)
- Metal oxide semiconductors (3)
- Scheduling (3)
- Teaching (3)
- .NET (2)
- Ad hoc networks (2)
- Algorithms (2)
- Art (2)
- Audio (2)
- CMOS (2)
- Communication (2)
- Computational complexity (2)
- Computer animation (2)
- Database (2)
- Diffie-Hellman (2)
- ECC (2)
- Field programmable gate arrays (2)
- Future (2)
Articles 151 - 167 of 167
Full-Text Articles in Entire DC Network
Exploring The Topology Of Small-World Networks, Min Hu
Exploring The Topology Of Small-World Networks, Min Hu
Theses
Complex networks have been studied for a long time in order to understand various real-world complex systems around us. Complex systems, such as the WWW, the movie-actor network, social networks and neural networks, are systems made of many non-identical elements connected by diverse interactions. The study of the network topology is one of important issues on the way of exploring such systems, because the structure always affects the system function. Traditionally, these systems have been modeled as either completely ordered graphs or completely random graphs. Until recently, some surprising empirical results in the field of complex networks, like 19 clicks …
Emotion In Flocking, Katherine Law
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, …
R(W5 , K5) = 27, Joshua Stinehour
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 …
Group Data Communication With M2mi, Kay Cheng
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, …
N-Body Visualizations, William Mclaughlin
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 …
Ad Hoc File System, Swarup Datta
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 …
Routing In Anhinga, Aakash Chauhan
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 …
Family Tree Manager, Catherine Sullivan
Family Tree Manager, Catherine Sullivan
Theses
Many people are interested in learning about their family history. Discovering who has come before us can help us learn more about who we are, and possibly why we are the way we are. Over the years, more and more people have turned to software products to help them build and manage their family tree information. These products allow users to easily enter and retrieve the information, as well as provide graphical representations without the arduous task of drawing by hand. In addition, some manufacturers have made agreements with genealogy search services, and integrated the process of searching for relatives …
Implementation Of Image Processing Approach To Translation Of Asl Finger-Spelling To Digital Text, Divya Mandloi
Implementation Of Image Processing Approach To Translation Of Asl Finger-Spelling To Digital Text, Divya Mandloi
Theses
This thesis describes the ongoing development of an image processing technique for the translation of American Sign Language (ASL) finger-spelling to text. The present analysis is the phase one of a broader project, the Sign2 Project, which is focused on a complete technological approach to the translation of ASL to digital audio and/or text. The methodology adopted in this analysis employs a gray-scale image processing technique to convert the American Sign Language finger-spelling to text. It attempts to process static images of the subject considered, and then matches them to a statistical database of pre-processed images to ultimately recognize the …
Mentoring In The Department Of Access Services At The National Technical Institute For The Deaf, Gayle Macias
Mentoring In The Department Of Access Services At The National Technical Institute For The Deaf, Gayle Macias
Theses
Not provided.
Raster To Vector Conversion: Creating An Unique Handprint Each Time, William Dibacco
Raster To Vector Conversion: Creating An Unique Handprint Each Time, William Dibacco
Theses
When a person composes a document by hand, there is random variability in what is produced. That is, every letter is different from all others. If the person produces seven a s, none will be the same. This is not true when a computer prints something. When the computer produces seven a s they are all exactly the same. However, even with the variability inherent in a person s handwriting, when two people write something and they are compared side by side, they often appear as different as fonts from two computer families. In fact, if the two were intermixed …
Polynomial Time Primality Testing Algorithm, Takeshi Aoyama
Polynomial Time Primality Testing Algorithm, Takeshi Aoyama
Theses
In August 2002, three Indian researchers, Manindra Agrawal and his students Neeraj Kayal and Nitin Saxena at the Indian Institute of Technology in Kanpur, presented a remarkable algorithm (the AKS algorithm) in their paper "PRIMES is in P." It is a deterministic polynomial-time algorithm that determines whether an input number is prime or composite. No such algorithm was known so far and it has fundamental meaning for complexity theory. This project is centered around the AKS algorithm from the "PRIMES is in P" paper. The objectives are both experiments with the AKS algorithm and theorems and lemmas showing the correctness …
Security In An Ad Hoc Network Using Many-To-Many Invocation, Jefferson Tuttle
Security In An Ad Hoc Network Using Many-To-Many Invocation, Jefferson Tuttle
Theses
There is an increasing need to secure electronic communication. This need is being met on workstations and servers, which have large amounts of memory, and a dedicated network connection. Securing communication in mobile devices is a relatively new research area, and has different requirements than workstations and servers. This project attempts to address these new requirements by incorporating security into the Many-to-Many Invocation (M2MI) library developed at the Rochester Institute of Technology (RIT). Specifically, this project addresses adding encryption and decryption of M2MI method invocations using session keys. It also addresses the methods of establishing and maintaining session keys based …
Managing The Acm Programming Contest, Navin Bhaskar
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.
Horn Formula Minimization, Tom Chang
Horn Formula Minimization, Tom Chang
Theses
Horn formulas make up an important subclass of Boolean formulas that exhibits interesting and useful computational properties. They have been widely studied due to the fact that the satisfiability problem for Horn formulas is solvable in linear time. Also resulting from this, Horn formulas play an important role in the field of artificial intelligence. The minimization problem of Horn formulas is to reduce the size of a given Horn formula to find a shortest equivalent representation. Many knowledge bases in propositional expert systems are represented as Horn formulas. Therefore the minimization of Horn formulas can be used to reduce the …
Visualizing The Inner Structure Of N-Body Data, Edward Dale
Visualizing The Inner Structure Of N-Body Data, Edward Dale
Theses
N-body simulations produce a large amount of data that must be visualized in order to extract interesting features. This data consists of thousands of particles, each with a number of properties such as velocity, mass, and acceleration, that are persisted across hundreds of time steps. Rendering these points using traditional means quickly leads to a image that is satu- rated because the number of particles is greater than the number of pixels available. Volume rendering, and particularly splatting, seeks to remedy this and allows one to see inside the volume and discern the inner structure. The definition of inner structure …
Development Of Deep Submicron Cmos Process For Fabrication Of High Performance 0.25 Nm Transistors, Michael Aquilino
Development Of Deep Submicron Cmos Process For Fabrication Of High Performance 0.25 Nm Transistors, Michael Aquilino
Theses
An advanced process for fabrication of 0.25 μm CMOS transistors has been demonstrated. This process is designed for transistors with Lpoly = 0.25 μm and Leffective = 0.2 um on 150 mm (6”) silicon wafers. Devices with Leffective of 0.2 um and smaller have been tested and found operational. A 0.25 um NMOS transistor with drain current of 177 μA/μm at VG=VD=2.5 V and a PMOS transistor with drain current of 131 μA/μm at VG=VD=-2.5 V are reported. The threshold voltages are 1.0 V for the NMOS and -0.735 V for the PMOS transistors. These 0.25 um NMOS and PMOS …