ppxscal/embedding_network huggingface dataset:
A window-based congestion control for reliable multicast based on TCP dynamics
Authors: Koichi Yano, Steven McCanne
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The limitation of the current multicast model led to the development of embedded network assist and new service models for reliable transport. We show a viable solution for one of the hardest problems in reliable multicast &mdash; congestion control &mdash; through the deployment of a new forwarding service model, &ldquo;Breadcrumb forwarding service&rdquo; (BCFS). Our proposed reliable multicast transport, &ldquo;Rainbow&rdquo;, is built on top of this model. In our approach, each receiver maintains its own congestion window and individually runs window control modeled after TCP. To enhance Rainbow's scalability and support asynchronous receiver subscriptions, Rainbow utilizes Digital Fountain at the source. This allows receivers to exercise asynchronous and autonomous behavior while simultaneously enjoying the performance benefit of synchronous multicast communication with fast group establishment of BCFS. In this paper, we detail the congestion control of Rainbow and demonstrate its efficiency and scalability through simulation and analysis. According to simulation results, Rainbow shows more TCP-fair behavior than RLC, which is a TCP friendly congestion control scheme based on layered multicast.
A robust blind watermarking scheme based on distributed source coding principles
Authors: Jim Chou, Sandeep Pradhan, Kannan Ramchandran
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

We propose a powerful new solution to the multimedia watermarking problem by exploiting its duality with another problem for which we have recently made pioneering constructive contributions. This latter problem is that of distributed source coding, or compression of correlated sources that are distributed. We show how these two seemingly unrelated problems are actually duals of each other. We exploit this duality by transforming our recently introduced powerful constructive framework for the distributed compression problem in [13] to a corresponding dual framework for the watermarking problem. Simulations expose the significant performance gains attained by our proposed watermarking approach and reveal its exciting potential for next-generation watermarking techniques. This can be accredited to the exploitation of the dual roles played by source codes and channel codes in the two problems.
Orderly spanning trees with applications to graph encoding and graph drawing
Authors: Yi-Ting Chiang, Ching-Chi Lin, Hsueh-I Lu
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

The canonical ordering for triconnected planar graphs is a powerful method for designing graph algorithms. This paper introduces the orderly pair of connected planar graphs, which extends the concept of canonical ordering to planar graphs not required to be triconnected. Let G be a connected planar graph. We give a linear-time algorithm that obtains an orderly pair (H,T) of G, where H is a planar embedding of G, and T is an orderly spanning tree of H. As applications, we show that the technique of orderly spanning trees yields (i) the best known encoding of G with query support, and (ii) the first area-optimal 2-visibility drawing of G.
Combinational verification based on high-level functional specifications
Authors: E. I. Goldberg, Y. Kukimoto, R. K. Brayton
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main idea is to assign to each primary input a general function, called a coordinate function, instead of a single variable function as in most BDD-based techniques. BDDs of intermediate nodes are then constructed based on these coordinate functions in a topological order from primary inputs to primary outputs. Coordinate functions depend on primary input variables and extra variables. Therefore combinational verification is performed not over the set of primary input variables but over the extended set of variables. Coordinate functions are chosen in such a way that in the process of computing intermediate functions the dependency on the primary input variables is gradually replaced with that on the extra variables, thereby making boolean functions associated with primary outputs simple functions only in terms of the extra variables. We show that such a smart choice of coordinate functions is possible with the help of the high-level functional specification of the circuit.
Modern C++ design: generic programming and design patterns applied
Authors: Andrei Alexandrescu
Venue:  (2001)

