ppxscal/embedding_network huggingface dataset:
Selfcipher: programming
Authors: Harold N. Pelta
Venue: Communications of the ACM (1960)

Selfcipher is a programming system designed to provide a quasi-actual language for preparing programs automatically for large scale digital computers. 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
Open Source in MPEG
Authors: Leonardo Chiariglione
Venue: Linux Journal (2001)

A History of MPEG.
Generating beta variates with nonintegral shape parameters
Authors: R. C. H. Cheng
Venue: Communications of the ACM (1978)

A new rejection method is described for generating beta variates. The method is compared with previously published methods both theoretically and through computer timings. It is suggested that the method has advantages in both speed and programming simplicity over previous methods, especially for &ldquo;difficult&rdquo; combinations of parameter values.
Hierarchial clasterization, decomposition and multilevel macromodeling—the effective and efficient tools to solve the sigh and very high size combinatorial circuit type problems (abstract only)
Authors: Roman Bazylevych
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

The paper gives a generalization of author and his scientific group recent works in combinatorial non-polynomial high and very high size problems that appear in physical design automation of electronic devices including VLSI and SoC. The optimal circuit reduction method is marked as the better tool to recognize the hierarchical cluster structure of the circuit. Its possibilities to solve the wide spectrum of various problems, including forced hierarchical partitioning with given constraints, packaging, and placement are generalized. The common approach to these problems is developed on the basis of recursive using high quality algorithms of global and local optimization to the unique not high size task. The experiments confirm the high effectiveness of developed approach. For some well-known tests the optimal results were achieved at the first time and at some other cases the results were improved.
Automated Installation of Large-Scale Linux Networks
Authors: Ali Raza Butt, Jahangir Hasan
Venue: Linux Journal (2000)

Need to load Linux on 100 workstations? Learn some tricks and techniques that could save you days of tedious work.
Veronese Varieties Over Finite Fields and Their Projections
Authors: Antonio Cossidente, Domenico Labbate, Alessandro Siciliano
Venue: Designs, Codes and Cryptography (2001)

In this paper Veronese varieties of degree d over a Galois field are studied. We also show that some of known caps embedded into classical varieties always are projections of Veronese varieties.
Memory Hierarchy Considerations for Cost-Effective Cluster Computing
Authors: Xing Du, Xiaodong Zhang, Zhichun Zhu
Venue: IEEE Transactions on Computers (2000)

Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. The cost-effectiveness of a cluster computing platform for a given budget and for certain types of applications is mainly determined by its memory hierarchy and the interconnection network configurations of the cluster. Finding such a cost-effective solution from exhaustive simulations would be highly time-consuming and predictions from measurements on existing clusters would be impractical. We present an analytical model for evaluating the performance impact of memory hierarchies and networks on cluster computing. The model covers the memory hierarchy of a single SMP, a cluster of workstations/PCs, or a cluster of SMPs by changing various architectural parameters. Network variations covering both bus and switch networks are also included in the analysis. Different types of applications are characterized by parameterized workloads with different computation and communication requirements. The model has been validated by simulations and measurements. The workloads used for experiments are both scientific applications and commercial workloads. Our study shows that the depth of the memory hierarchy is the most sensitive factor affecting the execution time for many types of workloads. However, the interconnection network cost of a tightly coupled system with a short depth in memory hierarchy, such as an SMP, is significantly more expensive than a normal cluster network connecting independent computer nodes. Thus, the essential issue to be considered is the trade-off between the depth of the memory hierarchy and the system cost. Based on analyses and case studies, we present our quantitative recommendations for building cost-effective clusters for different workloads.
Some performance tests of &ldquo;quicksort&rdquo; and descendants
Authors: Rudolf Loeser
Venue: Communications of the ACM (1974)

Detailed performance evaluations are presented for six ACM algorithms: quicksort (No. 64), Shellsort (No. 201), stringsort (No. 207), &ldquo;TREESORT3&rdquo; (No. 245), quickersort (No. 271), and qsort (No. 402). Algorithms 271 and 402 are refinements of algorithm 64, and all three are discussed in some detail. The evidence given here demonstrates that qsort (No. 402) requires many more comparisons than its author claims. Of all these algorithms, quickersort requires the fewest comparisons to sort random arrays.
Texture potential MIP mapping, a new high-quality texture antialiasing algorithm
Venue: ACM Transactions on Graphics (TOG) (2000)

