ppxscal/embedding_network huggingface dataset:
Robust Scan-Based Logic Test in VDSM Technologies
Authors: Kenneth D. Wagner
Venue: Computer (1999)

The customer expects defect-free chips, even at consumer prices-making thorough manufacturing test mandatory. With increasing chip density, the addition of say 10,000 gates is no longer of great impact (these would occupy only 0.1 mm2 on adie); satisfying timing requirements and not exceeding package or system power requirements are the principal implementation objectives. The new availability of silicon real estate has transformed the design-for- testability environment. Implementing contemporary application-specific integrated circuit (ASIC) designs based on standard-cell and gate array technologies now requires design flows that incorporate DFT. Robust design for testability in very deep-submicron (VDSM) technologies is essential to volume manufacturing. The most common structural test method is scan-based logic test, which is now the backbone of manufacturing test. Using this method, commercial ATPG tools rely on test-mode reconfiguration of the circuit to a pseudo-combinational one, ensuring its access, controllability, and observability. Each state bit is trans-formed into a stage (either a flip-flop or master-slave latch pair) of a shift register or scan chain accessible from chip pins. The author points out ways to avoid pitfalls in implementing effect scan-based test. These include modifying register-transfer- level circuit representations for testability, using single clock edge design, and providing clock control.
Fast implementation of depth contours using topological sweep
Authors: Kim Miller, Suneeta Ramaswami, Peter Rousseeuw, Toni Sellarès, Diane Souvaine, Ileana Streinu, Anja Struyf
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

The concept of location depth was introduced in statistics as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. These require the computation of depth regions, which form a collection of nested polygons. The center of the deepest region is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all depth contours in &Ogr;(n2) time and space, using topological sweep of the dual arrangement of lines. Once the contours are known, the location depth of any point is computed in &Ogr;(log2 n) time. We provide fast implementations of these algorithms to allow their use in everyday statistical practice.
A note on virtual memory indexes
Authors: Kurt Maly
Venue: Communications of the ACM (1978)

In [4] Maruyama and Smith analyzed design alternatives for virtual memory indexes. The indexes investigated were those modeled on the structure of VSAM [5] which are closely related to B-trees [1]. Maruyama and Smith presented alternatives for search strategies, page format, and whether or not to compress keys. They made a comparative analysis based on the average cost of processing the index for retrieval of a key with its associated data pointer (or a sequence of keys and data pointers). The analysis showed that the optimal solution depends on machine and file characteristics and they provided formulas for selecting the best alternative. In this brief note1 we propose that another alternative for the page format be considered. The basic idea is to replace the sequential representation within a page by a linked representation. The main advantage of this method is realized in the construction (and maintenance) phase of the index. Although this phase is difficult to analyze quantitatively&mdash;as alluded to in [4]&mdash;we provide data to substantiate our claim of a net saving in construction cost without any corresponding loss in the average retrieval cost. In the ensuing discussion we assume that the reader is familiar both with B-trees and the paper of Maruyama and Smith [4].
PIP: a photo-interpretive program for the analysis of spark-chamber data
Authors: Harry Rudloe, Martin Deutsch, Thomas Marill
Venue: Communications of the ACM (1963)

Sorting techniques using an IBM 1401 with a random access storage device are evaluated.
A hand biomechanics workstation
Authors: David E. Thompson, William L. Buford,  Jr., Loyd M. Myers, David J. Giurintano, John A. Brewer,  III
Venue: Proceedings of the 15th annual conference on Computer graphics and interactive techniques (1988)

Interactive graphics for hand surgery was used to apply mathematical modeling and describe the kinematics of the hand and its resultant effect on hand function. Dynamic high resolution displays and three-dimensional images were tailored for use with a specific patients' hand and a new and powerful design and analysis tool produced. Methods were developed to portray kinematic information such as muscle excursion and effective moment arm and extended to yield dynamic information such as torque and work. This prototype workstation has been developed in concert with leading orthopedic surgeons and therapists.
Collaboration and learning within immersive virtual reality
Authors: Randolph L. Jackson, Eileen Fagan
Venue: Proceedings of the third international conference on Collaborative virtual environments (2000)

