ppxscal/embedding_network huggingface dataset:
Computer education technology (CET)
Venue: Proceedings of the ACM 1980 annual conference (1980)

Computer Education and Computer Based Education are becoming more and more complex. The theory part is well taken care of by ACM curriculum. However, the practical laboratory aspect of the ACM curriculum is left wide open for individuals to decide. This leads to the widespread variations and limitations in the practicum indicating that computer science is not treated as a science, rather as an art. This problem is related to another basic problem regarding what aspect of the computer science should be treated as a science. To teach or get trained in computer science, we need to provide 'paradigms' (and not mere syntax and semantics of programming languages). The construction of paradigms is fluid at the present. There is a need to investigate the theory of 'paradigms', their construction and use in computer science. The purpose of the panel is to identify some key aspects of 'paradigms', their nature and their application and the type of ongoing research in this direction.
Requirements expression and verification aid
Authors: Sharon A. Stephens, Leonard L. Tripp
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

SAMM is a top-down dominated activity modeling technique which has a representation scheme which has been automated. The automation, called SAMDF, validates the input, verifies the model, and produces a document illustrating the functional relationships of the system being modeled. SAMMDF significantly enhances the perception of system requirements, and it is this perception that benefits the design produced from the requirements.
Reconfigurable Pipeline Systems
Authors: Mary Jane Irwin
Venue: Proceedings of the 1978 annual conference (1978)

Systems with pipeline processing capabilities, processors whose computational subsystems are divided into several distinct stages, each of which may be working with an independent set of data at the same instant of time, are one attractive solution to the demand for faster and more cost effective computers. In addition, several of the existing pipelined machines have facilities for a limited amount of restructuring of available resources to provide a system which is more suitable for the efficient execution of a particular problem. The amount of restructuring, or reconfiguration, varies from system to system. The type of reconfiguration, either a reconfiguration of an actual functional unit or a reconfiguration of the information flow between several functional units, varies as well. The reconfigurable aspects of the architecture of several pipelined machines are presented. Performance gains when restructuring is allowed are also examined. Finally, there is a discussion of some possible future reconfigurable pipeline systems.
Research towards a technology to support the specification of data processing system performance requirements
Authors: Edward E. Balkovich, George P. Engelberg
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper summarizes the results of an initial investigation of a language and underlying technology for the design of Data Processing System Performance Requirements. The initial research results indicate that a technology based on Petri nets, formal logic, and simulation can be used to describe and analyze some important aspects of data processing performance requirements. These initial language and technology concepts were successfully applied to fully describe a benchmark problem. Future research will focus on the implementation and evaluation of automated verification and analysis procedures based on the technology.
A parser as a user-interface, driven by an enclosed array.
Authors: Michael Zippel
Venue: Proceedings of the international conference on APL (1982)

Complex interactive systems require a user-interface, which formalizes the interaction between user and program, handles error-checking of user-input, supports the inexperienced user with menu-lists and explanations, and also allows for easy change or extension of the interactive part of the system. It may also be advantageous that this user-interface be capable of switching from one natural language to another. This paper describes one such user-interface which is based on techniques used in compiler-construction. It is driven by a general array which is generated from a BNF-like description of the language to be handled.
Performance evaluation of three microcomputer based systems in a small business dataprocessing environment.
Authors: T. G. Lewis
Venue: ACM SIGMINI Newsletter (1978)

In March, 1977 a team of students under the guidance of the author began studying three personal computer systems to determine their strengths and weaknesses when placed in a data processing environment. The three systems were chosen to represent a broad spectrum of contemporary microcomputer based data processing equipment. System W is a firmware BASIC computer originally designed for scientific applications but found being used in a variety of business processing applications. System T is a storage display graphics computer based on the Motorola 6800 microprocessor ROM BASIC, and ROM operating system. System D is an Intel 8080 based computer designed specifically for business dataprocessing.
ASCII extension and expansion and their impact on data communications
Authors: Thomas F. Fitzsimons
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

During the past several years, a subcommittee within the American National Standard Institute Committee on Computers and Information Processing has been working on a standard that will impact computer communications. The proposed Standard is on: An Eight-Bit Code for General Information Interchange and Code Extension Procedures for 7 and 8-Bit Codes. This paper presents the historical background to this effort, the current proposals before the subcommittee and the potential impact on data communications of the proposed standardization. Also discussed is one view point of how this proposed standard and other standards (proposed and extant) interrelate with one another in a computer based communications system.
Computer-controlled hardware testing: A programmer's view of the test center
Authors: Jean W. Sherman
Venue: Proceedings of the 8th Design Automation Workshop (1971)

