ppxscal/embedding_network huggingface dataset:
A Redundant Disk Array Architecture for Efficient Small Writes
Authors: Daniel Stodolsky, Mark Holland, Garth A. Gibson
Venue:  (1993)

Parity encoded redundant disk arrays provide highly reliable, cost effective secondary storage with high performance for reads and large writes. Their performance on small writes, however, is much worse than mirrored disks --- the traditional, highly reliable, but expensive organization for secondary storage. Unfortunately, small writes are a substantial portion of the I/O workload of many important, demanding applications such as on-line transaction processing. This paper presents parity logging, a novel solution to the small write problem for redundant disk arrays. Parity logging applies journalling techniques to substantially reduce the cost of small writes. We provide a detailed analysis of parity logging and competing schemes --- mirroring, floating storage, and RAID level 5 --- and verify these models by simulation. Parity logging provides performance competitive with mirroring, the best of the alternative single failure tolerating disk array organizations. However, its overhead is close to the minimum offered by RAID level 5. Finally, parity logging can exploit data caching much more effectively than all three alternative approaches.
Verifying epistemic properties of multi-agent systems via bounded model checking
Authors: W. Penczek, A. Lomuscio
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We present a framework for verifying temporal and epistemic properties of multi-agent systems by means of bounded model checking. We use interpreted systems as underlying semantics. We give details of the proposed technique, and show how it can be applied to the "attacking generals problem", a typical example of oordination in multi-agent systems.
Adventures at the Auction: The Ultimate Guide to Buying and Selling at Auction--in Person and Online
Authors: Leslie Hindman, Dan Santow
Venue:  (2002)

:Auctions are a great way to start or add to a collection, furnish a home, purchase a special wedding gift, or own a unique piece of history. And whether they are traditional auctions or online auctions, they can be exciting entertainment, too. But for the many people who are intimidated by auction fears, getting started is half the battle. Leslie Hindman, the Chicago auctioneer and host of two HGTV shows, At the Auction and Appraisal Fair, now shares her inspiring advice on smart buying and selling in Adventures at the Auction. As one of America's best-known auctioneers, Leslie Hindman provides not only what auction-goers need to know, but also reassurance and practical information. She arms readers with the ten most common auction myths, the five most common auction blunders, and the five most important criteria for determining value, along with simple auction basics and hundreds of tips on strategy. She covers buying and selling from beginning to end, with ideas that will inform the seasoned buyer as well as the novice. Then, to inspire readers with the possibilities, she identifies twelve popular categories where bargains still exist, from books to silver to timepieces. Along the way, she entertains with anecdotes from her own twenty-five-year career as an auctioneer. Best of all, for those who want to attend auctions only at home, Hindman includes "On the Internet" sections throughout the book, describing the joys and pitfalls of buying and selling online. As a bonus, she offers glossaries of terms for both traditional and online auctions, a list of Internet acronyms, a directory of auction houses, and a color section that shows, step by step, item by item, what to look for when checking out a potential purchase. Whether you want to go to an auction or log onto eBay, Leslie Hindman's Adventures at the Auction is an invaluable companion. About the Authors:For seven years the host of HGTV's At the Auction and Appraisal Fair, Leslie Hindman is also the founder and CEO of Eppraisals.com, the popular site for Internet appraisals. Her column, "What's It Worth," appears weekly in the Chicago Tribune. Her auction business, Leslie Hindman Auctioneers, was founded in 1982 and was the largest auction house in the Midwest when acquired by Sotheby's in 1997. Leslie Hindman lives in Chicago.Dan Santow, an associate at Eppraisals.com, is a writer. He lives in Chicago.
Content-Based Search for 3-D Objects
Authors: Dejan Vranic
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

The topic of this paper is content-based 3D-object retrieval.The approach is based onFeature evectors, which capture 3D-shape of a model represented as triangle mesh.The feature evectors are invariant with respect to translation, rotation, scaling, and reflection and robust with respect to level-of-detail.Before the feature extraction, each3D-object is transformed (normalized) into a canonical position and orientation.The search is performed in the feature evector space in which the feature evector of a query model is used as a key.Original normalized step and feature evectors are presented in this communication.
Neurules: Improving the Performance of Symbolic Rules
Authors: I. Hatzilygeroudis, J. Prentzas
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper, we present a method for improving the performance of classical symbolic rules. This is achieved by introducing a type of hybrid rules, called neurules, which integrate neurocomputing into the symbolic framework of production rules. Neurules are produced by converting existing symbolic rules. Each neurule is considered as an adaline unit, where weights are considered as significance factors. Each significance factor represents the significance of the associated condition in drawing the conclusion. A rule is fired when the corresponding adaline output becomes active. This significantly reduces the size of the rule base and, due to a number of heuristics used in the inference process, increases inference efficiency.
Spout: A Transparent Distributed Execution Engine for Java Applets
Authors: Tzi-cker Chiueh, Harish Sankaran, Anindya Neogi
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

