ppxscal/embedding_network huggingface dataset:
Teaching structured programming attitudes, even in APL, by example
Authors: T. W. S. Plum, G. M. Weinberg
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

As a programming assignment in a graduate programming course, students were to program an interactive word game, JOTTO. The language used was APL, under constraints of well-structured programming and complete control of the user-machine interaction. In response to complaints that teamwork was an impediment to programming and that it was not possible to write efficient well-structured programs in APL, the instructors undertook to complete the assignment working as a team. The results of the effort were carefully documented, including experiences with program modification, and are presented here, as they were to the class, to illustrate the principles that should be communicated to professional programmers.
A model for the local area of a data communication network software organization
Authors: P. T. Wilkinson
Venue: Proceedings of the first ACM symposium on Problems in the optimization of data communications systems (1969)

A general purpose store-and-forward data communication network is under development at NPL. The background to this work is described in companion papers(1)(2) which also detail the hardware environment in which the software of the central message switching computer (MSC) operates. A user of this system sees it as a star-connected network by means of which his terminal may exchange data with any other terminal via the MSC. Because this centre is stored-program controlled, it is possible to offer the user other communications-oriented facilities in addition to the basic data transmission function. The MSC may be described as a multi-access computer controlled by a timesharing operating system. Section 2 gives a description of the way in which terminals use the network, illustrating the main principles of operation of the system as a whole and outlining the features provided by software. Section 3 is a description of the operating system of the MSC.
Adaptive quantization with spatial constraints in subband video compression using wavelets
Authors: Jiebo Luo, Chang Wen Chen, K. J. Parker, T. S. Huang
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Coding of the high frequency subbands has been recognized as the key to the success of subband coding. However, the existing schemes are not very efficient in exploiting the spatial and spectral localization properties resulting from wavelet-based subband decomposition. We present a novel adaptive quantization scheme with spatial constraints. This scheme is capable of exploiting simultaneously both the spectrally and spatially localized characteristics of the high frequency subbands. A multi-modal Laplacian distribution is used to model the spectral distribution of a high frequency subband and a Gibbs random field is employed to model the spatial constraints. The modeling is incorporated into a non-iterative MAP estimation to yield the quantized subbands. This quantization scheme reduces significantly the activities in the high frequency bands while preserving the perceptually important structures. Such an adaptive quantization makes the entire subband video compression scheme amenable to low bit rate coding.
Design objectives for high level microprogramming languages
Authors: Kamran Malik, Ted Lewis
Venue: ACM SIGMICRO Newsletter (1978)

The primitive operations of a high level language for producing emulators is shown to include special purpose features specific to virtual machine implementation. A Hierarchy of data types, short reliable language constructs, and control structures that minimize emulator complexity are suggested by a goal-directed, structured design methodology. In addition, structural &ldquo;clues&rdquo; generated by the language compiler assist in producing portable, yet efficient horizontal micro code for partially-encoded host architectures.
Adapting Curriculum 78 to a small university environment
Authors: Mary Dee Harris Fosberg
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Curriculum 78 was developed to present an undergraduate degree program in Computer Science at any university, with appropriate adaptation to each specific environment; in general the degree program suggested applies most naturally to relatively large universities. Because small universities have limited resources&mdash;students, faculty, computing facilities&mdash;the implementation of Curriculum 78 requires careful modification to fit the particular environment. By organizing the topics covered by the suggested courses in Curriculum 78 in different combinations and emphasizing microcomputers, the Department of Mathematical Sciences at Loyola University can offer a complete degree program in Computer Science in spite of its limited resources.
A tree algorithm for nearest neighbor searching in document retrieval systems
Authors: Caroline M. Eastman, Stephen F. Weiss
Venue: Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval (1978)

