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

Computer Sciences Commons™

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

Theses and Dissertations

Discipline
Institution
Keyword
Publication Year
File Type

Articles 2071 - 2100 of 2733

Full-Text Articles in Computer Sciences

Trust Negotiation For Open Database Access Control, Paul A. Porter May 2006

Trust Negotiation For Open Database Access Control, Paul A. Porter

Theses and Dissertations

Hippocratic databases are designed to protect the privacy of the individuals whose personal information they contain. This thesis presents a model for providing and enforcing access control in an open Hippocratic database system. Previously unknown individuals can gain access to information in the database by authenticating to roles through trust negotiation. Allowing qualified strangers to access the database increases the usefulness of the system without compromising privacy. This thesis presents the design and implementation of two methods for filtering information from database queries. First, we extend a query modification method for use in an open database system. Second, we introduce …

Go to article

No Free Lunch, Bayesian Inference, And Utility: A Decision-Theoretic Approach To Optimization, Christopher Kenneth Monson Apr 2006

No Free Lunch, Bayesian Inference, And Utility: A Decision-Theoretic Approach To Optimization, Christopher Kenneth Monson

Theses and Dissertations

Existing approaches to continuous optimization are essentially mechanisms for deciding which locations should be sampled in order to obtain information about a target function's global optimum. These methods, while often effective in particular domains, generally base their decisions on heuristics developed in consideration of ill-defined desiderata rather than on explicitly defined goals or models of the available information that may be used to achieve them. The problem of numerical optimization is essentially one of deciding what information to gather, then using that information to infer the location of the global optimum. That being the case, it makes sense to model …

Go to article

Clustering Of Database Query Results, Kristine Jean Daniels Apr 2006

Clustering Of Database Query Results, Kristine Jean Daniels

Theses and Dissertations

Increasingly more users are accessing database systems for interactive and exploratory data retrieval. While performing searches on these systems, users are required to use broad queries to get their desired results. Broad queries often result in too many items forcing the user to spend unnecessary time sifting through these items to find the relevant results. This problem, of finding a desired data item within many items, is referred to as "information overload". Most users experience information overload when viewing these database query results. This thesis shows that users information overload can be reduced by clustering database query results. …

Go to article

An Interactive Relaxation Approach For Anomaly Detection And Preventive Measures In Computer Networks, Garrick A. Bell Apr 2006

An Interactive Relaxation Approach For Anomaly Detection And Preventive Measures In Computer Networks, Garrick A. Bell

Theses and Dissertations

It is proposed to develop a framework of detecting and analyzing small and widespread changes in specific dynamic characteristics of several nodes. The characteristics are locally measured at each node in a large network of computers and analyzed using a computational paradigm known as the Relaxation technique. The goal is to be able to detect the onset of a worm or virus as it originates, spreads-out, attacks and disables the entire network. Currently, selective disabling of one or more features across an entire subnet, e.g. firewalls, provides limited security and keeps us from designing high performance net-centric systems. The most …

Go to article

A Selective Approach To Bandwidth Overbooking, Feng Huang Mar 2006

A Selective Approach To Bandwidth Overbooking, Feng Huang

Theses and Dissertations

Overbooking is a technique used by network providers to increase bandwidth utilization. If the overbooking factor is chosen appropriately, additional virtual circuits can be admitted without degrading quality of service for existing customers. Most existing implementations use a single factor to accept a linear fraction of traffic requests. High values of this factor may cause the degradation of quality of service whereas low overbooking factors will result in underutilization of bandwidth. Network providers often select overbooking factors based only on aggregate average virtual circuit utilization. This paper proposes a selective overbooking scheme based on trunk size and usage profile. Experiments …

Go to article

User Datagram Protocol With Congestion Control, Spencer L. Cox Mar 2006

User Datagram Protocol With Congestion Control, Spencer L. Cox

Theses and Dissertations

Communication through the Internet is one of the dominant methods of exchanging information. Whether at an individual or large corporate level the Internet has become essential to gathering and disseminating information. TCP and UDP are the transport layer protocols responsible for transit of nearly all Internet communications. Due to the growth of real-time audio and video applications, UDP is being used more frequently as a transport protocol. As UDP traffic increases potential problems arise. Unlike TCP, UDP has no mechanism for congestion control leading to wasted bandwidth and poor performance for other competing protocols. This thesis defines a congestion control …

