ppxscal/embedding_network huggingface dataset:
Least squares piecewise cubic curve fitting
Authors: J. Ferguson, P. A. Staley
Venue: Communications of the ACM (1973)

The matrices involved in a linear least squares formulation are determined for the problem of fitting piecewise cubic functions, those possessing a continuous derivative, to arrays of planar data.
A CRT editing system
Authors: Edgar T. Irons, Frans M. Djorup
Venue: Communications of the ACM (1972)

A text-editing and manipulation program is described. The program operates from low-cost cathode-ray tube entry and display stations with keyboard and 13 function buttons. Applications, potential economy of operation, and some aspects of implementation are discussed.
From Washington: NSF takes the initiative
Authors: Rosalie Steier
Venue: Communications of the ACM (1984)

The National Science Foundation's Advisory Committee for Advanced Scientific Computing Resources was formed to provide leadership for large-scale scientific computing throughout the United States. Consisting of 15 members representing universities, industry, and national laboratories, the Committee held its first meeting in January 1984. A summary of the meeting issued by Chairman Neal F. Lane of Rice University makes the following points.
Scheduling and module assignment for reducing BIST resources
Authors: I. Parulkar, S. K. Gupta, M. A. Breuer
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Built-in self-test (BIST) techniques modify functional hardware to give a data path the capability to test itself. The modification of data path registers into registers (BIST resources) that can generate pseudo-random test patterns and/or compress test responses, incurs an area overhead penalty. We show how scheduling and module assignment in high-level synthesis affect BIST resource requirements of a data path. A scheduling and module assignment procedure is presented that produces schedules which, when used to synthesize data paths, result in a significant reduction in BIST area overhead and hence total area.
Learning the interaction between pointers and scope in C++
Authors: Amruth N. Kumar
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Traditionally, pointers, and their interaction with scope in C++ have been a source of frustration and confusion for students in our Computer Science II course. Since problem-solving is known to improve learning [6], we set out to develop software that would help our students better understand these concepts by repeatedly solving problems based on them.In this paper, we will first describe the design and features of this software. We conducted tests in two sections of our Computer Science II course this fall to evaluate the effectiveness of using this software. The results have been very encouraging: the class average in both the sections increased by 100% from the pretest to the post-test. We will also present the design and results of these tests.
A contour-map program for x-ray crystallography
Authors: M. O. Dayhoff
Venue: Communications of the ACM (1963)

A FORTRAN program is described for use with the IBM 7090 system and an x, y-plotter to produce a contour map. A matrix of points evenly spaced in each dimension is contoured. Scale factors along the axes may be different and the axes need not be perpendicular.
Toward the holodeck: integrating graphics, sound, character and story
Authors: R. Hill, J. Gratch, W. L. Johnson, C. Kyriakakis, C. LaBore, R. Lindheim, S. Marsella, D. Miraglia, B. Moore, J. Morie, J. Rickel, M. Thiébaux, L. Tuch, R. Whitney, J. Douglas, W. Swartout
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

We describe an initial prototype of a holodeck- like environment that we have created for the Mission Rehearsal Exercise Project. The goal of the project is to create an experience learning system where the participants are immersed in an environment where they can encounter the sights, sounds, and circumstances of real-world scenarios. Virtual humans act as characters and coaches in an interactive story with pedagogical goals.
Syntactic and semantic augments to ALGOL
Authors: Joseph W. Smith
Venue: Communications of the ACM (1960)

The purpose of this paper is to propose a set of syntactic and semantic augments to ALGOL. The proposed extension are designed to facilitate the description of &ldquo;string&rdquo; manipulation in that language; they do not constitute a comprehensive language for symbol manipulation. Several such languages (LISP, IPL, &hellip;) already exist&mdash;many more will be designed and advantageously used in the future. It is felt that such languages belong in the repertoire of some language-system which contains a hierarchy of languages as well as nested &ldquo;continua&rdquo; of languages. In such systems, new languages may be embedded, appended, extracted at will. The fact that ALGOL is, implicitly, such a language-system seems to be only dimly recognized, even by designers. In any event, what is proposed in the sequel is not a language for symbol manipulation&mdash;qua language; but rather, a set of obvious extensions to the &ldquo;algebraic-language&rdquo; portion of ALGOL. To be sure, these extensions are complete in the sense that they are sufficient to describe symbol manipulations, but after all, the same statement holds for machine-language. Moreover, the extensions do not constitute a minimal set of primitives for string or symbol manipulations&mdash;in the sense that complementation, shifting, &hellip; are primitives for machine arithmetic. Such primitives are essential only to machine designers (including designers of &ldquo;augmented machine&rdquo;, the basic machine augmented by subroutines for arithmetics not included in the hardware); to append only such primitives to ALGOL is to visit the omissive sins of the machine designers upon the users of ALGOL.
General relativity and the application of algebraic manipulative systems
Authors: D. Barton, J. P. Fitch
Venue: Communications of the ACM (1971)