Computer-controlled hardware testing can be accomplished safely, dependably, and economically with the four-phase plan presented in this paper. The four phases are product design, product testers, tester programming, and data output. Usefulness of the plan increases if the designer, programmer, and management understand each others problems and do an adequate job of communicating.
IDA: Interconnect delay analysis for integrated circuits
Authors: A. J. de Geus, J. B. Reed, M. Rekhson
Venue: Proceedings of the 21st Design Automation Conference (1984)

A delay analysis program has been developed to compute the signal propagation delays attributed to RC interconnection nets in integrated circuits. To take into account the bidirectional nature of MOS transmission gates, the program simulates nets connected through transmission gates as single entities refered to as &ldquo;supernets&rdquo;. In order to obtain a single set of realistic lumped delays for nets with transmission gates, a delay path analysis and reduction algorithm is used.
Induction variables in very high level languages
Authors: Amelia C. Fong, Jeffrey D. Ullman
Venue: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages (1976)

We explore the notion of an induction variable in the context of a set-theoretic programming langugage. An appropriate definition, we believe, involves both the necessity that changes in the variable around a loop be easily computable and that they be small. We attempt to justify these requirements and show why they are independent assumptions. Next the question of what operators on sets play the role of +, &minus; and * for arithmetic languages is explored, and several theorems allowing us recursively to detect induction variables in a loop are given. It is shown that most of the usual set operations do fit nicely into the theory and help form induction variables. The reason most variables fail to be induction variables concerns the structure of control flow, more than it does the operators applied.
Block description language (BDL): A structural description language
Authors: Eric Slutz, Glen Okita, Jeanne Wiseman
Venue: Proceedings of the 21st Design Automation Conference (1984)

The Block Description Language (BDL), a language for capturing the structure of an electronic system, is described. The structure of a system may be specified hierarchically in this language. Additional information may be associated with the structural description with general properties. A facility for declaring and using arrays and records of the structure elements is provided.
A powerful strategy for deriving efficient programs by transformation
Authors: Alberto Pettorossi
Venue: Proceedings of the 1984 ACM Symposium on LISP and functional programming (1984)

We present a method for deriving efficient iterative programs by transformation from recursive equation specifications. It consists of two phases: i) the transformation of general recursive programs into linear recursive ones, and ii) the transformation of linear recursive programs into iterative ones. In the first phase we apply the &ldquo;tupling strategy&rdquo; studied in [BUD77, Pet77], and implicitly used by other authors in the area of program transformation. That strategy enables us to introduce linear recursive functions, instead of the general recursive ones occurring in program specifications. In the second phase we apply known methods for transforming linear recursion into iteration (avoiding the use of stacks) [WaS73], and equivalence results between recursive schemas and flowchart schemas. Through various examples we show how the breaking of the transformation process into the above mentioned phases allows the derivation of efficient iterative algorithms. Those examples include challenges by Prof. E. Dijkstra and other authors. Through our method we were also able to improve some recent results for eliminating redundant calls in recursive programs [Coh83].
Representing negative integers in bit vectors
Authors: L. J. Woodrum
Venue: Proceedings of the fourth international conference on APL (1972)

To represent a positive or negative integer as a bit vector &ldquo;two's complement&rdquo; arithmetic may be used. By using a radix vector, R&larr;2 -2.(D-2)@@@@2, if N is a positive or a negative integer, and (N&ge;-2*D)N<2*D is true, then X&larr; R@@@@T@@@@N makes X a bit vector in two's-complement form. Similarly, R@@@@X is the scalar N.
ETOS - multi-lingual Time Sharing System for the PDP8
Authors: Thomas Schreier
Venue: Proceedings of the ACM SIGMINI/SIGPLAN interface meeting on Programming systems in the small processor environment (1976)