Go to article

Learning Real-World Problems By Finding Correlated Basis Functions, Adam C. Drake Mar 2006

Learning Real-World Problems By Finding Correlated Basis Functions, Adam C. Drake

Theses and Dissertations

Learning algorithms based on the Fourier transform attempt to learn functions by approximating the largest coefficients of their Fourier representations. Nearly all previous work in Fourier-based learning has been in the theoretical realm, where properties of the transform have made it possible to prove many interesting learnability results. The real-world usefulness of Fourier-based methods, however, has not been thoroughly explored. This thesis explores methods for the practical application of Fourier-based learning. The primary contribution of this thesis is a new search algorithm for finding the largest coefficients of a function's Fourier representation. Although the search space is exponentially large, empirical …

Go to article

Browser-Based Trust Negotiation, Cameron Morris Mar 2006

Browser-Based Trust Negotiation, Cameron Morris

Theses and Dissertations

Trust negotiation allows two parties on the Internet to establish trust in each other according to the digital credentials thateach other possesses. Traditionally, trust negotiation uses certificates as digital credentials. However, certificates make trust negotiation difficult to use since people rarely have certificates available to them, and they must physically possess and secure all needed certificates in order to negotiate. To avoid these problems, this thesis proposes that credential authorities negotiate on behalf of the user. This thesis defines BrowserBased Trust Negotiation (BBTN) as a method for negotiating with credential authorities using the Secure Assertion Markup Language (SAML).

Go to article

Encryption Of Computer Peripheral Devices, Kelly Robert Norman Mar 2006

Encryption Of Computer Peripheral Devices, Kelly Robert Norman

Theses and Dissertations

Computer peripherals, such as keyboards, scanners, printers, cameras, and Personal Data Assistants (PDAs) typically communicate with a host PC via an unencrypted protocol, leaving them vulnerable to eavesdropping techniques, such as keyloggers. An encryption system was developed that is simple enough to be used in peripherals that do not have large amounts of processing power and memory. A software driver loaded in the operating system of the host computer communicates with a simple 8-bit microcontroller in the peripheral device. The driver handles key generation, key exchange, and provides decrypted data to the operating system. A key exchange protocol allows the …

Go to article

Factors Impacting Key Management Effectiveness In Secured Wireless Networks, Yongjoo Shin Mar 2006

Factors Impacting Key Management Effectiveness In Secured Wireless Networks, Yongjoo Shin

Theses and Dissertations

The use of a Public Key Infrastructure (PKI) offers a cryptographic solution that can overcome many, but not all, of the MANET security problems. One of the most critical aspects of a PKI system is how well it implements Key Management. Key Management deals with key generation, key storage, key distribution, key updating, key revocation, and certificate service in accordance with security policies over the lifecycle of the cryptography. The approach supported by traditional PKI works well in fixed wired networks, but it may not appropriate for MANET due to the lack of fixed infrastructure to support the PKI. This …

Go to article

Surface Realization Using A Featurized Syntactic Statistical Language Model, Thomas L. Packer Mar 2006

Surface Realization Using A Featurized Syntactic Statistical Language Model, Thomas L. Packer

Theses and Dissertations

An important challenge in natural language surface realization is the generation of grammatical sentences from incomplete sentence plans. Realization can be broken into a two-stage process consisting of an over-generating rule-based module followed by a ranker that outputs the most probable candidate sentence based on a statistical language model. Thus far, an n-gram language model has been evaluated in this context. More sophisticated syntactic knowledge is expected to improve such a ranker. In this thesis, a new language model based on featurized functional dependency syntax was developed and evaluated. Generation accuracies and cross-entropy for the new language model did not …

Go to article

Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville Mar 2006

Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville

Theses and Dissertations

An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles’ momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications …

Go to article

Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen Mar 2006

Design And Measurement Of A Real-Time Peer-To-Peer Game, Michael D. Simonsen

Theses and Dissertations

