Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 19381 - 19410 of 20576

Full-Text Articles in Entire DC Network

Parallel 3d Reconstruction Of Spherical Virus Particles From Digitized Images Of Entire Electron Micrographs Using Cartesian Coordinates And Fourier Analysis, Robert E. Lynch, Dan C. Marinescu Aug 1997

Parallel 3d Reconstruction Of Spherical Virus Particles From Digitized Images Of Entire Electron Micrographs Using Cartesian Coordinates And Fourier Analysis, Robert E. Lynch, Dan C. Marinescu

Department of Computer Science Technical Reports

No abstract provided.

Go to article

Using Expert Support And Its Explanation Facilities For Group Decision Making, Fiona Fui-Hoon Nah, Izak Benbasat Aug 1997

Using Expert Support And Its Explanation Facilities For Group Decision Making, Fiona Fui-Hoon Nah, Izak Benbasat

Research Collection School Of Computing and Information Systems

As information technology is increasingly used to support group work, it becomes desirable to identify the types of computer-based decision aids that are beneficial for supporting group decision making. In a review of the decision support literature, Benbasat, DeSanctis and Nault (1993) point out the lack of empirical research in examining the use of expert support for group decision making. In our review of the literature in this respect, we identified only one case study (Sviokla, 1989), which examined the processes involved in the pre- and post-use of an expert support system (ESS) called PlanPower by a group of financial …

Go to article

Time-Efficient Maze Routing Algorithms On Reconfigurable Mesh Architectures, Fikret Ercal, H. C. Lee Aug 1997

Time-Efficient Maze Routing Algorithms On Reconfigurable Mesh Architectures, Fikret Ercal, H. C. Lee

Computer Science Faculty Research & Creative Works

The routing problem is one of the most widely studied problems in VLSI design. Maze-routing algorithms are used in VLSI routing and robot path planning. Efficiency of the parallel maze routing algorithms which were mostly based on C. Y. Lee's algorithm8is poor. In this paper, we propose time-efficient algorithms to solve the maze-routing problem on a reconfigurable mesh architecture. The constant-time algorithms presented include: (i) testing the existence of specific types of paths between two terminals, and (ii) finding an absolute shortest path (ASP) and a shortest duplex-path (SDP). In addition, a fast algorithm to find the single shortest path …

Go to article

Theoretical Foundation For Relationship Construct In Information Modeling – Relation Element Theory, Keng Siau Aug 1997

Theoretical Foundation For Relationship Construct In Information Modeling – Relation Element Theory, Keng Siau

Research Collection School Of Computing and Information Systems

Information modeling is a critical process in software development. One of the key constructs in information modeling is the relationship construct. Though commonly used, the relationship construct is poorly defined and lacks a strong theoretical foundation. The objectives of this research are to define and classify the various relationships based on a theory in linguistic known as the relation element theory. This paper describes the theory, relates the theory to the relationship construct, and discusses the implication of the theory on the relationship construct.

Go to article

Influence And Consensus In Group Decision Making Environment, Fiona Fui-Hoon Nah, Byungcho Kim Aug 1997

Influence And Consensus In Group Decision Making Environment, Fiona Fui-Hoon Nah, Byungcho Kim

Research Collection School Of Computing and Information Systems

In this research, the effect of expert support on influence and consensus in group decision making is investigated. The results indicate that ESS support diminishes the group members' influence on the group judgment as well as the influence exerted by the most influential group member. On the other hand, explanations support provided by ESS increases consensus in group decision making.

Go to article

Using The Quantum Computer To Break Elliptic Curve Cryptosystems, Jodie Eicher, Yaw Opoku Jul 1997

Using The Quantum Computer To Break Elliptic Curve Cryptosystems, Jodie Eicher, Yaw Opoku

Department of Math & Statistics Technical Report Series

This article gives an introduction to Elliptic Curve Cryptography and Quantum Computing. It includes an analysis of Peter Shor’s algorithm for the quantum computer breakdown of Discrete Log Cryptosystems and an analog to Shor’s algorithm for Elliptic Curve Cryptosystems. An extended example is included which illustrates how this modified Shor’s algorithm will work.

