ppxscal/embedding_network huggingface dataset:
Financial simulation model: Assessing project risk at the Port Authority of New York and New Jersey
Authors: Leo H. Bressman, James J. Browne, Cherrie L. Nanninga, Barry Weintrob
Venue: Proceedings of the 10th conference on Winter simulation - Volume 2 (1978)

Many firms approach the problem of evaluating the risk element of investment proposals in informal ways. A decision-maker will often express his assumptions about the key factors affecting future costs, revenues, and investment requirements in terms of single-point or &ldquo;most-likely&rdquo; estimates. On the basis of these most-likely estimates, the financial picture may look very bright. However, this picture depends on each of the most-likely estimates coming true in actuality, something that rarely occurs. The authors of this paper have utilized a technique for incorporating the uncertainty of certain key assumptions into the financial planning and evaluation of an investment proposal. Future annual cash inflows and outflows are simulated and are used to evaluate a project in terms of three measures of overall financial feasibility. This paper describes the technique, which involves the construction of a computer simulation model, and outlines the application of this technique to an actual Port Authority investment proposal representing a potential capital outlay of &dollar;400 million.
The computational complexity of continued fractions
Authors: V. Strassen
Venue: Proceedings of the fourth ACM symposium on Symbolic and algebraic computation (1981)

The Knuth-Sch&ouml;nhage algorithm for expanding a quolynomial into a continued fraction is shown to be essentially optimal with respect to the number of multiplications/divisions used, uniformly in the inputs.
User/systems/management interfaces and the team model
Authors: Phil Semprevivo, Peggy Semprevivo
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

In the early days of business computing, a typical application, for example, a payroll system, might be developed by a single individual who understood both the application (payroll) requirements and the computing (hardware and software) requirements needed to deal with the problem. Using this approach worked well at the time and continues to work well today in certain situations. In a complex and dynamic business environment, the approach is, of necessity, quite different. As Kenneth Orr (1) has pointed out, our thoughts on the application of computing technology have evolved from simple, small systems which could be developed by a single person to complex, large-scale systems which require great quantities of money, time and people to develop, and which are so plagued with delivery problems that the process has begun to tax the endurance of business organizations everywhere. It was in response to this new environment that the process for developing computerized systems began to develop into a more formalized set of procedures.
Modeling the site planning of homogeneous uses
Authors: Christos I. Yessios
Venue: Proceedings of the 9th Design Automation Workshop (1972)

The work presented here is part of a more general research project for Computer Implemented Site Planning (CISP), currently under development at the Institute of Physical Planning, C-MU. CISP is designed to respond to the typical site planning problem where the description of a site and the definitions of a set of uses (including relations and/or constraints to be satisfied) are given and we want to derive a plan of the uses for the site.
An APL-based multiple-key file system
Authors: Stephen Deerhake
Venue: Proceedings of the international conference on APL (1983)

To satisfy the record search, retrieval, and update requirements of a large multiple terminal APL application, a shared file system providing extensive field oriented search capabilities was designed and implemented. The file system consists of two major components: the Shared File Manager, which handles the sharing of files among multiple users, and the File Subsystem, which performs all file search and modification activities. With the exception of those portions of the system which perform the actual record input/output and data transmission between file users, both the File Manager and File Subsystem are written entirely in APL. The file structure offered by this system has been found to significantly simplify the file management portions of a broad class of applications.
A Software oriented Computer Science program
Authors: Gerald N. Pitts, Barry Bateman
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

Many Computer Science programs are mainly concerned with hardware and software theory. Computer Software especially is studied with very little application. American Technological University has attempted to breach the gap in the area of qualified software computer science graduates by tailoring the courses to allow students to study or write, and/or modify operating systems. This is accomplished by selected course work and &ldquo;hands on&rdquo; use of the 370/145. Junior, senior and graduate level students are allowed to sign up for blocks of time between 10:00 p.m. and 6:00 a.m. Monday through Friday when available and on most week-ends. A description of courses, the philosophy of teaching, the computer facilities, and a critique of our former students is presented.
Highlights of the history of the lambda-calculus
Authors: J. Barkley Rosser
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

This paper discusses about History of lambda-calculus. The lambda-calculus originated in order to study functions more carefully. It was observed by Frege in 1893 (see van Heijenoort 1967, p.355) that it suffices to restrict attention to functions of a single argument.
Computer performance evaluation (SIGMETRICS): Brownian motion?
Venue: Proceedings of the ACM 1980 annual conference (1980)

