ppxscal/embedding_network huggingface dataset:
Weighting biodata to predict success of undergraduate business administration students in introductory data processing: Item analysis and cross-validation of net weights
Authors: Warren S. Blumenfeld
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

(This paper has been accepted for publication in the Proceedings, but the photo-ready form was not delivered in time. Copies of the paper should be available upon request at the presentation.)
Accounting rate of return vs. true rate of return considering variability and uncertainty
Authors: J. V. Baumler
Venue: Proceedings of the 6th conference on Winter simulation (1973)

An accounting rate of return and a defined true rate of return were assessed for a simulated firm composed of Independent long-lived investment projects. The parameters of each individual investment project were determined by a Monte Carlo simulation technique. Differing degrees of environmental variability and uncertainty were represented by the simulation techniques used. Accounting rate of return, defined consistent with contemporary accounting practice, and a true rate of return, defined in economic terms, were contrasted. The efficacy of accounting rate of return as a surrogate for true rate of return was found to be a function of the degree of variability and uncertainty represented in the environment.
A router for multilayer printed wiring backplanes
Authors: J. C. Foster
Venue: Proceedings of the 10th Design Automation Workshop (1973)

Multilayer printed wiring backplanes cause a special problem for design automation. The very size of the problem tends to make routing techniques which are satisfactory for smaller boards prohibitively expensive for larger ones. At the same time, however, the following factors make it mandatory that adequate computer routing exist. 1. The number of connections to make, the number of layers available and the ability to use vias makes the problem too complex for manual routing. 2. Backplanes generally come late in system design and thus become critical path items. 3. Backplanes are subject to design changes and sometimes require massive rework on short schedules. There are a number of routing techniques used today on smaller problems. The most common of these are the maze (Lee's)1 method and the ray (Hightower)2 method. In this paper, we will discuss alternate routing technique, designed around the special features of backplanes and multilayer boards. Examples will be given to show that this technique is faster (more than two orders of magnitude over a maze type) than maze or rays ones.
Artificial intelligence and self-organizing systems: Experiments with a Heuristic Compiler
Authors: H. A. Simon
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

SOME EXPERIMENTS with a compiler that uses heuristic problem-solving techniques like those incorporated in the General Problem Solver (GPS) will be described in this report. The experiments were aimed at the dual objectives of throwing light on some methods of constructing more powerful programming languages and compilers, and of testing whether the task of writing a computer program can be regarded as a problem in the sense in which that term is used in GPS.
Image Enhancement Using Pattern-Selective Color Image Fusion
Authors: Luca Bogoni, Michael Hansen, Peter Burt
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper introduces a method for extending the effective dynamic range and depth of focus of a sensor through pattern-selective color image fusion. Pattern-selective fusion methods provide a mechanism for combining multiple monochromatic source images through identifying salient features in the source images at multiple scales and orientations, and combining those features into a single fused image result. In this paper, the pattern-selective fusion method is generalized into a framework that is equally applicable to monochrome, color, and multi-spectral imagery. This proposed fusion framework is then used to combine a set of color source images, taken from a sensor with varying aperture and focus settings, into a single fused image result that has improved dynamic range and depth-of-field over any of the other frames in the input sequence. Experimental results show the performance of the dynamic range and depth-of-field extension on imagery taken from consumer-grade video camera equipment.
A note on pattern matching: Where do you find the match to an empty array?
Authors: Adin D. Falkoff
Venue: ACM SIGAPL APL Quote Quad (1979)

The question in the title is answered, and the answer justified by a derivation and use in two applications, string partitioning and string editing. Some implications for APL language extensions are also noted.
The LEAP load and test driver
Authors: T. A. Dolotta, J. S. Licwinko, R. E. Menninger, W. D. Roome
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

LEAP is a facility for testing interactive applications that are implemented on IBM System/360 and System/370 computers; it simulates concurrently the actions of several IBM 3270-type terminals and of their operators. LEAP allows one to organize, in a systematic and efficient fashion, a large-scale, repeatable testing program for such an interactive application system. LEAP is one of the tools of the Programmer's Work-bench. It operates under the UNIX Time Sharing System; all test preparation, testing, and test analysis is performed at a UNIX terminal. LEAP can be used for both regression (functional) testing and load (stress and performance) testing. Several post-test analysis tools are provided.
CDL - A tool for concurrent hardware and software development
Authors: J. Robert Heath, B. D. Carroll, Terry T. Cwik
Venue: Proceedings of the 14th Design Automation Conference (1977)

An improved version of Computer Design Language (CDL) is presented. The feasibility of using a Hardware Description Language TTT(HDL) for concurrent hardware and software development is explored using improved CDL as the HDL.
Experience with Grapevine (Summary): the growth of a distributed system
Authors: Michael D. Schroeder, Andrew D. Birrell, Roger M. Needham
Venue: Proceedings of the ninth ACM symposium on Operating systems principles (1983)

Grapevine is a distributed, replicated system that provides message delivery, naming, authentication, resource location, and access control services in an internet of computers. The system, described in a previous paper [1], was designed and implemented several years ago. We now have had operational experience with the system under substantial load. This experience has proved the original design sound in most aspects, but there also have been some surprises. In this paper we report what we have learned from using Grapevine. Our experience may offer some help to designers of new systems. Grapevine is implemented as a program that is run on a set of dedicated server computers. Client programs o f Grapevine run on various workstation and server computers attached to an internet. The services provided by Grapevine are divided into the message service and the registration service. The message service accepts messages prepared by clients for delivery to individual recipients and distribution lists. Messages are buffered in inboxes on message servers until the recipient requests them. Any message server can accept any message for delivery, thus providing a replicated submission service. A computer system mall user has inboxes on at least two message servers, thus replicating the delivery path for the user.
An application of simulation to the improvement of fork truck operations
Authors: Michael L. Morrison
Venue: Proceedings of the 5th conference on Winter simulation (1971)

Most manufacturing operations assign fork trucks to the individual shop units which need them. This can lead to excessive numbers of fork trucks and low average utilization. The pooling of fork truck resources under a central authority can resolve this problem. Fewer trucks are needed in operations with fork truck pools to provide an equivalent level of service. The purpose of his report is to document the results of a simulation study of the operation of a fork truck pool in a mass manufacturing operation and to demonstrate the practicality of such a plan.
The method of reduced matrices for a general transportation problem1
Authors: Paul S. Dwyer, Bernard A. Galler
Venue: Proceedings of the 1956 11th ACM national meeting (1956)

In the usual statement of the transportation problem [A], one has N items to send from shipping points A1,...,Ap to receiving points B1,...,Bq. The amounts available for shipment from A1,...,Ap are a1,...,ap, respectively, where (equation) Given the cost cij of shipping one item from Ai to Bj, the problem is to allocate the shipments so as to minimize the total cost. Formally, the problem is to find a set of integers xij such that (1) (equation) (equation) (equation) (equation)
Modeling of queuing networks with finite capacity queues
Authors: Bahram Keramati, Joan M. Lommel
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A model is presented for the blocking phenomena associated with queuing networks with finite capacity queues. The basic idea behind the model is the calculation of the average length of time the cells are in the &ldquo;blocked&rdquo; state, i.e., their downstream queue is filled to capacity. The model was tested and verified against an actual simulation for a simple network. Excellent agreement for the average quantities is demonstrated between the model and the simulation for both the downstream and upstream effects resulting from blocking. The model is quite general in its applicability to M/M/c queuing networks and is casy to implement.
TASK forces: Distributed software for solving problems of substantial size
Authors: Anita K. Jones, Karsten Schwans
Venue: Proceedings of the 4th international conference on Software engineering (1979)

TASK is a 'high level' specification language for defining software that executes on distributed computers. Software is in the form of task forces&mdash;collections of communicating parallel processes that cooperate to achieve a common goal. Using the TASK language, a programmer specifies the interrelated components of his task force: modules exporting functions which are potentially executed in parallel, multiple data and code objects, and processes. The user may adapt the configuration of the task force to enhance performance, reliability, or the degree of distribution. In particular, data or processes may be replicated, data may be partitioned into multiple memory units, and physical resource allocations may be controlled.
A complete axiomatic system for proving deductions about recursive programs
Authors: David Harel, Amir Puneli, Jonathan Stavi
Venue: Proceedings of the ninth annual ACM symposium on Theory of computing (1977)

Denoting a version of Hoare's system for proving partial correctness of recursive programs by H, we present an extension D which may be thought of as H &ugr; {@@@@,@@@@,@@@@,@@@@} &ugr; H-1, including the rules of H, four special purpose rules and inverse rules to those of Hoare. D is shown to be a complete system (in Cook's sense) for proving deductions of the form &sgr;1,....&sgr;n @@@@ &sgr; over a language, the wff's of which are assertions in some assertion language L and partial correctness specifications of the form p(&agr;)q. All valid formulae of L are taken as axioms of D. It is shown that D is sufficient for proving partial correctness, total correctness and program equivalence as well as other important properties of programs, the proofs of which are impossible in H. The entire presentation is worked out in the framework of nondeterministic programs employing iteration and mutually recursive procedures.
An interactive statistical modelling package in APL
Authors: Yuan Liu, Amrit L. Goel
Venue: Proceedings of the ACM annual conference (1973)

