ppxscal/embedding_network huggingface dataset:
A grammatical inference approach to on-line handwriting modeling and recognition: a pilot study
Authors: Dit-Yan Yeung
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In this paper, we present a grammar-based approach to the modeling and recognition of temporal sequences. Unlike hidden Markov models which require humans to determine in advance the appropriate model architecture to work on, our approach does not rely on prior knowledge about the topology of the underlying grammars. In particular, a discrete-time recurrent neural network model is proposed to learn separately the dynamics of each embedded subgrammar (or subpattern) class. These subgrammar network models are trained using an unsupervised learning paradigm called auto-associative (or self-supervised) learning. In this pilot study, some issues of this new approach to temporal sequence processing are investigated in the domain of on-line handwriting modeling and recognition. Some possible future research directions are also discussed.
The Federal Computer Professional In The 1980'S: Impact of the president's reorganization project
Authors: Raymond Demarest, Vince Guidace, David Skeen, Carol M. Vaughan
Venue: Proceedings of the 1978 annual conference (1978)

This panel consists of members from the Personnel Team of the President's Data Processing Reorganization Project. The panel will discuss the Personnel Team's proposals for: 1) revision of data processing career paths within the Federal Government; 2) establishment of the areas of knowledge and levels of skill expected of the Federal data processing professional; 3) establishment of voluntary professional certification of Federal computer professionals by the Civil Service Commission&mdash;this might be accomplished in conjunction with the Institute for the Certification of Computing Professionals; and, 4) modification of manning ceilings to reflect the critical nature of data processing in the Federal milieu.
Deadlock prevention in message switched networks
Authors: Robert C. Chen
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The importance of computer networking to achieve resource sharing and data sharing is widely recognized. Local networking to achieve high performance and reliability is inevitable for the future. As cost of logic and memory decreases, the cost of communications resources become increasingly significant and these resources must be increasingly shared. This heightens the possibility of deadlocks due to this sharing. Deadlocks in the ARPA network are examples of this type of deadlock. Deadlock problems due to sharing of the resources allocated by operating systems have been extensively studied. Deadlock problems in computer networks require significantly different approaches due to the distributed control of the network. This paper studies the deadlock problem in this new context; as an example, a simple solution to the ARPA network store-and-forward lockup problem is given.
The why and how of discrete structures
Authors: A. T. Berztiss
Venue: ACM SIGCSE Bulletin (1976)

Eight years after Curriculum 68 there is still much uncertainty regarding the place of discrete mathematics in a computer science curriculum. This paper explores the purposes of discrete mathematics courses in a very broad context. It is suggested that discrete mathematics be distributed over two courses, and that the attitudes established in the courses are more important than the contents of the courses.
A complete package for introducing computer science
Authors: P. C. Brillinger, D. D. Cowan
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

Faced with the challenge of teaching large numbers of students without sacrificing quality, we have developed a complete &ldquo;package&rdquo; for teaching introductory computer science. This package consists of textbooks, notes, problem sets, lab-tutorial arrangements, instructional software, and visual aids for lectures, all developed at the University of Waterloo. The textbooks are &ldquo;FORTRAN IV WITH WATFOR AND WATFIV&rdquo; and &ldquo;AN INTRODUCTION TO THE SPECTRE COMPUTER&rdquo;. The first text provides a thorough introduction to FORTRAN programming, whereas the second describes a hypothetical computer used for teaching purposes to introduce concepts in assembly language programming and machine organization. Notes supplement the texts by covering elementary ideas from boolean algebra, switching and automata theory, and hardware design. Consequently, we endeavour in this course to introduce students to various aspects of computer science, not just programming.
Business and management data processing I: ICON&mdash;a management information system
Authors: N. B. Solomon
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

FOR MANY YEARS, the word mechanization remained the key word in the computer solution of business problems. The objectives were confined to the realization of early benefits through reduction in the clerical working force. The resulting inefficient computer usage has led to a shift in emphasis from the autonomous computer program to an overall systems approach. Within our division a project is under way directed towards the development of an integrated management control system for research and development projects. Known as the ICON information system it will provide both operational and executive levels of management with a comprehensive picture of a complex operation to facilitate decision making.
Systems analyst activities and skill requirements
Authors: J. Howard Bryant, Gene Ferguson
Venue: Proceedings of the fourteenth annual computer personnel research conference (1976)

