ppxscal/embedding_network huggingface dataset:
LAMP: Language for active message protocols
Authors: Paul S. Licker
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

Among the most prominent aspects of office automation is the concept of electronic mail. Despite the fact that numerous &ldquo;Office of the Future&" descriptions seem to focus upon electronic mail as a great opportunity, seldom is it treated as a phenomenon in its own right rather than product. More often it seems to be a technological byproduct, available to counter certain specific business ailments, most notably the inefficiency of transportation of packaged messages. Despite the obvious advantages of E-mail, it is not seen as either essential to office of the future as a concept or as theoretically interesting to researchers. Several commentators, however, have pointed out that messaging may be an alternative form of interpersonal communication (See Bair [l]), without especially treating messaging as a core concept in office automation. This paper proposes to open the debate, not into the technical or behavioral feasibility of E-mail or the other messaging manifestations, nor into the economic benefits of implementation, but rather into the foundations of pre-programmed, non-real-time verbal interaction (printed and oral) as a general phenomenon.
Spatio-Temporal Unified Model for On-Line Handwritten Chinese Character Recognition
Authors: Jing Zheng, Xiaoqing Ding, Youshou Wu, Zhan Lu
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper presents a novel spatio-temporal modeling method for on-line handwritten Chinese character recognition. In this method, a statistical structure model (SSM) is used to describe the structural feature of Chinese character from probabilistic aspect, and an improved hidden Markov model (PCHMM) is employed to capture temporal information contained in ink. These two models are combined closely leading to a powerful spatio-temporal unified model (STUM), which has shown strong description ability and resulted in superior performance in the experiments where traditional models such as HMM (Hidden Markov Model) and ARG (Attributed Relational Graph) are also introduced and compared.
Computer aids for the design of manufacturable microcomputer-based systems
Authors: Lawrence A. O'Neill
Venue: Proceedings of the Symposium on Design Automation and Microprocessors (1977)

A potentially unfamiliar set of problems is posed to the engineer seeking to achieve a short schedule in getting a system containing a microcomputer into production. Many of these problems can be ameliorated by computer aids that simplify the design tasks and provide for the generation of manufacturing information. A set of programs currently being used to automatically wire models, generate acceptance and diagnosis tests and verify the correctness of the printed circuit layouts will be described. With these aids, the time required to develop manufacturing information is reduced, accuracy is ensured and the number of expensive redesigns reduced. Some testing and documentation problems that are currently under study will be presented.
High level data management for the problem solver
Authors: Stuart G. Greenberg
Venue: Proceedings of the eighth international conference on APL (1976)

An APL version of an information retrieval system used for numerical taxonomy, is shown to have properties suitable for data management by APL users. The data model is that of a table whose columns are named by descriptors, and the data manipulation language is English-like. Statements in the language are strings of executable APL functions with intervening arguments, thus avoiding the limitation in extensibility of non-procedural query languages. Boolean selection predicates are generalized to include executable APL expressions. The system features are presented in detail and extensions are discussed.
Computers aid index and glossary preparation
Authors: Ivan Flores
Venue: Proceedings of the 1st annual international conference on Systems documentation (1982)

I have written many books but only in the past two years have I had available my own computer and word processor. Now I find the word processor indispensible to my writing endeavors. But my computer can do more than just compose the manuscript. It can help me to compile and organize indexes and glossaries. I have just finished three books and I got assistance from my computer on all of them for the indexes. There are four kinds of things my computer does for me: 1. extracts information directly from the manuscript, providing important words I might want to index; 2. helps me to make an index file; 3. puts this file in alphabetic order; 4. prints out the index in the desired format. Some of the help I get is from program packages which I purchase. Other help I get from BASIC programs which I have written to assist me further. I have not seen many articles which describe how to combine purchased software with your programs to facilitate a unified activity. First I will describe the system that I have and how I am using it. Then I will tell you what I wanted done in terms of indexes. Finally I will give you the details of the programs I have written and how I use the packages that you can buy.
Comments on a linear paging model
Authors: Peter J. Denning
Venue: Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation (1974)

The linear approximation relating mean time between page transfers between levels of memory, as reported by Saltzer for Multics, is examined. It is tentatively concluded that this approximation is untenable for main memory, especially under working set policies; and that the linearity of the data for the drum reflects the behavior of the Multics scheduler for background jobs, not the behavior of programs.
Application of the cluster approximation for the simultaneous restoration and segmentation of tomographic images
Authors: Chi-hsin Wu, P. C. Doerschuk
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