The problem of finding nearest neighbors to a query in a document collection is a special case of associative retrieval, in which searches are performed using more than one key. A nearest neighbors associative retrieval algorithm, suitable for document retrieval using similarity matching, is described. The basic structure used is a binary tree, at each node a set of keys (concepts) is tested to select the most promising branch. Backtracking to initially rejected branches is allowed and often necessary. Under certain conditions, the search time required by this algorithm is 0(log2N)k. N is the number of documents, and k is a system-dependent parameter. A series of experiments with a small collection confirm the predictions made using the analytic model; k is approximately 4 in this situation. This algorithm is compared with two other searching algorithms; sequential search and clustered search. For large collections, the average search time for this algorithm is less than that for a sequential search and greater than that for a clustered search. However, the clustered search, unlike the sequential search and this algorithm, does not guarantee that the near neighbors found are actually the nearest neighbors.
A simulation model to aid in the design and tuning of hierarchical databases
Authors: Wayne A. Hall
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

Bell Laboratories has developed a data management system for hierarchical databases. The system is designed in such a way that its performance can be significantly affected by a number of parameters which can be manipulated to &ldquo;tune&rdquo; an installation for minimum response time and lowest cost. In order to study the relationships among these parameters, a simulation model was developed which has enabled the preparation of published guidelines to be used by database designers and administrators. In addition, the model itself is available for direct use on an interactive basis as a standard part of a utility package provided as a component of the system. The work on which this paper is based was done while the author was with Bell Telephone Laboratories in Holmdel, New Jersey.
On the syntax and semantics of horizontal microprogramming languages
Authors: Tomlinson G. Rauscher, Ashok K. Agrawala
Venue: Proceedings of the ACM annual conference (1973)

Horizontally microprogrammable computers provide the potential for efficient use of hardware through parallel operation of internal resources. Present languages for microprogramming such computers, however, contain unnatural symbolism, inflexible format requirements, and unnecessary constraints which make their use rather difficult. The intrinsic characteristics of horizontally microprogrammable machines suggest the use of operator precedence languages to program them. The syntax of a language, ANIMIL, is formally described along these lines and some initial ideas on semantics of languages for horizontally microprogrammable machines are discussed.
A proposed 4-year software engineering curriculum
Authors: Randall W. Jensen, Charles C. Tonies, William I. Fletcher
Venue: ACM SIGCSE Bulletin (1978)

Computer science and engineering (CSE) departments in the nation's universities are the current targets of much criticism by software professionals. The common complaint is that the existing curricula do not relate to many of the most important problems a software engineer faces in the industrial/business environment. If we define software engineering as the establishment and application of sound engineering principles to obtain economically software that is reliable and works efficiently on real machines, it is mandatory that we recognize software engineering as more than simply converting a given set of program specifications into executable code. The software engineer must deal with the entire software life cycle which spans the time from the conception of the product, through the development phase, and finally to the end of its operational life. Medium- to large-scale software projects typically involve a myriad of managers, engineers, programmers, and customers which leads to the need for effective management and communications to ensure the best possible product. Therefore, the software engineering curriculum must include the following basic education areas: computer science and engineering, management science, communication skills, and problem solving in addition to fundamental physical and business sciences. Disparities between academic attitudes and profit-making realities are described and fundamental elements of an effective curriculum are proposed in this paper. A suggested 4-year curriculum leading to a Bachelor of Science degree in Software Engineering is also presented.
The microcomputer user services specialist an evolving role
Authors: Fred Jennes
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

The microcomputer user services specialist is a role which has emerged because campus computer centers needed to meet the changing needs of their users. Historically, campus computer centers supported mainframe users with staff consultants who were programmers and computer generalists. Now they support new microcomputer users with a consulting staff of computing generalists and microcomputer specialists. Microcomputer user services specialists aid campus users in five areas-programming assistance, educational services, purchasing advice, testing and development of micro-related products, and the installation and maintenance of hardware and software. Two challenges which computing centers face in creating this role are finding new funding sources for microcomputer staff salaries and operations, and deciding which hardware and software will be supported by the specialists. Specific examples of the role and how current trends affect it are provided in a discussion of the function of the microcomputer user services specialists at Duke University. The role will continue to evolve as new computers arrive on the campuses and new user support services are required. As microcomputers begin to proliferate on college campuses, traditional university computer centers are becoming hard-pressed to meet the new demands placed on them. Computer centers, which have prided themselves for many years on the level of support they have provided to their mainframe users, are finding themselves baffled by the unique support needs of the growing community of microcomputer users. To meet these needs, a number of university computer centers have begun to hire and train members of their consulting staff to serve as a new support resource-the microcomputer user services specialist.
Selective controllability: A proposal for testing and diagnosis
Authors: F. Hsu, P. Solecky, L. Zobniw
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper proposes a testing and diagnostic method that reduces fault location and repair costs on printed circuit boards populated with LSI and VLSI modules. The method requires some additional circuitry on the module subassembly. It enhances the following test strategies: automatic probing, bed-of-nails, Subassembly-in-Place, and Level Sensitive to Scan Design (LSSD). In addition, this technique makes it possible to partition large networks into manageable subnetworks for Automatic Test Generation.
Testing of microprograms using the lockheed SUE microinstruction simulator
Authors: Scott Davidson, William Tao
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