EDUCOMP's Time-shared Operating System (ETOS) is an integrated package of hardware and software designed for maximum utility of a PDP8 computer. ETOS supports up to 16 users, with each user able to use the system as if he were operating on a stand-alone PDP8 with 64K bytes of memory. This paper will contrast the various modes of computer operation and illustrate how the combination of batch, real-time, and interactive usage results in the optimum fulfillment of the all-important criterion of price/performance. Emphasis is placed on the maintenance of continuous system performance. This is especially important to the educational user. In many situations, if the machine must be shut down for one type of user, the educational user is the first one to be sacrificed. Computer assisted instruction, drills, simulations, and general student motivation are somehow viewed as less important than the use of the computer to collect taxes. ETOS is EDUCOMP's solution to this misguided allocation of resources. ETOS requires a 16K omnibus PDP8, clock, an RK8e controller with an RK05 drive, a backup peripheral for the RK05 drive, and a Time Share Control Module.
Defining the ergonomic buzzwords
Authors: Jon A. Meads
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Current software and computer systems are being advertised and sold today as FRIENDLY systems that are EASY TO USE. Most also claim to be EASY TO LEARN as well. But what is it that makes a system FRIENDLY, EASY TO USE, or EASY TO LEARN? Is it sufficient to enshrine a group of interactive features in a video box connected to a single user microcomputer? If a system is EASY TO USE does that make it FRIENDLY? Or does EASY TO LEARN mean that it is EASY TO USE? Does your friendly, easy-going personal computer salesman differentiate between these terms! Although the physical aspects of human factors have been studied for several decades and have an established scientific base, there is very little published material on the software aspects of ergonomics that is based upon well controlled experimental investigation. However, there is a fair amount of literature in which individuals describe their experiences in various ad hoc situations. The similarities among these experiences has resulted in a fair amount of &ldquo;folklore&rdquo; which may be beneficially applied. The terms: EASY TO LEARN, EASY TO USE, and FRIENDLY are defined below according to this experiential base.
Image coding with wavelet representations, edge information and visual masking
Authors: B. Zhu, A. H. Tewfik, M. A. Colestock, O. N. Gerek, A. E. Cetin
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The wavelet transform provides a multiresolution representation of images. Edges, which are visually important, produce large coefficients across several scales in the wavelet transform domain. By tracking and predicting these edge coefficients across scales in the wavelet transform domain, we can greatly improve the compressed image quality with little degradation in compression ratio. This paper proposes a novel model-based edge tracking and prediction in the wavelet domain. It separates textures from edges and codes them differently. Edges are coded via an edge tracking and prediction, while textures are coded with either ordinary wavelet based image coding techniques or a "wavelet-like" filter bank which is similar to the tuning channels in the human vision system. The coding noise is then coded with a noise modelling. Visual masking models are also used to ensure the compressed image has little or almost no perceptual distortion.
Performance evaluation and prediction of storage hierarchies
Authors: Axel Lehmann
Venue: ACM SIGMETRICS Performance Evaluation Review (1980)

This paper proposes a modelling methodology combining simulation and analysis for computer performance evaluation and prediction. The methodology is based on a special workload model that is suitable for the generation and description of dynamic program behaviour. A description of this workload model is given in section 2. The applicability of this concept with respect to the design of new storage systems, as well as the improvement or comparison of existing systems, will be described by investigation of the efficiency of small cache memories in section 3.
Software ownership and charging
Authors: James A. Buss
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

This paper discusses about the software ownership and its charging
Designing software for ease of extension and contraction
Authors: David L. Parnas
Venue: Proceedings of the 3rd international conference on Software engineering (1978)

Designing software to be extensible and easily contracted is discussed as a special case of design for change. A number of ways that extension and contraction problems manifest themselves in current software are explained. Four steps in the design of software that is more flexible are then discussed. The most critical step is the design of a software structure called the &ldquo;uses&rdquo; relation. Some criteria for design decisions are given and illustrated using a small example. It is shown that the identification of minimal subsets and minimal extensions can lead to software that can be tailored to the needs of a broad variety of users.
Computers and the myth of neutrality
Authors: Abbe Mowshowitz
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

This paper is a critique of the widely held belief that computers are valueneutral instruments whose uses are determined primarily by individual choice. The critique is based on an analysis of the social relations of technology which reveals the operation of three kinds of constraints on human choice: 1) intrinsic features of techology; 2) accidental features such as organizational structure; and 3) techno-cultural paradigms. These constraints will be explained and illustrated with examples from the world of computing. My aim is to show that some uses of computers are more likely than others to be adopted under particular, concrete historical circumstances. For example, the mere fact that computers can be used to improve the quality of work-life or to increase citizen participation in government does not mean that they will be so used. The assumption of value-neutrality is at variance with this observation; it distorts analysis of the social impact of computers and serves partisan interests. To achieve fairness and equity in the design of public policies, we must disabuse ourselves of the mistaken notion of value-neutrality.
Evaluation of collision control algorithms in Ethernets
Authors: J. A. B. Moura, J. A. Field, J. W. Wong
Venue: Proceedings of the sixth symposium on Data communications (1979)