Over the past decade, computer performance evaluation (CPE) has gained increasing importance and attention. Evaluation was originally performed at the level of the hardware components and the focus has since migrated out towards the perspective of the user. In between, there are methods of analysis that are directed at the evaluation of system software performance and application program performance. The data collection tools used for the analyses range from hardware and software monitors to questionnaires and accounting logs. For every data collection tool, there exist numerous data reduction methods. As a result, several theories of computer performance evaluation have evolved, not all of which are necessarily consistent. The choice of data collection tools, data reduction tools, and CPE theory does not appear to abide by any generally agreed to criteria. An organization that undertakes a CPE effort has no real guidance as to its choice of method. What are the objectives of CPE? In what way can each of the many CPE tools and theories help to achieve these objectives and, just as importantly, in what respects are these same tools merely avenues to the collection of useless data? As CPE proliferates, management becomes increasingly aware of the costs of undertaking CPE efforts. Is there a unified theory of CPE; an unstated objective toward which all CPE activity is presumed to be striving? If there is such an unstated objective, to what extent has the last decade of CPE activity seen progress toward that objective? Alternatively, to what extent has all this activity simply been the irregular (Brownian) motion of CPE practitioners?
Automatic programming and compilers II: The COLASL automatic coding system
Authors: K. G. Balke, G. Carter
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

RECENT YEARS have been the development of two somewhat similar automatic coding systems at the Los Alamos Scientific Laboratory of the University of California. The MADCAP system, generating codes to be run on the MANIAC computer, has been produced primarily by Mark Wells and Donald Bradford . The COLASL system, which compiles codes to be run on the IBM-7030 (STRETCH) computer, is the result of work done by the authors under the direction of Edward A. Voorhees. Both systems have attempted to utilize source languages which are as natural as possible within the limitations of time and hardware.
Neural Based Handwritten Character Recognition
Authors: M. Hanmandlu, Harish Kumar, K. R. Murali Mohan
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

This paper explores the existing ring based [2], the new sector based and the combination of these, termed as Fusion method for the recognition of handwritten English capital letters. The variability associated with the characters is accounted for by way of considering a fixed number of concentric rings in the case of ring based approach and a fixed number of sectors in the case of sector approach. Structural features such as end points, junction points and the number of branches are used for the pre-classification of characters, the local features such as normalized vector lengths and angles derived from either ring or sector approaches are used in the training using the reference characters and subsequent recognition of the test characters. The recognition rates obtained are encouraging.
A comparison of first-fit allocation strategies
Authors: Aaron Tenenbaum, Erik Widder
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Two modifications of the first-fit algorithm of storage allocation presented by Knuth are simulated. They are compared under two measures of efficiency: average allocation search time and memory utilization efficiency.
IAM, a system for interactive algebraic manipulation
Authors: Carlos Christensen, Michael Karr
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

The principal features of IAM, a system for interactive algebraic manipulation, are described. The primary goal of IAM is to make algebraic manipulation by computer available to a non-programming person. IAM has a JOSS-like command language, emphasizing ease of communication between the user and the system, yet still providing a stored program facility for applications which require it. In addition, the system uses a two-dimensional output format and provides convenient files for the permanent storage of expressions. The algebraic operations of IAM are oriented toward the use of a canonical form of rational functions to achieves &ldquo;simplification&rdquo; of expressions; and this approach dictates specialized data structures and algorithms. IAM is implemented in AMBIT/L, a high-level language for list-processing; and it is currently running under the time-sharing system of the DEC PDP-10/50.
Use of peer ratings in evaluating computer program quality
Authors: Nancy Anderson, Ben Shneiderman
Venue: Proceedings of the fifteenth annual SIGCPR conference (1977)

Peer review techniques can be useful tools for supplementing programmer education, improving cooperation and communication within programming teams, and providing programmer self-evaluation. This paper will explore the benefits of peer review for practicing professional programmers and describe a framework for administration of an annual or semi-annual peer review process.
Coming changes in system analysis and design
Authors: Richard G. Canning
Venue: Proceedings of the 1966 21st national conference (1966)