The advent of executable contents such as Java applets exposes WWW users to a new class of attacks that were not possible before. Serious security breach incidents due to implementation bugs arose repeatedly in the past several years. Without a provably correct implementation of Java's security architecture specification, it is difficult to make any conclusive statements about the security characteristic of current Java virtual machines.The Spout project takes an alternative approach to address Java's security problems. Rather than attempt a provably secure implementation, we aim to confine the damages of malicious Java applets to selective machines, thus protecting resources behind an organization's firewall from attacks by malicious or buggy applets. Spout is essentially a distributed Java execution engine that transparently decouples the processing of an incoming applet's application logic from that of graphical use interface (GUI), such that the only part of an applet that is actually running on the requesting user's host is the harmless GUI code.A unique feature of the Spout architecture that does not exist in other similar systems is that it is completely transparent to and does not require any modifications to WWW browsers or class libraries on the end hosts. This paper describes the design, implementation, and performance measurements of the first Spout prototype, which also incorporates run-time resource monitoring mechanisms to counter denial-of-service attacks.
A comprehensive pre-RTL IC design methodology
Authors: P. P. Jain
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

Complex integrated circuit (IC) designers must make design decisions to meet the functional and performance requirements of their specific ICs prior to register-transfer level (RTL) coding. CMEG, a comprehensive pre-RTL IC design methodology, is described. It is illustrated through an example of an image processing algorithm, and is compared against hardware description language and behavioral synthesis design methods. CMEG consists of the following steps: C_apture behavior graphically, M_ap operations to hardware instances, E_valuate designs graphically via simulation, and G_enerate RTL models and validation vectors automatically. This comprehensive methodology offers the following benefits: (1) CMEG is pragmatic. (2) CMEG is useful for a wide range of application domains and IC design styles. (3) CMEG provides developers with total control. (4) CMEG allows developers to validate functionality and architecture prior to RTL construction. (5) CMEG produces better IC designs in less time. Using this methodology, designers need only work at the architectural level. At this level, the RTL model, correct by construction, is automatically derived from the architectural model, and all the logic expressions are automatically generated and correct by construction. Validating design graphically at a higher level of design abstraction improves designer confidence in the RTL model. CMEG gives developers added flexibility to maintain and enhance their designs and to establish better communication with other designers, as well as with managers and customers.
Estimation of Software Diversity by Fault Simulation and Failure Searching
Authors: Luping Chen, John May, Gordon Hughes
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

An important problem for computer-based systems is providing fault tolorance for unknown (at the time of commencement of service) systematic design errors.Such design errors can have a long latency in normal operation and only become apparent under specific conditionsassociated with particular combinations of input and internal system states.The use of'divers' software versions remains a possible approach to prevent coincidental failure, but its potential value has never been quantified. This paper presents the application of data-flow and constant perturbation to simulate the introduction of faults or errors into programs and explores methods to establish the magnitudes and locations of the associated input space failur regions.Used together, these two techniques enable failur behaviour to be described in a quantitative way and provide a method to estimate the diversity of multi-version software.A simple case and a industrial software are studied to illustrate the applications of the approach.
Adaptability in cooperative systems: merging flexibility and performance
Authors: F. Faouzi
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In the complex work environments of modern industrial and administrative organisations, the problems of articulating distributed activities are at a high order of complexity: both high flexibility and performance are needed. The design of adaptive systems can provide a suitable solution to these problems. Adaptability is supported at two levels using both the principles and methodologies of the integrated knowledge based systems and the distributed artificial intelligence systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes
Authors: Chien-Hung Huang, Ju-Yuan Hsiao, R. C. T. Lee, Jywe-Fei Fang
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