Currently, multiplayer online games use the client-server architecture which is very resource intensive, expensive, and time consuming. Peer-to-peer protocols are a less resource intensive alternative to the client-server model. We implement a peer-to-peer protocol called NEO in a multiplayer game and run experiments in a lab setting and over the Internet. These experiments show us that NEO is able to run a smooth playable game, with low unused updates and low location error. This happens as long as the arrival delay is long enough to allow updates to arrive in the given time limit and the round length is short …

Go to article

Formal Mitigation Strategies For The Insider Threat: A Security Model And Risk Analysis Framework, Jonathan W. Butts Mar 2006

Formal Mitigation Strategies For The Insider Threat: A Security Model And Risk Analysis Framework, Jonathan W. Butts

Theses and Dissertations

The advancement of technology and reliance on information systems have fostered an environment of sharing and trust. The rapid growth and dependence on these systems, however, creates an increased risk associated with the insider threat. The insider threat is one of the most challenging problems facing the security of information systems because the insider already has capabilities within the system. Despite research efforts to prevent and detect insiders, organizations remain susceptible to this threat because of inadequate security policies and a willingness of some individuals to betray their organization. To investigate these issues, a formal security model and risk analysis …

Go to article

Bda Enhancement Methodology Using Situational Parameter Adjustments, Michael V. Carras Jr. Mar 2006

Bda Enhancement Methodology Using Situational Parameter Adjustments, Michael V. Carras Jr.

Theses and Dissertations

In the context of close ground combat, the perception of Battle Damage Assessment (BDA) is closely linked with a soldier’s engagement decisions and has significant effects on the battlefield. Perceived BDA is also one of the most complex and uncertain processes facing the soldier in live combat. As a result, the modeling and simulation community has yet to adequately model the perceived BDA process in combat models. This research effort examines the BDA process from a perception standpoint and proposes a methodology to collect the pertinent data and model this perception in the Army’s current force-on-force model, CASTFOREM. A subject …

Go to article

An Adaptable Energy-Efficient Medium Access Control Protocol For Wireless Sensor Networks, Justin T. Kautz Mar 2006

An Adaptable Energy-Efficient Medium Access Control Protocol For Wireless Sensor Networks, Justin T. Kautz

Theses and Dissertations

Wireless networks have become ubiquitous recently and therefore their usefulness has also become more extensive. Wireless sensor networks (WSN) detect environmental information with sensors in remote settings. One problem facing WSNs is the inability to resupply power to these energy-constrained devices due to their remoteness. Therefore to extend a WSN's effectiveness, the lifetime of the network must be increased by making them as energy efficient as possible. An energy efficient medium access control (MAC) can boost a WSN's lifetime. This research creates a MAC protocol called Adaptive sensor Medium Access Control (AMAC) which is based on Sensor Medium Access Control …

Go to article

Mitigating Distributed Denial Of Service Attacks In An Anonymous Routing Environment: Client Puzzles And Tor, Nicholas A. Fraser Mar 2006

Mitigating Distributed Denial Of Service Attacks In An Anonymous Routing Environment: Client Puzzles And Tor, Nicholas A. Fraser

Theses and Dissertations

Online intelligence operations use the Internet to gather information on the activities of U.S. adversaries. The security of these operations is paramount, and one way to avoid being linked to the Department of Defense (DoD) is to use anonymous communication systems. One such system, Tor, makes interactive TCP services anonymous. Tor uses the Transport Layer Security (TLS) protocol and is thus vulnerable to a distributed denial-of-service (DDoS) attack that can significantly delay data traversing the Tor network. This research uses client puzzles to mitigate TLS DDoS attacks. A novel puzzle protocol, the Memoryless Puzzle Protocol (MPP), is conceived, implemented, and …

Go to article

A Real-Time Wireless Sensor Media Access Control (Mac) Protocol, Barry W. Park Mar 2006

A Real-Time Wireless Sensor Media Access Control (Mac) Protocol, Barry W. Park

Theses and Dissertations

Wireless sensor networks are rapidly becoming a platform for applications such as battlefield monitoring, intelligence gathering, environmental monitoring, and emergency response. Inherent in these applications is a priority and urgency of the information or messages. This means the messages must be delivered in a timely manner for them to be useful. This research assigns a message priority level and provides high-priority messages quicker access to the channel. Using MICA2 sensors and a modified Media Access Control (MAC) layer, real-time message End-to-End (ETE) delay was reduced by 50 percent. Coupled with this decrease in delay, these same real-time messages also had …

