ppxscal/embedding_network huggingface dataset:
A structured approach to teaching operating systems principles using a high level concurrent programming language
Authors: R. J. Fornaro, K. P. Garrard, E. M. Uzzle
Venue: ACM SIGCSE Bulletin (1983)

The educational objectives of two upper level operating systems courses are discussed. The instructional environment in which these courses are taught is also described. The primary goal is to expose students to all of the important issues involved in designing and implementing operating systems. Students should start with the architecture of the target machine and proceed through to an implementation of some functioning operating system. This is a difficult task to achieve in the confines of a single semester. However, a careful choice of software exercises that start very simply and build on each other to illustrate important points, and a high level language facility for writing operating system programs have combined to produce a successful experiment. This technique is applied in a senior level Computer Science course on Operating Systems Principles and a graduate level course on Real Time Systems. The program development system described is not only a good educational tool, but also provides a vehicle for research in comparing concurrency constructs in languages and the performance and architectural implications of concurrent programs.
An integrated computer aided design system for gate array masterslices: Part 2 the layout design system MARS-M3
Authors: Chiyoji Tanaka, Shinichi Murai, Hiroo Tsuji, Toshihiko Yahara, Kaoru Okazaki, Masayuki Terai, Reiji Katoh, Mikio Tachibana
Venue: Proceedings of the 18th Design Automation Conference (1981)

Described are the outline and the application results of a fully automatic chip layout design system which has been utilized for years for the development of over a hundred options of ECL and MOS gate arrays. The features and techniques of the placement, routing and checking subsystems as well as the chip layout model which can be treated by the system are discussed.
Spatial input/display correspondence in a stereoscopic computer graphic work station
Authors: Christopher Schmandt
Venue: ACM SIGGRAPH Computer Graphics (1983)

An interactive stereoscopic computer graphic workspace is described. A conventional frame store is used for three-dimensional display, with left/right eye views interlaced in video and viewed through PLZT shutter glasses. The video monitor is seen reflected from a half silvered mirror which projects the graphics into a workspace, into which one can reach and manipulate the image directly with a &ldquo;magic wand&rdquo;. The wand uses a magnetic six degree-of-freedom digitizer. In an alternative configuration, a graphics tablet was placed within the workspace for input intensive tasks.
Languages in general algebras
Authors: C. D. Shepard
Venue: Proceedings of the first annual ACM symposium on Theory of computing (1969)

