ppxscal/embedding_network huggingface dataset:
A dedicated computer facility at the University of Illinois
Authors: Thomas W. Burtnett
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The University of Illinois is fortunate to have a wide variety of computer resources. The academic computer center at the Urbana-Champaign campus offers an IBM 360/75 with over 3 M bytes of core, many RJE stations and a recently installed dual CPU DEC-System-10 to provide the campus with time-sharing. The DEC-10 is interfaced locally to the 360/75 to permit users to edit files on the DEC-10, submit Jobs to the 360/75 and receive results via the DEC-10. The 360/75 is also linked (via 9600 baud lines) to computers at the University's two Chicago campuses, a 370/158 at Chicago Circle and a 370/155 at the Mecial Center. These computers provide general computing service support to the University's programs of instruction and research (i.e. separate computing facilities are used for administrative data processing). Also there are several dedicated computer facilities at Urbana-Champaign, the largest University of Illinois campus. Certainly the most well-known is PLATO which is a CDC Cyber-73 dual CPU system dedicated to computer-aided instruction. Capable of handling hundreds of on-line students or course writers, the network of plasma panel PLATO terminals are installed throughout the world. Of course the largest concentration is in Urbana-Champaign, where many college courses are given entirely by PLATO.
Design Automation - a perspective (Position Paper)
Authors: H. Wayne Spence
Venue: Proceedings of the 18th Design Automation Conference (1981)

Government funding of Computer Aided Design and Design Automation research can be beneficial if several kernel problems are addressed while leaving basic system integration to commercial system and semiconductor houses. Areas requiring basic research are: 1. Device level optimization of chip layout for electrical performance. 2. Methods for specifying and analyzing systems at a level above behavioral or algorithmic system definition. 3. Self test and redundancy techniques.
The architecture and operational characteristics of the VMX host machine
Authors: Gideon Frieder
Venue: ACM SIGMICRO Newsletter (1982)

The VMX host machine is a hardware-firmware environment for implementation of actual computer systems with a favorable price performance ratio. The article presents the host framework architecture, together with all units which are used to build actual systems. The advantages and future potential of the architecture is briefly discussed. The notion of memory directives within the frame-work of an active (or &ldquo;intelligent&rdquo;) memory unit is introduced. This notion serves as one example of the possibilities that are built into the architecture of the VMX host.
An overview of BLN: A bell laboratories computing network
Authors: K. E. Coates, D. L. Dvorak, R. M. Watts
Venue: Proceedings of the seventh symposium on Data communications (1981)

The Bell Laboratories Network (BLN) provides a host-to-host networking service that has been specifically designed for the heterogeneous computer environment at Bell Laboratories. BLN incorporates two important concepts: a 7-layer architecture similar to the one currently being proposed by ISO and CCITT, and implementation techniques that allow most of the networking software to reside in totally portable modules. BLN has been operational since March, 1979 in first a 3-node and then in an 8-node prototype network. It is now being deployed to replace the existing interlocation network in Bell Labs. In this paper we provide an overview of the network service requirements and the architecture and implementation that was developed to provide those services.
Curriculum recommendations in computer science (Panel Discussion)
Authors: Richard H. Austing, Michael Mulder, Norman Gibbs
Venue: Proceedings of the 1976 annual conference (1976)

Reconsideration of &ldquo;Curriculum '68&rdquo; by the ACM Curriculum Committee on Computer Science (C3S) has been in progress for several years. A first draft of an updated report is currently being considered by C3S. It incorporates material previously available as interim reports. Computer science topics appropriate to the first two years of a baccalaureate degree program are specified and sample course outlines are given. Based on this background, intermediate level topics are specified which together with the first two year requirements identifies a &ldquo;core&rdquo; of material appropriate to all computer science majors. Additional topics and courses which could be elected by students to complete their undergraduate requirements for a major are provided. Matters such as service courses, equipment and faculty resources, and graduate study are also addressed in the report. There are significant similiarities and differences between this report and &ldquo;Curriculum'68&rdquo; which exemplify current trends and developments within computer science.
Gearing up the organization to meet the new technology
Authors: Richard Nelson
Venue: Proceedings of the 9th annual ACM SIGUCCS conference on User services (1981)

