ppxscal/embedding_network huggingface dataset:
A Simple Parallel Algorithm to Draw Cubic Graphs
Authors: Tiziana Calamoneri, Stephan Olariu, Rossella Petreschi
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

The main contribution of this work is to offer a simple and cost-efficient parallel algorithm that, given an arbitrary $n$-vertex cubic graph $G$ as input, produces an orthogonal grid drawing of $G$ in ${\rm O}(\log n)$ time, using $n$ processors on an EREW PRAM. Our algorithm matches the time and cost performance of the best previously-known algorithm while at the same time improving the constant factors involved in two important metrics: layout area and number of bends. More importantly, however, our algorithm stands out by its conceptual simplicity and ease of implementation.
Wasp nests for self-configurable factories
Authors: Vincent A. Cicirello, Stephen F. Smith
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they offer increased robustness against the unpredictability of factory operations. But the specification of local coordination policies that give rise to efficient global performance and effectively adapt to changing circumstances remains an interesting challenge. In this paper, we introduce a new approach to this coordination problem, drawing on various aspects of a computational model of how wasp colonies coordinate individual activities and allocate tasks to meet the collective needs of the nest. We focus specifically on the problem of configuring machines in a factory to best satisfy (potentially changing) product demands over time. Our system models the set of jobs queued in front of any given machine as a wasp nest, wherein wasp-like agents interact to form a social hierarchy and prioritize the jobs that they represent. Other wasp-like agents external to the nest act as overall machine proxies, and use a model of wasp task allocation behavior to determine which new jobs should be accepted into the machine's queue. We show for simple factories that our multi-agent system achieves the desired effect. For a given job mix, the system converges to a factory configuration that maximizes overall performance, and as the job mix changes, the system quickly adapts to a new, more appropriate configuration.
Hybrid term indexing for different IR models
Authors: Ken C. W. Chow, Robert W. P. Luk K. F. Wong, K. L. Kwok
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Retrieval effectiveness depends on how terms are extracted and indexed. For Chinese text (and others like Japanese and Korean), there are no space to delimit words. Indexing using hybrid terms (i.e. words and bigrams) were able to achieve the best precision amongst homogenous terms at a lower storage cost than indexing with bigrams. However, this was tested with conjunctive queries. Here, we extended the weighted Boolean models using fuzzy and p-norm measures, as well as the vector space model using the cosine measure, for processing hybrid terms. Our evaluation shows that all IR models using hybrid terms achieve better average precision over those using words. Across different recall values, the weighted Boolean model using fuzzy measures with hybrid terms achieve consistently about 8% higher than those using words. The vector space model using the cosine measures with hybrid terms achieved the best improvement in the average recall and precision.
Lower than best effort: a design and implementation
Authors: Ken Carlberg, Panos Gevros, Jon Crowcroft
Venue: Workshop on Data communication in Latin America and the Caribbean (2001)

In recent years, the Internet architecture has been augmented so that Better-than-Best-Effort (BBF) services, in the form of reserved resources for specific flows, can be provided by the network. To date, this has been realized through two different and sequentially developed efforts. The first is known as Integrated Services and focuses on specific bounds on bandwidth and/or delay for specific flows. The Differential Service model was later introduced, which presented a more aggregated and local perspective regarding the forwarding of traffic. A direction that is missing in today's work on service models is a defined schema used to purposely degrade certain traffic to various levels below that of Best Effort. In a sense, a new direction that provides a balancing effect in the deployment of BBE service. This is particularly evident with continual and parallel short transaction flows (like that used for web applications) over low bandwidth links that are not subject to any backoff penalty incurred by congestion because state does not persist. In a more indirect perspective, our model correlates degraded service with the application of usage and security policies &mdash; administrative decisions that can operate in tandem or disjointly from conditions of the network. This paper attempts to address these and other issues and presents the design and implementation of such a new degraded service model and queuing mechanism used to support it.
Tempus fight and the need for an e-social contract
Authors: James Kaufman, Joann Ruvolo, Daniel Ford
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

For autonomous agents to achieve their full potential they require access to detailed private information. The time is rapidly approaching when we can build systems to gather this information and monitor all aspects of an individual's life. In this paper we describe Tempus Fugit (Time Flies), an attempt to create just such a system. The reality of this technology has enormous social implications and, misused, it creates direct threats to liberty. We further describe an &ldquo;e-Social Contract&rdquo;, a design philosophy developed to safeguard against these threats. It is the foundation of the design philosophy behind Tempus Fugit and should be considered in the development of any agent technology.
Knoware, a concept map based collaborative virtual environment
Authors: Gil Regev
Venue: ACM SIGGROUP Bulletin (2000)

