ppxscal/embedding_network huggingface dataset:
Peer-to-Peer Web Caching: Hype or Reality?
Authors: Yonggen Mao, Zhaoming Zhu, Weisong Shi
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper, we systematically examine the design spaceof peer-to-peer Web caching systems in three orthogonal dimensions:the caching algorithm, the document lookup algorithm,and the peer granularity. Based on the observation thatthe traditional URL-based caching algorithm suffers considerablyfrom the fact of cacheability decrease caused by thefast growing of dynamic and personalized Web content, wepropose to use the content-based caching algorithm. In additionto compare two existing document lookup algorithms, wepropose a simple and effective geographic-based documentlookup algorithm. Four different peer granularities, i.e., hostlevel, organization level, building level, and centralized , arestudied and evaluated using a seven-day Web trace collectedat a medium-size education institution. Using a trace-drivensimulation, we compared and evaluated all design choices interms of two performance metrics: hit ratio and latency reduction.Finally, several implications derived from the analysis are also discussed.
Worst-Case Execution Time Analysis for Dynamic Branch Predictors
Authors: Iain Bate, Ralf Reutemann
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Branch prediction mechanisms are becoming commonplacewithin modern microprocessors. For developers ofreal-time control systems, the mechanisms present predictabilityproblems. The reasons are they increase thedifficulty in analysing software for its Worst-Case ExecutionTime without introducing unmanageable pessimismand they increase the variability of the softwareýs executiontimes. In this paper, we improve upon existing branchprediction analysis by taking into account the semanticcontext of the branches in the source code in order toclassify them as either being easy-to-predict or hard-to-predict.Based on this classification we provide a staticanalysis approach for bimodal and global-history branchprediction schemes. The analysis is applied to a previouslypublished example with the benefit that a more detailed explanationof its results is obtained.
RCV1: A New Benchmark Collection for Text Categorization Research
Authors: David D. Lewis, Yiming Yang, Tony G. Rose, Fan Li
Venue: The Journal of Machine Learning Research (2004)

Reuters Corpus Volume I (RCV1) is an archive of over 800,000 manually categorized newswire stories recently made available by Reuters, Ltd. for research purposes. Use of this data for research on text categorization requires a detailed understanding of the real world constraints under which the data was produced. Drawing on interviews with Reuters personnel and access to Reuters documentation, we describe the coding policy and quality control procedures used in producing the RCV1 data, the intended semantics of the hierarchical category taxonomies, and the corrections necessary to remove errorful data. We refer to the original data as RCV1-v1, and the corrected data as RCV1-v2. We benchmark several widely used supervised learning methods on RCV1-v2, illustrating the collection's properties, suggesting new directions for research, and providing baseline results for future studies. We make available detailed, per-category experimental results, as well as corrected versions of the category assignments and taxonomy structures, via online appendices.
Distributed debugging: session summary
Authors: Thomas Gross
Venue: ACM SIGSOFT Software Engineering Notes (1983)

Both sessions on Tuesday morning (March 22, 1983) were devoted to the discussion of <italic>Distributed Debugging</italic>. Three papers were presented during the first part; then there was a lively panel discussion on <italic>Multiprocess and Distributed Debugging</italic>. Both session were chaired by John R. White (Xerox PARC).
Simultaneous Analytic Area and Power Optimization for Repeater Insertion
Authors: Giuseppe S. Garcea, Nick P. van der Meijs, Ralph H. J. M. Otten
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

