Computer Sciences Commons^™

Computer-Assisted Music Composition In The 32-Bar Jazz Standard Form, Chad Hogg

Computer Science Honors Papers

The goal of this research project was to explore the potential for teaching a computer to compose jazz music. Specifically, the hope was to develop a method in which every decision could be made based on information about the entire system. If this problem were solved, the ancillary goal of allowing the user to set any arbitrary constraints that have global effects would be a trivial addition.

Discovering The Potential For Advancements In Intrusion Detection Systems, Kenneth J. Buonforte

Honors Theses

An intrusion detection system (IDS) is a collection of monitors strategically placed on a network or individual host in order to detect anomalous behavior. Since James Anderson introduced one of the first frameworks for an intrusion detection system in [1]. researchers have extended the capabilities of these systems. IDSs take many forms, from systems as basic as command line audit logs to those that emulate the defense mechanisms of the human immune system. However, as intrusion detection has evolved, scientists and administrators alike are beginning to question the need for this technology due to its lack of quantifiable performance and …

Responding To Policies At Runtime In Trustbuilder, Bryan J. Smith

Theses and Dissertations

Automated trust negotiation is the process of establishing trust between entities with no prior relationship through the iterative disclosure of digital credentials. One approach to negotiating trust is for the participants to exchange access control policies to inform each other of the requirements for establishing trust. When a policy is received at runtime, a compliance checker determines which credentials satisfy the policy so they can be disclosed. In situations where several sets of credentials satisfy a policy and some of the credentials are sensitive, a compliance checker that generates all the sets is necessary to insure that the negotiation succeeds …

Securing Distributed Computations : In Search Of Reliable Large-Scale Compute Power And Refreshed Redundancy, Edward P. Kenney

Honors Theses

The Internet may be the single largest technological advance or significant societal change in the last century. Not only does it allow access to more information than any human could ever hope to digest, but it produces the potential of having millions of computers combining their computational forces for the betterment of a single cause .. Tl is is the fundamental goal of distributed computing. A distributed system is defined to be a network of machines with some degree of centralized direction. In a distributed computational system each machine will accept computational tasks from a supervisor in a master-slave relationship. …

Query Rewriting For Extracting Data Behind Html Forms, Xueqi Chen

Theses and Dissertations

Much of the information on the Web is stored in specialized searchable databases and can only be accessed by interacting with a form or a series of forms. As a result, enabling automated agents and Web crawlers to interact with form-based interfaces designed primarily for humans is of great value. This thesis describes a system that can fill out Web forms automatically according to a given user query against a global schema for an application domain and, to the extent possible, extract just the relevant data behind these Web forms. Experimental results on two application domains show that the approach …

Removing Excess Topology From Isosurfaces, Zoë J. Wood, Hugues Hoppe, Mathieu Desbrun, Peter Shröder

Computer Science and Software Engineering

Many high-resolution surfaces are created through isosurface extraction from volumetric representations, obtained by 3D photography, CT, or MRI. Noise inherent in the acquisition process can lead to geometrical and topological errors. Reducing geometrical errors during reconstruction is well studied. However, isosurfaces often contain many topological errors in the form of tiny handles. These nearly invisible artifacts hinder subsequent operations like mesh simplification, remeshing, and parametrization. In this article we present a practical method for removing handles in an isosurface. Our algorithm makes an axis-aligned sweep through the volume to locate handles, compute their sizes, and selectively remove them. The algorithm …

An Analysis Of Mcmc Sampling Methods For Estimating Weighted Sums In Winnow, Qingping Tao, Stephen Scott

School of Computing: Technical Reports

Chawla et al. introduced a way to use the Markov chain Monte Carlo method to estimate weighted sums in multiplicative weight update algorithms when the number of inputs is exponential. But their algorithm still required extensive simulation of the Markov chain in order to get accurate estimates of the weighted sums. We propose an optimized version of Chawla et al.’s algorithm, which produces exactly the same classifications while often using fewer Markov chain simulations. We also apply two other sampling techniques and empirically compare them with Chawla et al.’s Metropolis sampler to determine how effective each is in drawing good …

Design And Evaluation Of High-Performance Packet Switching Schemes, Taner Doganer

Theses and Dissertations - UTB/UTPA

