ppxscal/embedding_network huggingface dataset:
Programming languages: history and future
Authors: Jean E. Sammet
Venue: Communications of the ACM (1972)

This paper discusses both the history and future of programming languages ( = higher level languages). Some of the difficulties in writing such a history are indicated. A key part of the paper is a tree showing the chronological development of languages and their interrelationships. Reasons for the proliferation of languages are given. The major languages are listed with the reasons for their importance. A section on chronology indicates the happenings of the significant previous time periods and the major topics of 1972. Key concepts other than specific languages are discussed.
Multiple shooting method for two-point boundary value problems
Authors: David D. Morrison, James D. Riley, John F. Zancanaro
Venue: Communications of the ACM (1962)

The common techniques for solving two-point boundary value problems can be classified as either "shooting" or "finite difference" methods. Central to a shooting method is the ability to integrate the differential equations as an initial value problem with guesses for the unknown initial values. This ability is not required with a finite difference method, for the unknowns are considered to be the values of the true solution at a number of interior mesh points. Each method has its advantages and disadvantages. One serious shortcoming of shooting becomes apparent when, as happens altogether too often, the differential equations are so unstable that they "blow up" before the initial value problem can be completely integrated. This can occur even in the face of extremely accurate guesses for the initial values. Hence, shooting seems to offer no hope for some problems. A finite difference method does have a chance for it tends to keep a firm hold on the entire solution at once. The purpose of this note is to point out a compromising procedure which endows shooting-type methods with this particular advantage of finite difference methods. For such problems, then, all hope need not be abandoned for shooting methods. This is desirable because shooting methods are generally faster than finite difference methods. The organization is as follows: I. The two-point boundary value problem is stated in quite general form. II. A particular shooting method is described which is designed to solve the problem in this form. III. The two-point boundary value problem is then restated in such a way that: (a) the restatement still falls within the general form, and (b) the shooting method now has a better chance of success when the equations are unstable.
Topological sorting of large networks
Authors: A. B. Kahn
Venue: Communications of the ACM (1962)

The use of programmed digital computers as general pattern classification and recognition devices is one phase of the current lively interest in artificial intelligence. It is important to choose a class of signals which is, at present, undergoing a good deal of visual inspection by trained people for the purpose of pattern recognition. In this way comparisons between machine and human performance may be obtained. A practical result also serves as additional motivation. Clinical electrocardiograms make up such a class of signals. The approach to the problem presented here centers upon the use of multiple adaptive matched filters that classify normalized signals. The present report gives some of the background for the application of this method.
On Liouvillian solutions of linear differential equations of order 4 and 5
Authors: Olivier Cormier
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this paper we give the minimal possible degrees of an algebraic solution of the Riccati equation associated to an irreducible linear homogeneous differential equation of order 4 and 5, following the method used for the order 3 ([14]). We show that the algebraic degree of such a solution is bounded by 120 for the order 4 and by 55 for the order 5. With the important work done by Hessinger in [5] and the Tables computed in the sequel this leads to an algorithm to find Galois group and liouvillian solutions of equations of order 4. In the last section we construct an irreducible differential equation of degree 4 having SL(2, 7) as a Galois group and compute its liouvillian solutions. We also give the minimal polynomial over Q(x) of the algebraic solutions of the differential equation. This example illustrates a method which is easy to use in order to compute a liouvillian solution with the help of the Tables computed in this paper.
The maximum entropy approach and probabilistic IR models
Authors: Warren R. Greiff, Jay M. Ponte
Venue: ACM Transactions on Information Systems (TOIS) (2000)

This paper takes a fresh look at modeling approaches to information retrieval that have been the basis of much of the probabilistically motivated IR research over the last 20 years. We shall adopt a subjectivist Bayesian view of probabilities and argue that classical work on probabilistic retrieval is best understood from this perspective. The main focus of the paper will be the ranking formulas corresponding to the Binary Independence Model (BIM), presented originally by Roberston and Sparck Jones [1977] and the Combination Match Model (CMM), developed shortly thereafter by Croft and Harper [1979]. We will show how these same ranking formulas can result from a probabilistic methodology commonly known as Maximum Entropy (MAXENT).
Character structure and character parity sense for serial-by-bit data communication in the American Standard Code for information interchange
Authors: E. Lohse, R. V. Smith, J. F. Traub, S. Gorn
Venue: Communications of the ACM (1965)