We are studying collaboration and learning within immersive virtual reality (IVR) using a head-mounted display technology. This research, supported by the College of Education and Human Interface Technology Laboratory at the University of Washington, is currently concerned with the activities of 56 ninth grade students at work in a public school environment. Subjects worked as individuals and in pairs while investigating the concepts of global warming within an audio-enhanced virtual reality model of Seattle called Global Change World (GCW). Three groupings of subjects were provided with different collaborative experiences while immersed within the GCW virtual learning environment: (1) Individuals who received minimal support during the learning exercise provided; (2) Paired peers who collaborated throughout the learning exercise; and (3) Individuals who completed the learning exercise in collaboration with an in-world expert companion. It is concluded that collaborative IVR learning experiences can be successfully integrated into existing school curricula in spite of a significant lack of knowledge regarding the nature of human communication, interaction, and learning within VLEs.
Computing curriculum 2001: getting down to specifics
Authors: Eric Roberts
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

In the fall of 1998, the ACM Education Board and the Educational Activities Board of the IEEE Computer Society appointed representatives to a joint task force to prepare Curriculum 2001, the next installment in a series of reports on the undergraduate Computer Science curriculum that began in 1968 and was then updated in 1978 and 1991. In this talk, Eric Roberts &mdash; one of the cochairs of the Curriculum 2001 effort &mdash; will review the state of the project and lead a general discussion of the recommendations made by the &ldquo;Steelman&rdquo; version of the report, which will be released at the end of August.
An object-oriented LL(1) parser generator
Authors: Bernd Kühl, Axel-Toblas Schreiner
Venue: ACM SIGPLAN Notices (2000)

This paper describes oops, an object-oriented parser generator implemented in Java [1]. Oops takes a grammar written in EBNF, checks that it is indeed LL(1), i.e., suitable for recursive descent parsing, and produces a parser as a set of serialized objects. A scanner must be provided and classes satisfying certain interfaces can be implemented which the parser uses to build parse trees.The paper discusses the ideas behind oops---which are not specific to an implementation in Java---and shows the advantages of an object-oriented approach to grammar verification and parsing.
Families of estimable terms
Authors: Massimo Caboara, Lorenzo Robbiano
Venue: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (2001)

In this paper we present a full solution to an open problem in Design of Experiments, a branch of Statistics, which can equally be seen as a problem in Algebraic Geometry. Given a complete set O of estimable terms, we are able to find all the fractions F of a full factorial design, such that O is a basis of P/I(F) as a K-vector space. This fact can be rephrased as a result in the theory of zem-dimensional schemes.
A Theoretical and Numerical Comparison of Some Semismooth Algorithms for Complementarity Problems
Authors: Tecla De Luca, Francisco Facchinei, Christian Kanzow
Venue: Computational Optimization and Applications (2000)

In this paper we introduce a general line search scheme which easily allows us to define and analyze known and new semismooth algorithms for the solution of nonlinear complementarity problems. We enucleate the basic assumptions that a search direction to be used in the general scheme has to enjoy in order to guarantee global convergence, local superlinear/quadratic convergence or finite convergence. We examine in detail several different semismooth algorithms and compare their theoretical features and their practical behavior on a set of large-scale problems.
Running a Net Radio Station with Open-Source Software
Authors: Andy Faulkner, Rich Smith, Brad Baylor, Jim Bailey, Paul Mack, Jim Lemaster, Tom Hartel
Venue: Linux Journal (2001)

Seven Linux enthusiasts broadcast a weekly internet radio show.
Invariants to Convolution in Arbitrary Dimensions
Authors: Jan Flusser, Jiří Boldyš, Barbara Zitová
Venue: Journal of Mathematical Imaging and Vision (2000)

Processing of multidimensional image data which were acquired by a linear imaging system of unknown point-spread function (PSF) is an important problem whose solution usually requires image restoration based on blind deconvolution (BD). Since BD is an ill-posed and often impossible task, we propose an alternative approach that enables to skip the restoration. We introduce a new class of image descriptors which are invariant to convolution of the original image with arbitrary centrosymmetric PSF. The invariants are based on image moments and can be defined in the spectral domain as well as in the spatial domain. The paper presents theoretical results as well as numerical examples and practical applications.
Real-world problem-solving, pedagogy, and efficient programming algorithms in computer education
Authors: Michael J. Bossé, N. R. Nandakumar
Venue: ACM SIGCSE Bulletin (2000)

Modern research and curricular reforms equate pedagogical soundness with the connection of instructional content with real-world problems. Software engineers facing real-world computer problems are continually concerned with the efficiency of the program that they write. Divorcing programming concerns from efficiency unsatisfactorily presents the responsibilities and full concerns of computer programmers. Therefore, when programming tasks are simplified to avoid concerns for efficiency, the assignments become antiseptic, lose the nature of real-world problems, and become inconsistent with the true nature of computer programming concerns. This brief investigation considers real-world problems, pedagogy within computer programming education, and the often-missed consideration of efficiency within instructional computer programming assignments. If-then-else algorithms are compared with algorithms using arrays in light of programming efficiency and pedagogy in computer education.
Derivation of Invariant Assertions During Program Development by Transformation
Authors: Manfred Broy, Bernd Krieg-Bruckner
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

