ppxscal/embedding_network huggingface dataset:
Simulation
Authors: W. R. Franta
Venue: Proceedings of the 1975 annual conference (1975)

To paraphrase Mirham [9] the term simulation has come to have different meanings to different people. Here we limit our discussion to discrete event digital simulation, i.e. to simulations based upon dynamic models in which state changes occur at discrete time points. Central to the development of such models is the identification of system components, possible component interactions, and the morphological variables necessary to specify component and system state (see Mirham [8,9] for a discussion of these issues). The models are symbolic, albeit not formal. That is, for discrete event simulation models, it is not required that all variables be manipulated by formal mathematical methods. This degree of freedom is realized by permitting the inclusion of representational or procedural descriptions of variable and component interactions. It is, in fact, this single capability which gives discrete event simulation its appeal and versatility. We may study this freedom from a formal (see [1,2,11]) or, as in this tutorial, a practical viewpoint. Both views contribute, however, to ours overall understanding of the modeling and simulation process. The tutorial is divided into two distinct parts. Further, as the title conveys, the coverage is not introductory, but state of the art. First, note that to be useful the procedural descriptions mentioned above must be representable in the specification of the computer program, which when executed traces or mimics the dynamic behavior of the modeled system. The specification of the computer program must be made within the confines of the abstractions or concepts supported by the computer language selected to implement the model. My experience suggests that the limitations of the implementation language much influence the model from. That is, the concepts supported by the selected (or available) implementation language do much to determine the selection of system components, variables, and possible component interactions. Acknowledging that models are formulated mindful of implementation suggests we must exercise great care in the choice (if possible) of implementation language. We are fortunate that there exist versatile tools for the implementation of simulation models (e.g., the scenario approach to model building as supported by SIMULA [5]). The first presentation addresses issues such as these, pointing out the existence of simulation languages which aid the system analyst in building a model by presenting a conceptual frame-work for precise thinking, and further by serving as a programming language enabling the dynamic model behavior to be traced.
A discrete bio simulation - the population regulation of turtles
Authors: Keith P. Tognetti
Venue: Proceedings of the second conference on Applications of simulations (1968)

The nesting behaviour of sea turtles has been simulated using SIMSCRIPT 1.5. It is known that these nesting turtles may destroy the eggs in other nests in attempting to dig their nests. This simulation has been used to determine a quantitative relationship between the fraction of nests destroyed by the self induced mortality due to digging and the level of the turtle population. This paper emphasises the programming and simulation aspects of the study. The paper details the simulation and programming techniques in an attempt to demonstrate that the modelling of ecological systems is a task that could be readily undertaken by a biologist with the help of a language such as SIMSCRIPT.
An empirical comparison of fourier and walsh spectra for system identification
Authors: Paul Sanchez
Venue: Proceedings of the 16th conference on Winter simulation (1984)

Identification of significant factors has traditionally been a costly process. Initial results indicate that the use of spectral methods can reduce the number of simulation runs required to obtain the desired information. Two spectral methods will be compared to the traditional method of testing for factor significance. The paper introduces the concepts needed for the spectral methods, and the empirical results will be presented orally at the conference.
Performing remote operations efficiently on a local computer network
Authors: Alfred Z. Spector
Venue: ACM SIGOPS Operating Systems Review (1981)

This paper discusses communication among computers connected by a very high speed local network and focuses on ways to support distributed programs that require efficient interprocessor communication. It is motivated by the availability of increasingly high speed local networks and inefficiencies in existing communication subsystems. Mechanisms such as remote procedure calls, monitor calls, and message passing primitives are bases for interprocessor communication at high levels (i.e., within a programming language). At lower levels, interprocessor communication occurs via the transmission of data over some communication medium. On a local network, this basic communication mechanism is the transmission of packets. This paper is concerned with an intermediate communication layer for high speed local networks. To provide overall efficiency, this layer should provide communication primitives that (1) are a good basis on which to implement high level primitives and (2) are specialized enough to be implemented efficiently; for example, in a combination of microcode and hardware. To analyze communication primitives for this intermediate layer, we present a communication model called the remote reference/remote operation model in which a taxonomy of communication primitives is defined. We illustrate the model by describing an implementation of simple communication primitives on Xerox Alto computers interconnected with a 3 megabit Ethernet.
An automated system for testing LSI memory chips
Authors: H. D. Schnurmann, L. J. Vidunas, R. M. Peters
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes a software system for testing LSI memory chips. This system achieves complete automation by customizing test data for a given part number design and by creating an overall test program to be used by a computer-controlled tester in a manufacturing environment. This system encompasses DC testing of the memory product and test sites, AC testing under a variety of timing conditions, and generating a complete set of AC functional test patterns.
APL and I-D-S/II APL access to large databases
Authors: Bruce Frost
Venue: ACM SIGAPL APL Quote Quad (1983)

