ppxscal/embedding_network huggingface dataset:
Computer-aided assignment of manufacturing tolerances
Authors: A. M. Patel
Venue: Proceedings of the 17th Design Automation Conference (1980)

This paper discusses the problem of assigning manufacturing tolerances in the development of a tolerance chart. A quantitative model is constructed so as to consider both the tolerance capability of the various processes used in the manufacture of a part, as well as the most effective way to combine tolerances in order to establish an overall tolerance. The variations of this model are discussed along with the manual trial and error method. It appears that significant reductions in manufacturing costs can be achieved by applying the automation methods presented in this paper.
&ldquo;A partitioning technique for LSI chips including a bunching algorithm&rdquo;
Authors: P. T. Wang
Venue: Proceedings of the 11th Design Automation Workshop (1974)

This paper discusses a partitioning technique which initially orders circuits according to a scoring mechanism, and thus uses a two-stage interchange technique to arrive at a final partition.
Software engineering programs at the Wang Institute of Graduate Studies
Authors: Richard E. Fairley, Nancy Martin
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

This paper describes the educational programs in software engineering at Wang Institute of Graduate Studies. Programs discussed are the Master of Software Engineering degree program, the Eastern Institute in Computer Science, the Distinguished Lecturer series, the Corporate Associates Program, and the Wang Institute Software Environment Project. Major emphasis is placed on the Master of Software Engineering program. The paper provides a definition of software engineering, states the goals and objectives of the Masters program, outlines admission requirements, presents an overview of the curriculum, and relates the admission requirements and curriculum to the goals and objectives of the program. The Eastern Institute and Distinguished Lecturer programs are non-credit educational programs open to the software community. The Corporate Associates Program and Software Environment project are software related service programs. The nature of these programs and their relationships to the Master of Software Engineering program are discussed.
A user interface for statistical databases
Authors: Rowland R. Johnson
Venue: Proceedings of the ACM '82 conference (1982)

Many statistical database applications require the use of aggregations to perform queries. Typically, the aggregation part of a query is the most difficult for a user to formulate. This work deals with the automation of the aggregation formulation process. To this end, a restricted type of aggregation, called summarization, is introduced. It is shown that summarization is sufficient in most cases. Essentially, summarization encourages the user to formulate a query without conceptualizing it in terms of aggregation. Instead, the user simply expresses the tabular form of the result. Another problem found in many statistical database applications arises when there are different measurements based on different partitionings of the same entity. For example, consider census data based on census tracts and pollution data based on pollution districts. Furthermore, the boundaries of census tracts and pollution districts do not coincide. Meaningful correlations between the census and pollution data can be obtained by the use of a statistical interpretation such as a weighted average or cubic spline contouring. The expression of a particular statistical interpretation to be used is the most difficult part of query formulation. Accordingly, the concept of complex summarization is introduced which allows the pre-specification of statistical interpretations. The process of choosing a statistical interpretation is easy and straightforward. Here again, a query is formulated by expressing the tabular form of the result and not conceptualizing in terms of aggregation.
A New Distinguishing Algorithm of Connected Character Image Based on Fourier Transform
Authors: Xiaoyan Zhu, Yifan Shi, Song Wang
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

Segmentation is the most difficult problem in handwritten character recognition system and often contributes major errors to performance. To reach a balance of speed and accuracy, a filter distinguishing connected image from isolated image for multiple stage segmentation is required. The Fourier Spectrum is promising in this problem. Since it is influenced by stroke width, we propose the standardizing method of Fourier Spectrum. Based on the standardized Fourier Spectrum, a set of features and a fine tuned criterion are presented to classify connected/isolated images. Theoretical analysis proves their rationality. Experimental results demonstrate that this criterion is better than other methods.
APL\INFO: A system for automatic documentation
Authors: P. Dell'orco, L. Bartolo
Venue: Proceedings of the sixth international conference on APL (1974)

An experimental system for automatic documentation is presented which allows an easy communication between user and system by means of a sophisticated query language, together with an high degree of conversationality, permitted by the use of APL. The main characteristics of the query language used are: - It is a superset of APL, in the sense that it uses a double level (linguistic and metalinguistic) in the request - It allows to define a real &ldquo;search program&rdquo; defined in terms of logical conditions defined by the user -It allows a search based on key-words and/or on keyword forms, holding on account morphological flexions.
Function assignment and arrays of functions
Authors: James A. Brown
Venue: Proceedings of the international conference on APL (1984)