We present an analytic formula for repeater insertion in globalinterconnects that simultaneously minimizes silicon device areaand power dissipation for a given performance ¿{crit}/K where ¿{crit}is the minimum possible delay along a global interconnect, withrepeaters inserted, and 0
Performance of Using Oracle XMLDB in the Evaluation of CDISC ODM for a Clinical Study Informatics System
Authors: Shaohua Alex Wang, Yang Fann, Huey Cheung, Frank Pecjak, Barg Upender, Adam Frazin, Raj Lingam, Sarada Chintala, Gladys Wang, Marc Kellogg, Robert L. Martino, Calvin A. Johnson
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper describes potential strategies for data modeling and implementation as part ofthe general architecture of CSIS, a Clinical Study and Informatics System that has beendeveloped for the National Institute of Neuroscience and Stroke (NINDS). We discuss theNINDS requirements and how they influenced the system design, with an emphasis ondynamic form creation. We also evaluate open standards such as "CDISC ODM" andseveral database technology choices, namely conventional relational "EAV" tables and thenew "XMLDB" from Oracle. We describe performance test results, which show that it isfeasible to implement CDISC ODM in Oracle XMLDB and the schema-based storage optionfor storing XML content is better than "CLOB"-based for applications that require highnumbers of queries for XML fragments. For storage and retrieval of whole XML documents,CLOB storage is optimal. CSIS implements a hybrid approach of combining CLOB storagefor storing XML documents with relational tables for storing metadata. Due to the complexityof the CDISC schema and related performance and implementation concerns, we havedecided not to implement CDISC internal storage in our system.
A Statistical Gate-Delay Model Considering Intra-Gate Variability
Authors: Kenichi Okada, Kento Yamaoka, Hidetoshi Onodera
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper proposes a model for calculating statistical gate-delayvariation caused by intra-chip and inter-chip variability. As thevariation of individual gate delays directly influences the circuit-delayvariation, it is important to characterize each gate-delay variationaccurately. Furthermore, as every transistor in a gate affectsthe transient characteristics of the gate, it is also necessary to considerthe intra-gate variability in the model of gate-delay variation.This effect is not captured in existing statistical delay analyses. Theproposed model considers the intra-gate variability through the introductionof sensitivity constants. The accuracy of the model isevaluated, and some simulation results for circuit delay variationare presented.
DICOM Configuration Management
Authors: Khalil ur Rehman, Ali Iqbal, David Harvey
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Tele-radiology is one of the most evolved areas of telemedicine. The DICOM standard [American College of Radiology: ACR Standard for Teleradiology] (Digital Imaging and Communications in Medicine) is commonly used for this, but it is not sufficient in all aspects. The mechanism presented in this paper allows the dynamic assignment of an IP address and automatic configuration of devices connected over the network. When DICOM was writtenonly static IP addresses existed (before DHCP etc.) therefore it does not take this possibility into consideration. Currently DICOM assumes that only a small manageable number of devices will be used on a network and it currently requires every device to have a static IP address. At present, each is configured manually by an engineer entering the information into each machine independently (like people used to with a hosts file, before DNS was invented).
Hit-and-run from a corner
Authors: László Lovász, Santosh Vempala
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We show that the hit-and-run random walk mixes rapidly starting from any interior point of a convex body. This is the first random walk known to have this property. In contrast, the ball walk can take exponentially many steps from some starting points.
Using temporal profiles of queries for precision prediction
Authors: Fernando Diaz, Rosie Jones
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

A key missing component in information retrieval systems is self-diagnostic tests to establish whether the system can provide reasonable results for a given query on a document collection. If we can measure properties of a retrieved set of documents which allow us to predict average precision, we can automate the decision of whether to elicit relevance feedback, or modify the retrieval system in other ways. We use meta-data attached to documents in the form of time stamps to measure the distribution of documents retrieved in response to a query, over the time domain, to create a temporal profile for a query. We define some useful features over this temporal profile. We find that using these temporal features, together with the content of the documents retrieved, we can improve the prediction of average precision for a query.
Resource allocation during tests for optimally reliable software
Authors: Oded Berman, Michal Cutler
Venue: Computers and Operations Research (2004)

In this research, we develop a framework for performing resource allocation (budget and time) during the test process of a software system. The framework allows the usage of different reliability models. The assumed test process includes unit, integration and system tests. The process of testing each software component (i.e., the code associated with each test) is viewed as a sequence of test and repair periods. Each test and repair period consists of a test time interval, and a repair time interval. We assume that a software system has been specified, designed and coded, and that a test plan for testing the system is available. The test plan includes a hierarchy of planned tests, and possibly constraints on the number of test and repair periods for each planned test. In addition reliability requirements may be given for some parts of the software system. The system may include a number of modules and programs.A model has been developed with the goal of finding the maximum reliability of the software system while satisfying the following constraints: total test cost cannot exceeds a given budget and requirements regarding the number of test and repair periods, and minimum reliability of components must be satisfied.The model has been solved for a variety of different constraints and parameter values using the Solver Add-in of Microsoft Excel.
Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials
Authors: WanZhen Liang, Roi Baer, Chandra Saravanan, Yihan Shao, Alexis T. Bell, Martin Head-Gordon
Venue: Journal of Computational Physics (2004)

Fast and effective algorithms are discussed for resumming matrix polynomials and Chebyshev matrix polynomials. These algorithms lead to a significant speed-up in computer time by reducing the number of matrix multiplications required to roughly twice the square root of the degree of the polynomial. A few numerical tests are presented, showing that evaluation of matrix functions via polynomial expansions can be preferable when the matrix is sparse and these fast resummation algorithms are employed.
Transparency and Stability of Bilateral Kinesthetic Teleoperation with Time-Delayed Communication
Authors: Hubert Baier, Günther Schmidt
Venue: Journal of Intelligent and Robotic Systems (2004)

