ppxscal/embedding_network huggingface dataset:
Array diagrams and the Nial approach
Authors: Fl. Schmidt, M. A. Jenkins
Venue: ACM SIGAPL APL Quote Quad (1982)

The Nested Interactive Array Language, Nial, combines APL and LISP concepts and is based on the theory of nested rectangular arrays. Array theory provides a concise mathematical model of data capturing the essence of everyday data objects. Arrays are displayed by diagrams, which provide an easily comprehended way of communicating the rectangularity, nesting and content of arrays. A novel drawing technique is presented in which any array diagram can be drawn by combining only three kinds of primitive diagrams according to a few simple rules. The properties of the primitive diagrams and the consequences of the combinatorial rules are studied and exemplified.
Manufacturing
Authors: Manny Athavale
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The introductions are intended to highlight panel members' job responsibilities as they relate to manufacturing applications of simulation. In addition, a brief outline will be given on each IBM organization represented and how the panel members fit in it. The discussion will center on common issues faced by simulation practitioners in the manufacturing environment. Considerations include: the modeler's role in problem selection and formulation, data collection, and analysis; the trade-offs between &ldquo;generic&rdquo; and &ldquo;application specific&rdquo; models; the importance of statistical analysis; and the presentation, implementation, and measurement of modeling results.
The design of Star's Records Processing: Data processing for non-computer professionals
Authors: Robert Purvy, Jerry Farrell, Paul Klose
Venue: Proceedings of the SIGOA conference on Office information systems (1982)

Xerox' Star Professional Workstation is distinguished by a graphic user interface committed to the What-you-see-is-what-you-get design philosophy. The system promotes a see / point / push-a-button style of interaction with immediate feedback, in marked contrast to more familiar programming or command-language interfaces. Star's Records Processing feature integrates traditional data processing functionality into this user model. Normal Star documents may contain fields and tables. Star record files have their structure defined by copying the field structure of a regular document. Multiple output formats are provided for a record file by giving it a document with each desired format. Such a document may format multiple records in a tabular array, or present each record's data in a new copy of the formatting document. Data is transferred between documents and records wherever fields have matching names (&ldquo;field lading&rdquo;); non-matching fields may be given a fill-in rule which allows summary data to be computed. Queries are expressed in an exemplary fashion, by entering desired values and ranges of values into a copy of a record (a &ldquo;filter&rdquo;). Common uses of the data in a record file are encapsulated in a &ldquo;view&rdquo;, which specifies the subset of the file's records to be considered, the order in which they are to be presented, and the document to be used to format them. An arbitrary number of views may be associated with a record file; each may have its own index, but the underlying records are stored only once. Common records processing functions are provided at a high-level user interface: Moving a document, a folder of documents, or another record file to a record file adds records to the file. Moving a record file to a printer causes the current view of the record file to be printed. Benefits include an economy of concepts and effort for user and implementor alike, along with the synergy of a unified environment. The approach seems to extend easily to a number of new domains. However, increased efforts are required to produce a coordinated design and implementation throughout the whole system, and acceptable performance may be harder to achieve.
SIMPL/1: A simulation programming language
Authors: John W. Rettenmayer
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

SIMPL/1 is a set of SIMSCRIPT-like extensions to PL/1 which facilitate the direct expression of concepts inherent in discrete simulation programming. SIMPL/1 statements, which are intermixed with PL/1 statements in the source program and are syntactically compatible with PL/1, are translated into PL/1 code by a translator which is also written in PL/1. Completely dynamic treatment of entities, sets, and events is accomplished via PL/1 list processing using based variables. The paper also discusses some features unique to PL/1 itself which are particularly desirable and useful for simulation programming.
A distributed operating system for an educational microcomputer network
Authors: N. Solntseff
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The implementation of a network operating system designed to provide a shared disc-storage facility to a number of relatively small microcomputers is described. Communication is controlled by the central node of a star network in which small microcomputers form the peripheral nodes. The manner in which communication between the peripheral nodes and the central node is synchronized is described and the extent to which protection has to be provided is discussed. The system has been in use since January 1980.
Is certification and licensing a viable alternative to privacy legislation?
Authors: Jens P. Christensen
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

