ppxscal/embedding_network huggingface dataset:
Session summary: Distributed Debugging
Authors: Thomas Gross
Venue: Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging (1983)

Both sessions on Tuesday morning (March 22, 1983) were devoted to the discussion of Distributed Debugging. Three papers were presented during the first part; then there was a lively panel discussion on Multiprocess and Distributed Debugging. Both session were chaired by John R. White (Xerox PARC).
Searching an Engineering Drawing Database for User-Specified Shapes
Authors: Stefan Müller, Gerhard Rigoll
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

In this paper we present a novel approach to the retrieval of engineering drawings based on the use of stochastic models. Engineering drawing databases can be searched intuitively by presenting sketches or shapes which represent details such as e.g. screws or holes in the drawings of mechanical parts.The query is represented by a so called pseudo 2-D Hidden Markov Model (P2DHMM) which is surrounded by filler states. These filler states generate the remaining part of the engineering drawing apart from the query shape or sketch itself.Thus, our approach aims to retrieve those images containing certain details and also locates these details in the retrieved images, even in cases where the query shape is embedded in e.g. hatching or is connected to other parts in the drawing. The proposed technique achieves a good performance which is demonstrated by a number of query and retrieval examples in this paper.
Probabilistic models of inverted file information retrieval systems
Authors: Jane W. S. Liu, J. M. Milner
Venue: Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation (1976)

In this paper, we study several probabilistic models of inverted file information retrieval systems. In particular, the portion of the system which performs the tasks of list accessing and merging is modeled. The average response times of the system for three different methods of managing the disk access and merge processor queues are discussed.
A systolic design rule checker
Authors: Rajiv Kane, Sartaj Sahni
Venue: Proceedings of the 21st Design Automation Conference (1984)

We develop a systolic design rule checker (SDRC) for rectilinear geometries. This SDRC reports all width and spacing violations. It is expected to result in a significant speed up of the design rule check phase of chip design.
Surface orientation and curvature from differential texture distortion
Authors: J. Garding
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

A unified differential geometric framework for estimation of local surface shape and orientation from projective texture distortion is proposed, based on a differential version of the texture stationarity assumption introduced by Malik and Rosenholtz. This framework allows the information content of the gradient of any texture descriptor defined in a local coordinate frame to be characterized in a very compact form. The analysis encompasses both full affine texture descriptors and the classical "texture gradients". For estimation of local surface orientation and curvature from uncertain observations of affine texture distortion, the proposed framework allows the dimensionality of the search space to be reduced from five to one.
Estimating the mean of a correlated binary sequence with an application to discrete event simulation
Authors: George S. Fishman, Louis R. Moore,  III
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

This paper discusses a procedure for interval estimation of the mean @@@@ of a correlated binary (0,1) sequence. The method assumes that the sequence is strictly stationary and that a particular string of m binary digits is a recurrent event in the sequence, where m&ge;l is unknown. Of the 2m choices for the possible recurrent events, the strings of all zeros and of all ones are examined. For each m&equil;1,2,... the sequence is demarcated by entrance to the recurrent event. The subsequences between the demarcation points thus form independent epochs by assumption. Classical techniques then yield variance estimates for the number of ones and zeros in the epoch as well as an estimate of the covariance of the ones and zeros. A quadratic equation in [?] is solved to obtain an interval estimate.
The numerical solution of a partial differential equation on the IBM type 701 electronic data processing machines
Authors: D. W. Ladd, J. W. Sheldon
Venue: Proceedings of the 1952 ACM national meeting (Toronto) (1952)

In 1927 Thomas1, and in 1928 Fermi2, obtained a partial differential equation now known as the Thomas - Fermi equation. From the solution of this equation with suitable boundary conditions may be obtained the charge and energy distribution of electrons in their ground state in a potential field. In 1930 Dirac3 obtained an equation somewhat similar to the Thomas-Fermi equation but with a term added to account in part for &ldquo;exchange forces&rdquo;, a quantum-mechanical effect. This equation is called the Thomas- Fermi-Dirac equation. Except for one-dimensional cases, this equation has never been solved (except, perhaps, very approximately), although since 1930 it has stood as a potentially powerful mathematical model for complicated systems such as molecules and atomic lattices, where the number of degrees of freedom prohibits the solution of the Schroedinger equation. During August, 1952, solutions of the Thomas-Fermi- Dirac equation for the diatomic Nitrogen Molecule were computed on the IBM Type 701 Electronic Data Processing Machines located at Poughkeepsie, New York. Different solutions were for different internuclear distances. The solutions obtained were very satisfactory in that the initially desired accuracy was actually obtained on the calculator. Here we describe the computing form used, the organization of the problem for the IBM Type 701 Electronic Data Processing Machines, and the speeds obtained. The physical interpretation of results and numerical methods used are to be discussed elsewhere
Etude and the folklore of user interface design
Authors: Michael Good
Venue: Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation (1981)

