ppxscal/embedding_network huggingface dataset:
The Cambridge project's consistent system
Authors: Douwe B. Yntema, Arthur P. Dempster, John P. Gilbert, John C. Klensin, Wren M. McMains, William Porter, Jeffrey P. Stamen, Raymond A. Wiesen
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

One of the main goals of the Cambridge Project is a Consistent System of programs, data, and models for use in the behavioral sciences. A framework for the System has been constructed on the Multics time-sharing system at M.I.T., and a collection of programs has begun to accumulate within it. This session will be devoted to that framework and to three examples of subsystems that are being fitted into it. They will be described briefly, and the reasons why they are expected to be more useful when surrounded by the rest of the Consistent System will be discussed.
A statistical method for test sequence evaluation*
Authors: Glenn R. Case
Venue: Proceedings of the 12th Design Automation Conference (1975)

A method for test sequence evaluation based on random sampling of detectable faults is presented. This method can be incorporated into most logic simulation codes which use the parallel machine method of fault detection.
An overview of the ECL programming system
Authors: Ben Wegbreit
Venue: ACM SIGPLAN Notices (1971)

The ECL programming system has been designed as a tool for tackling 'difficult' programming projects. That is projects on which existing languages could be used only with considerable waste in machine or programmer time. Such projects include much of the frontier of computer technology; whenever several application areas are conjoined and whenever solution of a problem requires linguistic development&mdash;in algorithmic notation or information structures. Examples range from the management of large scale distributed data bases to applied artificial intelligence.
Modeling a satellite experiment on APL
Authors: Charles D. Wende
Venue: Proceedings of the fourth international conference on APL (1972)

This is a study of the charged particle measurements experiment (CPME) which will be flown on the IMP-H and IMP-J satellites. This experiment, although primarily intended to measure charged particles, contains detectors which are also sensitive to solar and galactac X-rays. Considerations aimed at optimizing the resulting X-ray data will be discussed, followed by a description of the technique used to unfold the intensities of individual X-ray stars from the data. Dummy data were generated from published X-ray star catalogs and used to test this analysis technique. Of particular interest to APL users are the storage/ retrieval of data packed as binary words of arbitrary length (to save room in core) and the programming, in APL, of the multiple linear-regression technique described by Bevington in his Data Reduction and Error Analysis for the Physical Sciences.
On the performance of slotted ALOHA in a spread spectrum environment
Authors: Panos Economopoulos, Mart L. Molle
Venue: Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials symposium (1984)

We present an extension of the slotted ALOHA protocol for use in a spread spectrum packet radio environment. With spread spectrum, we assume that N distinct codes are available, and that each code can be treated as a separate channel. Running an independent copy of the protocol on each of these channels would be undesirable, since each user would have to select one channel to monitor for packets addressed to it, inducing a logical partitioning of the user population into N groups. To preserve the logical connectivity of the network, we examine the effect of separating packet transmissions into two parts, a short preamble, which is sent over a public channel, and followed by the body,> which is sent over a private channel. We assume that m of the available codes are used as preamble channels, and the remaining N - m codes are used for actual packet transmissions. If m (@@@@) N, then the network can support broadcast and multicast packets, and still make use of all of the available channels.
Gateway: A Message Hub with Store-and-Forward Messaging in Mobile Networks
Authors: Eiko Yoneki, Jean Bacon
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

To obtain good performance in messaging over mobile networks, we have developed a Gateway. Gateway is a message hub that transmits information using store-and-forward messaging and provides powerful optimization and data transformation. The SmartCaching component provides generic caching in an N-tier architecture, an essential function of Gateway. Gateway can be integrated into Pronto, a middleware system for mobile applicationswith messaging as a basis [15]. Pronto then offers: 1) a lightweight client of Message Oriented Middleware (MOM) based on Java Message Service(JMS), 2) Gateway for reliable and efficient transmission between mobile devices and a server, and 3) Serverless JMS based on IP multicast. Integration of Gateway within Pronto provides a solution for mobile application-specific problems such as resource constraints, network characteristics, and data optimization.
The use of examples in program construction and debugging
Authors: Alan W. Biermann
Venue: Proceedings of the 1975 annual conference (1975)

