ppxscal/embedding_network huggingface dataset:
Impact of recent privacy legislation: Minnesota and federal
Venue: Proceedings of the 1975 annual conference (1975)

The panelists will examine recent Minnesota and Federal privacy legislation for the purpose of determining the extent to which this legislation has accomplished or failed to accomplish announced theoretical objectives. Clearly, such legislation has been unsuccessful in accommodating the expectations of the theorists. Thus, in Minnesota the Data Privacy Act, as amended, is only partly involved with privacy but very deeply concerned with records management and the right of public access&mdash;a right and process which is actually antagonistic to the exercise of the right of privacy. Data processing systems designers have been affected. All are wondering what impact the &ldquo;law&rdquo; will have on file design. Some, involved at the early stages of the legislative process, or in the development of a privacy theory, have had their expectations upset. The discussion will focus on ways in which administrative necessity and the legislative process have each served to reshape those expectations.
GASP II simulation of parts inventory for electronic fuze production
Authors: Clifford C. Petersen
Venue: Proceedings of the third conference on Applications of simulation (1969)

Inventory and shortage costs of more than one hundred types of piece parts used in the continuous production of the FMU-56/B proximity fuze were simulated using GASP II. Probabilities of lateness of received lots and of lot rejection were introduced on the basis of historical data on these specific parts. The program includes expedients for coping with parts' lateness and means of selecting lowest cost alternatives when lots are rejected. Order quantity and safety stock level are the input variables; annual inventory holding cost, inspection cost, and lateness/rejection work-around costs are the output criteria. Results include search runs on individual items and groups of parts, and evaluation of the effect of changing the random number seed.
Extending The Power Of Decision Support Systems 1 And 2 (Panel Discussions)
Authors: Franz Edelman, Eric D. Carlson, Peter G. W. Keen
Venue: Proceedings of the 1978 annual conference (1978)

These special Sessions will bring together researchers, practitioners and educators from the fields of Decision Support Systems (DSS) and Management Science/Operations Research (OR/MS) with the objective of strengthening and extending the power and applicability of DSS.
A CAD/CAM system based upon the iAPX 432
Authors: Donald J. Criscione
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

The Intel corporation has developed a 32 bit micro-processor which provides hardware support for object oriented applications, accommodates concurrent processing in a manner invisible to the user, and allows easy interfacing to peripherals. These features, along with numerous others that have never been offered before in a micro-processor, makes the iAPX 432 an attractive base for CAD/CAM. This paper outlines one possible implementation of a CAD/CAM system with the 432 at its heart. The advantages offered by the 432 are weighed against its limitations.
A firmware organization for minimal error evaluation in numerical computations
Authors: S. S. Hyder, V. Ung, J. Vignes
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The use of numerical arithmetic developed for general use in continuous space, on computers where numerical values are represented by a finite number of significant digits leads to errors that tend degenerate as computing progresses. The principle of the permutation-perturbation method is that, while in algebra a given algorithm provides a single result r, the same algorithm carried out on a computer provides a set R of numerical results that are all representative of the exact algebraic result r. The perturbation procedure acts on the data and result of each elementary operation, and the permutation acts on the order on which operations are carried out. A statistical procedure is used to generate r and its accuracy from a few elements of the set R. In practice the method consists in adding (or not adding) a bit in low order position of each operand and the partial and final results of a computation. The permutation procedure consists in permuting (or not) the non-associative operators in the algorithm. The software simulation of the P-P algorithm has given excellent results. We describe in this paper our approach towards incorporating this concept as a microprogrammed module. It is expected that the study will be a step towards a machine structure that will yield an evaluation of the error together with the numerical results of an algorithm.
Canonical representatives for residue classes of a polynomial ideal
Authors: Markus Lauer
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

At the EUROSAM Conference 1974 it was conjectured that there exist probably no canonical forms for polynomial expressions under polynomial side relations. In 1965, however, Buchberger had already implemented a reduction algorithm solving the problem over fields. Positive results were also attained independently since 1974 by R. Shtokhamer and the author. In this note a general theorem on canonical representatives is obtained and by application to Buchberger's and Shtokhamer's algorithms it is proven that the stated problem is solved.
Topological matching
Authors: Quentin F. Stout
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