The choice of collision control algorithm has an effect on the performance of Ethernet. A linear incremental backoff algorithm is proposed and its performance is compared to the binary exponential backoff algorithm. Two variations of Ethernets are used in the comparison: one treats data and acknowledgement packets equally; the other gives priority to acknowledgement packets. The maximum throughputs achieveable by both variations are derived. The performance of both variations is then evaluated by discrete simulation. The evaluation is based on a Ethernet model with uniform or biased traffic.
On Reflexive and Dynamically Adaptable Environments for Distributed Computing
Authors: F. Ogel, B. Folliot, I. Piumarta
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Current Technologies for distributed application development, while being well-adapted for the Client-server model, do not adequately address emerging application domains, such as multimedia, embedded or mobile applications. The black box approach, used to achieve distribution and OS transparency, prevents application developers from adapting execution environments to the semantics and constraints of their application domain, thus leading to a growing number of ad-hoc solutions which are closed, static and poorly interoperable. As a solution, we present a reflexive and dynamically adaptable execution environments, based on reification of hardware resources and a standalone dynamic code generator. This architecture allows dynamic construction of specialized OS or middleware components.
Digital logic simulation models and evolving technology
Authors: Cliff W. Hemming,  Jr., John M. Hemphill
Venue: Proceedings of the 12th Design Automation Conference (1975)

Digital logic simulators have traditionally served three functions for the designer; those are logic verification, design verification (detailed timing analysis), and fault analysis. Logic verification is well understood and accurate models have existed for this purpose for some time. Design verification has improved steadily over recent years and very accurate models exist for gate-level analysis. Fault analysis has progressed much more slowly, and most models currently used are quite limited. This paper details the evolution of models used in performing the three functions, and discusses current strategy; especially with respect to timing analysis and fault insertion. Current fault and timing models are discussed in light of current technology, with emphasis on the applicability of faults to such devices as emitter coupled logic and MOS-LSI. Adequate model detail for an integrated circuit based on knowledge of package terminal behavior is discussed, and certain problems encountered in adequate modeling of complex functions (such as multi-phase memories) are presented.
Nonprocedural data system languages
Authors: Lionello Lombardi
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

During the past decade research on data system languages has consisted almost exclusively of the definition and implementation of general purpose procedural languages as articulate as possible. Lately such hyper complicated languages have been gradually losing the interest of both users and manufacturers; their interest has been attracted towards the development of notations for representing processes statically as functional relations between input and output information: that is, nonprocedural data system languages. Procedural languages were originally conceived in order to state information processes of numerical nature. The most delicate aspect of this kind of processes is the algorithm or computation procedure adopted. Consequently, languages were needed which described the processes directly in terms of the procedures involved. Lately, however, computers have been frequently used in connection with nonnumerical data manipulations, whose most delicate aspect in general is no longer the procedure (which in many cases is rather simple) but the exact definition of the problem. Only methods of representing processes by means of itemized lists whose entries completely describe single elements of the output in terms of the whole input and perhaps intermediate data&mdash;that is, nonprocedural languages&mdash;allow for an effective and compact representation of such processes.
A performance evaluation technique for the measurement of a facility's ability to process the proper jobs
Authors: J. J. Babiel, B. Z. Duhl
Venue: Proceedings of the 6th conference on Winter simulation (1973)

Most manufacturing floor control installations perform substantial analysis in choosing appropriate job sequencing algorithms with the aid of simulations, but tend to neglect further analysis required to continuously measure the degree of compliance to job sequencing rules. With the advent of on-line, real-time capabilities, priorities of jobs can change throughout the working day and frustrate the efforts of a facility in striving to &ldquo;do the right jobs&rdquo; Further, different levels of work-in process were found to be major factors affecting the ability to comply with sequenced worklists. This paper describes the various measurement schemes considered, highlighting the advantages and pitfalls of each. It also illustrates an effective reporting technique which lets management evaluate how manufacturing and/or production control areas are influencing customer serviceability.