ppxscal/embedding_network huggingface dataset:
Argumentation as distributed constraint satisfaction: applications and results
Authors: Hyuckchul Jung, Milind Tambe, Shriniwas Kulkarni
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is an effective approach to resolve conflicts. Indeed, we are applying argumentation in some real-world multi-agent applications. However, a key problem in such applications is that a well-understood computational model of argumentation is currently missing, making it difficult to investigate convergence and scalability of argumentation techniques, and to understand and characterize different collaborative NVA strategies in a principled manner. To alleviate these difficulties, we present distributed constraint satisfaction problem (DCSP) as a computational model for investigating NVA. We model argumentation as constraint propagation in DCSP. This model enables us to study convergence properties of argumentation, and formulate and experimentally compare 16 different NVA strategies with different levels of agent cooperativeness towards others. One surprising result from our experiments is that maximizing cooperativeness is not necessarily the best strategy even in a completely cooperative environment. The paper illustrates the usefulness of these results in applying NVA to multi-agent systems, as well as to DCSP systems in general.
PYTHIA-II: a knowledge/database system for managing performance data and recommending scientific software
Authors: Elias N. Houstis, Ann C. Catlin, John R. Rice, Vassilios S. Verykios, Naren Ramakrishnan, Catherine E. Houstis
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

Often scientists need to locate appropriate software for their problems and then select from among many alternatives. We have previously proposed an approach for dealing with this task by processing performance data of the targeted software. This approach has been tested using a customized implementation referred to as PYTHIA. This experience made us realize the complexity of the algorithmic discovery of knowledge from performance data and of the management of these data together with the discovered knowledge. To address this issue, we created PYTHIA-II&mdash;a modular framework and system which combines a general knowledge discovery in databases (KDD) methodology and recommender system technologies to provide advice about scientific software/hardware artifacts. The functionality and effectiveness of the system is demonstrated for two existing performance studies using sets of software for solving partial differential equations. From the end-user perspective, PYTHIA-II allows users to specify the problem to be solved and their computational objectives. In turn, PYTHIA-II (i) selects the software available for the user's problem (ii) suggests parameter values, and (iii) assesses the recommendation provided. PYTHIA-II provides all the necessary facilities to set up database schemas for testing suites and associated performance data in order to test sets of software. Moreover, it allows easy interfacing of alternative data mining and recommendation facilities. PYTHIA-II is an open-ended system implemented on public domain software and has been used for performance evaluation in several different problem domains.
Conversion of decision tables to computer programs by rule mask techniques
Authors: P. J. H. King
Venue: Communications of the ACM (1966)

The rule mask technique is one method of converting limited entry decision tables to computer programs. Recent discussion suggests that in many circumstances it is to be preferred to the technique of constructing networks or trees. A drawback of the technique as hitherto presented is its liability to produce object programs of longer run time than necessary. In this paper a modification of the technique is discussed which takes into account both rule frequencies and the relative times for evaluating conditions. This can materially improve object program run time.
Interoperable Run-Time Tools for Distributed Systems&mdash;A Case Study
Authors: Roland Wismüller, Thomas Ludwig
Venue: The Journal of Supercomputing (2000)

Tools that observe and manipulate the run-time behavior of parallel and distributed systems are essential for developing and maintaining these systems. Sometimes users would even need to use several tools at the same time in order to have a higher functionality at their disposal. Today, tools developed independently by different vendors are, however, not able to interoperate. Interoperability not only allows concurrent use of tools, but also can lead to an added value for the user. A debugger interoperating with a checkpointing system, for example, can provide a debugging environment where the debugged program can be reset to any previous state, thus speeding up cyclic debugging for long running programs.Using this example scenario, we derive requirements that should be met by the tools' software infrastructure in order to enable interoperability. A review of existing infrastructures shows that these requirements are only partially met today. In an ongoing research effort, support for all of the requirements is built into the OMIS compliant on-line monitoring system OCM.
Copyright aspects of computer usage
Authors: Reed C. Lawlor
Venue: Communications of the ACM (1964)

This paper is concerned with the question of what constitutes infringement of a copyright on a book or other nondramatic literary work when the work is fed into a computer and is indexed, analyzed, partially reprinted, or otherwise utilized by the computer to produce eye-readable output. The question of copyrightability of programs and infringement of copyrights on programs is also discussed. The paper is directed primarily to a discussion of the present law. Some aspects of the proposed new copyright law are also included. General recommendations are made with respect to the proposed revisions of the copyright law.
Power trees
Authors: Fabrizio Luccio, Linda Pagli
Venue: Communications of the ACM (1978)

