Digital Commons Network^™

Formal Generation Of Executable Assertions For Application-Oriented Fault Tolerance, Hanan Lutfiyya, Martina Schollmeyer, Bruce M. Mcmillin

Computer Science Technical Reports

Executable assertions embedded into a distributed computing system can provide run-time assurance by ensuring that the program state, in the actual run-time environment, is consistent with the logical stage specified in the assertions; if not, then an error has occurred and a reliable communication of this diagnostic information is provided to the system such that reconfiguration and recovery can take place. Application- oriented fault tolerance is a method that provides fault detection using executable assertions based on the natural constraints of the application.

This paper focuses on giving application-oriented fault tolerance a theoretical foundation by providing a mathematical model for …

Using Flexible Transactions To Support Multisystem Telecommunication Applications, Mansoor Ansari, Linda Ness, Marek Rusinkiewicz, Amit P. Sheth

Kno.e.sis Publications

Service order provisioning is an important telecommunication application that automates the process of providing telephone services in response to the customer requests. It is an example of a multi-system application that requires access to multiple, independently developed application systems and their databases. In this paper, we describe the design and implementation of a prototype system1 that supports the execution of the Flexible Transactions and its use to develop the service order provisioning application. We argue that such approach may be used to support the development of multi-system, flow-through processing applications in a systematic and organized manner. Its advantages include fast …

Remote Memory Backing Storage For Distributed Virtual Memory Operating Systems (Thesis), James Griffoen

Department of Computer Science Technical Reports

No abstract provided.

Multiple Learner Systems Using Resampling Methods, Binyun Xie

Computer Science Theses & Dissertations

The N-Learners Problem deals with combining a number of learners such that the resultant system is "better", under some criterion, than the best of the individual learners. We consider a system of probably approximately correct concept learners. Depending on the available information, there are several methods to make the composite system better than the best of the individual learners. If a sample and an oracle that generates data points (but, not their classification) is available, then we show that we can achieve arbitrary levels of the normalized confidence of the composite system if (a) a robust learning algorithm is available, …

Observing Reusable Password Choices, Eugene H. Spafford

Department of Computer Science Technical Reports

No abstract provided.

Why That Expression Has This Type, And How It Got It, Mike Beaven

Department of Computer Science Technical Reports

No abstract provided.

A Data Structure For Dynamically Maintaining Rooted Trees, Greg N. Frederickson

Department of Computer Science Technical Reports

No abstract provided.

Piecewise Rational Approximations Of Real Algebraic Curves, Chanderjit L. Bajaj, Guoliang Xu

Department of Computer Science Technical Reports

No abstract provided.

Ccis Networking - July 1992, Nova University

CCIS Networking / SCIS Networking magazines

No abstract provided.

Fault Tolerance In Concurrent Systems Through Formal Methods, H. Lutfiyya, B. M. Mcmillin

Computer Science Technical Reports

An important aspect which is often overlooked in the software design cycle is the question of assurance. Many methodologies in the past have attempted to provide assurance efficiently, but have never been sucessful at eliminating explicit time and space redundancy. One approach is the Application-Oriented Fault Tolerance Paradigm, which provides assurance by examining the behavior and propenies of the application and deriving executable assertions for the detection of faults. Previous work has demonstrated the feasibility of the application-oriented fault tolerance paradigm for various applications. However, the executable assertions were guided by the natural constraints of the problem. This work focuses …

On Global Transaction Scheduling Criteria In Multidatabase Systems, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

On Structure Features Of Global Transactions In Multidatabase Systems, Aidong Zhang, Jin Jing

Department of Computer Science Technical Reports

No abstract provided.

Text-Independent Automatic Speaker Identification Using Partitioned Neural Networks, Laszlo Rudasi

Electrical & Computer Engineering Theses & Dissertations

This dissertation introduces a binary partitioned approach to statistical pattern classification which is applied to talker identification using neural networks. In recent years artificial neural networks have been shown to work exceptionally well for small but difficult pattern classification tasks. However, their application to large tasks (i.e., having more than ten to 20 categories) is limited by a dramatic increase in required training time. The time required to train a single network to perform N-way classification is nearly proportional to the exponential of N. In contrast, the binary partitioned approach requires training times on the order of N². …

Parallel Computer Needs At Dartmouth College, David Kotz, Fillia Makedon, Matt Bishop, Scot Drysdale, Don Johnson, Takis Metaxas

Computer Science Technical Reports

To determine the need for a parallel computer on campus, a committee of the Graduate Program in Computer Science surveyed selected Dartmouth College faculty and students in December, 1991, and January, 1992. We hope that the information in this report can be used by many groups on campus, including the Computer Science graduate program and DAGS summer institute, Kiewit's NH Supercomputer Initiative, and by numerous researchers hoping to collaborate with people in other disciplines.

We found significant interest in parallel supercomputing on campus. An on-campus parallel supercomputing facility would not only support numerous courses and research projects, but would provide …

Linear Assignment Problem Revisited: Average (1 + 1/E)-Out Degree Bipartite Graph Has A Perfect Match, Michael Karoński, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

