ppxscal/embedding_network huggingface dataset:
International perspectives: The globalization of computing: perspectives on a changing world
Authors: S. E. Goodman
Venue: Communications of the ACM (1991)

Are the computing and telecommunications technologies making the entire world a better place in which to live?
Generating parsers for affix grammars
Authors: David Crowe
Venue: Communications of the ACM (1972)

Affix grammars are two-level grammars which are similar to van Wijngaarden's two-level grammars used in the definition of Algol 68. Affix grammars are shown by Koster to be equal in power to van Wijngaarden grammars. They are much more suited to parsing than are the latter, however. Koster, the inventor of affix grammars, suggests a top-down scheme for parsing them, based on recursive procedures. This paper presents a bottom-up scheme for parsing them, based on an extension of Floyd Production Language (FPL). Included is an algorithm, similar to that of DeRemer's, for converting a large class of affix grammars into FPL. The paper concludes by discussing briefly the applicabilities of the conversion algorithm and affix grammars in general, and some possible extensions to Koster's definition of affix grammars.
Computing property-preserving behaviour abstractions from trace reductions: abstraction-based verification of linear-time properties under fairness
Authors: Simon St. James, Ulrich Ultes-Nitsche
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

Weakly continuation-closed abstractions are known to preserve properties satisfied within fairness, i.e. linear-time temporal properties under an abstract notion of fairness. Being defined on the complete behaviour of a distributed system, weakly continuation-closed abstractions require, in principle, an exhaustive state-space construction prior to abstraction. Constructing the state-space of a practically relevant specification exhaustively, however, is usually unfeasible. Based on the notion of traces, i.e. certain equivalence classes of behaviours, we define trace reductions. Trace reductions are a particular partial-order reduction based on the persistent-set selective search technique. We show that a trace reduction can be used on behalf of the complete behaviour of a distributed system in order to compute abstractions as well as to check whether the abstractions are weakly continuation-closed. Thus, trace reductions allow us to overcome the requirement of an exhaustive state-space construction prior to abstraction.
Teaching design and project management with lego RCX robots
Authors: Ursula Wolz
Venue: Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education (2001)

In traditional CS 1 classes students may not develop an appreciation for the planning process in software development. Current IDEs provide such immediate feedback that students can complete courses without an appreciation for the need to plan in advance and design thoughtfully. The course unit described here took time out from a Java-based CS 1 course to give students practical experience in programming a small robot in a highly restricted setting. Outcomes are described in detail. They are based on instructor's notes, and on analysis of both videotaped student demonstrations and student summative essays.
Designing XML vocabularies with UML (poster session)
Authors: David A. Carlson
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

The tools and processes used to design XML vocabularies (DTD or XML Schema) are generally different from those used for application design using UML. In addition, large XML vocabularies are often difficult to understand and communicate with business users. This research summary describes the use of UML class diagrams for modeling XML vocabularies and generating XML Schemas from the UML.
Sequential Fault Modeling and Test Pattern Generation for CMOS Iterative Logic Arrays
Authors: Mihalis Psarakis, Dimitris Gizopoulos, Antonis Paschalis, Yervant Zorian
Venue: IEEE Transactions on Computers (2000)

Iterative Logic Arrays (ILAs) are widely used in the datapath parts of digital circuits, like general purpose microprocessors, embedded processors, and digital signal processors. Testing strategies based on more comprehensive fault models than the traditional combinational fault models have become an imperative need in CMOS technology. In this paper, first, we introduce a comprehensive, cell-level, sequential fault model suitable for ILAs, termed Realistic Sequential Cell Fault Model (RS-CFM). RS-CFM drastically reduces test complexity compared to exhaustive two-pattern testing proposed so far in the literature for sequential ILA testing, without sacrificing test quality. In addition, it favors robustness of sequential test sets both at the cell and the array levels. Second, a new Automatic Test Pattern Generator (ILA-ATPG) based on RS-CFM for the case of one-dimensional ILAs is presented. ILA-ATPG can handle all classes of one-dimensional ILAs: unilateral or bilateral ILAs, with or without vertical inputs/outputs. Based on a graph model, ILA-ATPG explores the C-testability and linear-testability of the ILA under test and resolves the test invalidation problem constructing robust test sequences. The efficiency of ILA-ATPG is demonstrated through a comprehensive set of experimental results over all classes of one-dimensional ILAs, including all practical one-dimensional ILAs, as well as a number of more complex benchmarks.
An inclusive design of remittance services for the blind user's operation of Automatic Teller Machines (ATMs)
Authors: Iwao Kobayashi, Akihiro Iwazaki, Katsuhiro Sasaki
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