Techniques are described for automatically creating a computer program from example calculations which are done in scratch pad fashion at a computer display. The correct program is synthesized even though certain indexing instructions are omitted by the user as he executes the sample calculation. The created program can be tested, debugged, and modified by running examples at the display terminal, observing the program behavior, and forcing by hand a change in behavior if errors are observed. Thus programs can be created, debugged, and modified without the user ever knowing or seeing any traditional language syntax. Most of the methods discussed have been programmed and tested extensively.
Research needs in the next decade
Authors: Robert Reinstedt
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

When faced with the topic of what the thrust of research might be in the next decade it becomes very quickly evident that it is easier to pick one research effort, design it, gather and process the data and report on it than it is to look into the future through a cloudy crystal ball and see much besides fog. What motivates one to keep looking (aside from the fact that a speech has been promised on the subject) is the optimist's syndrome or, for those of you who are familiar with the story, &ldquo;I know there's a pony around here somewhere&rdquo; That &ldquo;there is research around here somewhere&rdquo; is really not in doubt, but what shape it will take and the specific direction it will take in the next decade is a matter which does indeed require more attention. Some of the concomitant questions must also be addressed. My talk today might be viewed as analogous to planning a curriculum; this is an essential part of the educational system.
Multiresolution model development for overlapping trees via canonical correlation analysis
Authors: P. W. Fieguth, W. W. Irving, A. S. Willsky
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

A class of multiscale stochastic models has been introduced in which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a tree. One of the primary reasons the framework is useful is that it leads to an extremely fast, statistically optimal algorithm for least-squares estimation in the context of 2-D images. We refine this approach to estimation by eliminating the visually distracting blockiness that has been observed in the previous work. We eliminate the blockiness by discarding the standard assumption that distinct nodes at a given level of our tree correspond to disjoint portions of the image domain; as a consequence of this simple idea, a given image pixel may now correspond to several tree nodes. We develop tools for systematically building overlapping-tree multiscale representations of prespecified statistics, and we develop a corresponding estimation algorithm for this processes. In this way, we achieve nearly optimal estimation results, we generate corresponding error covariance information, and we eliminate blockiness without sacrificing the resolution of fine-scale detail.
An artwork design verification system
Authors: H. S. Baird, Y. E. Cho
Venue: Proceedings of the 12th Design Automation Conference (1975)

Manual and semi-automatic methods of Integrated circuit layout are prone to errors which are often detected only after a sample chip has been fabricated. This paper describes two design verification programs that detect and identify such errors earlier in the design cycle through comparing a designer's logic description with the finished mask artwork. These programs are part of an integrated CAD system developed at RCA laboratories.
A multiprogramming operating system for the TI980A
Authors: Henry R. Bauer,  III, Gary D. Thomas, Jeffrey VanBaalen
Venue: Proceedings of the 1976 annual conference (1976)

The University of Wyoming Computer Science Department has developed several versions of a multiprogramming operating system for research and for student use. This paper describes the background of the systems and the hardware facilities available. Major emphasis is placed on the message driven system and implementation problems presented by the hardware. The description includes the core-resident nucleus, the input/output communications, the file system and the high-level operating system.
An approach to compiler correctness
Authors: Laurian M. Chirica, David F. Martin
Venue: Proceedings of the international conference on Reliable software (1975)

This paper is a preliminary report on an experiment in applying Floyd's method of inductive assertions to the compiler correctness problem. Practical postfix translators are considered, and the semantics of source and object languages are characterized by Floyd verification conditions. Compiler correctness proofs are partitioned into two parts. The first part deals with proofs of the syntactic and translational phase of compilation, and generates semantic equivalence theorems which are proved in the second part. These techniques are illustrated by a small example.
Naive user behavior in a restricted interactive command environment (abstract only)
Authors: Allan G. Haggett, John R. McFadden, Peter R. Newsted
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - II): Human interface and the user interface - Volume 1981 (1981)

