ppxscal/embedding_network huggingface dataset:
Curriculum '78: recommendations for the undergraduate program in computer science&mdash; a report of the ACM curriculum committee on computer science
Authors: Richard H. Austing, Bruce H. Barnes, Della T. Bonnette, Gerald L. Engel, Gordon Stokes
Venue: Communications of the ACM (1979)

Contained in this report are the recommendations for the undergraduate degree program in Computer Science of the Curriculum Committee on Computer Science (C3S) of the Association for Computing Machinery (ACM). The core curriculum common to all computer science undergraduate programs is presented in terms of elementary level topics and courses, and intermediate level courses. Elective courses, used to round out an undergraduate program, are then discussed, and the entire program including the computer science component and other material is presented. Issues related to undergraduate computer science education, such as service courses, supporting areas, continuing education, facilities, staff, and articulation are presented.
Recursive Estimation and Testing of Dynamic Models
Authors: Juan Del Hoyo J. Guillermo Llorente
Venue: Computational Economics (2000)

Recursive estimates can be useful for diagnostic purposes, but algorithms for estimating dynamic models recursively with autocorrelated perturbations can be computationally complicated. Thus, we propose a Conditional Recursive Least Squares algorithm (CRLS): given initial full-sample consistent estimates obtained from a correctly specified model, the model is linearized to obtain recursive consistent estimators along the full sample. These may in turn be used to compute statistics to test for structural breaks with unknown break dates. This procedure is illustrated with the Gas-Furnace data.
Coimbra: secure Web access to multimedia content
Authors: Edgar Weippl
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

In this paper, we describe various concepts how Web content can be published in a way so that copies cannot be illegally distributed. The required access control mechanisms are implemented using well-known cryptographic algorithms. A modified Web browser decrypts the content on-the-fly so that it is impossible for unauthorized users to copy and distribute the presented multimedia content.
Best sorting algorithm for nearly sorted lists
Authors: Curtis R. Cook, Do Jin Kim
Venue: Communications of the ACM (1980)

Straight Insertion Sort, Shellsort, Straight Merge Sort, Quickersort, and Heapsort are compared on nearly sorted lists. The ratio of the minimum number of list elements which must be removed so that the remaining portion of the list is in order to the size of the list is the authors' measure of sortedness. Tests on randomly generated lists of various combinations of list length and small sortedness ratios indicate that Straight Insertion Sort is best for small or very nearly sorted lists and that Quickersort is best otherwise. Cook and Kim also show that a combination of the Straight Insertion Sort and Quickersort with merging yields a sorting method that performs as well as or better than either Straight Insertion Sort or Quickersort on nearly sorted lists.
Object code optimization
Authors: Edward S. Lowry, C. W. Medlock
Venue: Communications of the ACM (1969)

Methods of analyzing the control flow and data flow of programs during compilation are applied to transforming the program to improve object time efficiency. Dominance relationships, indicating which statements are necessarily executed before others, are used to do global common expression elimination and loop identification. Implementation of these and other optimizations in OS/360 FORTRAN H are described.
GestureMan: a mobile robot that embodies a remote instructor's actions
Authors: Hideaki Kuzuoka, Shinya Oyama, Keiichi Yamazaki, Kenji Suzuki, Mamoru Mitsuishi
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

When designing systems that support remote instruction on physical tasks, one must consider four requirements: 1) participants should be able to use non-verbal expressions, 2) they must be able to take an appropriate body arrangement to see and show gestures, 3) the instructor should be able to monitor operators and objects, 4) they must be able to organize the arrangement of bodies and tools and gestural expression sequentially and interactively. GestureMan was developed to satisfy these four requirements by using a mobile robot that embodies a remote instructors actions. The mobile robot mounts a camera and a remote control laser pointer on it. Based on the experiments with the system we discuss the advantage and disadvantage of the current implementation. Also, some implications to improve the system are described.
Optimal conversion of extended-entry decision tables with general cost criteria
Authors: Art Lew
Venue: Communications of the ACM (1978)

A general dynamic programming algorithm for converting limited, extended, or mixed entry decision tables to optimal decision trees is presented which can take into account rule frequencies or probabilities, minimum time and/or space cost criteria, common action sets, compressed rules and ELSE rules, sequencing constraints on condition tests, excludable combinations of conditions, certain ambiguities, and interrupted rule masking.
Approximating block accesses in database organizations
Authors: S. B. Yao
Venue: Communications of the ACM (1977)