A refined version of the texture potential mapping algorithm is introduced in which a one-dimensional MIP map is incorporated. This has the effect of controlling the maximum number of texture samples required. The new technique is compared to existing texture antialiasing methods in terms of quality and sample count. The new method is shown to compare favorably with existing techniques for producing high quality antialiased, texture-mapped images.
On-line restricted caching
Authors: Mark Brehob, Richard Enbody, Eric Torng, Stephen Wagner
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We study the on-line caching problem in a restricted cache where each memory item can be placed in only a restricted subset of cache locations. Examples of restricted caches in practice include victim caches, assist caches, and skew caches. To the best of our knowledge, all previous on-line caching studies have considered on-line caching in identical or fully-associative caches where every memory item can be placed in any cache location. In this paper, we focus on companion caches, a simple restricted cache that includes victim caches and assist caches as special cases. Our results show that restricted caches are significantly more complex than identical caches. For example, we show that the commonly studied Least Recently Used (LRU) algorithm is not competitive unless cache reorganization is allowed while the performance of the First In First Out (FIFO) algorithm is competitive but not optimal. We then present two near optimal algorithms for this problem as well as some lower bound arguments.
Chain Grouping: A Method for Partitioning Loops onto Mesh-Connected Processor Arrays
Authors: Panayiotis Tsanakas, Nectarios Koziris, George Papakonstantinou
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

This paper presents Chain Grouping, a new low complexity method for the problem of partitioning the loop iteration space into groups with little intercommunication requirements, for mapping onto mesh-connected architectures. First, the iterations are scheduled in time, according to the hyperplane method, taking into consideration the minimum time displacement. Then, the iteration space is divided into discrete groups of related iterations, which are assigned to different processors, while preserving the optimal completion time. Chain Grouping is based on clustering together neighboring uniform chains of iterations, formed by a particular dependence vector. This vector will be proven as the best among all to reduce the total communication requirements. Inside every group, the optimal hyperplane scheduling is preserved and references to intragroup iterations are considerably increased. The partitioned groups are afterward assigned to meshes of processors. The resulting space mapping maximizes processor utilization and cuts down overall communication delays while preserving the optimal hyperplane time schedule.
A lattice model of secure information flow
Authors: Dorothy E. Denning
Venue: Communications of the ACM (1976)

This paper investigates mechanisms that guarantee secure information flow in a computer system. These mechanisms are examined within a mathematical framework suitable for formulating the requirements of secure information flow among security classes. The central component of the model is a lattice structure derived from the security classes and justified by the semantics of information flow. The lattice properties permit concise formulations of the security requirements of different existing systems and facilitate the construction of mechanisms that enforce security. The model provides a unifying view of all systems that restrict information flow, enables a classification of them according to security objectives, and suggests some new approaches. It also leads to the construction of automatic program certification mechanisms for verifying the secure flow of information through a program.
Automated negotiation from declarative contract descriptions
Authors: Daniel M. Reeves, Michael P. Wellman, Benjamin N. Grosof
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Our approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process byapplying general knowledge about auctions and domain-specific knowledge about the contract subject along with preferences from potential buyers and sellers. Second, translate the determined negotiation structure into an operational specification for an auction platform. Third, map the negotiation results to a final contract. We have implemented a prototype which supports these steps, employing a declarative specification (in Courteous Logic Programs) of (1) high-level knowledge about alternative negotiation structures, (2) general-case rules about auction parameters, (3) rules to map the auction parameters to a specific auction platform, and (4) special-case rules for subject domains. We demonstrate the flexibility of this approach by automatically generating several alternative negotiation structures for a previous domain: travel-shopping in a trading agent competition.
Unipotent Brauer Character Values of {\bi GL}{\bm (}{\bi n}{\bf ,}\ {\bb F}_{\bi q}{\bm )} and the Forgotten Basis of the Hall Algebra
Authors: Jonathan Brundan
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

