ppxscal/embedding_network huggingface dataset:
Duplication of packets and their detection in X.25 communication protocols
Authors: Bijendra N. Jain
Venue: Proceedings of the 9th annual symposium on Computer Architecture (1982)

In the context of X.25 communication protocols, this paper is concerned with the process of duplication of packets at the frame level, and with their detection at the packet level. With suitable constraints involving (i) the window sizes used at both the frame and packet levels to flow control, and (ii) the numbering scheme used to number User Data packets, it is possible to detect and discard all duplicate copies thereof. Further, it is argued that duplication of 'messages' by a particular layer be detected at the level where these messages are generated and interpreted. Deferring this detection to higher levels is unnecessary and more difficult.
One man's view of training in structured methods
Authors: Donald R. Chand
Venue: Proceedings of the ACM 1980 annual conference (1980)

Training has traditionally been a recognized responsibility of EDP shops. The primary objective in training is to indoctrinate new and often inexperienced) hirees on the systems and applications of the organization. Otherwise, the EDP training function is limited to critical events, such as when the hardware or software is enhanced and updated or when a new software package is installed. In recent years, however, there has been a radical shift in the goals and purpose of EDP training. Today, a major portion of EDP training consists of enhancing or retooling the skills of analysts and programmers. The reasons for this shift are twofold: First, the complexity level of the new applications is steadily rising, seriously affecting the ability of the DP shops to complete projects on time and within costs. Second, new techniques for designing and implementing software systems have surfaced that often are not yet a part of the repetoire of the average system analyst or programmer. In this paper the author presents his views on the basic questions of: (1) the nature of structured methods, (2) the need and motivation for training DP professionals in the art and science of structured methods and (3) a suggested content for a training program in structured methods. The paper concludes with the author's experience of conducting training in structured methods and an analysis of the factors essential for a successful implementation of such training.
Building a complete inverted file for a set of text files in linear time
Authors: A. Blumer, J. Blumer, A. Ehrenfeucht, D. Haussler, R. McConnell
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Given a finite set of texts S &equil; {&ohgr;1, ..., &ohgr;k} over some fixed finite alphabet &Sgr;, a complete inverted file for S is an abstract data type that provides the functions find(&ohgr;), which returns the longest prefix of &ohgr; which occurs in S; freq(&ohgr;), which returns the number of times &ohgr; occurs in S; and locations(&ohgr;) which returns the set of positions at which &ohgr; occurs. We give a data structure to implement a complete inverted file for S which occupies linear space and can be built in linear time, using the uniform cost RAM model. Using this data structure, the time for each of the above query functions is optimal. To accomplish this, we use techniques from the theory of finite automata to build a deterministic finite automaton which recognizes the set of all sub words of the set S. This automaton is then annotated with additional information and compacted to facilitate the desired query functions.
Medical information systems integration (Panel Discussion)
Venue: Proceedings of the ACM '81 conference (1981)

For hospitals as well as for other complex organizations, the growth of integrated computer systems beyond traditional applications areas, such as financial processing, has led to a dilemma. Either the new applications are developed (or purchased) with the restrictive requirement of integrability with existing applications, or additional resources need to be devoted to the problem of allowing interchange of data among systems. In most cases, these system-to-system interfaces are developed on an ad hoc basis, tailored closely to the two systems being interfaced, and must therefore be modified whenever either system is changed. Although this situation is often tolerable when only two or three systems are involved, it usually consumes resources anc limits flexibility to an appreciable extent. The real problems with this approach, however, become apparent when the number of interacting information systems exceeds two or three, or when resources are simply not available to create and maintain ad hoc interfaces. Unfortunately, many institutions today are in the process of acquiring cr developing their third or fourth distinct application system, and this information systems integration problem is being encountered with increasing frequency. In particular, many users who elect to acquire applications systems from several different systems vendors have found that the functionality and efficiency of each of the systems is seriously impaired by continuing struggles with interfaces, even when the same hardware is in use on all the systems. From the vendor's viewpoint, this situation is equally bad. Some vendors respond by proposing a single, comprehensive information system to meet all of the organization's needs. Although this approach may seem the desirable one from the developer's standpoint, it has several serious drawbacks in practice.
Planned attitude change while teaching computer literacy
Authors: William R. Lucas
Venue: ACM SIGCUE Outlook (1976)

