ppxscal/embedding_network huggingface dataset:
Cost/utilization: a measure of system performance
Authors: Israel Borovits, Philip Ein-Dor
Venue: Communications of the ACM (1977)

A method is presented for evaluating computer system performance in terms of a cost/utilization factor and a measure of imbalance. These coefficients indicate the extent to which the total system cost is effectively utilized. The method includes a technique for the visual representation of system performance.
Transport issues in the network file system
Authors: Bill Nowicki
Venue: ACM SIGCOMM Computer Communication Review (1989)

The Sun Network File System (NFS) is a popular protocol to access files across a network [Sandberg 86]. NFS is implemented on machines as different as Personal Computers, and Cray-2 supercomputers. It uses Sun Remote Procedure Call [Sun 88] and External Data Representation [Sun 87] specifications, which can be used on a variety of transport protocols. The original design goal for NFS was to support small clusters of machines on local area networks. Thus a datagram protocol (UDP) was chosen to simplify transport.Using a connection-less transport protocol meant that nothing explicitly needed to be done to handle server or network failures. However, the use of NFS has expanded to cover much larger and more complicated networks than was ever anticipated. This has caused some NFS users to experience the problems of congestion and flow controI that transport protocols have been designed to address. This paper discucsses some alternatives for NFS transport protocols. Other issues such as inter-domain authentication, are not discussed here.
Guidelines for teaching object orientation with Java
Authors: Michael Kölling, John Rosenberg
Venue: ACM SIGCSE Bulletin (2001)

How to best teach object orientation to first year students is currently a topic of much debate. One of the tools suggested to aid in this task is BlueJ, an integrated development environment specifically designed for teaching. BlueJ supports a unique style of introduction of OO concepts. In this paper we discuss a set of problems with OO teaching, present some guidelines for better course design and show how BlueJ can be used to make significant improvements to introductory OO courses. We end by presenting a description of a possible project sequence using this teaching approach.
A Protocol-Centric Approach to on-the-Fly Race Detection
Authors: Dejan Perkovic, Peter J. Keleher
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

We present the design and evaluation of a new data-race-detection technique. Our technique executes at runtime rather than post-mortem, and handles unmodified shared-memory applications that run on top of CVM, a software distributed shared memory system. We do not assume explicit associations between synchronization and shared data, and require neither compiler support nor program source. Instead, we use a binary code re-writer to instrument instructions that may access shared memory. The most novel aspect of our system is that we are able to use information from the underlying memory system implementation in order to reduce the number of comparisons made at runtime. We present an experimental evaluation of our techniques by using our system to look for data races in five common shared-memory programs. We quantify the effect of several optimizations to the basic technique: data flow analysis, instrumentation batching, runtime code modification, and instrumentation inlining. Our system correctly found races in three of the five programs, including two from a standard benchmark suite. The slowdown of this debugging technique averages less than 2.5 for our applications.
An empirical study of insertion and deletion in binary search trees
Authors: Jeffrey L. Eppinger
Venue: Communications of the ACM (1983)

This paper describes an experiment on the effect of insertions and deletions on the path length of unbalanced binary search trees. Repeatedly inserting and deleting nodes in a random binary tree yields a tree that is no longer random. The expected internal path length differs when different deletion algorithms are used. Previous empirical studies indicated that expected internal path length tends to decrease after repeated insertions and asymmetric deletions. This study shows that performing a larger number of insertions and asymmetric deletions actually increases the expected internal path length, and that for sufficiently large trees, the expected internal path length becomes worse than that of a random tree. With a symmetric deletion algorithm, however, the experiments indicate that performing a large number of insertions and deletions decreases the expected internal path length, and that the expected internal path length remains better than that of a random tree.
Logical models of argument
Authors: Carlos Iván Chesñevar, Ana Gabriela Maguitman, Ronald Prescott Loui
Venue: ACM Computing Surveys (CSUR) (2000)

Logical models of arguement formalize commonsense reasoning while taking process and computation seriously. This survey discusses the main ideas that characterize different logical models of argument. It presents the formal features of a few features of a few main approaches to the modeling of argumentation. We trace the evolution of argumentation from the mid-1980s, when argument systems emerged as an alternative to nonmonotonic formalisms based on classical logic, to the present, as argument in embedded in different complex systems for real-world applications, and allow more formal work to be done in different areas, such as AI and Law, case-based reasoning and negotiation among intelligent agents.
G-networks: new queueing models with additional control capabilities
Authors: Erol Gelenbe
Venue: ACM SIGMETRICS Performance Evaluation Review (1995)