In this paper we describe an APL package developed for building statistical models interactively. The package consists of seven functional units with four major functions DATA, MODEL, REGRESSION and RESIDUAL, each of which is controlled by a set of commands. Several auxiliary functions are also available. The use of the package is illustrated through a numerical example.
A tandem queueing model of a time-sharing computing system
Authors: John W. McCredie,  Jr.
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper presents a cyclic tandem queueing model of a time-shared computer system. An input/output subsystem, to process paging and file handling requests, is placed in tandem with a central processor which works on jobs for random time periods between interrupts. Results include the mean value of response time conditioned on the length of service request as well as the unconditioned mean response for all requests. Since the results are easy to use and derive they are valuable pedagogical tools. The macroscopic behavior predicted by the model is compared qualitatively with that observed in an operational time-sharing system, and an example is included which illustrates how such models may be used in system improvement studies.
A comparison of non-business and business student test scores in basic
Authors: Ronald S. Lemos
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

An experiment is described that analyzes differences in BASIC test scores between a group of 58 non-business and 104 business majors. All students were given four weeks of instruction in BASIC and took a common BASIC examination testing their knowledge of language rules and their ability to read programs. Analysis of multiple covariance was used to statistically adjust BASIC test scores for performance on a computer concepts examination and age. The results showed no significant difference between the scores of the non-business and business majors on the BASIC examination. These findings are important since they provide empirical evidence that the ability to understand programming language is independent of students' academic direction. Thus, the benefits of programming experience appear to be realizable for both business and non-business students.
PACOL: A parallel control language
Authors: Ben Zion Barta
Venue: Proceedings of the conference on Programming languages and compilers for parallel and vector machines (1975)

