ppxscal/embedding_network huggingface dataset:
A risk-return simulation model of commodity market hedging strategies
Authors: Robert E. Markland, Robert J. Newett
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The American food processing industry is characterized by a vast array of products, which are produced in large quantities at relatively low unit costs. The principal component of the unit cost for these food products is their raw material (usually a basic grain commodity) constituent. Consequently, most food processing companies are greatly concerned with the prices they pay for their raw materials, and as the prices of these raw materials change, the typical food processing company's profits may be greatly affected. Since most companies prefer a steady growth rate, these raw material price fluctuations must be counter-balanced by other strategic or operating decisions. One basic set of decisions which is utilized to overcome raw materials price fluctuations involves the established commodity trading markets. The operation of the commodity futures markets allows food processors to determine what prices they will pay for their raw materials over the production horizon. However, since a number of futures options may exist for each commodity, the inherent risk of price fluctuation remains with the processor, as some manufacturers may buy their supply of the commodity at significantly lower prices than others and reflect this difference in the price of the finished product. The research described in this paper was conducted within the commodity market trading environment of a major American agri-business firm. The objective of the study was the development of a risk-return simulation model which could be used for testing commodity market hedging strategies in both cash and futures markets. The model was developed under general assumptions for the basic commodity, corn, and included a market price change simulation subsystem, a hedging strategy testing subsystem, and a risk return measurement subsystem. The simulation model was tested over a multi-period time horizon for a series of commodity market hedging strategies, and extensive test results are presented.
Algol 68 as an implementation language for portable interpreters
Authors: Frank G. Pagan
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

By making use of its advanced and highly expressive facilities, Algol 68 can be used to implement interpretive language processors with an unusual degree of conceptual clarity and machine independence. The internal representations of source programs in such a processor consist of high-level data structures which are interpreted by means of a set of readable, mutually recursive Algol 68 procedures. The technique is illustrated by applying it to the implementation of a miniature sample language. Efficiency considerations and aspects of the relevant programming methodology are discussed.
GPSS/360 - Norden, a partial conversational GPSS
Authors: Sherman Hunter, Julian Reitman
Venue: Proceedings of the second conference on Applications of simulations (1968)

Norden has modified GPSS/360 to improve the man-machine interaction between the computer and the modeler at a 2250 display unit. This modified language operates in a partition of a multi-programming environment, thus permitting GPSS to be in the foreground while other jobs are being processed in the background. A part of what will be a complete operational system is now operational. This includes model building, and input and assembly error detection with means for correction. Detection of running errors is not yet implemented. Use of this system reduces the lapsed time required to obtain an operational model.
Dynamic storage partitioning
Authors: Peter J. Denning, Jeffrey R. Spirn
Venue: ACM SIGOPS Operating Systems Review (1973)

A model of paged multiprogramming computer systems using variable storage partitioning is considered. A variable storage partitioning policy is one which allocates storage among the active tasks according to a sequence of fixed partitions of main storage. The basic result obtained is, mean processing efficiency is increased and mean fault-rate decreased under a variable partition, provided that the curves of efficiency and fault-rate as a function of allocated space are concave up.
A hierarchical bit-map format for the representation of IC mask data
Authors: James A. Wilmore
Venue: Proceedings of the 17th Design Automation Conference (1980)

An alternative representation to the usual outline description of geometric entities for IC mask artwork is described. Rather than identifying opaque areas of a mask by individual shape outlines as described by their corners' coordinates, both the opaque and transparent areas of the design are represented by 1' s and 0's respectively in a grid pattern or &ldquo;bit map&rdquo; of the entire mask plane. A bit-map representation is well suited to many computer design aids which deal with IC layout data. Artwork output programs which require a &ldquo;MERGE&rdquo; operation on all shapes of each mask benefit from this data format since it already contains the merged version of each mask's geometric entities. The bit-map format especially promises to increase the operational efficiency of Boolean comparisons of various mask levels as performed by artwork analysis programs for locating design rule errors and for identifying circuit elements directly from the masks. A hierarchical scheme for describing the bit patterns of a mask efficiently is presented which limits the memory requirements of this data format to a size proportional to the usual outline description. Consequently the bit-map representation can be used not only in those computer aids where it supports program functions very well, but also as the central data format for a CAD system.
A timing verification system based on extracted MOS/VLSI circuit parameters
Authors: Pauline Ng, Wolfram Glauert, Robert Kirk
Venue: Proceedings of the 18th Design Automation Conference (1981)