This Hot-Topics Session on G-Networks aims at bringing these relatively new models which we introduced for the first time in 1989 and 1990, to the attention of the performance evaluation and modeling community. The session includes presentations by Peter Harrison, Onno Boxma, Jean-Michel Fourneau and myself. We will cover the basic concepts, some examples of potential applications, as well as recent research efforts in this area.
Realization of Novel Linear Sinusoidal VCOs
Authors: D. R. Bhaskar, M. P. Tripathi
Venue: Analog Integrated Circuits and Signal Processing (2000)

A few linear voltage-controlled sinusoidal oscillators using IC op-amps (OAs) and IC analogue multipliers (AMs) in conjunction with passive components are already known. In present communication two new linear VCO circuits are proposed. The proposed configurations employ two IC OAs, two IC AMs and fewer passive components as compared to any other circuit of this class reported earlier. In these oscillators the condition of oscillation (CO) and frequency of oscillation (FO) are independently tunable. It has also been shown here that both the proposed circuits are reducible to single OA linear VCOs. The workability of all these configurations has been experimentally tested and the practical result conform with the theoretically obtained values.
Two subroutines for symbol manipulation with an algebraic compiler
Authors: J. W. Carr,  III, J. W. Hanson
Venue: Communications of the ACM (1961)

The current University of North Carolina version of the IT Compiler [1, 2], as well as the GAT Compiler of Arden and Graham of the University of Michigan [3], have special &ldquo;alphabetic read&rdquo; and &ldquo;alphabetic type&rdquo; statements. On the UNIVAC 1105 these features allow the direct input or output of six-symbol words, each symbol being either an alphanumeric or special character. Internally, each symbol is represented by a six-bit binary coded decimal code. On the IBM 650, five-symbol words are processed, with each symbol represented internally by a two-digit decimal code.
The click modular router
Authors: Eddie Kohler, Robert Morris, Benjie Chen, John Jannotti, M. Frans Kaashoek
Venue: ACM Transactions on Computer Systems (TOCS) (2000)

Clicks is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queuing, scheduling, and interfacing with network devices. A router configurable is a directed graph with elements at the vertices; packets flow along the edges of the graph. Several features make individual elements more powerful and complex configurations easier to write, including pull connections, which model packet flow drivn by transmitting hardware devices, and flow-based router context, which helps an element locate other interesting elements. Click configurations are modular and easy to extend. A standards-compliant Click IP router has 16 elements on its forwarding path; some of its elements are also useful in Ethernet switches and IP tunnelling configurations. Extending the IP router to support dropping policies, fairness among flows, or Differentiated Services simply requires adding a couple of element at the right place. On conventional PC hardware, the Click IP router achieves a maximum loss-free forwarding rate of 333,000 64-byte packets per second, demonstrating that Click's modular and flexible architecture is compatible with good performance.
Improving network service quality with explicit TCP window control
Authors: James Aweya, Michel Ouellette, Delfin Y. Montuno, Zhonghui Yao
Venue: International Journal of Network Management (2001)

We describe in this paper a new TCP rate control scheme based on a simple recursive algorithm. The idea behind the algorithm is to match the offered network load to the available resources by modifying at an intermediate network element, the receiver&apos;s advertised window in TCP acknowledgments returning to the source. We show through simulations that the scheme can efficiently control TCP traffic to limit queue buildups and buffer requirements at the network nodes, resulting in significant improvements in delay, packet loss rates, fairness, throughput and link utilization. Copyright &copy; 2001 John Wiley Sons, Ltd.
Single display privacyware: augmenting public displays with private information
Authors: Garth B. D. Shoemaker, Kori M. Inkpen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

The research area of Single Display Groupware (SDG) confronts the standard model of computing interaction, one user working on one computer, by investigating how the best support groups of users interacting with a shared display. One problem that has arisen in SDG research concerns access to private information. Previously, private information could not be displayed on a shared display, it could only be accessed on external devices, such as private monitors or Personal Digital Assistants (PDAs). This paper discusses Single Display Privacyware (SDP), an interaction technique that allows private information to be shown within the context of a shared display. A description of the hardware and software components of our prototype SDP system is given, as are the results of a user study performed to investigate users interacting in the environment. Conclusions concerning future research in the area of SDP are discussed.
Insertions and deletions in one-sided height-balanced trees
Authors: S. Rao Kosaraju
Venue: Communications of the ACM (1978)