The new class of Pk trees is presented, where height balance is maintained for the nodes lying on particular paths. The number of nodes of a Pk tree asympotically grows as a power of the height, in the worst case. A procedure for node insertion is given, and the class of trees considered is restricted to IPk trees, which are buildable by such a procedure. The average behavior of such trees, studied by an extensive set of simulation runs, is close to that of AVL trees. In particular, the family of IP0 trees whose main advantage is the reduced number of restructurings required after node insertion, is analyzed.
Music and computer composition
Authors: James Anderson Moorer
Venue: Communications of the ACM (1972)

The problem discussed is that of simulating human composition of Western popular music by computer and some relevant theories of music and harmony are given. Problems with this kind of program and several schemes that are known not to work are discussed. Several previous computer compositions are discussed, including the ILLIAC Suite. A program to generate short melody fragments was written to simulate some of the aspects of human composition. Five samples of its output are presented and discussed. It was discovered that although the fragments show many of the characteristics of popular melodies, they have a strangely alien sound. It is theorized that this is because the relevant probabilities which would discriminate against unfamiliar sequences were not used.
CS265 web network and web site management development of a core course in the Internet technology minor curriculum
Authors: Kevin D. Hufford
Venue: Journal of Computing Sciences in Colleges (2001)

The Internet is rapidly expanding into the world of commerce and communication media. The students in many different college majors, including CS and CIS, have an increasing desire to learn more about the Internet and what, where, when, why and how it is used. The question that they have is "How can they get involved and learn about the Internet as it relates to their major field of interest. Our current college students are witnessing a phenomenal effort by organizations of all types (e.g., government agencies, educational institutions, corporations, and small businesses) to exploit the web to deliver information to prospective customers and clients. Developing web applications requires people skilled in the use of state-of-the-art technologies such as HTML, DHTML, CGI, Java or JavaScript, JavaBeans, Microsoft's ActiveX and XML (eXtensible Markup Language). In addition, there is a need for an understanding of Internet information architecture, distributed systems, client-server capabilities, user-interface usability, web-based databases, maintaining security, designing &ldquo;effective&rdquo; web pages, and maintaining a web site/server. This paper describes the development of CS265 &ldquo;Web Network and Web Site Management&rdquo; a core course in an innovative curriculum for a Computer Sciences minor in Internet Technology. CS265 has been developed within a minor that includes several aspects of Internet-related computing science that are interesting to both the CS/CIS major and non-major alike. This paper presents the development of a successful course curriculum including lectures, lab exercises and projects. It is the intention that the variety of lectures, lab exercises and projects for CS265, &ldquo;Web Network and Web Site Management,&rdquo; presented here may easily be adapted into any computer science curriculum wishing to include a focus on programming for the Internet and the information systems involved.
On the problem of communicating complex information
Authors: David Pager
Venue: Communications of the ACM (1973)

The nature of the difficulty involved in communicating mathematical results between scientists using a computer based information retrieval system is examined. The problem is analyzed in terms of psychological and information-processing processes, and what turns out to be a vicious circle of effects is described. The paper then considers how the presentation of information by a computer-based information retrieval system, or by other media, can be improved. Some trade-offs which affect the design of the presentation are mentioned, and a number of ideas for improvement are described. These include ways of augmenting written natural language by various notational and linguistic devices, the exhibition of the structure inherent in the information we are communicating, and a sophisticated interactive system controlled by computer.
On developing and verifying design abstractions for reliable concurrent programming in Ada
Authors: A. Burns, A. J. Wellings, A. M. Koelmans, M. Koutny, A. Romanovsky, A. Yakovlev
Venue: Proceedings of the 10th international workshop on Real-time Ada workshop (2001)

Ada 95 is an expressive concurrent programming language, which allows building large multi-tasking applications. Much of the complexity of these applications stems from the interactions between the tasks. Design abstractions (such as atomic actions, conversations etc.) have been proposed to deal with such complexity. This paper argues that Petri nets offer a promising, tool-supported, technique for checking the logical correctness of abstractions. The paper illustrates the effectiveness of this approach by showing the correctness of an Ada implementation of the atomic action protocol using a variety of Petri net tools.
Method for hyphenating at the end of a printed line
Authors: R. P. Rich, A. G. Stone
Venue: Communications of the ACM (1965)