The paper describes some applications of symbolic algebra systems to problems of general relativity including the derivation of the field equations, the Petrov classification of a metric, and the solution of the field equations in the presence of matter in a simple case. Attention is drawn to the strictly algebraic difficulties encountered in this work.
A dynamic mechanism for time-constrained trading
Authors: Samuel P. M. Choi, Jiming Liu
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The market mechanism design is important for both conventional and electronic commerce as it affects the fairness and efficiency of trading. In this paper, we propose a new market mechanism for time- constrained trading. Our mechanism mimics the traditional brokering system, where buyers and sellers meet together and negotiate through an electronic marketplace. At each time step, agents are paired up for negotiating a deal. We consider that buyer and seller agents are associated with a time constraint and a search cost, and thus must decide promptly and judiciously whether to accept an offer. One distinguishing feature of our mechanism is that the marketplace provides buyer and seller agents with statistical information about the goods. Specifically, the statistics include the probability distributions of obtaining and losing a particular offer. With this information, the agents' decision can be viewed as a Markov decision process, and the optimal (dominant) trading strategy can be computed. In other words, buyer and seller agents can make trading decisions that maximize their expected utility without the need of speculating others actions. We also explain how such a dominant strategy can be computed in an efficient manner. Another distinguishing feature of the proposed mechanism is that the statistics are updated continuously and hence the dominant trading strategy is adaptive. Experimental results verify that our mechanism facilitates a fair allocation to the trading agents under various demand and supply conditions.
Predicting the &bgr;-helix fold from protein sequence data
Authors: Phil Bradley, Lenore Cowen, Matthew Menke, Jonathan King, Bonnie Berger
Venue: Proceedings of the fifth annual international conference on Computational biology (2001)

A method is presented that uses &bgr;-strand interactions to predict the right-handed &bgr;-helix super-secondary structural motif in protein sequences. A program called BetaWrap implements this method, and is shown to score known &bgr;-helices above non-&bgr;-helices in the Protein Data Bank in cross-validation. It is demonstrated that BetaWrap learns each of the seven known SCOP &bgr;-helix families, when trained on the the known &bgr;-helices from outside the family. BetaWrap also predicts many bacterial proteins of unknown structure that play a role in human infectious disease to &bgr;-helices; in particular, these proteins serve as virulence factors, adhesins and toxins in bacterial pathogenesis, and include cell surface proteins from Chlamydia and the intestinal bacterium Helicobacter pylori. The computational method used here may generalize to other &bgr; structures for which strand topology and profiles of residue accessibility are well conserved.
Partial-match retrieval using indexed descriptor files
Authors: John L. Pfaltz, William J. Berman, Edgar M. Cagley
Venue: Communications of the ACM (1980)

In this paper we describe a practical method of partial-match retrieval in very large data files. A binary code word, called a descriptor, is associated with each record of the file. These record descriptors are then used to form a derived descriptor for a block of several records, which will serve as an index for the block as a whole; hence, the name &ldquo;indexed descriptor files.&rdquo; First the structure of these files is described and a simple, efficient retrieval algorithm is presented. Then its expected behavior, in terms of storage accesses, is analyzed in detail. Two different file creation procedures are sketched, and a number of ways in which the file organization can be &ldquo;tuned&rdquo; to a particular application are suggested.
The ellipsoidal skeleton in medical applications
Authors: Frederic Banégas, Marc Jaeger, Dominique Michelucci, M. Roelens
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Rough 3D data images obtained by computed tomography or magnetic resonance imagery are inadequate: this paper proposes a high-level data structure called ellipsoidal skeleton. It is based on a tree of best partitions of the points set and features data compression, multi-level representation capabilities, surface reconstruction, interactive visualization, relevant parameters extraction, automatic matching and recognition.
Systems, interactions, and macrotheory
Authors: Philip Barnard, Jon May, David Duke, David Duce
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

