Digital Commons Network^™

Sharp, Quantitative Bounds On The Distance Between A Bezier Curve And Its Control Polygon, D. Nairn, J. Peters, D. Lutterkort

Department of Computer Science Technical Reports

No abstract provided.

Message Patterns In The Bond Distributed Object System, Ladislau Bölöni, Kyung-Koo Jun, Thomas Danials, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Reflections On Metacomputing, The Bond View, Dan C. Marinescu, Ladislau Bölöni

Department of Computer Science Technical Reports

No abstract provided.

Graphical User Interface Design For The X-Ray Crystallography Data Processing Program - Scaling, K. C. Van Zandt, Dan C. Marinescu, Robert Bolotovsky, Michael Rossman

Department of Computer Science Technical Reports

No abstract provided.

Measurement Of The W Mass By Direct Reconstruction In E+E- Collisions At 172 Gev, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

An Advanced Visualization Method For An Operations Research Analysis, Steven C. Oimoen

Theses and Dissertations

Visualizing multidimensional data using only two dimensions and conventional visualization techniques limits the understanding of the data set. Underlying structures or patterns within the data can easily go unnoticed. In order to gain additional insight into an analysis, incorporation of visualization and multidimensional graphics into the analysis results should be accomplished. The results must ensure that the information portrayed is not misleading or misunderstood. The integrity of the data must be preserved throughout the transformation. The primary objective of this research effort is to identify techniques to visualize multidimensional data and then develop a software tool to display the multidimensional …

Methodology For The Analysis And Design Of Internet Software Components Providing Relational Database Access Through The World Wide Web, Daniel L. Dipiro

Theses and Dissertations

This work examines the application of Internet software technologies to provide access to remote relational databases via the World Wide Web. The research applies these software technologies to assist the Air Force Institute of Technology Civilian Institute Program in improving operations and student to staff communication. An analysis of the existing Internet software technologies revealed several competing technologies capable of performing the same database access functions. The analysis further revealed weaknesses and inconsistencies in the existing AFIT/CI database. A methodology is proposed to assist in analyzing an existing development environment and in selecting among the competing technologies to provide the …

Breakpoint Skeletal Representation And Compression Of Document Images, William A. Barrett, Bryan S. Morse, Eric N. Mortensen

Faculty Publications

We present a new method for representation and (lossy) compression of bitonal document images. The technique extracts a skeletal medial axis from each object using a true Euclidean distance map of the image and then finds piecewise linear breakpoints in the skeleton to create a breakpoint skeletal representation, bps, (Fig. 1). The bps is encoded for each object as a set of triples {, <Δx2,Δy2,Δr2>, . . . <Δxn,Δyn,Δrn>} where contains the coordinate and distance (radius, r1) of the initial breakpoint from the closest point on the perimeter of the object and <Δxi,Δyi,Δri> represents the difference in location and radius between …

Measurement Of Triple Gauge-Boson Couplings At 172 Gev, Barate, R.; Et Al, M. Thulasidas

Research Collection School Of Computing and Information Systems

The triple gauge-boson couplings, αWΦ, αW and αBΦ, have been measured using 34 semileptonically and 54 hadronically decaying W+W− candidate events. The events were selected in the data recorded during 1996 with the ALEPH detector at 172 GeV, corresponding to an integrated luminosity of 10.65 pb−1. The triple gauge-boson couplings have been measured using optimal observables constructed from kinematic information of W+W− events. The results are in agreement with the Standard Model expectation.

Parallel Genetic Algorithm To Solve The Satisfiability Problem, Nicole Nemer-Preece, Ralph W. Wilkerson

Computer Science Faculty Research & Creative Works

This Paper Offers a Parallel Genetic Algorithm Solution to the Satisfiability Problem. It Combines Components of the Davis-Putnam Method and Genetic Algorithms for the Solution. This Solution is Useful in the Areas of Theorem Proving, Constraint Satisfaction Programming, and VLSI Design. the Algorithm is Implemented and Run on a Paragon. the Results Show Performance Improvement by Increasing the Number of Nodes. Two Parallel Methods Are Compared: One that Implements Interprocessor Communication and One that Does Not. the Results Show Performance Improvement with the Method that Uses Interprocessor Communication.

Zebra Image Access System, Srilekha Mudumbai, Kshitij Shah, Amit P. Sheth, Krishnan Parasuraman, Clemens Bertram

Kno.e.sis Publications