APL has a simple direct notation for associating an array with a name. This paper proposes a notation for the direct association of names with functions and explores new syntax and operations for computing with arrays of functions.
The use and development of physical simulators
Authors: Sudhakar Paidy, Richard Reeve
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

This paper describes the development and use of a physical simulator involving a single server queuing process. The process simulated is analogous to the marking of pallet loads going into an AR/RS warehouse. The physical simulation process will be compared to a digital model using GASP IV. The objective of the study is to expose students to problems of real world data collection and control methods as well as teach principles of simulation.
Data management requirements: The similarity of memory management, database systems, and message processing
Authors: Olin H. Bray
Venue: Proceedings of the 3rd workshop on Computer architecture : Non-numeric processing (1977)

Memory management, database management, and message processing have in the past been defined in a relatively narrow way. With memory management the problem was to obtain cost effective use of real memory. Given a multiprogrammed environment, virtual memory systems allowed more effective use of expensive real memory. Memory management has become even more important with the development of very large and complex memory hierarchies. Database management systems were developed to allow the more effective use, sharing, and control of data resources - objectives which operating systems had previously provided for hardware resources. The driving force behind message processing has been the increased use of data communications and computer networks. This paper will consider the basis of the overlap in these areas, their common data management functions. Data management, as defined in this paper, includes the locating, routing, moving, and translating of data resources and the locating, reserving, and releasing of physical resources, i.e., primary and secondary storage. The analysis performed in this paper is essential because of trends in computer architecture discussed below. Early hardware was designed for general purpose environments with software used to tailor it to specific applications. However, according to Gagliardi9 future systems will consist of a set of subsystems, including a storage subsystem at the core surrounded by computational, spooling, and communications subsystems. The computational subsystem is the traditional &ldquo;number cruncher&rdquo; part of the system. The spooling subsystem provides the I/O interface between the system and the outside world. The communications subsystem links the various subsystems together and provides an interface to the rest of the network if the system is part of a larger distributed system. The storage subsystem consists of all the system's storage resources and their control processes. It controls all levels of the system memory and storage hierarchy. The storage subsystem controls the allocation of the physical storage resources and the movement of the data resources through the system. Depending on how these resources are used, they may be non-conserved or conserved, and if conserved, either serially reusable or sharable. Physical and data resources may be located, and if necessary reserved, independently or jointly.
Share-design automation workshop
Authors: J. W. Smith
Venue: Proceedings of the SHARE design automation workshop (1964)

During the past two days, we have heard some excellent presentation on current accomplishments and future plans for design automation. I submit that today's accomplishments lend adequate credence to almost anything we may wish to forecast for the future in this field. Since, to a great extent, that future will be determined by this group here assembled, it would be presumptuous of me to predict what will produce. Therefore, rather than forecast, I would like to challenge you with an old problem, suggest an approach to its solution and wait to see what kind of future you will mold.
The near blind leading the blind: One partial solution to the hacker battered student syndrome
Authors: Mary M. Hardell
Venue: Proceedings of the eighth SIGCSE technical symposium on Computer science education (1977)

This paper reports on an experimental course taught by the author at Worcester Polytechnic Institute. The motivation for the unusual structure of the course was to bolster student morale weakened by inadequate background. Students, whose performance in a course had been only average, were given academic credit for tutoring students in a trailing lectureless section. Student response was overwhelmingly favorable and academic results appear to be at least as good as under more traditional course structures.
MIDAS&mdash;microprogram description and analysis system
Authors: Igor Hansen
Venue: Proceedings of the 14th annual workshop on Microprogramming (1981)

This paper did not arrive in time to be included in the Proceedings.
Graphic time-sharing with real-time data bases
Authors: Jesse B. Hillman
Venue: Proceedings of the 1969 24th national conference (1969)

