ppxscal/embedding_network huggingface dataset:
Specialized consulting a joint appointment, Computer Center - Graduate School of Library Services at Rutgers University
Authors: Leny Struminger
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

In this session we are approaching the question of whether or not specialized consulting belongs in a computer center. In an attempt to answer this question, I would like to discuss with you a special position which was established at Rutgers University five years ago. The position that I am referring to was the joint appointment of an applications programmer between the Computer Center for Information Services, or 'CCIS', and the Graduate School of Library Service, with 25% of this appointment being granted to the CCIS and 75% to the GSLS. CCIS serves all of the academic departments of the University by providing several educational series, system documentation, general purpose software packages, and programming consultation for users of the facilities. It is essential that a full-time applications programmer working for the University Computer Center be familiar with a majority of the computer resources there and also be available for consultation on their use.
Practical applications of a syntax directed program manipulation environment
Authors: V Donzeau-Gouge, B. Lang, B. Mélèse
Venue: Proceedings of the 7th international conference on Software engineering (1984)

We present applications in various domains of a system built around a syntax directed editor: the Mentor system. The main characteristics of the system are the abstract representation of data, programmability of the command language, and language independance. The applications presented belong to the area of program editing and manipulation, extensions of programming languages through the development of preprocessors, processing of multi-formalism documents and program portability.
Sketch pad a man-machine graphical communication system
Authors: Ivan E. Sutherland
Venue: Proceedings of the SHARE design automation workshop (1964)

This paper was reproduced from the AFIPS Conference proceedings, Volume 23, of the Spring Joint Computer Conference held in Detroit, 1963. Mr. Timothy Johnson suggested that this report contained essentially the same material he spoke on at the SHARE D/A Committee Workshop.
A student-designed Undergraduate program
Authors: Michael A. Bauer
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

In recent years there has been a growing interest and concern among professionals and educators in Computer Science about undergraduate and graduate programs. A student could possibly offer a new viewpoint into this area, being immediately involved in such a program. However, his view is restricted by the educational environment he has been exposed to, usually in a single undergraduate institution. The following presentation of an undergraduate student's views on a Computer Science education is based upon problems and solutions encountered in designing a possible undergraduate Computer Science curriculum for the University of Dayton. To be applicable, the curriculum needed to be constructed within the confines of current departmental and university constraints and also needed to consider faculty and their interests. This curriculum could be adapted to another university and to another faculty, providing that the faculty can cover the areas reflected in the curriculum. In designing such a curriculum for the University of Dayton, the interests and abilities of five full-time and two part-time instructors had to be considered. Their interests covered the areas of numerical analysis, linear programming, graph theory, compilers, operating systems, logic, programming languages, automata, formal language theory and analog computers. The faculty are especially knowledgeable in the areas of numerical analysis, logic, compilers, programming languages, operating systems, linear programming and graph theory, with individual abilities covering the remaining areas. The minimum departmental and university requirements consisted of 124 semester hours for graduation, 24 hours in upper level (junior and senior) courses in Computer Science, 12 hours in upper level mathematics courses, 30 hours of humanities, 6 hours of physics, 6 hours of chemistry, and the remaining hours consisting of electives. All of these factors had to be considered and incorporated into the designing of the curriculum.
Process oriented logic simulation
Authors: Sany M. Leinwand
Venue: Proceedings of the 18th Design Automation Conference (1981)

Theoretically, simulation can be activity oriented, event oriented or process oriented. Existing techniques for logic simulation are either activity or event oriented. In this paper, the possibility of logic simulation using process oriented concepts is investigated. Such an approach is justified by the need to support modular design environments. The key feature is that of asynchronous module activity: the timing order of signal changes has to be preserved only for those events belonging to the same module. It is shown that as long as the proper order of occurence for intermodule signaling is faithfully preserved, a centralized scheduling of events is avoidable. Thus, sequences of uninterruptible local events (termed atomic activities) can be simulated in complete isolation. The correct definition of uninterruptible local activities needs some information on allowable timing of interface events.
A Markov random field for rectilinear structure extraction in pavement distress image analysis
Authors: P. Delagnes, D. Barba
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

