Digital Commons Network^™

Jini Distributed Key Exchange And File Transfer Service With Digital Signatures, Kevin Ligozio

Theses

This thesis compares security algorithms for the Jini Networking Technology. The first method is to add security at the infrastructure level, and is the method chosen by the Jini Community in Jini version 2.0. The second method is the original research portion of this thesis, and explores adding security in the application layer. In order to explore the application layer security, the thesis includes four components. First, we investigate and implement some cryptographic algorithms. Specifically, we use a Java Cryptography Extension (JCE) Provider containing the Diffie-Hellman Key Agreement algorithm and the RSA Digital Signature Algorithm. Second, we perform a novel …

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 …

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- …

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 …

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 …

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.

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 …

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.

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.

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 …

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 …

A Charge Control Model For Iii-V Hemts Using A Self-Consistent Numerical Solution Of The Schrodinger And Poisson Equations, Melissa Manney

Theses

"With the increasing demand for smaller devices that can perform faster and more reliably there is a need to explore options that allow for this combination in spite of the fact that smaller size tends to lead to a reduction in reliability and overall device performance. High electron mobility transistors (HEMTs) have proven superior to MOSFETS and BJTs in the areas of voltage and temperature ranges in which they can operate as well as their high breakdown fields, carrier density and velocity saturation. Studying HEMTs and understanding their constraints and how they respond to variations in their makeup and in …

Indium Tin Oxide (Ito) Deposition, Patterning And Schottky Contact Fabrication, Jianming Zhou

Theses

As a transparent conductive material, indium tin oxide (ITO) has been utilized as electrodes in liquid crystal displays, solar cells, heat reflecting films and gas sensors. In general, the desired properties are high conductance and transmission. However, due to the complexity of ITO, the film properties strongly depend on the deposition processes. In this study, the deposition conditions for ITO film were optimized to get both high conductivity and transmission. The emphasis was on investigating the effects of various deposition parameters, such as oxygen partial pressure, total gas flow, annealing conditions and power. These are the most critical parameters for …

Parent Perceptions Of School Climate And Its Impact On Their Child's School Performance, Danielle Malinowski

Theses

This study compared the relationship of student and parent perceptions of school climate to the student's academic performance and school problem behaviors (disciplinary referrals, unexcused absences, and tardiness). A sample of students (n=531), grades 7-12, completed the School Climate Survey (Haynes et al., 1996). Additional information was obtained regarding each student's academic performance and school problem behaviors. A randomly selected sample of parents were sent the School Climate Survey,

Parent Edition and were asked to voluntarily return them (n=45). Correlation results found no significant relationship between parent and student perceptions of school climate. A significant relationship was found between Parent …

Dynamic Analysis Of Hollow Tapered Isotropic And Composite Shafts Using Finite Element Techniques, Lindsay Larocca Parslow

Theses

Finite element techniques were used to analyze the dynamic characteristics of hollow tapered isotropic and composite shafts. Mathematical models of hollow tapered isotropic and composite shafts were developed, which were then discretized using Galerkin's Method to produce standard vibration equations. The solutions to the standard vibration equations were coded into two com puter programs, which can be used to calculate the torsional dynamic characteristics of an isotropic rotor system, and the coupled axial-torsional dynamic characteristics of a composite shaft. Several examples using each computer program are presented, illustrating their ability to predict natural frequencies and mode shapes of torsional systems.

The Consideration Of Camera Testing For Accurate Color Reproduction Within Museums And Institutions, Natalie Russo

Theses

The need for color accurate digital images for fine art reproduction is a reality faced by art museums and institutions around the world. It is the goal of most institutions to replace old, sometimes used and abused, transparency archives with digital image archives; many institutions have already begun this work. A number of different imaging systems with varied workflows, some idiosyncratic, are being used for this work. There is, therefore, an urgent need for the development and sharing of working methods that will ensure efficient, consistent, and color accurate results. These workflows must use camera systems to their fullest capability. …

