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

Digital Commons Network™

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

PDF

2006

Discipline
Institution
Keyword
Publication
Publication Type

Articles 931 - 959 of 959

Full-Text Articles in Entire DC Network

Mentoring In The Department Of Access Services At The National Technical Institute For The Deaf, Gayle Macias Jan 2006

Mentoring In The Department Of Access Services At The National Technical Institute For The Deaf, Gayle Macias

Theses

Not provided.

Go to article

Recommendations For A Comprehensive Identity Theft Victimization Survey Framework And Information Technology Prevention Strategies, Sara Berg Jan 2006

Recommendations For A Comprehensive Identity Theft Victimization Survey Framework And Information Technology Prevention Strategies, Sara Berg

Theses

While steps have been undertaken in the last five years to better understand the problem of identity theft, there has been little research done in the areas of high tech crime victim profiling and prevention. Most studies focus on victim demographics without examining ways in which the victimization may have been facilitated technologically. Attempts to look at precipitating behaviors in the context of victimization are limited. As such, a weak empirical base exists on which to generate additional research and potential solutions to identity theft victimization. This thesis bridges previous identity theft research with other empirical studies in order to …

Go to article

Raster To Vector Conversion: Creating An Unique Handprint Each Time, William Dibacco Jan 2006

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 …

Go to article

Parent Leadership Initiative, Evanna M. Disalvo Jan 2006

Parent Leadership Initiative, Evanna M. Disalvo

Theses

Parental involvement in urban public schools is a vital part of any strategic plan to improve student achievement and close the achievement gap, but many parents lack the leadership skills that would enable them to spearhead activities that positively affect school or neighborhood climate and support teamwork with teachers and school administration. My project was to familiarize parents with Kouzes and Posner's five practices of exemplary leadership from The Leadership Challenge using family films to demonstrate leadership, give the parents practice in writing SMART objectives to develop a plan of action, and coach them in implementing a project directed at …

Go to article

Differential Cryptanalysis Of Substitution Permutation Networks And Rijndael-Like Ciphers, Gnanasekaran Sakthivel Jan 2006

Differential Cryptanalysis Of Substitution Permutation Networks And Rijndael-Like Ciphers, Gnanasekaran Sakthivel

Theses

A block cipher, in general, consist of several repetitions of a round transformation. A round transformation is a weak block cipher which consists of a nonlinear substitution transformation, a linear diffusion transformation and a key mixing. Differential cryptanalysis is a well known chosen plaintext attack on block ciphers. In this project, differential cryptanalysis is performed on two kinds of block ciphers: Substitution Permutation Networks(SPN) and Rijndael-like Ciphers. In order to strengthen a block cipher against differential attack, care should be taken in the design of both substitution and diffusion components and in the choice of number of rounds. In this …

Go to article

Molecular Viewer Using Spiegel, Pavani Baddepudi Jan 2006

Molecular Viewer Using Spiegel, Pavani Baddepudi

Theses

Study of nucleic acids and proteins has evoked great interest for its role in research involving areas such as human genome and drug design. Understanding the core structure and behavior of these protein molecules requires reading and analyzing large amounts of data about atoms derived from a plethora of experiments. In recent years, computer graphics has gained popularity for its ability to translate these large datasets into three dimensional structures providing easy visualization. This project has implemented one such 3-D molecular viewer to display different models of molecules and study their properties. The project was developed in Java3D using the …

Go to article

Polynomial Time Primality Testing Algorithm, Takeshi Aoyama Jan 2006

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 …

Go to article

Security In An Ad Hoc Network Using Many-To-Many Invocation, Jefferson Tuttle Jan 2006

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 …

Go to article

An Application To Create Problem-Specific Document Object Models For Xml, Liangxiao Zhu Jan 2006

An Application To Create Problem-Specific Document Object Models For Xml, Liangxiao Zhu

Theses

XML is widely used today. How to parse XML documents and manipulate XML data are very important tasks and popular topics in the software industry. There are several ways of handling XML data today. One of them is to turn an XML document into a tree structure of data. The most popular API of this model is W3C Document Object Model (DOM). But what DOM provides is a generic data model rather than a problem-specific model, which makes it complicated and inefficient. And in many cases, programmers don't use the generic data model. More often, they need an object model …