Two approaches to the development of efficient and correct iterative programs are contrasted: the construction of an iterative program and a proof of its correctness using invariant assertions of loops, and the construction and proof of a recursive program with a subsequent transformation into an iterative version by schematically applying suitable recursion removal rules. The connection between the approaches is demonstrated by augmenting such transformation rules by inductive assertions. It is argued that the latter approach to program development is superior since the correctness proof of a recursive program is easier in most cases. Considerable verification overhead can be avoided this way, in particular, some difficulties with the interaction of successive loops and their associated invariants.
An adaptive protocol for locating programmable media gateways
Authors: Wei Tsang Ooi, Robbert van Renesse
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

We describe a new control protocol called Adaptive Gateway Location Protocol (AGLP). In this protocol, a client requests a computation on a multimedia stream. AGLP discovers programmable Internet servers that process multimedia streams, and assigns the computation to one of these so-called gateways. AGLP continuously searches for alternate gateways, and, transparent to users, migrates computations between them to improve efficiency. The AGLP protocol uses soft-states for robustness and scale. Simulation results support that our protocol quickly locates gateways and migrates computations while keeping the load on the network low. We also outline planned enhancements to AGLP.
The design and implementation of a heterogeneous computer networking laboratory
Authors: Guillermo A. Francia,  III, Randy K. Smith
Venue: Journal of Computing Sciences in Colleges (2001)

This paper presents the experiences gained by the authors in the design and implementation of a heterogeneous computer networking laboratory. Hopefully, this laboratory model would better prepare any computer science department's curriculum to meet the challenges presented by the rapid advancement of telecommunication technology.
Merging and Splitting Eigenspace Models
Authors: Peter Hall, David Marshall, Ralph Martin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

We present new deterministic methods that given two eigenspace models¿each representing a set of $n$-dimensional observations¿will: 1) merge the models to yield a representation of the union of the sets and 2) split one model from another to represent the difference between the sets. As this is done, we accurately keep track of the mean. Here, we give a theoretical derivation of the methods, empirical results relating to the efficiency and accuracy of the techniques, and three general applications, including the construction of Gaussian mixture models that are dynamically updateable.
Observational studies of student errors in a distance learning environment using a remote recording and replay tool
Authors: Pete Thomas, Kit Logan
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

AESOP is An Electronic Student Observatory Project consisting of a set of tools written in Smalltalk allowing student's activities and progress through an on-line distance education course to be remotely recorded, replayed and analysed. The following paper outlines some initial findings from observations made on a cross-sectional group of 368 volunteers taking the course in 2000. Students observed using low resolution 640 x 480 screens were noted to take significantly longer to complete on-line course work (p=0.018). Differences between genders were also found with females reporting less comfort at using computers and males using a greater variety of central processing units. Some evidence indicates that female students were also more likely to be using lower specification machines than males although the differences noted were found to be just outside significance levels.
The state of computer oriented curricula in business schools 1970
Authors: J. L. McKenney, F. M. Tonge
Venue: Communications of the ACM (1971)

The ACM Committee on Computer Education for Management, supported by a National Science Foundation Grant, is established to appraise the state of the art and to develop a series of recommendations for improving computer education for management. To provide the Committee with material for its study of curricular needs, five regional meetings in the United States were held in 1970, at each of which a broad cross section of invited academicians and practitioners considered the state of curricula in business schools. Three topics were covered: curricula for the general manager; computer-related material in required and functional courses; and curricula for students concentrating on computer-based information systems. An analysis of the minutes of the meetings revealed a common set of experiences which raised similar pedagogic and economic issues. This presentation gives a summary of the discussions; a condensation of the pedagogic and substantive concerns raised; and consideration of the resource allocation issues involved. Preliminary to the Committee's recommendations for improving computer education for management, this report has been prepared to provide the participants and the administrators of their institutions with background information for the ongoing task of course development. Chairman of the ten-man Committee is Daniel Teichroew (The University of Michigan).
COMIT
Authors: Victor H. Yngve
Venue: Communications of the ACM (1963)