We give a formula for the values of irreducible unipotent i>p-modular Brauer characters of {\it GL}(n, {\bb F}_q) at unipotent elements, where i>p is a prime not dividing i>q, in terms of (unknown&excl;) weight multiplicities of quantum i>GLn and certain generic polynomials i>S&lambda;,&mu;(i>q). These polynomials arise as entries of the transition matrix between the renormalized Hall-Littlewood symmetric functions and the forgotten symmetric functions. We also provide an alternative combinatorial algorithm working in the Hall algebra for computing i>S&lambda;,&mu;(i>q).
Building a human factors &ldquo;knowledge shelf&rdquo; as a collaborative information tool for designers
Authors: Brian H. Philips, Moin Rahman, Jari Järvinen
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Human factors professionals have long been challenged with finding an effective way of communicating critical human factors design information to product designers. The authors have created a tool called a &ldquo;Knowledge Shelf&rdquo; for providing human factors information to designers in a very easy to use manner. The Knowledge Shelf is an interactive virtual library of information on human factors methodologies and data relevant to the specific product development needs of designers. Available through the Motorola Intranet, the Knowledge Shelf is designed to make human factors design information easily accessible. Providing these types of information to designers positively impacts the product development process, by facilitating more user-centered design practices.
Hierarchical Discriminant Regression
Authors: Wey-Shiuan Hwang, Juyang Weng
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

The main motivation of this paper is to propose a new classification and regression method for challenging high-dimensional data. The proposed new technique casts classification problems (class labels as output) and regression problems (numeric values as output) into a unified regression problem. This unified view enables classification problems to use numeric information in the output space that is available for regression problems but are traditionally not readily available for classification problems¿distance metric among clustered class labels for coarse and fine classifications. A doubly clustered subspace-based hierarchical discriminating regression (HDR) method is proposed in this work. The major characteristics include: 1) Clustering is performed in both output space and input space at each internal node, termed ¿doubly clustered.¿ Clustering in the output space provides virtual labels for computing clusters in the input space. 2) Discriminants in the input space are automatically derived from the clusters in the input space. These discriminants span the discriminating subspace at each internal node of the tree. 3) A hierarchical probability distribution model is applied to the resulting discriminating subspace at each internal node. This realizes a coarse-to-fine approximation of probability distribution of the input samples, in the hierarchical discriminating subspaces. No global distribution models are assumed. 4) To relax the per class sample requirement of traditional discriminant analysis techniques, a sample-size dependent negative-log-likelihood (NLL) is introduced. This new technique is designed for automatically dealing with small-sample applications, large-sample applications, and unbalanced-sample applications. 5) The execution of HDR method is fast, due to the empirical logarithmic time complexity of the HDR algorithm. Although the method is applicable to any data, we report the experimental results for three types of data: synthetic data for examining the near-optimal performance, large raw face-image data bases, and traditional databases with manually selected features along with a comparison with some major existing methods, such as CART, C5.0, and OC1.
A dynamic model for the state assignment problem
Authors: M. Martinez, M. J. Avedillo, J. M. Quintana, J. L. Huertas
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Traditionally, state assignment algorithms follow the two-step strategy of first constraint generation and secondly constraint-guided encoding. There are well known drawbacks in both currently used models for constraint generation. Approaches following the input model generate face constraints without taking into account the sharing of logic among next state lines. Approaches following the input-output model generate face constraints for a priori determined set of dominance/disjunctive relations among the codes of the states which may not hold in final encoding. To overcome these limitations, we propose a dynamic input model which implements both above cited steps concurrently. The dynamic constraints are of the face type but they are generated during the encoding process and so take advantage of actual relations among partial codes. A general algorithm based on this model and which can target two-level as well as multiple-level implementations is described. Results obtained with the algorithm on the IWLS'93 machines are shown and they compare favorably with standard tools.
Analysis of the PFF replacement algorithm via a semi-Markov model
Authors: Wesley W. Chu, Holger Opderbeck
Venue: Communications of the ACM (1976)

An analytical model is presented to estimate the performance of the Page Fault Frequency (PFF) replacement algorithm. In this model, program behavior is represented by the LRU stack distance model and the PFF replacement algorithm is represented by a semi-Markov model. Using these models, such parameters as the inter-page-fault interval distribution, the probability of the number of distinct pages being referenced during an inter-page-fault interval, etc. are able to be analytically determined. Using these models to evaluate these parameter values permits study of the performance of the replacement algorithm by simulating the page fault events rather than every page reference event. This significantly reduces the required computation time in estimating the performance of the PFF algorithm.
Algorithms: Algorithm 335: a set of basic input-output procedures
Authors: R. de Vogelaere
Venue: Communications of the ACM (1968)