This paper describes the CP-6 APL interface to I-D-S/II databases. Special emphasis is given to those capabilities that are available within APL that are not generally available in other programming language interfaces. A brief description of the I-D-S/II functionality is provided for those not familiar with CODASYL database systems.
Documentation for the academic user
Authors: Stephen Rogowski
Venue: Proceedings of the 3rd annual ACM SIGUCCS conference on User services (1975)

The subject of documentation in university computing centers can cover a wide variety of topics. I do not intend to deal with the problems of documenting software packages which are largely written for the administrative sector. I would prefer to focus on the problem of documentation that is handed out to users, from which they are expected to be able to effectively use the capabilities of the particular machine. Although most of the problems involved in this area of documentation are not related to the type of machine, it might be useful to know a little about our environment at the State University of New York at Albany. Our enrollment is almost 15,000 students of which about 10,000 are undergraduates. There are over 150 academic programs from the bachelor's through the doctoral level. More than 15 million dollars in grants have been awarded to faculty and staff. We have on campus a UNIVAC 1110 (2 x 1) system. It is a time-sharing environment with about 354 K of internal memory. It has several drums and disks which allow a large amount of online storage. We have a full complement of software with everything from program libraries to plotting and statistical packages. The problems which I would like to address today are: -what needs to be documented? -who should do the documentation? -how should it be written? -how should materials be distributed?
Invited papers: History of writing compilers
Authors: D. E. Knuth
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

THIS PAPER will discuss the evolution of techniques used in writing compilers, from IT and FORTRAN to the present day. Five years ago it was very difficult to explain the internal mechanisms of a compiler, since the various phases of translation were jumbled together into a huge, sprawling algorithm. The passing of time has shown how to distinguish the various components of this process, revealing a basic simplicity.
Network security considerations in BLN
Authors: J. Yao
Venue: Proceedings of the eighth symposium on Data communications (1983)

In a heterogeneous computer network, resources on each node are protected by the local security mechanism. Network services allow local resources to be accessed remotely from other nodes. Without appropriate network security measures, each node is vulnerable to attack from the network. This paper analyzes the heterogeneous Bell Labs Network (BLN) environment and lists the potential network security risks. By assessing the risks, counter-measures are proposed for minimizing potential exposure. These counter-measures are part of a global network security mechanism being implemented for BLN.
extensions in linear regression
Authors: Herbert A. Morris
Venue: Proceedings of the ACM annual conference (1973)

In regression analysis, the computed equation is the one for which the sum of the squares of the &ldquo;Absolute Residual Errors&rdquo; is a minimum. It is very common for the equation to be accepted or rejected on the basis of the magnitude of the &ldquo;Percent Residual Error&rdquo; at each data point. In other words, we generally compute the regression equation under one criterian and accept or reject it on an entirely different basis. This is an inconsistant way to handle the problem. If we desire to accept or reject an equation on the basis of the percent error at each point, then we should minimize the &ldquo;Sum of the Square of the Percent Errors&rdquo;. If we derive the equation which will minimize the sum of the squares of the absolute error, then we should accept or reject it on the same basis. This paper considers the computational and theoretical aspects of the minimization of the sum of the squares of the percent error and advocates that an additional option be available to users of regression analysis programs.
Optical flow and deformable objects
Authors: A. Giachetti, V. Torre
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

When a plane undergoes a deformation that can be represented by a planar linear vector field, the projected vector field on the image plane of an optical device is at most quadratic. This 2D motion field has one singular point, with eigenvalues identical to those of the singular point describing the deformation. As a consequence, the nature of the singular point of the deformation is a projective invariant. When the plane moves and experiences a linear deformation at the same time, the associated 2D motion field is still quadratic with at most 3 singular points. In the case of a normal rototranslation, i.e. when the angular velocity is normal to the plane, and of a linear deformation, the 2D motion field has at most one singular point and substantial information on the rigid motion and on the deformation can be recovered from it. Experiments with simulated deformations and real deformable objects show that the proposed analysis can provide accurate results and information on more general 3D deformations.
Packet switching in banyan networks
Authors: Anand R. Tripathi, G. Jack Lipovski
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