There is a lot of practical and theoretical interest in designing algorithms to process digital pictures. Of particular interest are problems arising when one starts with an nxn array of pixels and stores it, one pixel per processor, in some sort of array-like parallel computer. In this paper we give an optimal &thgr;(n) time solution, based on a simpler &thgr;(n) time solution for a more powerful computer called a mesh computer. Beyer suggested that this problem was a prime candidate for a non-linear recognition problem, but our result shows that this is not true.
Documentation for in-house sharing of software
Authors: Eugene M. Strand
Venue: Proceedings of the ACM 1980 annual conference (1980)

This paper describes the standards for program documentation and a method of semi-automatic information dissemination used in software development in support of a clinical research facility. These standards establish the following concepts: a) Programs are community property. b) All written documentation is in the source listing. c) All program modules are in general libraries. d) Each program module has a standard, machine processable header. e) User manuals are generated in a semi-automated fashion. The documentation standards facilitate in-house sharing of major elements of software across a diverse set of applications.
More on selecting sequence numbers
Authors: Yogen K. Dalal
Venue: ACM SIGOPS Operating Systems Review (1975)

This note serves to supplement and extend the ideas and issues raised in [TO74]. Tomlinson examines the problem of establishing a connection (association), and being able to detect delayed packets of an old incarnation of a connection, when it is being opened and closed in quick succesion, or when the connection breaks owing to some crash and is restarted later. No protocol can guarantee reliability of communication given certain types of crashes [SU74], [BE74]. This last issue is out of the scope of this note. First the problem of establishing and closing a connection is further examined and the claim that a three way exchange is sufficient for single message transfer in [TO74] (even under conditions of a correctly functioning system) is refuted. Next the mechanism for implementing the &ldquo;clock-driven&rdquo; initial sequence number choice is examined in detail showing how various parameters interact, and the algorithms neccessary in order that it work. Finally alternative schemes to replace &ldquo;resynchronization&rdquo; are considered and the tradeoffs shown.
Improving the performance of interpretive hierarchies by the introduction of local hardware
Authors: Michael J. Manthey
Venue: ACM SIGMICRO Newsletter (1978)

This paper introduces the notion of improving the performance of interpretive hierarchies by filtering out trivial operations at the highest possible level of the hierarchy and executing them by hardware local to that level. The technique can be used either with microprocessors or a set of identical general purpose hardware modules together with tables specifying the details of the specific interpreters.
Student attitudes toward a new application of instructional television in a computer programming course
Authors: T. E. Bailey
Venue: ACM SIGCSE Bulletin (1973)

A new instructional television series for a beginning computer programming course was prepared, using a new format that was designed to be both informative (presented in a well organized, meaningful, clear, and concise manner) and interesting (gaining and maintaining close attention) and making use of special capabilities of the television medium. A television series so designed can overcome to a large extent the negative attitudes of students toward the use of instructional television.
Placement algorithm by partitioning for optimum rectangular placement
Authors: Edward P. Stabler, Viktor M. Kureichik, Valery A. Kalashnikov
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes methods for placement of DIP packages on a rectangular grid with minimum crossovers and wire length. The initial step is partitioning the components into subsets, one subset for each row, such that the connection between rows are minimized. An iterative procedure, yielding successively improved partitioning, is used for this purpose. Once the row sets are formed, a process for best placement of the DIP in a row is carried-out. The row is assumed to have either a one row channel for routing wires or two row channels. For both cases a placement which minimized crossovers and line length is obtained. The basic method uses simple branch and bound search procedures for placing the packages within a row set. In the placement procedure the objects being placed are wire nets rather than components. Previous work related to this problem is included in references [1-6].
Design of a microcode link editor
Authors: W. J. Meyers
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

We developed a microcode link editor (microbinder) that supports a variety of different micromachines. The microbinder resolves symbolic label references within and between separately assembled microcode modules, allocates space for each module in control store, and constructs the control store load image and supporting tables. The microbinder also provides a number of other services called for by the special nature of micromachines. It supports microprogramming conventions at a low level to prevent misuse of the hardware, at an intermediate level to limit microfunctionality in certain environments, and at a high level to improve microcode maintainability. Details of these conventions can be defined by the user, in a symbolic language coordinated with engineering documentation. The microbinder was implemented in a high level language, which contributed to its timely delivery, flexibility, and dependability.
GAME: A language for writing business GAMEs
Authors: Leonard Fertuck
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