The documentation of COMIT reflects the conviction that adequate user manuals are as much a part of a successful problem-oriented language system as is the compiler itself. Without adequate manuals, a language could not be easily learned or used, and much of the convenience that is implicit in the idea of a problem-oriented language would be lost. The COMIT manuals are thus as user-oriented as the language itself.
On designing an automated Malaysian stemmer for the Malay language (poster session)
Authors: Sock Yin Tai, Cheng Soon Ong, Noor Aida Abullah
Venue: Proceedings of the fifth international workshop on on Information retrieval with Asian languages (2000)

Online and interactive information retrieval systems are likely to play an increasing role in the Malay Language community. To facilitate and automate the process of matching morphological term variants, a stemmer focusing on common affix removal algorithms is proposed as part of the design of an information retrieval system for the Malay Language. Stemming is a morphological process of normalizing word tokens down to their essential roots. The proposed stemmer strips prefixes and suffixes off the word. The experiment conducted with web sites selected from the World Wide Web has exhibited substantial improvements in the number of words indexed.
Beyond intratransaction association analysis: mining multidimensional intertransaction association rules
Authors: Hongjun Lu, Ling Feng, Jiawei Han
Venue: ACM Transactions on Information Systems (TOIS) (2000)

In this paper, we extend the scope of mining association rules from traditional single-dimensional intratransaction associations, to multidimensional intertransaction associations. Intratransaction associations are the associations among items with the same transaction, where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, and so on. However, an intertransaction association describes the association relationships among different transactions, such as &ldquo;if(company) A's stock goes up on day 1, B's stock will go down on day 2, but go up on day 4.&rdquo; In this case, whether we treat company or day as the unit of transaction, the associated items belong to different transactions. Moreover, such an intertransaction association can be extended to associate multiple contextual properties in the same rule, so that multidimensional intertransaction associations can be defined and discovered. A two-dimensional intertransaction association rule example is &ldquo;After McDonald and Burger King open branches, KFC will open a branch two months later and one mile away,&rdquo; which involves two dimensions: time and space. Mining intertransaction associations poses more challenges on efficient processing than mining intratransaction associations. Interestingly, intratransaction association can be treated as a special case of intertransaction association from both a conceptual and algorithmic point of view. In this study, we introduce the notion of multidimensional intertransaction association rules, study their measurements&mdash;support and confidence&mdash;and develop algorithms for mining intertransaction associations by extension of Apriori. We overview our experience using the algorithms on both real-life and synthetic data sets. Further extensions of multidimensional intertransaction association rules and potential applications are also discussed.
Superconvergent interpolants for collocation methods applied to mixed-order BVODEs
Authors: Wayne H. Enright, Ramanan Sivasothinathan
Venue: ACM Transactions on Mathematical Software (TOMS) (2000)

Continuous approximations to boundary value problems in ordinary differential equations (BVODEs), constructed using collocation at Gauss points, are more accurate at the mesh points than at off-mesh points. From these approximations, it is possible to construct improved continuous approximations by extending the high accuracy that is available at the mesh points to off-mesh points. One possibility is the bootstrap approach, which improves the accuracy of the approximate solution at the off-mesh points in a sequence of steps until the accuracy at the mesh points and off-mesh points is consistent. A bootstrap approach for systems of mixed-order BVODEs is developed to improve approximate solutions produced by COLNEW, a Gauss-collocation-based software package. An implementation of this approach is discussed and numerical results presented which confirm that the improved approximations satisfy the predicted error bounds and are relatively inexpensive to construct.
A simple database language for personal computers
Authors: Tan Watanabe, Tsuneharu Ohsawa, Takaji Suzuki
Venue: Communications of the ACM (1983)

A simple database language for personal computers has been implemented by selecting a subset of the ANS MUMPS language and enhancing it so as to meet the requirements of microcomputer end-users who are unfamiliar with computers. This database language is named Micro MUMPS. Its database is based on a modified prefix B-tree having parameters for adjusting its data organization according to the requirements of space and time efficiency. Experience with Micro MUMPS has demonstrated a remarkable reduction in programming time.
Portable resource control in the J-SEAL2 mobile agent system
Authors: Walter Binder, Jarle G. Hulaas, Alex Villaz
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Resource control, i.e., accounting and limiting the allocation of resources like CPU, memory, and threads, is necessary for distributed agent systems to prevent denial-of-service attacks. Currently, the majority of mobile agent systems is based on Java, even though resource control is a missing feature on standard Java platforms. In this article we give an overview of a new portable resource control model for Java and its integration in the J-SEAL2 mobile agent system.
Need for an algorithm
Authors: W. Selden
Venue: Communications of the ACM (1958)

As EDPM are more tightly scheduled and programming systems are further developed, increasing attention is being directed to the reduction of idle time between jobs when tapes are being changed, etc. 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