Research in user interface design is like the weather&mdash;everybody talks about it, but nobody does anything about it. While this isn't strictly true, the great majority of guidelines for user interface design that one is likely to come across are based on the experience or gut feelings of a particular designer. These are better than nothing, but they are made less useful since 1) a particular recommendation could be based on factors unique to the designer's own system, 2) the population for whom the particular system is intended is either not described in detail or is not a generalizable sample of computer users, 3) designers' gut feelings are notoriously inaccurate sources for human factors guidelines. Thus the main body of recommendations available to the designer of a new system is more in the category of folklore than of readily accepted engineering principles. So long as one recognizes these limitations, it is still very helpful to consider the recommendations one finds in the literature when designing a new system. Some of these are based on experimental evidence, while others are repeated often enough and with so little opposition that their utility is better than average. In this paper, I will show how these principles have been applied in designing the Etude text processing system. After summarizing the major ideas behind the design of Etude, I will focus on several specific areas of user interface design, comparing Etude's approach with the appropriate recommendations from the folklore. I will conclude by briefly describing a forthcoming experiment which is intended to determine if adherence to the folklore has in fact produced a system that is easy to use.
Adaptive multichannel distance filter
Authors: A. Buchowicz
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Multichannel distance filters are a class of nonlinear filters suitable for multivariate signal processing. The enhancement of one of those filters is proposed. It is based on local signal variance estimation and appropriate modification of the filter parameter. The experimental results on color images filtering are also presented.
A State-Machine Synthesizer&mdash;SMS
Authors: Douglas W. Brown
Venue: Proceedings of the 18th Design Automation Conference (1981)

Much of the work in implementing a state machine involves tedious calculations that require no creativity. This report describes the development of a digital-circuit synthesis program that helps reduce the tedium. SMS accepts a high-level description of a state machine and returns equations for implementation that assume a sum-of-products next-state and output functions and that also assume JK or D flip-flops for memory.
Using cache memory to reduce processor-memory traffic
Authors: James R. Goodman
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

The importance of reducing processor-memory bandwidth is recognized in two distinct situations: single board computer systems and microprocessors of the future. Cache memory is investigated as a way to reduce the memory-processor traffic. We show that traditional caches which depend heavily on spatial locality (look-ahead) for their performance are inappropriate in these environments because they generate large bursts of bus traffic. A cache exploiting primarily temporal locality (look-behind) is then proposed and demonstrated to be effective in an environment where process switches are infrequent. We argue that such an environment is possible if the traffic to backing store is small enough that many processors can share a common memory and if the cache data consistency problem is solved. We demonstrate that such a cache can indeed reduce traffic to memory greatly, and introduce an elegant solution to the cache coherency problem.
A system for solution of the placement problem
Authors: Peter L. Ciampi
Venue: Proceedings of the 12th Design Automation Conference (1975)

Placing elements into locations to minimize some function is a problem that appears in several areas. In the business world it is often called &ldquo;the assignment of facilities to locations&rdquo; [1] where the prime concern is problems such as assigning offices within a department, departments within a plant or placing warehouses for maximum distribution efficiency. Design Automation literature addresses the problem as the &ldquo;backboard wiring problem&rdquo; [2] This paper describes an interactive system, called IPLACE, that was designed to solve component placement on an interconnect plane but can be applied to other placement problem formulations. Problems can be solved with this system if (1) the problem has a set of elements, (2) a set of locations where elements are to be placed and (3) a list of interconnections describing how the elements communicate. Also the function being minimized must be related to element communication. Besides explaining the system this paper gives a detailed discussion and comparison of four algorithms (1) Steinberg's method of unconnected sets (2) steepest descent 2-way interchange, called gradient (3) 2-way interchange based on the first improvement in an interchange cycle (4) random search. These algorithms are applied to six sample problems and based on these results conclusions are drawn concerning the applicability, cost, and local minimum quality of each algorithm.
Computer aided simulation for computer system studies
Authors: George K. Hutchinson
Venue: Proceedings of the 10th conference on Winter simulation - Volume 1 (1978)