All instruction, no matter how technical, has goals beyond its basic cognitive context. Attitudes and other traits are often as important as technical knowledge. The student needs a positive attitude to deal effectively with complex computer applications and should have a balanced view of the opportunities and dangers presented by the use of computers. The basic conjecture of this report is that within the environment of a computer literacy classroom student attitudes can be analyzed and systematically changed. The procedure described involves an attitude measuring instrument which was used to design specific instructional activities with well defined goals.
Human factors training and awareness
Authors: Dorothea Grimes-Farrow
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Transferring human factors technology to designers involves complex issues: training, human factors data, interdisciplinary communications, designers' preferences, and organizational trends. Training is a structured, formalized method for improving human factors technology transfer. Some of these formal approaches in academia and industry are explored, and recommendations for a systematic approach to training development and evaluation are offered.
Laminar extension: An overlooked capability and the search for its proper home
Authors: George Mebus
Venue: ACM SIGAPL APL Quote Quad (1979)

Scalar extension is an implicit conceptual replication of a single-element argument so that it matches the shape of another. Laminar extension is a related extension of an arbitrary array, formed by repeating layers (or laminae) of the array along a new coordinate or along an existing coordinate with a dimension of 1. A restricted form of laminar extension already exists in APL as an implicit conceptual process. This paper identifies needs for an explicit laminar extension, and shows that no adequate implementation is now available in APL. By examining existing primitives, the paper establishes one of them as the natural home for a primitive implementation of explicit laminar extension. Examples illustrate its utility, and an appendix discusses its relationship to the by-slice operator recently proposed by Jenkins and Michel.
A color movie simulation of a gas-water reservoir
Authors: Mark E. Johnson, Ellis A. Monash
Venue: Proceedings of the 11th annual symposium on Simulation (1978)

This paper presents the methodology for simulating hydrocarbon production from a gas-water reservoir using the GASP IV Simulation Language. A novel feature of this simulation application is the development of a 16 mm color movie for presentation of the results. This movie provides an effective mechanism for describing the behavior of the gas-water reservoir model under various operating conditions.
User services in a network environment
Authors: Jay O'Dell, Arthur Scott
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

User services in a network environment are quite different from those in environments with users in close proximity. Communication with remote users with advanced degrees requires different attitudes, knowledge, and techniques. The problems and solutions of education, documentation, software tools, and helping users debug programs over long distances will be presented.
I/O device Emulation in The Stanford Emulation Laboratory
Authors: Jerry Huck, Charles Neuhauser
Venue: Proceedings of the 12th annual workshop on Microprogramming (1979)

This report describes the implementation of an I/O device emulation system for a universal host machine, the Emmy. The actual system I/O devices are part of a PDP-11/05 system supporting the UNIX operating system. To support device emulation a process is established within this system to act as a simple I/O channel responding to host I/O requests. This channel process is able to provide three basic device structures: serial, linear and variable, which correspond roughly to character, disk-like and tape-like devices respectively. These structures have been found to be adequate for a wide range of system emulations. Examples of such systems and their performance are given.
Static determination of dynamic properties of generalized type unions
Authors: Patrick Causot, Radhia Cousot
Venue: Proceedings of an ACM conference on Language design for reliable software (1977)

The classical programming languages such as PASCAL or ALGOL 68 do not provide full data type security. Run-time errors are not precluded on basic operations. Type safety necessitates a refinement of the data type notion which allows subtypes. The compiler must also be able to ensure that basic operations are applicable. This verification consists in determining a local subtype of globally declared variables or constants. This may be achieved by improved compiler capabilities to analyze the program properties or by language constructs which permit the expression of these properties. Both approaches are discussed and illustrated by the problems of access to records via pointers, access to variants of record structures, determination of disjoint collections of linked records, and determination of integer subrange. Both approaches are complementary and a balance must be found between what must be specified by the programmer and what must be discovered by the compiler.
Consistency checking for MOS/VLSI circuits
Authors: Ning-Sang Chang, Ravi M. Apte
Venue: Proceedings of the 20th Design Automation Conference (1983)

A general algorithm is presented for consistency checking between schematics. A transistor level schematic is partitioned into functional blocks by tracing direct current paths. The first level consistency check is performed on the directed graphs constructed from these functional blocks. A recursive, graph matching algorithm is introduced to find signal correspondences in the functional blocks. The second level check is performed within the functional blocks for either identical component connectivity or logic equivalence. Performance of the program is demonstrated using an NMOS chip.
SWESS - the middle system of a design automation network
Authors: Denis K. Carley
Venue: Proceedings of the 14th Design Automation Conference (1977)

