ppxscal/embedding_network huggingface dataset:
Neural Nets Based Predictive Prefetching to Tolerate WWW Latency
Authors: Tamer I. Ibrahim, Cheng-Zhong Xu
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

With the explosive growth of WWW applications on the Internet, users are experiencing access delays more often than ever. Recent studies showed that prefetching could alleviate the WWW latency largely than caching. Existing prefetching methods are mostly based on URL graphs. They use the graphical nature of hypertext links to determine the possible paths through a hypertext sys-tem. While they have been demonstrated effective in pre-fetching of documents that are often accessed, they are incapable of pre-retrieving documents whose URLs had never been accessed.In this paper, we propose a context-specific prefetching technique to overcome the limitation. It relies on keywords in anchor texts of URLs to characterize user access patterns and on neural networks over the keyword set to predict future requests. It features a self-learning capability and good adaptivity to the change of user surfing interest. The technique was implemented in a SmartNews-Reader system and cross-examined in a daily browsing of MSNBC and CNN news sites. The experimental results showed an achievement of approximately 60% hit ratio due to prefetching. Of the prefetched documents, less than 30% was undesired.
Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints
Authors: José A. Ventura, Daecheol Kim
Venue: Computers and Operations Research (2003)

This research considers the problem of scheduling jobs on parallel machines with noncommon due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the corresponding due dates. All job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two special cases. For the first of these, the number of additional resource types and the resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear program and the Lagrangian relaxation approach is used to obtain tight lower bounds. In the second case, there exist one single type of additional resource and the resource requirements per job are zero or one. This problem is shown to be equivalent to the asymmetric assignment problem.
Evicted Variables and the Interaction of Global Register Allocation and Symbolic Debugging
Authors: Ali Adl-Tabatabai, Thomas Gross
Venue:  (1992)

A symbolic debugger allows a user to display the values of program variables at a breakpoint. However, problems arise if the program is translated by an optimizing compiler. This paper addresses the effects of global register allocation and assignment: a register assigned to a variable V may not be holding V''s value at a breakpoint since the register can also be assigned to other variables. We define the problem of determining whether a variable is in its assigned register as the residence problem. Prior work on debugging of optimized code has focused on the currency problem; detecting whether a variable''s run-time value is the expected value. Determining residence is a more serious problem than currency detection. We present a data-flow algorithm that accurately computes a variable''s residency, by determining when a variable becomes evicted from its register. We measure the effectiveness of different approaches to determine variable residence for three C programs from the SPEC suite.
An Object-level Gateway Supporting Integrated-Property Quality of Service
Authors: Richard Schantz, John Zinky, David Karr, David Bakken, James Megquier, Joseph Loyall
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

As networks and the use of communication within applications continue to grow and find more uses, so too does the demand for more control and manageability of various "system properties" through middleware.An important component supporting an integrated property architecture is the concept of an object gateway, which is a quality-of-service (QoS) aware element transparently inserted at the transport layer between clients and objects to provide the managed communication behavior for the particular property being supported. In this paper, we introduce the concept of a QoS-oriented gateway to integrate a variety of QoS enforcement and implementation mechanisms controlling the underlying distributed interactions. We discuss the functions performed by such a component in achieving the desired overall end-to-end QoS, and the design considerations underlying our current implementation. We conclude with experiences to date with two variations of the gateway: one controlling managed latency and throughput using bandwidth allocation, and one controlling dependability through the coordination of object replicas.
The GENERIC Programming Language Manual
Authors: Jon A. Solworth
Venue:  (1985)

GENERIC is a programming language for the description and manipulation of integrated circuits. GENERIC works on the layout level with the designer in complete control of the layout process. To design an integrated circuit, a program is written which hierarchically describes the chip. The dynamic calling structure of the program determines the integrated circuit''s hierarchical cell structure. These cells are created by special procedures called generators. Generators are capable of producing completely custom structures-they do not consist of predefined layout. In addition to the specification, GENERIC provides operators for the manipulation of integrated circuit layouts, thus enabling existing geometry to be modified. These modifications can be geometrical, topological or circuit. GENERIC is a very high level language. The language is general purpose-the VLSI aspects of the language are layered on top of the basic language as a run-time library. Since the library itself is written in GENERIC, the language is completely extensible.
Working Session: Tools for Program Comprehension: Building a Comprehender's Workbench
Authors: Keith Brian Gallagher
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Comprehension, the primordial task, has not changed much in 40 years. Whether the comprehension task is global (architectural) or atomic (single statement effect), the approach is the same. We run it. We read it. We grep (search) it. An electronic search on the criteria ¿comprehension and tools¿ yielded no results. Therefore, while there is programmer's workbench, a maintainer's workbench, and a tester's workbench, the comprehender's workbench is evidently barren. While borrowing tools from other engineers gives a toehold, the question still arises: ¿What tools belong in a comprehender's workbench, per se?¿ This workshop session will try to answer this question.
Linear Scaling Electronic Structure Methods in Chemistry and Physics
Authors: Stefan Goedecker, Gustavo E. Scuseria
Venue: Computing in Science and Engineering (2003)