ACM proposes to republish contents of Communications Algorithms section is useable looseleaf format, with bimonthly updating service, provided there is sufficient demand. For details, see News item on page 583.
C Compiler Design for an Industrial Network Processor
Authors: Jens Wagner, Rainer Leupers
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

One important problem in code generation for embedded processors is the design of efficient compilers for ASIPs with application specific architectures. This paper outlines the design of a C compiler for an industrial ASIP for telecom applications. The target ASIP is a network processor with special instructions for bit-level access to data registers, which is required for packet-oriented communication protocol processing. From a practical viewpoint, we describe the main challenges in exploiting these application specific features in a C compiler, and we show how a compiler backend has been designed that accomodates these features by means of compiler intrinsics and a dedicated register allocator. The compiler is fully operational, and first experimental results indicate that C-level programming of the ASIP leads to good code quality without the need for time-consuming assembly programming.
Programming atomic multicast in CAN
Authors: Luís Miguel Pinho, Francisco Vasques, Luis Ferreira
Venue: ACM SIGAda Ada Letters (2001)

In Distributed Computer-Controlled Systems (DCCS), a special emphasis must be given to the communication infrastructure, which must provide timely and reliable communication services. CAN networks are usually suitable to support small-scale DCCS. However, they are known to present some reliability problems, which can lead to an unreliable behaviour of the supported applications.In this paper, an atomic multicast protocol for CAN networks is proposed. This protocol explores the CAN synchronous properties, providing a timely and reliable service to the supported applications.The implementation of such protocol in Ada, on top of the Ada version of Real-Time Linux is presented, which is used to demonstrate the advantages and disadvantages of the platform to support reliable communications in DCCS.
A scaled version of the elastic time algorithm
Authors: Francesco Quaglia
Venue: Proceedings of the fifteenth workshop on Parallel and distributed simulation (2001)

Recently a new class of synchronization algorithms for parallel discrete event simulation has been proposed, namely the near perfect state information algorithms, which are based on a notion of error potential to control the optimism of event execution. An algorithm of this class, called elastic time algorithm (ETA), has been instantiated. In this algorithm, the error potential is computed using temporal information (next event timestamp, simulation clocks etc.) and is then translated into event execution delay based on a constant factor. In this paper we present a scaled version of ETA (SETA), in which the error potential is translated into event execution delay based on both a constant factor and an additional scaling factor determined dynamically as a function of the event granularity. We have implemented versions of ETA and SETA for a cluster of PCs connected by a Myrinet switch and we have established in an empirical study that SETA outperforms ETA if there is difference in the granularity of different event types.
Particle-in-cell simulation codes in High Performance Fortran
Authors: Erol Akarsu, Kivanc Dincer, Tomasz Haupt, Geoffrey C. Fox
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Particle-in-Cell (PIC) plasma simulation codes model the interaction of charged particles with surrounding electrostatic and magnetic fields. Its computational requirements made it to be classified as one of the grand-challenge problems facing the high performance community. In this paper we present the implementation of 1-D and 2-D electrostatic PIC codes in High Performance Fortran(HPF) on a IBM SP-2. HPF expands Fortran 90 with data distribution and alignment directives and data parallel statements. It is a powerful language for writing portable and high performance programs across many platforms. We used one of the most successful commerical HPF compilers currently available in the market and augmented the compiler's missing HPF functions with extrinsic routines when necessary. We obtained near linear speed-up in all of our test cases. The performance of the HPF programs is comparable to the native message passing implementations of the same codes on the SP-2.
Reciprocation, Square Root, Inverse Square Root, and Some Elementary Functions Using Small Multipliers
Authors: Milos D. Ercegovac, Tomás Lang, Jean-Michel Muller, Arnaud Tisserand
Venue: IEEE Transactions on Computers (2000)

This paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and, for some functions, a final ¿large¿ (almost full-length) multiplication. We propose a method, based on argument reduction and series expansion, that allows fast evaluation of these functions in high precision. The strength of this method is that the same scheme allows the computation of all these functions. We estimate the delay, the size/number of tables, and the size/number of multipliers and compare with other related methods.
Securing DNS and BIND
Authors: Michael D. Bauer
Venue: Linux Journal (2000)