Western Electric in conjunction with Bell Laboratories has implemented a design through manufacture user orientated design automation system for Electronic Switching Equipment. The contents of this paper will highlight the middle system of the NODAL-SWESS-SPIDER CAD/CAM network that supports and/or controls design engineering information and manufacturing processes.
VGAUA: The Variable Geometry Automated Universal Array layout System
Authors: David C. Smith, Richard Noto, Fred Borgini, Shanti S. Sharma, Joseph C. Werbickas
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper presents the Variable Geometry Automated Universal Array (VGAUA) fully automatic physical layout program for gate array LSI which uses a single unique metalization pattern to personalize the array design. This fully automatic layout system minimizes the cost and time required for IC design and can be used over a range of array sizes from 800 to 3,500 gates. Each array size has its own unique, optimized, fixed geometry design for all levels except the programmable metalization level. The paper discusses both the topological design which makes the VGAUA program feasible and the software which makes the system automatic. The key to the success of the system is that the two items are heavily interrelated and highly interdependent.
Improving the performance of optimal joint decoding
Authors: U. Bayazit, W. A. Pearlman
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

The optimal joint decoder utilizing NLIVQ (nonlinear interpolative vector quantization) introduced by Gersho [1990] results in vector quantizers which have reduced encoding complexity at the expense of coding performance loss due to the inferiority of their space-filling property. We show a method of improving a high resolution NLIVQ codebook by partitioning its cells in such a way that the resulting lower resolution codebook consists of cells with better space-filling properties. The resolution reduction method is also extended to the case where the quantizer indices are entropy-constrained. From the simulations it is seen that the unconstrained and constrained entropy versions of the proposed vector quantizer have comparable performance to vector quantizers designed by LEG and ECVQ algorithms.
Definability in Dynamic Logic
Authors: Albert R. Meyer, Rohit Parikh
Venue: Proceedings of the twelfth annual ACM symposium on Theory of computing (1980)

We study the expressive power of various versions of Dynamic Logic and compare them with each other as well as with standard languages in the logical literature. One version of Dynamic Logic is equivalent to the infinitary logic LCK&ohgr;1&ohgr;, but regular Dynamic Logic is strictly less expressive. In particular, the ordinals &ohgr;&ohgr; and &ohgr; &ohgr;.2 are indistinguishable by formulas of regular Dynamic Logic.
Prerouting analysis programs
Authors: J. C. Foster
Venue: Proceedings of the 12th Design Automation Conference (1975)

Most people who are involved with routing printed wiring boards have one or more favorite indicators which they use to predict routing success. Generally these indicators are looked at more as an afterthought, however. If the numbers happen to be available, people might look at them, but seldom is there a deliberate attempt to find and analyze them. This paper shows why the process of calculating and checking indicators, called here prerouting analysis, is a profitable task. It further examines what should be measured and shows examples of three analysis programs which have proved quite useful in multilayer board routing, and then gives actual results to substantiate the claim.
Display requirements for the physician's office
Authors: Gayle E. Adams, Owen W. Miller, Douglas H. Dobbs
Venue: Proceedings of the 1972 SIGGRAPH seminar on Computer graphics in medicine (1972)

This paper presents a summary of the experience gained in operating a medical information system in a rural private physician's office. In particular, data is presented on this operational system which should be helpful to designers for defining the requirements of patient interactive devices.
Tutorial 5: An introduction to SIMSCRIPT
Venue: Proceedings of the 6th conference on Winter simulation (1973)

SIMSCRIPT is a computer language designed for discrete-state simulation. It possesses all the capabilities of FORTRAN plus several powerful features such as dynamic storage allocation and list processing. Features designed specifically for simulation include the ability to describe systems in terms of entities (which are &ldquo;blocks&rdquo; of attributes), sets (which are groups of entities) and events (which are &ldquo;scheduled&rdquo; subroutines). The benefits of and disadvantages of SIMSCRIPT are briefly compared to GPSS and FORTRAN. The concepts of SlMSCRIPT are illustrated in detail using a plague epidemic example. Other examples will be briefly presented to illustrate the versatility of the language.
Techniques of gate assignment
Authors: Lee Mah, Leon Steinberg
Venue: Proceedings of the 9th Design Automation Workshop (1972)