Each microinstruction of a microprogram written for a horizontally microprogrammable machine can affect the machine state in quite complex ways. A microinstruction simulator that allows a microprogrammer to examine the entire processor state is a valuable tool in the testing of microcode. The debugging aids made available by the simulator, as well as the design technique used in the construction of a microprogram, will tend to determine the strategy used in testing the microcode. This paper describes one such simulator and a set of testing strategies found useful in working with it. The machine simulated is the Lockheed SUE, a 16 bit microprogrammable minicomputer. The SUE Simulator not only allows the display of the processor state, but allows most of the state to be modified by the user. A testing strategy using the features of the Simulator is presented for a microprogram written using bottom-up techniques. The Simulator is also shown to be useful in testing microprograms written using other methods, and in simplifying and speeding the testing process. Finally, the use of the Simulator in examining the effects of modifications to the processor on the microprogramming task is discussed.
Deferred Execution: An &ldquo;ACE&rdquo; of an application
Authors: Donald A. Link, Martin W. Gardner
Venue: ACM SIGAPL APL Quote Quad (1979)

Deferred Execution is an APL application that provides users with a &ldquo;batch&rdquo; APL facility. This application was made possible by the design and implementation of ACE (Automatic Control of Execution). The motivation behind ACE and a summary of its facilities are provided. The paper also includes the design goals for a Deferred-Execution system and summarizes the final design used. Finally an exciting new approach to application structure is presented, showing how Deferred Execution was implemented as a highly reliable and secure APL application.
Generalized model building within an integrated decision support system
Authors: David P. Yancey, Robert A. Carringer
Venue: Proceedings of the 16th conference on Winter simulation (1984)

This paper describes of a Generalized Model Builder (GMB) for use within a framework for integrating multiple analytic tools, operating from an integrated model database. This system provides a uniform interface for a variety of applications, including: simulation, optimization, financial analysis, steady-state network analysis, scheduling-balancing heuristics, and project planning. Graphical, prompt, and spreadsheet-like interfaces are described.
Electronic Chip-in-Place Test
Authors: P. Goel, M. T. McMahon
Venue: Proceedings of the 19th Design Automation Conference (1982)

Electronic Chip-in-Place Test (ECIPT) is a design approach and a test methodology for VLSI packages containing multiple semi-conductor chips. Shift register latches are used in such a way that each chip on a package is accessible for testing from the package pins without in-circuit probing. A means is therefore provided, whereby tests generated for a chip can be reapplied at the package level. The ECIPT methodology additionally provides a mechanism for simplified tests of failures associated with interchip wiring and chip I/O connections.
Direct search for optimal parameters within simulation models
Authors: Hans-Paul Schwefel
Venue: Proceedings of the 12th annual symposium on Simulation (1979)

The tool of systems simulation can be improved by superposing optimization techniques onto the computer model of the object or system investigated. Direct search methods for parameter optimization are applicable in a much wider field than any other technique. Outstanding among such partly heuristic methods is one that is based on principles of organic evolution. The results of a comprehensive test program in which all important algorithms have been compared reveal the superiority of this evolution strategy. Reference is made to examples of actual application.
The probable future of Canadian long haul digital data network connections with the U.S.A.
Authors: D. M. Atkinson, U. C. Strahlendorf
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

