Digital Commons Network^™

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.

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 …

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 …

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 …

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.

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 …

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 …

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 …

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 …

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.

Parallel Probabilistic Computations On A Cluster Of Workstations, Atanas Radenski, Andrew Vann, Boyana Norris

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

Probabilistic algorithms are computationally intensive approximate methods for solving intractable problems. Probabilistic algorithms are excellent candidates for cluster computations because they require little communication and synchronization. It is possible to specify a common parallel control structure as a generic algorithm for probabilistic cluster computations. Such a generic parallel algorithm can be glued together with domain-specific sequential algorithms in order to derive approximate parallel solutions for different intractable problems.

In this paper we propose a generic algorithm for probabilistic computations on a cluster of workstations. We use this generic algorithm to derive specific parallel algorithms for two discrete optimization problems: the …

Design And Design Centers In Engineering Education, Clive L. Dym

All HMC Faculty Publications and Research

This paper is intended to be the opening salvo of the workshop, Computing Futures in Engineering Design (Dym, 1997). Thus, I want to take this privileged moment to ask you to think with me about the role of design in engineering. In particular, I want to reflect upon how design is articulated and how design is taught; about the role of design in engineering education and in the practice of engineering; and about the role that could be played locally and, perhaps, nationally by a center devoted to design education. Because I teach here at Harvey Mudd College (HMC), …

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 …

Automatic Granularity Control For Load Balancing Of Concurrent Particle Simulations, Marc Rieffel, Stephen Taylor, Jerrell Watts

Electrical Engineering and Computer Science - All Scholarship

This paper demonstrates the use of automatic granularity control as part of dynamic load balancing for irregular, particle-based simulations. Performance optimization techniques are considered in the context of a concurrent Direct Simulation Monte Carlo method used to study the rarefied gas flow inside three-dimensional plasma reactors. Several computational techniques are used to reduce the overall time to deliver realistic threedimensional results. The effectiveness of dynamic load balancing and granularity control are presented for large-scale simulations on distributed-memory multicomputers.

Performance Enhancement Using Intra-Server Caching In A Continuous Media Server, Chutimet Srinilta, Alok Choudhary

Electrical Engineering and Computer Science - All Scholarship

Continuity of stream playback is the crucial constraint in designing a continuous media server. From a distributed memory architectural model developed earlier, we found that there were many points where the stream capacity of the server could be improved. The stream capacity was usually limited by the storage bottlenecks. Serving streams from memory cache eliminates disk accesses and data transfers between nodes which, in turn, helps relieve those bottlenecks. However, the capacity of the server ultimately depends on client access pattern. Client request assignment has an impact on cache hit ratio as well as workload distribution. It is also the …

Ai And The Changing Face Of Health Care, Erika Rogers

Computer Science and Software Engineering

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 14, Number 1, January 1998, 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.

Skew-Insensitive Parallel Algorithms For Relational Join, Khaled Alsabti, Sanjay Ranka

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

Join is the most important and expensive operation in relational databases. The parallel join operation is very sensitive to the presence of the data skew. In this paper, we present two new parallel join algorithms for coarse grained machines which work optimally in presence of arbitrary amount of data skew. The first algorithm is sort-based and the second is hash-based. Both of these algorithms employ a preprocessing phase (prior to the redistribution phase) to equally partition the work among the processors. The proposed algorithms have been designed for memory resident-data. However, they can be extended to disk resident-data. These algorithms …

The Design And Evaluation Of A Virtual Distributed Computing Environment, Haluk Topcuoglu, Salim Hariri, Dongmin Kim, Yoonhee Kim, Xue Bing

Electrical Engineering and Computer Science - All Scholarship

In this paper we present the Virtual Distributed Computing Environment (VDCE), a metacomputing environment currently being developed at Syracuse University. VDCE provides an efficient web-based approach for developing, evaluating and visualizing large-scale distributed applications that are based on predefined task libraries on diverse platforms. The VDCE task libraries relieve end-users of tedious task implementations and also support reusability. The VDCE software architecture is described in terms of three modules: a) the Application Editor, a user-friendly application development environment that generates the Application Flow Graph (AFG) of an application; b) the Application Scheduler, which provides an efficient task-to-resource mapping of AFG; …