Graph Reconstruction Numbers, Brian Mcmullen

Theses

The Reconstruction Conjecture is one of the most important open problems in graph theory today. Proposed in 1942, the conjecture posits that every simple, finite, undirected graph with more than three vertices can be uniquely reconstructed up to isomorphism given the multiset of subgraphs produced by deleting each vertex of the original graph. Related to the Reconstruction Conjecture, reconstruction numbers concern the minimum number of vertex deleted subgraphs required to uniquely identify a graph up to isomorphism. During the summer of 2004, Jennifer Baldwin completed an MS project regarding reconstruction numbers. In it, she calculated reconstruction numbers for all graphs …

Relationship Of Human Figure Drawing With Executive Functioning And Achievement, Julie M. Miller

Theses

The purpose of the study was to investigate the relationship between aspects of children’s human figure drawings to their executive functioning and academic achievement. Participants consisted of 80 third and fourth graders, ages 8 to 10 years, along with their parents. Correlational analysis showed no relationship between the developmental scoring of the Goodenough-Harris or Koppitz with measures of executive functioning, as measured by the Behavior Rating Inventory of Executive Functioning (BRIEF; Gioia, Isquith, Guy, & Kenworthy, 2000) and the Cognitive Assessment System (CAS; Naglieri & Das, 1997). However, Koppitz’s emotional indicators were significantly correlated with all aspects of BRIEF and …

Metaheuristics And Combinatorial Optimization Problems, Gerald Skidmore

Theses

This thesis will use the traveling salesman problem (TSP) as a tool to help present and investigate several new techniques that improve the overall performance of genetic algorithms (GA). Improvements include a new parent selection algorithm, harem select, that outperforms all other parent selection algorithms tested, some by up to 600%. Other techniques investigated include population seeding, random restart, heuristic crossovers, and hybrid genetic algorithms, all of which posted improvements in the range of 1% up to 1100%. Also studied will be a new algorithm, GRASP, that is just starting to enjoy a lot of interest in the research community …

Extraction And Interaction Analysis Of Foreground Objects In Panning Video, Raja Jain

Theses

In this work, moving foreground objects are extracted from video. The video camera can be either stationary or panning. The motion information extracted from consecutive frames of video is used for object segmentation, and an appearance model of the moving object is created. No assumptions are made concerning the object model, resulting in segmented objects of varying shapes and sizes. Finally, relationships between objects in the image are evaluated toward the goal of higher level understanding of videos.

A Biologically Plausible System For Detecting Saliency In Video, David Burlone

Theses

Neuroscientists and cognitive scientists credit the dorsal and ventral pathways for the capability of detecting both still salient and motion salient objects. In this work, a framework is developed to explore potential models of still and motion saliency and is an extension of the original VENUS system. The early visual pathway is modeled by using Independent Component Analysis to learn a set of Gabor-like receptive fields similar to those found in the mammalian visual pathway. These spatial receptive fields form a set of 2D basis feature matrices, which are used to decompose complex visual stimuli into their spatial components. A …

Application Of Shifted Delta Cepstral Features For Gmm Language Identification, Jonathan Lareau

Theses