This paper introduces a simulation system, CAPS, which interacts with an analyst via an on-line dialog and produces a simulation program that is logically consistent and executes on first submittal. CAPS is based upon the use of activity cycles for system decomposition. Activity cycles are discussed and the system demonstrated by the simulation of a computing system. The major advantages of CAPS are the speed with which models can be implemented and its ease of use which permits non-programmers to develop sophisticated models. For example, the demonstration model of an interactive computer system, from the start of the CAPS dialog to simulation output, was 23 minutes at a cost of &dollar;3.29.
The state of undergraduate computer and data processing programs at public universities in Indiana
Authors: John Maniotes
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

The Commission for Higher Education of the State of Indiana has created a study committee on occupational education. This committee, called the &ldquo;Presidents' Committee on Occupational Education Programs,&rdquo; consists of the Presidents from Purdue University, Indiana University, Ball State University, Indiana State University, Vincennes University, and the Indiana Vocational Technical College. This committee has identified six broad occupational categories, and subcommittees have been appointed to study each of these categories. This papers summarizes the work (reference 1) of one of the subcommittees, the &ldquo;Task Force on Computer and Data Processing,&rdquo; regarding undergraduate computer-related programs at public universities/colleges in the State of Indiana.
Performance projection and evaluation for a transaction-oriented system
Authors: Stephen P. Gerke
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

This paper describes a methodology designed to aid the development manager in obtaining software that is consistent with a shared resource environment and interactive response times. The need for such a method and the characteristics required of it are established initially. Performance projection and monitoring tools are briefly surveyed to establish the rationale for the selection of those included in the method. The combination of these tools to form the overall performance evaluation method and the application of the method to the full cycle of software procurement are discussed. Its application to a large, transaction-oriented system is described in terms of: design evaluation, acceptance testing, system tuning, and method validation. Conclusions relate to technical and economical feasibility.
SCOAP: Sandia controllability/observability analysis program
Authors: Lawrence H. Goldstein, Evelyn L. Thigpen
Venue: Proceedings of the 17th Design Automation Conference (1980)

SCOAP is a program developed at Sandia National Laboratories for the analysis of digital circuit testability. Testability is related to the difficulty of controlling and observing the logical values of internal nodes from circuit inputs and outputs, respectively. This paper reviews the testability analysis algorithms and describes their implementation in the SCOAP program.
Mainframe consultants can be microliterate&mdash;without micros
Authors: Joyce Donley
Venue: Proceedings of the 11th annual ACM SIGUCCS conference on User services (1983)

Until recently, many of us in university computer centers had little to do with microcomputers on campus except to complain about them. But now that a few schools have announced with much public fanfare that all freshmen will buy, lease, or be given micros, and will be expected to use them, we are hearing our own universities begin to talk about &ldquo;catching up in computers&rdquo;. And many of us suspect that when university administrators think about computers, they usually think about the Computer Center. A computer is a computer, right? Thus we can expect that the services we are expected to provide will expand to include some type of consulting about microcomputers. For many years, the complaint we had about micros was that we had no &ldquo;control&rdquo;. Micros of numerous types were appearing, and only we computer professionals worried much about the problems of maintenance, compatibility, and appropriateness. Our attitude became, &ldquo;You didn't consult me before you bought that thing, so don't expect to consult me now&rdquo;. But we recognize that the time is fast approaching, if not here already, when that excuse will no longer work to keep us out of the micro business. At many computer centers, our concern is now with these two problems: (1) how can we expand our range of services without any increase in staff or facilities, and (2) how can we provide professional consulting assistance for equipment and software of which we have no real knowledge and which we probably have not even seen.
A declarative design approach for combining macrocells by directed placement and constructive routing
Authors: C. L. Wardle, C. R. Watson, C. A. Wilson, J. C. Mudge, B. J. Nelson
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper describes Sprint, an IC design system. Sprint is an integrated, hierarchical approach to VLSI design. All nodes (cells) in the hierarchy are abstracted in terms of their structural, electrical, and functional properties. Cells may be of arbitrary size and aspect ratio. The relative placement of cells is specified by the designer, and signal and power routing is automatically generated. Sprint has been successfully used by a six-person team to design a 100,000 transistor chip. The chip has been fabricated in a 2.5 micron, double layer metal, HMOS process.
A Mathematical Software Environment
Authors: Donald L. Williams
Venue: Proceedings of the 1986 workshop on Applied computing (1986)