Recently Hirschberg has established that insertions into one-sided height-balanced trees can be done in O(log2N) steps. It is proved here that deletions can also be performed in O(log2N) steps, which answers the open problem posed by Hirschberg.
Min-cut partitioning with functional replication for technology mapped circuits using minimum area overhead
Authors: Wai-Kei Mak
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Logic replication is known to be an effective technique to reduce the number of cut nets in partitioned circuits. A new replication model calledfunctional replicationis particularly useful for partitioning technology mapped circuits [7]. Functional replication differs from traditional replication because it considers the functional dependency of the different output signals of a logic cell on its input signals. Functional replication can lead to a higher reduction in the number of cut nets than traditional replication. In this paper, we give the first theoretical treatment of the min-cut partitioning problem with functional replication. We present a novel two-phase algorithm to compute a min-cut bipartition of a technology mapped circuit with functional replication using minimum amount of area overhead. And we show that our algorithm can be applied to improve the solution produced by any area-constrained functional replication partitioning heuristic.
Logics capturing local properties
Authors: Leonid Libkin
Venue: ACM Transactions on Computational Logic (TOCL) (2001)

Well-known theorems of Hanf and Gaifman establishing locality of first-order definable properties have been used in many applications. These theorems were recently generalized to other logics, which led to new applications in descriptive complexity and database theory. However, a logical characterization of local properties that correspond to Hanf's and Gaifman's theorems is still lacking. Such a characterization only exists for structures of bounded valence. In this paper, we give logical characterizations of local properties behind Hanf's and Gaifman's theorems. We first deal with an infinitary logic with counting terms and quantifiers that is known to capture Hanf-locality on structures of bounded valence. We show that testing isomorphism of neighborhoods can be added to it without violating Hanf-locality, while increasing its expressive power. We then show that adding local second-order quantification to it caputures precisely all Hanf-local properties. To capture Gaifman-locality, one must also add a (potentially infinite) case statement. We further show that the hierarchy based on the number of variants in the case statement is strict.
Walking in a triangulation
Authors: Olivier Devillers, Sylvain Pion, Monique Teillaud
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

Given a triangulation in the plane or a tetrahedralization in 3-space, we investigate the efficiency of locating a point by walking in the structure with different strategies.
Substrate Noise Simulation Techniques for Analog-Digital Mixed LSI Design
Authors: Makoto Nagata, Atsushi Iwata
Venue: Analog Integrated Circuits and Signal Processing (2000)

Crosstalk from digital to analog circuits can be causative of operation fails in analog-digital mixed LSIs. This paper describes modeling techniques and simulation strategies of the substrate coupling noise. A macroscopic substrate noise model that expresses the noise as a function of logic state transition frequencies among digital blocks is proposed. A simulation system based on the model is implemented in the mixed signal simulation environment, where performance degradation of the 2nd order &Delta;&Sigma;ADC coupled to digital noise sources is clearly simulated. These results indicate that the proposed behavioral modeling approach allows practicable full chip substrate noise simulation measures.
Layout tools for analog ICs and mixed-signal SoCs: a survey
Authors: R. Rutenbar, J. M. Cohn
Venue: Proceedings of the 2000 international conference on Computer-aided design (2001)

Layout for analog circuits has historically been a time consuming, manual, trial-and-error task. The problem is not so much the size (in terms of the number of active devices) of these designs, but rather the plethora of possible circuit and device interactions: from the chip substrate, from the devices and interconnects themselves, from the chip package. In this short survey we enumerate briefly the basic problems faced by those who need to do layout for analog and mixed-signal designs, and survey the evolution of the design tools and geometric/electrical optimization algorithms that have been directed at these problems.
Evaluation of modeling techniques for agent-based systems
Authors: Onn Shehory, Arnon Sturm
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

To develop agent- based systems, one needs a methodology that supports the development process as common in other disciplines. In recent years, several such methodologies and modeling techniques have been suggested. An important question is, to what extent do the existing methodologies address the developers' needs. In this paper we attempt to answer this question. In particular, we discuss suitability of agent modeling techniques to agent- based systems development. In evaluating existing modeling techniques, we address criteria from software engineering as well as characteristics of agent- based systems. Our evaluation shows that some aspects of modeling techniques for agent- based systems may benefit from further enhancements. As we show, these aspects include distribution, concurrency, testing and communication richness. We also find space for (relatively small) improvements in aspects such as the refining of the models throughout the development process and the coverage and consistency checking of the suggested models.
Flowcharts versus program design languages: an experimental comparison
Authors: H. Rudy Ramsey, Michael E. Atwood, James R. Van Doren
Venue: Communications of the ACM (1983)