Our professional organizations and individual Data Processors must petition our various legislative bodies and convince them that the current pending privacy legislation is impractical. This task can be accomplished by letter campaigns, testimony in front of various committees, newspaper articles and other publicity which will communicate our objection to these laws and also present an alternative approach. It is the author's contention that one viable alternative is what has been presented in this paper. That is, a Data Processor will be permitted to practice his craft without any sort of certification - in fact, a certain amount of time should be spent in this apprentice stage.
EDUCOM'S planning council on computing in education and research
Authors: Joe B. Wyatt
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

EDUCOM attempts to facilitate sharing of computing resources through a variety of activities and services. One major EDUCOM effort to facilitate such resource sharing among colleges and universities is the Planning Council on Computing in Education and Research. This paper describes the formation of the Planning Council, activities and research projects now underway, and services which are or will be available to EDUCOM members and others as a result of these activities. Planning Council activities are based on the assumption that in a networking environment, most university computer users will continue to obtain services from local centers. Only unique and specialized services are likely to be obtained over a national network.
Position statement - CAD for VLSI
Authors: Sam Bala Daram
Venue: Proceedings of the 17th Design Automation Conference (1980)

VLSI has become a glamorous buzz-word, and much talk has centered on evolutionary and revolutionary solutions to the Computer Aided Design of VLSI circuits. Not being altogether cynical, one may venture to say that CAD for LSI enjoyed a priviledged position in the last decade, and perhaps still does. While CAD for LSI was still being discussed and written about, and while CAD experts attempted to solve the much talked about layout problem by offering, to an interconnect-capacitance limited technology, solutions such as standard cells and automated routing, the industry went ahead and solved the same problem by giving computer aids to manual layout techniques, through the introduction of turnkey graphic systems. In proposing new solutions, it is important to understand the role played by turnkey graphics in LSI production. The following essential ingredients need to be thought about and developed to design VLSI systems. &bull; A new look at chip architecture, with functional partitioning and allowing redundant logic to perform testing and self-correcting. Main frame architecture is already doing this. &bull; Logic design data-base in the form of functional descriptions, as well as Boolean equations approximating transistor level representation that can be compared to logic representation extracted from chip topology. &bull; An encoded method of representing layout, such as symbolic or stick methods, combined with optimized manual layout methods. &bull; Presently available tools such as logic, fault, functional and circuit simulators updated to handle VLSI complexities. &bull; An engineering oriented and owned Distributed Data Processing system with free access via terminals so that engineers, and not necessarily CAD programmers, can come up with innovative solutions to CAD problems.
RM: A resource-sharing system for personal computers
Authors: Rita C. Summers, Christopher Wood, John M. Marberg, Mostafa Ebrahimi, Kenneth J. Perry, Uri Zernik
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

With the recent advances in personal computer technology, time-sharing of a processor is no longer a necessity; each user can have his own machine. It is valuable, however, to share resources among the individual machines. This paper discusses a system structure for interactive computing in which personal computers are connected by a local-area network for the purpose of resource sharing, and describes an experimental prototype that is being implemented using the IBM Personal Computer.
Philco model 212 computer efficiency through simultaneous operations
Authors: Ray Gollub
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

An idle system element or component reduces the efficiency of its associated system by not doing the work of which it is potentially capable. An ideal system, from a hardware efficiency viewpoint, would be one in which all of the elements are working all of the time. For practical systems, a measure of its hardware efficiency may be made by taking an average of the portion of the time each element in the system is working, weighted according to the size or cost of each such element. During the development of the current Philco 2000 System (preceding the design of the Model 212 Computer), a number of design features were incorporated which produced a highly efficient system according to the above criterion. The more important of these features are: 1. The self-timing (&ldquo;asynchronous&rdquo;) nature of the Model 210 and 211 Computers tend to eliminate any idle time waiting for clocking pulses. 2. The computer continues to operate while input-output traffic occurs. 3. The input-output subsystem itself may have a number of independent simultaneous operations occurring. For example (depending on the prowess of the programmer) up to four tape read or write actions, on-line printing, card and/or paper tape reading and/or punching may all occur at once. 4. The more recent core storage facility is divided into four banks so that cycles may overlap each other.
Synthetic texturing using digital filters
Authors: Eliot A. Feibush, Marc Levoy, Robert L. Cook
Venue: Proceedings of the 7th annual conference on Computer graphics and interactive techniques (1980)