This paper presents a formal scheme for addressing base and apex nodes in SW-banyan networks. This scheme is used for routing packets in the network. Packet-switching, in conjunction with the the circuit-switch mode of operation, offers a very flexible and powerful mechanism for interprocess communication in the multiprocessor architectures based on the banyan networks. Finally, a fault-tolerent scheme for re-routing the packets in the network is presented, in case the packet encounters a faulty node in its path.
Advanced LILAC - an Automated Layout Generation system for MOS/LSIs
Authors: Tokinori Kozawa, Hiroshi Horino, Tadakatu Ishiga, Junya Sakemi, Shoji Sato
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper describes the layout model and algorithm applied to an advanced LILAC system which is capable of automatically designing MOS/LSI chip layouts containing PLAs. The system, which is a fully automated design system, inputs logic description and outputs layout drawing.
A constructive approach to reliable synchronization code
Authors: Mark S. Laventhal
Venue: Proceedings of the 4th international conference on Software engineering (1979)

This paper describes a new approach to developing reliable software for communication between parallel processes. The basis of this approach is the shared use of abstract data objects, and the separation of synchronization-related software from the software performing the actual data access. The paper presents a language in which synchronization behavior for abstract data objects can be specified independently of other kinds of behavior. Specifications written in this language can be used as a basis for constructing the required synchronization software automatically. Also discussed is the use of such specifications in verifying properties of programs which make use of the abstract objects for interprocess communication.
SABLE: A tool for generating structured, multi-level simulations
Authors: Dwight Hill, Willam vanCleemput
Venue: Proceedings of the 16th Design Automation Conference (1979)

SABLE (Structure And Behavior Linking Environment) is a system currently being developed at Stanford to support structured, multi-level behavior specification and simulation of digital systems. SABLE accepts information about the nesting and interconnectivity of components, and combines it with descriptions of their behavior, which are written in a new language called ADLIB (A Design Language for Indicating Behavior). ADLIB allows users to define, the &ldquo;data level&rdquo; at which each component operates, and to specify mechanisms for translating information between these levels. The facilities provided by SABLE are general and flexible, making it feasible to simulate a large system at several levels of abstraction simultaneously. Examples are included that illustrate: the use of ADLIB for behavior specification, techniques for data level translations, and a design methodology that makes use of multi-level simulation.
The complexity of design automation problems
Authors: Sartaj Sahni, Atul Bhatt
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper reviews several problems that arise in the area of design automation. Most of these problems are shown to be NP-hard. Further, it is unlikely that any of these problems can be solved by fast approximation algorithms that guarantee solutions that are always within some fixed relative error of the optimal solution value. This points out the importance of heuristics and other tools to obtain algorithms that perform well on the problem instances of &ldquo;interest&rdquo;.
A new approach to data archive decision-making
Authors: Jane Wolin
Venue: Proceedings of the 5th annual ACM SIGUCCS conference on User services (1977)

As is the case at many educational institutions, Rutgers University is a member of several organizations from whom machine-readable data files are acquired. Up until last year, the administration of these memberships was handled by faculty members of various departments. However, since this proved to be an unsatistfactory arrangement, representatives from the interested departments, from the CCIS (Center for Computer and Information Services) and from the Rutgers Library met and decided that all data archives should be managed by the computer center. However, to ensure that the various departments would continue to have an active role in making the important decisions and establishing policy, a Data Base Advisory was created. This paper will discuss the events leading up to the formation of the Data Base Advisory Committee, describe its composition, purpose and activities and report on its first year of successful operation.
Towards the ideal programming language
Authors: Robert G. Herriot
Venue: Proceedings of an ACM conference on Language design for reliable software (1977)

A programming language with good features and notation can help the programmer represent his abstractions in the programming language, and can also help someone else understand the original abstraction. There have been numerous proposals for better features. In this paper we propose several new ideas to improve the notation. First we suggest that class instances be named with a sequence of identifiers consisting of the class name preceded by modifiers. Then we propose that prepositions be placed before procedure parameters to suggest their role. Finally, we suggest that applicative and imperative operations can be separated semantically, and then recombined syntactically through the use of the &ldquo;which&rdquo; and passive operators.
Placement of variable size circuits on LSI masterslices
Authors: K. H. Khokhani, A. M. Patel, W. Ferguson, J. Sessa, D. Hatton
Venue: Proceedings of the 18th Design Automation Conference (1981)