Results are reported showing the changing pattern of command use by introductory business data processing students. Using the ability of the University of Calgary's Honeywell Multics Operating System to tailor a command and response environment, a subset of commands and responses (called GENIE) was set up in a user-friendly environment to facilitate novice students programming at CRT terminals. Frequency and time of usage of all commands was metered and changing patterns of usage emerged as the semester progressed. For example, "help" usage -- which was originally quite extensive and broad -- limited itself over time to questions only about specific topics. Reluctance to use an "audit" facility to capture an interactive session disappeared as the commands for such usage were likened to a movie camera taking pictures over a student's shoulder. It is further noted that specific emphasis was placed on simplifying commands and reducing options.The whole idea of a restricted command environment is compared to the "abstract machine" concept of Hopper, Kugler, and Unger who are building a universal command and response language (NICOLA, a NIce Standard COmmand LAnguage). GENIE is seen as an example of what such an abstract machine could be if the Multics operating system were viewed as a basic or "parent" abstract machine. Interactive environments such as Multics provides are viewed as essential to providing a satisfactory timesharing system for the various, but frequently intermittent uses, in the social sciences.
A technology independent MOS multiplier generator
Authors: Kung-chao Chu, Ramautar Sharma
Venue: Proceedings of the 21st Design Automation Conference (1984)

A layout generator for technology independent implementation of the MOS multiplier is described. The modified Booth's algorithm with a structured floor plan has been used. The layout has been optimized and described as a program in a high level layout language. The fabrication process related information is maintained in a separate technology database that is coupled with the layout program at the time of execution to generate the mask data. The user can choose from a variety of architectures for speed, area, and power trade-off's. The user can also specify geometric and electrical constraints tailored to his system specification.
An integrated model of drilling vessel operations
Authors: Susan E. Hoffman, Melba M. Crawford, James R. Wilson
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A combined discrete-event/continuous/process-interaction simulation model has been developed to evaluate the effects of weather and supply-ship availability on off-shore drilling operations at a specified location and time of year with a specified drilling vessel. The continuous submodel includes: (a) autoregressive-moving average and transfer-function models to represent weather conditions; (b) a difference equation to monitor effective work time for the current operation on the drilling vessel; (c) difference equations to govern supply levels on all vessels; (d) state-events to stop and restart operations on all vessels; and (e) difference equations to control the movement of supply ships. The process-interaction submodel represents the flow of supply-ship traffic and the overall operation of the drilling vessel. The discrete-event submodel controls the loading and unloading of supply ships as well as the alternation of periods of calm and stormy weather.
Simulation of New York city's felony adjudicatory system
Authors: Lucius J. Riccio
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A simulation model is described in this paper that was part of an analysis of New York City's Grand Juries and Supreme Courts. It has been used to test the relationship between additional court resources and the length of delay in the courts and the number of defendants in detention facilities.
Teaching software engineering in the adult education environment
Authors: Steven M. Jacobs
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

Teaching the evolving subject of software engineering has only recently been explored in the literature within the last five years. In a university-level, evening school environment, problems in the area of software engineering education arise due to 1) the quantity and approach of introducing software engineering concepts and 2) the background and motivation of the students. Working adults can be introduced to the components of the software life-cycle by a careful selection of reading assignments, lectures, discussion, and a team programming project. This paper addresses the problems associated with software engineering in adult education and presents a working solution.
Storage requirements for deterministic / polynomial time recognizable languages
Authors: Stephen Cook, Ravi Sethi
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