When data records are grouped into blocks in secondary storage, it is frequently necessary to estimate the number of blocks XD accessed for a given query. In a recent paper [1], Cardenas gave the expression XD = m(1 - (1 - 1/m)k), (1) assuming that there are n records divided into m blocks and that the k records satisfying the query are distributed uniformly among the m blocks. The derivation of the expression was left to the reader as an exercise.
Scheduling of real-time traffic in IEEE 802.11 wireless LANs
Authors: Constantine Coutras, Sanjay Gupta, Ness B. Shroff
Venue: Wireless Networks (2000)

The desire to provide universal connectivity for mobile computers and communication devices is fueling a growing interest in wireless packet networks. To satisfy the needs of wireless data networking, study group 802.11 was formed under IEEE project 802 to recommend an international standard for Wireless Local Networks &lpar;WANs&rpar;. A key part of the standard are the Medium Access Control &lpar;MAC&rpar; protocols. Given the growing popularity of real&dash;time services and multimedia based applications it is critical that the 802.11 MAC protocols be tailored to meet their requirements. The 802.11 layer protocol provides asynchronous, time&dash;bounded, and contention free access control on a variety of physical layers. In this paper we examine the ability of the point coordination function to support time bounded services. We present our proposal to support real&dash;time services within the framework of the point coordination function and discuss the specifies of the connection establishment procedure. We conduct performance evaluation and present numerical results to help understand the issues involved.
A nonrecursive list moving algorithm
Authors: Edward M. Reingold
Venue: Communications of the ACM (1973)

An efficient, nonrecursive algorithm is given for moving any LISP-type list. In particular, the algorithm requires no storage other than the new nodes into which the lists is to be moved, and no additional bits per node for marking; the algorithm runs in time proportional to the number of nodes in the list. The original list structure is destroyed as it is moved.
Automated algebraic manipulation in celestial mechanics
Authors: William H. Jefferys
Venue: Communications of the ACM (1971)

In this paper we consider some of the applications of automated algebraic manipulation which have been made in celestial mechanics. Particular attention is paid to the use of Poisson series, and a typical problem in perturbation theory is described. The requirements of processors for use in celestial mechanics are considered and compared with those for general manipulation packages. Some future directions for research using these systems are briefly outlined. To illustrate the relative simplicity of the algorithms required in celestial mechanics, a typical integration problem is considered in an appendix.
Hierarchical power supply noise evaluation for early power grid design prediction
Authors: M. Graziano, G. Masera
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

As device densities and clock frequencies continue to increase in ultra deep-submicron (UDSM) circuits, several aftereffects are becoming predominant and causing performances and reliability problems. Among the more relevant effects in high performance circuits is Power Supply Noise, considered both in the two aspects: Simultaneous Switching Noise and Voltage Drop. These phenomena have as consequences errors or delays on gates connected to noisy references, crosstalk against neighbour quiet lines, substrate noise injection, electromigration, and electromagnetic interference toward neighbour circuits: power grid verification is then becoming a basic step in deep-submicron design.It is no more feasible, as in the past, to face at the end of the design phase power supply noise analysis and solution, because it is too expensive from the time-to-market point of view. For this reason accurate but fast methodologies are explored for power supply noise analysis, and the trend is to insert them in early design stages.In this paper we introduce an algorithm, based on an ad-hoc cell library characterization and on an accurate circuit switching activity evaluation, to analyze Power Supply Noise using a hierarchical Power Grid model and to define power busses design parameters with extremely high accuracy and good performances. The focus of the paper is on the algorithm adopted to evaluate power supply noise using hierarchical power grid description and current activity informations. It has been thought in the same time as a pure analysis procedure, or as a power grid design flow, or as a starting point for a future noise driven placement algorithm.
An implementation of structured walk-throughs in teaching Cobol programming
Authors: Ronald S. Lemos
Venue: Communications of the ACM (1979)

The effectiveness of structured walk-throughs in teaching introductory Cobol programming was empirically assessed with a sample of 215 undergraduate business administration majors. Cobol proficiency was measured by a final examination testing (a) knowledge of language rules, (b) ability to read and debug a program, and (c) the ability to write a program. Analysis of multiple covariance was used to statistically adjust test scores for age and conditional reasoning scores. The findings provide empirical support for incorporating structured walk-throughs into the programming learning process to more effectively develop student proficiency in writing Cobol programs.
Compiling SpecC for simulation
Authors: Jianwen Zhu, Daniel D. Gajski
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Systems-on-chip (SOC) design calls for the use of executable system design language (SLDL). SpecC is a C-based SLDL designed to embrace the IP-centric design methodology. In this paper, we present a SpecC-language-based approach for system level simulation of SOC. Pros and cons of this approach is compared against the existing library-based approaches. Furthermore, we discuss in detail the various design considerations for the SpecC simulation API as well as our reference implementation.
On the probability distribution of the values of binary trees
Authors: H. Hurwitz,  Jr.
Venue: Communications of the ACM (1971)