Calculating the electronic structure of large atomistic systems requires algorithms that scale linearly with system size. Efficient implementations of these emerging algorithms provide scientists in various fields with powerful software tools to address challenging problems.
An Empirical Study of a Highly Available File System
Authors: Brian D. Noble, Mahadev Satyanarayanan
Venue:  (1994)

In this paper we present results from a six-month empirical study of the high availability aspects of the Coda File System. We report on the service failures experienced by Coda clients, and show that such failures are masked successfully. We also explore the effectiveness and resource costs of key aspects of server replication and disconnected operation, the two high availability mechanisms of Coda. Wherever possible, we compare our measurements to simulation-based predictions from earlier papers and to anecdotal evidence from users. Finally, we explore how users take advantage of the support provided by Coda for mobile computing.
Building B2B Applications with XML: A Resource Guide
Authors: Michael Fitzgerald
Venue:  (2002)

:What every IT manager and system administrator needs to know about the technology that drives the B2B marketplaceThe B2B marketplace is rapidly exploding--fast outpacing business-to-consumer e-commerce and expected to reach more than $7 trillion in sales by 2004. This guidebook equips XML authors, programmers, and managers with the technology know-how they need to create and develop simple yet robust B2B systems from scratch. It provides easy-to-understand explanations on how and why XML and other important technologies such as HTTP and MIME are driving the B2B marketplace. Along with XML and Java code examples, readers will find broad coverage of emerging standards and protocols, including Simple Object Access Protocol (SOAP), ebXML from OASIS/UN/CEFACT, XML Common Business Language (xCBL), BizTalk, and Commerce XML (cXML).
OFEM: an approach towards detection and reduction of objectives inconsistencies
Authors: W. W. Song
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

The importance of improving understanding and communication between users and system developers in order to develop a structured description of the business, its information system needs and objectives through enterprise modelling approaches, has been increasingly recognized. Many enterprise modelling schemas are yielded to represent the different dimensions of the enterprise and different user views. These schemas must be integrated in order to produce a global, consistent view of the application domain. However, little attention has been paid to integration of enterprise modelling views, in particular, to the incorporation of integration issues in enterprise modelling methods. We propose a restricted enterprise model, the Objectives Focused Enterprise Modelling (OFEM) framework, which gives additional support both to the goal modelling orientation, and to integration considerations in enterprise modelling. We intend to investigate in depth goal similarity and conflict issues that occur in the process of enterprise modelling, and its schema integration.
Proceedings of the 2003 workshop on Interpreters, virtual machines and emulators
Venue: Interpreters, Virtual Machines And Emulators (2003)

This is the first workshop on Interpreters, Virtual Machines, and Emulators (IVME). It provides a venue to bring together researchers and practitioners in these areas, to exchange their experiences and present new ideas.Forty-one papers were submitted to the workshop. Program committee members were invited to submit papers, and seven of the submitted papers came from PC members.For each paper three reviews were solicited from program committee members (a PC member could use secondary reviewers, but had to know the value of each reviewed paper relative to the others). Were the recommendations of different PC members con icted, they were asked to resolve the con ict, and additional reviews were solicited. This process resulted in 131 reviews, for an average of 3.2 reviews per paper.Finally, there were two email-based PC meetings: The full PC selected papers among the 34 papers that were not authored by PC members. A subcommittee consisting of those PC members who had not submitted a paper selected among the seven papers (co-)authored by PC members. Eventually we accepted eight papers (19.5% acceptance rate), two of them by PC members.
The Family Dynamics of 802.11
Venue: Queue (2003)

