ppxscal/embedding_network huggingface dataset:
Bidders' strategy for multi-attribute sequential english auction with a deadline
Authors: Esther David, Rina Azoulay-Schwartz, Sarit Kraus
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper we consider a procurement multi-attribute English auction with a deadline. This protocol can be used for agents who try to reach an agreement on an item or issue, which is characterized by several quality attributes in addition to the price. The protocol allows the specification of a deadline since in many real world situations it is essential to conclude a negotiation among agents and to reach an agreement under a strict deadline. Currently, the deadline rules, which are mainly used for auction mechanisms, result in a non-recommended and unstable bidding strategy, i.e., the last minute bidding strategy causes system overhead and inefficient auction outcomes. Therefore, we define another deadline rule, which diminishes the phenomenon of the last-minute bidding-strategy and thus prevents bottlenecks in an agents' network that applies an auction mechanism. We analyzed simultaneous and sequential multi-attribute English auctions with a fixed deadline that can be used for negotiating agents. For each of these protocols combined with the deadline rule, we provide the automated bidder agents with optimal and stable bidding strategies.
A maximal figure-of-merit learning approach to text categorization
Authors: Sheng Gao, Wen Wu, Chin-Hui Lee, Tat-Seng Chua
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

A novel maximal figure-of-merit (MFoM) learning approach to text categorization is proposed. Different from the conventional techniques, the proposed MFoM method attempts to integrate any performance metric of interest (e.g. accuracy, recall, precision, or F1 measure) into the design of any classifier. The corresponding classifier parameters are learned by optimizing an overall objective function of interest. To solve this highly nonlinear optimization problem, we use a generalized probabilistic descent algorithm. The MFoM learning framework is evaluated on the Reuters-21578 task with LSI-based feature extraction and a binary tree classifier. Experimental results indicate that the MFoM classifier gives improved F1 and enhanced robustness over the conventional one. It also outperforms the popular SVM method in micro-averaging F1. Other extensions to design discriminative multiple-category MFoM classifiers for application scenarios with new performance metrics could be envisioned too.
A Time-Space Tradeoff for In-Place Array Permutation
Authors: Robert C. Melville
Venue:  (1979)

NO SUPPLIED 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
Presenting data from experiments in algorithmics
Authors: Peter Sanders
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

Algorithmic experiments yield large amounts of data that depends on many parameters. This paper collects a number of rules for presenting this data in concise, meaningful, understandable graphs that have sufficiently high quality to be printed in scientific journals. The focus is on common sense rules that are frequently useful and can be easily implemented using tools such as gnuplot.
A Parallel, Hybrid Algorithm for Small Bandwidth Generalized Eigenproblems
Authors: C S Ma, L M Patrick, B D Szyld
Venue:  (1988)

A parallel algorithm for computing all eigenvalues, and their corresponding eigenvectors, in a specified interval for the generalized eigenproblem $A _ x = \lambda B x$ is presented, where $A$ and $B$ are banded, real, symmetric and $B$ is positive definite. Eigenvalues are isolated in parallel, using the Sturm sequence property of leading principal minors of $A~-~ \mu B$. Concurrently, eigenpairs are computed accurately using a superlinear method which combines inverse and Rayleigh quotient iterations. Results obtained from implementation of this algorithm on a shared memory MIMD architecture are presented.
Structural Complexity Column for the Bulletin of the European Association for Theoretical Computer Science
Authors: Juris Hartmanis
Venue:  (1987)

Abstract not Available
Transport of VBR MPEG-2 Traffic in ATM Networks
Authors: Zhong Wang, Guixing Luan
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The ATM Forum has not released any specifications concerning the adaptation of VBR MPEG-2 traffic so far. Most applications still make use of AAL5 to transport VBR MPEG-2 traffic. By analyses and simulations, we found that the performance of transport of VBR MPEG-2 over AAL5 (MPEG-AAL5) is poor. We recommend the transport of VBR MPEG-2 traffic over AAL0 (MPEG-AAL0). The adaptation algorithm is presented in details. Theperformance of AAL0-MPEG is proved to be better than AAL5-MPEG by simulation.
Product lines: what are the issues?
Authors: E. Di Nitto, A. Fuggetta
Venue: Proceedings of the 10th International Software Process Workshop (1996)