System analysis has been defined as &ldquo;the examination of an activity, procedure, method, technique or a business to determine what must be accomplished and how the necessary operations may best be accomplished&rdquo;.1 The definition really covers both system analysis and design&mdash;determining what is required and how best to accomplish it. In business data processing, a number of levels of system analysis have been observed. Table 1 lists several of these levels, starting at the lowest level&mdash;for the conversion of applications to a computer. The highest level of system analysis deals with the missions and goals of the whole enterprise; this type of system analysis might be compared with that performed at the highest levels in the Department of Defense.
Logic properties of unate and of symmetric discrete functions
Authors: A. Thayse, J. P. Deschamps
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

The total and local unateness of discrete functions are first studied from a theoretical point of view. It is shown that the local unateness leads to the concept of hazard-free transition for a discrete function. Unate covers for discrete functions are defined: they are either the smallest unate functions larger than a discrete function, or the largest unate functions smaller than a discrete function. These concepts play a key-role in hazard-free design of multiple-valued networks. Two-and three-level types of multiple-valued networks using MIN and MAX gates are presented; these networks are straightforward generalizations of the well known two-level hazard-free networks presented by Eichelberger and of some types of switching networks which improve, from a hazard point of view, the Eichelberger's networks. Some results concerned with the symmetry of discrete functions are briefly summarized at the end of this pa- per. Finally, the paper presented by the authors at the preceding symposium (see ref. 4) constitutes a preriquisite for understanding the matter developed in the present paper.
Prioritizing packet transmission in local multiaccess networks
Authors: Lionel M. Ni, Xianji Li
Venue: Proceedings of the eighth symposium on Data communications (1983)

Carrier sense multiple access with collision detection (CSMA/CD) protocols have been extensively studied and developed for local area networks. In CSMA/CD protocols, all messages are treated equally in competing for the communication channel. Thus, important or time-critical messages may be severely delayed. In this paper, a new CSMA/CD protocol with message-based priority functions is proposed. A priority code comparison period is needed to determine the highest priority class that can compete for the comunication channel. A contention period based on CSMA/CD scheme is then followed. Both nonpreemptive discipline and preemptive discipline are discussed. In each discipline, both the single mode and the batch mode are considered and compared. The overhead in implementing the proposed protocol, either for a few or for a large number of priority classes, is shown to be minimal. In general, a preemptive single mode scheme provides a better performance. The requirements of hierarchical independence of performance and fairness are satisfied.
Nested arrays, operators, and functions
Authors: Bob Smith
Venue: Proceedings of the international conference on APL (1981)

Although the original ideas of nested arrays go back over ten years, it has been only within the past few years that these ideas have matured. During the same period, several new operators and functions have been proposed. This paper describes an experimental research implementation of these proposals. Details of some of the proposals are also described.
Proper termination of flow-of-control in programs involving concurrent processes
Authors: Kim Gostelow, Vincent G. Cerf, Gerald Estrin, Saul Volansky
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This paper presents new results from a study of flow-of-control in programs involving concurrent processes. Within the framework of flow-of-control, this paper: 1) defines a property of parallel program behavior called proper termination (PT); 2) shows that any properly terminating program containing a specification of the resources it requires will be free of deadlock; 3) identifies other important features of PT programs; and 4) presents an algorithm to rapidly decide PT for a given program. This work is presented in the context of the control-flow component of a complex bigraph (complex bi-logic directed graph) model of computation [1,10].
Another approach to the data base computer
Authors: Harvey A. Freeman, John R. Jordan
Venue: Proceedings of the ACM 1980 annual conference (1980)

Data base computers have been identified as one means of using hardware to improve the performance of current Data Base Management (Software) Systems while offering increased functionality. This paper describes a data base computer architecture and its operation that was developed during one of Sperry Univac's research efforts in this area. Parallel transfer of large blocks of data which are then processed in parallel on a content-addressable basis by a series of microprocessors is the key to this design. The data base computer described in this paper is indicative of the special-purpose devices that will be available to meet the information storage and processing needs of the 1980s.
The degree hierarchy of undecidable problems of formal grammars
Authors: Dennis F. Cudia
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

After a brief discussion of historical matters in &sect;1, twenty-seven predicates of formal grammers are introduced in &sect;2. The next two sections discuss recursively enumerable predicates and nonrecursively enumerable predicates, respectively. These results show that the degree of unsolvability of a predicate is determined by its domain of definition. The paper concludes with a degree diagram and suggestions for further development. From a more comprehensive point of view these results complement the computational complexity classification of solvable problems and extend that classification to unsolvable problems based on their degree of unsolvability.
A prototype Spatial Data Management System
Authors: Christopher F. Herot, Richard Carling, Mark Friedell, David Kramlich
Venue: ACM SIGGRAPH Computer Graphics (1980)