Nurbs Approximation Of Surface/Surface Intersection Curves, Chandrajit L. Bajaj, Gualiang Xu

Department of Computer Science Technical Reports

No abstract provided.

Exact Arithmetic Solid Modeling (Ph.D. Thesis), Juixun, Yu

Department of Computer Science Technical Reports

No abstract provided.

Parallel Iterative Methods, N. P. Christochoides, Elias N. Houstis, S. B. Kim, M. K. Samartzis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Parallel Monte Carlo Trials, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

The best results of Monte Carlo methods are generally obtained by performing the same computation many times with different random numbers. We develop a generic algorithm for parallel execution of Monte Carlo trials on a multicomputer. The generic algorithm has been adapted for simulated annealing and primality testing by simple substitutions of data types and procedures. The performance of the parallel algorithms was measured on a Computing Surface.

Designing Efficient Maximum-Likelihood Soft-Decision Decoding Algorithms For Linear Block Codes Using Algorithm A*, Yunghsiang S. Han, Carlos R.P. Hartmann

Electrical Engineering and Computer Science - Technical Reports

In this report we present a class of efficient maximum-likelihood soft-decision decoding algorithms for linear block codes. The approach used here is to convert the decoding problem into a search problem through a graph which is a trellis for an equivalent code of the transmitted code. Algorithm A*, which uses a priority-first search strategy, is employed to search through this graph. This search is guided by an evaluation function f defined to take advantage of the information provided by the received vector and the inherent properties of the transmitted code. This function f is used to drastically reduce the search …

Primality Testing, Per Brinch Hansen

Electrical Engineering and Computer Science - Technical Reports

This tutorial describes the Miller-Rabin method for testing the primality of large integers. The method is illustrated by a Pascal algorithm. The performance of the algorithm was measured on a Computing Surface.

Sequential And Parallel Discrete Event Simulation On Computer Communication Networks, Tao Zhou

Masters Theses

This thesis presents the discrete event simulation technique on the network design, focusing on the methodology, modeling and implementation. The developed technique is suitable for the analysis of any store-and-forward computer communication networks with any level of complexity. The proposed generic simulation model can be used to test the architectures and protocols of existing networks and networks being designed. In implementation of the sequential discrete event simulation, an object-oriented programming strategy is applied to the network simulation using the C++ language. The parallel discrete event simulation is introduced to solve the problem of long time execution of the sequential simulation …

Design Of A Laboratory Computer Interface, Douglas L. Durand

Theses and Dissertations

An interface for the LSI-11 computer was designed and implemented so that the computer supports data acquisition, data reduction, and equipment control. The design includes both hardware and software and addresses both parallel and serial input/output (I/0). The serial interface's hardware is simply a Serial Line Unit card. This card plugs into the LSI-11 bus and provides the signals necessary to interface EIA RS-232 compatible devices. A software utility was developed to allow communication with the serial device and to allow exchange of data files. Routines were written to allow serial I/O through a FORTRAN program. The interface's parallel hardware …

New Algorithms For Mid-Crack Codes In Image Processing, Wai-Tak Wong

Theses

The chain code is a widely-used description for a contour image. Recently, a mid-crack code algorithm has been proposed as another more precise method for image representation. New algorithms using this new mid-crack code for image representation, restoration, and skeletonization are developed. The efficiency and accuracy can be increased obviously.

Firstly, the conversion of a binary image with multiple regions into the mid-crack codes is presented. A fast on-line implementation can be achieved using tables look-up. The input binary image may contain several object regions and their mid-crack codes can be extracted at the same time in a single-pass row-by-row …

Interpreting And Integrating Landsat Remote Sensing Image And Geographic Information System By Fuzzy Unsupervised Clustering Algorithm, Gwotsong Philip Chen

Theses

Due to the resolution of Landsat images and the multiplicity of the terrain, it is improper to assign each pixel in an image to one of a number of land cover types by using the conventional remote sensing classification method. This is also known as the hard partition method. The concept of the fuzzy set provides the means to resolve this problem. This paper presents a two-pass-mode fuzzy unsupervised clustering algorithm.

In the first passing, the cluster mean vectors which represent the geographic attributes or the land cover types are derived. In the second passing, the concept of fuzzy set …

An Application Of Program Unification To Priority Queue Vectorization, Ling-Yu Chuang, Vernon J. Rego, Aditya P. Mathur

Department of Computer Science Technical Reports

No abstract provided.

Minimizing Total Wire Length During 1-Dimensional Compaction, Susanne E. Hambrusch, Hung-Yi Tu

Department of Computer Science Technical Reports

No abstract provided.

Future Research Directions In Problem Solving Environments For Computational Science, Stratis Gallopoulos, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Optimally Computing The Shortest Weakly Visible Subedge For A Simple Polygon, Danny Z. Chen

Department of Computer Science Technical Reports

No abstract provided.

Unified Stochastic Simulations For Vector Machines: Empirical Results, Vernon J. Rego, Ling-Yu Chuang, Aditya P. Mathur

Department of Computer Science Technical Reports

No abstract provided.