This paper deals with the detection and extraction of poorly contrasted rectilinear structures in textured areas, using a Markov random field model. The application is in the analysis of pavement distress, and more particularly pavement cracks. A local crack detection is first performed, where the pavement texture is seen as additive correlated noise. The resulting line image is then projected onto a regular lattice composed of straight line segments. A graph structure is associated with this lattice, which allows the definition of a Markovian crack model, where sites are no longer the image pixels, but straight line segments. The model is used to determine the location and shape of the rectilinear structures, with a given orientation, in the observed lattice. The actual defects can then be extracted by simple post-processing.
Demultiplexing considerations for statistical multiplexors
Authors: Wesley W. Chu
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

Demultiplexing serves as an important function for statistical multiplexors. Its purpose is to reassemble the received message and distribute it to the appropriate destination. The demultiplexing buffer can be modeled as a finite waiting room queuing model with batch Poisson arrivals and multiple distinct constant servers. Simulation method is used to study the buffer behavior for the uniform, linear, step, and geometric traffic destination functions. The relationships among buffer overflow probability, buffer size, traffic intensity, average message length, and message destination are presented in graphs to provide a guide in the design of demultiplexing buffer. Simulation results reveal that buffer input message which have short average message length and uniform traffic destination yield best buffer behavior. Thus, in planning the CPU scheduling algorithm and in selecting the demultiplexing output rates, the computer communications system that uses the statistical multiplexing technique should also consider the desired output statistics to achieve optimal demultiplexing performance.
Errors arising from the digital implementation of integration and lead/lag networks
Authors: Warren A. Murray
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

In the simulation of aircraft and other physical systems, the solution of differential equations is required and lead and/or lag networks have to be simulated. Many techniques have been devised for numerical integration when digital computers are used to solve ordinary differential equations. Obviously, since the digital computer uses discrete samples rather than continuous variables, such integration schemes are an approximation to the solution of a differential equation. The question naturally arises to how good the approximation offered by the use of a particular integration algorithm or lead network implementation is. This paper explores the sources and magnitudes of the errors which accrue from the use of different integration algorithms and compares such errors quantitatively.
A session with Tinker: Interleaving program testing with program design
Authors: Henry Lieberman, Carl Hewitt
Venue: Proceedings of the 1980 ACM conference on LISP and functional programming (1980)

Tinker is an experimental interactive programming system which integrates program testing with program design. New procedures are created by working out the steps of the procedure in concrete situations. Tinker displays the results of each step as it is performed, and constructs a procedure for the general case from sample calculations. The user communicates with Tinker mostly by selecting operations from menus on an interactive graphic display rather than by typing commands. This paper presents a demonstration of our current implementation of Tinker.
Real-Time Simulation For Verification Of Tactical Electronic Warfare System
Authors: Carmine A. Vaccarino, George Konomos
Venue: Proceedings of the 1978 annual conference (1978)

In recent years, electronic warfare (EW) systems have become more and more reliant upon digital technology. Usually they include a digital computer with appropriate software programs used to control the various functions of the system, analyze EW signals, and in some cases, command the countering of the same signals. One of the first digital systems, truly software programmable, is the F-15 Tactical Electronics Warfare System (TEWS). The AFAL developed F-15 TEWS Automatic Airborn Weapons System Test Central provides capability for total and complete validation of the TEWS software performance under various threat environment conditions. These capabilities include: a. Static simulation of various threat radars; b. Dynamic simulation of dense threat environments and command and control functions; c. Real-time data collection and data reduction; d. Assembly and debugging of any part of the TEWS operational flight program (OFP); e. Linking various assembled modules with others from the library and loading the total program; f. Generate paper punch tape with the OFP for loading other F-15 TEWS. This paper identifies the set of programs comprising the real-time dynamic simulation, the operation of the real-time simulation model and data collection, and their application in the validation of the F-15 TEWS. In addition, the design methodology used is discussed as an effective tool to reduce programming time and simplify changes to the program.
Classification and functional decomposition of business documents
Authors: S. L. Taylor, M. Lipshutz, R. W. Nilson
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper describes recent efforts to develop a document classification system. Our classification approach uses two steps: first, the document is sorted by the number of columns and second, functional landmarks are detected to determine the class. Results for detecting and classifying business class documents are included.
A meta-compiler as a design automation tool
Authors: R. Mandell, G. Estrin
Venue: Proceedings of the SHARE design automation project (1966)