It has been proved that incomplete binary trees can not be embedded onto incomplete hypercubes with both expansion-1 and dilation-1. In this paper, we propose an optimal embedding algorithm to embed this issue with expansion-1, dilation-2. Our algorithm is a linear time algorithm, which is optimal in terms of time complexity. Furthermore, the embedding scheme is as desirable to be simple such that the implementation is quite easy.
Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases
Authors: P. A. Patsouris
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

We introduce and formalize the concept of two-level-hierarchies (t-l-hs) of objects. The t-l-hs are special partial directed acyclic graphs having as vertices objects. An equivalence relation is also defined on their edges. They are used for modelling complex objects by supporting, in a uniform way, the well known abstractions like association, aggregation, grouping as well as specialization and generalization. Considering the t-l-h as the design unit, we develop a new design process (Uni-Design) for the distributed object-oriented databases (DOODBs) by combining the main design approaches (Top-Down and Bottom-Up) in a consistent and complementary way leading to capture and represent explicitly most of the semantics of a system. We also choose the t-l-h as the elementary unit of distribution in order to adopt a distribution design strategy (a DOODB is now a set of possibly interrelated t-l-hs) and reconsider the notions of fragmentation and replication by integrating the distribution process at the last phase of the Uni-Design process.
Node-to-Node Cluster Fault Tolerant Routing in Hypercubes
Authors: Qian-Ping Gu, Shietung Peng
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper, we study the node-to-node fault tolerant routing problem in the n-dimensional hypercube H_n based on the cluster fault tolerant model. For a graph G, a faulty cluster is a connected subgraph of G such that all its nodes are faulty. In cluster fault tolerant routing problems, how many faulty clusters and how large of those clusters can be tolerated are studied. It has been known that for the node-to-node routing, n-dimensional hypercube H_n can tolerate as many as n-1 faulty clusters of diameter at most 1 with at most 2n-3 faulty nodes in total. In this paper, we extend the above result to show the sufficient conditions on faulty clusters of arbitrary diameters that H_n can tolerate. We also give an algorithm which, given a set of faulty clusters satisfying the sufficient conditions and non-faulty nodes s and t in H_n, finds a fault-free path of length d(s,t) + O(log n) in O(n+|F|) optimal time, where |F| is the total number of faulty nodes.
Performance analysis of the Alpha 21364-based HP GS1280 multiprocessor
Authors: Zarka Cvetanovic
Venue: ACM SIGARCH Computer Architecture News (2003)

This paper evaluates performance characteristics of the HP GS1280 shared memory multiprocessor system. The GS1280 system contains up to 64 Alpha 21364 CPUs connected together via a torus-based interconnect. We describe architectural features of the GS1280 system. We compare and contrast the GS1280 to the previousgeneration Alpha systems: AlphaServer GS320 and ES45/SC45. We further quantitatively show the performance effects of these features using application results and profiling data based on the built-in performance counters. We find that the HP GS1280 often provides 2 to 3 times the performance of the AlphaServer GS320 at similar clock frequencies. We find the key reasons for such performance gains are advances in memory, inter-processor, and I/O subsystem designs.
SAMON: Communication, Cooperation and Learning of Mobile Autonomous Robotic Agents
Authors: Eugene Eberbach, Shashi Phoha
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

The Applied Research Laboratory Penn State University ¿Ocean SAmpling MObile Network¿ (SAMON) Project is developing the simulation testbed for the oceanographic communities interactions through the Web interface and the simulation based design of Autonomous Ocean Sampling Program missions. In this paper, a current implementation of the SAMON is presented, and a formal model based on interactive automata is described. The basic model is extended by process algebra constructs to handle mobility, evolution and learning. To allow cooperation of heterogeneous vehicles a generic behavior message-passing language is presented.
The Challenges of Genome Information Management: A Practical Experience
Authors: Shamkant B. Navathe
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