An integral equation is derived for the generating function for binary tree values, the values reflecting sorting effort. The analysis does not assume uniformly distributed branching ratios, and therefore is applicable to a family of sorting algorithms discussed by Hoare, Singleton, and van Emden. The solution to the integral equation indicates that using more advanced algorithms in the family makes only minor reductions in the expected sorting efforts, but substantially reduces the variance in sorting effort. Statistical tests of the values of several thousand trees containing up to 10,000 points have given first, second, and third moments of the value distribution function in satisfactory agreement with the moments computed from the generating function. The empirical tests, as well as the analytical results, are in agreement with previously pubished results for the first moment in the cases of uniform and nonuniform distribution of branching ratio, and for the second moment in the case of uniform distribution of branching ratio.
A 3.3 V Power Feedback Chip for Linearization of RF Power Amplifiers
Authors: Bo Shi, Lars Sundström
Venue: Analog Integrated Circuits and Signal Processing (2001)

The power feedback technique is a simple and low cost linearization scheme suitable for consumer products such as hand sets. This paper presents a custom chip for linearization of RF power amplifiers using power feedback. The chip, implemented in a standard double-metal double-poly 0.6 &mu;m CMOS process, operates with 3.3 V supply voltage and consumes 62 mW. When it was used to linearize a commercially available high efficiency RF power amplifier at 850 MHz, experimental results showed that out-of-band power at 30 kHz offset was reduced some 10 dB for a &pi;/4-shifted DQPSK modulated North American digital cellular (NADC) signal. For the same level of adjacent channel interference (ACI), the efficiency was increased from 35% to 48%.
Optimization criteria for checkpoint placement
Authors: C. M. Krishna, Yann-Hang Lee, Kang G. Shin
Venue: Communications of the ACM (1984)

Mean response time and availability as optimization criteria for checkpoint placement are better replaced by workable formulas that calculate the ratio between the marginal gain accrued to users who experience system failure and the (presumably slight) loss suffered on average by all users.
The working set model for program behavior
Authors: Peter J. Denning
Venue: Communications of the ACM (1983)

Probably the most basic reason behind the absence of a general treatment of resource allocation in modern computer systems is an adequate model for program behavior. In this paper a new model, the &ldquo;working set model,&rdquo; is developed. The working set of pages associated with a process, defined to be the collection of its most recently used pages, provides knowledge vital to the dynamic management of paged memories. &ldquo;Process&rdquo; and &ldquo;working set&rdquo; are shown to be manifestations of the same ongoing computational activity; then &ldquo;processor demand&rdquo; and &ldquo;memory demand&rdquo; are defined; and resource allocation is formulated as the problem of balancing demands against available equipment.
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method
Authors: Paul Armand, J. Charles Gilbert
Venue: Computational Optimization and Applications (2000)

A technique for maintaining the positive definiteness of the matrices in the quasi-Newton version of the SQP algorithm is proposed. In our algorithm, matrices approximating the Hessian of the augmented Lagrangian are updated. The positive definiteness of these matrices in the space tangent to the constraint manifold is ensured by a so-called piecewise line-search technique, while their positive definiteness in a complementary subspace is obtained by setting the augmentation parameter. In our experiment, the combination of these two ideas leads to a new algorithm that turns out to be more robust and often improves the results obtained with other approaches.
Generality-Based Conceptual Clustering with Probabilistic Concepts
Authors: Luis Talavera, Javier Béjar
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Statistical research in clustering has almost universally focused on data sets described by continuous features and its methods are difficult to apply to tasks involving symbolic features. In addition, these methods are seldom concerned with helping the user in interpreting the results obtained. Machine learning researchers have developed conceptual clustering methods aimed at solving these problems. Following a long term tradition in AI, early conceptual clustering implementations employed logic as the mechanism of concept representation. However, logical representations have been criticized for constraining the resulting cluster structures to be described by necessary and sufficient conditions. An alternative are probabilistic concepts which associate a probability or weight with each property of the concept definition. In this paper, we propose a symbolic hierarchical clustering model that makes use of probabilistic representations and extends the traditional ideas of specificity-generality typically found in machine learning. We propose a parameterized measure that allows users to specify both the number of levels and the degree of generality of each level. By providing some feedback to the user about the balance of the generality of the concepts created at each level and given the intuitive behavior of the user parameter, the system improves user interaction in the clustering process.
A language extension for expressing constraints on data access
Authors: Anita K. Jones, Barbara H. Liskov
Venue: Communications of the ACM (1978)