A survey of State Data Processing Directors was conducted by the National Association for State Information Systems Research and Education Committee in the fall of 1974 to determine what areas of research they believed would be most beneficial to their organizations. Based on the results of the survey, a larger study of data processing managers and systems analysts was planned in an attempt to identify means of improving their performance and, in turn, the productivity of the organizations in which they worked. The study planned to encompass an analysis of the task, knowledge, and skill characteristics of managerial and analyst positions and of position incumbents. The purpose of this report is to present the results from one part of the study pertaining to systems analysts and systems analyst positions. Subsequent reports will present the other findings.
Computer model documentation
Authors: Saul I. Gass
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

Recent studies and surveys have concluded that, in general, the documents produced to support the understanding and use of computer models are inadequate. This paper describes some of the issues and concerns of computer model documentation and proposes an approach for the development of adequate documentation. A set of computer model documents is proposed and described that is based on the relationship between the phases of the model life cycle and documentation information needs. The author takes a highly critical view of the past and present inadequate state of documentation procedures for computer models. The attention of computer model sponsors and developers must be directed to this area. Otherwise, the author feels, there will be an unfortunate decline in the use of decision models as aids in the analysis of important policy issues. The course of action recommended in this report is an extreme position as to the total information and number of documents required to produce adequate documentation. The author calls for the capturing of all information generated during a model's life cycle. Further research is needed to adapt this extreme position to the realities of cost, resources, model complexity, and model use. (This paper is based on the more detailed report [11].)
Using terminals versus card reader in remote job entry
Authors: M. Gene Bailey, Lloyd Davis
Venue: ACM SIGCSE Bulletin (1980)

As enrollment in computer science departments continues to increase, institutions are finding it necessary to improve existing computer facilities. Many have chosen the &ldquo;distributive processing&rdquo; route whereby one central location handles a major portion of the workload of the schools connected to it, while each of the schools maintain some stand-alone capability. Schools are billed for work that is performed at the network center. In particular, student jobs are charged, whether individually or collectively, to a particular school or department. It is, thus, worthwhile to consider techniques for processing student jobs which will keep operating costs of a department to a minimum. This paper considers an approach that the University of Tennessee-Chattanooga (UTC) has taken to help minimize these costs. An experiment was designed in which, for one semester, students would continue to submit programs through the card reader. The succeeding semester, jobs would be submitted through terminals, i.e. no card punching would be done and students would transmit to Knoxville using the terminals. The &ldquo;bonus point&rdquo; method was employed in both cases. The courses selected were FORTRAN AND PL/I, the first two courses in the computer science curriculum and the major users (from UTC) of the network. The FORTRAN class used the WATFIV compiler and included some usage of the structured constructs available. Approximately seventy per cent of the students enrolled in this course were in majors other than computer science. The second course selected was PL/I which used the PL/C compiler at UTK. Approximately ten per cent of the students were non-computer science majors.
An algorithm to the method of curve fitting by the process of least squares
Authors: L. Marcus
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

The importance of determining an analytical function to fit a set of experimental data has long since been recognized. Efforts have been made to find reliable methods of relating an analytical function to a set of coordinates, and at the same time, to avoid the dangerous loss of significant figures in the computation. It is well known that the classical theory of least squares is one of the best methods for fitting an analytical function to a set of experimental data. However, using this theory, the exact equation to be fitted must be chosen beforehand. Hence, the final form of an equation using the minimum number of terms required can only be obtained by a method requiring trial and error. The method to be outlined in this paper eliminates the trial and error computation in determining approximately the minimum number of terms in the final equation. It also has the advantage of avoiding the solution of an almost singular set of simultaneous equations.
A simulation study for a coal delivery system
Authors: T. C. Vorce
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

This paper discusses a computer simulation model that was constructed to assist in evaluating alternatives for a coal delivery system. A complex system, involving unit trains, intermediate storage, transshipment and lake vessels is required to transport the coal over the 1700 mile distance. The vessel delivery leg is the most critical, as the trains may run all year long, but the Great Lakes shipping season is only eight months long. The paper describes the simulation model, and how the interactions of the system are modeled. The simulation model will assist with the evaluation of different options that are available for new vessels, required because of an impending increase in coal demand. Several areas are identified where efforts could be directed to increase coal throughput.
On the application of data abstraction facilities
Authors: D. R. Chand, S. B. Yadav
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