The GAME Language is designed to greatly simplify the process of designing business and other organizational simulations. A successful game requires not only a well-specified model with appropriate relationships between variables, but also a specification of input data, output reports, file structures and error checks. It is these latter components which are usually the most tedious to code, the most poorly coded and the most standard in requirements. The GAME Language is designed to simplify or eliminate these functions while maintaining a great deal of flexibility in model specification. A generator converts free-format specifications in the GAME Language into a PL/I program. Options permit Monte Carlo and Sensitivity Analysis and corporate simulations.
Professional development seminars: Design review methodology for a data base environment
Authors: Bill Inmon
Venue: Proceedings of the ACM '82 conference (1982)

There are many variables to be properly managed in the building of a database application (especially on-line) which, if misunderstood or ignored, could lead to eventual failure. Design review methodology addresses the need to test the system design as early as possible in the development cycle in order to avoid the potentially high expense of implementing an inadequate design. The methodology provides a way to examine the soundness of a design at various points of a system development prior to the actual building of a system. Design review can be considered a method of quality control of system design. The methodology is an outgrowth of the structured walkthru concept, extended for on-line data base applications. The goal is to provide a perspective of the design from the point of view of meeting the specific requirements of the system and a balance between performance, flexibility, availability, and user function.
The bit bytes the word
Authors: Chris Hallgren
Venue: Proceedings of the 2nd annual international conference on Systems documentation (1983)

This paper discusses documentation from the vantage point of language. Documentation has several different uses and many different audiences. One method of specifying the systems documentation that must accompany system installation is to involve the users of the documentation in defining the documentation standards. This was done at Simpson-Sears in Canada, and nine different types of documentation groupings were identified, by audience and by use. Some verbal gymnastics were also performed.
LSI product quality and fault coverage
Authors: Vishwani D. Agrawal, Sharad C. Seth, Prathima Agrawal
Venue: Proceedings of the 18th Design Automation Conference (1981)

At present, the relationship between fault coverage of LSI circuit tests and the tested product quality is not satisfactorily understood. Reported work on integrated circuits predicts, for an acceptable field reject rate, a fault coverage that is too high (99 percent or higher). This fault coverage is difficult to achieve for LSI circuits. This paper proposes a model of fault distribution for a chip. The number of faults on a defective chip is assumed to have a Poisson density for which the average value is determined through experiment on actual chips. The procedure, which relates the model to the chip being studied, is simple; one or more fabricated chip lots must be tested by a few preliminary test patterns. Once the model is characterized, the required value of fault coverage can be easily determined for any given field reject rate. The main advantage of such a model is that it adapts itself to the various characteristics of the chip (technology, feature size, manufacturing environment, etc.) and the fault model (e.g., stuck-type faults). As an example, the technique was applied to an LSI circuit; realistic results were obtained.
Generating random variates from a distribution of phase type
Authors: Marcel F. Neuts, Miriam E. Pagano
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

An algorithm for generating phase type random variates is presented. A phase type distribution is any distribution which may be that of the time until absorption in a finite state Markov process. The exponential sojourn times allow us to record only the number of visits, k, to each state before absorption and then generate appropriate Erlang-k random variates. A related algorithm for the superposition of renewal processes of phase type is also discussed.
A Basic program package for introducing the top-down approach to computer programming
Authors: Ronald G. Ragsdale
Venue: Proceedings of the tenth SIGCSE technical symposium on Computer science education (1979)

In the summer of 1978, a program package was produced by six members of the class of course 1516, Programming Applications in Ontario Curricula, offered at the Ontario Institute for Studies in Education. The course participants were secondary school teachers of computer science or related subjects.
Content-Based Similarity Retrieval of Images Based on Spatial Color Distributions
Authors: Hidenori Yamamoto, Hidehiko Iwasa, Naokazu Yokoya, Haruo Takemura
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

The importance of image retrieval systems which search image databases for images that users really want to see has been increasing, while advances of the computer technology enable us to make large image databases easily.This paper proposes a content-based image retrieval(CBIR) system in which an example image is given as a query. One of the most important factors of CBIR by using a pictorial query is the design of features which represent the appearance of the query image. To capture the color distribution of images, the proposed method uses multiple local color histograms corresponding to segmented sub-regions, while most of previous histogram-based image retrieval systems use a global single color histogram for an entire image. Segmentation of an image is done by dividing the image into two rectangular regions recursively based on the discriminant analysis. The resulting binary tree structure of regions facilitates the evaluation of similarity among images.The paper also describes two kinds of experiments and results to demonstrate the discriminant ability of our system and to evaluate the consistency of the proposed similarity function and a human sense of similarity of images. Results show that our system can effectively capture spatial color information and retrieve similar appearance images in comparison with the single histogram method. It was also confirmed that the proposed method improves the consistency of the similarity function and a human sense for many query images in the experiment.
Combat system decision aids simulation
Authors: Dominick J. Carlino
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