By means of the primitives insymbol, outsymbol and length, as requested by this journal's Algorithms Policy [Comm. ACM 10 (Nov. 67), 729] a basic set of input-output procedures is defined aiming at quality and flexibility. outreal, for instance, is written as a derived procedure; it outputs using the fixed point or the floating point representation, and rounds properly. Variants can easily be written because of the explicit call of the procedures decompose integer and decompose real. The highly recommended practice of echoing input is made easy with one subset of derived procedures (ioi, ior, iob, ioa). The documentation of output in the form of equivalent ALGOL statements is also provided when use is made of the subset oti, otr, otb, ota. The Berkeley style of providing information on the form of output using prior calls of procedures such as real format is defined. A use of the parameter out-channel to provide information for simultaneous output to several channels is suggested. Interrelationship between the declared procedures is furnished in tabular form.
Query operations for moving objects database systems
Authors: José Moreira, Cristina Ribeiro, Talel Abdessalem
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

Geographical Information Systems were originally intended to deal with snapshots representing a single state of some reality but there are more and more applications requiring the representation and querying of time-varying information. This work addresses the representation of moving objects on GIS. The continuous nature of movement raises problems for representation in information systems due to the limited capacity of storage systems and the inherently discrete nature of measurement instruments. The stored information has therefore to be partial and does not allow an exact inference of the real-world object's behavior. To cope with this, query operations must take uncertainty into consideration in their semantics in order to give accurate answers to the users. The paper proposes a set of operations to be included in a GIS or a spatial database to make it able to answer queries on the spatio-temporal behavior of moving objects. The operations have been selected according to the requirements of real applications and their semantics with respect to uncertainty is specified. A collection of examples from a case study is included to illustrate the expressiveness of the proposed operations.
The Khepera robot and the kRobot class: a platform for introducing robotics in the undergraduate curriculum
Authors: Robert M. Harlan, David B. Levine, Shelley McClarigan
Venue: ACM SIGCSE Bulletin (2001)

We discuss a class interface for the Khepera robot that makes the robot an excellent platform for undergraduate robotics courses and robot-based lab exercises in other courses. The interface hides low-level robot-computer communication and permits the building of derived classes that encapsulate related base behaviors relevant for higher-order tasks.
High-level specification and efficient implementation of pipelined circuits
Authors: Maria-Cristina Marinescu, Martin Rinard
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modular specification language with an efficient implementation. In our system, the designer specifies the circuit as a set of independent modules connected by conceptually unbounded queues. Our synthesis algorithm automatically transforms this modular, asynchronous specification into a tightly coupled, fully synchronous implementation in synthesizable Verilog.
DIAGRAM: a grammar for dialogues
Authors: Jane J. Robinson
Venue: Communications of the ACM (1982)

An explanatory overview is given of DIAGRAM, a large and complex grammar used in an artificial intelligence system for interpreting English dialogue. DIAGRAM is an augmented phrase-structure grammar with rule procedures that allow phrases to inherit attributes from their constituents and to acquire attributes from the larger phrases in which they themselves are constituents. These attributes are used to set context-sensitive constraints on the acceptance of an analysis. Constraints can be imposed by conditions on dominance as well as by conditions on constituency. Rule procedures can also assign scores to an analysis to rate it as probable or unlikely. Less likely analyses can be ignored by the procedures that interpret the utterance. For every expression it analyzes, DIAGRAM provides an annotated description of the structure. The annotations supply important information for other parts of the system that interpret the expression in the context of a dialogue. Major design decisions are explained and illustrated. Some contrasts with transformational grammars are pointed out and problems that motivate a plan to use metarules in the future are discussed. (Metarules derive new rules from a set of base rules to achieve the kind of generality previously captured by transformational grammars but without having to perform transformations on syntactic analyses.)
The automatic integration of ordinary differential equations
Authors: C. W. Gear
Venue: Communications of the ACM (1971)

An integration technique for the automatic solution of an initial value problem for a set of ordinary differential equations is described. A criterion for the selection of the order of approximation is proposed. The objective of the criterion is to increase the step size so as to reduce solution time. An option permits the solution of &ldquo;stiff&rdquo; differential equations. A program embodying the techniques discussed appears in Algorithm 407.
Extension of existing compilers by sophisticated use of macros
Authors: Richard K. Bennett, H. David Neumann
Venue: Communications of the ACM (1964)

A description is presented of an application in which macros and string concatenation were employed to add a new facility to BELFAP.
The ALCOR Illinois 7090/7094 post mortem dump
Authors: R. Bayer, D. Gries, M. Paul, H. R. Wiehle
Venue: Communications of the ACM (1967)

A dump technique for programs written in ALGOL 60 is described. This technique provides an intelligible analysis of an unsuccessful computation process in terms of the original source program.