The prime function of a user services department is to provide services to the users of the computing facility. Traditionally, these services have been in the form of documentation, consultation, training, and the writing of general-purpose utility programs to make the computer easier to use. The trend in both universities and industry has been for the end user to become more directly involved with the computer, and for the centralized programming staff to diminish in size. However, in order to properly serve this new breed of customer, more emphasis should be placed on the user services function, thereby helping users to help themselves. In an environment where highly qualified professionals are turning to the computer center for help, it is only appropriate to meet this demand with highly qualified professionals. The problem, then, is simply one of finding and retaining such a staff. This latter problem can be solved easily enough at the management level by a firm decision to give the appropriate emphasis to the user services department in the form of personnel and status.
The analysis of error in an on-line recognition system of Arabic handwritten characters
Authors: A. M. Alimi, O. A. Ghorbel
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In this paper we describe a system that recognizes on-line Arabic handwriting characters. In this system, a dynamic programming algorithm is implemented. We present here the effects of some parameters of the system on its performances and on its recognition errors. This study shows a way to select the optimum values for some key parameters of the system to obtain minimum recognition error rates.
Introducing the computer at a small liberal arts college
Authors: Leila de Campo
Venue: Proceedings of the first SIGCSE technical symposium on Education in computer science (1970)

Description of a computer course to attract humanities oriented students. Current computer projects in Music, Art, Social Science and English were discussed. PL/I was the language used. In addition to the basic instructions, string manipulation and tape and disk processing were covered. Problems were geared to a non-mathematical group and covered alphabetic arrays and text scanning.
A lattice vector quantizer for generalized Gaussian sources
Authors: Feng Chen, Zheng Gao, J. Villasenor
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

A fixed-rate lattice vector quantizer for generalized Gaussian (GG) sources is presented. By using the contour of constant probability of a generalized Gaussian source to bound the integer lattice, this vector quantizer in the limit of high dimension achieves optimal boundary gains for GG sources. Low-complexity techniques for rate control, optimal codevector search and enumeration are developed. This coder achieves 8.60 dB for a generalized Gaussian source with shape parameter of 0.5 at 1 bit/sample (compared with a rate distortion bound of 9.23 dB) and 32.62 dB for the 512/spl times/512 "Lena" image at 0.25 bpp without the use of entropy coding. By using two small lookup tables, the nearest codeword search operation can be performed multiply-free and the overall quantization process costs one multiply and a few adds per sample.
Dynamic algebra
Authors: Robert E. Noonan
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

A language or set of languages, called dynamic algebras, which will simplify programming and provide the capability of simplifying programs are proposed. In such languages, the constructions of arithmetic and algebra are emphasized, resulting in fewer but larger statements, rather than smaller, explicitly sequenced assignments and transfer A set of operators (called the Aiken operators) are introduced and their usefulness demonstrated. Three examples are presented of the simplification of dynamic algebra programs using the ordinary rules of algebra. Finally, the efficiency of such programs on von Neumann, parallel, and pipeline machines is discussed.
On The Difference Between Natural Language And High Level Query Languages
Authors: S. Jerrold Kaplan
Venue: Proceedings of the 1978 annual conference (1978)

Natural Language questions differ from most existing formal query languages in that they tend to admit a wider range of responses than their formal counterparts, and provide cues for selecting among the variety of appropriate responses. These differences reflect the fact that in Natural Language conversation, a respondent is expected to take an active role in the process of selecting and organizing responses, in contrast to formal query systems, where control of the interaction typically resides with the user or applications program. This paper explores some specific ways in which Natural Language questions are particularly well suited for their environment, and discusses the potential role of similar capabilities in formal query systems, particularly with respect to Natural Language Data Base query systems.
ANSWERS: A hydrologic / water quality simulator for watershed research
Authors: David B. Beasley, Larry F. Huggins
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

In recent years, a greatly increased emphasis has been placed on improving and maintaining the quality of our national water resources. Agencies and individuals from both within and without the various levels of government are seeking information concerning the effects that land use, management, and conservation practices or structures might have on the quality and quantity of water from both agricultural and non-agricultural watersheds. ANSWERS (Areal Nonpoint Source Watershed Environment Response Simulation) was developed in an effort to supply the desired information described above for primarily agricultural watersheds. The simulation consists of a hydrologic model and a sediment detachment/transport model along with several routing schemes necessary to describe the movement of water in overland, subsurface, and channel flow phases. This simulation, unlike many large-scale watershed simulations, uses distributed (rather than lumped) parameters and is event (rather than long-term) oriented. These operational features generally yield a better understanding of the hydrologic and water quality interactions involved in a watershed by allowing the user to physically describe those processes at every point within the catchment during the period when the processes are most active, i.e., during an event. The concepts, as well as the basic mathematical model used in ANSWERS, are presented. General data needs and user considerations are also listed. In addition, the usefulness of ANSWERS as a planning tool is demonstrated by simulating several management schemes for a largely agricultural watershed in northeastern Indiana.
SYSTEM 2000 performance measurement and data base evaluation
Authors: Eugene I. Lowenthal
Venue: Proceedings of the 1975 annual conference (1975)