Spoken language identifcation (LID) in telephone speech signals is an important and difficult classification task. Language identifcation modules can be used as front end signal routers for multilanguage speech recognition or transcription devices. Gaussian Mixture Models (GMM's) can be utilized to effectively model the distribution of feature vectors present in speech signals for classification. Common feature vectors used for speech processing include Linear Prediction (LP-CC), Mel-Frequency (MF-CC), and Perceptual Linear Prediction derived Cepstral coefficients (PLP-CC). This thesis compares and examines the recently proposed type of feature vector called the Shifted Delta Cepstral (SDC) coefficients. Utilization of the Shifted Delta Cepstral …

When We Hold No Truths To Be Self-Evident: Truth, Belief, Trust, And The Decline In Trials, Lisa Blomgren Bingham

Journal of Dispute Resolution

This article will explore the relationship between the "vanishing trial" and the changing ways in which we think about truth. First, it briefly overviews how we think about knowing what is true: epistemology and this history of philosophy. Second, it looks to the philosophy of science and history of social science for new theories and methods about how we ascertain and construct meaning and what we believe to be real and true. Third, it examines our changing relation to information in the face of the "information explosion": information is the evidence upon which we reach a conclusion about what is …

The Bender Ii And Its Relationship With Executive Functioning And Academics, Katharine A. Warsinske

Theses

The Bender-Gestalt Test and tests of executive functioning have been linked to academic achievement. The purpose of this study was to examine the validity of the Bender II as compared to Koppitz's Developmental Scoring System (DSS), as well as to determine the relationship between the Bender II and executive functioning. A total of 82 children participated in this study. A significant correlation was found between the DSS and the Bender II, with the Bender II mean approximately 10 standard score points higher than the DSS. The Bender II was also significantly correlated with more scales on the BRIEF than the …

Streak Detection In Mottled And Noisy Images, Hector Santos

Theses

This thesis describes an algorithm for detecting streaks in printed images using adaptive window-based image projections and maximization of mutual information. To this effect, projections are computed across the entire image at different window sizes. The traces collected from the projections are correlated using maximization of mutual information to pinpoint streak locations and widths using a peak detection algorithm. Finally, for a given peak, the window size is changed adaptively to identify and locate the intensity and length of the corresponding streak while maximizing signal to noise ratio. Results on synthetic and real-life images are provided to demonstrate the effectiveness …

The Work Of Fred Troller: An Evaluative Study Of A Graphic Designer, Tara Markert

Theses

This thesis will provide a process to help graphic design scholars and historians conduct an evaluation of a designer whose work has been rarely documented within a specific design style. Through implementation of this model of research and evaluation, graphic design scholars will not only be able to identify that designer's philosophy and personal style, they will also recognize the value of studying within a specific style of graphic design. This evaluation process includes placing the work of the rarely documented designer beside the work of pioneers in this stylistic idiom in order to highlight similarities of thought, process, form …

Optimal Design Of Ink Spectra For Multiple-Ink Color Reproduction, Yongda Chen

Theses

Conventional four-color printing systems are limited by a relative small color gamut, poor color constancy, and a high degree metamerism. In this dissertation, these problems were addressed by increasing the ink number, optimizing the spectral ink curves, and the lookup tables for multiple-ink printing. First, a computer simulation was performed to investigate the optimum combinations of different ink number to maximize the color gamut for halftoning printing. By analyzing the color gamuts achieved by real ink sets and virtual ink sets, the conclusions were drawn that the color gamut can be improved by increasing ink number and optimizing spectral ink …

Photographic Strategies For Graphic Design Problem Solving, Suthida Sakulsurarat

Theses

Graphic design and photography are both forms of visual communication although they are separate disciplines. This thesis will explore the potential benefits of applying useful approaches in photography and demonstrating their potential for solving graphic design problems. ... The main goal of this project is to outline the possibilities of bringing principles of photographic approaches into graphic design. This thesis attempts to help designers understand that two different disciplines can support each other to provide a wider range of opportunities. In addition, the thesis is designed to enlighten, challenge and inspire designers. To accomplish the thesis, the designer will research …

Preparation For Radiological Disasters: A Radiation Effects Epidemiological Database, Martha S. Raj

Theses

Not Included

Plane Elasticity Using Airy Stress Functions, Matthew David Roman

Theses

Given a three dimensional solid element in a state of plane stress or plane strain with conservative body forces, the stress components are equal to the appropriate second order partial derivatives of a bi-harmonic function, ϕ , called an Airy Stress Function. It follows that the stress components automatically satisfy the equilibrium conditions.

The function ϕ depends on both the geometry of the body and the loading, which leaves infinite possible stress functions to be developed. As thesis work, I have researched and collected currently existing Airy Stress Functions, made plots of thier stress fields in order to gain a …