Modern C++ Designis an important book. Fundamentally, it demonstrates 'generic patterns' or 'pattern templates' as a powerful new way of creating extensible designs in C++ï¾a new way to combine templates and patterns that you may never have dreamt was possible, but is. If your work involves C++ design and coding, you should read this book. Highly recommended. ï¾Herb SutterWhat's left to say about C++ that hasn't already been said? Plenty, it turns out. ï¾From the Foreword by John VlissidesIn Modern C++ Design, Andrei Alexandrescu opens new vistas for C++ programmers. Displaying extraordinary creativity and programming virtuosity, Alexandrescu offers a cutting-edge approach to design that unites design patterns, generic programming, and C++, enabling programmers to achieve expressive, flexible, and highly reusable code.This book introduces the concept of generic componentsï¾reusable design templates that produce boilerplate code for compiler consumptionï¾all within C++. Generic components enable an easier and more seamless transition from design to application code, generate code that better expresses the original design intention, and support the reuse of design structures with minimal recoding.The author describes the specific C++ techniques and features that are used in building generic components and goes on to implement industrial strength generic components for real-world applications. Recurring issues that C++ developers face in their day-to-day activity are discussed in depth and implemented in a generic way. These include: Policy-based design for flexibility Partial template specialization Typelistsï¾powerful type manipulation structures Patterns such as Visitor, Singleton, Command, and Factories Multi-method enginesFor each generic component, the book presents the fundamental problems and design options, and finally implements a generic solution.In addition, an accompanying Web site, http://www.awl.com/cseng/titles/0-201-70431-5, makes the code implementations available for the generic components in the book and provides a free, downloadable C++ library, called Loki, created by the author. Loki provides out-of-the-box functionality for virtually any C++ project.Get a value-added service! Try out all the examples from this book at www.codesaw.com. CodeSaw is a free online learning tool that allows you to experiment with live code from your book right in your browser. 0201704315B11102003
A note on computing approximations to the exponential function
Authors: W. J. Cody, Anthony Ralston
Venue: Communications of the ACM (1967)

Two methods are discussed which result in near minimax rational approximations to the exponential function and at the same time retain the desirable property that the approximation for negative values of the argument is the reciprocal of the approximation for corresponding positive values. These methods lead to approximations which are much superior to the commonly used convergents of the Gaussian continued fraction for the exponential. Coefficients and errors are given for the intervals [-1/2 ln 2, 1/2 ln 2] and [-ln 2, ln 2]. Two methods are discussed which result in near minimax rational approximations to the exponential function and at the same time retain the desirable property that the approximation for negative values of the argument is the reciprocal of the approximation for corresponding positive values. These methods lead to approximations which are much superior to the commonly used convergents of the Gaussian continued fraction for the exponential. Coefficients and errors are given for the intervals [-1/2 ln 2, 1/2 ln 2] and [-ln 2, ln 2].
Basic Control for the Viscous Moore--Greitzer Partial Differential Equation
Authors: Björn Birnir, Höskuldur Ari Hauksson
Venue: SIAM Journal on Control and Optimization (2000)

The notions of basic controllability and basic control are defined. A quadratic optimal control of the linearized viscous Moore--Greitzer equation is presented, and it is confirmed that stall is uncontrollable in this model. A basic control is constructed for the nonlinear viscous Moore--Greitzer equation which can control both surge and stall. Some extensions of this construction are discussed. Numerical simulations of the basic control are presented, and its performance is compared to the performance of a backstepping control constructed by Banaszuk, Hauksson, and Mezi&cacute; [SIAM J. Control Optim., 37 (1999), pp. 1503--1537]. It is shown that the viscous Moore--Greizer equation with throttle control is not basically controllable, but under certain conditions, adding air injection control will make the equation basically controllable.
Enhancing TCP performance with a load-adaptive RED mechanism
Authors: James Aweya
Venue: International Journal of Network Management (2001)

This paper describes a technique for enhancing the effectiveness of RED by dynamically changing the threshold settings as the number of connections &lpar;and system load&rpar; changes. Using this technique, routers and switches can effectively control packet losses and TCP timeouts while maintaining high link utilization. Copyright &copy; 2001 John Wiley Sons, Ltd.
Multimodularity, Convexity, and Optimization Properties
Authors: Eitan Altman, Bruno Gaujal, Arie Hordijk
Venue: Mathematics of Operations Research (2000)

In this paper we investigate the properties of multimodular functions. In doing so we give elementary proofs for properties already established by Hajek and we generalize some of his results. In particular, we extend the relation between convexity and multimodularity to some convex subsets of z m . We also obtain general optimization results for average costs related to a sequence of multimodular functions rather than to a single function. Under this general context, we show that the expected average cost problem is optimized by using regular sequences. We finally illustrate the usefulness of this theory in admission control into a D/D/1 queue with fixed batch arrivals, with no state information. We show that the regular policy minimizes the average queue length for the case of an infinite queue, but not for the case of a finite queue. When further adding a constraint on the losses, it is shown that a regular policy is also optimal for the finite queue case.
A Study of Reinforcement Learning in the Continuous Case by the Means of Viscosity Solutions
Authors: Rémi Munos
Venue: Machine Learning (2000)