The ZEBRA system, which is part of the VisualHarness platform for managing heterogeneous data, supports three types of access to distributed image repositories: keyword based, attribute based, and image content based. A user can assign different weights (relative importance) to each of the three types, and within the last type of access, to each of the image properties. The image based access component (IBAC) supports access based on computable image properties such as those based on spatial domain, frequency domain or statistical and structural analysis. However, it uses a novel black box approach of utilizing a Visual Information Retrieval (VIR) …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 2, February 1998, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Abstract State Machines 1988-1998: Commented Asm Bibliography, James Huggins, Egon Borger

Computer Science Publications

Hartmut Ehrig asked the first author to write for this column what are the distinguishing features of the ASM approach to specification and verification of complex computing systems. In [21] an attempt had already been made to answer that question by discussing, in general comparative terms, some specific features which are characteristic for the ASM approach with respect to other well known approaches in the literature. That explanation seems to have been understood, as shown by the many positive reactions, but even more the numerous critical reactions of colleagues in the field who felt—rightly—that ASMs put justified doubt on cherished …

Bond Objects - A White Paper, Ladislau Bölöni

Department of Computer Science Technical Reports

No abstract provided.

Robust Scheduling Of Metaprograms, Ladislau Bölöni, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Four-Jet Final State Production In E+E- Collisions At Centre-Of-Mass Energies Ranging From 130 To 184 Gev, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The four jet topology is analysed in the ALEPH data taken between November 1995 and October 1997, at centre-of-mass energies ranging from 130 to 184 GeV. While an unexpected accumulation of events with a dijet mass sum around 105 GeV/c 2 had been observed during the first run in 1995 at 130/136 GeV, corresponding to an integrated luminosity of 5.7 pb1 , no significant dierences between data and standard model prediction is seen, either in the high energy runs (81.1 pb1 taken at centre-of-mass energies from 161 to 184 GeV) or in the 7.1 pb1 recorded during a new short …

A Visual Object-Relationship Query Language For User-Database Interaction, Keng Siau

Research Collection School Of Computing and Information Systems

User–database interaction has a direct and immediate effect on the effectiveness and efficiency of database end users. Traditional query languages like SQL and QBE require end users to understand the underlying data structure in the database. This is a burden on end users, especially novice end users who have little technical knowledge or understanding of database. To alleviate the need for end users to know the logical database organization, this paper proposes the use of an object–relationship (OR) model and a formal high-level visual query language as the interface. Using this interface, end users communicate only domain knowledge with the …

A Signcryption Scheme With Signature Directly Verifiable By Public Key, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Signcryption, first proposed by Zheng, is a cryptographic primitive which combines both the functions of digital signature and public key encryption in a logical single step, and with a computational cost significantly lower than that needed by the traditional signature-then-encryption approach. In Zheng's scheme, the signature verification can be done either by the recipient directly (using his private key) or by engaging a zero-knowledge interative protocol with a third party, without disclosing recipient's private key. In this note, we modify Zheng's scheme so that the recipient's private key is no longer needed in signature verification. The computational cost of the …

Flag : The Fault-Line Analytic Graph And Fingerprint Classification, Ching-Yu Huang

Dissertations

Fingerprints can be classified into millions of groups by quantitative measurements of their new representations - Fault-Line Analytic Graphs (FLAG), which describe the relationship between ridge flows and singular points. This new model is highly mathematical, therefore, human interpretation can be reduced to a minimum and the time of identification can be significantly reduced.

There are some well known features on fingerprints such as singular points, cores and deltas, which are global features which characterize the fingerprint pattern class, and minutiae which are the local features which characterize an individual fingerprint image. Singular points are more important than minutiae when …

A Simple Neural Agent Communicating Through Sets, James P. Stanski

Theses

Networked agents of the simplest kind offer the power of cooperative problem solving through parallel operation along with tight packaging potential. Such agents are self-contained analog machines capable of only a few primitive intelligent operations. In this thesis, a design will be developed for a simple agent capable of sending, receiving, and processing information in a environment where agents are coupled together. This environment imposes unorchestrated simultaneous input while expecting a useful timely response. Successful collaboration in these conditions is accomplished through sets encoded within pulse ensembles. The simplicity of the set definition is an inviting candidate for message communication …

Applications Of Internet Technology For Requirements Elicitation, Deepak Pandit

Theses

During the Requirements Elicitation part of a project various stakeholders need to be able to communicate their requirements to the developers, and the developers need to be able communicate their understanding back to the stakeholders. Communication between the various members of the project is the key factor during the Requirements Elicitation part of a project. Easing communications between stakeholders and developers makes the process of eliciting requirement easier, leading to better requirements specification and eventually a better product.

The Requirements Elicitation Process through Internet (REPI) web site has been designed and implemented to explore this idea. The prototype version of …

Innovation Through Competition, Doug Blank, Lisa Meeden

Computer Science Faculty Research and Scholarship

No abstract provided.