The software market is progressively changing attitude. In the past, most software development activities were devoted to the production and maintenance of products that were used by a single user or by a limited number of users. Namely, software was built on demand, to address the specific needs of the customer. Conversely, there has been a significant trend towards the development of software products that are conceived, developed, distributed and maintained to address the needs of a much wider number of users. As a consequence, the most critical issue for many software development companies is to develop a new approach to product design, development, deployment and distribution. It is essential to conceive a comprehensive strategy where different software components are jointly produced and/or integrated to build solutions for a large number of users. We are, therefore, moving from an approach centered on a single software product, to development strategies based on families or lines of products for specific markets and classes of users. The authors consider the consequences of this trend on the enabling technology and methodology for software development.
Reasoning in Inconsistent Stratified Knowledge Bases
Authors: Salem Benferhat, Didier Dubois, Henri Prade
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

This paper proposes a discussion of inconsistency-tolerant consequence relations in prioritized knowledge bases. These inference techniques extend methods for reasoning from inconsistent, non-stratified, knowledge bases to the case where priorities between formulas are available. Priorities between formulas are handled in the framework of possibility theory and allow for the use of pieces of information having various levels of confidence. A comparative analysis of several approaches is carried out, namely, the possibilistic inference and its extensions, three inference methods based on a selection of maximal consistent subsets of formulas, and two inference methods based on arguments.
Network routing with path vector protocols: theory and applications
Authors: João Luis Sobrinho
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Path vector protocols are currently in the limelight, mainly because the inter-domain routing protocol of the Internet, BGP (Border Gateway Protocol), belongs to this class. In this paper, we cast the operation of path vector protocols into a broad algebraic framework and relate the convergence of the protocol, and the characteristics of the paths to which it converges, with the monotonicity and isotonicity properties of its path compositional operation. Here, monotonicity means that the weight of a path cannot decrease when it is extended, and isotonicity means that the relationship between the weights of any two paths with the same origin is preserved when both are extended to the same node. We show that path vector protocols can be made to converge for every network if and only if the algebra is monotone, and that the resulting paths selected by the nodes are optimal if and only if the algebra is isotone as well.Many practical conclusions can be drawn from instances of the generic algebra. For performance-oriented routing, typical in intra-domain routing, we conclude that path vector protocols can be made to converge to widest or widest-shortest paths, but that the composite metric of IGRP (Interior Gateway Protocol), for example, does not guarantee convergence to optimal paths. For policy-based routing, typical in inter-domain routing, we formulate existing guidelines as instances of the generic algebra and we propose new ones. We also show how a particular instance of the algebra yields a sufficient condition for signaling correctness of internal BGP.
On the lattice of partial clones on a finite set
Authors: L. E. Haddad, B. J. Fugere, Dept. de Math. et Inf., da,  Kingston,  Ont. Coll. Mil. R. du Can, Canada
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Let A be a finite set with |A|/spl ges/2. We present some recent results on the lattice L/sub PA/spl circ// of partial clones on A.
Block-Oriented Image Decomposition and Retrieval in Image Database Systems
Authors: E. Remias, G. Sheikholeslami, A. Zhang
Venue: Proceedings of the 1996 International Workshop on Multi-Media Database Management Systems (IW-MMDBMS '96) (1996)

In this paper, we investigate approaches to supporting effective and efficient retrieval of image data based on con-tent. We first introduce an effective block-oriented image de-composition structure which can be used to represent image content in image database systems. We then discuss the application of this image data model to content-based image retrieval. Using wavelet transforms to extract image features, significant content features can be extracted from image data through decorrelating the data in their pixel format into frequency domain. Feature vectors of images can then be constructed. Content-based image retrieval is performed by comparing the feature vectors of the query image and the decomposed segments in database images. Our experimental analysis illustrates that the proposed block-oriented image representation offers a novel decomposition structure to be used to facilitate effective and efficient image retrieval.
An elementary algorithm for the automatic derivation and proof of tensor product identities via computer algebra
Authors: Frederick W. Chapman
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Tensor product identities in two variables are quite common in mathematics: Exponential, logarithmic, trigonometric, and hyperbolic functions all satisfy tensor product identities, and the binomial theorem is a familiar example of a tensor product identity for polynomial functions. This article presents a new elementary technique which can derive and prove all of these identities---automatically! This unified approach is based on the author's recent research on uniqueness theory for dual asymptotic expansions and remainder theory for Taylor interpolation on two lines. These results provide a simple iterative algorithm which derives a tensor product from a closed-form expression using the author's asymptotic splitting operator, and a simple hyperbolic eigenfunction criterion which proves that the two forms are identically equal. The author has implemented these methods as a complete derivation and proof system in the Maple 8 computer algebra system. The Maple code, which is surprisingly brief, is included in its entirety. The article also includes numerous examples which illustrate a variety of novel techniques for deriving and proving tensor product identities using this simple but effective system. (Maple is a registered trademark of Waterloo Maple Inc.
Parallel Program Design and Generalized Weakest Preconditions
Authors: Johan J. Lukkien
Venue:  (1990)

No abstract available.
The Mesh-Spectral Archetype
Authors: Gregg Davis, Berna L. Massingill
Venue:  (1996)

A parallel program archetype [2] aids in the development of reliable, efficient parallel applications with common computation/communication structures by providing development methods and code libraries specific to the structure. This document presents an archetype for mesh-spectral computations. It describes the common structure captured by the archetype abstraction, discusses a parallelization strategy for such computations, documents our code library to support this parallelization strategy, and presents a collection of tutorial example application programs.
Fault-tolerant causal delivery in group communication
Authors: K. Shima, H. Higaki, M. Takizawa
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In distributed systems, a group of processes are cooperated to execute an application program. A group is established among multiple processes and only processes in the group communicate with each other. This type of group communication is named intra-group communication. The communication system has to support the reliable intra-group communication in the presence of the process fault. In order to tolerate the process fault, each process in the group is replicated into a collection of multiple replicas named a cluster. In this paper, we would like to propose a new intra-group communication protocol which supports the causally ordered delivery of messages for the processes within the group. In addition, the protocol supports the reliable delivery of messages in the presence of the Byzantine faults of the processes.
An Evolutionary Computing Approach to Multilevel Logic Synthesis Using Various Logic Operations
Authors: Takahiro Hozumi, Osamu Kakusho, Kazuharu Yamato
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper discusses the logic synthesis of multilevel circuits using various operations. We suppose target circuits having no loop back connections and usable any logic function in any part of the multilevel circuits. In this paper, we use MIN, MAX, TSUM and MODSUM functions as functions of logic gates. We minimize the circuit using the Genetic Algorithms. We encode each logic gate to the series of numbers representing a function and its connections and represent the circuit by a chromosome arranging the numbers for all logic gates. We show that our GAs can design a given function with more flexible structures.
Privacy preserving frequent itemset mining
Authors: Stanley R. M. Oliveira, Osmar R. Zaïane
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

One crucial aspect of privacy preserving frequent itemset mining is the fact that the mining process deals with a trade-off: privacy and accuracy, which are typically contradictory, and improving one usually incurs a cost in the other. One alternative to address this particular problem is to look for a balance between hiding restrictive patterns and disclosing nonrestrictive ones. In this paper, we propose a new framework for enforcing privacy in mining frequent itemsets. We combine, in a single framework, techniques for efficiently hiding restrictive patterns: a transaction retrieval engine relying on an inverted file and Boolean queries; and a set of algorithms to "sanitize" a database. In addition, we introduce performance measures for mining frequent itemsets that quantify the fraction of raining patterns which are preserved after sanitizing a database. We also report the results of a performance evaluation of our research prototype and an analysis of the results.
A Uniform Approach to Configuration and Communication in Distributed Systems
Authors: Nat Pryce, Stephen Crane
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

This paper describes the design and implementation of extensions to the Regis distributed programming platform which add protocol stacks to communication end points. Although our initial goal was to extend Regis to support multiple transport protocols, groupcast and multimedia communication, the dynamic nature of the protocol framework allowed new approaches to the design of communication protocol software. Transient protocol layers provide support for binding establishment and connection management in a manner which is largely transparent to the user of the endpoint. The paper describes this approach through examples and shows how it leads to greater efficiency and a greater degree of code reuse.
Equational Propositional Logic
Authors: David Gries, Fred B. Schneider
Venue:  (1994)

We formalize equational propositional logic, prove that it is sound and complete, and compare the equational-proof style with the more traditional Hilbert style.
Exploring Cost and Reliability Tradeoffs in Architectural Alternatives Using a Genetic Algorithm
Authors: Suhrid A. Wadekar, Swapna S. Gokhale
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The shifting trends in software systems from custom, built to specification, and homogeneous to object oriented and component based have necessitated the development of new approaches for their analysis and evaluation. Correspondingly, the last few years have seen a number of architecture-based techniques employing analytical methods, simulation, and experimentation to characterize the behavior of such systems. Whereas most of the previously reported efforts were focussed on the evaluation of software systems using architecture-based techniques, the utility of these techniques in the design phase to evaluate a set of competing alternatives remains largely unexplored. In this paper we develop an optimization framework founded on the architecture-based analysis techniques, and describe how the framework can be used to evaluate cost and reliability tradeoffs using a genetic algorithm.The choice of genetic algorithms as the underlying optimization technique is motivated by three facts, namely, a potentially large and discontinuous search space, usually nonlinear but monotonic relation between the cost and reliability of individual modules comprising the software, and complex software architectures giving rise to nonlinear dependencies between individual module reliabilities and the overall system reliability. We conclude the paper by illustrating the framework with several examples.
Deep Submicron USLI Design Paradigm: Who is Writing the Future?
Authors: Kamran Eshraghian
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The concept of "technology generation" attributed to Gordon Moore has created a plausible method for predicting the behavior of technology road map that has seen world's production of silicon CMOS to exceed 75% of electronic related materials. A feature of such progress is characterized by the complexity factor that predicts the emergence of a new generation of technology every three years.A reasonable method of comparison would be to observe the parallel between CMOS based systems with those of biologically inspired systems. Deep submicron, synonymous with Ultra Large Scale of integration, suggests that by the year 2010 the number of transistors/chip will be in the order of 0.5x10 9 , with an intrinsic clock speed of 3GHz. At this level of integration the classic MOS transistor would have only a few ¿electrons' in the channel to direct. Thus, the reality of Quantum MOS (QMOS) transistor becomes a plausible possibility.In the mean time the question remains as to how are we going to cope with the design and quality of the new system complexity. ULSI design requires a shift in the design paradigm from current evolutionary thinking for system integration, to more of revolutionary approaches as depicted by attributes of if brain architecture.
Distributed Packet Rewriting and its Application to Scalable Server Architectures
Authors: Azer Bestavros, Mark Crovella, Jun Liu, David Martin
Venue:  (1998)

Abstract To construct high performance Web servers, system builders are increasingly turning to distributed designs. An important challenge that arises in distributed Web servers is the need to direct incoming connections to individual hosts. Previous methods for connection routing have employed a centralized node which handles all incoming requests. In contrast, we propose a distributed approach, called Distributed Packet Rewriting (DPR), in which all hosts of the distributed system participate in connection routing. We argue that this approach promises better scalability and fault-tolerance than the centralized approach. We describe our implementation of four variants of DPR and compare their performance. We show that DPR provides performance comparable to centralized alternatives, measured in terms of throughput and delay under the SPECweb96 benchmark. Finally, we argue that DPR is particularly attractive both for small scale systems and for systems following the emerging trend toward increasingly hintelligent I/O subsystems.
Aggregate TCP Congestion Control Using Multiple Network Probing
Authors: Prashant Pradhan, Tzi-cker Chiueh, Anindya Neogi
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Extensive research in TCP's congestion control mechanism has resulted in an effective algorithm that gives fairly precise estimates on the available bandwidth on a given network path. However, most past efforts focused on enhancing the accuracy and robustness of the path bandwidth estimation algorithms for individual TCP connections. Relatively fewer attempts have been made to further improve data transport efficiency by sharing path bandwidth information among concurrent TCP connections with the same sources and destinations.This paper proposes an aggregate TCP-based congestion control algorithm (ATCP) that allows individual TCP connections to reach their fair shares of the available network path bandwidth more quickly, while still observing TCP's congestion control semantics. In addition, the proposed algorithm is guaranteed to perform no worse than current TCP congestion control algorithm in all cases, and is designed to be implemented in a way that is completely transparent to both ends of a TCP connection.ATCP is particularly useful for TCP connections that are short-lived and yet have a long round-trip delay, such as Web page transfers using HTTP 1.0. Our trace-driven simulation study shows that the aggregate congestion control algorithm can reduce the normalized transaction latency by a factor of up to 2, compared to standard TCP.
Upson''s Familiar Quotations Third Edition
Authors: Hugh Nicks, Al Gaulle
Venue:  (1982)

This report is a compilation of several hundred examples of context-free language and very irregular expressions. Contributions were submitted over the past several years by numerous computer science graduate students who collected these now immortal words in classes and seminars. We wish to express our gratitude to the faculty, guest lecturers, and students who provided the bulk of this work.