In this paper we reported the inclusive design of Automatic Teller Machines (ATMs) for blind users, especially their use of remittance services. We examined our design guideline of the remittance operation for the users, based on the operations by voice instruction and/or the feedback using a handset. Then we implemented the prototype system under the guideline and evaluated it by an experiment. Subjects were four blind men. The results showed that the system worked out effectively. However, the reduction in time for all operation required was indicated as a main problem.
Fantastic, unique, UML tool for the Java environment (FUUT-je) (poster session)
Authors: Ghica van Emde Boas
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

In this extended abstract, we describe an experimental, UML model driven, Java prototyping and development tool.
Retrieval times for a packed direct access inverted file
Authors: A. J. Bayes
Venue: Communications of the ACM (1969)

This note extends the results obtained by Thomas C. Lowe [1] for the case where the list file is stored in packed form. The notation and terminology used were established by Lowe. In addition, we define F(j) = &sum;j-1i=1 &fnof;(i) and write [x] for the greatest integer not exceeding x.
Studies in machine cognition using the game of poker
Authors: Nicholas V. Findler
Venue: Communications of the ACM (1977)

A progress report is presented of on-going research efforts concerning human decision making under uncertainty and risk and human problem solving and learning processes on the one hand, and machine learning, large scale programming systems, and novel programming techniques on the other. There has also been interest in how humans make deductive and inductive inferences and form and optimize heuristic rules, and how machines can reach similar results. Although the vehicle of these investigations has been the game of poker, a conceptual framework has been provided that should have a fairly wide range of applicability. The models of human judgement, choice, and decision making are incorporated in a large scale complex program. They represent both descriptive and normative theories of behavior. An interactive game environment has been recently established which, besides its usefulness for experiments in game playing, enables humans to construct machine strategies &ldquo;on-line&rdquo; in a question answering, advice taking mode.
Mixing oil and water: transcending method boundaries in assistive technology for traumatic brain injury
Authors: Eamon Doherty, Gilbert Cockton, Chris Bloor, Dennis Benigno
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

A prototype assistive technology for traumatic brain injury has been developed using a combination of formative experiments and contextual design. Both approaches have proved to be essential to the development of a simple communication program using a brain-body interface device. We describe the combination of these methods and their separate and joint contributions to the evolution and evaluation of an assistive technology. Our experience suggests that failure to use either research method in assistive technology development would result in critical oversights in design and evaluation.
A preplanned approach to a storage allocating compiler
Authors: Robert W. O'Neill
Venue: Communications of the ACM (1961)

The preplanned approach to the storage allocation problem involves using a fixed method of analysis of a problem to produce an efficient computer program incorporating all necessary transfers of information within the multilevels of storage of the computer throughout the running of the object program. The initial description of the problem may be in any suitable source language (FORTRAN, ALGOL, etc.) but should not require any recognition of the limitations caused by the number, size, and speeds of the computer's storage devices (core, tape, disc, number of data channels, etc.) by the programmer. The object program produced should contain all necessary implementing instructions to utilize all of the computer's storage devices in such a manner as to minimize the cost of the program (i.e. maximize the speed of problem solving).
Embedded DRAM architectural trade-offs
Authors: N. Wehn, S. Hein
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

In this paper we discuss system-related aspects in embedded DRAM/logic designs. We focus on large embedded memories which have to be implemented as DRAMs.
Data locality enhancement by memory reduction
Authors: Yonghong Song, Rong Xu, Cheng Wang, Zhiyuan Li
Venue: Proceedings of the 15th international conference on Supercomputing (2001)

In this paper, we propose memory reduction as a new approach to data locality enhancement. Under this approach, we use the compiler to reduce the size of the data repeatedly referenced in a collection of nested loops. Between their reuses, the data will more likely remain in higher-speed memory devices, such as the cache. Specifically, we present an optimal algorithm to combine loop shifting, loop fusion and array contraction to reduce the temporary array storage required to execute a collection of loops. When applied to 20 benchmark programs, our technique reduces the memory requirement, counting both the data and the code, by 51% on average. The transformed programs gain a speedup of 1.40 on average, due to the reduced footprint and, consequently, the improved data locality.
Transparent-mode control procedures for data communication, using the American standard code for information interchange&mdash;a tutorial
Authors: S. Gorn
Venue: Communications of the ACM (1965)