With the advent of large scale integration (LSI and VLSI), logic circuit densities per chip have grown to hundreds and thousands. The arrangement of interconnected logic circuits of different sizes and shapes poses a difficult combinatorial placement problem. In this paper, an overview of techniques is presented for placing different size rectangular circuits with limited locations on the chip, considering the function of level sensitive scan design (LSSD)1, as well as wirability and electrical constraints. The automatic placement program (APLACE), encompassing techniques to handle various constraints, was developed in IBM's Engineering Design System. An overview is presented of the technique for partitioning logic into clusters (supernodes) and breaking the image down into a rectangular grid (super locations) for initial placement.2 Iterative techniques that improve the initial placement and satisfy wirability and electrical (D.C. and capacitance) constraints are outlined. The concepts of zero ground interchange to balance horizontal and vertical channel demand and zonal movement to distribute wiring are presented. APLACE was developed primarily for the layout of the 704 gate masterslice used extensively in IBM's System 3081, encompassing 750,000 circuits. It has been in extensive use in IBM since the early 1970's to design thousands of masterslice chips ranging from 320-1500 circuits for IBM's System 38,3-4 System 4341,5 System 8100, for the 5000 gate array microprocessor6,7 and for many others. The automatic layout method, APLACE, reduces design cycle time considerably and requires little or no manual intervention.
On the number of pairs of orthogonal cliques of a graph
Authors: Chung C. Wang
Venue: Proceedings of the ACM annual conference (1973)

For any set S of vertices of a graph G, we use <S> to denote the induced subgraph, i.e., the maximal subgraph of G with the vertex set S. Let V be the set of all vertices of G. If both <S> and <V - S> are cliques of G, we say that <S> and <V - S> form a pair of orthogonal cliques of G. The main result of this paper is to show that the number of distinct pairs of orthogonal cliques of a graph is either zero or an integer power of 2.
A high level data sublanguage for a context-addressed segment-sequential memory
Authors: George P. Copeland, Stanley Y. W. Su
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

This paper presents a high-level data sublanguage called SLICK for the manipulation and retrieval of data from normalized and unnormalized (hierarchically structured) relational tables. The language is designed to express the process used by information users to extract information from the tables. It eliminates the need for using extra variables, allows retrieval operations to be performed directly on unnormalized tables, and matches with the specific implementation of a context-addressed memory system. The language elements and their use are described and illustrated in many example retrieval statements. The simplicity of mapping high level statements to basic machine instructions for the memory system is demonstrated.
Interactive analysis of output from GPSS-based simulations
Authors: Richard W. Andrews, Thomas J. Schriber
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

An interactive FORTRAN subroutine is presented which can be used via HELP Blocks in conjunction with ongoing, GPSS-based simulations to determine and collect the sample size needed to estimate the mean of a process with a specified level of statistical precision. The subroutine assumes an autoregressive representation for the random variable of interest, and estimates the variance of the sample mean by estimating the order and parameters of the autoregressive process. The statistical methodology followed by the subroutine is that developed and reported by Fishman [1,2]. Under interactive user control, the subroutine goes back to the GPSS model as often as may be necessary to extend sample size to the point that the user-specified level of statistical precision is achieved. An example illustrating use of the subroutine with a GPSS model is presented, and experience gained in using the technique is discussed. Source statements for the FORTRAN subroutine are provided, facilitating the relatively easy use of this autoregressive technique for the community of GPSS modelers.
An automated system for responding to data service requests
Authors: Tina G. Bixby, Janet K. Vavra
Venue: Proceedings of the joint conference on Easier and more productive use of computer systems. (Part - I): Information processing in the social sciences and humanities - Volume 1981 (1981)

During the 1970s, there was a steady decline in the cost and size of computing hardware with a corresponding phenomenal growth in computing capability. Computers now help store, manage, duplicate and interpret vast quantities of data with an ease and relative economy undreamed of in the past. These developments have, over the years, fostered the growth of new research methods in a variety of fields, including the social sciences. Large and more complex bodies of quantitative data have been collected as social scientists seek ways to understand human behavior with empirical research methods and scientific sampling techniques. In addition to collecting their own data, researchers have also utilized vast amounts of machine-readable data that have been prepared by other researchers, governmental agencies, and private organizations.The changes in the computing industry combined with the increased demand for services have made it feasible for organizations to consider automating as many tasks as possible. FAST (Facility to Aid Servicing Transactions) is one system that was created in response to these conditions. This paper describes FAST and its impact on the organization which developed it.