Three trends are driving the rapid growth of wireless LAN (WLAN): The increased use of laptops and personal digital assistants (PDAs); rapid advances in WLAN data rates (from 2 megabits per second to 108 Mbps in the past four years); and precipitous drops in WLAN prices (currently under $50 for a client and under $100 for an access point).
A note on an expressiveness hierarchy for multi-exit iteration
Authors: Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
Venue: Information Processing Letters (2003)

Multi-exit iteration is a generalization of the standard binary Kleene star operation. The addition of this construct to Basic Process Algebra (BPA) yields a more expressive language than that obtained by augmenting BPA with the standard binary Kleene star. This note offers an expressiveness hierarchy, modulo bisimulation equivalence, for the family of multi-exit iteration operators proposed by Bergstra, Bethke and Ponse.
On the Impossibility of Group Membership
Authors: Tushar D Chandra, Vassos Hadzilacos, Sam Toueg, Bernadette Charron-Bost
Venue:  (1995)

We prove that the primary-partition group membership problem cannot be solved in asynchronous systems with crash failures, even if one allows the removal or killing of non-faulty processes that are erroneously suspected to have crashed.
Spectators at a Geek Show: An Ethnographic Inquiry into Wearable Computing
Authors: Jennifer G. Sheridan, Valerie Lafond-Favieres, Wendy C. Newstetter
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

As new technologies create smaller, cheaper and faster machines, we see a paradigm shift from desktop computing to wearable computing. In less than a decade, we have witnessed the creation of a ¿cyborg¿ community. Although cyborg computing provides many attractive features for the advanced computer user, the cyborg community remains rather small and wearables remain a privilege of the few. Few studies exist that detail the cyborg experience and how this paradigm shift is affecting social interactions among users and non-users. Based on ethnographic techniques, this preliminary investigation attempts to identify themes and to provide models for understanding cyborg and non-cyborg interaction so that we may design better systems for developing and interpreting social interactions among users and non-users.
A digital video library application in health care
Authors: S. E. Cross, S. M. Stevens, J. E. Bailes,  Jr.
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

Telemedicine allows patient information rather than the patient to be transported to the doctor. Through analysis of one existing telemedicine system that supports neurosurgical consultation it has been determined that many routine questions of the expert specialist could be handled by a knowledge system. Rather than using expert systems technology, a specific application of digital library technology, the synthetic interview is proposed. Synthetic interviews involve novel integration of language and image understanding technologies.
Switched-Current Wave Filters with Reduced Number of Current Inversions
Authors: C. Psychalinos, N. Kontogiannopoulos
Venue: Analog Integrated Circuits and Signal Processing (2003)

Switched-current wave filters offer very simple structures, as their main building blocks are current mirrors. On the other hand, the achieved accuracy is mainly degraded due to the effect of MOS transistor parameters mismatch. In this Letter, new configurations of serial and parallel adaptors that are used in the simulation of inductances and capacitors of the LC ladder prototype are introduced. These have been implemented using an appropriate sharing of the delay that should be presented between the incident and reflected waves at a port of adaptor, and a 3-phase clocking scheme. The number of required current inversions and consequently the effect of mismatching are reduced in the proposed configurations.
Scientific Achievements at DIMACS: Highlights of the Second Four Years
Authors: DIMACS
Venue:  (1998)

This report highlights some of the many notable research accomplishments of center members, postdoctoral fellows, graduate students, and visitors whose work was impacted by DIMACS'' programs. This report covers the years 1993-1997. 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
Improvement and ISO9001 certification in BVR
Authors: I. Sovinski
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

The paper describes the improvement process that was implemented in BVR in order to be certified as an ISO9001 software and hardware development company, and the associated effort, methodology and benefits. The predefined methodology, of involving the whole organization in the process including management, proved that an improvement process can take place without affecting work plans and resulted in the company achieving all the goals that were set for the process.
A Network Model for Resource Allocation Problems in WANs
Authors: George Semeczko
Venue:  (1996)

