ppxscal/embedding_network huggingface dataset:
Fault-Tolerant and Efficient Parallel Computation
Authors: Alexander A Shvartsman
Venue:  (1992)

Recent advances in computer technology made parallel machines a reality. Massively parallel systems use many general-purpose, inexpensive processing elements to attain computation speed-ups comparable to or better than those achieved by expensive, specialized machines with a small number of fast processors. In such setting, however, one would expect to see an increased number of processor failures attributable to hardware or software. This may eliminate the potential advantage of parallel computation. We believe that this presents a reliability bottleneck that is among fundamental problems in parallel computation. We investigate {\em algorithmic ways of introducing fault-tolerance in multiprocessors under the constraint of preserving efficiency}. This research demonstrates how in certain models of parallel computation it is possible to combine efficiency and fault-tolerance. We show that in the models we study, it is possible to develop efficient parallel algorithms without concern for fault-tolerance, and then correctly and efficiently execute these algorithms on parallel machines whose processors are subject to arbitrary dynamic fail-stop errors. By ensuring efficient executions for any patterns of failures, the efficiency is also maintained when failures are infrequent, or when the expected number of failures is small. The efficient algorithmic approaches to multiprocessor fault-tolerance presented in this thesis make a contribution towards bridging the gap between the abstract models of parallel computation and realizable parallel architectures.
Completeness and Incompleteness of Trace-Based Network Proof Systems
Authors: Jennifer Widom, David Gries, Fred B. Schneider
Venue:  (1986)

Most trace-based proof systems for networks of processes are known to be incomplete. Extensions to achieve completeness are generally complicated and cumbersome. In this paper, a simple trace logic is defined and two examples are presented to show its inherent incompleteness. Surprisingly, both examples consist of only one process, indicating that network composition is not a cause of incompleteness. Axioms necessary and sufficient for the relative completeness of a trace logic are then presented.
The Mesh Archetype
Authors: Berna L. Massingill
Venue:  (1996)

A parallel program archetype aids in the development of reliable, efficient parallel applications with common computation/communication structures by providing development methods and code libraries specific to the structure. This document presents an archetype for mesh computations. It describes the common structure captured by the archetype abstraction, discusses a parallelization strategy for such computations, documents our code library to support this parallelization strategy, and presents a collection of example application programs.
Ethernet Networks: Design, Implementation, Operation, & Management, 4 edition
Authors: Gilbert Held
Venue:  (2002)

:Improve your skills in employing Ethernet hubs, switches, and routers, learn how to set up and operate a wireless Local Area Network (LAN). Discover how to extend a wired Ethernet via wireless LANs. Understand cabling standards and the role of NEXT (Near End Crosstalk). FEXT (Far End Crosstalk) and other transmission parameters, and profit from Gilbert Held's tips and tricks on enhancing security. Network planners, administrators, and system engineers working with Ethernet networks will find Ethernet Networks, Fourth Edition, an invaluable tool for implementing. updating, and managing their networks.
On the Semantics of "Data Type"
Authors: James E. Donahue
Venue:  (1977)

This paper considers the general problem of specifying the meaning of programming languages which include "data type definition facilities". The fundamental question posed in attempting to define such languages is: "what meaning should be given to a data type definition," or more simply, "what does data type mean?". In this paper we describe a new approach to defining the meaning of data types and give its application to the definition of a typed lambda calculus extension. We also prove a theorem stating that our language is "strongly typed".
Techniques for the evaluation of XML queries: a survey
Authors: Tae-Sun Chung, Hyoung-Joo Kim
Venue: Data Knowledge Engineering (2003)