Several hundred scientists and engineers work at Amoco Production Company's Tulsa Research Center. Naturally, scientific computing is an important part of their research in petroleum exploration and production. General purpose mathematical and statistical software is often overlooked when it could be used in place of writing code. Our strategy for increasing the awareness and usage of existing software is through advertisement of software via a reusable software catalog, through regular in-house presentations of a mathematical software seminar, and through the development of a Mathematical Software Environment, a collection of programs and procedures created to encourage the use of general purpose mathematical software.
Teaching techniques and quality education/training for the &ldquo;disadvantaged&rdquo;
Authors: Walter A. DeLegall
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

The unrelenting demands of parent groups for control of the public schools in their communities have generated increased attention concerning the quality of education received by the Black and Spanish-speaking youngster in his neighborhood school. That the public schools have been largely unresponsive to the needs of these students can be shown by the pinpointing of certain continuing inadequacies in the educational system. Often in a genuine effort to help, but occasionally for commercial reasons or simply to de-fuse and dissipate the burgeoning discontent of these communities, training programs for the &ldquo;disadvantaged&rdquo; minorities have sprung up. The data processing training program is a relatively recent component of the &ldquo;Anti-Poverty&rdquo; panacea. It is both curious and ironic that such programs, even when developed and administered by data processing professionals (who are equipped with the sophisticated techniques of systems and procedure analysis and supported by machines and software which make lunar exploration a present-day reality), merely duplicate the deficiencies of teaching techniques used in public schools.
Sets and graphs in GRAAL
Authors: Victor R. Basili
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

This paper is an attempt at presenting a high level model of the set and graph aspects of the graph algorithmic language GRAAL [5]. The problem area for which the language GRAAL was designed was the solution of graph problems of the type primarily arising in applications. It was designed with two objectives in mind. The first was to develop a language which permitted the writing of graph algorithms in a highly readable form with as natural a set of primitives as possible for describing the algorithm. The second was to allow for a wide variety of graphs of different types and complexity with as little degradation as possible in the efficient implementation and execution of an algorithm designed for a specific type of problem.
The alias and alias-rejection-mixture methods for generating random variables from probability distributions
Authors: Richard A. Kronmal, Arthur V. Peterson
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

The alias-rejection-mixture method is a general and exact method for the computer generation of random variables from an arbitrary discrete, continuous, or mixed probability distribution. The method is based on two ingredients: (1) Walker's alias method, an ingenious and efficient method for generating discrete random variables, and (2) the rejection-mixture method, which is a modification of the standard rejection method that eliminates the need to repeat steps of the algorithm. The generation of random variables by the alias-rejection-mixture method requires operations that are simple and few and, remarkably, approximately the same for all distributions.
Structure of mathematical programming systems
Authors: WM. Orchard Hays
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A mathematical programming system (MPS), as now implemented on third generation computers, constitutes four separate subject areas: 1. Algorithmic and procedural capabilities 2. Problem formulation and solution techniques 3. Programming languages 4. System structure and use Each of these areas involves extensive considerations and we can not do justice to any of them in the time available. Since problem formulation and solution techniques are so broad a subject in their own right, I shall not attempt to cover this area at all except insofar as it may provide illustrations for the other subjects.
Complex system modeling with statistical methods
Authors: John J. Helly,  Jr., Edward C. DeLand
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Modeling of complex systems can be greatly facilitated by the inclusion of empirical data directly into the solution of the model. Data can then be used to provide information about the fidelity of the model (goal) to the real system and/or act as a temporary model component for a subsystem not yet well-defined (probe). This method utilizes existing, highly-developed statistical packages to reduce development effort as well as obtain valuable statistical information useful in model validation. An example of the method applied to a molecular model of hemoglobin is provided.
The profitability of career planning
Authors: Herbert B. Safford
Venue: Proceedings of the ACM '81 conference (1981)

Understanding your skills and priorities is essential to the career decision-making process. Because your career decisions will probably determine the quality of your life for years to come, preparing and planning for your career is one of the most important moves you will ever make. One exciting feature of the computer field is the remarkable variety of choices in careers. Well trained computer people are in high demand in this rapidly expanding field. You will ask the question, &ldquo;Is there a place in computing for me?&rdquo;. How can you tell if you might do well in a computer career? Can you think of a business or profession which does not involve computers? Today there are few. Tomorrow there may be none. That fact alone should challenge you to pursue a career in computing. This industry is dynamic and growing. Career opportunities abound.