Aliasing artifacts are eliminated from computer generated images of textured polygons by equivalently filtering both the texture and the edges of the polygons. Different filters can be easily compared because the weighting functions that define the shape of the filters are pre-computed and stored in lookup tables. A polygon subdivision algorithm removes the hidden surfaces so that the polygons are rendered sequentially to minimize accessing the texture definition files. An implementation of the texture rendering procedure is described.
An approximation algorithm for manhattan routing
Authors: Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

A linear-time approximation algorithm for routing multipoint net channels is presented. The algorithm uses at most a constant factor times the optimal number of tracks required. The notion of channel fluxis introduced and shown, like channel density, to be a lower bound for channel width. Every multipoint net channel having density d and flux f is routed within 2d+O(f) tracks, and every two-point net channel within d+O(f) tracks. Since the flux never exceeds &thgr;(@@@@n), this proves a conjecture of Brown and Rivest [6] that every n-net channel can be routed in O(d+@@@@n) tracks. In practice, it appears that the flux never exceeds a small constant. In this case the algorithm performs asymptotically better than the best-known knock-knee algorithm [21], and almost as well as the best-known three-layer algorithm [19], without requiring the use of either knock-knees or three layers of interconnect. In addition, the three-parameter model, which is closer to the design rules of current fabrication technologies, is presented. Under this model, it is shown that every channel can be routed using 2d+O(1) tracks.
Geographic base files and the world of Polk
Authors: Morton A Meyer
Venue: Proceedings of the ACM 1980 annual conference (1980)

Despite the fact that R. L. Polk Co. is an international organization operating in western Europe, Canada and Australia as well as the United States, and has been a going and growing concern for close to 110 years, it is highly probable that most members of ACM have never heard of us. The reason, of course, is very simple. Each organization impinges only very lightly on the interests of the other. There are three divisions within Polk which rely upon computerized geographic base files for geocoding their products to cities and their sub-areas, that is census tracts or block groups and very important-user defined areas such as neighborhoods, traffic zones and councilmanic districts.
Automatic Segmentation of Microaneurysms in Retinal Angiograms of Diabetic Patients
Authors: A. M. Mendonça, A. J. Campilho, J. M. Nunes
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

In this paper a method for automatic detection of Micro-aneurysms in digital angiograms of the eye fundus is described. These lesions of the human retina, a characteristic of the earliest phases of diabetic retinopathy, present themselves in the angiographic images as small, round, hyper-fluorescent objects. The proposed method includes initial pre-processing and enhancement steps, followed by object segmentation. In the final phase, micro-aneurysms are validated using two new criteria based on local intensity, contrast and shape relations. The combination of these local features with global image parameters makes possible a high degree of independence from image intensity characteristics.
Hardware support for automatic routing
Authors: E. Damm, H. Gethöffer, K. Kaiser, E. Damm GmbH
Venue: Proceedings of the 19th Design Automation Conference (1982)

A system for automatic routing based on an iterative application of Lee's algorithm is presented. An extended cell admissibility is defined for continuous design rules in coarse rectangular grids. Combined hardware and software design strategies are applied towards the definition of data structures and their kernel primitives for automatic routing. The hardware architecture and the implementation of specific structures are discussed. The resulting extended routing unit is used in a CAD system. Thus the throughput of the iterative router is improved by a factor of 5 compared to the equivalent software process. Finally the architecture of a high speed stand-alone routing processor is presented.
Computational complexity of probabilistic Turing machines
Authors: John T. Gill,  III
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

Probabilistic Turing machines are Turing machines with the ability to flip coins in order to make random decisions. We allow probabilistic Turing machines small but nonzero error probability in computing number-theoretic functions. An example is given of a function computable more quickly by probabilistic Turing machines than by deterministic Turing machines. It is shown how probabilistic linear-bounded automata can simulate nondeterministic linear-bounded automata.
Computer assisted wargaming at the air university
Authors: Richard P. Smith
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

