Digital Commons Network^™

Xtpvm A Transparent Thread Scheduling And Migrating Abstract Machine, Tarek Hafez Mohamed Abdel-Radi

Archived Theses and Dissertations

No abstract provided.

Logical Information Modeling Of Web-Accessible Heterogeneous Digital Assets, Kshitij Shah, Amit P. Sheth

Kno.e.sis Publications

This paper introduces the MREF framework for representing and correlating information at a higher semantic level than is possible with Web-based information systems today. The role that metadata plays in this framework is described, together with a metadata based infrastructure to support our media independent information correlation paradigm. To keep it consistent with evolving standards, broader acceptance and ease of implementation, MREF abstraction is structured on top of RDF and XML. Its central role in the context of the InfoQuilt system, for exploiting heterogeneous digital media using a federated and scalable architecture, is briefly described.

A Discourse Subsystem For Information Extraction, Doha Ahmed Ali Shawki

Archived Theses and Dissertations

No abstract provided.

Seamless Metacomputing With Bond, Ladislau Bölöni, Kyung Koo Jun, Mihai Sirbu, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Building Web Sites That Attract Visitors, C. David Shepherd, Daniel Fell

Faculty Articles

The article discusses the use of web sites for health care service marketing. The potential benefits of Internet services for users and care providers are mentioned, but challenges in implementation are also listed. A three generation model of web site design is offered, distinguishing various levels of interactivity, customization, and perceived value. Suggestions are offered applying this model to health care service web sites and their marketing potential.

Implementation Of The Graphical User Interface Of The Parint Package In Java, Gwowen Fu

Masters Theses

The graphical user interface (GUI) of the ParInt interface package provides a convenient and efficient way for users to integrate multivariate functions on a parallel system or a network.

This thesis introduces basic structure of the GUI and gives a detailed description of each class of how the classes communicate with each other and how the connection with the parallel program is made.

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 …

Trends. Injustice Through Justice Within The Ins And The Fbi: Fertile Territory For Information, Ibpp Editor

International Bulletin of Political Psychology

The author discusses the quest for justice, in which policymakers, legislators, and those who seek to influence them sometimes seek to effect mandatory sequences of adjudicative procedure upon allegations of misbehavior.

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 …

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

BITs and PCs Newsletter

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

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.

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.

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 …

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 …

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.

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, 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 …

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.

Jworb - Java Web Object Request Broker For Commodity Software Based Visual Data Ow Metacomputing Programming Environment, Geoffrey C. Fox, Wojtek Furmanski, Hasan T. Ozdemir

Northeast Parallel Architecture Center

Programming environments and tools that are simultaneously sustainable, highly functional, robust and easy to use have been hard to come by in the HPDC area. This is partially due to the difficulty in developing sophisticated customized systems for what is relatively small part of the worldwide computing enterprise. As the commodity software becomes naturally distributed with the onset of Web and Intranets, we observe now a new trend in HPDC community [1, 8, 12] to base high performance computing on the modern enterprise computing technologies. .. JWORB is a multi-protocol Java server under development at NPAC, currently capable of handling …

Average-Case Lower Bounds For Noisy Boolean Decision Trees, William Evans, Nicholas Pippenger

All HMC Faculty Publications and Research

We present a new method for deriving lower bounds to the expected number of queries made by noisy decision trees computing Boolean functions. The new method has the feature that expectations are taken with respect to a uniformly distributed random input, as well as with respect to the random noise, thus yielding stronger lower bounds. It also applies to many more functions than do previous results. The method yields a simple proof of the result (previously established by Reischuk and Schmeltz) that almost all Boolean functions of n arguments require $\Me(n \log n)$ queries, and strengthens this bound from the …

Ber-Based Call Admission In Wavelength-Routed Optical Networks, Debasish Datta, Byrav Ramamurthy, Helena Feng, Jonathan P. Heritage, Biswanath Mukherjee

School of Computing: Conference and Workshop Papers

Consider a wavelength-routed optical network in which nodes, i.e., multiwave length cross-connect switches (XCSs), are connected by fiber to form an arbitrary physical topology. A new call is admitted into the network if an all-optical lightpath can be established between the call’s source and destination nodes. Wavelength converters are assumed absent in this work.

Development And Utilization Of Parallel Generic Algorithms For Scientific Computations, Atanas Radenski, Andrew Vann, Boyana Norris

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

We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as meshes, pipelines, or master-server networks in problem-independent manner. Such modules can be extended with sequential domain-specific code in order to derive particular parallel applications. In this paper, we first outline the essence of extensible modules. Then, we focus on a case study of the cellular automaton, a message-parallel generic algorithm from which we derive diverse parallel scientific applications.

Interactive Gradebook: The Missing (Hyper)Link, Doug Blank, George Holmes, Ryan Wells, Pawel Wolinksi

Computer Science Faculty Research and Scholarship

This paper introduces the notion of the "interactive gradebook," a new niche where intelligent and interactive technologies can help educators teach and students learn.