A significant proportion of early HCI research was guided by one very clear vision: that the existing theory base in psychology and cognitive science could be developed to yield engineering tools for use in the interdisciplinary context of HCI design. While interface technologies and heuristic methods for behavioral evaluation have rapidly advanced in both capability and breadth of application, progress toward deeper theory has been modest, and some now believe it to be unnecessary. A case is presented for developing new forms of theory, based around generic &ldquo;systems of interactors.&rdquo; An overlapping, layered structure of macro- and microtheories could then serve an explanatory role, and could also bind together contributions from the different disciplines. Novel routes to formalizing and applying such theories provide a host of interesting and tractable problems for future basic research in HCI.
The good, the bad, and the muffled: the impact of different degradations on Internet speech
Authors: Anna Watson, M. Angela Sasse
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This paper presents an experiment comparing the relative impact of different types of degradation on subjective quality ratings of interactive speech transmitted over packet-switched networks. The experiment was inspired by observations made during a large-scale, long-term field trial of multicast conferencing. We observed that user reports of unsatisfactory speech quality were rarely due to network effects such as packet loss and jitter. A subsequent analysis of conference recordings found that in most cases, the impairment was caused by end-system hardware, equipment setup or user behavior. The results from the experiment confirm that the effects of volume differences, echo and bad microphones are rated worse than the level of packet loss most users are likely to experience on the Internet today, provided that a simple repair mechanism is used. Consequently, anyone designing or deploying network speech applications and services ought to consider the addition of diagnostics and tutorials to ensure acceptable speech quality.
A condensed representation to find frequent patterns
Authors: Artur Bykowski, Christophe Rigotti
Venue: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2001)

Given a large set of data, a common data mining problem is to extract the frequent patterns occurring in this set. The idea presented in this paper is to extract a condensed representation of the frequent patterns called disjunction-free sets, instead of extracting the whole frequent pattern collection. We show that this condensed representation can be used to regenerate all frequent patterns and their exact frequencies. Moreover, this regeneration can be performed without any access to the original data. Practical experiments show that this representation can be extracted very efficiently even in difficult cases. We compared it with another representation of frequent patterns previously investigated in the literature called frequent closed sets. In nearly all experiments we have run, the disjunction-free sets have been extracted much more efficiently than frequent closed sets.
IDDQ Testing of Submicron CMOS&mdash;by Cooling?
Authors: M. Rencz, V. Székely, S. Török, K. Torki, B. Courtois
Venue: Journal of Electronic Testing: Theory and Applications (2000)

The usability of IDDQ testing is limited by the subthreshold currents of the low-VT, submicron MOS transistors in the low bias voltage circuits. The paper addresses the cooling of the chip in order to overcome this problem. Experimental results concerning the effect of cooling on the threshold voltage and subthreshold current are presented in the range of &minus;75 &hellip; 25 Centigrade. The subthreshold currents decrease by a factor of about 100&ndash;1000 by cooling-down the chip to &minus;75 Centigrade.
Heuristic Procedures for the Capacitated Vehicle Routing Problem
Authors: V. Campos, E. Mota
Venue: Computational Optimization and Applications (2000)

In this paper we present two new heuristic procedures for the Capacitated Vehicle Routing Problem (CVRP). The first one solves the problem from scratch, while the second one uses the information provided by a strong linear relaxation of the original problem. This second algorithm is designed to be used in a branch and cut approach to solve to optimality CVRP instances. In both heuristics, the initial solution is improved using tabu search techniques. Computational results over a set of known instances, most of them with a proved optimal solution, are given.
Cellular disco: resource management using virtual clusters on shared-memory multiprocessors
Authors: Kinshuk Govil, Dan Teodosiu, Yongqiang Huang, Mendel Rosenblum
Venue: ACM Transactions on Computer Systems (TOCS) (2000)

Despite the fact that large-scale shared-memory multiprocessors have been commercially available for several years, system software that fully utilizes all their features is still not available, mostly due to the complexity and cost of making the required changes to the operating system. A recently proposed approach, called Disco, substantially reduces this development cost by using a virtual machine monitor that laverages the existing operating system technology. In this paper we present a system called Cellular Disco that extends the Disco work to provide all the advantages of the hardware partitioning and scalable operating system approaches. We argue that Cellular Disco can achieve these benefits at only a small fraction of the development cost of modifying the operating system. Cellular Disco effectively turns a large-scale shared-memory multiprocessor into a virtual cluster that supports fault containment and heterogeneity, while avoiding operating system scalability bottlenecks. Yet at the same time, Cellular Disco preserves the benefits of a shared-memory multiprocessor by implementing dynamic, fine-grained resource sharing, and by allowing users to overcommit resources such as processors and memory. This hybrid approach requires a scalable resource manager that makes local decisions with limited information while still providing good global performance and fault containment. In this paper we describe our experience with a Cellular Disco prototype on a 32-processor SGI Origin 2000 system. We show that the execution time penalty for this approach is low, typically within 10% of the best available commercial operating system formost workloads, and that it can manage the CPU and memory resources of the machine significantly better than the hardware partitioning approach.
Towards the effective parallel computation of matrix pseudospectra
Authors: C. Bekas, E. Kokiopoulou, I. Koutis, E. Gallopoulos
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

