Digital Commons Network^™

Automated Systematic Testing For Constraint-Based Interactive Services, Patrice Godefroid, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Laufer

Computer Science: Faculty Publications and Other Works

Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must support multiple types of interfaces for accessing the same data. These include automatic speech-recognition interfaces where inputs may be provided in any order by users of the service. We study in this paper how to systematically test event-driven applications developed using such languages. We show how such applications can be tested automatically, without the need for any manually-written test cases, and effi- ciently, by taking advantage of their capability of taking unordered …

Information Retrieval And Mining In High Dimensional Databases, Xiong Wang

Dissertations

This dissertation is composed of two parts. In the first part, we present a framework for finding information (more precisely, active patterns) in three dimensional (3D) graphs. Each node in a graph is an undecoraposable or atomic unit and has a label. Edges are links between the atomic units. Patterns are rigid substructures that may occur in a graph after allowing for an arbitrary number of whole-structure rotations and translations as well as a small number (specified by the user) of edit operations in the patterns or in the graph. (When a pattern appears in a graph only after the …

Semi-Regular Mesh Extraction From Volumes, Z. J. Wood, M. Desbrun, P. Schroder, D. Breen

Computer Science and Software Engineering

We present a novel method to extract iso-surfaces from distance volumes. It generates high quality semi-regular multiresolution meshes of arbitrary topology. Our technique proceeds in two stages. First, a very coarse mesh with guaranteed topology is extracted. Subsequently an iterative multi-scale force-based solver refines the initial mesh into a semi-regular mesh with geometrically adaptive sampling rate and good aspect ratio triangles. The coarse mesh extraction is performed using a new approach we call surface wavefront propagation. A set of discrete iso-distance ribbons are rapidly built and connected while respecting the topology of the iso-surface implied by the data. Subsequent multi-scale …

The Cracker Patch Choice: An Analysis Of Post Hoc Security Techniques, Crispin Cowan, Heather Hinton, Calton Pu, Jonathan Walpole

Computer Science Faculty Publications and Presentations

It has long been known that security is easiest to achieve when it is designed in from the start. Unfortunately, it has also become evident that systems built with security as a priority are rarely selected for wide spread deployment, because most consumers choose features, convenience, and performance over security. Thus security officers are often denied the option of choosing a truly secure solution, and instead must choose among a variety of post hoc security adaptations. We classify security enhancing methods, and compare and contrast these methods in terms of their effectiveness vs. cost of deployment. Our analysis provides practitioners …

Editorial, Sanjay Kumar Madria, Mukesh Mohania, Bharat Bhargava

Computer Science Faculty Research & Creative Works

No abstract provided.

On Reconfiguring Tree Linkages: Trees Can Lock, Therese Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried Toussaint, Sue Whitesides

Computer Science: Faculty Publications

It has recently been shown that any simple (i.e. nonintersecting) polygonal chain in the plane can be reconfigured to lie on a straight line, and any simple polygon can be reconfigured to be convex. This result cannot be extended to tree linkages: we show that there are trees with two simple configurations that are not connected by a motion that preserves simplicity throughout the motion. Indeed, we prove that an N-link tree can have 2^Ω(N) equivalence classes of configurations.

Optically Simulating A Quantum Associative Memory, Dan A. Ventura, John C. Howell, John A. Yeazell

Faculty Publications

This paper discusses the realization of a quantum associative memory using linear integrated optics. An associative memory produces a full pattern of bits when presented with only a partial pattern. Quantum computers have the potential to store large numbers of patterns and hence have the ability to far surpass any classical neural network realization of an associative memory. In this work two 3-qubit associative memories will be discussed using linear integrated optics. In addition, corrupted, invented and degenerate memories are discussed.

Exception Handling In Workflow Systems, Zongwei Luo, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller

Kno.e.sis Publications

In this paper, defeasible workflow is proposed as a framework to support exception handling for workflow management. By using the “justified” ECA rules to capture more contexts in workflow modeling, defeasible workflow uses context dependent reasoning to enhance the exception handling capability of workflow management systems. In particular, this limits possible alternative exception handler candidates in dealing with exceptional situations. Furthermore, a case-based reasoning (CBR) mechanism with integrated human involvement is used to improve the exception handling capabilities. This involves collecting cases to capture experiences in handling exceptions, retrieving similar prior exception handling cases, and reusing the exception handling experiences …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 17, Number 1, September 2000, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a new ly developed scheme for automatical ly partitioning videos into scenes. A scene is general ly referred to as a group of shots taken place in the same site. In this paper, we first propose a motion annotation algorithm based on the analysis of spatiotemporal image volumes. The algorithm characterizes the motions within shots by extracting and analyzing the motion trajectories encoded in the temporal slices of image volumes. A motion-based keyframe computing and selection strategy is thus proposed to compactly represent the content of shots. With these techniques, we further present a scene change detection algorithm …

Validation And Verification Of Formal Specifications In Object-Oriented Software Engineering, Steven A. Thomson

Theses and Dissertations

The use of formal specifications allows for a software system to be defined with stringent mathematical semantics and syntax via such tools as propositional calculus and set theory. There are many perceived benefits garnered from formal specifications, such as a thorough and in-depth understanding of the domain and system being specified and a reduction in user requirement ambiguity. Probably the greatest benefit of formal specifications, and that which is least capitalized upon, is that mathematical proof procedures can be used to test and prove internal consistency and syntactic correctness in an effort to ensure comprehensive validation and verification (V&V). The …

Knowledge Discovery In Biological Databases : A Neural Network Approach, Qicheng Ma

Dissertations

Knowledge discovery, in databases, also known as data mining, is aimed to find significant information from a set of data. The knowledge to be mined from the dataset may refer to patterns, association rules, classification and clustering rules, and so forth. In this dissertation, we present a neural network approach to finding knowledge in biological databases. Specifically, we propose new methods to process biological sequences in two case studies: the classification of protein sequences and the prediction of E. Coli promoters in DNA sequences. Our proposed methods, based oil neural network architectures combine techniques ranging from Bayesian inference, coding theory, …

The Application And Performance Of A Generic Task Routine Decision Making Algorithm To Recipe Selection In Meal Planning, Michelle M. Cox

Theses and Dissertations - UTB/UTPA

A nutritional meal planning system was implemented to test the effectiveness of a previously developed routine decision making algorithm. The combinatorics involved in ordering recipes in all possible combinations to produce variability in a meal plan and provide sufficient nutrition is conceptually intensive. Meal planning involves selection of food to eat to fulfill a person's nutritional and personal preferences. This thesis demonstrates meal planning as a decision making problem and demonstrates the utility of the routine decision making algorithm by solving this problem. Generic Tasks, identified through artificial intelligence research, provides the basis for this algorithm. It uses user preferences …

Reducing Mass Degeneracy In Sar By Ms By Stable Isotopic Labeling, Chris Bailey-Kellogg, John J. Kelley Iii, Cliff Stein, Bruce Randall Donald

Dartmouth Scholarship

Mass spectrometry (MS) promises to be an invaluable tool for functional genomics, by supporting low-cost, high-throughput experiments. However, large-scale MS faces the potential problem of mass degeneracy -- indistinguishable masses for multiple biopolymer fragments (e.g. from a limited proteolytic digest). This paper studies the tasks of planning and interpreting MS experiments that use selective isotopic labeling, thereby substantially reducing potential mass degeneracy. Our algorithms support an experimental-computational protocol called Structure-Activity Relation by Mass Spectrometry (SAR by MS), for elucidating the function of protein-DNA and protein-protein complexes. SAR by MS enzymatically cleaves a crosslinked complex and analyzes the resulting mass spectrum …

A Meta-Analysis On Relationship Modeling Accuracy: Comparing Relational And Semantic Models, Qing Cao, Fiona Fui-Hoon Nah, Keng Siau

Research Collection School Of Computing and Information Systems

Semantic data modeling, such as entity-relationship (ER) modeling and extended/enhanced entity-relationship (EER) modeling, has emerged as an alternative to relational data modeling. The majority of research in data modeling suggests that the use of semantic data models leads to better performance. However the findings are not conclusive and sometimes inconsistent. In this research, we investigate modeling relationship correctness in relational and semantic models. The meta-analysis carried out in this research is an attempt to alleviate inconsistent results in previous studies.

On The Effectiveness Of Probabilistic Packet Marking For Ip Traceback Under Denial Of Service Attack, Kihong Park, Heejo Lee

Department of Computer Science Technical Reports

No abstract provided.

Computer-Aided Synthesis Of Higher Pairs Via Configuration Space Manupulation, Min-Ho Kyung, Elisha Sacks

Department of Computer Science Technical Reports

No abstract provided.

The Inefficiency Of Batch Training For Large Training Sets, Tony R. Martinez, D. Randall Wilson

Faculty Publications

Multilayer perceptrons are often trained using error backpropagation (BP). BP training can be done in either a batch or continuous manner. Claims have frequently been made that batch training is faster and/or more "correct" than continuous training because it uses a better approximation of the true gradient for its weight updates. These claims are often supported by empirical evidence on very small data sets. These claims are untrue, however, for large training sets. This paper explains why batch training is much slower than continuous training for large training sets. Various levels of semi-batch training used on a 20,000-instance speech recognition …

Dimensionality Reduction Using Genetic Algorithms, Michael L. Raymer, William F. Punch, Erik D. Goodman, Leslie A. Kuhn, Anil K. Jain

Kno.e.sis Publications

Pattern recognition generally requires that objects be described in terms of a set of measurable features. The selection and quality of the features representing each pattern affect the success of subsequent classification. Feature extraction is the process of deriving new features from original features to reduce the cost of feature measurement, increase classifier efficiency, and allow higher accuracy. Many feature extraction techniques involve linear transformations of the original pattern vectors to new vectors of lower dimensionality. While this is useful for data visualization and classification efficiency, it does not necessarily reduce the number of features to be measured since each …

Almost Block Diagonal Linear Systems: Sequential And Parallel Solution Techniques, And Applications, P. Amodio, J.R. Cash, G. Roussos, R.W. Wright, G. Fairweather, I. Gladwell, G.L. Kraut, M. Paprzycki

Faculty Publications

Almost block diagonal (ABD) linear systems arise in a variety of contexts, specifically in numerical methods for two-point boundary value problems for ordinary differential equations and in related partial differential equation problems. The stable, efficient sequential solution of ABDs has received much attention over the last fifteen years and the parallel solution more recently. We survey the fields of application with emphasis on how ABDs and bordered ABDs (BABDs) arise. We outline most known direct solution techniques, both sequential and parallel, and discuss the comparative efficiency of the parallel methods. Finally, we examine parallel iterative methods for solving BABD systems. …

Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng

Research Collection School Of Computing and Information Systems

Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP ’98, Fung and Gray proposed an m-permutation protection scheme against the EEPROM modification attack. At ACISP ’99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m- permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised …

Buckets: Smart Objects For Digital Libraries, Michael L. Nelson

Computer Science Theses & Dissertations

Discussion of digital libraries (DLs) is often dominated by the merits of various archives, repositories, search engines, search interfaces and database systems. While these technologies are necessary for information management, information content and information retrieval systems should progress on independent paths and each should make limited assumptions about the status or capabilities of the other. Information content is more important than the systems used for its storage and retrieval. Digital information should have the same long-term survivability prospects as traditional hardcopy information and should not be impacted by evolving search engine technologies or vendor vagaries in database management systems.

Digital …

A Flowchart Structure For Modification Of A Modsim Process Model, Murali K. Adatrao

Electrical & Computer Engineering Theses & Dissertations

There are many software processes and software development models that support the development of a software model prior to implementation. However, more often than not, these practices are not followed resulting in a lack of documentation of the intended functionality of the software. As a result, software often becomes a black box for later developers. Even a simple bug fix can turn into an exhaustive task for the developers, as they must attempt to infer the intended system behavior. New designers cannot make any changes to the software or extend the software behavior, as the underlying model within the software …

Registration Of Images With Dissimilar Contrast Using A Hybrid Method Employing Correlation And Mutual Information, Karolyn A. Abram

Dartmouth College Undergraduate Theses

The problem of fitting one image into another is commonly called "registration." Finding the best possible translation and rotation necessary to align two images is one approach to solving this problem. Registration is a crucial component of many remote sensing and medical image interpretation applications. Image alignment techniques aid in volumetric estimations of complicated structures and allow radiologists to accurately identify changes between sequential images. Radiologists require image alignment capabilities to correct for patient motion and/or content displacement between images. Numerous image registration techniques exist for correcting the alignment problems mentioned above. Unfortunately, most of these techniques, such as Correlation, …

Depth From Flash, David B. Martin

Dartmouth College Undergraduate Theses

Digital camera technology has recently seen substantial improvements in image quality while lower prices have made it affordable to the average consumer. Camera manufacturers, however, are not taking full advantage of this new medium for image capture. By filtering the already digitized image produced by these cameras through on-board image processing algorithms we can dramatically increase the power of digital cameras. For example, according to experts in the photographic industry, most people simply take bad pictures. Classic examples of this phenomenon are photographs taken indoors with a point-and-shoot style camera using its built-in flash. The subjects of these photographs often …

Learning Languages And Functions By Erasing, Sanjay Jain, Efim Kinber, Steffen Lange, Rolf Wiehagen, Thomas Zeugmann

School of Computer Science & Engineering Faculty Publications

Learning by erasing means the process of eliminating potential hypotheses from further consideration thereby converging to the least hypothesis never eliminated. This hypothesis must be a solution to the actual learning problem. The capabilities of learning by erasing are investigated in relation to two factors: the choice of the overall hypothesis space itself and what sets of hypotheses must or may be erased. These learning capabilities are studied for two fundamental kinds of objects to be learned, namely languages and functions. For learning languages by erasing, the case of learning indexed families is investigated. A complete picture of all separations …

Motion Characterization By Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

This paper describes an approach to characterize camera and object motions based on the analysis of spatio temporal image volumes. In the spatio-temporal slices of image volumes, motion is depicted as oriented patterns. We propose a tensor histogram computation algorithm to represent these oriented patterns. The motion trajectories in a histogram are tracked to describe both the camera and object motions. In addition, we exploit the similarity of the temporal slices in a volume to reliably partition a volume into motion tractable units.

Equity Of Access: Adaptive Technology, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

In this age of information technology, it is morally imperative that equal access to information via computer systems be afforded to people with disabilities. This paper addresses the problems that computer technology poses for students with disabilities and discusses what is needed to ensure equity of access, particularly in a university environment.

An Improved Algorithm For Translating Relational Schemas Into An Object Model, Joseph C. Pearson

Theses and Dissertations

Today's war fighter is inundated with data from numerous Command, Control, Communications and Computers and Intelligence systems. Integration of these systems is desirable, yet integration results in a static solution to a dynamic problem-by the time a global schema can be devised, it is out of date. Automating schema integration will mitigate this problem, but data model disparity must be addressed via translation to a common data model prior to integration. To address this requirement, this thesis presents an improved, relational to object-oriented schema translation algorithm, which is derived from a base algorithm proposed by another research effort. The improved …

Scalable Web Server Clustering Technologies, Trevor Schroeder, Steve Goddard, Byrav Ramamurthy

School of Computing: Faculty Publications

The exponential growth of the Internet, coupled with the increasing popularity of dynamically generated content on the World Wide Web, has created the need for more and faster Web servers capable of serving the over 100 million Internet users. Server clustering has emerged as a promising technique to build scalable Web servers. In this article we examine the seminal work, early products, and a sample of contemporary commercial offerings in the field of transparent Web server clustering. We broadly classify transparent server clustering into three categories.