This paper proposes a study of Reinforcement Learning (RL) for continuous state-space and time control problems, based on the theoretical framework of viscosity solutions (VSs). We use the method of dynamic programming (DP) which introduces the value function (VF), expectation of the best future cumulative reinforcement. In the continuous case, the value function satisfies a non-linear first (or second) order (depending on the deterministic or stochastic aspect of the process) differential equation called the Hamilton-Jacobi-Bellman (HJB) equation. It is well known that there exists an infinity of generalized solutions (differentiable almost everywhere) to this equation, other than the VF. We show that gradient-descent methods may converge to one of these generalized solutions, thus failing to find the optimal control.In order to solve the HJB equation, we use the powerful framework of viscosity solutions and state that there exists a unique viscosity solution to the HJB equation, which is the value function. Then, we use another main result of VSs (their stability when passing to the limit) to prove the convergence of numerical approximations schemes based on finite difference (FD) and finite element (FE) methods. These methods discretize, at some resolution, the HJB equation into a DP equation of a Markov Decision Process (MDP), which can be solved by DP methods (thanks to a &ldquo;strong&rdquo; contraction property) if all the initial data (the state dynamics and the reinforcement function) were perfectly known. However, in the RL approach, as we consider a system in interaction with some a priori (at least partially) unknown environment, which learns &ldquo;from experience&rdquo;, the initial data are not perfectly known but have to be approximated during learning. The main contribution of this work is to derive a general convergence theorem for RL algorithms when one uses only &ldquo;approximations&rdquo; (in a sense of satisfying some &ldquo;weak&rdquo; contraction property) of the initial data. This result can be used for model-based or model-free RL algorithms, with off-line or on-line updating methods, for deterministic or stochastic state dynamics (though this latter case is not described here), and based on FE or FD discretization methods. It is illustrated with several RL algorithms and one numerical simulation for the &ldquo;Car on the Hill&rdquo; problem.
Multi-attribute retrieval with combined indexes
Authors: V. Y. Lum
Venue: Communications of the ACM (1970)

In this paper a file organization scheme designed to replace the use of the popular secondary index filing scheme (or inverted files on secondary key fields) is described. Through the use of redundancy and storing keys (or access numbers of the records) that satisfy different combinations of secondary index values in &ldquo;buckets,&rdquo; it is possible to retrieve all keys satisfying any input query derived from a subset of fields by a single access to an index file, although each bucket may be used for many combinations of values and a combination of buckets may be required for a given query. The method which, in its degenerate case, becomes the conventional secondary index filing scheme works similarly but has the following advantages: (1) the elimination of multiple accesses in many cases; (2) the elimination of false drops; (3) the elimination of computer time to perform intersection of key sets each qualified for one secondary index field only; and (4) the avoidance of long strings of keys when an index field appearing in a query has very few possible values. Redundancy, in some cases, is the same as the secondary indexing method. In the general case, trade-off between the number of accesses for query and redundancy exists.
Behavioral Synthesis of Fault Secure Controller/Datapaths Based on Aliasing Probability Analysis
Authors: Ganesh Lakshminarayana, Anand Raghunathan, Niraj K. Jha
Venue: IEEE Transactions on Computers (2000)

This paper addresses the problem of synthesizing fault-secure controller/data path circuits from behavioral specifications. These circuits are guaranteed to either produce the correct output, or to flag an error. We use an iterative improvement-based behavioral synthesis framework that performs functional unit selection, clock selection, scheduling, and resource sharing with the aim of minimizing the area of the synthesized circuit, while allowing multicycling, chaining, and functional unit pipelining. We present a dynamic comparison selection algorithm that can be used during behavioral synthesis to determine which intermediate results in the computation need to be secured in order to enable maximal resource sharing. Previous work on synthesizing fault-secure data paths has focused on ensuring that aliasing (a condition when the circuit produces an incorrect output and does not flag an error) cannot occur in any part of the design. We demonstrate that such an approach can lead to unnecessarily large overheads. In order to alleviate the overheads incurred for fault security, our behavioral synthesis framework uses ALiasing Probability analysiS (ALPS) in order to identify resource sharing configurations that reduce area while introducing a very low probability of aliasing (of the order of $10^{-10}$ for a bit-width of 32) in the resultant data path. Experimental results performed for several behavioral descriptions demonstrate that our techniques synthesize more compact circuits than techniques available in the literature, e.g., double moIdular redundancy or zero-aliasing techniques.
Scene identification in news video by character region segmentation
Authors: Ichiro Ide, Reiko Hamada, Shuichi Sakai, Hidehiko Tanaka
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Reflecting the demand for recycling and retrieval of video, we are proposing an automatic indexing system for news video that considers correspondences between textual indices and image contents. In this paper, we focus on the background image content (i.e. scene) identification portion of the system. The analysis is performed by segmenting (human) character region from background region, and was applied to actual news video for evaluation. The overall result showed the effectiveness of the proposed method by 7 to 8%, and indicated that character existence itself is an important feature. Individual observation among various scenes indicated that multiple features should be combinatorily used according to each scene, and that the data set should be exponentially extended for higher performance.
Analysis and performance of inverted data base structures
Authors: Alfonso F. Cárdenas
Venue: Communications of the ACM (1975)