The design of high-performance packet switches is essential to efficiently handle the exponential growth of data traffic in the next generation Internet. Shared-memory-based packet switches are known to provide the best possible delay-throughput performance and the lowest packet-loss rate compared with packet switches using other buffering strategies. However, scalability of shared-memory-based switching systems has been restricted by high memory bandwidth requirements, segregation of memory space and centralized control of switching functions that causes the switch performance to degrade as a shared-memory switch is grown in size. The new class of sliding-window based packet switches are known to overcome these problems …

Parallel Decomposition Procedures For Large-Scale Linear Programming Problems, Yusong Hu

Civil & Environmental Engineering Theses & Dissertations

In practice, many large-scale linear programming problems are too large to be solved effectively due to the computer's speed and/or memory limitation, even though today's computers have many more capabilities than before. Algorithms are exploited to solve such large linear programming problems, either in the sequential or parallel computation environment. This study focuses on two parallel algorithms for solving large-scale linear programming problems efficiently.

The first parallel decomposition algorithm discussed in this study is from the theory problems in a special block-angular structure. The theory or the decomposition principle is first examined. Since the subproblems of a linear programming problem …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 6, April 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A six page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Quality Of Service For Workflows And Web Service Processes, Jorge Cardoso, Amit P. Sheth, John A. Miller, Jonathan Arnold, Krzysztof J. Kochut

Kno.e.sis Publications

Workflow management systems (WfMSs) have been used to support various types of business processes for more than a decade now. In workflows or Web processes for e-commerce and Web service applications, suppliers and customers define a binding agreement or contract between the two parties, specifying quality of service (QoS) items such as products or services to be delivered, deadlines, quality of products, and cost of services. The management of QoS metrics directly impacts the success of organizations participating in e-commerce. Therefore, when services or products are created or managed using workflows or Web processes, the underlying workflow engine must accept …

Generic Performance Evaluation Tool Implementation For An Imaging Fourier Transform Spectrometer, James M. Mengert

Electrical & Computer Engineering Theses & Dissertations

Evaluation software for analyzing general analytical model applications utilizing MATLAB is presented in this thesis. The focus is to provide an interactive environment for the evaluation of model applications relating to an Imaging Fourier Transform Spectrometer. The Generic Performance Evaluation Tool (GPET) was developed by researchers at Old Dominion University and NASA-Langley Research Center and was a NASA-Langley Research Center sponsored project. GPET is capable of producing a multitude of object-oriented input data for any number of individual model applications. The tool is also capable of creating user-defined input interfaces for the purpose of viewing and/or editing input object data, …

Reflection Morphing, Andrew Martin, Voicu Popescu

Department of Computer Science Technical Reports

No abstract provided.

Interactive Modeling From Dense Color And Sparse Depth, Voicu Popescu, Elisha Sacks, Gleb Bahmotov

Department of Computer Science Technical Reports

No abstract provided.

A Piecewise Linear Approach To Overbooking, Robert Ball, Mark J. Clement, Casey T. Deccio, Feng Huang, Quinn O. Snell

Faculty Publications

Overbooking is frequently used to increase the revenue generated by a network infrastructure without incurring additional costs. If the overbooking factor is chosen appropriately, additional virtual circuits can be admitted without degrading quality of service for existing customers. Most implementations use a single factor to accept a linear fraction of traffic requests. If a piecewise linear approach is used in admissions, additional traffic can be accepted without causing proportional increases in loss rate and utilization. This additional accepted traffic can significantly improve the profit margin for network service providers.

Dynamic Offloading In A Multi-Provider Environment: A Behavioral Framework For Use In Influencing Peering, Zhen Liu, Vishal Misra, Laura Wynter

Research Collection School Of Computing and Information Systems

We pose the question of how to encourage the resource sharing in a distributed, multi-provider environment, where each node, or provider, has local work but is able to accept additional work from other nodes/providers if there is available capacity. An instance of such an environment is found in content delivery, where. numerous, competing providers can work together if enough benefit is to be gained from doing so. We model individual provider behavior as essentially selfish, and then propose pricing schemes to exploit the selfishness to achieve system wide performance gains. We employ a game theoretic framework to analyze the problem, …

A Cost-Effective Critical Path Approach For Service Priority Optimization In The Grid Computing Economy, Mei Lin, Zhangxi Lin

Research Collection School Of Computing and Information Systems

The advancement in the utilization and technologiesof the Internet has led to the rapid growth of gridcomputing; and the perpetuating demand for gridcomputing resources calls for an incentive-compatible solution to the imminent QoS problem. This paper examines the optimal service priority selection problem that a grid computing network user will confront. We model grid services for a multi-subtask request as a prioritized PERT graph and prove that the localized conditional critical path, which is based on the cost-minimizin gpriority selection for each node, sets the lower bound for the length of cost-effective critical path that commits the optimal solution. We …