The Path Analysis program provides logic and circuit design checking for signal propagation delay constraints. The program is useful for optimizing network performance. Checking and optimization are traditionally performed by manual inspection and incompletely verified by logic and circuit simulation. The Path Analysis program completely verifies signal propagation delays against design constraints. Checks are performed either with user supplied logic simulation data or parameters extracted from the physical IC layout information.
An approach to using VLSI in digital systems
Authors: Suhas S. Patil, Terry Welch
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

We explore the use of a proposed general purpose programmable Storage/Logic Array chip (SLA) as a universal logic element for digital computers. Design examples are given to show how SLAs could be used in computer design. This approach to VLSI is compared and contrasted with other contending approaches using microprocessors, gate arrays and customized VLSI chips. The SLA appears attractive because of low cost, reasonable high performance and shorter implementation time.
From English descriptions of algorithms into programs
Authors: Jerry R. Hobbs
Venue: Proceedings of the 1977 annual conference (1977)

A system is described for the semantic analysis of &ldquo;well-written&rdquo; English descriptions of algorithms such as one finds in Knuth's Art of Computer Programming, and their translation into PL/I programs. A syntactically preprocessed text is given to a semantic analyzer which applies semantic operations that draw inferences to recover omitted material, interpret general terms in context, resolve anaphora, and detect the implicit patterns of discourse coherence. A translator uses the results of the analysis to produce code. This work is relevant to the design of very high level, &ldquo;English-like&rdquo; programming languages.
Packet-switched data network of the Netherlands administration
Authors: C de Jong
Venue: Proceedings of the sixth symposium on Data communications (1979)

Network structure The infrastructure for telecommunications will, for economic reasons, continue to be determined for many years by the requirements of telephony. Modulations on the infrastructure will only be effected if they offer distinct advantages to groups of users. Users of data communication form such a group. The creation of a sub-network is an optimization of part of the network as a whole in behalf of a specific group, for which general provisions can be made to offer adequate range of services and to stimulate growth. A packet-switched network has characteristics: - Each packet has a label, enabling packet retransmission and alternative routing. - Common use is made of circuit hardware, so that the costs compare favourably with circuit-switching. Packet-switching is economic. - Systems and terminals with different speeds can co-operate because a packet-switched network is not transmission transparent but nevertheless information-transparent. Packet-switching is compatible. - It is not too difficult a job to extend the management centre needed for exploitation of the network to include a diagnostic network information centre for the user. A packet-switched network supports the user's data processing management. - A packet-switched network offers a firm base for giving direction to the standardization promoted by a public network.
Development and utilization of a space station mission simulation model
Authors: Karen D. Brender, Charles P. Llewellyn
Venue: Proceedings of the 1967 22nd national conference (1967)

Over the past few years the growing complexity and costs of systems required to support space research and technology have generated a need for improving overall program management and concept evaluation techniques. Some of the more recent areas of study in space research have been devoted to the conceptual design of orbiting, manned space stations capable fulfilling basic, space related, research objectives. These system designs must reflect operational requirements for maximum utilization of available resources and identify important parameters for consideration in future plans.
Recent advances in information retrieval (Tutorial Session)
Authors: David Lefkovitz, Julius T. Tou, Chung-Shu Yang
Venue: Proceedings of the 1976 annual conference (1976)

File organizations which support interactive retrieval for large data bases is a major concern of information system designers. This session explores recent advances in the design of such organizations. Two papers address themselves specifically to the file organizations of existing interactive retrieval systems and present relevant operational statistics of the systems. A third paper reviews recent developments in the design and evaluation of file organizations. Comparisons of the costs of querying and updating conventional organizations, clustered organizations and a new class of hybrid list organizations are presented.
Teaching both PL/I and Fortran to beginners
Authors: Glen E. Newton, J. Denbigh Starkey
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

The overall approach to programming languages taken in the course is to use PL/I (with the PL/C compiler) during the first part of the semester to introduce programming concepts and techniques, then teach Fortran (with the WATFIV compiler) during the last part of the semester [2,3]. Except for a brief discussion of conventional flowcharts to help students read the examples in the texts, Nassi-Shneiderman structured flowcharts are used throughout the lectures and labs [4]. Algorithms are written in PL/I using DO-WHILE as the primary control structure, and GOTOs are not introduced except in Fortran.
Expert systems&mdash;a technology for intelligent assistance
Authors: Harry C. Reinstein
Venue: ACM SIGAPL APL Quote Quad (1981)