This system is being developed to process flight test data for the McDonnell-Douglas Corporation to significantly reduce flight test development and certification time and to reduce data processing costs. It is a time-sharing system using graphic cathode ray tube terminals. The system consists of nine processors: a Sigma 7 central processing unit, three general-purpose input/output processors, two special telemetry decommutator channels and three Sigma 2 central processor units. The real-time monitor system is resident with the batch processing monitor system and has, as a portion of its software resources, the batch processing monitor system. This time-sharing monitor allows five design and flight test engineers to interactively simultaneously communicate with three data bases: real-time flight data, post-flight data from tapes, and data files stored on disk (calibration data and aircraft configuration data). This system is unique in applying time-sharing to a real-time data base with a total band width of up to 2 million bits per second.
An on-line image processing system
Authors: I. H. Barkdoll, B. L. McGlamery
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The high-speed digital computer has contributed to significant progress in the field of optics. One particular area of optics benefiting from this progress is image processing. The purpose of image processing is to aid the human observer in extracting from an image information which has been obscured by some type of degradation The numerous factors which can degrade the quality of an image in an optical system include lens aberrations, poor focus, image motion, turbulence, and diffraction. In general, the problem of obtaining good images in an optical system should be approached by minimizing these factors by careful design and by control of conditions during recording of the image, usually on photographic film. However, there are times when all factors cannot be controlled sufficiently so that the recorded image lacks the required detail for a given application. In the past little could be done in the way of improving the image once it had been recorded. Now, recently developed processing techniques allow the image to be improved after it is recorded. Although there are several different methods by which these improvements can be made, one of the most powerful and flexible utilizes the digital computer. The purpose of this paper is to describe the basic method of processing, the difficulties facing the image processor working on practical problems, and a unique image processing system devised to overcome these difficulties.
Application of run time control to a multi-objective, user oriented simulation system
Authors: David Roggendorff, Dale Rowe
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The application of simulation as a system analysis tool is growing. One reason for this growth is that user-oriented simulation systems are being developed so that end users can interface directly with simulation systems without support from simulation &ldquo;experts.&rdquo; Although this is a healthy trend, end users of simulations tend to accept the results of their simulations without regard to confidence levels, stability conditions, or steady state attainment. It is the authors' experience that users tend to terminate simulations before the system has reached steady state in order to conserve computer time. This paper describes a system for automatic run time control of a discrete event simulation. A variety of run time control techniques were identified. Autocorrelation was selected on the bases of simplicity and efficiency and applied to a &ldquo;user-oriented&rdquo; simulation system, &ldquo;Data System Dynamic Simulator (DSDS).&rdquo; A brief description of DSDS is provided along with results of a sample simulation employing automatic run time control of a DSDS implemented simulation.
DART: Expert systems for automated computer fault diagnosis
Authors: Michael Genesereth, James S. Bennett, Clifford R. Hollander
Venue: Proceedings of the ACM '81 conference (1981)

In anticipation of computer faults, most manufacturers prepare specialized diagnostic aids that allow field engineers without complete knowledge of a system to diagnose the majority of its failures. Unfortunately, these diagnostics are not infallible for they do not take into account every fault and combination of faults for every possible system configuration. Thus, in some cases, it is necessary to call in someone with expert knowledge about the design of the system. These experts are expensive and often not immediately available, and there is inevitably a delay and a loss of working time to the system users. DART is a joint project of the Heuristic Programming Project and IBM that explores the application of artificial intelligence techniques to the diagnosis of computer faults. The primary goal of the DART Project is to develop programs that capture the special design knowledge and diagnostic abilities of these experts and to make them available to field engineers. The practical goal is the construction of an automated diagnostician capable of pinpointing the functional units responsible for observed malfunctions in arbitrary system configurations.
Help for highway maintenance administrators-a highway maintenance simulation model
Authors: James M. Pruett,  Ph.D.,  P.E., Rodolfo Perdomo
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The functions related to highway maintenance are often conceptually simple (repair the highway) and administratively complex (alternatives related to priorities, approaches, resources, and many others). Highway maintenance administrators are often faced with questions about which little or no definitive information exists and asked to make the proper decision. For example, if some amount of money is available for equipment, which type of equipment should be purchased? How many such equipment units? Where should they be placed and so forth? The dilemma of wanting to do the job well (i.e., make the best decision) and not having sufficient data with which to work is disconcerting at best. The highway maintenance simulation model described in this paper is intended to help alleviate the highway maintenance administrator's problem by providing a flexible highway-maintenance-decision-laboratory in which alternative courses of action may be tested. The simulation model is the result of a two-year project sponsored jointly by the Louisiana Department of Transportation and Development and the Federal Highway Administration, with a scheduled completion date of September, 1979.
An exact analysis of the distribution of cycle times in a class of queueing networks
Authors: P G Harrison
Venue: Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1983)