This paper gives the considerations of Task Group X3.3.4 in the area of transparent-mode data communication control philosophy. The appearance of this paper was forecast (under the name of &ldquo;second-level control&rdquo;) in the earlier tutorial paper, &ldquo;Control Procedures for Data Communications,&rdquo; Task Group document X3.3.4.44, dated May 1964. The present paper elaborates upon solutions to the problems of transparency to the basic ASCII communication control characters, as outlined in the previous paper mentioned above. Moreover, it goes on to cover the additional control problems of handling material such as offline encrypted data or non-ASCII codes by means of systems providing complete character transparency. It does not cover concepts of transparency in which the normal character structure or modulation rate of a system may be abandoned. In conjunction with the earlier tutorial paper, this paper is expected to lead to a proposal for standardization of data communication control procedures using the American Standard Code for Information Interchange.
Presenting computer algorithm knowledge units in computer science curriculum
Authors: S. Krishnaprasad
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

A challenging aspect of computer science curriculum is to present the ever growing and ever changing topics of computer science within the time constraints imposed by the program of study. In this paper we present some of these challenges and outline strategies to meet them with regard to the computer science subject area of Algorithms and Complexity in the context of evolving needs of CS1 and CS2 courses. Specifically, we consider those knowledge units recommended for this area by the IEEE/ACM Joint Task Force on computing curricula in their CC2001 report [CC00].
Open base situation transport (OBAST)architecture
Authors: Phillip D. Neumiller, Peter L. Lei, Michael L. Needham
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

This paper outlines the requirements for a set of open IP based protocols enabling seamless mobility across diverse radio access networks. We begin by stating some architectural tenets upon which the requirements for the OBAST protocol set are based. Furthermore, what the authors currently believe to be the eventual desirable wireless Internet architecture is described. This architecture is shown to enable a common protocol set that we refer to as the open base station transport (OBAST) protocol set.
Computer tutorials for introductory statistics
Authors: Frank G. Landram
Venue: Proceedings of the twelfth annual CCSC South Central conference on The journal of computing in small colleges (2001)

The objective of this study is to show that computer tutorial supplements enchance and shorten the learning process in teaching statistics. An introductory statistics course may be separated into three phases: (a) basic fundamentals, (b) statistical concepts, and (c) applications. Computer tutorials allow more time to be spent on the applications phase of the course. Students, retain more when shown applications. They also tend to favor application courses. Hence, statistics courses become more efficient and popular with tutorial supplements. The results of this study may also have positive implications for online teaching.
An experimental study of the human/computer interface
Authors: Izak Benbasat, Albert S. Dexter, Paul S. Masulis
Venue: Communications of the ACM (1981)

An exploratory study was conducted to analyze whether interface and user characteristics affect decision effectiveness and subject behavior in an interactive human/computer problem-solving environment. The dependent variables were performance and the use of the systems options. Two of the independent variables examined, experience and cognitive style, were user characteristics; the other three, dialogue, command, and default types, were interface characteristics. Results indicate that both user and interface characteristics influence the use of the system options and the request for information in the problem-solving task.
A model of memory contention in a paging machine
Authors: P. H. Oden, G. S. Shedler
Venue: Communications of the ACM (1972)

This paper is concerned with certain aspects of contention for main memory resources in a multiprogrammed computer system operating under demand paging. In the model presented, the number of page-frames of main memory allocated to a problem program varies in time. These changes in memory configuration are represented explicitly in the model, CPU requirements and page exception characteristics of program material being described statistically. Expressions for the distribution of the number of page-frames allocated to an executing program, the long run expected fraction of a program's execution time in a given number of page-frames, and the average execution interval of the multi-programmed load are obtained. It is pointed out heuristically and demonstrated numerically that an increase is obtainable in the average execution interval of the multiprogrammed load over that resulting from equal fixed partitioning of main memory.
A vision for management of complex models
Authors: Phillip A. Bernstein, Alon Y. Halevy, Rachel A. Pottinger
Venue: ACM SIGMOD Record (2000)