A description of a method of hyphenation is presented as a result of application of several general rules. The character sets considered by the routine and the method are briefly outlined.
Optimal Structure from Motion: Local Ambiguities and Global Estimates
Authors: Alessandro Chiuso, Roger Brockett, Stefano Soatto
Venue: International Journal of Computer Vision (2000)

&ldquo;Structure From Motion&rdquo; (SFM) refers to the problem of estimating spatial properties of a three-dimensional scene from the motion of its projection onto a two-dimensional surface, such as the retina. We present an analysis of SFM which results in algorithms that are provably convergent and provably optimal with respect to a chosen norm.In particular, we cast SFM as the minimization of a high-dimensional quadratic cost function, and show how it is possible to reduce it to the minimization of a two-dimensional function whose stationary points are in one-to-one correspondence with those of the original cost function. As a consequence, we can plot the reduced cost function and characterize the configurations of structure and motion that result in local minima. As an example, we discuss two local minima that are associated with well-known visual illusions. Knowledge of the topology of the residual in the presence of such local minima allows us to formulate minimization algorithms that, in addition to provably converge to stationary points of the original cost function, can switch between different local extrema in order to converge to the global minimum, under suitable conditions. We also offer an experimental study of the distribution of the estimation error in the presence of noise in the measurements, and characterize the sensitivity of the algorithm using the structure of Fisher's Information matrix.
Probability of heavy traffic period in third generation CDMA mobile communication
Authors: B. S. Tsybakov
Venue: Mobile Networks and Applications (2001)

The paper considers a problem of deriving the multidimensional distribution of a segment of a long-range dependent traffic in the third generation mobile communication network. An exact expression for the probability is found when a self-similar process from [8] models the traffic. the probability of heavy-traffic period, the outage probability, and the level-crossing probability are found. It is shown that the level crossing probability depends on the average call length only. Further, this probability for traffic with dependent samples is lower than for traffic with independent samples. Also, it is shown that there is a linear dependence between the average heavy traffic interval and the average call length.
The self-judgment method of curve fitting
Authors: P. A. D. de Maine
Venue: Communications of the ACM (1965)

A computer-oriented method for processing and communicating numerical data is described. The Instrument Reliability Factors (IRF), which exactly define the limits of reliability of each measured item of information, are used to compute the Maximum Permitted Error (MPE) associated with each value of each ordinate. The Self-Judgment Principle (SJP) is used to discard wrong information and to compute mean values of the parameters and their MPE's in terms of the IRF. Data compatibility tests with any number of different equations can be made quickly. Otherwise intractable problems are easily solved, and the design of many experiments is greatly simplified. The computational and mathematical techniques used to reduce bias in the SJP are discussed. Inadequacies in the statistical and graphical methods of curve fitting are noted.
The quadratic quotient method: a hash code eliminating secondary clustering
Authors: James R. Bell
Venue: Communications of the ACM (1983)

Secondary clustering as a cause of hash code inefficiency is discussed, and a new hashing method based on its elimination is presented. Comparisons with previous methods are made both analytically and empirically.
Problems in application software maintenance
Authors: Bennet P. Lientz, E. Burton Swanson
Venue: Communications of the ACM (1981)

The problems of application software maintenance in 487 data processing organizations were surveyed. Factor analysis resulted in the identification of six problem factors: user knowledge, programmer effectiveness, product quality, programmer time availability, machine requirements, and system reliability. User knowledge accounted for about 60 percent of the common problem variance, providing new evidence of the importance of the user relationship for system success or failure. Problems of programmer effectiveness and product quality were greater for older and larger systems and where more effort was spent in corrective maintenance. Larger scale data processing environments were significantly associated with greater problems or programmer effectiveness, but with no other problem factor. Product quality was seen as a lesser problem when certain productivity techniques were used in development.
Models for metasearch
Authors: Javed A. Aslam, Mark Montague
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Given the ranked lists of documents returned by multiple search engines in response to a given query, the problem ofmetasearchis to combine these lists in a way which optimizes the performance of the combination. This paper makes three contributions to the problem of metasearch: (1) We describe and investigate a metasearch model based on an optimal democratic voting procedure, the Borda Count; (2) we describe and investigate a metasearch model based on Bayesian inference; and (3) we describe and investigate a model for obtaining upper bounds on the performance of metasearch algorithms. Our experimental results show that metasearch algorithms based on the Borda and Bayesian models usually outperform the best input system and are competitive with, and often outperform, existing metasearch strategies. Finally, our initial upper bounds demonstrate that there is much to learn about the limits of the performance of metasearch.
The usage of stochastic processes in embedded system specifications
Authors: Axel Jantsch, Ingo Sander, Wenbiao Wu
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

