ppxscal/embedding_network huggingface dataset:
TCP Throughput and Buffer Management
Authors: Todd Lizambri, Fernando Duran, Shukri Wakid
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unknown of the Internet. Many mechanisms have been proposed to bring QoS to TCP/IP and the Internet (RSVP, DiffServ, 802.1p). However, until these techniques and the equipment to support them become ubiquitous, most enterprises will rely on local prioritization of the traffic to obtain the best performance for mission critical and time sensitive applications.This work explores prioritizing critical TCP/IP traffic using a multi-queue buffer management strategy that becomes biased against random low priority flows and remains biased while congestion exists in the network. This biasing implies a degree of unfairness but proves to be more advantageous to the overall throughput of the network than strategies that attempt to be fair.Only two classes of services are considered where TCP connections are assigned to these classes and mapped to two underlying queues with round robin scheduling and shared memory. In addition to improving the throughput, cell losses are minimized for the class of service (queue) with the higher priority.
Set Reconciliation with Nearly Optimal Communication Complexity
Authors: Yaron Minsky, Ari Trachtenberg, Richard Zippel
Venue:  (2000)

We consider a fundamental problem that arises in the context of gossip protocols. Specifically, we consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity. We provide two surprisingly simple and efficient protocols that exhibit tractable computational complexity and nearly optimal communication complexity. These protocols can be adapted to work over a broadcast channel, allowing many clients to reconcile with one host based on a broadcasted signal.\note{We keep on bouncing back and forth on whether the ``a''''s are necessary. I like it better without, but it''s not a big deal.} Thus, an arbitrary number of clients each of whose data differs from that of the host by no more than $N$ bits can be reconciled by a single broadcast of $O(N)$ bits, independent of the the number of clients and independent of the size of the data sets.
High-Speed Management System for Simulating and Retrieving Designs of Computer Components
Authors: P. A. D. DeMaine, M. M. DeMaine
Venue:  (1989)

Currently available database systems have inherent limitations, which prohibit their use for many modern applications. The Self Organizing Large Information Dissemination (SOLID) system was designed to overcome these limitations. Because the SOLID system offers considerable flexibility, it also requires control information. For example, the SOLID system allows one of three different formats for the index. A decision-maker must choose one format, and inform the SOLID system which format has been choosen. One possible decision-maker it the user. If SOLID needs control information, the user supplies it. Unfortunately, this approach assumes that the user has a working knowledge of the SOLID system. Another possible decision-maker is an interface between the user and the SOLID system. The primary goal of the SOLID user interface is to allow the user to exploit the features of the SOLID system without requiring a working knowledge of it.
Formal test specifications in open systems
Authors: J. F. Leathrum, K. A. Liburdy
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

The development of formal test specifications for an open system standard is described. The effort is being conducted within the environment provided by the Clemson Automated Testing System (CATS). CATS features the ability to automatically translate formal test specifications into executable tests. The formal test specifications are written in accordance with a specification language designed in support of this effort. An overview of the CATS architecture and formal test specification language provide a backdrop for an experience report on the development of formal test specifications for IEEE Std 1003.5 POSIX Ada Language Interfaces. A discussion of scale-up issues concludes the paper.
Efficient Parallel Solutions of Large Sparse SPD Systems on Distributed-memory Multiprocessors
Authors: Chunguang Sun
Venue:  (1992)

We consider several issues involved in the solution of sparse symmetric positive definite system by multifrontal method on distributed-memory multiprocessors. First, we present a new algorithm for computing the partial factorization of a frontal matrix on a subset of processors which significantly improves the performance of a distributed multifrontal algorithm previously designed. Second, new parallel algorithms for computing sparse forward elimination and sparse backward substitution are described. The new algorithms solve the sparse triangular systems in multifrontal fashion. Numerical experiments run on an Intel iPSC/860 and an Intel iPSC/2 for a set of problems with regular and irregular sparsity structure are reported. More than 180 million flops per second during the numerical factorization are achieved for a threedimensional grid problem on an iPSC/860 machine with 32 processors.
Energy-Efficient Indexing on a Broadcast Channel in a Mobile Database Access System
Authors: Y. C. Chehadeh, A. R. Hurson, L. L. Miller
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Advances in communication and computation technologies and the recent marriage between the two allow users to have access to information sources via portable, mobile computing devices, and wireless connection. Broadcasting has been suggested as a possible solution for several limitations within this new environment. In order to limit the amount of energy consumed at the mobile unit, indexing can be considered as an energy-efficient solution within the broadcasting environment.In this work, we suggest possible allocation strategies of indexes along with their data objects (for an object-oriented database environment) on the broadcast channel. We conduct the timing analysis and simulation necessary to observe the effects of the allocation strategies on both the response time and energy consumption at the mobile clients.
Language Report and Description for BVL-0
Authors: Tomboulian,  S, Mace,  M, A R Wagner
Venue:  (1986)

Much work has been done recently in the area of array processors and supercomputer hardware and algorithms, but little effort has been spent in designing languages suited to the philosophical concept of these machines. Some languages do exist, such as parallel Fortran developed for the ILLIAC IV [1], but these are essentially standard serial languages that have been modified to work on a few dozen or a few hundred processors. When dealing with a machine, such as the Boolean Vector machine (BVM) [2], which has thousands of processors (PEs) it is necessary to develop a different language concept. This paper presents a description of a simple language (BVLO) which embodies some of these concepts. The implementation is discussed, and some suggestions are made as to possible higher level language improvements.
A Mechanized Proof Environment for the Convenient Computations Proof Method
Authors: Marcelo Glusman, Shmuel Katz
Venue: Formal Methods in System Design (2003)

A mechanized verification environment made up of theories over the deductive mechanized theorem prover PVS is presented, which allows taking advantage of the &ldquo;convenient computations&rdquo; method. This method reduces the conceptual difficulty of proving a given property for all the possible computations of a system by separating two different concerns: (1) proving that special convenient computations satisfy the property, and (2) proving that every computation is related to a convenient one by a relation which preserves the property. The approach is especially appropriate for applications in which the first concern is trivial once the second has been shown, e.g., where the specification itself is that every computation reduces to a convenient one. Two examples are the serializability of transactions in distributed databases, and sequential consistency of distributed shared memories. To reduce the repetition of effort, a clear separation is made between &ldquo;infrastructural&rdquo; theories to be supplied as a proof environment PVS library to users, and the specification and proof of particular examples. The provided infrastructure formally defines the method in its most general way. It also defines a computation model and a reduction relation&mdash;the equivalence of computations that differ only in the order of finitely many independent operations. One way to prove that this relation holds between every computation and some convenient one involves the definition of a measure function from computations into a well-founded set. Two possible default measures, which can be applied in many cases, are also defined in the infrastructure, along with useful lemmas that assist in their usage. We show how the proof environment can be used, by a step-by-step explanation of an application example.
DNA Sequence Classification Using Compression-Based Induction
Authors: D. Lowenstern, H. Hirsh, M. Noordiwier, P. Yianilos
Venue:  (1995)

Inductive learning methods, such as neural networks and decision trees, have become a popular approach to developing DNA sequence identification tools. Such methods attempt to form models of a collection of training data that can be used to predict future data accurately. The common approach to using such methods on DNA sequence identification problems forms models that depend on the {\em absolute locations} of nucleotides and assume {\em independence} of consecutive nucleotide locations. This paper describes a new class of learning methods, called {\em compression-based induction} (CBI), that is geared towards sequence learning problems such as those that arise when learning DNA sequences. The central idea is to use text compression techniques on DNA sequences as the means for generalizing <from sample sequences. The resulting methods form models that are based on the more important {\em relative locations} of nucleotides and on the {\em dependence} of consecutive locations. They also provide a suitable framework into which biological domain knowledge can be injected into the learning process. We present initial explorations of a range of CBI methods that demonstrate the potential of our methods for DNA sequence identification tasks.
Commodious axiomatization of quantifiers in multiple-valued logic
Authors: R. Hahnle
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We provide a concise axiomatization of a broad class of generalized quantifiers in many-valued logic, so-called distribution quantifiers. Although sound and complete axiomatizations for such quantifiers exist, their size renders them virtually useless for practical purposes. We show that for certain lattice-based quantifiers relatively small axiomatizations can be obtained in a schematic way. This is achieved by providing an explicit link between skolemized signed formulas and filters/ideals in Boolean set lattices.
The Matchbox: A Small Wearable Platform
Authors: Greg DeFouw, Vaughan Pratt
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

We describe the Matchbox PC, a fully functional PC not much larger than a box of matches yet able to run popular operating systems such as Linux and Windows and to perform most tasks commonly run on desktop PCs. Although our motivating application is wearable computing, we expect many other applications will emerge.
An Effective Selection Policy for Load Balancing in Software DSM
Authors: Tyng-Yeu Liang, Ce-Kuen Shieh, Jun-Qi Li
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Load balance is an area of current research in software distributed shared memory (DSM) systems. When threads are dynamically migrated from heavily loaded nodes to lightly loaded nodes to achieve load balance, the communication cost of maintaining data consistency is increased if migration threads are carelessly selected. Program performance is degraded when loss from increased communication exceeds the benefit from load balancing. Therefore, load balancing requires careful choice of migration threads. This study addresses the problem with a novel selection policy called Reduce Inter-node Sharing Cost (RISC). The main characteristic of this thread selection policy is simultaneous consideration of both thread memory access types and global sharing. Experimental application of this policy to a DSM system called Cohesion shows that simultaneous consideration of memory access types and global sharing is necessary for thread selection. RISC can reduce 50% data-consistency communication of benchmark applications during execution of the load balance mechanism.
A Synthesis Method for Self-Timed VLSI Circuits
Authors: Alain J. Martin
Venue:  (1987)

No abstract available.
New Error Recovery Structures for Reliable Multicasting
Authors: Lifan Gu, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

To reduce or eliminate the implosion of acknowledgments at the source of a very large multicast group, current reliable multicast protocols either organize the receivers of a group into a tree or ring, or implement NAK-avoidance algorithms based on random timers. All of these approaches have their limitations and advantages. We present a ring-based reliable multicast protocol, called the evenly-loaded ring protocol (ELRP), which removes processing bursts from nodes in the ring. ELRP achieves throughputs as good as those obtained with tree-based protocols and better than those of receiver-initiated protocols with NAK avoidance. We propose a deterministic NAK avoidance (DNKA) algorithm based on ELRP that performs better than the random NAK avoidance scheme (RNKA). Because tree structures are better suited than rings for wide areas involving paths with long delays, we propose the hybrid reliable multicast protocol (HRMP), which organizes receivers into a backbone acknowledgment tree that connects local areas. Any tree-based protocol with positive acknowledgment can be run in the backbone acknowledgment tree, and ELRP is run in the local areas. The maximum achievable throughput in HRMP is analyzed, which shows that it is completely scalable. The delay of DNKA and RNKA schemes are also analyzed which shows that compared with RNKA, DNKA reduces the retransmission delay significantly.
Human Design: Wearable Computers for Human Networking
Authors: Alex (Sandy) Pentland
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Computer technology has mostly focused either on theisolated individual, or has treated the person as aclueless extra wandering in a computer-controlledenvironment. Researchers seem to have forgotten thatpeople are social animals, and that the quality of theirlives is defined by their roles in human organizations.Instead of inventing technology for the individual as anisolated entity, why not invent systems that supportpeople's organizational roles? Or even invent newtypes of organizations?My colleagues and I are inventing technology that canpotentially produce organizations that are morecreative and efficient, and that better support theindividual. Using wearable computers that activelyanalyze face-to-face interactions within the workplacewe can extract conversational features, identifyparticipants, define context, and determine content. Byaggregating this information, high-potentialcollaborations and expertise within the organizationcan be identified, information movement and decision-makingcan be augmented, and social networksreinforced. Examples using this technology to initiateproductive connections are shown, and privacyconcerns are addressed.
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
Authors: Dexter Kozen
Venue:  (2000)

It is well known that finite square matrices over a Kleene algebra again form a Kleene algebra. This is also true for infinite matrices under suitable restrictions. One can use this fact to solve certain infinite systems of inequalities over a Kleene algebra. Automatic systems are a special class of infinite systems that can be viewed as infinite-state automata. Automatic systems can be collapsed using Myhill-Nerode relations in much the same way that finite automata can. The Brzozowski derivative on an algebra of polynomials over a Kleene algebra gives rise to a triangular automatic system that can be solved using these methods. This provides an alternative method for proving the completeness of Kleene algebra. 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
A Next Generation Diagnostic ATPG System Using the Verilog HDL
Authors: Michael L. Lynch, Steven M. Singer
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

This paper presents an approach for using the Verilog Hardware Description Language (HDL) together with Artificial Intelligence (AI) concepts such as Genetic Algorithms and Neural Networks in a next generation diagnostic Automatic Test Pattern Generation (ATPG) system. The test generation portion of the system is composed of four basic functional elements: Optimizing Test Proposer, Simulator, Unsupervised Pattern Classifier and Evaluator. The Test Proposer and the Evaluator are implemented using a Genetic Algorithm (GA). The Unsupervised Pattern Classifier is implemented with an Adaptive Resonance Theory (ART) neural network. The model development portion of the system is composed of three basic functional elements: Netlist Generator (NG), Component Model Library (CML) and Automatic Model Builder (AMB). The paper addresses the use of the Verilog HDL in the Netlist Generator, Automatic Model Builder, Component Model Library and Simulator functions. A circuit model development process is described which allows for the creation of the good circuit model as well as the fault models necessary as part of the ATPG system.
Reliability, Availability, Dependability and Performability: A User-centered View
Authors: Abdelsalam Heddaya, Abdelsalam Helal
Venue:  (1997)

Abstract Reliability and availability have long been considered twin system properties that could be enhanced by distribution. Paradoxically, the traditional definitions of these properties do not recognize the positive impact of recovery---as distinct from simple repair and restart---on reliability, nor the negative effect of recovery, and of internetworking of clients and servers, on availability. As a result of employing the standard definitions, reliability would tend to be underestimated, and availability overestimated. We offer revised definitions of these two critical metrics, which we call service reliability and service availability, that improve the match between their formal expression, and intuitive meaning. A fortuitous advantage of our approach is that the product of our two metrics yields a highly meaningful figure of merit for the overall dependability of a system. But techniques that enhance system dependability exact a performance cost, so we conclude with a cohesive definition of performability that rewards the system for performance that is delivered to its client applications, after discounting the following consequences of failure: service denial and interruption, lost work, and recovery cost.
Concepts and Conditions for Confinement
Authors: Gregory R. Andrews
Venue:  (1975)

THe confinement problem is concerned with preventing a computaitonal service from divulging information entrusted to it. A model of computer protection is presented and used to formally define the problem and its relation to protection mechanisms. Two types of confinement, one concerned with preventing the direct sending of messages and the other with also preventing the use of covert channels, are explored. For both types, conditions sufficient to insure confinement in terms of the capabilities of computations are presented. The conditions make it possible to identify exactly those objects, if any, which can serve as potential channels. Means for plugging the potential channels are also discussed.
Artificial Neural Networks in Hydrological Watershed Modeling: Surface Flow Contribution from the Ungauged Parts of a Catchment
Authors: Richard Chibanga, Jean Berlamont, Joos Vandewalle
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

Watershed modeling is often faced with the difficulty of determining the flow contribution from the ungaged sections of the catchment. Where the main concern is making accurate streamflow forecasts at specific watershed locations, it is cost-effective and efficient to implement a simple system theoretic model. In this paper Artificial Neural Networks (ANNs) are used as system theoretic models to model the ungaged flows. Using data from the Kafue River sub-catchment in Zambia and a simple reservoir routing model, an estimate of the flow contribution from the ungaged sections is derived. Inputs: rainfall, evaporation, previous-time-step flow are fed to a series of Feedforward-Backpropagation ANNs with target-output the current derived flow. Selected best- performing ANNs are compared with Autoregressive Moving Average models with exogenous inputs (ARMAX) and they give accurate and more robust forecasts over long term than the best performing ARMAXs thereby making ANNs a viable alternative in time-series forecasting.
Algorithms for Closest Point Problems: Practice and Theory
Authors: Peter Su
Venue:  (1992)

This paper describes and evaluates know sequential algorithms for constructing planar Voronoi diagrams and Delaunay triangulations. In addition, it describes a new incremental algorithm which is simple to understand and implement, but whose performance is competitive with all known methods. The experiments in this paper are more than just simple benchmarks, they evaluate the expected performance of the algorithms in a precise and machine independent fashion. Thus, the paper also illustrates how to use experimental tools to both understand the behaviour of different algorithms and to guide the algorithm design process.