An experiment was performed to assess the relative merits of program design languages (PDLs) and flowcharts as techniques for the development and documentation of detailed designs for computer programs. The use of a PDL by a software designer, for the development and description of a detailed program design, produced better results than did the use of flowcharts. Specifically, the designs appeared to be of significantly better quality, involving more algorithmic or procedural detail, than those produced using flowcharts. In addition, flowchart designs exhibited considerably more abbreviation and other space-saving practices than did PDL designs, with a possible adverse effect on their readability. When equivalent, highly readable designs were presented to subjects in both PDL and flowchart form, no pattern of short-term or long-term differences in comprehension of the design was observed. No significant differences were detected in the quality or other properties of programs written as implementations of the designs. Subjective ratings indicated a mild preference for PDLs. Overall, the results suggest that software design performance and designer-programmer communication might be significantly improved by the adoption of informal PDLs rather than flowcharts as a standard documentation method for detailed computer program designs.
Probabilistic Modeling and Recognition of 3-D Objects
Authors: Joachim Hornegger, Heinrich Niemann
Venue: International Journal of Computer Vision (2000)

This paper introduces a uniform statistical framework for both 3-D and 2-D object recognition using intensity images as input data. The theoretical part provides a mathematical tool for stochastic modeling. The algorithmic part introduces methods for automatic model generation, localization, and recognition of objects. 2-D images are used for learning the statistical appearance of 3-D objects&semi; both the depth information and the matching between image and model features are missing for model generation. The implied incomplete data estimation problem is solved by the Expectation Maximization algorithm. This leads to a novel class of algorithms for automatic model generation from projections. The estimation of pose parameters corresponds to a non-linear maximum likelihood estimation problem which is solved by a global optimization procedure. Classification is done by the Bayesian decision rule. This work includes the experimental evaluation of the various facets of the presented approach. An empirical evaluation of learning algorithms and the comparison of different pose estimation algorithms show the feasibility of the proposed probabilistic framework.
The IWAR range: a laboratory for undergraduate information assurance education
Authors: Joseph Schafer, Daniel J. Ragsdale, John R. Surdu, Curtis A. Carver
Venue: Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges (2001)

This paper describes a unique resource at West Point, the Information Analysis and Research Laboratory, referred to as the IWAR range. The IWAR range is an isolated laboratory used by undergraduate students and faculty researchers. The IWAR is a production-system-like, heterogeneous environment. The IWAR has become a vital part of the Information Assurance curriculum at West Point. We use the military range analogy to teach the students in the class that the exploits and other tools used in the laboratory are weapons and should be treated with the same care as rifles and grenades. This paper describes the structure of the laboratory and how it is used in classroom instruction. It also describes the process used to create the IWAR and how an IWAR might be built using limited resources. Finally, this paper describes the future directions of the IWAR project.
Automated welfare client-tracking and service integration: the political economy of computing
Authors: Rob Kling
Venue: Communications of the ACM (1978)

The impacts of an automated client-tracking system on the clients, caseworkers, administrators, and operations of the welfare agencies that use it are reported. The major impact of this system was to enhance the administrative attractiveness of the using agencies in the eyes of funders rather than to increase their internal administrative efficiency. This impact is a joint product of both the technical features of the computer-based system and of the organizational demands placed upon different agencies, administrators, and caseworkers. It illustrates the way &ldquo;successful&rdquo; automated information systems fit the political economies of the groups that use them.
Automatic generation of concise summaries of spoken dialogues in unrestricted domains
Authors: Klaus Zechner
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Automatic summarization of open domain spoken dialogues is a new research area. This paper introduces the task, the challenges involved, and presents an approach to obtain automatic extract summaries for multi-party dialogues of four different genres, without any restriction on domain. We address the following issues which are intrinsic to spoken dialogue summarization and typically can be ignored when summarizing written text such as newswire data: (i) detection and removal of speech disfluencies; (ii) detection and insertion of sentence boundaries; (iii) detection and linking of cross-speaker information units (question-answer pairs). A global system evaluation using a corpus of 23 relevance annotated dialogues containing 80 topical segments shows that for the two more informal genres, our summarization system using dialogue specific components significantly outperforms a baseline using TFIDF term weighting with maximum marginal relevance ranking (MMR).