Spatial Data Management is a technique for organizing and retrieving information by positioning it in a spatial framework. Data is accessed in a Spatial Data Management System (SDMS) via pictorial representations which are arranged in space and viewed through a computer graphics system. These pictures can be created by an interactive graphical editor, allowing an SDMS to serve as a personal repository of diagrams, text, and photographs. Pictograms can also be generated from data in a symbolic database management system, allowing SDMS to be used as an interface to large, shared databases. A prototype SDMS has been constructed which employs a set of color, raster scan displays driven by a large minicomputer. The user can create and examine data surfaces which are larger than the display screen, traversing a surface and zooming in and out to control the level of detail displayed. The prototype system provides a uniform mechanism for accessing a wide variety of data types in a manner which does not require the use of a formal command or query language.
Data flow languages and architectures
Authors: Arvind
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Data flow concepts provide a new framework for finding solutions to interrelated problems of exploiting parallelism in the architecture of high-performance multiple processor computers, and of programming and structuring distributed systems. A computer based on data flow principles is a radically different form of stored-program computer in which instructions are activated by arrival of their operands rather than by flow of &ldquo;control.&rdquo; These machines have no program counter and no concept of sequential instruction execution. Highly concurrent program execution is a natural consequence of data flow program execution, because many instructions may be activated by data at the same time. Several laboratories in the United States, Japan, England, and France are currently building prototypes of data flow computers. In this tutorial, we will describe the programming and the architecture of machines being developed at the Massachusetts Institute of Technology.
Mathematical Morphology and Weighted Least Squares to Correct Handwriting Baseline Skew
Authors: Marisa E. Morita, Silvio J. A. Garnés, Jacques Facon, Flávio Bortolozzi, Robert Sabourin
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

An approach to correct the baseline handwritten word skew in the image of bank check dates is presented in this article. The main goal of such approach is to reduce the use of empirical thresholds. The weighted least squares approach is used on the pseudo-convex hull obtained from the mathematical morphology.
Joint source/channel coding for multicast packet video
Authors: S. McCanne, M. Vetterli
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Current schemes for multicast packet video cope with congestion by adapting the transmission rate of a variable rate codec at the source. We propose a new approach, based on receiver- rather than source-adaptation, where a video source is encoded hierarchically with each layer of hierarchy distributed on a separate network channel. Each receiver can then dynamically adapt to local network capacity by adjusting the number of layers it receives. In order to deploy such a system, we must at the same time develop a layered codec tailored for this model. We present a prototype coder that has been designed specifically for our receiver-based congestion avoidance scheme. In order to evaluate the efficacy of our approach, we have implemented it in an existing Internet remote conferencing application and constrained the complexity of our design to run in real-time on standard workstations. Even with this constraint, our codec can generate a flexible range of layers while exhibiting reasonable compression performance.
Providing Delay Guarantees in Bluetooth
Authors: Rachid Ait Yaiz, Geert Heijenk
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Bluetooth polling, also referred to as Bluetooth MAC scheduling or intra-piconet scheduling, is the mechanism that schedules the traffic between the participants in a Bluetooth network. Hence, this mechanismis highly determining with respect to the delay packets experience in a Bluetooth network. In this paper, we present a polling mechanism that provides delay guarantees in an efficient manner, and we evaluate this polling mechanism by means of simulation. It is shown that this polling mechanism is able to provide delay guarantees while saving as much as possible resources, which can be used for transmission of best effort traffic or for retransmissions.
EBT: A comprehensive test generation technique for highly sequential circuits
Authors: Ralph A. Marlett
Venue: Proceedings of the 15th Design Automation Conference (1978)

A new test generation technique for highly sequential circuits, utilizing functional models, with ability to produce tests for specific faults while avoiding races, is presented.
A strategy for computer programmer productivity improvement
Authors: Arthur Yates
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

Short-term productivity increases will come from the successful application of the Chief Programmer Team concepts. The long-term productivity increases will come from extensions of the Chief Programmer Team concept and a joining of these team concepts with advanced software techniques. This paper develops a strategy for improving programmer productivity in terms of a set of management goals: - Increasing the percentage of successful programming projects - Decreasing the labor-intensity of programming - Changing incentives and developing a supportive organizational structure - Developing Quantitative productivity measurement methods