Many problems encountered when building applications of database systems involve the manipulation of models. By "model," we mean a complex structure that represents a design artifact, such as a relational schema, object-oriented interface, UML model, XML DTD, web-site schema, semantic network, complex document, or software configuration. Many uses of models involve managing changes in models and transformations of data from one model into another. These uses require an explicit representation of "mappings" between models. We propose to make database systems easier to use for these applications by making "model" and "model mapping" first-class objects with special operations that simplify their use. We call this capability model management.In addition to making the case for model management, our main contribution is a sketch of a proposed data model. The data model consists of formal, object-oriented structures for representing models and model mappings, and of high-level algebraic operations on those structures, such as matching, differencing, merging, selection, inversion and instantiation. We focus on structure and semantics, not implementation.
Median split trees: a fast lookup technique for frequently occuring keys
Authors: B. A. Sheil
Venue: Communications of the ACM (1978)

Split trees are a new technique for searching sets of keys with highly skewed frequency distributions. A split tree is a binary search tree each node of which contains two key values&mdash;a node value which is a maximally frequent key in that subtree, and a split value which partitions the remaining keys (with respect to their lexical ordering) between the left and right subtrees. A median split tree (MST) uses the lexical median of a node's descendents as its split value to force the search tree to be perfectly balanced, achieving both a space efficient representation of the tree and high search speed. Unlike frequency ordered binary search trees, the cost of a successful search of an MST is log n bounded and very stable around minimal values. Further, an MST can be built for a given key ordering and set of frequencies in time n log n, as opposed to n2 for an optimum binary search tree. A discussion of the application of MST's to dictionary lookup for English is presented, and the performance obtained is contrasted with that of other techniques.
Using actors in an interactive animation in a graduate course on distributed system
Authors: Boris Koldehofe, Philippas Tsigas
Venue: ACM SIGCSE Bulletin (2001)

We describe and evaluate an experiment where actors were used to simulate the behaviour of processes in a distributed system in order to explain the concept of self-stabilisation in a graduate course on distributed systems.A self-stabilising system is one that ensures that the system's behaviour eventually stabilises to a safe subset of states regardless of the initial state. Protocols satisfying this elegant property, which enables a system to recover from transient failures that can alter the state of the system, are often hard to understand, especially for students that have not studied distributed computing and systems before.The experiment was part of an introductory course on distributed computing and systems for graduates in October 2000. The purpose of this interactive animation was to introduce to the students the basic concepts behind self-stabilisation (eligible states, transient faults, execution convergence) before their formal introduction.All of the students had a degree either in mathematics or computing science and had taken a course on algorithms before. However, most of the students did not have a background in distributed systems or distributed algorithms. The latter was not only the motivation for preparing this method of presentation but also what made this a challenging effort.The feedback from the class was that the concept and this teaching method were very well received. We could observe that their understanding evolved to the point that they were able to successfully come up with ideas for solutions and argue for/prove their correctness. As suggested in [1], dramatisation of executions can help the students to understand new issues and complications. This work shows that this is true even for graduate level courses. In our experiment we could conclude that dramatisation can be almost as powerful as a programming exercise in the teaching process; sometimes even more efficient, especially when we need to teach new concepts to an audience with diverse educational backgrounds. In analysing the results of our method we make a combination of the qualitative and quantitative approaches [4].
OpenMath support under CSL-hosted REDUCE
Authors: Arrigo Triulzi
Venue: ACM SIGSAM Bulletin (2000)

OpenMath is a standard for representing mathematical objects. This paper describes an attempt to include OpenMath support into the computer algebra system REDUCE. This support is limited to the version based upon Cambridge Standard Lisp and is based upon the OpenMath C Library developed under Esprit project 24.969. The rationale for this effort was to avoid having to rewrite substantial amounts of code due to changes in the OpenMath standard but instead relying on the underlying C Library to provide the necessary modifications.
Specifying agent behavior as concurrent tasks
Authors: Scott A. DeLoach
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Software agents are currently the subject of much research in many interrelated fields. Unfortunately, there has not been enough emphasis on defining the techniques required to build practical agent systems. While many agent researchers refer to tasks, few really define what they mean. Tasks only define the internal processing an agent must perform, but also how interactions with other agents relate to internal processes.
ATM test-bed architecture for training purposes
Authors: Rana Ejaz Ahmed
Venue: International Journal of Network Management (2001)

Due to the recent tremendous growth in ATM products, there is a strong need for training and education for engineers working in the field of ATM networks. This paper describes the architecture of an ATM test-bed that can be used to provide such traiing. Copyright &copy; 2001 John Wiley Sons, Ltd.