With the recent advances in computer and display technology, we are convinced that the professional military education (PME) program within the Air Force is at a point where education and training of our warfighting leadership can be dramatically enhanced through the use of a computer-assisted wargaming system. This paper presents a brief background on the Air University (AU), surfaces the need for an improved wargaming capability, discusses five wargaming models, identifies shortfalls in our existing capability, reviews desired capabilities, and discusses programming action for obtaining a new wargaming system.
Module positioning algorithms for rectilinear macrocell assemblies
Authors: Jack A. Hudson, John A. Wisniewski, Randy C. Peters
Venue: Proceedings of the 21st Design Automation Conference (1984)

A completely hierarchical approach to integrated circuit design begins by partitioning a design problem into subproblems which are based on functional boundaries. It is desirable to produce a final layout which is compact, yet preserves the functional decomposition. Allowing the physical macrocells to have arbitrary rectilinear shapes permits this goal to be achieved but introduces many levels of complexity into the modeling of the assembly. To support macrocells with rectilinear shapes, a directed graph, referred to as an adjacency graph is used to model the positional relationship of the components in the assembly. Algorithms are presented for constructing the adjacency graphs, identifying the cycles present in the adjacency graph, converting the graph to an acyclic graph, and for establishing the component and channel positions based on a critical path analysis. These algorithms are implemented in Pascal on a DECSYSTEM-20.
A virtual circuit switch as the basis for distributed systems
Authors: G. W.R. Luderer, H. Che, W. T. Marshall
Venue: Proceedings of the seventh symposium on Data communications (1981)

A communication system is presented which consists of a switch (Datakit [Fraser 1979]) with associated control and interface hardware and software. The switch offers virtual circuit service which is internally implemented through packet switching. The users of the communication system are operating systems; using our communication system, we have implemented a network of UNIXTM systems and a new distributed operating system derived from UNIX. Our work concentrated on the performance of the subscriber-switch interface; on the reliability and recoverability of the switching service; and on the exploitation of the circuit concept for operating system design.
File structures and access methods for a geographic information retrieval system
Authors: James L. Parker
Venue: Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control (1972)

This paper describes the file structures and access methods being used in the Geographic Data System of the Natural Information Systems Project at the University of British Columbia. These structures are designed to support a general input-output framework which is the foundation of each of the primary functions of the system. The paper outlines the basic functions of such a system and also the characteristics of geographic data which are unique. This produces a list of requirements for file structures and access methods. The paper describes the file structures and access methods chosen and also explains the ways in which the requirements are satisfied. The rules for the system are that it be easy to use, easy to expand and evolve, and interactive. This paper should be of interest because the structures and problems themselves are interesting, but also because more general principles of data manipulation can be extracted from the experience here. The majority of commercial installations are now considering interactive information manipulation of one form or another because of the rapidly changing equipment technology. In order to be useful, natural information systems appear to demand higher sophistication in their information manipulation than the standard commercial installation at its current stage of development. However the sophistication of the average shop is increasing rapidly, and the principles described in this paper are probably representative of problems which will be faced by many organizations in the near future. These broader considerations are outlined at the end of the paper.
An introductory COBOL course with structured programming
Authors: Asad Khailany
Venue: ACM SIGCUE Outlook (1976)

ORIS 316 was designed as a core course to teach COBOL programming language and Business Information Systems to students majoring in Business Computer Information Systems. Students from other areas such as Mathematics, Computer Science, Sociology, Economics, Political Science, Marketing, Accounting, Management, etc., take this course to enhance their employment opportunities. Most of the students who take this course have some knowledge of some computer programming language, especially in FORTRAN. In the last four years, I have taught this course eight times. In the beginning, perhaps like many other instructors have done, I took the normal path to teach this course. This path was more or less influenced or determined by some textbooks or manual references. These text and manual references have different approaches; however, to teach the COBOL language, all of them agree on one point, namely, to present the PERFORM statement, the tool of structured programming in COBOL, in the late sections of their texts. And of those sources which I'm familiar with, none had the structured programming approach. Because of the popularity of structured programming especially in the business data processing environment, and since many of our students start their professional work as a programmer or as a systems analyst, it was determined that the structured programming technique and modular programming concept should be introduced as early as possible in the semester. This has been done in the last three offerings of the course and the results have been impressive. Students' evaluations of the same instructor and the same course were considerably higher than before and their response to the new approach has been encouraging.