Go to article

Measurement Of The Transverse Spin Correlations In The Decay Z → Τ+Τ-, Barate, R.; Et Al., M. Thulasidas Jul 1997

Measurement Of The Transverse Spin Correlations In The Decay Z → Τ+Τ-, Barate, R.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of the transverse-transverse, CTT, and transverse-normal CTN, τ spin correlations in the decay Z0 → τ+ τ− is presented based on the aplanarity angle of the decay products of both taus. Based on 80 pb−1 of data collected by ALEPH[1] in 1992, 1993 and 1994 on the peak of the Z resonance, the results are: CTT = 1.00 ± 0.14(stat) ± 0.04(syst), CTN =−0.08 ± 0.14(stat) ± 0.02(syst). These values are in agreement with the Standard Model predictions, CTT = 0.989 and CTN = 0.

Go to article

Report On The 5th Ifip International Workshop On Quality Of Service, Oguz Angin, Andrew T. Campbell, Lai Tee Cheok, Raymond Liao, Koon-Seng Lim, Klara Nahrstedt Jul 1997

Report On The 5th Ifip International Workshop On Quality Of Service, Oguz Angin, Andrew T. Campbell, Lai Tee Cheok, Raymond Liao, Koon-Seng Lim, Klara Nahrstedt

Research Collection School Of Computing and Information Systems

This paper presents a summary of the fifth International Workshop on Quality of Service (IWQOS) which was held at Columbia University in May 1997. The goal of this three-day meeting was to foster interaction between researchers active in the area of Quality of Service(QOS) research, to reflect on past experiences and lessons learnt, and to discuss future QOS challenges. To reflect this goal, this year's workshop included a hot program made up of (i) a keynote address on "Programming Telecommunications Networks"; (ii) panels addressing "QOS for Distributed Object Computing Middleware --- Fact or Fiction?" and "Reservations about Reservations"; (iii) a …

Go to article

Agent Tcl: A Flexible And Secure Mobile-Agent System, Robert S. Gray Jun 1997

Agent Tcl: A Flexible And Secure Mobile-Agent System, Robert S. Gray

Dartmouth College Ph.D Dissertations

A mobile agent is an autonomous program that can migrate under its own control from machine to machine in a heterogeneous network. In other words, the program can suspend its execution at an arbitrary point, transport itself to another machine, and then resume execution from the point of suspension. Mobile agents have the potential to provide a {\em single, general framework} in which a wide range of distributed applications can be implemented efficiently and easily. Several challenges must be faced, however, most notably reducing migration overhead, protecting a machine from malicious agents (and an agent from malicious machines), and insulating …

Go to article

Search For The Bc Meson In Hadronic Z Decays, R. Barate, Manoj Thulasidas Jun 1997