As XML has become an emerging standard for information exchange on the World Wide Web it has gained great attention among database communities with respect to extraction of information from XML, which is considered as a database model. XML queries enable users to issue many kinds of complex queries using regular path expressions. However, they usually require large search space during query processing. So, the problem of XML query processing has received significant attention. This paper surveys the state of the art on the problem of XML query evaluation. We consider the problem in three dimensions: XML instance storage, XML query languages and XML views, and XML query language processing. We describe the problem definition, algorithms proposed to solve it and the relevant research issues.
Detection of Response Time Failures of Real-Time Software
Authors: B. R. Pekilis, R. E. Seviora
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Classical software reliability research has tended to focus on behavioral-type failures which typically manifest themselves as incorrect or missing outputs. In real-time software, a correct output which is not produced within a specified response time interval may also constitutes a failure. As a result, response time failures must also be taken into account when real-time software reliability is assessed. Response-time requirements can be stated in a hard or a soft form. The latter form is often preferred when the quality of service offered is of concern. In a number of real-time applications, the responses to a particular stimulus are highly state dependent and, therefore, the response time requirements must be predicated on state.This paper considers the case where the detection of response times failures is done by a separate unit which observes the inputs and outputs of the target software. Automatic detection of such failures is complicated by state dependencies which require the unit to track a target's state as well as the elapsed times between specified stimulus and response pairs. A novel, black-box approach is described for detecting response time failures and quality of service degradations of session-oriented, real-time software.The behavior of the target software is assumed to be specified in a formalism based on the notion of communicating extended finite state machines. The response time failure detection unit, implemented independently of the target software, interprets a formal model derived directly from the target's requirement specifications. The model is used both to track the state of the target and to determine when to start and stop time interval timing measurements. Measurements of multiple response time intervals may occur simultaneously. The approach was evaluated on the call processing program of a small telephone exchange. Some results of the evaluation are presented and discussed.
The Two Real-Time Solitudes: computerized control and telecommunications
Authors: Paul Freedman, Daniel Gaudreau, Raouf Boutaba, Ahmed Mehaoua
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

While the two solitudes of our title, computerized control and telecommunications, are both concerned with computerized solutions to real world problems, we suggest that they are really addressing different needs and are therefore naturally preoccupied by slightly different concerns. Here we present a taxonomy of key elements intended to make such differences explicit in order to promote more mutual understanding and more collaborative work where concerns are shared. In particular, we suggest that one key difference lies in the nature of the timing requirements associated with reactivity, and whether they are considered as extensions to logical correctness or performance.
Stereoscopic families of permutations, and their applications
Authors: Uriel Feige, Robert Krauthgamer
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

A stereoscopic family of permutations maps an m-dimensional mesh into several one-dimensional lines, in a way that jointly preserves distance information. Specifically, consider any two points and denote their distance on the m-dimensional mesh by d. Then the distance between their images, on the line on which these images are closest together, is O(d^m).We initiate a systematic study of stereoscopic families of permutations. We show a construction of these families that involves the use of m+1 images. We also show that under some additional restrictions (namely, adjacent points on the image lines originate at points which are not too far away on the mesh), three images are necessary in order to construct such a family for the two-dimensional mesh.We present two applications for stereoscopic families of permutations. One application is an algorithm for routing on the mesh that guarantees delivery of each packet within a number of steps that depends upon the distance between this packet's source and destination, but is independent of the size of the mesh. Our algorithm is exceptionally simple, involves no queues, and can be used in dynamic settings in which packets are continuously generated. Another application is an extension of the construction of non-expansive hash functions of Linial and Sasson (STOC 96) from the case of one dimensional metrics to arbitrary dimensions.
Photoshop 7 Zero to Hero
Authors: Martin Jacobsen, Vikas Shah, Adam Juniper, Julie Hatton
Venue:  (2003)

:Photoshop 7 is the professional image-editing standard. With tools and output options to allow you to produce the highest quality images for print, the Web, and anywhere else. It's a complex tool, and with such complexity and freedom come questions: how, where, why? Photoshop 7 Zero to Hero, cuts to the chase, you'll quickly learn how to do professional-quality photo retouching, prepare your work for print, or simply use its filters and effects to create whatever you desire. Pro-standard output such as magazine covers and optimized Web graphics are taught clearly and quickly. Whether you've never used an image manipulation program before, or this is just your first encounter with Photoshop, this book will take you further, faster. Zero to Hero is more than a catchy slogan and an opportunity for puns and graphical representations of tights, capes, and phone booths. It's a style of learning designed by friends of ED to reach beyond dry technical explanations and dusty old authors who don't know how it is for real users and wouldn't know good design if it slapped them round the face with a wet fish. With a Zero to Hero book you can choose how you learn. You can choose to learn everything you need to know about Adobe Photoshop 7 by working through the first section of the book from start to finish. Alternatively you can dive straight in to the inspirational 'Hero' chapters and refer back as and when you need. Then later, when you're a hero yourself, the book is easily used as a reference tool. And when you're done you'll be ready to wear your underwear on the outside, metaphorically speaking of course. And if you get stuck, our support heroes are just an e-mail away. With all books from friends of ED - our support is fast, friendly and free. All friends of ED authors help with the support on their books, and will either directly e-mail people with answers, or send their response to an editor to pass on. Information and Inspiration. Speed and Support. We'll not only unlock the toolset for you, we'll feed your imagination and that's a promise. So, what are you waiting for?
A Proof System for Dataflow Networks with Indeterminate Modules
Authors: Abha Moitra, Prakash Panangaden
Venue:  (1986)

