pinecone/core-2020-05-10-deduplication huggingface dataset:
Counters-based modified traffic conditioner

Traffic conditioners play a key role in implementing the Assured Service in the framework
of the DiffServ approach. Many research papers have focused on finding the best traffic conditioner
able to assure contracted target rates and to fairly distribute the excess bandwidth among competing
sources. Nevertheless, none of the proposals presented so far accomplishes simultaneously both
features. We propose a traffic conditioner for the Internet Assured Service called Counters-Based
Modified (CBM) that strictly guarantees target rates and performs a fair share of the excess
bandwidth among TCP Reno sources. The ability of strictly providing the inbound bandwidth is
inherited from its predecessor the Counters-Based algorithm, and the fairness in the outbound
bandwidth distribution is met by probabilistically dropping OUT packets in the traffic conditioner. To
determine the dropping probability of an OUT packet, the amount of excess bandwidth and the
average RTT of all connections in the traffic conditioner have to be known. Although this fact implies
using some sort of signaling, it results more feasible than other proposed intelligent traffic
conditioners. The CBM traffic conditioner is evaluated under different conditions by simulation using
TCP Reno sources. Simulation results presented in this paper lead us to suggest it as a feasible
election for the traffic conditioner device implementation in DiffServ.This work was supported by the Spanish Research Council under grant FAR-IP TIC2000-1734-C03-03
Supernova Interaction with a Circumstellar Medium

The explosion of a core collapse supernova drives a powerful shock front into the wind from the progenitor star. A layer of shocked circumstellar gas and ejecta develops that is subject to hydrodynamic instabilities. The hot gas can be observed directly by its X-ray emission, some of which is absorbed and re-radiated at lower frequencies by the ejecta and the circumstellar gas. Synchrotron radiation from relativistic electrons accelerated at the shock fronts provides information on the mass loss density if free-free absorption dominates at early times or the size of the emitting region if synchrotron self-absorption dominates. Analysis of the interaction leads to information on the density and structure of the ejecta and the circumstellar medium, and the abundances in these media. The emphasis here is on the physical processes related to the interaction
The Historical Supernovae

The available historical records of supernovae occurring in our own Galaxy over the past two thousand years are reviewed. These accounts include the well-recorded supernovae of AD 1604 (Kepler's SN), 1572 (Tycho's SN), 1181, 1054 (which produced the Crab Nebula) and 1006, together with less certain events dating back to AD 185. In the case of the supernovae of AD 1604 and 1572 it is European records that provide the most accurate information available, whereas for earlier supernovae records are principally from East Asian sources. Also discussed briefly are several spurious supernova candidates, and the future prospects for studies of historical supernovae
The accessibility dimension for structured document retrieval

Structured document retrieval aims at retrieving the document components that best satisfy a query, instead of merely retrieving pre-defined document units. This paper reports on an investigation of a tf-idf-acc approach, where tf and idf are the classical term frequency and inverse document frequency, and acc, a new parameter called accessibility, that captures the structure of documents. The tf-idf-acc approach is defined using a probabilistic relational algebra. To investigate the retrieval quality and estimate the acc values, we developed a method that automatically constructs diverse test collections of structured documents from a standard test collection, with which experiments were carried out. The analysis of the experiments provides estimates of the acc values
Building bilingual dictionaries from parallel web documents

In this paper we describe a system for automatically constructing a bilingual dictionary for cross-language information retrieval applications. We describe how we automatically target candidate parallel documents, filter the candidate documents and process them to create parallel sentences. The parallel sentences are then automatically translated using an adaptation of the EMIM technique and a dictionary of translation terms is created. We evaluate our dictionary using human experts. The evaluation showed that the system performs well. In addition the results obtained from automatically-created corpora are comparable to those obtained from manually created corpora of parallel documents. Compared to other available techniques, our approach has the advantage of being simple, uniform, and easy-to-implement while providing encouraging results
The use of implicit evidence for relevance feedback in web retrieval