Search For The Bc Meson In Hadronic Z Decays, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A search for the Bc meson decaying into the channels Jψπ+ and Jψℓ+νℓ (ℓ = e or μ) is performed in a sample of 3.9 million hadronic Z decays collected by the ALEPH detector. This search results in the observation of 0 and 2 candidates in each of these channels, respectively, while 0.44 and 0.81 background events are expected. The following 90% confidence level upper limits are derived:Br(Z→BcXBr(Z→qq̄Br(Bc+→Jψπ+)

Go to article

Measurement Of The Branching Fraction For D0 → K-Π+, R. Barate, M. Thulasidas Jun 1997

Measurement Of The Branching Fraction For D0 → K-Π+, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The branching fraction for D0 → K−π+ is measured with the statistics collected by ALEPH from 1991 to 1994. The method is based on the comparison between the rate for the reconstructed D∗+→ D0π+, D0 → K−π+ decay chain and the rate for inclusive soft pion production at low transverse momentum with respect to the nearest jet. The result is B(D0 → K−π+0 = (3.90 ± 0.09 ± 0.12)%

Go to article

Efficient Parallel Processing With Optical Interconnections, Lili Hai May 1997

Efficient Parallel Processing With Optical Interconnections, Lili Hai

Dissertations

With the advances in VLSI technology, it is now possible to build chips which can each contain thousands of processors. The efficiency of such chips in executing parallel algorithms heavily depends on the interconnection topology of the processors. It is not possible to build a fully interconnected network of processors with constant fan-in/fan-out using electrical interconnections. Free space optics is a remedy to this limitation. Qualities exclusive to the optical medium are its ability to be directed for propagation in free space and the property that optical channels can cross in space without any interference. In this thesis, we present …

Go to article

An Information Retrieval System For Performing Hierarchical Document Clustering, Eric Hagen May 1997

An Information Retrieval System For Performing Hierarchical Document Clustering, Eric Hagen

Dartmouth College Undergraduate Theses

This thesis presents a system for web-based information retrieval that supports precise and informative post-query organization (automated document clustering by topic) to decrease real search time on the part of the user. Most existing Information Retrieval systems depend on the user to perform intelligent, specific queries with Boolean operators in order to minimize the set of returned documents. The user essentially must guess the appropriate keywords before performing the query. Other systems use a vector space model which is more suitable to performing the document similarity operations which permit hierarchical clustering of returned documents by topic. This allows "post query" …

Go to article

Solomon's Sea And The Biblical Π, Andrew Simoson May 1997

Solomon's Sea And The Biblical Π, Andrew Simoson

ACMS Conference Proceedings 1997

From I Kings 7:23, the apparent diameter and circumference of a circular ring are given as 10 and 30 cubits which suggests that the Biblical value of π is 3 rather a number closer to π. However we recount seven different somewhat whimsical explanations as to why this conclusion is overly-hasty.

Go to article

Klz: A Prototype X Protocol Compression System, Ka-Tak Lo May 1997

Klz: A Prototype X Protocol Compression System, Ka-Tak Lo

Dartmouth College Undergraduate Theses

One of the most commonly used graphics protocol is the X Protocol, enabling programs to display graphics images. When running the X Protocol over the network, a lot of structured data (messages with fields) need to be transmitted. Delays can be detected by human users when connected through a low-bandwidth network. The solution is to compress the X protocol. XRemote, a network version of the X Protocol, uses Dictionary-based compression. In XRemote, strings are recorded in the dictionary. When a string repeats, its index in the dictionary is transmitted. Higher Bandwidth X (HBX) uses statistical modeling techniques instead. A context …

Go to article

Study Of Muon-Pair Production At Centre-Of-Mass Energies From 20 To 136 Gev With The Aleph Detector, R. Barate, M. Thulasidas May 1997

Study Of Muon-Pair Production At Centre-Of-Mass Energies From 20 To 136 Gev With The Aleph Detector, R. Barate, M. Thulasidas

Research Collection School Of Computing and Information Systems

The total cross section and the forward-backward asymmetry for the process e+e− → μ+μ−(nγ) are measured in the energy range 20–136 GeV by reconstructing the effective centre-of-mass energy after initial state radiation. The analysis is based on the data recorded with the ALEPH detector at LEP between 1990 and 1995, corresponding to a total integrated luminosity of 143.5 pb−1. Two different approaches are used: in the first one an exclusive selection of events with hard initial state radiation in the energy range 20–88 GeV is directly compared with the Standard Model predictions showing good agreement. In the second one, all …

Go to article

A Measurement Of Rb Using Mutually Exclusive Tags, R. Barate, Manoj Thulasidas May 1997

A Measurement Of Rb Using Mutually Exclusive Tags, R. Barate, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

A measurement of Rb using ve mutually exclusive hemisphere tags has been performed by ALEPH using the full LEP1 statistics. Three tags are designed to select the decay of the Z0 to b quarks, while the remaining two select Z0 decays to c and light quarks, and are used to measure the tagging eciencies. The result, Rb = 0:2159 0:0009(stat) 0:0011(syst), is in agreement with the electroweak theory prediction of 0:21580:0003.

Go to article

Source-Aware Multidatabase Query Processing, Ee Peng Lim, Yinyan Cao, Roger Hsiang-Li Chiang May 1997

Source-Aware Multidatabase Query Processing, Ee Peng Lim, Yinyan Cao, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

We introduce a multidatabase model to represent the information that derives from different local databases. This model, known as Tuple-Source (TS) relational model, accommodates tuples from different local databases by attaching them with their source information in the global relations which are also known as TS-relations. In other words, a source attribute is implicit in every TS-relation. To manipulate the global relations, we have developed the TSSQL query language and implemented a distributed query processor to process such queries. In this paper, we report our distributed query processing architecture and algorithms. Our architecture consists of a query mediator and a …

Go to article

The Carnot Heterogeneous Database Project: Implemented Applications, Munindar Singh, Phil Cannata, Michael N. Huhns, Nigel Jacobs, Tomasz Ksiezyk, Kayliang Ong, Amit P. Sheth, Christine Tomlinson, Darrell Woelk Apr 1997

The Carnot Heterogeneous Database Project: Implemented Applications, Munindar Singh, Phil Cannata, Michael N. Huhns, Nigel Jacobs, Tomasz Ksiezyk, Kayliang Ong, Amit P. Sheth, Christine Tomlinson, Darrell Woelk

Kno.e.sis Publications

The Carnot project was an ambitious research project in heterogeneous databases. It integrated a variety of techniques to address a wide range of problems in achieving interoperation in heterogeneous environments. Here we describe some of the major implemented applications of this project. These applications concern(a) accessing a legacy scientific database, (b) automating a workflow involving legacy systems, (c) cleaning data, and (d) retrieving semantically appropriate information from structured databases in response to text queries. These applications support scientific decision support, business process management, data integrity enhancement, and analytical decision support, respectively. They demonstrate Carnot‘s capabilities for (a) heterogeneous query processing, …

Go to article

Characterizing A Portable Subset Of Behavioral Vhdl-93, Krishnaprasad Thirunarayan, Robert Ewing Apr 1997

Characterizing A Portable Subset Of Behavioral Vhdl-93, Krishnaprasad Thirunarayan, Robert Ewing

Kno.e.sis Publications

Goossens defined a structural operational semantics for a subset of VHDL-87 and proved that the parallelism present in VHDL is benign. We extend this work to include VHDL-93 features such as shared variables and postponed processes that change the underlying semantic model. In the presence of shared variables, nondeterministic execution of VHDL-93 processes destroys the unique meaning property. We identify and characterize a class of portable VHDL-93 descriptions for which unique meaning property can be salvaged. Our specification can serve as a correctness criteria for a VHDL-93 simulator.

Go to article

Prototype Implementation Of The Comprehensive Parallel Integration Tool Parint, Jay Ball Apr 1997

Prototype Implementation Of The Comprehensive Parallel Integration Tool Parint, Jay Ball

Masters Theses

The ParInt project allows users to integrate multivariate functions using parallel computers via different methods encompassed in an easy to use interface. This thesis describes the initial version of the ParInt package. Various pop up windows of the graphical user interface, program procedures, programming paradigms, integration theory, and future considerations are all described.

Go to article

Feedback Control Solutions To Network Level User-Equilibrium Real-Time Dynamic Traffic Assignment Problems, Pushkin Kachroo, Kaan Ozbay Apr 1997

Feedback Control Solutions To Network Level User-Equilibrium Real-Time Dynamic Traffic Assignment Problems, Pushkin Kachroo, Kaan Ozbay

Electrical & Computer Engineering Faculty Research

A new method for performing dynamic traffic assignment (DTA) is presented which is applicable in real time, since the solution is based on feedback control. This method employs the design of nonlinear H∞ feedback control systems which is robust to certain class of uncertainties in the system. The solution aims at achieving user equilibrium on alternate routes in a network setting.

Go to article

Investigating The Use Of Kalman Filtering Approaches For Dynamic Origin-Destination Trip Table Estimation, Pushkin Kachroo, Kaan Ozbay, Arvind Narayanan Apr 1997

Investigating The Use Of Kalman Filtering Approaches For Dynamic Origin-Destination Trip Table Estimation, Pushkin Kachroo, Kaan Ozbay, Arvind Narayanan

Electrical & Computer Engineering Faculty Research

This paper studies the applicability of Kalman filtering approaches for network wide traveler origin-destination estimation from link traffic volumes. The paper evaluates the modeling assumptions of the Kalman filters and examines the implications of such assumptions.

Go to article

Distributed Query Processing For Structured And Bibliographic Databases, Ee Peng Lim, Ying Lu Apr 1997

Distributed Query Processing For Structured And Bibliographic Databases, Ee Peng Lim, Ying Lu

Research Collection School Of Computing and Information Systems

To support future digital library systems which draw information from different sources on the internet, we have to provide integrated queries to pre-existing database servers which contain structured, semi-structured and unstructured data. In this paper, we specifically examine the problem of querying both existing structured relational databases and bibliographic databases. By adopting the well-accepted Z39.50 standard protocol to access bibliographic databases in different legacy library systems, we have developed an extended SQL model, known as HarpSQL, to support integrated queries to both SQL databases and bibliographic databases. Using HarpSQL, one can not only query bibliographic databases in an SQL manner, …

Go to article

A New On-Line Cash Check Scheme, Robert H. Deng, Yongfei Han, Albert B. Jeng, Teow-Hin Ngair Apr 1997

A New On-Line Cash Check Scheme, Robert H. Deng, Yongfei Han, Albert B. Jeng, Teow-Hin Ngair

Research Collection School Of Computing and Information Systems

This paper presents a new on-line cash check scheme which guarantees payor anonymity and improves upon existing similar schemes in efficiency and security.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 3, March 1997, College Of Engineering And Computer Science, Wright State University Mar 1997

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 13, Number 3, March 1997, 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.

Go to article

Computer Access For Students With Disabilities: An Adaptive Technology Laboratory, Frances Grodzinsky Mar 1997

Computer Access For Students With Disabilities: An Adaptive Technology Laboratory, Frances Grodzinsky

School of Computer Science & Engineering Faculty Publications

Adaptive technology, which permits equity of access, has helped to reassure people with disabilities that they can attempt a university education with minimal accommodation.

Go to article

An Introduction To Algorithmic Information Theory: Its History And Some Examples, George Markowsky Mar 1997

An Introduction To Algorithmic Information Theory: Its History And Some Examples, George Markowsky

Computer Science Faculty Research & Creative Works

The goal of this paper is to provide a simple introduction to Algorithmic Information Theory (AIT) that will highlight some of the main ideas without presenting too many details. More technical treatments of these ideas can be found in References [1], [2], [3] and [4], which are listed at the end of the paper. The main ideas of Algorithmic Information Theory will be presented using English as the underlying programming language. The presentation illustrates the fact that the same arguments can be expressed in any other reasonable language and that the main results have a robust universality across all reasonable …

Go to article

A System For Query Comprehension, Hock Chuan Chan, Kwok Kee Wei, Keng Siau Mar 1997

A System For Query Comprehension, Hock Chuan Chan, Kwok Kee Wei, Keng Siau

Research Collection School Of Computing and Information Systems

A major difficulty of query writing is that users do not fully understand queries. A system providing feedback is proposed so as to enable users to better understand their queries. It is a multi-functional rule-based system. In addition to providing an English translation for the query, it pin-points syntax errors, and suggests possible solutions. It also finds likely semantic errors, and provides possible solutions. The system was implemented for a query language based on the entity relationship model. It is expected to lead to better user performance. Empirical testing showed significant improvement in user performance with the feedback system. The …

Go to article

Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan Mar 1997

Cascade Artmap: Integrating Neural Computation And Symbolic Knowledge Processing, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper introduces a hybrid system termed cascade adaptive resonance theory mapping (ARTMAP) that incorporates symbolic knowledge into neural-network learning and recognition. Cascade ARTMAP, a generalization of fuzzy ARTMAP, represents intermediate attributes and rule cascades of rule-based knowledge explicitly and performs multistep inferencing. A rule insertion algorithm translates if-then symbolic rules into cascade ARTMAP architecture. Besides that initializing networks with prior knowledge can improve predictive accuracy and learning efficiency, the inserted symbolic knowledge can be refined and enhanced by the cascade ARTMAP learning algorithm. By preserving symbolic rule form during learning, the rules extracted from cascade ARTMAP can be compared …

Go to article

First Prev Next Last