The purpose of this paper is to give mathematical formulations for several basic problems arising in the assignment of gates to chips and to derive automated techniques using these models. In particular, the following three problems are considered. (a) The determination of the set of chips to be used to implement a given segment of logic. (b) The decomposition of the set of gates or elements into subsets, which are then assigned to chips, so as to minimize the number of long wires. (c) The assignment of the subsets determined in (b) to physically positioned chips to minimize the total wire length. The techniques described have been programmed in FORTRAN on the UNIVAC 1108. The many boards that have been processed indicate that the procedure is fast and yields very satisfactory results in terms of ultimate routability.
A simulation method for multi-level data security analysis
Authors: Harrison R. Burris
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

A simulation methodology is presented for partitioning data sets of a sensitive data processing system into multi-level security classes according to a ranking of the resulting value to the system's opponents if the security of each data set were compromised. The value of the compromised data sets is determined by using a game-theoretic approach which simulates the environment in which the system under design operates. The same methodology determines the overall level of security achieved by a particular partitioning of the data sets. The methodology is applicable throughout the system life cycle.
Working capital management for the multinational firm: A simulation model
Authors: Andre Fourcans1, Thomas J. Hindelang2
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

The rapid growth of multinational corporations has hastened the need for the development of powerful models to reflect the new complexities imposed by the international interface. Working capital management is complex in the uninational setting where the firm must weigh the trade-offs between the liquidity and profitability of its current assets in the face of uncertainty. Significant additional dimensionality is added to the problem when foreign exchange rates, foreign tax methodologies, new sources of funds from foreign money markets, and new multi-faceted social, economic, and political factors are superimposed on the framework. This paper develops a simulation model to assist the multinational firm in the management of working capital for all of its subsidiaries considering their needs, world-wide short-term opportunities, and global sources of short-term funds. The simulation methodology is used in conjunction with a linear programming model which determines the optimal sources and uses of short-term funds for each subsidiary given the values that have been generated for each exogenous variable in the system. The overall model capitalizes on the strengths of both simulation and the linear programming optimization model and thus, yields a flexible but robust approach to this difficult problem setting.
Current perspectives on selection testing (Panel)
Authors: William H. Enneis, Jean M. Palormo, Wayne W. Sorenson
Venue: Proceedings of the ninth annual SIGCPR conference (1971)

Today certain types of discrimination are illegal&mdash;age, sex, race and national origin. Now only valid selection devices can be used. We have assembled a knowledgeable panel to discuss the implications of this situation for managers, selection personnel and researchers. Dr. Enneis will present the government point of view. Miss Palormo will discuss the reaction of test publishers and researchers, while Mr. Sorenson will bring in the viewpoints of the personnel man who is out on the firing line. As Dr. Willoughby said, I am here today representing the Equal Employment Opportunity Commission, established under Title VII of the Civil Rights Act of 1964. Title VII states that discrimination in any condition of employment is illegal on the basis of race, color, religion, sex or national origin. The EEOC has, in addition, interpreted the law to mean (and the courts have upheld us) that employment decisions and conditions may not be made on variables correlated with race, color, sex, religion, or national origin when those variables have no demonstrated job-relatedness. To date results from a few studies have emerged, but we are still far away from definitive answers to the many questions that have been raised. However, each individual study adds some understanding and suggests hypotheses. In the next few minutes, let us look briefly at some of these questions. Do existing tests discriminate unfairly against minority members? Two types of data yield evidence on this question&mdash;descriptive statistics (mean, standard deviations, range and shape of distributions) and predictive statistics. The comments of Dr. Enneis and Mrs. Palormo on this panel have clearly illustrated the influence of recent government legislation and administrative actions regarding selection testing and discriminatory practices in hiring. My role is to comment on effects these events have had on an individual firm. Perhaps the best way to illustrate my own current perspective regarding selection testing is to describe the selection testing program at my organization. A general statement of the position of State Farm concerning the use of psychological tests in personnel decisions is provided in this paper. This policy statement is intended to serve as a guide to individuals responsible for research on psychological tests, administrators of company testing programs, and to any person using psychological tests as an aid in making decisions about people. It is recommended that the concepts outlined in this position paper be implemented as quickly as the research foundation for the suggested programs can be established.
Dynamic variable resolution in the quickscreen combat model
Authors: John B. Gilmer,  Jr.
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The Quickscreen combat simulation has a scope of Corps level and dynamic resolution from division to battalion level and from 3.5 to 25 km. This allows a significant performance improvement. Disaggregation occurs when a unit enters an area near enemy units. It is broken down into subordinate units at a higher level of resolution. A physical space representation that treats resolution as a dimension supports this treatment. As the area of contact shifts due to the course of the battle, the region of maximum resolution will automatically be shifted.