ppxscal/embedding_network huggingface dataset:
Optimizing decision trees through heuristically guided search
Authors: Alberto Martelli, Ugo Montanari
Venue: Communications of the ACM (1978)

Optimal decision table conversion has been tackled in the literature using two approaches, dynamic programming and branch-and-bound. The former technique is quite effective, but its time and space requirements are independent of how &ldquo;easy&rdquo; the given table is. Furthermore, it cannot be used to produce good, quasioptimal solutions. The branch-and-bound technique uses a good heuristic to direct the search, but is cluttered up by an enormous search space, since the number of solutions increases with the number of test variables according to a double exponential. In this paper we suggest a heuristically guided top-down search algorithm which, like dynamic programming, recognizes identical subproblems but which can be used to find both optimal and quasioptimal solutions. The heuristic search method introduced in this paper combines the positive aspects of the above two techniques. Compressed tables with a large number of variables can be handled without deriving expanded tables first.
Clarification of Fortran standards&mdash;initial progress
Venue: Communications of the ACM (1969)

In 1966, after four years of effort, FORTRAN became the first programming language standardized in the United States. Since that intital achievement, study and application of the standard specifications have revealed the need for maintenance of the standards. As the result of work intiated in 1967, as initial set of clarifying interpretations has been prepared. The nature of the maintenance, corrections to the standard specifications, and completed interpretations are reported.
Design criteria for an automatic safety-alarm system for elderly
Authors: P. H. F. Peeters
Venue: Technology and Health Care (2000)

An initiative for the design of an automatic safety-alarm system is proposed. The alarm system will be designed for elderly people, who are living independently and need some assistive care. It has to detect an emergency at home, and in that case, it has to send an alarm signal to an alarm centre. The detection is done with remote sensors. The emergencies are detected by monitoring and analysing the "Activities of Daily Living" (ADL) of the elderly person at home. In this article, the product demands are worked out and a description is given how the automatic safety-alarm system can be built up, and which technologies and components could be used.
Principled scavenging
Authors: Stefan Monnier, Bratin Saha, Zhong Shao
Venue: ACM SIGPLAN Notices (2001)

Proof-carrying code and typed assembly languages aim to minimize the trusted computing base by directly certifying the actual machine code. Unfortunately, these systems cannot get rid of the dependency on a trusted garbage collector. Indeed, constructing a provably type-safe garbage collector is one of the major open problems in the area of certifying compilation. Building on an idea by Wang and Appel, we present a series of new techniques for writing type-safe stop-and-copy garbage collectors. We show how to use intensional type analysis to capture the contract between the mutator and the collector, and how the same method can be applied to support forwarding pointers and generations. Unlike Wang and Appel (which requires whole-program analysis), our new framework directly supports higher-order funtions and is compatible with separate compilation; our collectors are written in provably type-safe languages with rigorous semantics and fully formalized soundness proofs.
Using Java to implement a multimedia annotation environment for young children
Authors: Afrodite Sevasti, Bouras Christos
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The exceptional advent and dominance of interactive multimedia applications in our days has led to the need for their exploitation for educational, among many other, purposes. In this work, we present the design and implementation of a multimedia annotation environment for young children using the Java 2 Platform. This environment was developed to provide children of ages 4 to 8 with the opportunity to reflect upon and annotate episodes from their everyday life. Our aim was to exploit the recent technological developments in the field of multimedia and the processing capabilities of contemporary personal computers, in order to build an annotation environment where children would be able to add multimedia annotations to videos. Apart, from the environment itself, design choices, interface realization, platform limitations and emerging solutions as well as media handling methods and performance issues are also presented.
Superlinear Convergence of Affine-Scaling Interior-Point Newton Methods for Infinite-Dimensional Nonlinear Problems with Pointwise Bounds
Authors: Michael Ulbrich, Stefan Ulbrich
Venue: SIAM Journal on Control and Optimization (2000)