In a recent workshop on the Design and Implementation of Programming Languages, Ledgard[4] asked language designers and researchers on data abstraction whether the encapsulated data type facility is actually used in practical programming. The authors have been using the concept of encapsulated data types in designing programs and in the teaching of a second course in programming. This paper provides an answer to Ledgard inquiry and the authors' conclusion that the use of data abstraction facilities has to be taught much like the concept of procedure. This paper may, therefore, be viewed as a tutorial on the application and teaching of data abstraction facilities in the construction of programs.
A flexible full-screen applications development workspace utilizing APL syntax
Authors: David M. Weintraub
Venue: ACM SIGAPL APL Quote Quad (1983)

A user/programmer support package for developing full-screen read and write applications is described. The design makes strong use of inherent APL syntax. The applications functions are device- and feature- independent, and may easily be extended or modified to support similar image-formatting tasks. Details of the supporting local auxiliary processor are not addressed. The design illustrates the advantages to be gained by using a well-chosen data structure to determine the requirements of the supporting functions, rather than creating APL functions to follow the restrictions of specific applications hardware.
An approach to optimal partitioning of hypergraphs
Authors: Giuseppe Alia, Piero Maestrini
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

The problem of determining optimal partitions of hypergraphs (or, more simply of ordinary graphs), is relevant in several areas, such as computer aided design of printed boards, information retrieval and program paging. In many cases there exist optimal or near optimal partitions, subject to the constraint that each block is an LS set. Intuitively, an LS set is a subset of nodes of the given hypergraph, more strongly connected to each other that to the nodes in the complementary subset. This paper presents a polynomial-bounded procedure to determine all the LS sets in a given hypergraph.
Introductory service courses in the computer science curriculum
Authors: J. M. Adams, D. H. Haden
Venue: Proceedings of the second SIGCSE technical symposium on Education in computer science (1972)

The organization of the computer science curriculum to adequately meet the service needs of other departments while still providing a reasonable program for majors is at best difficult, but is especially difficult within the economic constraints of relatively small universities. This paper contains some thoughts on this difficulty, beginning with an attempt to delineate the service needs and the associated problem areas and then making some rather general curricular recommendations for introductory service courses. Finally, experience with one of the most important recommendations is discussed in detail in the hope that it will form some sort of crude model for other developments.
The life sciences computer resources program of the National Institutes Of Health
Authors: William F. Raub
Venue: Proceedings of the 1971 26th annual conference (1971)

I appreciate this opportunity to describe for you the computer resources program of the Division of Research Resources of the National Institutes of Health (NIH). For ten years now this program has sponsored the development and operation of computer centers in medical schools, universities and colleges, and other non-profit institutions. At the beginning of the 1960's the computer was practically unknown in the biomedical world; today the computer finds application in almost every facet of life science research and in many areas of health care. Computer centers sponsored by the NIH have done much to bring about this decade of progress. My purpose today is to review the history of our computer resources program and to illustrate some of its accomplishments. I also will share with you some reflections on successes and failures and some current opinions on what to do and what not to do. Hopefully, a brief recounting of our experiences and the lessons we derive from them will prove a useful corollary to other presentations before this ACM session.
Attitude determination for the TIROS satellites
Authors: Joseph W. Siry, Joseph V. Natrella
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

The Television Infrared Observation Satellites, TIROS I and II, are meteorological satellites designed to obtain television and reflected solar and earth radiation information. They photograph the earth's cloud cover using television cameras and observe and record the reflection of solar radiation by the earth's surface and by clouds in a number of wave length regions by means of sensors and magnetic tape recorders. The satellite is spin stabilized, however, the spin axis direction varies with time in response to magnetic and gravitational torques. The satellite's attitude or orientation as a function of time must be quickly and accurately determined and predicted for a number of reasons. The most recent TIROS contains a variable intensity electromagnet which can be commanded from the ground and which is used to steer the satellite while it is in orbit. In order to give the appropriate magnetic steering commands to achieve the various satellite objectives, the attitude of TIROS must be established and predicted. The spin axis direction with respect to the sun is important since it affects the solar energy reception rate, the temperature and the power supply. The directions toward which the television cameras point must be predicted and controlled in order to command the satellite properly from the ground to take direct or remote cloud picture sequences yielding photographs of meteorological interest. This is particularly important in the four-fifths of the globe not covered by weather stations. The attitude of TIROS is also needed to prepare radiation maps showing the earth distribution of various spectral bands.
APL as a language for interactive computer graphics
Authors: Alfred M. Bork
Venue: Proceedings of the sixth international conference on APL (1974)