While the accumulation of information on human biology and health is a primary motivation for the human genome initiative, little attention has been paid to how such information will be organized or functionally related to the genomic sequence. This stems from two issues. First, genetic data is complex and multi-layered. Medical genetic information ranges from structural (nucleotide, nucleotide position, mutation position, gene organization, chromosomal assignment) to functional (type of gene, gene expression, biochemical studies), to population-based (frequencies of mutations in different racial/ethnic groups), to clinical-based (family studies, genotype/phenotype correlations) etc. The magnitude of such data will continue to push the limits of information management and integration systems. Second, no portion of the human nuclear genome yet sequenced has been studied extensively enough to generate the magnitude of data that would necessitate the development of an integrated genetic information system.This talk will present an overview of the challenges that confront biologists and the database specialists in terms of creating a useful repository of information that addresses both the above issues. We will describe the MITOMAP system (http://www.gen.emory.edu/mitomap.) which we have developed in collaboration with themolecular genetics department at Emory University by focusing on the mitochondrial genome 3/4 a very small yet very significant subset of the genome.We will discuss the modeling, design and implementation issues of creating this repository. and the issues we have dealt with and the enhancements we propose to make. The system is being developed as a tool for researchers in biomedical science and clinical medicine. It will serve the biological community at large and will be an aid for further work in practical applications such as pharmaceutics or gene therapy. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Visualization for functional design
Authors: B. Spence, L. Tweedie, H. Dawkes, Hua Su
Venue: Proceedings of the 1995 IEEE Symposium on Information Visualization (1995)

We present two novel visualisation tools: the Influence Explorer and the Prosection Matrix. These were specifically created to support engineering artifact design and similar tasks in which a set of parameter values must be chosen to lead to acceptable artifact performance. These tools combine two concepts. One is the interactive and virtually immediate responsive display of data in a manner conducive to the acquisition of insight. The other, involving the precalculation of samples of artifact performance, facilitates smooth exploration and optimisation leading to a design decision. The anticipated benefits of these visualisation tools are illustrated by an example taken from electronic circuit design, in which full account must be taken of the uncertainties in parameter values arising from inevitable variations in the manufacturing process.
Computer Science and the Liberal Arts Student
Authors: Charles Van Loan
Venue:  (1979)

The computer science education of nontechnical liberal arts students is a matter of increasing concern. In this paper it is argued that computer scientists should promote and teach their subject more in line with the traditional aims of liberal education when dealing with students of this type. A framework for doing this is presented which involves a broad view of ``computer literacy'''' based upon what other authors have written about ``scientific literacy.'''' The structure of a computer science appreciation course is outlined which embodies the ideas of liberal education described. The importance of historical perspective is emphasized. Key Words and Phrases: Computer literacy, liberal arts student, liberal education, history of computation, scientific literacy.
Built-in Generation of m -Sequences with Irreducible Characteristic Polynomials
Authors: Dimitri Kagaris
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

In this paper, we show that m-sequences for built-in Test Pattern Generation (TPG) can be efficiently generated by LFSR structures that have non-primitive irreducible characteristic polynomials. We present two mechanisms that can generate the required number of seeds with very low hardware overhead that is independent of the number of seeds. This enhances the choices available for the design of appropriate TPG structures for pseudo-exhaustive or pseudo-random TPG that were previously limited to primitive characteristic polynomials only.
The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses
Authors: Jim Kadin
Venue:  (1987)

The structure of the Boolean hierarchy (BH) is related to the polynomial time hierarchy (PH) by showing that if the BH collapses, then $PH \subseteq \Delta^{P}_{3}$.
Context-Awareness in Wearable and Ubiquitous Computing
Authors: Gregory D. Abowd, Anind K. Dey, Robert Orr, Jason Brotherton
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

A common focus shared by researchers in mobile, ubiquitous and wearable computing is the attempt to break away from the traditional desktop computing paradigm. Computational services need to become as mobile as their users and be extended to take advantage of the constantly changing context in which they are accessed. This paper will report on work done in the Future Computing Environments Group at Georgia Tech. We describe solutions we have generated to provide a flexible context-aware infrastructure and several applications that take advantage of context-awareness to allow freedom from traditional desktop computing.
Mapping parallel iterative algorithms onto workstation networks
Authors: Abdelsalam Heddaya, Kihong Park
Venue:  (1994)

Abstract For communication-intensive parallel applications, the maximum degree of concurrency achievable is limited by the communication throughput made available by the network. In previous work, we showed experimentally that the performance of certain parallel applications running on a workstation network can be enhanced significantly if a congestion control protocol is used to enhance network performance. In this paper, we characterize and analyze the communication requirements of a large class of supercomputing applications that fall under the category of fixed-point problems, amenable to solution by parallel iterative methods. This results in a set of interface and architectural features sufficient for the efficient implementation of the application over a large-scale distributed system. In particular, we propose a direct link between the application and network layer, supporting congestion control actions at both ends. This in turn enhances the system''s responsiveness to network congestion, improving performance. Preliminary results of a prototype system are summarized showing the efficacy of our scheme to support large-scale parallel computations. We conclude with a description of a full implementation in progress.