This paper presents the results of recent investigations into the question of when the context-free (CF) languages of an algebra are all recognizable. First, it is shown (Theorem 2.1.3) that phrase structure (PS) languages are the same as the CF languages in any (finitely generated) generic algebra. Mezei Wright (MW) previously generalized the equality of CF and recognizable languages in generic monadic algebras to arbitrary generic algebras. Thus it now follows that the PS, CF and recognizable languages are the same in any generic algebra. This result has the following consequence: Let &rgr; be a congruence on a generic algebra A with the property that there exists a PS grammar G on A such that the language generated by G from any element x of A is the &rgr; congruence class of x. Then in A/&rgr;, the CF languages (which are precisely the homomorphic images of the CF languages in A) are the same as the recognizable languages (which are precisely the inverse homomorphic images of subsets of finite algebras). Any algebra with this latter property is called regular. The following is a more powerful sufficient condition for the regularity of an algebra: Suppose A and B are regular algebras and that f1 and f2 are homomorphisms from A to B. Let R be a recognizable language in A and define &rgr; B &times; B by &rgr; &equil; {(x,y) &brvbar; ( @@@@ z &egr; R) (f1 (z) &equil; x &Lgr; f2 (z) &equil; y }. Then if &rgr; is a congruence on B, B/&rgr; is regular. Any relation &rgr; (not necessarily a congruence) defined in the above way is called an algebraic transduction. It is shown that the notion of algebraic transduction generalizes the notion of binary transduction as presented for generic monadic algebras by Elgot and Mezei (EM). Some proofs have been omitted below, especially when they are standard or straightforward. Details can be found in [S].
An emulator network for SIMD machine interconnection networks
Authors: S. Diane Smith, H. J. Siegel
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

The emulator network, a single stage interconnection network, can be used to simulate a wide variety of single stage and multistage SIMD interconnection networks. These include the STARAN, the omega, the data manipulator, and the Illiac networks. A hardware design for the emulator network is presented. It is shown how the emulator network can be used to test different network control schemes. Its performance in a partitioned machine environment is discussed. It is well suited for use in SIMD system prototypes being built to study the effectiveness of various design parameters.
Tutorial: The relational data model for Design Automation
Authors: Mark N. Haynie
Venue: Proceedings of the 20th Design Automation Conference (1983)

The relational data model has gained more acceptance in the commercial database environment in recent years. It is now finding its way into the Design Automation (CAD/CAM) area. This tutorial explains what the relational data model is and how database management systems based on it can be used with Design Automation applications.
The Datran network
Authors: C. R. Fisher, R. L. Sligh
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

The Datran system is a nationwide all digital switched network which will initially link subscriber terminals in 35 metropolitan areas. It will consist of three distinct elements: a nationwide high-capacity microwave trunking system, computer controlled switching center and local distribution systems especially configured for each of the 35 metropolitan areas. Together these elements will result in an end-to-end network which avoids reliance on existing analog facilities.
An approach to modeling simulation programs
Authors: Philip C. Cooley
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

There is a specific problem structure encountered in certain socioeconomic problems. The problem structure is characterized as a queuing network. By using certain concepts from activity network problems an efficient software system can be defined for the solution of queuing network problems. This paper discusses the conceptualization of the queuing network structure as a set of basic building blocks. The building blocks are the basis of a simulation software package designed to model queuing network problems.
Effect of declarations on software metrics: An experiment in software science
Authors: Krishna M. Kavi, U. B. Jackson
Venue: Selected papers of the 1982 ACM SIGMETRICS workshop on Software Metrics: part 1 (1982)

The attractiveness of software science [HAL77] is to some extent due to the simplicity of its instrumentation. Upon learning the detailed rules of counting operators and operands, the experiments and derivations using various algorithms and languages can be repeated. Proposed or actual applications of software science are quite varied (For example, see [SEN79]). The size and construction time of a program can be estimated from the problem specification and the choice of programming language. An estimate of the number of program bugs can be shown to depend on programming effort. Optimal choice of module sizes for multimodule implementations can be computed. Elements of software science have applications to the analysis of technical prose. The purpose of this experiment is three fold. First, we want to apply software science metrics to the language 'C'. The second purpose of the experiment is to study the effect of including declaration statements while counting operators and operands. Finally, we have set out to determine whether the area of application has any influence on software science metrics.
The simulation of a microprocessor based event set processor
Authors: John Craig Comfort
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

The availability of inexpensive, sophisticated microprocessors affords the computer system designer great flexibility in assigning simulation processes to independent computing elements. In this paper, the feasibility of assigning the functions of event set manipulation to a separate microprocessing element is investigated. Analysis of a large simulation program was performed to determine the relative amount of computer time required for event set processing, and the pattern of activation sequences for the event set processor. A simulation model was constructed to contrast the performance of a stand-alone computer system with that of a system using the same central processor and an independent event set processor. Parameters which were varied are processor and program loading relative processor speeds, and parameters to the event set algorithms. Performance results and a suggestion for the organization of a microprocessor based discrete event simulation computer are presented.
Automation of program debugging
Authors: K. Jacoby, H. Layton
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The automatic debugging system discussed here is not limited to a specific computer or programming system; it is adaptable to use with most general purpose computer systems. Automatic debugging of programs offers two main advantages. First, the programmer must consider more closely the conditions under which he can state with assurance that his program is in reality debugged. Secondly, automatic debugging can substantially reduce the lead time required between the coding of a complex problem and the achievement of effective production runs.
A LISP compiler producing compact code
Authors: William Rowan
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

A compiler has been written which compiles MACLISP into a compact intermediate language called 1-code, and an 1-code interpreter has been incorporated into an existing LISP system. The 1-code &ldquo;machine&rdquo; has a simple stack architecture and an instruction set specifically designed for LISP. Compiled programs consist of a string of eight-bit bytes of 1-code, and a local table of quantities used by the compiled code. The system has been used to compile most of the MACSYMA system, and algebraic expressions have been successfully evaluated. The system is about three times faster than interpreted LISP, and about 8 times more compact, if the 1-code and local table are compared in size to the dotted pairs needed for the uncompiled version. The possibility of enhancing the system to a true machine-independent LISP compiler is considered. In particular, the problem of varying instruction quantization size is examined, and a method is given for running 1-code programs on machines with different byte sizes.
Standards in user education
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

OUTLINE FOR WORKSHOP I. Skit Presentation A parity on the typical attitudes and quality of short courses given by computer centers II. Paper Presentations A. Lois Secrist - &ldquo;Maintaining Credibility in User Education&rdquo; B. Roger Hunt - title unknown III. Slide Presentation - &ldquo;The Development of Quality Short Courses&rdquo; IV. Questions and Answer - Discussion Period
A database management system for design engineers
Authors: Jack Bennett
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes datamanager and database facilities designed to support a computer-aided electronic design system. Datamanager facilities are those for managing files without regard to their contents; database facilities are those for managing the contents of files. Taken together, these facilities provide transparent and user- controlled services for managing the considerable amounts of information which can be generated in CAD environments.
The suitability of the VAX for a course in assembly language
Authors: Robert W. Sebesta
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

This paper describes the assembly language course we teach, using a Digital Equipment Corporation VAX-11/780 minicomputer, in which structured programming is stressed. It also discusses the relative merits and disadvantages of choosing the VAX as the computer to be used in such a course. The first section of the paper provides a quick survey of the VAX architecture. The second describes our course in assembly language, including our method of structuring assembly language programs. The final section details some of the positive and negative aspects we discovered in using the VAX in our course.
Building block programs for the layout of printed circuit boards utilizing integrated circuit packs (DAPSYS V.2)
Authors: Robert W. Kadis, Kenneth L. Thompson, William J. Volkman,  Jr., W. Lawrence Hill, Charlotte E. Gillette
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

This report describes the first set of proprietary design automation programs that will become available for licensing from C-E-I-R in 1968. The system (called DAPSY V. 2) is a group of building block programs that automate the layout and design of printed circuit boards using integrated circuit (IC) packs. The programs perform three basic functions: the logic is partitioned into IC packs, the packs are placed on the board, and the inter-connections are routed.
LAMBDA: A quick, low cost layout design system for master-slice LSI s
Authors: T. Matsuda, T. Fujita, K. Takamizawa, H. Mizumura, H. Nakamura, F. Kitajima, S. Goto
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes an automatic/interactive layout design system for designing master-slice LSI chips, which places function blocks and gives wiring patterns on the chip. Since 100% routing is essential for master-slice layout design, it is urgently required to establish a strong CAD system, which significantly reduces the design time. The LAMBDA system has been developed to achieve complete net connectivity in as short a design time as possible, where efficient automatic procedures are implemented as well as highly interactive functions. The system adopts two-level hierarchy algorithms for placement and routing problems. Highly interactive functions are realized by exploiting human intelligence and the computer's high speed processing.
An automated program testing methodology and its implementation
Authors: Dorothy M. Andrews, Jeoffrey P. Benson
Venue: Proceedings of the 5th international conference on Software engineering (1981)

This paper describes an automated testing methodology and an experiment performed to determine its effectiveness. The method is to insert in the program to be tested a number of &ldquo;executable assertions,&rdquo; statements about the program that trigger error signals whenever they are evaluated to be false (violated). A test-case is then developed for the program using actual values of the input variables. When the program is run, a plot is generated of the number of assertions violated versus the input variable values used. The resulting function is called the &ldquo;error function&rdquo;. Heuristic search algorithms can then be used to maximize this function and thereby automatically locate input values which cause the most errors to occur. The experiment included developing assertions for the program to be tested, choosing and inserting representative errors into the program, and implementing search and data collection algorithms for testing. The results indicate that combining executable assertions with heuristic search algorithms is an effective method for automating the testing of computer programs.
Multi-sim, a dynamic multi-level simulator
Authors: Robert C. Chen, James E. Coffman
Venue: Proceedings of the 15th Design Automation Conference (1978)

This paper describes an approach to efficient logic simulation of microprocessor based systems using automatic, dynamic switching of level of simulation.
Introduction to the software design and documentation language
Authors: Henry Kleine
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Software design and program documentation, the neglected facets of the software development process, are finally receiving the attention they need and deserve. Software design used to be something that merely happened while a program was being written, and program documentation was something that was supposed to happen (but rarely did) when the program was finished. Both of these tasks require documentation aids, methods, and standards to support and encourage effective communication among the members of the software development team. The purpose of the Software Design and Documentation Language (SDDL) is to meet these communication needs. This is accomplished by providing (1) a language for expressing design concepts, whose syntax and forms are simple, unrestrictive, and communicative, (2) a processor which can take specifications written in SDDL and produce an intelligible, informative, machine-reproducible document, and (3) methodology for effective use of language and processor for creating well structured, top-down program designs and documentation.
Notation of movement with computer assistance
Authors: T. W. Calvert, J. Chapman
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Although a number of movement notation systems have been invented, only a few have been developed and are in substantial use. Movement notation systems are inherently complex and therefore are difficult to master. The system described here is designed to accept Labanotation commands as input when they are entered with a light pen at a computer graphics terminal, to interpret the commands and to display the output as a computer driven movie of dancing figures. To enhance the capabilities of the computer assisted notator a macro language is being developed to make more powerful commands available. The characteristics of the macro language and of a possible higher level language are discussed.
Computer expansion of Boolean expressions
Authors: Y. H. Chuang, C. C. Kao
Venue: Proceedings of the 8th Design Automation Workshop (1971)

A computer oriented algorithm for symbolically expanding Boolean expressions containing &ldquo;and&rdquo;, &ldquo;or&rdquo;, and &ldquo;complement&rdquo; operators into their disjuntive normal form is presented. The algorithm consists of two parts in sequence. The first part applies the DeMorgan's laws, and the second part applies the distributive laws. Each part scans the expression only once, and performs the expansion directly while analysing the syntax. The one-pass feature is achieved through a syntax-oriented recursive approach. The most commonly used symbolic convention is assumed for the input and output expressions. The algorithm is believed to be machine-independent and efficient, and it can be easily implemented even on a small computer. The algorithm is found particulary useful in automation of switching circuit simplification and diagnostic test generation.
APL/CAT: APL for computer assisted teaching
Authors: David Vaskevitch
Venue: Proceedings of the sixth international conference on APL (1974)

The paper is a discussion and description of the APL/CAT system developed at Erindale College of the University of Toronto. APL/CAT is a complete system for preparing and using CAI material. It Includes an author language for writing conventional lessons, Also involved is an information management system which allows students to find out what material is available on any given subject based on natural language descriptions of the lessons in the system. Also described are a text editor and a facility for protecting students from line drops. The author language makes it easy for authors to link several workspaces together and pass information from one workspace to another, or from one session to another. At the end of the paper a short discussion of the new philosophy of lesson design developed over the past several years is given along with some examples of lessons designed along the new lines.
Continuous Learning Systems Postal Address Readers with Built-In Learning Capability
Authors: Udo Miletzki, Thomas Bayer, Hartmut Schäfer
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

While current Postal Address Readers have been adapted and fine tuned once and off--line in a central development lab, the concept of next generation readers presented in this paper will contain an inbuilt learning capability, which can be referred as learning from letters. This will be performed on different levels of reading and comprehension, enabling the system to adapt itself to slow changes of mail mix and writing conventions. This concept prevents the system from read quality degradation over time according to increasing discrepancies of internal and exterior world.Preconditions of an adaptive reading system are discussed and an outline of such a system is given. The system's adaptive components are explained, particularly for words and characters. Information is taken automatically from the documents themselves, in this case from the envelopes of mail pieces. The system presented here not only keeps track with the slow changes of input, but also optimizes itself within a given frame, say a nation wide application, to deviating site specific conditions, thus guaranteeing an optimal solution at each site, and not only at an average of all sites. Components have been publicly funded by the Project READ. The system presented here is planned as a succeeding project READ II funded by German Federal Ministry of Education and Research.
Learning Visual Operators from Examples: A New Paradigm in Image Processing
Authors: Hans Knutsson, Magnus Borga
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper presents a general strategy for designing efficient visual operators. The approach is highly task oriented and what constitutes the relevant information is defined by a set of examples. The examples are pairs of images displaying a strong dependence in the chosen feature but are otherwise independent. Particularly important concepts in the work are mutual information and canonical correlation. Visual operators learned from examples are presented, e.g. local shift invariant orientation operators and image content invariant disparity operators. Interesting similarities to biological vision functions are observed.