Decreasing the vulnerability of your DNS server is largely a matter of staying current and private. 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
Every agent a web server, every agent community an intranet&hellip;
Authors: Marshall Brinn, Todd M. Carrico, Nathan Combs
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The research community is struggling with the right approach to integrate emerging agent technology with the exploding web page- based Internet. This paper presents the approach used in Cognitive Agent Architecture (Cougaar) under DARPAs Advanced Logistics Project (ALP). In this effort, each agent was constructed with a build- in web server, supported by specialized API for easy creation of modular PlugIns which transforms agent internal object structures into XML and formatted HTML. In addition, the project has developed an efficient set of techniques for transparent proxies to allow any agent entry- point to serve as an Intranet portal to the whole community of agents. Further, as each agent holds only its part of the plan, the underlying infrastructure transparently supports traversal across the boundaries of one agents plan into that of a different agent. Thus the interfaces support a visualization of the global plan though physically it is a partitioned blackboard distributed among many agents on different machines. The benefit of this approach is that developers can easily build specialized user interfaces into the agent internal plans and state which is accessible through a standard browser by connecting to any agent URL in the society.
Constrained objects for modeling complex structures (extended abstract)
Authors: Bharat Jayaraman Pallavi Y. Tambay
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Constrained objects are objects whose state is regulated by constraints. They are applicable in many domains, e.g., engineering and organizational modeling. Our proposed language (Cob) supports class hierarchies, constraints, and preferences; and our computational model supports constraint satisfaction, optimization and relaxation. Constrained objects are thus a declarative approach to object-oriented programming.
Supporting service discovery, querying and interaction in ubiquitous computing environments
Authors: Adrian Friday, Nigel Davies, Elaine Catterall
Venue: Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access (2001)

Future computing environments will consist of a wide range of network based appliances, applications and services interconnected using both wired and wireless networks. In order to encourage the development of applications in such environments and remove the need for complex administration and configuration tasks, researchers have recently developed a range of service discovery and interaction platforms. Examples of such platforms include SLP, HAVi, UPnP and Jini. While these platforms share a number of common attributes, they each have distinguishing features and hence future networked environments are likely to present developers with a heterogeneous environment composed of multiple specialised support platforms. However, careful analysis of these platforms reveals shortcomings that we believe will inhibit the development of applications that exploit service rich environments. In this paper we discuss these shortcomings and propose a new unifying architecture that brings together the advantages of current service discovery and interaction technologies and provides a new API that we consider to be better suited to the development of service based applications. This work is specifically targeted towards mobile environments, where applications will be required to interact with a wide range of services and devices with minimal user intervention.
Over all computation control and labelling
Authors: Anatol Holt
Venue: Communications of the ACM (1960)

The primary function of computer installation is (as everyone knows) to solve useful problems. The programs that accomplish such solutions are called production programs, and when they are applied to a particular set of data and run on the computer the computer is engaged in a production run.
A recurrence scheme for converting from one orthogonal expansion into another
Authors: Herbert E. Salzer
Venue: Communications of the ACM (1973)

A generalization of a scheme of Hamming for converting a polynomial Pn(x) into a Chebyshev series is combined with a recurrence scheme of Clenshaw for summing any finite series whose terms satisfy a three-term recurrence formula. An application to any two orthogonal expansions Pn(x) = &sum;nm=0 amqm(x) = &sum;nm=0 AmQm(x) enables one to obtain Am directly from am, m = 0(1)n, by a five-term recurrence scheme.
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors
Authors: Ming-Yang Kao, Jie Wang
Venue: SIAM Journal on Computing (2000)