Prediction of detailed characteristics of the time delays experienced by customers in queueing networks is of great importance in various modelling and performance evaluation activities: operations research, computer systems and communication networks. Their statistical properties have been investigated predominantly by simulation techniques with the exception of mean value analyses for which Little's Law is applied. Theoretical studies of the probability distributions of time delays tend to be based on their Laplace transforms, which are of limited use, can be inverted analytically only in very simple cases and present substantial computation problems for numerical inversion. An exact derivation is presented for the distribution of cycle times in so called tree-like queueing networks. The analysis is performed for a network structure which is such that it is not necessary to mark a special customer, so avoiding expansion of the state space. Cycle time distribution is derived initially in the form of its Laplace Transform, from which its moments follow. A recurrence relation for a uniformly convergent discrete representation of the distribution then follows by a similar argument. Finally, the numerical results obtained for some simple test networks are presented and compared with those corresponding to an approximate method, hence indicating the accuracy of the latter.
The design of a high-level, language-independent symbolic debugging system
Authors: Mark Scott Johnson
Venue: Proceedings of the 1977 annual conference (1977)

The design of a language-independent, interactive system to facilitate the analysis and symbolic debugging of computer programs written in high-level languages is presented. The design criteria of such a system are enumerated, and its realization is illustrated by examples of debugging commands and procedures encoded in a debugging language.
Applications in the physical sciences: BANZAI, a one-dimensional multienergy group neutron transport code for the IBM 709 and 7090 systems
Authors: T. F. Wales
Venue: Proceedings of the 1962 ACM national conference on Digest of technical papers (1962)

To DATE, the numerical attacks on the neutron transport equation have been primarily limited to the solution of the equation in its differential forms, as exemplified by the various spherial harmonics and SN programs. This report will describe a different approach, VIZ, the numerical solution of the integral equation. The principal advantage in this approach is that the scalar flux (and hence the vector flux) is obtained exactly. We are thus able to solve problems in which the vector flux changes sharply due to discontinuities in the moderating medium. This is a particularly useful feature for investigating boundary effects. Since the integral transport equation is one of the most intractable in modern neutronics, a number of numerical techniques, useful in the acceleration of convergence of the iteration process, were developed and will be outlined. These methods include inner energy iterations, analytically derived optimum extrapolation parameters, a cross-spatial multiple sweep technique based on the aforementioned parameters, and a series of very accurate integration formulas based on the analytical characteristics of the integral of the spatial flux distribution function.
Optimal wiring between rectangles
Authors: Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

We consider the problem of wiring together two parallel rows of points under a variety of conditions. The options include whether we allow the rows to slide relative to one another, whether we use only rectilinear wires or arbitrary wires, and whether we can use wires in one layer or several layers. In almost all of these combinations of conditions, we can provide a polynomial-time algorithm to minimize the distance between the parallel rows of points. We also compare two fundamentally different wiring approaches, where one and two layers are used. We show that although the theoretical model implies that there can be great gains for the two-layer strategy, even in cases where no crossovers are required, when we consider typical design rules for laying out VLSI circuits there is no substantial advantage to the two-layer approach over the one-layer approach.
Query Based Site Selection for Distributed Search Engines
Authors: Nobuyoshi Sato, Minoru Udagawa, Minoru Uehara, Yoshifumi Sakai, Hideki Mori
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We have developed a distributed search engine, called Cooperative Search Engine (CSE), in order to retrieve fresh information. In CSE, a local search engine located in each Web server makes an index of local pages. And, a Meta search server integrates these local search engines in order to realize a global search engine. In such a way, the communication delay occurs at retrieval time. So, we have developed several speedup techniques in order to realize fast retrieval. However, these techniques cannot be used for first page retrieval in "Next 10" search if the page has not been searched yet. So, we have proposed Query based Site Selection (QbSS), which is widely available in all cases. In this paper, we describe QbSS in detail and discuss its features.