Go to article

Toward The Static Detection Of Deadlock In Java Software, Jose E. Fadul Mar 2006

Toward The Static Detection Of Deadlock In Java Software, Jose E. Fadul

Theses and Dissertations

Concurrency is the source of many real-world software reliability and security problems. Concurrency defects are difficult to detect because they defy conventional software testing techniques due to their non-local and non-deterministic nature. We focus on one important aspect of this problem: static detection of the possibility of deadlock - a situation in which two or more processes are prevented from continuing while each waits for resources to be freed by the continuation of the other. This thesis proposes a flow-insensitive interprocedural static analysis that detects the possibility that a program can deadlock at runtime. Our analysis proceeds in two steps. …

Go to article

A Comparison Of Main Rotor Smoothing Adjustments Using Linear And Neural Network Algorithms, Nathan A. Miller Mar 2006

A Comparison Of Main Rotor Smoothing Adjustments Using Linear And Neural Network Algorithms, Nathan A. Miller

Theses and Dissertations

Helicopter main rotor smoothing is a maintenance procedure that is routinely performed to minimize airframe vibrations induced by non-uniform mass and/or aerodynamic distributions in the main rotor system. This important task is both time consuming and expensive, so improvements to the process have long been sought. Traditionally, vibrations have been minimized by calculating adjustments based on an assumed linear relationship between adjustments and vibration response. In recent years, artificial neural networks have been trained to recognize non-linear mappings between adjustments and vibration response. This research was conducted in order observe the character of the adjustment mapping of the Vibration Management …

Go to article

Metamorphism As A Software Protection For Non-Malicious Code, Thomas E. Dube Mar 2006

Metamorphism As A Software Protection For Non-Malicious Code, Thomas E. Dube

Theses and Dissertations

Most organizations are aware that threats from trusted insiders pose a great risk to their organization and are very difficult to protect against. Auditing is recognized as an effective technique to detect malicious insider activities. However, current auditing methods are typically applied with a one-size-fits-all approach and may not be an appropriate mitigation strategy, especially towards insider threats. This research develops a 4-step methodology for designing a customized auditing template for a Microsoft Windows XP operating system. Two tailoring methods are presented which evaluate both by category and by configuration. Also developed are various metrics and weighting factors as a …

Go to article

Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell Mar 2006

Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell

Theses and Dissertations

Reinforcement learning is one of the more attractive machine learning technologies, due to its unsupervised learning structure and ability to continually even as the operating environment changes. Applying this learning to multiple cooperative software agents (a multi-agent system) not only allows each individual agent to learn from its own experience, but also opens up the opportunity for the individual agents to learn from the other agents in the system, thus accelerating the rate of learning. This research presents the novel use of fuzzy state aggregation, as the means of function approximation, combined with the policy hill climbing methods of Win …

Go to article

Flashlight: A Dynamic Detector Of Shared State, Race Conditions, And Locking Models In Concurrent Java Programs, Scott C. Hale Mar 2006

Flashlight: A Dynamic Detector Of Shared State, Race Conditions, And Locking Models In Concurrent Java Programs, Scott C. Hale

Theses and Dissertations

Concurrent Java programs are difficult to understand and implement correctly. This difficultly leads to code faults that are the source of many real-world reliability and security problems. Many factors contribute to concurrency faults in Java code; for example, programmers may not understand Java language semantics or, when using a Java library or framework, may not understand that their resulting program is concurrent. This thesis describes a dynamic analysis tool, named FlashLight, that detects shared state and possible race conditions within a program. FlashLight illuminates the concurrency within a program for programmers who are wholly or partially "in the dark" about …

Go to article

A Monocular Vision Based Approach To Flocking, Brian Kirchner Mar 2006

A Monocular Vision Based Approach To Flocking, Brian Kirchner

Theses and Dissertations

Flocking is seen in nature as a means for self protection, more efficient foraging, and other search behaviors. Although much research has been done regarding the application of this principle to autonomous vehicles, the majority of the research has relied on GPS information, broadcast communication, an omniscient central controller, or some other form of "global" knowledge. This approach, while effective, has serious drawbacks, especially regarding stealth, reliability, and biological grounding. This research effort uses three Pioneer P2-AT8 robots to achieve flocking behavior without the use of global knowledge. The sensory inputs are limited to two cameras, offset such that the …