The need to envision and architecture data base systems in a hierarchical level by level framework is stressed. The inverted data base (file) organization is then analyzed, considering implementation oriented aspects. The inverted directory is viewed realistically as another large data base which itself is subjected to inversion. Formulations are derived to estimate average access time (read only) and storage requirements, formalizing the interaction of data base content characteristics, logical complexity of queries, and machine timing and blocking specifications identified as having a first-order effect on performance. The formulations presented are necessary to be used in conjunction with any index selection criteria to determine the optimum set of index keys.
Self-Stabilizing Strong Fairness under Weak Fairness
Authors: Mehmet Hakan Karaata
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Fairness assumptions have a great impact on distributed algorithms. They play a major role in determining the time complexity and the correctness of algorithms, since progress or freedom from various types of starvation may not be guaranteed without fairness assumptions. In this paper, we present a stabilizing deterministic algorithm allowing simultaneous execution of actions for strong fairness under weak fairness assumption. In addition, we show that the proposed algorithm yields a high degree of concurrency. We conclude the paper with some remarks on issues such as time optimal implementation of strong fairness and open problems related to fairness.
Secure high data embedding rate for steganographic application
Authors: Faisal Alturki, Russell Mersereau
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Data hiding is the process of secretly embedding information inside a data source without changing its perceptual quality or its statistical properties. In this paper we present a new data hiding technique for embedding a high data rate in the transform domain. This technique is suitable for applications such as covert communication and captioning. The technique is based on increasing the number of image transform coefficients used to carry the information by decorrelating the image samples in the spatial domain. The embedding technique does not introduce noticeable changes neither in the perceptual quality nor in the statistical properties of the cover image. Hence, it is considered to be secure.
On-line Text Editing: A Survey
Authors: Andries van Dam, David E. Rice
Venue: ACM Computing Surveys (CSUR) (1971)

This paper is a survey of current methods for the on-line creation and editing of computer programs and of ordinary manuscripts text. The characteristics of on-line editing systems are examined and examples of various implementations are described in three categories: program editors, text editors, and terminals with local editing facilities.
Profile based methods for genomic sequence retrieval
Authors: Donglin Liu, Gautam B. Singh
Venue: ACM SIGBIO Newsletter (2000)

The number of biological sequences in the genomic databases, such as the GenBank, have exponentially increased during the past decade. Sequence retrieval systems are required to quickly and efficiently find sequences, that are related to a query sequence. Several comparison algorithms that generally rely upon the existence of local string similarities between the query and the database sequences have been widely utilized and accepted as the basis for bio-sequence retrieval from DNA sequences databases. In this paper we describe a new method for sequence comparison based on k-mer word frequency profiles. In this algorithm, the distribution of the k-mer words found on the two sequences, defined as sequences' profiles, are treated as the signatures of sequences. This representation enables us to perform a comparison of sequence similarity using Shannon's entropy based divergence measures. The profile based search of the primate section of GenBank (GB-PRI, comprising of approximately 114,000 DNA sequences) was performed using this approach. The results obtained have established the significance and validity of a profile based genomic sequence retrieval algorithm.
Using agents to build a practical implementation of the INCA (intelligent community alarm) system
Authors: Martin Beer, Iain Anderson, Wei Huang
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

This paper describes an agent system to demonstrate the practically of the INCA (Intelligent Community Support for the Elderly) architecture. This architecture is intended to integrate a number of autonomous systems; home monitoring, community alarms, care management systems and emergency systems command and control systems using agent technology to build effective coordinated care systems. A range of different autonomous bodies provides such care, many of which have their own management information systems already in place. Since these systems do not only contain information relevant to community care, but also all the other activities of the agent, that it would be unwilling to make available to other parties, the actual management of community care has remained primarily outside the role of current systems. The current demonstrator has been built using ZEUS agent-building toolkit (Nwana et al (1999)) as the basis for the development of a 'bench-top' demonstrator to show that the INCA architecture is both scalable to realistic activity levels and integrates fully and effectively with existing computer systems in the various agencies involved, without loss of autonomy and security.