Knoware is an on-going research project between the Swiss Federal Institute of Technology (http://www.epfl.ch) and the International Institute for Management Development (http://www.imd.ch). Its main goal is to create a distance learning CVE that improves learners' synthesis capabilities. Knoware is a Concept Map based environment. This paper briefly describes Knoware and some questions related to intercultural issues as well as some lessons learned during the intercultural workshop that may be important for the future of Knoware.
Characteristics of programming exercises that lead to poor learning tendencies: Part II
Authors: Angela Carbone, John Hurst, Ian Mitchell, Dick Gunstone
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

In most introductory programming courses tasks are given to students to complete as a crucial part of their study. The tasks are considered important because they require students to apply their knowledge to new situations. However, often the tasks have not been considered as a vehicle that can direct learning behaviours in students. In this paper attention is paid to features of programming tasks that led to the following three poor learning behaviours: non-retrieval, lack of internal reflective thinking and lack of external reflective thinking. The data gathered for this study is provided by students and tutors, and describes the students' engagement in the tasks. The paper concludes with a list of generic improvements that should be considered when formulating programming exercises to minimise poor learning behaviours in students.
Hierarchical storage in information retrieval
Authors: John Salasin
Venue: Communications of the ACM (1973)

A probabilistic analysis is employed to determine the effect of hierarchical storage organizations on information retrieval operations. The data storage hardware is assumed to consist of n-levels of linearly connected memory hardware with increasing data access times and increasing data storage capabilities. A system might, for example, consist of fast semiconductor memory, computer core memory, extended core storage, disk memory, and data cells. Equations are derived to predict the effect of such a system on data access times using sequential files, random access files, and structured files employing multiple-hierarchical linked lists.
Audio watermarking for monitoring and copy protection
Authors: Jaap Haitsma, Michiel van der Veen, Ton Kalker, Fons Bruekers
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Based on existing technology used in image and video watermarking, we have developed a robust audio watermarking technique. The embedding algorithm operates in frequency domain, where the magnitudes of the Fourier coefficients are slightly modified. In the temporal domain, an additional scale parameter and gain function are necessary to refine the watermark and achieve perceptual transparency. Watermark detection relies on the Symmetrical Phase Only Matched Filtering (SPOMF) cross-correlation approach. Not only the presence of a watermark, but also its cyclic shift is detected. This shift supports a multi-bit payload for one particular watermark sequence. The watermarking technology proved to be very robust to a large number of signal processing &ldquo;attacks&rdquo; such as MP3 (64 kb/s), all-pass filtering, echo addition, time-scale modification, resampling, noise addition, etc. It is expected that this approach may contribute in a wide variety of existing (e.g. monitoring and copy protection) and future applications.
OO overkill: when simple is better than not
Authors: Owen Astrachan
Venue: ACM SIGCSE Bulletin (2001)

Object oriented design patterns as popularized in [GHJV95] are intended to solve common programming problems and to assist the programmer in designing and developing robust systems. As first year courses increasingly emphasize object orientation, knowledge of design patterns and when to use them becomes an important component of the first year curriculum. Recent literature has focused on introducing the patterns to computer science educators, but not on the situations and contexts in which the patterns are appropriate. Design patterns and object orientation are parts of a methodology that scales to large systems. In this paper we show that these concepts do not always scale down. We analyze examples from current literature that would be simpler without patterns, and provide examples of when the same design patterns do make design and programs simpler.
Speeding up an overrelaxation method of division in Radix-2n machine
Authors: Hitohisa Asai, C. K. Cheng
Venue: Communications of the ACM (1983)

For normalized floating point division, digital computers can take advantage of a division process that uses an iterative multiplying operation instead of repeated subtractions. An improvement of this division process by using accelerating constants in the overrelaxation has previously been proposed. Multiplication by a chosen accelerating constant accelerates the process of generating accurate digits of a quotient in division. We propose a further improvement by generalizing the accelerating constants in the overrelaxation method. Two benefits resulting from this improvement promise to yield faster division in digital computers.
Interweaving objects, types and people
Authors: Matthew Chalmers
Venue: Proceedings of DARE 2000 on Designing augmented reality environments (2000)

This position paper reflects a line of research that focuses on patterns of human activity over time. We aim to fit, show and support human activity via a rich record of people's motion amongst information, tools, other people, and space. We have built tools that track activity in the web and local files, and are now extending them to track motion amongst the streets of the city and the artifacts of a local museum. They make recommendations for movement and selection that are specific to the ongoing context of each user. Our intention is to treat physical and electronic objects as uniformly as possible, concentrating on their similarities as information bearing entities, rather than on their different characteristic media. A higher-level aim is to build systems that conform to contemporary models of language and semiology, that offer a unifying view of information based on its role in human activity and interpretation.
Robotic Control with Partial Visual Information
Authors: Keisuke Kinoshita, Michael Lindenbaum
Venue: International Journal of Computer Vision (2000)

We consider a robotic setting and a class of control tasks that rely on partial visual information. These tasks are difficult in the sense that at every given moment, the available information is insufficient for the control task. This implies that the image Jacobian, which relates the image space and the control space, is no longer of full rank. However, the amount of information collected throughout the control process is still large and thus seems sufficient for carrying out the task. Such situations commonly arise when the object is frequently occluded from one of the cameras in a stereo pair or when only one moving camera is available. We propose a generic control rule for such tasks and characterize the conditions required for the success of the task. The analysis is based on the observation that mathematically the behavior of such systems is related to a class of row-action optimization algorithms which are special cases of POCS (Projection On Convex Sets) algorithms. In the second part of the paper we focus on one particular task from this class: position and orientation control with a single rotating camera. We show that this task can be carried out, in principle, for any camera rotation and suggest efficient control and camera moving strategies. We substantiate our claims by simulations and experiments. Interestingly, it seems that the advisable control law is not consistent with simple intuition.
Temporal statement modifiers
Authors: Michael H. Böhlen, Christian S. Jensen, Richard Thomas Snodgrass
Venue: ACM Transactions on Database Systems (TODS) (2000)

A wide range of database applications manage time-varying data. Many temporal query languages have been proposed, each one the result of many carefully made yet subtly interacting design decisions. In this article we advocate a different approach to articulating a set of requirements, or desiderata, that directly imply the syntactic structure and core semantics of a temporal extension of an (arbitrary) nontemporal query language. These desiderata facilitate transitioning applications from a nontemporal query language and data model, which has received only scant attention thus far. The paper then introduces the notion of statement modifiers that provide a means of systematically adding temporal support to an existing query language. Statement modifiers apply to all query language statements, for example, queries, cursor definitions, integrity constraints, assertions, views, and data manipulation statements. We also provide a way to systematically add temporal support to an existing implementation. The result is a temporal query language syntax, semantics, and implementation that derives from first principles. We exemplify this approach by extending SQL-92 with statement modifiers. This extended language, termed ATSQL, is formally defined via a denotational-semantics-style mapping of temporal statements to expressions using a combination of temporal and conventional relational algebraic operators.
Game theory, algorithms, and the Internet
Authors: Christos H. Papadimitriou
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Among the many characteristics of the Internet (huge and growing, available and unstructured, dynamic and chaotic), perhaps the most novel, distinguishing, and intellectually challenging one is that, unlike previous computational artifacts and systems, the Internet is built, operated, and used by a dazzling diversity of economic interests, in various degrees of collaboration and competition with each other. Consequently, it can be argued that the mathematical arsenal necessary for attaining an algorithmic and conceptual understanding of the Internet must include some kind of fusion between mathematical economics (especially game theory and its inverse problem, mechanism design) and algorithmic thinking. In this talk I shall survey recent formalisms and results aiming in this general direction, and discuss the research agenda that appears to be emerging.
History and summary of FORTRAN standardization development for the ASA
Authors: W. P. Heising
Venue: Communications of the ACM (1964)

The American Standards Association (ASA) Sectional Committee X3 for Computers and Information Processing was established in 1960 under the sponsorship of the Business Equipment Manufacturers Association. ASA X 3 in turn established an X3.4 Sectional Subcommittee to work in the area of common programming language standards. On May 17, 1962, X3.4 established by resolution a working group, X3.4.3-FORTRAN to develop American Standard FORTRAN proposals.
New Colored Visual Secret Sharing Schemes
Authors: Ching-Nung Yang, Chi-Sung Laih
Venue: Designs, Codes and Cryptography (2000)

Visual secret sharing (VSS) schemes are used to protect the visual secret by sending n transparencies to different participants so that k-1 or fewer of them have no information about the original image, but the image can be seen by stacking k or more transparencies. However, the revealed secret image of a conventional VSS scheme is just black and white. The colored k out of n VSS scheme sharing a colored image is first introduced by Verheul and Van Tilborg [1]. In this paper, a new construction for the colored VSS scheme is proposed. This scheme can be easily implemented on basis of a black white VSS scheme and get much better block length than the Verheul-Van Tilborg scheme.
An overview of computational complexity
Authors: Stephen A. Cook
Venue: Communications of the ACM (1983)

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and parallel computation are discussed.
Dynamic scheduling of a fixed bandwidth communications channel for controlling multiple robots
Authors: Paul E. Rybski, Sascha A. Stoeter, Maria Gini, Dean F. Hougen, Nikolaos Papanikolopoulos
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We describe a distributed software system for controlling a group of miniature robots using a low capacity communication system. Space and power limitations on the robots drastically limit the capacity of the communication system and require sharing bandwidth and other resources among the robots. We have developed a scheduling and resource allocation system that is capable of dynamically assigning resources to each robot.
Simulation and analysis of biochemical systems: I. representation of chemical kinetics
Authors: David Garfinkel, Joseph D. Rutledge, Joseph J. Higgins
Venue: Communications of the ACM (1961)

In the study of problems in chemical kinetics in ordinary solution, reactions which may be represented by chemical equations of the form3 A + B = C + D (1) are represented kinetically by the differential equations d(C)/dt = d(D/dt = -d(A)/dt = - d(B)/dt = k(A)(B) (2) where (A), (B), (C), &middot;&middot;&middot; , are the concentrations of A, B, C, &middot;&middot;&middot; , and k is the kinetic constant for the reaction (assuming it to be occurring in ordinary solution).
CORC&mdash;the Cornell computing language
Authors: R. W. Conway, W. L. Maxwell
Venue: Communications of the ACM (1963)

CORC is an experimental computing language that was developed at Cornell University to serve the needs of a large and increasing group of computer users whose demands are both limited and intermittent. These are the laymen of the computing world, who chose to become as little concerned as possible in the computing process and mechanics, but who would like to benefit from the computational ability that is now commonplace. At a university most of the faculty and student users would fall into this category. In recognition of the current significance of the computer in every area of business, science and engineering there is increasing faculty interest in introducing some use of modern computation into the students' academic experience if this can be done without placing too great a burden on an already hard-pressed curriculum. But computing is not going to be widely used in mathematics and engineering courses if the mechanics of its use are a burden to either the teacher or the student, or if the time necessary to prepare, test and operate programs cuts significantly into the subject matter for which the course was intended. Some participation on the part of the student appears to be an academic virtue, as well as a practical economic necessity&mdash;we have never heard any university computing center expansionist, in his wildest moments, propose a completely closed shop programming-operating service for general undergraduate use. In their own research many of the faculty are in the same position as their students. They will use the computer if it is convenient to do so and if it does not involve a major diversion into a technical field which is essentially extraneous to the basic subject matter. The closed-shop computing service in which the professor has (in principle anyway) only to describe his problem to a professional is of course intended to serve this need but we believe it is axiomatic that no university computing center will ever be adequately staffed to
A Non-Scan Approach to DFT for Controllers Achieving 100% Fault Efficiency
Authors: Satoshi Ohtake, Toshimitsu Masuzawa, Hideo Fujiwara
Venue: Journal of Electronic Testing: Theory and Applications (2000)

This paper presents a non-scan design-for-testability method for controllers that are synthesized from FSMs (Finite State Machines). The proposed method can achieve complete fault efficiency: test patterns for a combinational circuit of a controller are applied to the controller using state transitions of the FSM. In the proposed method, at-speed test application can be performed and the test application time is shorter than previous methods. Moreover, experimental results show the area overhead is low.
A comparison of list schedules for parallel processing systems
Authors: Thomas L. Adam, K. M. Chandy, J. R. Dickson
Venue: Communications of the ACM (1974)

The problem of scheduling two or more processors to minimize the execution time of a program which consists of a set of partially ordered tasks is studied. Cases where task execution times are deterministic and others in which execution times are random variables are analyzed. It is shown that different algorithms suggested in the literature vary significantly in execution time and that the B-schedule of Coffman and Graham is near-optimal. A dynamic programming solution for the case in which execution times are random variables is presented.
Interview with Andrew Leyden--CEO of PenguinRadio
Authors: Jason Schumaker
Venue: Linux Journal (2000)

PenguinRadio is working to bring the power of the internet to home stereos and -- down the road -- to car stereos, as well.