SYSTEM 2000 provides the data base administrator (DBA) with a variety of tools to assist him in making decisions regarding data base reorganization/restructuring and application optimization.
Uncertainty and optimization in the design of building subsystems
Authors: Elliott E. Dudnik
Venue: Proceedings of the 14th Design Automation Conference (1977)

Problems of building system design often are based upon not only a complete knowledge of the physical system and its capacities but also estimates or perceptions of the user requirements and external conditions. While the process of design implies a fit between the user demands or requirements and system conditions and constraints, the lack of accurate information about these user requirements and demands alters the quality of the final product. Since we generally neglect to consider that many of the design problem parameters are not completely known or deterministic, but are, in fact, estimated or stochastic, we often fail to recognize that our final design may not have completely met the actual user needs or demands. Failure to have achieved the user needs may result in systems that either cannot perform adequately under severe operating conditions or which may cause physical damage or harm. Therefore, most design procedures and design codes provide an adequate level of safety to ensure against personal harm or injury and to minimize risk and property damage, they do so, however, by over-designing the components of the system rather than by dealing with the actual problem of the uncertainty which underlies the problem parameters. Thus, while the design methods themselves have become increasingly sophisticated, the design parameters are often still estimates and do not truly warrant the treatment which they receive in subsequent calculations. The harm in such an approach is not so much in the use of safety factors or other such devices to accommodate the stochastic nature of the problem, but in the fact that the final design is usually overdesigned and results in a waste or misuse of equipment, material, energy, space or money. Given the increased awareness of the need to conserve material or energy resources, client-owner-users are no longer willing to pay the &ldquo;premium&rdquo; that results from providing such system overcapacity or over design. With no direct benefit resulting from such an additional expenditure of money or resources, the demand and need for greater efficiency and economy is necessary while still acknowledging, of course the need for safety and precaution. What is necessary, therefore is a design procedure which provides the means for system design that will allocate or distribute the available resources in a manner which will minimize costs and/or maximize user gains while recognizing that the demands upon the system are based upon estimates and thus are subject to varying degrees of risk or uncertainty.
Information technology a management problem
Authors: O. E. Dunn
Venue: Proceedings of the SHARE design automation project (1966)

Some wags, in moments of profound realism, declare that the words &ldquo;information technology&rdquo; should never be uttered by man. Instead, they should be replaced by a tetgramation such as the Hebrew: YHVH&mdash;the sacred word for the Ineffable Name of God. The implication being, that the phrase &ldquo;information technology&rdquo; connotes such as expanse of knowledge and is so totally incomprehensible that it is nearly a description of the Almighty Himself. Much merit may be seen in this allusion if one considers the actual expanse of the subject in comparison to the provincial concepts of some of its most ardent practitioners.
Developments in verification of design correctness (A Tutorial)
Authors: W. E. Cory, W. M. VanCleemput
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper reviews recent developments in the verification of digital systems designs. The emphasis is on proof of functional correctness. Some of the techniques reviewed are symbolic simulation (including parallel simulation of HDL descriptions), dataflow verification by grammar construction, comparison of manually generated design with automated design, and functional abstraction.
Space efficient algorithms for VLSI artwork analysis
Authors: Thomas G. Szymanski, Christopher J. Van Wyk
Venue: Proceedings of the 20th Design Automation Conference (1983)

We present algorithms for performing connectivity analysis, transistor identification, and boolean geometric operations with region numbering. Previous methods all require O(n) space where n is the number of edges in the circuit artwork; our method takes only O(@@@@n) space and can therefore handle circuits of any foreseeable size. Our algorithms are based on traditional scanline techniques in such a way that any implementation of our method will be at least as fast, as well as more compact. Statistics on one such implementation are presented.
Hierarchical language definition
Authors: Gregor V. Bochmann
Venue: Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems (1973)