This paper presents a novel control approach that simultaneously ensures stability and transparency of bilateral kinesthetic teleoperation in case of communication delay. The approach rests upon a straight-forward combination of two-port lossless line theory, proper adaptation of line terminating impedance functions and situation dependent switching of adaptation filters. Application of a resulting transparency oriented control strategy to 1- or multi-DoF telemanipultion systems leads to improvements in human operator's presence feeling and task performance.
A Fast and Simple Stretch-Minimizing Mesh Parameterization
Authors: Shin Yoshizawa, Alexander Belyaev, Hans-Peter Seidel
Venue: Proceedings of the Shape Modeling International 2004 (2004)

We propose a fast and simple method for generating a low-stretchmesh parameterization. Given a triangle mesh, we startfrom the Floater shape preserving parameterization and then improvethe parameterization gradually. At each improvement step,we optimize the parameterization generated at the previous stepby minimizing a weighted quadratic energy where the weights arechosen in order to minimize the parameterization stretch. This optimizationprocedure does not generate triangle flips if the boundaryof the parameter domain is a convex polygon. Moreover alreadythe first optimization step produces a high-quality mesh parameterization.We compare our parameterization procedure withseveral state-of-art mesh parameterization methods and demonstrateits speed and high efficiency in parameterizing large andgeometrically complex models.
High-tech forensics
Authors: Warren Harrison, George Heuston, Sarah Mocas, Mark Morrissey, John Richardson
Venue: Communications of the ACM (2004)

An Oregon police department successfully enlists tech-savvy citizens to serve as police reserve specialists.
Highly available, fault-tolerant, parallel dataflows
Authors: Mehul A. Shah, Joseph M. Hellerstein, Eric Brewer
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We present a technique that masks failures in a cluster to provide high availability and fault-tolerance for long-running, parallelized dataflows. We can use these dataflows to implement a variety of continuous query (CQ) applications that require high-throughput, 24x7 operation. Examples include network monitoring, phone call processing, click-stream processing, and online financial analysis. Our main contribution is a scheme that carefully integrates traditional query processing techniques for partitioned parallelism with the process-pairs approach for high availability. This delicate integration allows us to tolerate failures of portions of a parallel dataflow without sacrificing result quality. Upon failure, our technique provides quick fail-over, and automatically recovers the lost pieces on the fly. This piecemeal recovery provides minimal disruption to the ongoing dataflow computation and improved reliability as compared to the straight-forward application of the process-pairs technique on a per dataflow basis. Thus, our technique provides the high availability necessary for critical CQ applications. Our techniques are encapsulated in a reusable dataflow operator called Flux, an extension of the Exchange that is used to compose parallel dataflows. Encapsulating the fault-tolerance logic into Flux minimizes modifications to existing operator code and relieves the burden on the operator writer of repeatedly implementing and verifying this critical logic. We present experiments illustrating these features with an implementation of Flux in the TelegraphCQ code base [8].
Online hierarchical cooperative caching
Authors: Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space cooperate with one another to satisfy a sequence of read requests to a collection of (read-only) files. A seminal result in the area of competitive analysis states that LRU (the widely-used deterministic online paging algorithm based on the "least recently used" eviction policy) is constant-competitive if it is given a constant-factor blowup in capacity over the offline algorithm. Does such a constant-competitive deterministic algorithm (with a constant-factor blowup in the machine capacities) exist for the hierarchical cooperative caching problem? The main contribution of the present paper is to answer this question in the negative. More specifically, we establish an Ω(log log n) lower bound on the competitive ratio of any online hierarchical cooperative caching algorithm with capacity blowup O((log n)1-ε), where ε denotes an arbitrarily small positive constant.
Minimum-Area Sequential Budgeting for FPGA
Authors: Chao-Yang Yeh, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The constraint-based approach to timing-driven placementrequires delay budgeting to define the delay upper bounds for nets.While most of the previous delay-budgeting works have beenfocused on optimizing combinational circuits, the work in [Delay Budgeting in Sequential Circuit with Application On FPGA Placement]introduces sequential budgeting, which combines budgeting andretiming to optimize sequential circuits better. However, theformulation in [Delay Budgeting in Sequential Circuit with Application On FPGA Placement] does not consider flip-flop (FF) minimization,which is important in practical applications. Here, we propose anew sequential budgeting algorithm, C-SBGT, that not onlycontrols the FF count, but also can be solved more efficientlycompared to [Delay Budgeting in Sequential Circuit with Application On FPGA Placement]. Our formulation has fewer constraints than [Delay Budgeting in Sequential Circuit with Application On FPGA Placement] and the procedure to realize retiming is also simpler. Ourexperiments show that our new min-area sequential budgetingalgorithm produces a good trade-off between the area andbudgeting optimization goals, as well as improving the timingof previous sequential budgeting method by 12%.
Biasing Effects in Schedulability Measures
Authors: Enrico Bini, Giorgio C. Buttazzo
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