We review the use of nondeterminism and identify two different purposes. The descriptive purpose handles uncertainties in the behaviour of existing entities. The constraining purpose is used in specifications to constrain implementations. For the specification of embedded systems we suggest a stochastic processor instead of nondeterminism. It serves mostly the descriptive purpose but can also be used to constrain the system. We carefully distinguish different interpretations of these concepts by the different design activities simulation, synhesis and verification.
Dynamic response time prediction for computer networks
Authors: Sandra A. Mamrak
Venue: Communications of the ACM (1977)

If the ultimate aim of a computing network is resource sharing, then the human component as well as the technical component of networking must be fully investigated to achieve this goal. This research is a first step toward assisting the user in participating in the vast store of resources available on a network. Analytical, simulation, and statistical performance evaluation tools are employed to investigate the feasibility of a dynamic response time monitor that is capable of providing comparative response time information for users wishing to process various computing applications at some network computing node. The research clearly reveals that sufficient system data are currently obtainable, at least for the five diverse ARPA network systems studied in detail, to describe and predict the response time for network time-sharing systems as it depends on some measure of system activity or load level.
AnimalScript: an extensible scripting language for algorithm animation
Authors: Guido Rößling, Bernd Freisleben
Venue: ACM SIGCSE Bulletin (2001)

In this paper, we present the AnimalScript visualization language. This scripting language uses the flexibility of the Animal system and provides many additional new graphic primitives and animation effects that go beyond the traditional Animal GUI features.AnimalScript can easily be configured by changing the content of a registration file. Users may also have multiple registration files, as AnimalScript will always use the first registration file it finds. AnimalScript can easily be extended with additional features without needing to read, let alone change, any existing code.
Sparse Approximate Inverse Smoother for Multigrid
Authors: Wei-Pai Tang, Wing Lok Wan
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Various forms of sparse approximate inverses (SAI) have been shown to be useful for preconditioning. Their potential usefulness in a parallel environment has motivated much interest in recent years. However, the capability of an approximate inverse in eliminating the local error has not yet been fully exploited in multigrid algorithms. A careful examination of the iteration matrices of these approximate inverses indicates their superiority in smoothing the high-frequency error in addition to their inherent parallelism. We propose a new class of SAI smoothers in this paper and present their analytic smoothing factors for constant coefficient PDEs. The following are several distinctive features that make this technique special: By adjusting the quality of the approximate inverse, the smoothing factor can be improved accordingly. For hard problems, this is useful. In contrast to the ordering sensitivity of other smoothing techniques, this technique is ordering independent. In general, the sequential performance of many superior parallel algorithms is not very competitive. This technique is useful in both parallel and sequential computations. Our theoretical and numerical results have demonstrated the effectiveness of this new technique.
Implementing studios for experiential learning
Authors: Christabel Gonsalvez, Martin Atchison
Venue: Proceedings of the Australasian conference on Computing education (2000)

This paper summarises some of the key issues arising from the implementation of studio-based teaching in two IT-based undergraduate courses. The studios aim to provide students with experiential learning, in which they can `learn by doing'. They are based on a model of studio teaching advocated by Schon. The paper describes a wide variety of ideas which have been tried in the studios, and discusses student and staff responses. It indicates some of the lessons which have been learned, and identifies the key issues which need to be addressed when implementing studio teaching.
Modeling inheritance as coercion in a symbolic computation system
Authors: César Domínguez, Julio Rubio
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this paper the analysis of the data structures used in a symbolic computation system, called Kenzo, is undertaken. We deal with the specification of the inheritance relationship since Kenzo is an object-oriented system, written in CLOS, the Common Lisp Object System. We focus on a particular case, namely the relationship between simplicial sets and chain complexes, showing how the order-sorted algebraic specifications formalisms can be adapted, through the &ldquo;inheritance as coercion&rdquo; metaphor, in order to model this Kenzo fragment.