We develop and analyze a superlinearly convergent affine-scaling interior-point Newton method for infinite-dimensional problems with pointwise bounds in Lp-space. The problem formulation is motivated by optimal control problems with Lp-controls and pointwise control constraints. The finite-dimensional convergence theory by Coleman and Li [SIAM J. Optim., 6 (1996), pp. 418--445] makes essential use of the equivalence of norms and the exact identifiability of the active constraints close to an optimizer with strict complementarity. Since these features are not available in our infinite-dimensional framework, algorithmic changes are necessary to ensure fast local convergence. The main building block is a Newton-like iteration for an affine-scaling formulation of the KKT-condition. We demonstrate in an example that a stepsize rule to obtain an interior iterate may require very small stepsizes even arbitrarily close to a nondegenerate solution. Using a pointwise projection instead we prove superlinear convergence under a weak strict complementarity condition and convergence with \mbox{Q-rate $>$1} under a slightly stronger condition if a smoothing step is available. We discuss how the algorithm can be embedded in the class of globally convergent trust-region interior-point methods recently developed by M. Heinkenschloss and the authors. Numerical results for the control of a heating process confirm our theoretical findings.
Tiling optimizations for 3D scientific computations
Authors: Gabriel Rivera, Chau-Wen Tseng
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

Compiler transformations can significantly improve data locality for many scientific programs. In this paper, we show that iterative solvers for partial differential equations (PDEs) in three dimensions require new compiler optimizations not needed for 2D codes, since reuse along the third dimension cannot fit in cache for larger problem sizes. Tiling is a program transformation compilers can apply to capture this reuse, but successful application of tiling requires selection of non-conflicting tiles and/or padding array dimensions to eliminate conflicts. We present new algorithms and cost models for selecting tiling shapes and array pads. We explain why tiling is rarely needed for 2D PDE solvers, but can be helpful for 3D stencil codes. Experimental results show tiling 3D codes can reduce miss rates and achieve performance improvements of 17-121 percent for key scientific kernels, including a 27 percent average improvement for the key computational loop nest in the SPEC/NAS benchmark mgrid.
A DFT method for RTL circuits to achieve complete fault efficiency based on fixed-control testability
Authors: Satoshi Ohtake, Shintaro Nagai, Hiroki Wada, Hideo Fujiwara
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

This paper proposes a non-scan design-for-test-ability method for register-transfer level circuits where a circuit consists of a controller and a data path. It achieves complete fault efficiency with low hardware overhead and at-speed testing.
Single View Metrology
Authors: A. Criminisi, I. Reid, A. Zisserman
Venue: International Journal of Computer Vision (2000)

We describe how 3D affine measurements may be computed from a single perspective view of a scene given only minimal geometric information determined from the image. This minimal information is typically the vanishing line of a reference plane, and a vanishing point for a direction not parallel to the plane. It is shown that affine scene structure may then be determined from the image, without knowledge of the camera's internal calibration (e.g. focal length), nor of the explicit relation between camera and world (pose).In particular, we show how to (i) compute the distance between planes parallel to the reference plane (up to a common scale factor)&semi; (ii) compute area and length ratios on any plane parallel to the reference plane&semi; (iii) determine the camera's location. Simple geometric derivations are given for these results. We also develop an algebraic representation which unifies the three types of measurement and, amongst other advantages, permits a first order error propagation analysis to be performed, associating an uncertainty with each measurement.We demonstrate the technique for a variety of applications, including height measurements in forensic images and 3D graphical modelling from single images.
A new congestion-driven placement algorithm based on cell inflation
Authors: Wenting Hou, Hong Yu, Xianlong Hong, Yici Cai, Weimin Wu, Jun Gu, William H. Kao
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we describe a new congestion-driven placement based on cell inflation. In our approach, we have used the method of probability- estimation to evaluate the routing of nets. We also take use of the strategy of cell inflation to eliminate the routing congestion. Further reduction in congestion is obtained by the scheme of cell moving. We have tested our algorithm on a set of sample circuits from American industry and the results obtained have shown great improvement of routability.
A potential-based amortized analysis of the union-find data structure
Authors: Gregory C. Harfst, Edward M. Reingold
Venue: ACM SIGACT News (2000)

We present a simple, new potential-based amortized analysis for the standard union-find data structure.
Typesetting with groff Macros
Authors: Wayne Marshall
Venue: Linux Journal (2000)

Reports of troff's death are greatly exaggerated.
Associating network flows with user and application information
Authors: Ralf Ackermann, Utz Roedig, Michael Zink, Carsten Griwodz, Ralf Steinmetz
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