Aggressive Telecommunications Overbooking Ratios, Robert Ball, Mark J. Clement, Casey T. Deccio, Feng Huang, Quinn O. Snell

Faculty Publications

The Internet is comprised of vast networks of wires and fiber. A common misconception is that there is an unlimited amount of bandwidth; in reality there exists only a finite amount. Each length of wire and fiber is owned by a company, and every company wants to maximize its profit. One means of improving profit is to overbook existing transmission lines in order to increase income without increasing expenses. If too much overbooking is performed, the Quality of Service (QoS) seen by customers will decline. This paper explains a process to achieve an optimal Overbooking Ratio (OR) for admission control …

Cognitive Robot Mapping With Polylines And An Absolute Space Representation, Kennard R. Laviers, Gilbert L. Peterson

Faculty Publications

Robot mapping even today is one of the most challenging problems in robot programming. Most successful methods use some form of occupancy grid to represent a mapped region. This approach becomes problematic if the robot is mapping a large environment, the map quickly becomes too large for processing and storage. Rather than storing the map as an occupancy grid, our robot (equipped with sonars) sees the world as a series of connected spaces. These spaces are initially mapped as an occupancy grid in a room by room fashion. As the robot leaves a space, denoted by passing through a doorway, …

Speaker Normalization For Improved Automatic Speech Recognition For Digital Libraries, Wei Wang

Electrical & Computer Engineering Theses & Dissertations

The context of this thesis work is the improvement of automatic speech recognition (ASR) for use with digital libraries. First, commonly used multimedia file formats and codecs are surveyed with the objective of identifying those formats that preserve speech quality while keeping file sizes compact. The main contribution of the work is a new technique for speaker adaptation based on frequency scale modifications. The frequency scale is modified using a minimum mean square error matching of a spectral template for each speaker to a "typical speaker" spectral template. Each spectral template is computed from the average amplitude-normalized spectra of several …

Models, Composability, And Validity, Eric Werner Weisel

Computational Modeling & Simulation Engineering Theses & Dissertations

Composability is the capability to select and assemble simulation components in various combinations into simulation systems to satisfy specific user requirements. The defining characteristic of composability is the ability to combine and recombine components into different simulation systems for different purposes. The ability to compose simulation systems from repositories of reusable components has been a highly sought after goal among modeling and simulation developers. The expected benefits of robust, general composability include reduced simulation development cost and time, increased validity and reliability of simulation results, and increased involvement of simulation users in the process. Consequently, composability is an active research …

A Framework For Secure Group Key Management, Sahar Mohamed Ghanem

Computer Science Theses & Dissertations

The need for secure group communication is increasingly evident in a wide variety of governmental, commercial, and Internet communities. Secure group key management is concerned with the methods of issuing and distributing group keys, and the management of those keys over a period of time. To provide perfect secrecy, a central group key manager (GKM) has to perform group rekeying for every join or leave request. Fast rekeying is crucial to an application's performance that has large group size, experiences frequent joins and leaves, or where the GKM is hosted by a group member. Examples of such applications are interactive …

The Kerf Toolkit For Intrusion Analysis, Javed Aslam, Sergey Bratus, David Kotz, Ron Peterson, Daniela Rus, Brett Tofel

Computer Science Technical Reports

We consider the problem of intrusion analysis and present the Kerf Toolkit, whose purpose is to provide an efficient and flexible infrastructure for the analysis of attacks. The Kerf Toolkit includes a mechanism for securely recording host and network logging information for a network of workstations, a domain-specific language for querying this stored data, and an interface for viewing the results of such a query, providing feedback on these results, and generating new queries in an iterative fashion. We describe the architecture of Kerf, present examples to demonstrate the power of our query language, and discuss the performance of our …

The United States Marine Corps Data Collaboration Requirements: Retrieving And Integrating Data From Multiple Databases, Pamela J. Cole

Theses and Dissertations

The goal of this research is to develop an information sharing and database integration model and suggest a framework to fully satisfy the United States Marine Corps collaboration requirements as well as its information sharing and database integration needs. This research is exploratory; it focuses on only one initiative: the IT-21 initiative. The IT-21 initiative dictates The Technology for the United States Navy and Marine Corps, 2000-2035: Becoming a 21st Century Force. The IT-21 initiative states that Navy and Marine Corps information infrastructure will be based largely on commercial systems and services, and the Department of the Navy must ensure …