We describe a Bayesian restoration and segmentation algorithm based on a pixel-line Markov random field and using an efficient approximation based on locality of interactions. A medical tomography example is given.
Sigops(Paper Session)
Authors: David Cheriton, Steven S. Muchnick, Hasan H. Sayani, Robert Trueman Tomlinson
Venue: Proceedings of the 1976 annual conference (1976)

Operating system command languages are addressed at the design level with the man-machine interface receiving considerable attention. Special attention is directed toward command languages for timesharing computer systems, again with emphasis placed on the interactions between the individual terminal user and the timesharing computer system. The papers addressing timesharing command languages identify several features important to the ongoing standardization efforts in this key area. In addition, the session contains a paper describing a high level language approach toward job control languages.
The solution of simultaneous nonlinear equations
Authors: Kenneth M. Brown, Samuel D. Conte
Venue: Proceedings of the 1967 22nd national conference (1967)

In this paper we present an algorithm for the numerical solution of (1.1) which is quadratically convergent and requires only (N2/2 + 3N/2) function evaluations per iterative step as compared with (N2 + N) evaluations for Newton's Method. Brown [1] has formalized the algorithm in terms of an iteration function [1, pp. 8-9] and proved that the method converges locally and that the convergence is quadratic in nature [1, pp. 21-32]. Computer results, obtained by applying an ALGOL procedure based on the method to some specific nonlinear systems, are included and a comparison is made with some of the better recent methods as well as with the classical Newton's Method; these results illustrate the quadratic convergence of the method.
Computer aided design college of architecture University of Kentucky
Authors: Michael Kennedy
Venue: Proceedings of the 14th Design Automation Conference (1977)

The University of Kentucky College of Architecture has had a program in computer applications to architecture since 1967. Because (1) UK's program is an undergraduate one (5 year, B. Arch) and (2) the level of funding has been low (.5 to 1.0 full time equivalent faculty assigned to the program) the emphasis is on teaching fundamentals. Originally the program had only one elective course available to upper classmen and consisted primarily of ad hoc applications of computers to the architectural programming, design and construction process. Fortran and plotter graphics material composed about 2/3's the semester's work with the remainder devoted to space planning, multiple solution generation, problem decomposition, structural, acoustical, and critical path exercises.
On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits
Authors: Miguel A. Marin
Venue: Proceedings of the 5th annual Design Automation Workshop (1968)

The synthesis of combinational or switching circuits is a major task in digital computer design. Somewhere along the design process a set of Boolean (logical) equations are stated by the designer which describe the properties of the digital system. The designer is then faced with the task of implementing this set of equations using, in general, a restricted inventory of integrated circuits which constitute the basic building blocks. The structure of this inventory imposes restrictions on the use of the commonly known AND-OR two-level logical circuit design techniques, such as Quine-McCluskey, etc., because if followed, the synthesis thus obtained is not necessarily the optimum with respect to the particular inventory. A question, therefore arises how to proceed or what general method should be followed to synthesize a given Boolean Function using any general building block, and what are the conditions under which this task is possible with the given particular inventory? First, the inventory should be adequate. This means that the set of available integrated circuits should be such that any given Boolean Function can be synthesized. Second, the synthesis algorithm to be followed should be independent of the complexity or simplicity of the used inventory. Third, the number of steps of the algorithm should be finite and a certain criterion of &ldquo;optimum&rdquo; should be followed at the different steps to satisfy the specific designer's constraints. In this paper we introduce a general algorithm which satisfies the requirements mentioned above and produces an adequate implementation of a logical net (without feedback) provided the designer establishes an &ldquo;adequate&rdquo; set of design criteria.
NUMETH a user oriented programming system for interactive application of numerical methods
Authors: Klaus Kilberth
Venue: ACM SIGAPL APL Quote Quad (1982)

NUMETH is a self-explanatory dialog system, based on APL, which was developed at the Zentralinstitut f&uuml;r Angewandte Mathematik of the Kernforschungsanlage J&uuml;lich. The purpose of this system is to provide an easy access to numerical methods for the handling of experimental data even to users less experienced in mathematics or in programming. Concept and several components of NUMETH are presented.
Simulation of a distributed system for performance modelling
Authors: David A. Bennett, Christopher A. Landauer
Venue: Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems (1979)