Go to article

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

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

Horn Formula Minimization, Tom Chang Jan 2006

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 …

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

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

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

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

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

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

Visualizing The Inner Structure Of N-Body Data, Edward Dale Jan 2006

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 …

Go to article

Progress On Probabilistic Encryption Schemes, Kert Richardson Jan 2006

Progress On Probabilistic Encryption Schemes, Kert Richardson

Theses

The purpose of this master's project is to study different probabilistic cryptography schemes. The older probabilistic schemes, Goldwasser-Micali and Blum-Goldwasser, will only be covered briefly for a historical perspective. Several new and promising schemes have appeared in the last 7 years, generating interest. I will be examining the Paillier and Damgard-Jurik schemes in depth. This report explains the mathematics behind the schemes along with their inherent benefits, while also suggesting some potential uses. Details are given on how I optimized the algorithms, with special emphasis on using the Chinese Remainder Theorem (CRT) in the Damgard-Jurik algorithm as well as the …

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

Adjusting The Margins: Building Bridges Between Deaf And Hearing Cultures Through Performance Arts, Luane Davis Haggerty Jan 2006

Adjusting The Margins: Building Bridges Between Deaf And Hearing Cultures Through Performance Arts, Luane Davis Haggerty

Theses

This study addresses a gap in scholarship on leadership styles in the Deaf community. There is an invisible style of leadership differing from the mainstream culture that has not been previously addressed in the literature at any depth. My study was composed of three interlocking parts in a sequence that constitutes the practice of anthropology: fieldwork, analysis, and presentation. The foundation for my fieldwork was an “archeology of the structure of the perceived world” (Merleau-Ponty), using the holding environment of the rehearsal process and the structural process of an acting technique called Del-Sign. Del- Sign is a fusion acting style …

Go to article

Electrophoretic Deposition Of Ferrite, Cody Washburn Jan 2006

Electrophoretic Deposition Of Ferrite, Cody Washburn

Theses

The ability to integrate a material with a high permeability on chip, allows for magnetically coupled circuits and structures to be designed and incorporated along side CMOS circuitry. Devices ranging from A.C. transformers to magnetically driven MEMS structures can be designed and fabricated. Desirable characteristics of magnetic cores for integrated inductors and transformers are first high saturation flux in order to obtain high saturation current; high permeability to obtain high inductance; high resistivity to reduce eddy current loss at high frequencies and compatible deposition and patterning processes. High frequency magnetic materials are oxide based ceramics and are therefore difficult to …

Go to article

Object-Oriented Lr(1) Parser Generation, Christopher Luckett Jan 2006

Object-Oriented Lr(1) Parser Generation, Christopher Luckett

Theses

The LR parser has been around for a long time, and its workings, especially with respect to table compaction and use of the lookahead sets, have puzzled students who are new to the area of study. The aim of this project therefore is to provide an object oriented approach and discoverable algorithm to ease the difficulty of mastering these concepts. This will be accomplished by distributing the table interpreter across objects whose inter-relationships create an analogue to the state table. Hopefully this will provide a greater degree of readability and ease of trace throughout the parser generation process.

Go to article

Development Of Deep Submicron Cmos Process For Fabrication Of High Performance 0.25 Nm Transistors, Michael Aquilino Jan 2006

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 …

Go to article

Superfund, Hedonics, And The Scales Of Environmental Justice, Douglas S. Noonan, Brett M. Baden, Rama Mohana Turaga Dec 2005

Superfund, Hedonics, And The Scales Of Environmental Justice, Douglas S. Noonan, Brett M. Baden, Rama Mohana Turaga

Douglas S. Noonan

The environmental justice (EJ) movement now occupies a prominent position in environmental policy. EJ is a core principle for thousands of grassroots environmental organizations, is the subject of a Presidential executive order and an office in the EPA, and recently served to frame how the nation viewed the tragic aftermath of Hurricane Katrina. This paper contributes to the research on environmental equity by (a) improving on traditional environmental justice research by incorporating results from economic analyses, and (b) presenting new evidence on the distributional equity of Superfund site locations at multiple scales. Choosing the correct spatial scale for analysis continues …

Go to article

First Prev