The purpose of this note is to explain why APL is a particularly appropriate language for certain types of interactive computer graphics and possibly for all types. A particular implementation is discussed. APL's use as a graphic language is relatively new. Graphics has been implemented in one way or another in dozens of languages before APL, including such commonly available languages as FORTRAN and also including rarer languages like LOGO and EULER-G. Nevertheless, APL, because of its own internal properties independent of graphics, turns out, I believe, to be ideally suited for at least one kind of graphic application.
How to generate random integers with known factorization
Authors: Eric Bach
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Recent work in public-key cryptography has led to the need to generate large random numbers with known factorization. This paper describes a probabilistic algorithm that produces a random k-bit integer in factored form. Each such number is equally likely to appear. The expected running time is, up to a constant factor, that required for k prime tests on k-bit integers. Thus, under reasonable assumptions about the speed of primality testing, it is a polynomial time process.
Rendering real-world objects using view interpolation
Authors: T. Werner, R. D. Hersch, V. Hlavac
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

Presents a new approach to rendering arbitrary views of real-world 3D objects of complex shapes. We propose to represent an object by a sparse set of corresponding 2D views, and to construct any other view as a combination of these reference views. We show that this combination can be linear, assuming proximity of the views, and we suggest how the visibility of constructed points can be determined. Our approach makes it possible to avoid difficult 3D reconstruction, assuming only rendering is required. Moreover, almost no calibration of views is needed. We present preliminary results on real objects, indicating that the approach is feasible.
Combining discrete and continuous simulation dynamo into simscript
Authors: Ronald Dale Jones
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Discrete and continuous simulation can be combined in one program by using a discrete simulation language to simulate, among other things, a continuous simulation program. This amounts to the translation of the continuous language into the discrete language. The translation of Dynamo into Simscript is examined.
A Classroom Information System for teachers; with focus on the instructional data collection and analysis
Authors: Takahiro Sato
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper discusses a Classroom Instruction System (CIS) for a teacher as a Computer Managed Instruction System. The system provides the teacher with the information for instructional decision making. Especially, this paper forcuses the followings 1) collecting the student response data: The CIS employs a Response Analyzer as an adequate apparatus to collect and record the data, which are the score and the response time, in the group-paced classroom instruction. 2) analyzing the data and providing a teacher with information: Several effective data processing and analyzing methods are proposed, and the information provided the classroom teacher for instructional decision making is discussed. And, this paper shows some practical examples.
Computer science education through a rearview mirror: Experiences with curriculum 68 at Virginia Polytechnic Institute and State University
Authors: George W. Gorsline, Duff Green,  III
Venue: Proceedings of the third SIGCSE technical symposium on Computer science education (1973)

The state of development of computer science, the views of the computer professionals regarding educational objectives, and the extent and types of post-school employment opportunities constitute the meta-environment for our educational efforts. In addition, an educational program must be conceived, born, grow and live (or die) in the immediate environment of its host educational institution. The goals, the priorities, the financial exigencies, and the academic politics of the university are as important to the program as are the students, the faculty, the curriculum, and the meta-environment. The host institution for the computer science program discussed in this paper is Virginia Polytechnic Institute and State University (VPI &amp SU/Virginia Tech). It is an aspiring, growing, southern border-state, non-urban, land-grant institution [9,11].
Identifying terminals in terminal-oriented systems
Authors: Joseph F. Ossanna
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

Today's proliferation of terminal types with their various features, speeds, line disciplines, and idiosyncrasies is harassing the computer system implementer who would like to serve a variety of terminals. In addition to the ability to interface to a particular terminal type, it is necessary to identify that terminal among those able to use the same hardware interface. The advantages of more complete identification of terminal speed and type are developed. The properties of terminals are classified from the standpoint of their necessitating or facilitating such identification. Historical methods of determining the type of terminal approaching a system are discussed. A recognition character algorithm for simultaneously determining the terminal speed and type is described. Some quasi-standard terminal features are proposed that would permit the general application of such algorithms.