This paper describes a project for the hierarchical definition and implementation of languages. In the spirit of structured programming [1] and in analogy to the hierarchical construction of operating systems [2,3] we define high level languages, which are suitable for the design of operating and other software systems, in several levels of abstraction. In particular, we describe in this paper how an intermediate, machine independent basic language can be used to express the actions of a given high level language in terms of simple actions of the basic language. In conjunction with a translator writing system, this allows a compact and readable formal definition of the syntax and semantics [4,5] of the high level language, which is in fact a description of the compiler which translates this language into the basic language. This definition is independent of a particular computer, however, an implementation of the basic language must be furnished. We intend to use the basic language to describe modules which are embedded in a general system for multiple processes. The language consists of a kind of macro instructions most of which can be implemented in a straight forward manner. Some more complicated instructions, such as primitives for inter-process communication, can be implemented through a hierarchical construction process [2,3] as indicated in section III (see also figure 1).
Hardware algorithms for nonnumeric computation
Authors: Amar Mukhopadhyay
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

This paper is concerned with the design of hardware algorithms for nonnumeric computation. The subset of nonnumeric operations considered is derived from string processing languages such as SNOBOL or high-level data base languages used in data base management architectures. It is shown that cellular hardware can be designed to perform these operations on-line while the data is accessed from a rotating secondary storage medium. Being uniformly structured, the hardware could be implemented using LSI technology yielding an estimated pattern matching rate of about 100 million characters/sec. The proposed nonnumeric processor will find applications in the environment of parallel (or associative) data base management architecture, processing of large unstructured textual files, as a stand-alone microprocessor in digital communications which need simple search and update operations, or as a nonnumeric CPU that can be used along with the conventional CPU to expedite string processing operations.
Automatic recognition of handwritten characters using structural features
Authors: J. Diane Pritchard, Norman E. Sondak
Venue: Proceedings of the ACM annual conference (1973)

A system has been developed to automatically recognize handwritten letters by means of a data base composed of structural features rather than the more common technique of physical matching. Each letter is first separated and then concatenated into the handwritten word itself. The data base associated with each letter is encoded as a binary matrix representing basic invariant structural features. Recognizing procedures, both parallel and sequential, determine the relational height of each letter and the word itself and the height and width of each letter. Extracted features, such as continuity, loops, ovals and circles, openness and bowls are searched for and analyzed. Initially, the procedure is parallel, but then a sequential search of extra features, determined by the results obtained, is conducted to arrive at the final decision. The system permits context-free recognition of individual letters, thus allowing use of the system in a wide range of applications, such as in the detection of abbreviations. In addition, the resource and execution times of the system are modest so that it can be implemented on a wide range of computing equipment. Testing the system then for recognizing the six letters&mdash;a, b, e, h, i, and l&mdash;indicated an overall accuracy of 93% which was competitive with results obtained by human readers.
A syntax-directed approach to automated aids for symbolic mathematics
Authors: Lewis C. Clapp
Venue: Proceedings of the first ACM symposium on Symbolic and algebraic manipulation (1966)

Designing a system for the analytic processing of mathematical functions around a central syntax processor and permitting the user to work within the context of mathematical syntax leads to a flexible system with a broad range of capabilities. One advantage to this approach is that the basic system can be developed without many a priori restrictions on the nature of the mathematical entities to be processed. Once the basic structure has been developed, the user is free to define and operate within his own system of mathematics by modifying or extending the syntax definitions. After the basic system has been developed, higher level operations such as those involving matrices or functions of a complex variable can be added to the existing structure, with a minimum of effort because of the flexibility inherent in the syntax-directed approach. A potential disadvantage to the syntax-directed approach is the length of time required to perform an operation if the processing is handled interpretively.
Automatic indexing
Authors: Gerard Salton
Venue: Proceedings of the ACM 1980 annual conference (1980)

In information retrieval and text processing systems the search requests and stored information items are normally represented by sets of content identifiers, known as keywords or index terms. The choice of effective indexing products designed accurately to reflect document content is by far the most crucial task in retrieval. A wide variety of automatic indexing theories and systems have been developed over the years based in part on the occurrence frequencies of individual terms in the documents of a collection, on the ability of specific terms to distinguish the documents from each other, and on the distribution of terms in the relevant as opposed to the nonrelevant items in a collection. These theories lead to the automatic generation of content identifiers consisting of individual terms, term phrases, and classes of terms, and to the assignment of term weights reflecting the relative importance of the terms for content representation. The various indexing theories are covered and analytical as well as experimental results are given to demonstrate their effectiveness.