The concept of authenticating users e.g. by means of a login process is very well established and there is no doubt that it is absolutely necessary and helpful in a multiuser environment. Unfortunately specific information about a user originating a data stream or receiving it, is often no longer available at the traversed network nodes. This applies to the even more specific question of what application is used as well. Routers, gateways or firewalls usually have to base their classification of data on IP header inspection or have to try to extract information from the packets payload. We present an approach that works transparently and allows to associate user and application specific information with IP data streams by only slightly modifying components of the operating system environment and infrastructure components. On top of this framework we show usage scenarios for dedicatedly placing copyright information in media content and for an enhancement of the interoperation with the security infrastructure.
Spatiotemporal sensitivity and visual attention for efficient rendering of dynamic environments
Authors: Hector Yee, Sumanita Pattanaik, Donald P. Greenberg
Venue: ACM Transactions on Graphics (TOG) (2001)

We present a method to accelerate global illumination computation in prerendered animations by taking advantage of limitations of the human visual system. A spatiotemporal error tolerance map, constructed from psychophysical data based on velocity dependent contrast sensitivity, is used to accelerate rendering. The error map is augmented by a model of visual attention in order to account for the tracking behavior of the eye. Perceptual acceleration combined with good sampling protocols provide a global illumination solution feasible for use in animation. Results indicate an order of magnitude improvement in computational speed.
An MRP System for Surgical Linen Management at a Large Hospital
Authors: Liam O'neill, Michael Murphy, David Gray, Terri Stoner
Venue: Journal of Medical Systems (2001)

Materials Requirements Planning (MRP) has been used extensively in manufacturing and other industries to improve on-time delivery and to reduce costs. In this paper, we illustrate how an MRP-type system was developed to monitor surgical linen at a large teaching hospital. We also describe a bar-code scanning &lsquo;tag and recapture&rsquo; study to estimate total inventory. The hospital implemented several changes based upon our recommendations that resulted in time savings and a smoother flow of materials throughout the surgical linen supply chain.
Automatic Derivation of Code Generators from Machine Descriptions
Authors: R. G. Cattell
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

Work with compiler compilers has dealt principally with automatic generation of parsers and lexical analyzers. Until recently, little work has been done on formalizing and generating the back end of a compiler, particularly an optimizing compiler. This paper describes formalizations of machines and code generators and describes a scheme for the automatic derivation of code generators from machine descriptions. It was possible to separate all machine dependence from the code generation algorithms for a wide range of typical architectures (IBM-360, PDP-11, PDP-10, Intel 8080) while retaining good code quality. Heuristic search methods from work in artificial intelligence were found to be both fast and general enough for use in generation of code generators with the machine representation proposed. A scheme is proposed to perform as much analysis as possible at code generator generation time, resulting in a fast pattern-matching code generator. The algorithms and representations were implemented to test their practicality in use.
Towards a computational model of sketching
Authors: Kenneth D. Forbus, Ronald W. Ferguson, Jeffery M. Usher
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

Sketching is a powerful means of interpersonal communication. While many useful multimodal systems have been created, current systems are far from achieving human-like participation in sketching. A computational model of sketching would help characterize these differences and help us better understand how to overcome them. This paper is a first step towards such a model. We start with an example of a sketching system(nuSketch COA Creator)designed to aid military planners, to provide context and a source of examples. We then describe four dimensions of sketching,visual understanding, conceptual understanding, language understanding,anddrawing,that can be used to characterize the competence of existing systems and identify open problems. The issues involved will be illustrated by examples from our experience with nuSketch. Three research challenges are posed, to serve as milestones towards a computational model of sketching that can explain and replicate human abilities in this area.
The technology of computer center management: a proposed course for graduate professional programs in computer science or in information systems
Authors: S. D. Conte, M. H. Halstead
Venue: Communications of the ACM (1976)

McFarlan and Nolan have made a strong case for adding a course on information systems administration to the 13 courses proposed by the ACM Curriculum Committee on Computer Education for Management for Graduate Professional Programs in Information Systems. This paper is a report on a course entitled, &ldquo;The Technology of Computer Center Management,&rdquo; which has been offered at Purdue for the past four years. The course is suitable either for graduate professional programs in information systems or for graduate professional programs in computer science.
Authentic assessment through electronic portfolios
Authors: Gary Ury, Pat McFarland
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