This paper is intended to acquaint data users and network designers in the United States with the announced plans for a Canadian digital network which is expected to be optimized for data communications in Canada. This paper is structured in two parts. The first discusses some futures of telecommunications in terms of information transfer, and reviews the objectives of the digital network which is to be built in Canada to optimize on each future. The second focuses on system designs focus optimizing the subset of information transfer which is today blanketed by the generic work &ldquo;data&rdquo;. The latter part of this paper covers the technical outline of the Trans-Canada Telephone System Digital Data Network (TCTS/DDN) which was announced on March 8 1971. The first section now under construction will extend from Ottawa and Toronto to Calgary. It will be physically integrated with the existing microwave route. The TCTS/DDN will be extended coast to coast as the business develops. The end points might be Halifax on the Atlantic and Vancouver on the Pacific (about 3500 miles). So there is plenty of opportunity to interconnect with a number of USA border points.
On pattern recognition and description using many sorted predicate calculi
Authors: Alois Glanc
Venue: Proceedings of the ACM annual conference (1973)

A pattern is a set of binary or ternary relations. A description of the pattern is a formula of many sorted predicate calculus with metric spaces defined on indices of predicate constants which is satisfied by the given pattern. The pattern recognition problem is to find whether the formula is satisfied by the given relation. The pattern description problem is to form from the given pattern the corresponding formula. To solve this problem usual training methods1 are applied together with techniques used for program synthesis2. The limitations imposed by these techniques imply limitations to our approach.
Designing the Human-Computer Interface
Authors: Albert N. Badre
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

There is a growing awareness in the academic and industrial computing communities of the need to introduce human factors considerations into the design of computer systems. At the School of Information and Computer Science of the Georgia Institute of Technology, this need is being met through a well-funded graduate research program in the human factors of computer systems as well as the introduction of courses that emphasize usability in designing the human-computer interface. The course detailed in this paper has the title &ldquo;Human-Computer Interface.&rdquo;
Formal specification and verification of a connection establishment protocol
Authors: Daniel Schwabe
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper presents an exercise in the verification of a connection establishment protocol. A specification language named SPEX, tailored for the needs of communications protocols, is proposed, and its relation to a semi-automated verification system, AFFIRM, is discussed. This language is then used to specify a connection protocol currently being used. Certain errors are uncovered by analysis using the verification system. However, the major portion of the protocol's operation are shown to be correct.
The treet time sharing system
Authors: H. A. Bayard, C. T. Browne, L. N. Gross, E. C. Haines
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

This paper is a description of the TREET time sharing system as it is presently implemented. Information is provided about the basic TREET system, including data structures, basic functions and facilities, languages, the translator, the assembler, the compiler, storage, and data set access; about the time sharing system, its monitor and file structure; about the editing and debugging facilities for on-line programming; and about four application areas&mdash;text processing, tree processing, fact retrieval, and further development of the on-line system.
Query languages for the casual user: Exploring the middle ground between formal and natural languages
Authors: William C. Ogden, Susan R. Brooks
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

In the past the non-programmer who wanted the information contained in a computer database had to employ an expert programmer knowledgeable in the language and structure of the database. Now languages are being developed that are designed to be used by an infrequent or &ldquo;casual&rdquo; user who has limited knowledge of how the data is stored or retrieved by the computer. These special purpose query languages which allow these casual users to retrieve information from computer databases are commonly referred to as &ldquo;nonprocedural&rdquo; (Leavenworth and Sammet, 1974) because users need only describe the data to be retrieved, not how it is to be retrieved. These languages can be classified into two basic types which are characterized by the level of constraint imposed on the syntax and vocabulary of the language (Ehrenreich, 1981). Formal query languages have a very constrained syntax and vocabulary, while natural query languages have a relatively unconstrained syntax and vocabulary. If we consider the level of constraint that can be imposed on a query language as a continuum, then formal and natural query languages represent the two ends of this continuum. There has been considerable debate over the issue of which end of this continuum best meets the needs of the casual database user (e.g. Hill, 1972; Petrick, 1976; Shneiderman, 1980). Proponents of formal languages contend that these users benefit from learning a constrained language which teaches a concise and unambiguous way of communicating with the computer. Proponents of natural languages, on the other hand, contend that more people would be able to access database information if they could use their own natural languages. Evidence from studies of the use of some of these query languages however, indicate that neither formal, nor natural languages are easy to use. These studies suggest that the casual user will have difficulty operating at either end of the level-of-constraint continuum.