In this paper we discuss a model for dataflow networks containing indeterminate operators and the associated proof system. The model is denotational and associates with each network the set of possible behaviors. The possible behaviors are represented by traces. The novel feature of our proof system is that we give an inductive proof rule for recursively defined networks based on a fixed point construction given by Keller and Panangaden. We show soundness and relative completeness of our proof system.
Cost-Effective Switching Fabrics with Distributed Control for Scalable Routers
Authors: Nian-Feng Tzeng, Malcolm Mandviwalla
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

This paper deals with scalable switching fabrics for high-performance routers with large numbers of ports for connecting external links operating at various speeds to arrive at aggregate rates up to multi-terabits per second. The proposed switching fabrics employ no centralized scheduling and consist of small routing units (RU's), which are interconnected by multistage-based connecting components (CC's) in accordance with grid structures, with routing decisions made by RU's and CC's individually in a simple, distributed manner. They are referred to as grid-oriented, multistage-connected RU's, dubbed GMR. With distributed routing, GMR enjoys good scalability and low hardware complexity. It is found, based on our extensive simulation, that GMR outperforms not only their crossbar counterparts for small sizes, but also their compatible designs aiming at large sized construction (built from multiple stages of small crossbars), despite its lower hardware complexity. Two types of chips are sufficient topermit any sized construction; one for RU's and another for CC's. The proposed switching fabrics are cost-effective, readily suitable for scalable routers.
Development and Application of a Formal Agent Framework
Authors: Mark d'Inverno, Michael Luck
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

Previous work has addressed the development of a framework to categorize and understand agent-based systems. It described and formalized an agent-hierarchy that included objects, agents and autonomous agents, each with different levels of functionality, and provided a precise vocabulary with which to discuss agent systems.This paper reviews a large variety of further work that has built on that foundation in several ways. First, the framework itself has been refined to detail important aspects of agent functionality such as goal generation and adoption. Second, the structures and relationships between agents have been specified and analyzed allowing a more complete understanding of the dynamics of agent systems. Third, existing systems and theories have been formalized within the framework so that they may be evaluated and compared in a coherent and consistent way.Finally, some steps have been taken in attempting to construct a methodology for the development of agent-based systems. Though this work spans a large range of concerns, it is based on a single set of basic concepts providing fundamental structure.
A Wearable 3D Augmented Reality Workspace
Authors: Gerhard Reitmayr, Dieter Schmalstieg
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

This poster describes our work to build a wearable Augmented Reality system that supports true stereoscopic 3D graphics. Through a pen and pad interface well known 2D user interfaces can be presented to the user, whereas the tracking of the pen allows to use direct interaction with virtual objects. The system is assembled from off-the-shelf hardware components and serves as a basic test bed for user interface experiments related to collaboration between stationary and mobile AR users.
How fast can one compute the permanent of circulant matrices?
Authors: Anna Bernasconi, Bruno Codenotti, Valentino Crespi, Giovanni Resta
Venue:  (1997)