An Extended Parallel Program Scheme (EPPS) and a higher level Parallel Control Language (PACOL) are defined. They are suitable for describing and programming parallel programs, intended for execution by a LSI modular, highly parallel processing system. PACOL provides for the definition of the sequencing of task-executions and of the related data transfers. To define the computations associated with the tasks, however, any one of the usual programming languages has to be used. These program statements are interwoven with the PACOL statements, to form a complete parallel program. PACOL uses ternary control variables but, for convenience, the task entry-functions are &ldquo;quasi boolean&rdquo;. It allows for very flexible sequencing schemes, including reentrant and recursive executions, lock, unlock and waiting actions. A programming example and the description of a part of the PACOL-semantics follow the definitions of its syntax and of the EPPS.
APLODS
Authors: James R. Wilson, Alan M. Marcum
Venue: Proceedings of seventh international conference on APL (1975)

APLODS stands for APL Public Library Optimized Documentation System. Essentially, APLODS is a specialized information retrieval system for user access to the APL library documentation. APLODS is characterized by variable format inquiry request, automatic manipulation of internal references and flexibility as an aid to development.
The three-dimensional graphical input method for architecture
Authors: Harvey C. Allison, Donald P. Greenberg
Venue: Proceedings of the 15th Design Automation Conference (1978)

An interactive computer graphics method is presented for generating three-dimensional geometric information by drawing in two-dimensional plans and simultaneously using a powerful three-dimensional editor. The system was initially developed for its suitability in architectural design procedures, but the strength of this method is not unique to architectural applications. The advantage of this approach is that the user may trace a two-dimensional drawing directly onto a plane in the system's three-dimensional data space. To generate a three-dimensional form, the designer may extrude any or all of the lines into planes, creating a three-dimensional representation from the plan. The user receives continuous visual feedback from the graphic screen at all times. This input cycle may be used or the database may be edited any number of times as a complex representation is generated. The program has been interfaced to a number of application routines and color display routines. It has been successfully used in structural analysis, energy analysis, and visual applications. The following describes the specific details of the program, a typical scenario, and some of the architectural and engineering applications.
Experience with an interactive basic machine implemented using the Burroughs B1700
Authors: John M. Hemphill, Richard T. Thomas
Venue: Proceedings of the 11th annual workshop on Microprogramming (1978)