Portfolios are quickly winning favor as a form of authentic assessment at all levels of education. This paper discusses efforts to develop an electronic portfolio assessment strategy as a graduation requirement for all undergraduate students at Northwest Missouri State University. The author explains early efforts of an electronic portfolio pilot project and presents data analysis in the form of student responses to an opinion survey. The conclusions include projections about full implementation of an electronic portfolio assessment strategy at the university level.
Sensetable: a wireless object tracking platform for tangible user interfaces
Authors: James Patten, Hiroshi Ishii, Jim Hines, Gian Pangaro
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

In this paper we present a system that electromagnetically tracks the positions and orientations of multiple wireless objects on a tabletop display surface. The system offers two types of improvements over existing tracking approaches such as computer vision. First, the system tracks objects quickly and accurately without susceptibility to occlusion or changes in lighting conditions. Second, the tracked objects have state that can be modified by attaching physical dials and modifiers. The system can detect these changes in real-time.We present several new interaction techniques developed in the context of this system. Finally, we present two applications of the system: chemistry and system dynamics simulation.
The sumador chino
Authors: James L. Rogers
Venue: Communications of the ACM (1960)

On a recent motor trip through Mexico, the writer came across an adding device which was referred to as a sumador chino (Chinese adder). A survey of the more available literature on the history of mathematics and on instruments of calculation has uncovered no reference to such a device. The purpose of this communication is to enlist the help of other members in bringing to light whatever may be known concerning the evolution and present status of the sumador chino. 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
Two-level control structure for nondeterministic programming
Authors: C. Montangero, G. Pacini, F. Turini
Venue: Communications of the ACM (1977)

The basic ideas of nondeterministic programming are critically reconsidered to single out a proper attitude and programming style for languages allowing direct control of nondeterministic features. The proposed attitude aims at retaining the purity of the nondeterministic formulation of search processes on one level (the attempt level), deferring the coordination of problem solving efforts to another (the choice level). The feasibility of recognizing these two levels is discussed, stressing that the structure to be managed at the choice level is a tree of contexts. The leaves are computational environments, each holding an alternative under inspection, while the other nodes are associated with choice points. According to the proposed programming style, a generative function is associated with each choice point, which expresses the desired choice strategy. The main advantage of this approach is the localization of the search strategies: Each nonterminal node of the tree keeps track of the state of the computation as it was when the choice point was last interrogated, holding at the same time the strategy to coordinate the available alternatives. Examples are given in term of ND-Lisp, an extension of Lisp designed and implemented according to these guidelines.
Performance Analysis of a Pull-Based Parallel Video Server
Authors: Jack Y. B. Lee, P. C. Wong
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

In conventional video-on-demand systems, video data are stored in a video server for delivery to multiple receivers over a communications network. The video server's hardware limits the maximum storage capacity as well as the maximum number of video sessions that can concurrently be delivered. Clearly, these limits will eventually be exceeded by the growing need for better video quality and larger user population. This paper studies a parallel video server architecture that exploits server parallelism to achieve incremental scalability. First, unlike data partition and replication, the architecture employs data striping at the server level to achieve fine-grain load balancing across multiple servers. Second, a client-pull service model is employed to eliminate the need for interserver synchronization. Third, an admission-scheduling algorithm is proposed to further control the instantaneous load at each server so that linear scalability can be achieved. This paper analyzes the performance of the architecture by deriving bounds for server service delay, client buffer requirement, prefetch delay, and scheduling delay. These performance metrics and design tradeoffs are further evaluated using numerical examples. Our results show that the proposed parallel video server architecture can be linearly scaled up to more concurrent users simply by adding more servers and redistributing the video data among the servers.
Using hardware performance monitors to isolate memory bottlenecks
Authors: Bryan R. Buck, Jeffrey K. Hollingsworth
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

In this paper, we present and evaluate two techniques that use different styles of hardware support to provide data structure specific processor cache information. In one approach, hardware performance counter overflow interrupts are used to sample cache misses. In the other, cache misses within regions of memory are counted to perform an n-way search for the areas in which the most misses are occurring. We present a simulation-based study and comparison of the two techniques. We find that both techniques can provide accurate information, and describe the relative advantages and disadvantages of each.
An analytical model of the HINT performance metric
Authors: Quinn O. Snell, John L. Gustafson
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

The HINT Benchmark was developed to provide a broad-spectrum metric for computers, and to measure performance over the full range of memory sizes and time scales. We have extended our understanding of why HINT performance curves look the way they do, and can now predict the curves using an analytical model based on simple hardware specifications as input parameters.