Researchers in artificial intelligence have developed several systems capable of providing an expert level of assistance in solving complex problems. Areas addressed have included medical diagnosis and therapy, determination of molecular structure, design of experiments in molecular genetics, and application definition. These systems are generating interest in both the industrial and academic communities, and widespread development is beginning to emerge. Expert systems share a common architecture and this presentation will describe this architecture and contrast it with classical problem solving techniques. Several examples of these systems will be discussed, including a new expert system developed at the IBM Scientific Center in Palo Alto. While most expert systems have been programmed in LISP, this one was built using APL, and the experience has illuminated both strengths and weaknesses of APL as a language for this area of artificial intelligence.
The structure and use of a test generating system designed to facilitate individually paced instruction
Authors: Roger M. Palay
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

The structure and use of a test-generating system having the following parameters is described. 1. Each test is a ten item multiple choice instrument where each item has five (5) alternatives. 2. Each test is generated from a relatively small file (most often less than 150 card images). 3. Although the file contains only five (5) disjoint tests, over nine million different tests (each with its own set of correct answers) can be generated from it. 4. The correct answers to each test are stored directly on the test (in coded form). 5. Test responses are machine correctable and such correcting need not be done on the system that generated the test. 6. The reliability of different forms of tests generated from one file is theoretically high (no statistical evidence is available to support a claim of high reliability). 7. The grading program produces a total score as well as giving the correct answers for all items on that test.
A system for reliable engineering software
Authors: L. M. Culpepper
Venue: Proceedings of the international conference on Reliable software (1975)

Much of the software developed to support engineering design calculations is produced by persons whose primary job skill is not that of computer scientist. Software validation techniques suitable for use by these engineer-programmers have been under investigation by the Navy as part of a project designed to increase the reliability, usability, and portability of engineering design software. The results of the project are summarized and a software validation tool is described.
An open queueing network view of computer system performance
Authors: Duane R. Ball
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

ACMS is a modeling system which translates user-supplied hardware and software descriptions into an activity network and then uses open network queueing theory approximations to estimate the time required for transactions to pass through the network. It is particularly suited for use in estimating the capacity of a computer system, identifying system bottlenecks, evaluating the performance of proposed hardware configuration and software designs, identifying the least-cost set of resources required to achieve a desired performance level, and evaluating the performance impact of both new applications and growth in existing ones. Features that support the automated sizing of computer systems make ACMS unique among analytical modeling tools. ACMS provides the user with statements to specify device costs and constraints on the number of devices of each type that may be configured. Based on these costs, device performance characteristics, and process completion time goals; ACMS will select, from a menu of possible choices, a set of hardware which minimizes system cost and meets the performance goals.
Computer security in the federal government: Where we are, how we got here, where we are going
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

On July 27, 1978 the Office of Management and Budget issued a policy statement entitled &ldquo;Security of Federal Automated Information Systems&rdquo; (Transmittal Memorandum No. 1 to Circular A-71). For some government agencies this will mark the beginning of computer security. For others it will only mean a continuation of a program which has been underway for many years. The military sector of the U. S. Government has led the way in implementing computer security and in developing advanced systems to improve it. For many reasons, the civilian agencies have lagged behind.
Business Information Analysis and Interaction Technique (BIAIT): Finding the big Payoff Areas
Authors: Walter M. Carlson
Venue: Proceedings of the ACM 1980 annual conference (1980)

While growth of the computer industry and the computing profession have been phenomenal, this growth has not been accompanied by improved communication between top executives in user organizations and their DP managers about effective use of the new computer-based information technologies. There remains a critical need for ways to demonstrate the impact of computer applications on management's ability to get the best results out of the resources under their control. One candidate for solving this communication and evaluation problem is the Business Information Analysis and Integration Technique (BIAIT). It has grown out of some IBM research and is being developed within IBM and by others. The current range of uses covers application development planning and implementation, marketing planning, and organization analysis; other uses are visualized for the future. The application development planning approach receiving major attention is called Business Information Control Study (BICS). Based upon the BIAIT principles, the BICS approach produces prompt identification of problem areas having high management visibility and big potential for payoff from use of computers.
Phled45: An enhanced version of caesar supporting 45&deg; geometries
Authors: Ann R. Lanfri
Venue: Proceedings of the 21st Design Automation Conference (1984)