In the field of design automation, in general and in the automatic design of digital computers in particular, it is frequently necessary to translate machine descriptions and designer requests from the input language to the language of the design automation system. This process is very similar to the translation of artificial computer programming languages into machine language. Hence, it is reasonable to attempt to apply the techniques developed for writing compilers to the task of translation required within a design automation system. In this paper we will describe the use of one such tool, the meta-compiler or syntax directed compiler.[1] A meta-compiler is a compiler specifically tailored for the generation of other compilers. The input to a meta-compiler consists of a description of the input and output languages of the compiler to be generated and the algorithmic relationship between them. The use of a meta-compiler reduces the generation of compilers from an extremely formidable task of assembly language programming to a more routine task of higher language programming.
High level languages processor architecture
Authors: Emilio Luque Fadon, Lorenzo Moreno Ruiz, José F. Tirado Fernandez
Venue: Proceedings of the 1977 annual conference (1977)

One of the present lines of research in the field of processor architecture is that oriented towards the search for the necessary devices to carry out efficient execution of the high-level languages. In this regard, the present study tries to find the ideal information structures which a processor should have for directly executing any high-level language. Those characteristics which are common to the high-level languages that the processor will execute, such as the symbolic identifier handling, block structure, dynamic memory management, definition of reentrant routines and recursive production rules are those which will condition the definition of the information structures.
A comparative analysis of two concepts in the generation of uniform pseudo-random numbers
Authors: George C. Canavos
Venue: Proceedings of the 1967 22nd national conference (1967)