Definitional Interpreters For Higher-Order Programming Languages, John C. Reynolds

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

Abstract. Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language such as pure LISP). Examples include McCarthy’s definition of LISP, Landin’s SECD machine, the Vienna definition of PL/I, Reynolds ’ definitions of GEDANKEN, and recent unpublished work by L. Morris and C. Wadsworth. Such definitions can be classified according to whether the interpreter contains higher-order functions, and whether the order of application (i.e., call by value versus call by name) in the defined …

Dynamic Management Of Heterogeneous Resources, Jerrell Watts, Marc Rieffel, Stephen Taylor

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

This paper presents techniques for dynamic load balancing in heterogeneous computing environments. That is, the techniques are designed for sets of machines with varying processing capabilities and memory capacities. These methods can also be applied to homogenous systems in which the effective compute speed or memory availability is reduced by the presence of other programs running outside the target computation. To handle heterogeneous systems, a precise distinction is made between an abstract quantity of work, which might be measured as the number of iterations of a loop or the count of some data structure, and the utilization of resources, measured …

Visual Interactive Modeling In A Java-Based Hierarchical Modeling And Simulation System, Robert G. Sargent, Thorsten Daum

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

The desired set of properties of a modern simulation system is presented. The portion of the Hierarchical Modeling And Simulation System-Java (HiMASS-j) used for specifying Hierarchical Control Flow Graph (HCFG) Models is described. The specification of HCFG Models in HiMASS-j is by visual interactive modeling through the use of graphical user interfaces and dialog boxes. HCFG Models are specified using two complementary hierarchical specification structures: one to specify the components that comprise a model and how these components are interconnected, and the other to specify the behaviors of individual atomic components. A simulation of a traffic intersection using HiMASS-j is …

Partial Shape Matching Using Genetic Algorithms, Ender Ozcan, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

Shape recognition is a challenging task when images contain overlapping, noisy, occluded, partial shapes. This paper addresses the task of matching input shapes with model shapes described in terms of features such as line segments and angles. The quality of matching is gauged using a measure derived from attributed shape grammars. We apply genetic algorithms to the partial shape-matching task. Preliminary results, using model shapes with 6 to 70 features each, are extremely encouraging.

An Efficient Parallel Algorithm For High Dimensional Similarity Join, Khaled Alsabti, Sanjay Ranka, Vineet Singh

Electrical Engineering and Computer Science - All Scholarship

Multidimensional similarity join finds pairs of multi-dimensional points that are within some small distance of each other: The 6-k-d-B tree has been proposed as a data structure that scales better as the number of dimensions in-creases compared to previous data structures. We present a cost model of the E-k-d-B tree and use it to optimize the leaf size. We present novel parallel algorithms for the similarity join using the E-k-d-B tree. A load-balancing strategy based on equi-depth histograms is shown to work well for uniform or low-skew situations, whereas another based on weighted equi-depth histograms works far better for high-skew …

Darp: Java-Based Data Analysis And Rapid Prototyping Environment For Distributed High Performance Computations, Erol Akarsu, Geoffrey C. Fox, Tomasz Haupt

Northeast Parallel Architecture Center

The integration of a compiled and interpreted HPF gives us an opportunity to design a powerful application development environment targeted for high performance parallel and distributed systems. This Web based system follows a three-tier model. The Java front-end holds proxy objects which can be manipulated with an interpreted Web client (a Java applet) interacting dynamically with compiled code through a tier-2 server. Although targeted for HPF back-end, the system’s architecture is independent of the back-end language, and can be extended to support other high performance languages.

Common Runtime Support For High Performance Languages, Geoffrey C. Fox

Northeast Parallel Architecture Center

Widespread adoption of parallel computing depends on the availability of improved software environments. An essential component of these environments will be high-level languages. Several languages for exploiting data-parallelism (or task-parallelism) have been developed, or are under development. The stated goal of this project has been to provide a public domain infrastructure for runtime support of these high-level languages. The targeted languages include parallel versions of Fortran and C++, but our intention has been to provide uniform runtime support for many source languages.

Object Web (Java/Corba) Based Rti To Support Metacomputing M&S, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir

Northeast Parallel Architecture Center

We present here our Pragmatic Object Web based approach to High Performance Modeling and Simulation and we describe the associated middleware software recently prototyped at NPAC: JWORB (Java Web Object Request Broker) which integrates HTTP and IIOP protocols, and Object Web RTI which implements DMSO RTI 1.3 on top of the JWORB based CORBA / Java software bus. We explain how JWORB and OW RTI are used to build WebHLA – an interactive FMS training environment and we outline our plan towards WebHLA based Virtual Prototyping Environments for Testing, Evaluation and Simulation Based Acquisition.