Today's submarine combat system is a sophisticated complex of hardware and software subsystems, information flow and human operations. Its operation and maintenance tax the abilities of its highly trained crews. It therefore remains a worthy goal to find ways for relieving the crew's load while preserving or improving its effectiveness. One area of interest, which promises to help attain this goal is that of decision support systems. These systems are generally designed to aid rather than replace human activity. The design of these systems has not matured to the level of an established, formal engineering science. Hence this design area provides ample opportunity for effective use of simulation and stimulation of hardware, software, information and operability concepts, models, prototypes and systems. This paper limits its scope to one application in the area of decision support system design. It considers the analysis and simulation of a combat system decision aid for on-board recovery from subsystem failures by helping to reorganize the combat system's remaining resources through the command structure's decision process.
Automated partitioning of hierarchically specified digital systems
Authors: Thomas S. Payne, W. M. vanCleemput
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes a heuristic algorithm for automatically partitioning digital systems. High level information contained within a hierarchical design is used to increase the effectiveness of this algorithm. This algorithm uses a constructive process to build a physical design of a hierarchically specified logic design. An iterative improvement step is then done.
Design optimization of small logical systems
Authors: Jacques J. Vincent Carrefour
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

With the rapid development of new technology, particularly the appearance of integrated circuits, the problems of computer automatic design have been markedly modified; the space held by each gate and even cost have been so reduced that their optimization, although still necessary, has lost most of its importance. Other criteria that must also be considered are, for example: reliability, feasibility and ease of repair. With the ever increasing importance of printed circuits, we feel that it is in this direction that most attempts should be made. Several algorithms for design are well-known; each, however, yields differing results; the purpose of this paper is to obtain statistical comparisons between some of these methods, as regards results obtained, time necessary for computation and size of core-memory needed. From these results, it becomes easy to select the best method for each particular design case.
Toward a theoretical basis for estimating programming effort
Authors: M. H. Halstead
Venue: Proceedings of the 1975 annual conference (1975)

The measurement of static properties of small algorithms yield data which, when combined with suitable assumptions, provide an equation for estimating the time required to program them. This equation, which contains no arbitrary constants, is tested against a small data sample, and the results do not invalidate the hypothesis.
Fuzzy and multivalues logic
Authors: P. J. Macvicar-Whelan
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

Image formation by a simple convex lens illustrates well known aspects of fuzziness and probability theory. In contrast to this case, classification of a variable such as human height into classes labeled linguistically as TALL, VERY TALL, etc. yields results that are difficult to interpret either as an example of a multivalued logic or as a fuzzy set as formulated by ZADEH. These considerations imply some characteristic properties of a practical fuzzy set theory. Also implied is the need for more experimental work to lay a firm foundation for a practical fuzzy logic.
Design rule verification based on one dimensional scans
Authors: P. Wilcox, H. Rombeek, D. M. Caughey
Venue: Proceedings of the 15th Design Automation Conference (1978)

Bell-Northern Research has developed a program for design rule checking of integrated circuit masks, based on a one-dimensional scanning technique using a novel data coding scheme for efficient processing of large volumes of geometric data. The rule checking concept is very simple and the program is small and easily implemented. The technique is also extremely economical, costing less than &dollar;100 to apply 25 design checks to a high density 5200 &micro;m square silicon gate n-channel mask. CPU time varies approximately as the power 1.2 of the amount of data in the mask.
Comparison of simulation results of dissimilar models
Authors: C Lazos
Venue: Proceedings of the 14th annual symposium on Simulation (1981)

Analytical and simulation models for the same idealised but realistic computer system are considered. The results for CPU utilisation and CPU queue length from the models compare very favourably, suggesting that the technique could be used to confirm the accuracy of a simulation model. Increasingly dissimilar models are also systematically investigated. It is found that the degree of dissimilarity of the models can be surprisingly large before the method of comparison can be considered as having broken down.