A distributed system of cooperating minicomputers is simulated by AIMER (Automatic Integration of Multiple Element Radars) to model and analyze the behavior of a radar tracking system. Simulation is applied in the AIMER project in an attempt to model a network of minicomputers to discover a maximally flexible network architecture. Because building the tracking system out of real hardware would not result in a flexible enough testbed system, the proposed configuration is represented by a software emulation. The instruction sets of the individual processors are emulated in order to allow separation of the measurement facilities from the execution of the system. The emulation is supported by a Nano-data QM-1 micro and nano-programmable host. Extensive performance monitoring hooks have been built into the emulation system which allow small performance perturbations to become visible. The tracking network is controlled by a combination firmware operating system and a special emulated virtual control machine. The tracking algorithms run on virtual machines whose instruction sets and computational throughput can be parameterized when the model is generated, or dynamically by an operator during a run. The radar and ground truth environments for the tracking system are simulated with logic resident in one of the emulated machines, allowing these functions to be monitored as accurately as the tracking algorithms. The use of this simulation technique has resulted in an extremely flexible testbed for the development of distributed radar tracking system models. The testbed itself can be quickly tailored to other application problems.
Computer science in the Air Force Academy core curriculum
Authors: Kenneth L. Krause, Robert E. Sampsell, Samuel L. Grier
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

At last year's SIGCSE Technical Symposium on Computer Science Education, we were struck by three things. First, many people were struggling with how to best teach introductory computer science to a population that is predominantly not potential computer science majors (1). Second, there is great value in the exchange of information about how we are attacking the problem, why we chose this path, and how we feel it's working (2). Third, motivation is a key element in learning (3). Many things we heard last year acted as a catalyst for us to make some changes in the core computer science course (Comp Sci 100) at the Air Force Academy. In this paper, we discuss these changes and offer a candid, but preliminary, evaluation of our success in serving the needs of a large and diverse student population.
Construction of a transportable, multi-pass compiler for extended Pascal
Authors: G. J. Hansen, G. A. Shoults, J. D. Cointment
Venue: Proceedings of the 1979 SIGPLAN symposium on Compiler construction (1979)

This paper describes the implementation of an extended Pascal compiler on the TI 990 minicomputer, the TI 980 minicomputer, and the IBM System 370. The compiler was designed to be as machine independent as possible; the parser and machine independent optimizer are parameterized so they are identical at the source code level for all machines. The paper describes the language modifications and extensions to Pascal, the parser, the optimizer, and the code generators. In addition, the intermediate language utilized is discussed at length.
Manpower training problems and programs
Authors: A. C. Bolino
Venue: Proceedings of the SHARE design automation project (1965)

I am delighted to be back once again at another meeting of the SHARE computer design group. When Mr. Pistilli telephoned me to extend his invitation, he indicated that I might follow up last year's talk with one on manpower training programs, so I might begin by attempting to summarize briefly the main points of my 1964 presentation. When I spoke to you last, I attempted to assess the economic and social implications of automation and I stated that the net effect was dependent on what one believed about the pace of changing technology. I discussed the various ways one could approach an estimate of the impact of automation, including the use of productivity statistics, expenditures on research and development, and capital-output ratios. I spoke about job-creation and job displacement, and I said I was not convinced that automation was having the job-displacing effects that was attributed to it; rather, I felt that it was compounding the growing population-employment problem.
Placement of irregular circuit elements on non-uniform gate arrays
Authors: I. H. Kirk, P. D. Crowhurst, J. A. Skingley, J. D. Bowman, G. L. Taylor
Venue: Proceedings of the 20th Design Automation Conference (1983)

A program is described which was designed primarily to automatically place 5000 gate circuits comprising irregular drop-in components onto the UK5000 type gate array. The architecture of this array is unique, having latch cells together with basic logic cells already predefined on the uncommitted die and so is not a uniform structure. The program uses levels of automatic partitioning and placement forming initial solutions constructively followed by iterative improvement techniques. The concept of function dependent targeting for partitions is introduced together with a novel constructive initial partitioning algorithm. The concept extends throughout most of the subsequent improvement and placement processes. A novel placement improvement algorithm which considers the distribution of unused cells following initial placement is also introduced. The program is entirely file-driven, and uses plug-in algorithms making it suitable for a wide range of placement problems.
Atlas supplement to the 1972 County and City Data Book
Authors: Lucky M. Tedrow, Eugene A. Hoerauf
Venue: ACM SIGGRAPH Computer Graphics (1980)

A series of maps presenting the spatial distribution of the tabular data from the 1972 County and City Data Book is discussed. Using an automated mapping procedure developed on a minicomputer by two non-computer scientists, 196 choropleth maps of county-level data for the State of Washington were prepared. The maps provide governmental decision-makers and planners a means to quickly comprehend patterns in the data that are not readily noticeable in the tabular presentation of the data.
Allegations as aids to static program testing
Authors: Leon J. Osterweil
Venue: Proceedings of the 1976 annual conference (1976)