In recent years, considerable attention has been given to find reliable methods capable of producing, within a digital computer, pseudo-random numbers obeying the uniform distribution on the unit interval. Apparently, the most popular method has been the congruence algorithm whose basic form Xi+1 &equil; aX1 + b mod 2m (1) can be easily implemented on a binary computer with word size of m bits. Since its introduction, a number of papers1-3 have been written in which techniques, such as suggesting formulae1 to compute optimal values for a and b, have been presented to improve the statistical properties of the method. As a consequence, several versions with values for a and b to suit everybody's needs are now in existence. One must be aware that an analysis based on statistical testing cannot be entirely conclusive, especially if the power of some tests used is not known. Nevertheless, the comparative analysis of this study does indicate that a generator based on Tausworthe's concept exhibits a statistical behavior that is as good if not superior to that of the congruence algorithm. Therefore, the following advantage in its use are apparent: (1) Its functional form and statistical behavior are entirely machine independent. (2) It has been shown analytically that it generates values of a random variable uniformly distributed on the unit interval. (3) It can be easily programmed in FORTRAN without sacrificing any of its characteristics. (To the author's knowledge, none of these advantages can be claimed by any of the existing congruence algorithms.)
Computer science education for an overlooked group - high school teachers
Authors: Kuan-Chen Fu, Benjamin Koo
Venue: ACM SIGCSE Bulletin (1973)

Since the advent of the electronic computer, revolutionary changes have been made in modern society. As a natural consequence, modernization of the curricula has been called for in our educational system, which includes the grade schools, high schools, and colleges. In the last decade, mathematics courses in the grade schools have been completely overhauled by the introduction of the basic concepts of set theory, group theory and the Boolean algebra. Thus, a good mathematics foundation has been laid for the students for their future computer application. On the other hand, courses which contain computer oriented methods and theories have also been instituted in the college curricula of many academic disciplines such as engineering, medicine, mathematics, economics, business, science, management, etc. However, the initiation of an introductory computer course in the high schools is surprisingly sparse.
Software documentation an automated approach
Authors: Jonathan Arnon, Harry Lehrhaupt
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

General Electric has developed a tool and an accompanying methodology that produce documentation as a natural by-product of the software development process. Documentation is generated semi-automatically, is current, and is produced with an estimated one-third savings in design documentation costs.
ACM curriculum committee report computing programs in small colleges
Authors: John Beidler, Richard H. Austing, Lillian N. Cassel
Venue: ACM SIGCSE Bulletin (1984)

The Curriculum Committee of the Education Board of ACM has established as an ongoing committee a Small College Group. This committee will make a presentation of its report at this symposium and will provide an opportunity for attendees to comment. Various aspects of computing programs will be considered, including obtaining qualified faculty, providing appropriate equipment and the selection of a suitable and manageable set of courses.
Personal computers are coming to campus
Authors: Lawrence G. Tesler
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

I have been asked to present a supplier's view of the campus computer revolution. Computers are, of course, hardly new to the campus. Before any bank or business ever ordered a computer, universities were already making use of them in engineering, mathematics, and sciences. University researchers were among the founders of computer technology and have contributed to most subsequent advances as well. Most of you in the audience were probably introduced to computers at a college or university. In 1960, my high school did not have a computer, so I managed to get access to 1/2 hour a week of time on an IBM 650 at Columbia University. Today, I still meet high school students who obtain access to computers at the local college, if their high school has inadequate facilities, and if they do not have a personal computer at home.
The behavioral styles of computer programmers
Authors: Edward M. Cross
Venue: Proceedings of the eighth annual SIGCPR conference (1970)

This paper describes a part of the research conducted for a doctoral dissertation. The purpose of the research was to test an approach to job analysis, specifically focusing on the utility of a certain set of constructs, those underlying the scales of the principal instrument used in the study, for job analysis purposes. Because a rather substantial part of the study and the background for the study would not be of interest to any but a few of the people assembled here, much explanatory material has been omitted. What will hopefully be of more general interest will be the manner in which the job analysis was conducted, the outcomes of various phases of the job analysis, and the implications of these outcomes. This is because the occupation at which the job analysis is directed is the computer programming group (business programmer type), the reason for this choice being that the author has spent a much larger portion of his career as a computer programmer than he has as a job analyst.
Simulating pass transistor circuits using logic simulation machines
Authors: Z. Barzilai, L. Huisman, G. Silberman, D. Tang, L. Woo
Venue: Proceedings of the 20th Design Automation Conference (1983)

An algorithm for pass transistor simulation using the Yorktown Simulation Engine (YSE) is outlined. Implementing this algorithm yields an efficient tool for custom VLSI circuit design verification and fault simulation. Modeling of circuits under this environment is defined, including the analysis of the algorithm's performance for some general circuit types. A number of specific examples are discussed in detail.
Graph problems on a mesh-connected processor array (Preliminary Version)
Authors: Mikhail J. Atallah, S. Rao Kosaraju
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

We give O(n) step algorithms for solving a number of graph problems on an n-&-times;n array of processors. The problems considered include: marking the bridges of an undirected graph, marking the articulation points of such a graph, finding the length of a shortest cycle, finding a minimum spanning tree, and a number of other problems.
High-level debugging assistance via optimizing compiler technology (Extended Abstract)
Authors: Karl J. Ottenstein, Linda M. Ottenstein
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

A primary benefit of most software tools is either the prevention or the detection of human error in the development process. Languages, such as Pascal and Ada, have been designed with features such as strong typing to increase the amount of error detection that can be done by the compiler. Syntax directed editors [11] also decrease the opportunity for the introduction of human error. Our paper describes some of the debugging assistance which can be provided to a user during the transformation of a program by an optimizing compiler. Our premise is that the additional information obtained during optimization could warrant the sole use of optimizing compilers during software development.
An index organization for applications with highly skewed access patterns
Authors: Christer Hultén
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The conventional way of organizing indices in large data base systems is to use balanced tree structures such as B-trees or static tree structures, e.g. ISAM. It is well known in practice that most applications do not have a uniform record reference distribution but rather the 80/20-rule or Zipf's law applies. The balanced index implementations mentioned do not exploit these skewed access patterns. This paper, which is an extract from the author's Ph.D.-thesis, proposes a data structure - the C-tree - which is designed to exploit the skewness of such access distributions with the intent of obtaining short response times for transactions accessing the index. An analytical model of the proposed structure and a B-tree is used for making a comparative evaluation of the structures. Conclusions are drawn and discussed with regard to the circumstances under which the proposed structure outperforms the B-tree.
Network flow and generalized path compression
Authors: Zvi Galil, Amnon Naamad
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

An O(EVlog2V) algorithm for finding the maximal flow in networks is described. It is asymptotically better than the other known algorithms if E &equil; O(V2&minus;&egr;) for some &egr;>0. The analysis of the running time exploits the discovery of a phenomenon similar to (but more general than) path compression, although the union find algorithm is not used. The time bound is shown to be tight in terms of V and E by exhibiting a family of networks that require &Ohgr;(EVlog2V) time.++