The performance of a schedulabilty test is typically evaluatedby generating a huge number of synthetic task setsand then computing the fraction of those that pass the testwith respect to the total number of feasible ones. The resultingratio, however, depends on the metrics used for evaluatingthe performance and on the method for generating randomtask parameters. In particular, an important factor thataffects the overall result of the simulation is the probabilitydensity function of the random variables used to generatethe task set parameters.In this paper we discuss and compare three differentmetrics that can be used for evaluating the performanceof schedulability tests. Then, we investigate how the randomgeneration procedure can bias the simulation resultsof some specific scheduling algorithm. Finally, we presentan efficient method for generating task sets with uniformdistribution in a given space, and show how some intuitivesolutions typically used for task set generation can bias thesimulation results.
Policy-Based Dynamic Reconfiguration of Mobile-Code Applications
Authors: Rebecca Montanari, Emil Lupu, Cesare Stefanelli
Venue: Computer (2004)

Code mobility enables dynamic customization and configuration of ubiquitous Internet applications. Mobile applications can transfer the execution of software components from one device to another depending on resource availability. They can also adapt functionality according to user needs and device characteristics. Thus, the authors have developed a policy-based approach to mobility programming that expresses and controls reconfiguration strategies at a high level of abstraction, separate from the application's functionality.
Non-Deterministic Matrices
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The ordinary concept of a multiple-valued matrix is generalizedby introducing non-deterministic matrices (Nmatrices),in which non-deterministic computations of truthvaluesare allowed. The induced logics are investigated, anda generalized compactness theorem that applies to all finiteNmatrices is proved. Among the applications, it is shownthat some important logics for reasoning under uncertaintycan be characterized by finite Nmatrices but not by finite ordinarymatrices.
Least-Squares Meshes
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In this paper we introduce Least-squares Meshes:meshes with a prescribed connectivity that approximate aset of control points in a least-squares sense. The givenmesh consists of a planar graph with arbitrary connectivityand a sparse set of control points with geometry. Thegeometry of the mesh is reconstructed by solving a sparselinear system. The linear system not only defines a surfacethat approximates the given control points, but it also distributesthe vertices over the surface in a fair way. That is,each vertex lies as close as possible to the center of gravityof its immediate neighbors. The Least-squares Meshes(LS-meshes) are a visually smooth and fair approximationof the given control points. We show that the connectivityof the mesh contains geometric information that affects theshape of the reconstructed surface. Finally, we discuss theapplicability of LS-meshes to approximation of given surfaces,smooth completion and mesh editing.
In-Silico Prediction of Surface Residue Clusters for Enzyme-Substrate Specificity
Authors: Gong-Xin Yu, Byung-Hoon Park, Praveen Chandramohan, Al Geist, Nagiza F. Samatova
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

One of the most remarkable properties of enzyme-substrate binding is the high substrate specificity among homologous enzymes. Identification of regions in enzymes that play an important role in substrate recognition presents an opportunity to understand their basic molecular mechanisms. Current methods are limited to identifying conserved residues, ignoring potential contributions of non-conserved residues. Our method overcomes this limitation. In case studies, we investigated several highly homologous enzymatic protein pairs such as guanylyl vs. adenylyl cyclases and lactate vs. malate dehydrogenases, and applied our method on plant and cyano-bacterial RuBisCos. We identified several critical mono-residue and multi-residue clusters that were consistent with experimental results. Some of the identified clusters, primarily the mono-residue ones, represent residues that are directly involved in enzyme-substrate interactions. Others, mostly the multi-residue ones, represent residues vital for domain-domain and regulator-enzyme interactions, indicating their complementary roles in specificity determination.
Neighborhood Complexes of Stable Kneser Graphs
Authors: Anders Bj&#x00f6;rner, Mark de Longueville
Venue: Combinatorica (2003)

It is shown that the neighborhood complexes of a family of vertex critical subgraphs of Kneser graphs&#x2014;the stable Kneser graphs introduced by L. Schrijver&#x2014;are spheres up to homotopy. Furthermore, it is shown that the neighborhood complexes of a subclass of the stable Kneser graphs contain the boundaries of associahedra (simplicial complexes encoding triangulations of a polygon) as a strong deformation retract.