Many papers have been written about resource allocation problems in distributed systems. In solving these optimization problems there has always been a trade-off between the optimality of the solution, the expense in deriving a solution and the complexity of the problem being solved. For problems in Wide Area Networks, the complexity of the problem is immediately more complicated than those for Local Area Networks as the variable communication costs becomes another factor in the optimization function. In this paper, we show that in practice Wide Area Networks have more structure than usually assumed. Given this, a structured model is presented that can be used to approximate Wide Area Networks and allow "better" solutions to optimization problems due to its properties.
Blooms' Taxonomy: A Framework for Assessing Programmers' Knowledge of Software Systems
Authors: Jim Buckley, Chris Exton
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Programmers must attain knowledge about a system before they can perform specific software maintenance tasks on it. Traditionally, computer scientists have described the activity of attaining this knowledge as software comprehension'. However, if we look at theeducational literature, attainable knowledge has been described with much finer granularity. Blooms' taxonomy identifies six separate levels of knowledge within the cognitive domain, one of which refers to a (more constricted) definition of comprehension. Several other levels in Bloom's taxonomy seem to correlate more directly to specific software maintenance tasks.This article reviews Blooms' taxonomy as a richer descriptive framework for programmers' knowledge of code and illustrates how various software maintenance tasks map to knowledge levels in this hierarchy. A pilot study is presented showing how participants' knowledge of software may differ at various levels of this hierarchy.
Reaching Efficient Fault-Tolerance for Cooperative Applications
Authors: Peter Sobe
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

Cooperative applications are widely used, e.g. as parallel calculations or distributed information processing systems. Whereby such applications meet the users demand and offer a performance improvement, the susceptibility to faults of any used computer node is raised.Often a single fault may cause a complete application failure. On the other hand, we the redundancy in distributed systems can be utilized for fast fault detection and recovery. So, we followed an approach that is based on duplication of each application process to detect crashes and faulty functions of single computer nodes.We concentrate on two aspects of efficient fault-tolerance - fast fault detection and recovery without delaying the application progress significantly. The contribution of this work is first a new fault detecting protocol for duplicated processes. Secondly, we enhance a roll forward recovery scheme so that it is applicable to a set of cooperative processes in conformity to the communication protocol.
Detection of Unintentional Connections in VLSI Circuits
Authors: Robert Wagner, Christopher Wright, Marco Valtorta
Venue:  (1984)

In designing complex circuits, such as those which implement computers in VLSI, considerable attention must be paid to the logic which steers signals between storage cells. A peculiarity of today''s VLSI technology, be it cMOS or nMOS, is the frequent use of MOSFET''s as ``pass transistors''''. Such usage causes the device to act as a bi-directional ``switch'''', which connects its source and drain together, under control of its gate. If complex register transfer logic is constructed from such pass transistors, a risk arises that the signals being steered are misdirected. A systematic, exhaustive checking tool, which would capture the circuit at some level of description, and verify that it contains no unintentional connections would greatly benefit the designer. This paper describes an algorithm which takes advantage of attributes of VLSI layouts to vastly outperform current circuit simulation programs applied to the task of verifying the absence of unintentional connections.
Laurasia and Wind: A Compiler-Controlled Software DSM for WS/PC Clusters
Authors: Tetsutaro Uehara, Shoichi Saito, Yoshitoshi Kunieda, Kazuki Joe
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

We have proposed an approach to build an automatic parallelizing compiler for various parallel computer architectures by providing COMA (Cache-Only Memory Architecture) environment that can be controlled by the compiler. This paper presents the design and implementation of a software DSM (Distributed Shared Memory) system named ¿Laurasia¿. It also describes a Low-Costs Communication module named ¿Wind¿ which is developed to accelerate the performance of Laurasia. Laurasia is designed to run on a cluster of UNIX Workstations or PCs, and Wind is built in a Linux kernel to eliminate context switches between the kernel and the user process.
A Pattern Classification Approach to Dynamical Object Detection
Authors: Constantine Papageorgiou, Tomaso Poggio
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Current systems for object detection in video sequences rely on explicit dynamical models like Kalman filters or hidden Markov models. There is significant overhead needed in the development of such systems as well as the a priori assumption that the object dynamics can be described with such a dynamical model. This paper describes a new pattern classification technique for object detection in video sequences that uses a rich, over complete dictionary of wavelet features to describe an object class. Unlike previous work where a small subset of features was selected from the dictionary, this system does no feature selection and learns the model in the full 1,326 dimensional feature space. Comparisons using different sized sets of several types of features are given. We extend this representation into the time domain without assuming any explicit model of dynamics. This data driven approach produces a model of the physical structure and short-time dynamical characteristics of people from a training set of examples; no assumptions are made about the motion of people, just that short sequences characterize their dynamics sufficiently for the purposes of detection. One of the main benefits of this approach is that transient false positives are reduced. This technique compares favorably with the static detection approach and could be applied to other object classes. We also present a real-time version of one of our static people detection systems.