Caesar is an interactive graphic editor that is used to generate layouts for VLSI circuits. It runs on a VAX-11/780 under the UNIX 1 operating system with Berkeley extensions. Caesar has a unique and simple user interface. Phled is an enhanced version of Caesar that runs on a M68000-based engineering work station. Phled45 is based on Phled; its distinctive feature is the ability to enter layout containing 45&deg; angles. The design considerations for implementing the capability to edit 45&deg; shapes are discussed. The details of the implementation are presented.
Simulation modeling by stepwise refinement
Authors: J. N. Beauchamp, R. C. Field
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

Application of the structured programming concept of stepwise refinement to modeling is described and developed. Modeling by simulation with GPSS (General Purpose Simulation System) is emphasized, even though the full modeling activity undertaken included analytical and brassboard modeling as well. Stepwise refinement was applied rigorously to the simulation model, and also used for the analytical and brassboard models. The simulation model is described in detail. The network, node and implementation analysis that provided the numerical basis for operation of the model are also described. How the concept of stepwise refinement was applied to the development of the simulation model in GPSS is thoroughly described. Results of the simulation models show how stepwise refinement can maximize useful output with respect to cost and effort invested.
The development of user microprogramming: A survey and status report
Authors: Richard T. Thomas
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

Over the past few years there has been an increasing interest in user microprogramming. This paper traces the development of user microprogramming, surveying several different modifications made to commercially available microprogram control computers. A brief overview is given of various proposals for machines allowing user microprogramming as a basic design goal. Also, several contemporary machines which allow user microprogramming are discussed. The various microgrogramming facilities provided with the machines are presented, along with the manner in which some of the problems inherent in allowing user microprogramming have been dealt with.
String analysis and synthesis in SL5
Authors: Ralph E. Griswold
Venue: Proceedings of the 1976 annual conference (1976)

Advances in the understanding of string pattern matching have led to a coroutine model for scanning procedures that has been the basis for recent work. Motivated by the success of this work, the SL5 programming language has been developed to provide a vehicle for research in these areas. This paper describes the string scanning facilities of SL5 and illustrates how they may be used in the analysis and synthesis of strings.
Forms-based automatic program generation
Authors: David W. Embley
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

An approach to automatic program generation based on descriptions of data processing operations by means of conventional administrative forms is described. A formal definition of a form provides for the specification and generation of program templates, and a library of knowledge about data objects and their properties provides for a description of data types for items on forms and of relationships among these items. An example shows how an application &ldquo;programmer&rdquo; can communicate to the system the necessary information to automatically produce a desired program.
On notions of information transfer in VLSI circuits
Authors: Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

Several papers have recently dealt with techniques for proving area-time lower bounds for VLSI computation by &ldquo;crossing sequence&rdquo; methods. A number of natural questions are raised by these definitions. 1.Is the fooling set approach the most powerful way to get information-transfer-based lower bounds? We shall show it is not, and offer a candidate for the title &ldquo;most powerful.&rdquo; Of course, without a precise definition of &ldquo;information transfer argument,&rdquo; there could be other contenders. 2.Are the notions of the three papers cited equivalent? We shall exhibit certain inequivalences among the three notions, although open questions remain. However, we can resolve an open question of Papadimitriou and Sipser [PS] concerning the relationship between nondeterministic and deterministic communication complexity.
Automated board layout
Authors: Jerry G. Harvey
Venue: Proceedings of the 9th Design Automation Workshop (1972)

The increased complexity of computing systems, combined with the economic necessity of rapid system development, has resulted in the allocation of considerable computerized aids to the development process. Such automated design aids have been used by the major computer manufacturers to facilitate design, documentation, manufacturing, and testing of computer systems. UNIVAC has used computer aided design since 1958 with many processes and aids now essential in development efforts. The evolving Automated Design System is illustrated. This system has the following functional capabilities: logic equation handling, logic simulation, automated logic diagrams, automated board layout and routing, and artwork generation. Section 2 of this paper contains a description of the Automated Board Layout and Routing Subsystem, including a description of the algorithm used for routing. The remaining subsystem is described in the following paragraphs.