In static program analysis, a program is examined without execution in an attempt to anticipate possible sources of error. Possible errors detected in this way can rarely be considered certain to occur because of the impossibility of infallibly determining the executability of a given program path. Current heuristic systems for making this determination are costly and uncertain. Hence the use of allegations&mdash;user supplied unverifiable statements designed to provide answers to executability questions&mdash;is suggested.
An Interactive Simulation System for structured logic design&mdash;ISS
Authors: Takeshi Sakai, Yoshiyuki Tsuchida, Hiroto Yasuura, Yasushi Ooi, Yoshitsugu Ono, Hiroshi Kano, Shinji Kimura, Shuzo Yajima
Venue: Proceedings of the 19th Design Automation Conference (1982)

An Interactive Simulation System (ISS) is presented. ISS is an integrated interactive CAD system for logic design, and is configurated &ldquo;module oriented&rdquo; to support structured logic design. An Interactive Simulator (IS) is used for design verification. A designer can control simulation steps interactively in IS, and he can find design errors early using a good interactive interface. A Structured Hardware Design Language (SHDL) is used to describe logic designs.
Introductory computer science courses
Authors: William G. Bulgren, Gregory F. Wetzel
Venue: Proceedings of the thirteenth SIGCSE technical symposium on Computer science education (1982)

Many colleges and universities offer an introductory computer science course based on a specific programming language. The Department of Computer Science at the University of Kansas has recently reorganized its introductory computer science course to include such topics as algorithms, top-down algorithmic design, elementary programming techniques, and introduction to time-sharing. Besides the discussion of this transition, the paper discusses a questionaire that was developed and utilized during this transition. It is hoped that others will benefit from our experiences.
Building battlefield activity simulation models
Authors: Kevin C. Trott, Frederick K Frantz
Venue: Proceedings of the 17th annual symposium on Simulation (1984)

The Dynamic Ground Target Simulator (DGTS) is a real-time interactive simulation system which produces detailed scenarios of military unit activity to support the development of command and control systems. This paper describes some of the battlefield simulation models that have been constructed using the DGTS system and the modelling techniques that have been used to simulate various types of battlefield activities. As a secondary theme, the structured methodology used to develop battlefield activity simulation models is described. This methodology includes requirements analysis, design, implementation, testing and debugging, and documentation.
Lockup-free instruction fetch/prefetch cache organization
Authors: David Kroft
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

In the past decade, there has been much literature describing various cache organizations that exploit general programming idiosyncrasies to obtain maximum hit rate (the probability that a requested datum is now resident in the cache). Little, if any, has been presented to exploit: (1) the inherent dual input nature of the cache and (2) the many-datum reference type central processor instructions. No matter how high the cache hit rate is, a cache miss may impose a penalty on subsequent cache references. This penalty is the necessity of waiting until the missed requested datum is received from central memory and, possibly, for cache update. For the two cases above, the cache references following a miss do not require the information of the datum not resident in the cache, and are therefore penalized in this fashion. In this paper, a cache organization is presented that essentially eliminates this penalty. This cache organizational feature has been incorporated in a cache/memory interface subsystem design, and the design has been implemented and prototyped. An existing simple instruction set machine has verified the advantage of this feature; future, more extensive and sophisticated instruction set machines may obviously take more advantage. Prior to prototyping, simulations verified the advantage.
Implementing atomic actions on decentralized data (Extended Abstract)
Authors: David P. Reed
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

In this paper, a new approach to coordinating accesses to shared data objects is described. We have observed that synchronization of accesses to shared data and recovering the state of such data in the case of failures are really two sides of the same problem&mdash;implementing atomic actions on multiple data items. We describe a mechanism that solves both problems simultaneously in a way that is compatible with requirements of decentralized systems. In particular, the correct construction of a new atomic action can be done without knowledge of all other atomic actions in the system that might execute concurrently. Further, the mechanisms degrade gracefully if parts of the system fail&mdash;only those atomic actions that require resources in failed parts of the system are prevented from executing.
A modelling tool for office information systems
Authors: J. Lebensold, T. Radhakrishnan, W. M. Jaworski
Venue: ACM SIGOA Newsletter (1982)

Application of ABL, Alternative Based Language, to modelling office information systems is described. This language is powerful for the description of parallelisms and is amenable to stepwise refinement. After studying the different OIS modelling tools, we propose eight requirements of a good modelling tool and examine how well ABL fulfills these requirements. Some capabilities of the ABL environment and user interface are demonstrated. We present the ABL description of an order processing office.