Go to article

Evolving Self-Organized Behavior For Homogeneous And Heterogeneous Uav Or Ucav Swarms, Ian C. Price Mar 2006

Evolving Self-Organized Behavior For Homogeneous And Heterogeneous Uav Or Ucav Swarms, Ian C. Price

Theses and Dissertations

This investigation uses a self-organization (SO) approach to enable cooperative search and destruction of retaliating targets with swarms of homogeneous and heterogeneous unmanned aerial vehicles (UAVs). To facilitate specific system design, a facilitating SO algebraic framework is created that emphasizes scalability, robustness, and flexibility. This framework is then used to implement a UAV behavior architecture relying upon rules governing formation and target interaction. Sets of applicable behaviors are created by weighted summation of the rules where different weights act as distinct behavior archetypes. Appropriate behavior archetypes are based upon sense information distilled from the environment and a simple perceptron mapping. …

Go to article

Cryptanalysis Of Pseudorandom Number Generators In Wireless Sensor Networks, Kevin M. Finnigin Mar 2006

Cryptanalysis Of Pseudorandom Number Generators In Wireless Sensor Networks, Kevin M. Finnigin

Theses and Dissertations

This work presents a brute-force attack on an elliptic curve cryptosystem implemented on UC Berkley's TinyOS operating system for wireless sensor networks. The attack exploits the short period of the pseudorandom number generator (PRNG) used by the cryptosystem to generate private keys. The attack assumes a laptop is listening promiscuously to network traffic for key messages and requires only the sensor node?s public key and network address to discover the private key. Experimental results show that roughly 50% of the address space leads to a private key compromise in 25 minutes on average. Furthermore, approximately 32% of the address space …

Go to article

Detecting Potential Insider Threats Through Email Datamining, James S. Okolica Mar 2006

Detecting Potential Insider Threats Through Email Datamining, James S. Okolica

Theses and Dissertations

No abstract provided.

Go to article

Verification Of A Decision Level Fusion Algorithm Using A Proven Atr System And Measured Sar Data, James Douglas Thompson Mar 2006

Verification Of A Decision Level Fusion Algorithm Using A Proven Atr System And Measured Sar Data, James Douglas Thompson

Theses and Dissertations

Decision level fusion (DLF) algorithms combine outputs of multiple single sensors to make one confident declaration of a target. This research compares performance results of a DLF algorithm using measured data and a proven ATR system with results from simulated data and a modeled ATR system. This comparison indicates that DLF offers significant performance improvements over single sensor looks. However, results based on simulated data and a modeled ATR are slightly optimistic and overestimate results from measured data and a proven ATR system by nearly 10% over all targets tested.

Go to article

Multiframe Shift Estimation, Stephen A. Bruckart Mar 2006

Multiframe Shift Estimation, Stephen A. Bruckart

Theses and Dissertations

The purpose of this research was to develop a fundamental framework for a new approach to multiframe translational shift estimation in image processing. This thesis sought to create a new multiframe shift estimator, to theoretically prove and experimentally test key properties of it, and to quantify its performance according to several metrics. The new estimator was modeled successfully and was proven to be an unbiased estimator under certain common image noise conditions. Furthermore its performance was shown to be superior to the cross correlation shift estimator, a robust estimator widely used in similar image processing cases, according to several criteria. …

Go to article

An Estimation Theory Approach To Detection And Ranging Of Obscured Targets In 3-D Ladar Data, Charles R. Burris Mar 2006

An Estimation Theory Approach To Detection And Ranging Of Obscured Targets In 3-D Ladar Data, Charles R. Burris

Theses and Dissertations

The purpose of this research is to develop an algorithm to detect obscured images in 3-D LADAR data. The real data used for this research was gathered using a FLASH LADAR system under development at AFRL/SNJM. The system transmits light with a wavelength of 1.55 micrometers and produces 20 128 X 128 temporally resolved images from the return pulse separated by less than 2 nanoseconds in time. New algorithms for estimating the range to a target in 3-D FLASH LADAR data were developed. Results from processing real data are presented and compared to the traditional correlation receiver for extracting ranges …

Go to article

First Prev Next Last