In this paper we address the problem of computing the permanent of (0,1)-circulant matrices. We investigate structural properties of circulant matrices, showing that (i) if they are dense enough, then they contain large arbitrary submatrices, and, (ii) if they are very sparse, then they are not too ``far'''' from convertible matrices. Building upon (ii), we then develop an efficient algorithm, which allows us to compute permanents of very sparse circulants of size up to 200. EMAIL:: resta@imc.pi.cnr.it
Static caching in Web servers
Authors: I. Tatarinov, A. Rousskov, V. Soloviev
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper studies caching in primary Web servers. We use log files from four Web servers to analyze the performance of various proposed cache policies for Web servers: LRU-threshold, LFU, LRU-SIZE, LRU-MIN, LRU-k-threshold and the Pitkow/Recker (1994) policy. Web document access patterns change very slowly. Based on this fact, we propose and evaluate static caching, a novel cache policy for Web servers. In static caching, the set of documents kept in the cache is determined periodically by analyzing the request log file for the previous period. The cache is filled with documents to maximize cache performance provided document access patterns do not change. The set of cached documents remains constant during the period. Surprisingly, this simple policy results in high cache performance, especially for small cache sizes. Unlike other policies, static caching incur no CPU overhead and does not suffer from memory fragmentation.
Information Scheduling in a Military Satellite Broadcast System
Authors: Perry A. Blackmore
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

This paper presents a linear time complexity scheduling algorithm developed for military satellite broadcast systems carrying heterogeneous traffic types. The objective of the algorithm is to maximize the total military value of information delivered by the system. To achieve this, each task to be scheduled is categorized as either discrete-benefit or continuous-benefit. The categories describe the proportion of total data that must be delivered before an increase in value is achieved. Each discrete-benefit task is described by a time-value function which defines the value in completing that task at any instant. Continuous-benefit tasks are described by a bandwidth-value function which relates the value of that task as a function of instantaneous bandwidth assigned to it. The total military value as a function of bandwidth assigned to each task can be readily computed as the sum of discrete-benefit and continuous-benefit values. The total military value can then be maximized using dynamic programming techniques. Simulation results presented in this paper show the efficacy of the algorithm compared to other common schemes. 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
Building a filtering test collection for TREC 2002
Authors: Ian Soboroff, Stephen Robertson
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Test collections for the filtering track in TREC have typically used either past sets of relevance judgments, or categorized collections such as Reuters Corpus Volume 1 or OHSUMED, because filtering systems need relevance judgments during the experiment for training and adaptation. For TREC 2002, we constructed an entirely new set of search topics for the Reuters Corpus for measuring filtering systems. Our method for building the topics involved multiple iterations of feedback from assessors, and fusion of results from multiple search systems using different search algorithms. We also developed a second set of "inexpensive" topics based on categories in the document collection. We found that the initial judgments made for the experiment were sufficient; subsequent pooled judging changed system rankings very little. We also found that systems performed very differently on the category topics than on the assessor-built topics.
Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling
Authors: W. Mao
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

We consider a communication problem, in which requests for data items arrive from time to time via a terrestrial network and at each broadcast tick the single server chooses a data item to broadcast via a satellite downlink to satisfy all the requests for the item. The goal of the server is to minimize the total wait time of the requests. In this paper, we examine two well-known on-line algorithms used by the server to decide which data item to broadcast at each broadcast tick. In particular, we present complete competitive analysis of the algorithms, a research aspect of the problem which had not been studied before. Our results are consistent with observations obtained by simulation experiments reported in past literature. In addition, we prove a general lower bound to the competitive ratios of all online algorithms. The competitive ratios obtainedfor the two on-line algorithms in fact match our general lower bound, indicating the optimality of the algorithms.
An Algorithmic Semantics for Viewcharts
Authors: Ayaz Isazadeh, David A. Lamb
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Behavioral requirements engineering of large-scale software systems, using current Formal Description Techniques (FDT), is complex and difficult. In Statecharts, this complexity is evident in the form of a blow-up in the number of states and difficulty of managing the name space. We have introduced a notation, called Viewcharts, which reduces the complexity of expressing behavioral requirements of large systems. Viewcharts extends Statecharts to include behavioral views and their composition. In this paper we present an overview of the Viewcharts notation and establish its semantics via translation to Statecharts.
Polynomial Decomposition Algorithms
Authors: Dexter Kozen, Susan Landau
Venue:  (1986)

In a recent paper [BZ], Barton and Zippel examine the question of when a polynomial $f(x)$ over a field of characteristic 0 has a nontrivial decomposition $f(x)=g(h(x))$. They give two exponential-time algorithms, both of which require polynomial factorization. We present an $O(s^{2}r\logr)$ algorithm, where $r$=deg $g$ and $s$ =deg $h$. The algorithm does not use polynomial factorization. We also show that the problem is in $NC$. In addition, we give a new structure theorem for testing decomposibility over any field. We apply this theorem to obtain an $NC$ algorithm for decomposing irreducible polynomials over finite fields and a subexponential algorithm for decomposing irreducible polynomials over any field.