Digital Commons Network^™

Database Selection Techniques For Routing Bibliographic Queries, Ee Peng Lim, Wee-Keong Ng, Jian Xu, Yinyan Cao

Research Collection School Of Computing and Information Systems

No abstract provided.

Querying Structured Web Resources, Ee Peng Lim, Cheng Hai Tan, Boon Wan Lim, Wee-Keong Ng

Research Collection School Of Computing and Information Systems

To provide query facilities over Web resources, several web search engines such as Yahoo, Altavista, Infoseek, etc. have been developed. Most prominently, web search engines have been used to index all web pages on the Internet. The queries supported by these search engines are mainly designed to reveal web pages that meet the search criteria specified by the users. In this way, the search engines have been used as some kind of discovery tools. The queries supported are known as discovery queries. On the other hand, a web search engine can also be used to index and support queries over …

Constructing High Order Perceptrons With Genetic Algorithms, Timothy L. Andersen, Tony R. Martinez

Faculty Publications

Constructive induction, which is defined to be the process of constructing new and useful features from existing ones, has been extensively studied in the literature. Since the number of possible high order features for any given learning problem is exponential in the number of input attributes (where the order of a feature is defined to be the number of attributes of which it is composed), the main problem faced by constructive induction is in selecting which features to use out of this exponentially large set of potential features. For any feature set chosen the desirable characteristics are minimality and generalization …

Optimal Control Using A Neural/Evolutionary Hybrid System, Tony R. Martinez, Dan A. Ventura

Faculty Publications

One of the biggest hurdles to developing neurocontrollers is the difficulty in establishing good training data for the neural network. We propose a hybrid approach to the development of neurocontrollers that employs both evolutionary computation (EC) and neural networks (NN). EC is used to discover appropriate control actions for specific plant states. The survivors of the evolutionary process are used to construct a training set for the NN. The NN leams the training set, is able to generalize to new plant states, and is then used for neurocontrol. Thus the EC/NN approach combines the broad, parallel search of EC with …

Quantum Associative Memory With Exponential Capacity, Tony R. Martinez, Dan A. Ventura

Faculty Publications

Quantum computation uses microscopic quantum level effects to perrform computational tasks and has produced results that in some cases are exponentially faster than their classical counterparts by taking advantage of quantum parallelism. The unique characteristics of quantum theory may also be used to create a quantum associative memory with a capacity exponential in the number of neurons. This paper covers necessary high-level quantum mechanical ideas and introduces a simple quantum associative memory. Further, it provides discussion, empirical results and directions for future work.

Fuzzy Requirements, Xiaoqing Frank Liu

Computer Science Faculty Research & Creative Works

Requirement analysis and specification is the first major step in software development. The goal is to develop a requirements specification that contains all the customers' true needs. The analysis describes quality requirements and their constraints, such as cost and resources. Functional requirements are analyzed in terms of inputs, outputs and their relationships. Hence, requirements analysis enables software engineers to specify software function and establish software design and implementation constraints. The paper discusses the specification of individual fuzzy requirements using fuzzy sets.

Study Of Human Factors Variables In Battle Outcome Prediction Models, David Andrew Glovier

Engineering Management & Systems Engineering Theses & Dissertations

Over time there have been many improvements in models that are used to predict the outcome of battles. Currently there is much supposition and speculation surrounding the use of human performance related factors as additional inputs to battle simulation models to improve their accuracy. However there is no conclusive scientific evidence which shows that these factors do make a significant difference. This study investigates the use of factors that may impact on the human performance directly or indirectly in battle prediction models. These factors consist of traditional human factors and external factors that may influence the human performance. The research …

Resonant Structure And Flavour Tagging In The Bπ± System Using Fully Reconstructed B Decays, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

A Framework For World Wide Web Client-Authentication Protocols, Cem Paya

Dartmouth College Undergraduate Theses

Existing client-authentication protocols deployed on the World Wide Web today are based on conventional distributed systems and fail to address the problems specific to the application domain. Some of the protocols restrict the mobility of the client by equating user identity to a machine or network address, others depend on sound password management strategies, and yet others compromise the privacy of the user by transmitting personal information for authentication. We introduce a new framework for client-authentication by separating two goals that current protocols achieve simultaneously: 1. Maintain persistent sense of identity across different sessions. 2. Prove facts about the user …

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.

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.

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 …

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 …

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 …

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.

Techniques For Empirical Testing Of Parallel Random Number Generators, Paul D. Coddington, Sung-Hoon Ko

Northeast Parallel Architecture Center

Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such as large-scale Monte Carlo simulations, it is crucial that the random number generator have good randomness properties. Many programs are available for testing the quality of sequential random number generators, but very little work has been done on testing parallel random number generators. We present some techniques for empirical testing of random number generators on parallel computers, using tests based on computational science applications as examples. In particular, we focus on tests based on parallel …

A High Level Spmd Programming Model: Hpspmd And Its Java Language Binding, Guansong Zhang, Bryan Carpenter, Geoffrey C. Fox, Xinying Li

Northeast Parallel Architecture Center

This report introduces a new language, HPJava, for parallel programming on message passing systems. The language provides a high level SPMD programming model. Through examples and performance results, the features of the new programming style, and its implementation, are illustrated.

Design, Implementation, And Evaluation Of Parallell Pipelined Stap On Parallel Computers, Alok Choudhary, Wei-Keng Liao, Donald Weiner, Pramod Varshney, Richard Linderman, Mark Linderman

Electrical Engineering and Computer Science - All Scholarship

Performance results are presented for the design and implementation of parallel pipelined space-time adaptive processing (STAP) algorithms on parallel computers. In particular, the issues involved in parallelization, our approach to parallelization, and performance results on an Intel Paragon are described. The process of developing software for such an application on parallel computers when latency and throughput are both considered together is discussed and tradeoffs considered with respect to inter and intratask communication and data redistribution are presented. The results show that not only scalable performance was achieved for individual component tasks of STAP but linear speedups were obtained for the …

A Multithreaded Message-Passing System For High Performance Distributed Computing Applications, Sung-Yong Park, Joohan Lee, Salim Hariri

Electrical Engineering and Computer Science - All Scholarship

High Performance Distributed Computing (HPDC) applications require low-latency and high-throughput communication services and HPDC applications have different Quality of Service (QOS) requirements (e.g., bandwidth requirement, flow/error control algorithms, etc.). The communication services provided by traditional message-passing systems are fixed and thus can not be changed to meet the requirements of different HPDC applications. NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message-passing system developed at Syracuse University that provides high-performance and flexible communication services. In this paper, we overview the general architecture of NCS and present how NCS communication services are implemented. …

A Problem Solving Environment For Network Computing, Salim Hariri, Haluk Topcuoglu, Wojtek Furmanski, Dongmin Kim, Yoonhee Kim

Electrical Engineering and Computer Science - All Scholarship

The current advances in high-speed networks and WWW technologies have made network computing a cost-effective high performance computing environment. New software development models and problem solving environments must be developed to utilize the network computing environment efficiently. In this paper we present Virtual Distributed Computing Environment (VDCE), which provides a problem solving environment for high-performance distributed computing over wide-area networks. VDCE enables scientists to develop distributed applications without knowing the detailed architecture of the underlying resources. VDCE provides well-defined library functions that relieve end users from tedious task implementations and it supports software reusability. The VDCE software architecture consists of …