Given a multiset X={x1,. . .,xn} of real numbers, the floating-point set summation problem asks for Sn=x1 + . . . + xn. Let $E^*_n$ denote the minimum worst-case error over all possible orderings of evaluating Sn. We prove that if X has both positive and negative numbers, it is NP-hard to compute Sn with the worst-case error equal to $E^*_n$. We then give the first known polynomial-time approximation algorithm that has a provably small error for arbitrary X. Our algorithm incurs a worst-case error at most $2(\lceil\log(n-1)\rceil+1)E^*_n$. (All logarithms log in this paper are base 2.) After X is sorted, it runs in O(n) time. For the case where X is either all positive or all negative, we give another approximation algorithm with a worst-case error at most $\lceil\log\log n\rceil E^*_n$. Even for unsorted X, this algorithm runs in O(n) time. Previously, the best linear-time approximation algorithm had a worst-case error at most $\lceil\log n\rceil E^*_n$, while $E^*_n$ was known to be attainable in O(n log n) time using Huffman coding.
Introducing patterns (or any new idea) into organizations (poster session)
Authors: Mary Lynn Manns, Linda Rising Alan O'Callaghan
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Those who have used patterns are aware that this literary form, and its corresponding process and community support, is providing a way to capture best practices and communicate them throughout organizations and the entire software industry. However, many who have tried to introduce patterns (or any new idea) into their organizations have found it to be a difficult task. Therefore, a pattern language, currently titled Evolving a Patterns Culture, is being written to capture solutions to the challenges in introducing patterns (or any new idea) into an organization.
Macro instruction extensions of compiler languages
Authors: M. Douglas McIlroy
Venue: Communications of the ACM (1960)

Macroinstruction compilers constructed from a small set of functions can be made extremely powerful. In particular, conditional assembly, nested definitions, and parenthetical notation serve to make a compiler capable of accepting very general extensions to its ground language.
A new approach to developing and implementing eager database replication protocols
Authors: Bettina Kemme, Gustavo Alonso
Venue: ACM Transactions on Database Systems (TODS) (2000)

Database replication is traditionally seen as a way to increase the availability and performance of distributed databases. Although a large number of protocols providing data consistency and fault-tolerance have been proposed, few of these ideas have ever been used in commercial products due to their complexity and performance implications. Instead, current products allow inconsistencies and often resort to centralized approaches which eliminates some of the advantages of replication. As an alternative, we propose a suite of replication protocols that addresses the main problems related to database replication. On the one hand, our protocols maintain data consistency and the same transactional semantics found in centralized systems. On the other hand, they provide flexibility and reasonable performance. To do so, our protocols take advantage of the rich semantics of group communication primitives and the relaxed isolation guarantees provided by most databases. This allows us to eliminate the possibility of deadlocks, reduce the message overhead and increase performance. A detailed simulation study shows the feasibility of the approach and the flexibility with which different types of bottlenecks can be circumvented.
The Montgomery Modular Inverse-Revisited
Authors: E. Savas, Ç. K. Koç
Venue: IEEE Transactions on Computers (2000)

We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the Kaliski-Montgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose microprocessors.
Machine calculation of moments of a probability distribution
Authors: J. A. Lechner
Venue: Communications of the ACM (1961)

A method is presented for the calculation on a machine of the moments of a probability distribution, necessitating little more than n additions and n references to memory for each moment, instead of the minimum of n multiplication, 2n additions, and 2n references to memory required by the most straightforward method (where n is the number of entries in the probability distribution). The method is directly applicable when a tabulated distribution exists, as when it has been computed by repeated convolution; but in this case it conserves both time and accuracy.
XLibris: an automated library research assistant
Authors: Andrew Crossen, Jay Budzik, Mason Warner, Larry Birnbaum, Kristian J. Hammond
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

While recent work has focused on providing tools and infrastructure for users to access electronic information over the Internet, the relationship between the physical world and information available online has been relatively unexplored. Information about a user's location, and the objects she interacts with, can be sufficient to recognize enough of the user's task to drive retrieval of online information relevant to the task at hand. The XLibris system automatically retrieves, aggregates, and delivers information about books to users as they are checked out of the library, using information about the books themselves and the user's task. XLibris locates books in the Dewey Decimal subject hierarchy to automatically search for the most relevant information about the book for the user, tailoring both the sources queried and the information returned based on the book's position in the hierarchy.
Checking Before Output May Not Be Enough Against Fault-Based Cryptanalysis
Authors: Sung-Ming Yen, Marc Joye
Venue: IEEE Transactions on Computers (2000)

In order to avoid fault-based attacks on cryptographic security modules (e.g., smart-cards), some authors suggest that the computation results should be checked for faults before being transmitted. In this paper, we describe a potential fault-based attack where key bits leak only through the information whether the device produces a correct answer after a temporary fault or not. This information is available to the adversary even if a check is performed before output.