A striking example of practical tradeoffs between storage space and execution time is provided by the IBM 1401 Fortran compiler. On another level, there is an interesting relation between the time and storage required to recognize context free languages. The recognition algorithm in [Y] requires time no more than 0(n3), but requires at least linear storage, whereas the algorithm in [LI requires recognition space no more than 0((log n)2) and requires more than polynomial time. An intriguing question is whether (log n)2 space is enough to recognize all languages recognizable in deterministic polynomial time. The above question has been narrowed down in [C] to the storage required to recognize a particular language called SP. This paper presents further evidence in support of the conjecture that SP cannot be recognized using storage (log n)k for any k. In section 2 we consider a game on directed acyclic graphs (dags) and show that at least 0(n1/4) markers are needed to play the game on some n node dags. The 0(n1/4) bound is used in section 3 to show that a fairly general machine to recognize SP also requires 0(n1/4) storage.
Simulation of urban growth as a function of accessibility
Authors: Donald T. Fairburn
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

A new computer oriented method for forecasting land use in an urban area is presented in this study. The street system is described as an arc-node network and extrapolation from past tendencies is performed with the aid of a probabilistic mapping of accessibility. It is thereby possible to consider more than one attraction activity, and to describe the size and shape of an activity rather than dealing with it as a single point. The street system is treated as the primary parameter in the model with the ability to change the network and the location of attraction activities. To illustrate the method, East Syracuse, New York, was studied to determine the necessary data and parametric values needed for forecasting. Forecasts were conducted with a variety of parametric specifications. The result of each forecast is presented in the form of a computer printed land use map and table of land use activity. These maps indicate that the method provides rational forecasts with the inherent speed and flexibility of a computer model.
Queueing in a memory-shared computer*
Authors: D. Fife, R. Rosenberg
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Multiple console, shared digital computers represent a new concept in computer design, in which emphasis is placed on ease of user communication with the machine, and rapid machine response to commands. A complete description of machine response characteristics must include the statistical behavior brought about by queues in the system. The numerical solution of a complex queueing model is one way of predicting the statistical response characteristics, and models incorporating a good deal of realism can be rapidly solved. To illustrate this viewpoint in a simple way, a queueing model has been developed for a multi-console computer with a multiply shared memory. The relation of the model to a physical system is described in detail, and the numerical solutions discussed. 50
The structure of abstract document objects
Authors: Gary D. Kimura, Alan C. Shaw
Venue: Proceedings of the second ACM-SIGOA conference on Office information systems (1984)

Underlying every document processing system is a model of the document. For many applications a simple model, such as a long string of characters, is adequate. However, more expressive models are desirable for more demanding applications that involve complex textual material and also nontextual objects, such as mathematical notation, tables, and figures. In this paper we present an expressive model, suitable for paper and electronic documents, that is based on a graph-like structure. The principal concepts are the notions of abstract and concrete objects, hierarchical composition of ordered and unordered objects, sharing of components, and reference links. This model has proven useful for specifying a wide variety of document objects, and is the basis for an implemented document preparation system.
System for Heuristic and Rapid Processing of Component Layout and Wiring (SHARPCLAW)
Authors: Stephen J Urban, Neil C Randall, Thomas J Harley
Venue: Proceedings of the 1971 26th annual conference (1971)

A computer-aided design system for layout of printed wiring boards is described, with emphasis on component placement and conductor routing algorithms. The system is designed to operate with a data base; placement and routing may be accomplished automatically using force field techniques and a maze-following procedure, or manually with extensive error checking by the computer. Examples of the system output are given.
Design data base configuration control
Authors: Herbert M. Emich
Venue: Proceedings of the 10th Design Automation Workshop (1973)

IBM rarely builds two machines that are exactly alike. Two machines of the same model, for example, will almost always differ because one has an engineering change, feature (i.e., a design variation) etc., not on the other. Therefore, the ability to record and select the proper data for any combination of design variations is an important part of a design automation system. This process is sometimes called configuration control. This paper describes a method of recording such design variations. Arbitrary relationships among the design variations are permitted, allowing them to be combined as necessary. The history of each design variation, as it changes through time, can also be recorded.
Lexicon-driven word recognition
Authors: Chien-Huei Chen
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

Most conventional document understanding systems use lexicons only in a postprocessing step to verify or correct character recognition results. The authors present a new approach to word recognition that uses a lexicon to "drive" the recognition process. Lexicon words are encoded in trie data structures, and recognition of a word image is done by searching a lexicon trie for a path whose node characters yield the best match to the word image. This approach has two important advantages. First, it is segmentation-free; there is no need to presegment the text image into isolated characters. Second, it performs recognition by verifying character hypotheses, as opposed to the classification method used in most conventional optical character recognition (OCR) systems. Hence, the recognition process is more efficient and the results are more accurate. They demonstrated the feasibility and the advantage of this approach with a lexicon size of more than 50000 words, on severely degraded images.
Content analysis of APL defined functions
Authors: Harvey W. Bingham
Venue: Proceedings of seventh international conference on APL (1975)

The content of defined functions in 51 APL workspaces are analyzed. The static content, rather than dynamic usage, is given. The two source APL systems were Burroughs APL/700 and IBM APL/360 XM6. This data identifies those portions of the APL language that actually appear in workspaces.