Given a matrix A, the computation of its pseudospectrum A&isin; (A) is a far more expensive task than the computation of characteristics such as the condition number and the matrix spectrum. As research of the last 15 years has shown, however, the matrix pseudospectrum provides valuable information that is not included in other indicators. So, we ask how to compute it efficiently and build a tool that would facilitate engineers and scientists to make such analyses? In this paper we focus on parallel algorithms for computing pseudospectra. The most widely used algorithm for computing pseudospectra is embarassingly parallel; nevertheless, it is extremely costly and one cannot hope achieve absolute high performance with it. We describe algorithms that have drastically improved performance while maintaining a high degree of large grain parallelism. We evaluate the effectiveness of these methods in the context of a MATLAB-based environment for parallel programming using MPI on small, off-the-shelf parallel systems.
A comparison of error improvement estimates for adaptive trapezoid integration
Authors: D. G. Schweikert
Venue: Communications of the ACM (1970)

Various simple choices of error improvement estimates for the trapezoid rule are studied to demonstrate a comparison procedure which is relatively independent of the profusion of adaptive search and stopping strategies. Comparisons are based on xr, 0 &le; r, 0 &le; x &le; 1; the inclusion of the non-integer powers makes this more realistic than the usual polynomial based comparison. Behavior near the singularity was found to be the dominant factor, and a new estimate, based on a constant curvature assumption and parametric differences, was considered slightly better than the other choices considered.
An extension of the Munkres algorithm for the assignment problem to rectangular matrices
Authors: François Bourgeois, Jean-Claude Lassalle
Venue: Communications of the ACM (1971)

The assignment problem, together with Munkres proposed algorithm for its solution in square matrices, is presented first. Then the authors develop an extension of this algorithm which permits a solution for rectangular matrices. Timing results obtained by using an adapted version of Silver's Algol procedure are discussed, and a relation between solution time and problem size is given.
Congestion estimation during top-down placement
Authors: Xiaojian Yang, Ryan Kastner, Majid Sarrafzadeh
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

Congestion is one of the fundamental issues in VLSI physical design. In this paper, we propose two congestion estimation approaches for early placement stages. First, we theoretically analyze the peak congestion value of the design and experimentally validate the estimation approach. Second, we estimate regional congestion in the early top-down placement. This is done by combining the wirelength distribution model and inter-region wire estimation. Both approaches are based on the well known Rent's rule, which is previously used for wirelength estimation. This is the first attempt to predict congestion using Rent's rule. The estimation results are compared with the layout after placement and global routing. Experiments on large industry circuits show that the early congestion estimation based on Rent's rule is a promising approach.
Optimal histogram matching by monotone gray level transformation
Authors: Shi-Kuo Chang, Yin-Wah Wong
Venue: Communications of the ACM (1978)

This paper investigates the problem of optimal histogram matching using monotone gray level transformation, which always assigns all picture points of a given gray level i to another gray level T(i) such that if i &ge; j, then T(i) &ge; T(j). The objective is to find a transformed digital picture of a given picture such that the sum of absolute errors between the gray level histogram of the transformed picture and that of a reference picture is minimized. This is equivalent to placing k1 linearly ordered objects of different sizes one by one into k2 linearly ordered boxes of assorted sizes, such that the accumulated error of space underpacked or overpacked in the boxes is minimized; the placement function is monotonic, which ensures a polynomial time solution to this problem. A tree search algorithm for optimal histogram matching is presented which has time complexity O(k1 &times; k2). If the monotone property is dropped, then the problem becomes NP-complete, even if it is restricted to k2 = 2.
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
Authors: Ulrich Meyer
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

The quest for a linear-time single-source shortest-path (SSSP) algorithm on directed graphs with positive edge weights is an ongoing hot research topic. While Thorup recently found an &Ogr;(n + m) time RAM algorithm for undirected graphs with n nodes, m edges and integer edge weights in {0,&hellip;,2w - 1} where w denotes the word length, the currently best time bound for directed sparse graphs on a RAM is &Ogr;(n + m &middot; log log n). In the present paper we study the average-case complexity of SSSP. We give a simple algorithm for arbitrary directed graphs with random edge weights uniformly distributed in [0, 1] and show that it needs linear time &Ogr;(n + m) with high probability.
Mixed solutions for the deadlock problem
Authors: John H. Howard,  Jr.
Venue: Communications of the ACM (1973)

Mixtures of detection, avoidance, and prevention provide more effective and practical solutions to the deadlock problem than any one of these alone. The individual techniques can be tailored for subproblems of resource allocation and still operate together to prevent deadlocks. This paper presents a method, based on the concept of the hierarchical operating system, for constructing appropriate mixtures and suggests appropriate subsystems for the most frequently occurring resource allocation problems
Error-free methods for statistical computations
Authors: B. E. Rodden
Venue: Communications of the ACM (1967)

Neely has discussed computational error generated by some algorithms used to compute various statistics. In the present paper methods are described which are error-free, simple in concept, and usually less costly in machine time than those mentioned by Neely.