Static Analysis Of Memory-Accessing Gestures In Java, Christopher R. Hill

All Computer Science and Engineering Research

We propose the notion of Java-program gestures that are composed of a series of memory-accessing instructions. By finding patterns in gestures whose execution can be atomic, we can load them in an intelligent memory controller. This process can improve performance of the Java Virtual Machine, decrease code footprint, and reduce power consumption in hardware. In this thesis we formally define a language of gestures and introduce a method of detecting them statically at compile-time. We introduce a simple heuristic for reducing the number of gestures that must be loaded into the memory controller and show that finding the minimum number …

Design And Implementation Of A String Matching System For Network Intrusion Detection Using Fpga-Based Bloom Filters, Sarang Dharmapurikar, Michael Attig, John Lockwood

All Computer Science and Engineering Research

Modern Network Intrusion Detection Systems (NIDS) inspect the network packet payload to check if it conforms to the security policies of the given network. This process, of-ten referred to as deep packet inspection, involves detection of predefined signature strings or keywords starting at an arbitrary location in the payload. String matching is a computationally intensive task and can become a potential bottleneck without high-speed processing. Since the conventional software-implemented string matching algorithms have not kept pace with the increasing network speeds, special purpose hardware solutions have been introduced. In this paper we show how Bloom filters can be used effectively …

A Subgroup Algorithm To Identify Cross-Rotation Peaks Consistent With Non-Crystallographic Symmetry, Ryan H. Lilien, Chris Bailey-Kellogg, Amy C. Anderson, Bruce R. Donald

Dartmouth Scholarship

Molecular replacement (MR) often plays a prominent role in determining initial phase angles for structure determination by X-ray crystallography. In this paper, an efficient quaternion-based algorithm is presented for analyzing peaks from a cross-rotation function in order to identify model orientations consistent with proper non-crystallographic symmetry (NCS) and to generate proper NCS-consistent orientations missing from the list of cross-rotation peaks. The algorithm, CRANS, analyzes the rotation differences between each pair of cross-rotation peaks to identify finite subgroups. Sets of rotation differences satisfying the subgroup axioms correspond to orientations compatible with the correct proper NCS. The CRANS algorithm was first …

Fast Registration Of Tabular Document Images Using The Fourier-Mellin Transform, Luke Alexander Daysh Hutchison

Theses and Dissertations

Image registration, the process of finding the transformation that best maps one image to another, is an important tool in document image processing. Having properly-aligned microfilm images can help in manual and automated content extraction, zoning, and batch compression of images. An image registration algorithm is presented that quickly identifies the global affine transformation (rotation, scale, translation and/or shear) that maps one tabular document image to another, using the Fourier-Mellin Transform. Each component of the affine transform is recovered independantly from the others, dramatically reducing the parameter space of the problem, and improving upon standard Fourier-Mellin Image Registration (FMIR), which …

Ai In Computer Games: From The Player’S Goal To Ai’S Role, Jeremy A. Glasser, Leen-Kiat Soh

School of Computing: Technical Reports

This paper addresses the role of Artificial Intelligence (AI) in a variety of game genres. Every game aims to entertain (though educational games have secondary objectives). Each genre approaches entertainment in a unique way. We explore the methods used to draw the game player’s attention. We then consider how the AI interacts with the player to promote both entertainment and an interactive environment. We also consider some of the techniques that will shape tomorrow’s games. Included are opponent strategies, interactive environments, and multiagent systems (MAS). While different, each approach can aid in creating more immersive and challenging gaming experiences. Our …

Dynamic Autonomous Transport Selection In Heterogeneous Wireless Environments, Jeffrey M. Brown, Heidi R. Duffin, Charles D. Knutson, Shannon B. Barnes, Ryan W. Woodings

Faculty Publications

In this paper, we introduce Quality of Transport (QoT), an architecture for synergistically and autonomously managing session-layer protocol access to multiple transports in heterogeneous wireless environments. We present an overview of the QoT architecture including: 1) transport discovery, 2) service discovery, 3) object exchange, 4) transport switching, and 5) intelligent transport selection. Preliminary successes with our design and implementation of QoT suggest that dynamic intelligent autonomous transport switching can help to optimize user experience and session layer performance in multi-transport environments.