This paper describes the structure of the interpretive environment as designed and implemented and gives some comparisons of this system with another BASIC language interpreter. Some specific conclusions about the suitability of the B1700/1800 for this particular type of environment are given, along with some general conclusions regarding the interpretation process itself.
Communication and the structure of a service organization
Authors: James F. Moore, Charles E. Fisher
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

In Kansas City last fall we presented a paper which outlined what we believed to be the relationship of the individual user with the user services consultant. We defined this system and used the jargon borrowed from that field known as communications or information theory. Continuing in that line, we would like to take a larger look at the process of communications in a much more complex system&mdash;that of the entire organization. We will begin to look at the process by which the service is delivered to the user community and how the computing personnel are able to communicate to the user that a service is being delivered. For the purpose of this discussion, we are going to focus on a middle-man who may hold various titles such as Director of Academic Services or Coordinator of Instruction and Research Systems.
A generalized model for simulating commodity movements by ship
Authors: John C. Rea, David C. Nowading, P. Wade Buckholts
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The paper describes the logic structure and techniques used in a Simscript program for simulating the movement of ships through a network of locks, reaches, lakes, and ports. The program also provides for endogenous route selection between &ldquo;micro-route&rdquo; alternatives, i.e., parallel locks or canals, and for the endogenous scheduling of ship movements, given port-to-port commodity movement demand and fleet mix. The model is basically a general network simulation tool based on the concept of a &ldquo;route map&rdquo; which describes the sequence of facilities to be traversed between given points in the network. The cardinal mechanism in the model is a Movement Control Module which monitors the route map of each ship during its voyage and sends the vessel to generalized satellite modules where the performance of locks, reaches, lakes, and ports are simulated. Attributes carried by the ship initialize the generalized modules to simulate a specific lock, reach, lake, or port as dictated by the ship's position along its route map. The model is being used to simulate the performance of the Great Lakes System for the Corps of Engineers.
Computer aids to medical diagnosis&mdash;problems and progress
Authors: Stephen R. Yarnall, Richard A. Kronmal
Venue: Proceedings of the 1966 21st national conference (1966)

Computers are increasingly being used in medicine for a variety of applications, as outlined below: 1. Business&mdash;patient billing, record-keeping 2. Retrieval&mdash;patient records, medical literature 3. Laboratory control systems 4. Statistical data processing 5. Simulation&mdash;physiologic models 6. Teaching programs 7. Medical diagnosis and decision-making In this paper we will restrict our discussion to the use of computers as an aid to diagnosis and decision-making. We will consider the question, &ldquo;Why use computers as an aid to diagnosis?&rdquo;, and review in general terms what progress has been made in this application. We will then discuss some of the methods and problems in current approaches to computer-aided diagnosis, and conclude with a few speculations and suggestions for the future.
Use of a software package for diverse user-developed applications
Authors: Forest E. Morrison, June A. Page, Cynthia B. Irby
Venue: Proceedings of the eighteenth annual computer personnel research conference (1981)

In recent years the technological advances in computer hardware have raced far ahead of the development of software. Computer manufacturers, software firms, government and private industry have all been caught in the dilemma of having the latest in data processing equipment, but lacking the trained personnel to achieve the maximum benefit from this equipment. Low priced mini and micro-computer systems started and are continuing to fuel the rush to decentralization. We see less of the central computer facility and more of small computers being utilized in the offices and laboratories that they serve. In an attempt to compensate for the lack of computer knowledge in end users, computer manufacturers are developing generalized software packages and coupling these with powerful, low priced equipment so that the customer can immediately begin to derive benefits from computerization.
Industrial darwinism: Evolution of microprogramming
Authors: T. Weidner, J. Ahlstrom, D. Gaubatz, M. Overgaard, B. Shriver
Venue: Proceedings of the 1979 annual conference (1979)

Comments in this discussion will be directed towards current developments, historical perspective, and prognostications concerning microprogramming and related subject areas. What challenges do the 1980's pose in the areas of virtual machine development, operating system support, and high level language execution using microprogramming techniques? The role of microprogramming seems to be evolving from a means of avoiding the complexities of computers ill suited to a task, to the more positive methodology of proper consideration and realization of those primitives appropriate to a task. These and other trends will be presented. The topic of firmware engineering will be discussed. What have we learned from software engineering? In particular, what are the difficulties associated with high order microprogramming languages for horizontal host architectures? Issues related to both horizontal and vertical migration of primitives in multi-level interpretive environments will be ennunciated. Outstanding problems in this and other areas will be presented.