Controlled sharing of information is needed and desirable for many applications and is supported in operating systems by access control mechanisms. This paper shows how to extend programming languages to provide controlled sharing. The extension permits expression of access constraints on shared data. Access constraints can apply both to simple objects, and to objects that are components of larger objects, such as bank account records in a bank's data base. The constraints are stated declaratively, and can be enforced by static checking similar to type checking. The approach can be used to extend any strongly-typed language, but is particularly suitable for extending languages that support the notion of abstract data types.
Secondary key retrieval using an IBM 7090-1301 system
Authors: D. R. Davis, A. D. Lin
Venue: Communications of the ACM (1965)

The secondary key retrieval method involves the preparation of secondary storage lists from primary data records. Search requests are satisfied by logical operations on appropriate lists, producing a complete set of addresses of primary records relevant to the request. Experimental results are presented and a comparative analysis is given.
Complexity of computations
Authors: Michael O. Rabin
Venue: Communications of the ACM (1977)

The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.
Optimized Multivariate Lag Structure Selection
Authors: Peter Winker
Venue: Computational Economics (2000)

Model selection &ndash; choosing the relevant variables and structures &ndash; is a central task in econometrics. Given a limited number of observations, estimation and inference depend on this choice. A frequently treated model-selection problem arises in multivariate autoregressive models, where the problem reduces to the choice of a dynamic structure. In most applications this choice is based either on some ad hoc procedure or on a search within a very small subset of all possible models. In this paper the selection is performed using an explicit optimization approach for a given information criterion. Since complete enumeration of all possible lag structures is infeasible even for moderate dimensions, the global optimization heuristic of threshold accepting is implemented. A simulation study compares this approach with the standard `take all up to the kth lag' approach. It is found that, if the lag structure of the true model is sparse, the threshold accepting optimization approach gives far better approximations.
A semi-automatic storage allocation system at loading time
Authors: William P. Heising, Ray A. Larner
Venue: Communications of the ACM (1961)

The method of storage allocation described herein, although new in a few respects, does not represent any sharp break from the past. Rather it is another step of development suggested by experience accumulated over several years with the 704,709 and 7090 FORTRAN systems. The storage assignment method proposed is, in principle, extremely simple and is not specific to FORTRAN or the 7090. Although the method depends only on rather general language aspects, the concrete detail will be illustrated in terms of the aforementioned systems or proposed extensions.
Probabilistic combination of content and links
Authors: Rong Jin, Susan Dumais
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

Previous research has shown that citations and hypertext links can be usefully combined with document content to improve retrieval. Links can be used in many ways, e.g., link topology can be used to identify important pages, anchor text can be used to augment the text of cited pages, and activation can be spread to linked pages. This paper introduces a probabilistic model that integrates content matching and these three uses of link information in a single unified framework. Experiments with a web collection show benefits for link information especially for general queries.
Metaphor in theory and practice: the influence of metaphors on expectations
Authors: Anne Hamilton
Venue: ACM Journal of Computer Documentation (JCD) (2000)

The use of metaphors is pervasive in all forms of discourse. This paper is concerned with providing a brief review of the development of metaphor theory,illustrated with some examples of supportive empirical research.These include a canonical study of the way concepts of instruction and education are influenced, a study into the effects of human-computer interface metaphors on computer systems users,and a study designed to assess the impacts of metaphor use on attitudes to internet commerce, particularly on attitudes to the roles played by information technology (IT). The paper provides some contextual background to assist consideration of the effects of metaphors on attitudes and beliefs.In practice, metaphor use may be intentional,unconscious,or a mixture of both, but in any case metaphors can be shown to play powerful roles in the social construction of human reality.
Characteristics of program localities
Authors: A. Wayne Madison, Alan P. Batson
Venue: Communications of the ACM (1976)

The term &ldquo;locality&rdquo; has been used to denote that subset of a program's segments which are referenced during a particular phase of its execution. A program's behavior can be characterized in terms of its residence in localities of various sizes and lifetimes, and the transitions between these localities. In this paper the concept of a locality is made more explicit through a formal definition of what constitutes a phase of localized reference behavior, and by a corresponding mechanism for the detection of localities in actual reference strings. This definition provides for the existence of a hierarchy of localities at any given time, and the reasonableness of the definition is supported by examples taken from actual programs. Empirical data from a sample of production Algol 60 programs is used to display distributions of locality sizes and lifetimes, and these results are discussed in terms of their implications for the modeling of program behavior and memory management in virtual memory systems.