In this paper we report on the application of two contrasting types of relevance feedback for web retrieval. We compare two systems; one using explicit relevance feedback (where searchers explicitly have to mark documents relevant) and one using implicit relevance feedback (where the system endeavours to estimate relevance by mining the searcher's interaction). The feedback is used to update the display according to the user's interaction. Our research focuses on the degree to which implicit evidence of document relevance can be substituted for explicit evidence. We examine the two variations in terms of both user opinion and search effectiveness
AToM3: A Tool for Multi-formalism and Meta-modelling

The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-45923-5_12Proceedings of 5th International Conference, FASE 2002 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8–12, 2002This article introduces the combined use of multi-formalism modelling and meta-modelling to facilitate computer assisted modelling of complex systems. The approach allows one to model different parts of a system using different formalisms. Models can be automatically converted between formalisms thanks to information found in a Formalism Transformation Graph (FTG), proposed by the authors. To aid in the automatic generation of multi-formalism modelling tools, formalisms are modelled in their own right (at a meta-level) within an appropriate formalism. This has been implemented in the interactive tool AToM3. This tool is used to describe formalisms commonly used in the simulation of dynamical systems, as well as to generate custom tools to process (create, edit, transform, simulate, optimise, ...) models expressed in the corresponding formalism. AToM3 relies on graph rewriting techniques and graph grammars to perform the transformations between formalisms as well as for other tasks, such as code generation and operational semantics specification.This paper has been partially sponsored by the Spanish Interdepartmental Commission
of Science and Technology (CICYT), project number TEL1999-0181.
Prof.Vangheluwe gratefully acknowledges partial support for this work by a
National Sciences and Engineering Research Council of Canada (NSERC) Individual
Research Grant
Mixin modules in a call-by-value setting

15 pages, published in ESOP '02International audienceThe ML module system provides powerful parameterization facilities, but lacks the ability to split mutually recursive definitions across modules, and does not provide enough facilities for incremental programming. A promising approach to solve these issues is Ancona and Zucca's mixin modules calculus CMS. However, the straightforward way to adapt it to ML fails, because it allows arbitrary recursive definitions to appear at any time, which ML does not support.In this paper, we enrich CMS with a refined type system that controls recursive definitions through the use of dependency graphs. We then develop and prove sound a separate compilation scheme, directed by dependency graphs, that translates mixin modules down to a CBV lambda-calculus extended with a non-standard letrec construct
Shape representation using trihedral mesh projections

International Conference on Discrete Geometry for Computer Imagery (DGCI), 2002, Burdeos (Francia)This paper explores the possibility of approximating a surface by a trihedral polygonal mesh plus some triangles at strategic places. The presented approximation has several attractive properties. It turns out that the Z-coordinates of the vertices are completely governed by the Z-coordinates assigned to four selected ones. This allows describing the spatial polygonal mesh with just its 2D projection plus the heights of four vertices. As a consequence, these projections essentially capture the “spatial meaning” of the given surface, in the sense that, whatever spatial interpretations are drawn from them, they all exhibit the same shape, up to some trivial ambiguities.This work was supported by the project 'Resolución de sistemas de ecuaciones cinemáticas para la simulación de mecanismos, posicionado interactivo de objetos y conformación de moléculas' (070-722).Peer Reviewe
Cached Two-Level Adaptive Branch Predictors with Multiple Stages

The original publication is available at www.springerlink.com . Copyright Springer DOI : 10.1007/3-540-45997-9During the last decade, the accuracy of branch predictors was significantly improved by the development of Two-Level Adaptive Branch Predictors. However, although these predictors deliver very high prediction rates, they have several disadvantages. Firstly, the size of the secondlevel Pattern History Table (PHT) increases exponentially as a function of history register length and therefore becomes very costly if a large amount of branch history is exploited. Secondly, many of the prediction counters in the PHT are never used. Thirdly, predictions are frequently generated from non-initialised counters. Finally, several branches may update the same counter, resulting in interference between branch predictions. In this paper, we quantify the performance of a novel family of multi-stage Two-Level Adaptive Predictors. In each two-level predictor, the PHT is replaced by a Prediction Cache. Unlike a PHT, a Prediction Cache saves only relevant branch prediction information. Furthermore, predictions are never based on uninitialised entries and interference between branches is eliminated. In the case of a Prediction Cache miss in the first stage, our two-stage predictors uses a default two-bit prediction counter stored in a second stage. We demonstrate that a two-stage Cached Predictor is more accurate than a conventional two-level predictor and quantify the crucial contribution made by the second prediction stage in achieving this high accuracy. We then extend our Cached Predictor by adding a third stage and demonstrate that a Three-Stage Cached Predictor further improves the accuracy of cached predictors
The role of emotion, values, and beliefs in the construction of innovative work realities

Traditional approaches to requirements elicitation stress systematic and rational analysis and representation of organizational context and system requirements. This paper argues that (1) for an organization, a software system implements a shared vision of a future work reality and that (2) understanding the emotions, feelings, values, beliefs, and interests that drive organizational human action is needed in order to invent the requirements of such a software system. This paper debunks some myths about how organizations transform themselves through the adoption of Information and Communication Technology; describes the concepts of emotion, feeling, value, and belief; and presents some constructionist guidelines for the process of eliciting requirements for a software system that helps an organization to fundamentally change its work patterns
Generating Euler diagrams

This article describes an algorithm for the automated generation of any Euler diagram starting with an abstract description of the diagram. An automated generation mechanism for Euler diagrams forms the foundations of a generation algorithm for notations such as Harel's higraphs, constraint diagrams and some of the UML notation. An algorithm to generate diagrams is an essential component of a diagram tool for users to generate, edit and reason with diagrams. The work makes use of properties of the dual graph of an abstract diagram to identify which abstract diagrams are "drawable" within given wellformedness rules on concrete diagrams. A Java program has been written to implement the algorithm and sample output is included
Corresponding regions in Euler diagrams

Euler diagrams use topological properties to represent set-theoretical concepts and thus are `intuitive' to some people. When reasoning with Euler diagrams, it is essential to have a notion of correspondence among the regions in different diagrams. At the semantic level, two regions correspond when they represent the same set. However, we wish to construct a purely syntactic definition of corresponding regions, so that reasoning can take place entirely at the diagrammatic level. This task is interesting in Euler diagrams because some regions of one diagram may be missing from another. We construct the correspondence relation from `zones' or minimal regions, introducing the concept of `zonal regions' for the case in which labels may differ between diagrams. We show that the relation is an equivalence relation and that it is a generalization of the counterpart relations introduced by Shin and Hammer
Bandwidth reduction techniques for remote navigation systems

In this paper we explore a set of techniques to reduce the bandwidth in remote navigation systems. These systems, such as exploration\ud
of virtual 3D worlds or remote surgery, usually require higher bandwidth than the common Internet connection available at home.\ud
Our system consists in a client PC equipped with a graphics card, and a remote high-end server, which hosts the remote environment and serves information for several clients. Each time the client needs a frame, the\ud
new image is predicted by both the client and the server and the difference with the exact one is sent to the client. To reduce bandwidth we improve the prediction method by exploiting spatial coherence and wiping out correct pixels from the difference image. This way we achieve up to 9:1 reduction ratios without loss of quality. These methods can be applied to head-mounted displays or any remote navigation software.Postprint (published version
Generative capacities of cellular automata codification for evolution of NN codification

Proceeding of: International Conference on Artificial Neural Networks. ICANN 2002, Madrid, Spain, August 28-30, 2002Automatic methods for designing artificial neural nets are desired to avoid the laborious and erratically human expert’s job. Evolutionary computation has been used as a search technique to find appropriate NN architectures. Direct and indirect encoding methods are used to codify the net architecture into the chromosome. A reformulation of an indirect encoding method, based on two bi-dimensional cellular automata, and its generative capacity are presented.Publicad
A tool for activity estimation in FPGAs

The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-46117-5_36In this paper, an activity estimation tool for FPGA-based combinational circuits is presented. The current version is able to estimate average activity for individual nodes. The tool is statistical-based, allowing the user to specify the tolerated error at a given confidence level. The tunable properties of the implemented technique have been carefully tested, demonstrating how the designer can control the accuracy-speed trade-off. The importance of a realistic input pattern characterization has also been verified.Spanish Ministry of Science and Technology has supported this work, under Contract
TIC2001-2688-C03-03. Additional funds have been obtained from Project 658001 of
the Fundación General de la Universidad Autónoma de Madrid. G. Sutter and E.
Todorovich are granted by CONICET of Argentine
FSM decomposition for low power in FPGA

The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-46117-5_37Proceedings of 12th International Conference, FPL 2002 Montpellier, France, September 2–4, 2002In this paper, the realization of low power finite state machines (FSMs) on FPGAs using decomposition techniques is addressed. The original FSM is divided into two submachines using a probabilistic criterion. Only one submachine is active at a time, meanwhile the other is disabled to save power. Different deactivation alternatives and state encoding have been studied. For each option, actual measurements of power consumption have been done using the MCNC and the PREP benchmark circuits. A Xilinx XC4K device has been utilized as technological framework. The proposed technique fits well with big FSM, where power reductions up to 46% are obtained.Spanish Ministry of Science and tecnology of Spain has supported this work, under
Contract TIC2001-2688-C03-03. Additional funds have been obtained from Project
658001 of the Fundación General de la Universidad Autónoma de Madrid
Optimizing Java Bytecode Using the Soot Framework: Is It Feasible?

This paper presents Soot, a framework for optimizing Java™ bytecode. The framework is implemented in Java and supports three intermediate representations for representing Java bytecode: Baf, a streamlined representation of Java’s stack-based bytecode; Jimple, a typed three-address intermediate representation suitable for optimization; and Grimp, an aggregated version of Jimple.\ud
\ud
Our approach to class file optimization is to first convert the stack-based bytecode into Jimple, a three-address form more amenable to traditional program optimization, and then convert the optimized Jimple back to bytecode.\ud
\ud
In order to demonstrate that our approach is feasible, we present experimental results showing the effects of processing class files through our framework. In particular, we study the techniques necessary to effectively translate Jimple back to bytecode, without losing performance. Finally, we demonstrate that class file optimization can be quite effective by showing the results of some basic optimizations using our framework. Our experiments were done on ten benchmarks, including seven SPECjvm98 benchmarks, and were executed on five different Java virtual machine implementations
Current directions in hyper-programming

The traditional representation of a program is as a linear sequence of text. At some stage in the execution sequence the source text is checked for type correctness and its translated form is linked to values in the environment. When this is performed early in the execution process, confidence in the correctness of the program is raised. During program execution, tools such as debuggers are used to inspect the running state of programs. Relating this state to the linear text is often problematical. We have developed a technique, hyperprogramming, that allows the representations of source programs to include direct links (hyper-links) to values, including code, that already exist in the environment. Hyperprogramming achieves our two objectives of being able to link earlier than before, at program composition time, and to represent sharing and thus closure and through this the run-time state of a program. This paper reviews our work on hyper-programming and proposes some current research areas.Postprin
A perspective on Lindström quantifiers and oracles.

This paper presents a perspective on the relationship between Lindström quantifiers in model theory and oracle computations in complexity theory. We do not study this relationship here in full generality (indeed, there is much more work to do in order to obtain a full appreciation), but instead we examine what amounts to a thread of research in this topic running from the motivating results, concerning logical characterizations of nondeterministic polynomial-time, to the consideration of Lindström quantifiers as oracles, and through to the study of some naturally arising questions (and subsequent answers). Our presentation follows the chronological progress of the thread and highlights some important techniques and results at the interface between finite model theory and computational complexity theory
A comparison of sceptical NAF-free logic programming approaches

Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic
Quantum Reed-Solomon Codes

After a brief introduction to both quantum computation and quantum error
correction, we show how to construct quantum error-correcting codes based on
classical BCH codes. With these codes, decoding can exploit additional
information about the position of errors. This error model - the quantum
erasure channel - is discussed. Finally, parameters of quantum BCH codes are
provided.Comment: Summary only (2 pages), for the full version see: Proceedings Applied
  Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-13), Lecture
  Notes in Computer Science 1719, Springer, 199
Relational reinforcement learning

This paper presents an introduction to reinforcement learning and relational reinforcement learning at a level to be understood by students and researchers with different backgrounds. It gives an overview of the fundamental principles and techniques of reinforcement learning without involving a rigorous deduction of the mathematics involved through the use of an example application. Then, relational reinforcement learning is presented as a combination of reinforcement learning with relational learning. Its advantages — such as the possibility of using structural representations, making abstraction from specific goals pursued and exploiting the results of previous learning phases — are discussed.status: publishe
Implementing Multithreaded Protocols for Release Consistency on Top of the Generic DSM-PM2 Platform

10.1007/3-540-47840-X_18DSM-PM2 is an implementation platform designed to facilitate the experimental studies with consistency protocoles for distributed shared memory. This platform provides basic building blocks, allowing for an easy design, implementation and evaluation of a large variety of multithreaded consistency protocols within a unified framework. DSM-PM2 is portable over a large variety of cluster architectures, using various communication interfaces (TCP, MPI, BIP, SCI, VIA, etc.). This paper presents the design of two multithreaded protocols implementing the release consistency model. We evaluate the impact of these consistency protocols on the overall performance of a typical distributed application, for two clusters with different interconnection networks and communication interfaces
Factor oracle : a new structure for pattern matching

International audienceWe introduce a new automaton on a word p, sequence of letters taken in an alphabet Σ, that we call factor oracle. This automaton is acyclic, recognizes at least the factors of p, has m+1 states and a linear number of transitions. We give an on-line construction to build it. We use this new structure in string matching algorithms that we conjecture optimal according to the experimental results. These algorithms are as effecient as the ones that already exist using less memory and being more easy to implement