ppxscal/embedding_network huggingface dataset:
DOCIL: An automatic system for printed circuit board (PCB) designing. A board description language and an algorithm to connect a set of points
Authors: Ma-Teresa de Pedro, Ricardo Garcia
Venue: Proceedings of the 14th Design Automation Conference (1977)

DOCIL is a system that have been designed in order to produce the layout of a two side PCB from the data the human designer usually deals with. Two conditions that have been set for the system. First it is portability and second a small system feasibility. We will speak of this later. This work is composed by two parts: First of them a board description language, and second a routing algorithm. The language is used to specify the characteristics of the problem such as board size, scales of the drawing, composing elements and its position, connections to be done, etc. ording to some specific criteria. Its originality consists on the stating of the problem. It attempts to connect a point to a cluster of points already connected by generating horizontal and vertical segments each on a different side of the board as usual. Once a chain of segments connecting the point to the partial connection has been found this chain is added to the partial connection. The procedure goes on until all the points are connected. Initially the partial connection may be reduced to a point. The generation of new segment is regulated by evaluation function. A value of this function is associated with each possible segment. As it has been indicated, horizontal segments go on one side and verticals on the other. Once routing complete a procedure is performed in order to remove unnecessary changes of sides.
Semicolon-bracket notation: A hidden resource in APL
Authors: A. D. Falkoff
Venue: ACM SIGAPL APL Quote Quad (1982)

The semicolon-bracket (SB) notation for indexing an array in APL has often been regarded unfavorably because of its anomalous character relative to other APL functions: the function symbol is a pair of brackets rather than a single character; the bracket pair is bound to the associated array at a higher precedence than any other function; and the requisite number of semicolons must appear literally within the brackets, so that the construct within the brackets when one or more semicolons are present is not an APL object, and therefore cannot be substituted for by another APL expression without semicolons. Nevertheless, this notation provides a simple way to index arrays of any rank, and has proven to be very convenient in practice. In this paper, it will be shown that the SB notation can (a) easily be extended to defined functions, and that it can also be used (b) to allow a multiplicity of names to be used unambiguously to the left of assignment, (c) to allow multiple statements on a line in a manner similar to that provided by the diamond separator in some APL systems, and (d) to extend and generalize the use of bracketed expressions as an axis operator.
Testing for software reliability
Authors: J. R. Brown, M. Lipow
Venue: Proceedings of the international conference on Reliable software (1975)

This paper presents a formulation of a novel methodology for evaluation of testing in support of operational reliability assessment and prediction. The methodology features an incremental evaluation of the representativeness of a set of development and validation test cases together with definition of additional test cases to enhance those qualities. If test cases are derived in typical fashion (i.e., to find and remove bugs, to investigate software performance under off-nominal conditions, to exercise structural elements and functional capabilities of the software, and to demonstrate satisfaction of software requirements), then the complete set of test cases is not necessarily representative of anticipated operational usage. The paper reports on initial research into formulation of valid measures of testing representativeness. Several techniques which permit specification of expected operational usage are described, and a technique for evaluating the correlation between actual testing accomplished and expected operational usage is defined. An unbiased estimator for operational usage reliability is proposed and justified as a function of a specified operational profile; confidence in the estimate is derived from a measure of the degree to which testing is representative of expected operational application. An experimental application of the techniques to a small program is provided as an illustration of the proposed use of the methodology for operational software reliability estimation. The relationship between structural exercise testing thoroughness and operational usage representativeness is discussed; the specification of a quantified reliability requirement and an explicit, required representativeness measure (or confidence) is identified as integral to effective application of the proposed reliability testing methodology; efforts to extend, formalize and generalize the methodology are described; and expected benefits, as well as potential problems and limitations are identified.
A Flexible Web Service Based Architecture for Wireless Sensor Networks
Authors: Flávia Coimbra Delicato, Paulo F. Pires, Luci Pirmez, Luiz Fernando Rust da Costa Carmo
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The current sensor networks are assumed to be designed for specific applications, having strongly coupled data communication protocols. The future sensor networks are envisioned as comprising heterogeneous devices assisting to a large range of applications. To achieve this goal, a new architecture approach is needed, having application specific features separated from the data communication protocol, while influencing its behavior. We propose a WebServices approach for the design of sensor networks, in which sensor nodes are service providers and applications are clients of such services. Our main goal is to enable a flexible architecture where sensor networks data can be accessed by users spread all over the world.
Learning Vector Quantization With Alternative Distance Criteria
Authors: J. S. Sánchez, F. Pla, F. J. Ferri
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

An adaptive algorithm for training of a Nearest Neighbor (NN) classifier is developed in this paper. This learning rule has got some similarity to the well-known LVQ method, but using the nearest centroid neighborhood concept to estimate optimal locations of the code-book vectors. The aim of this approach is to improve the performance of the standard LVQ algorithms when using a very small code-book. The behavior of the learning technique proposed here is experimentally compared to those of the plain k-NN decision rule and the LVQ algorithms.
Session II: CAI in APL
Venue: Proceedings of the conference on APL (1969)

Mr. Bruce Norcross, an Associate Professor of Chemistry at State University of New York at Binghamton, presided over this session. He has been associated with CAI for some time now and feels that, in APL, he has found a language that has a great effect on Chemistry students and one in which he has developed confidence. Mr. Norcross reiterated Mr. Dearing's thesis that in order for higher education to service the great volume of students that are expected in the future, we must develop better techniques, and computers (and CAI) seem to be a very valid approach.
Functional distribution of Computer Based Messaging Systems
Authors: John R. Pickens
Venue: Proceedings of the sixth symposium on Data communications (1979)

Computer Based Messaging Systems (CBMS) is a growing but complex application of computer networking technology. Though in its infancy, CBMS presents opportunities and challanges for research into the technology of distribution systems. In this paper a multi-layered model of CBMS is developed and detailed. At each layer an inventory of functions is presented, and tradeoffs are discussed. Options for packaging CBMS range from robust centralized schemes to highly distributed intelligent terminals supported by ancillary name/address binding services, etc. Much research in the functional distribution of the CBMS application is yet required, but the development of comprehensive models, such as that of this paper, is an important step in the design process.
Software engineering at the high school level or taking a byte or two from an apple II
Authors: John A. Beidler, John G. Meinke
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

In the near future that many of the computing concepts we currently teach at the college level will be taught in the near future (some are doing it already) at the high school level. From our experience we are convinced that this can be done, but substantial changes will have to be made in the ways in which programming concepts are taught. In subsequent sections of this paper describe the original direction of our proposal, how we had to change it, and where we see it going in the future. As we continue to work with our colleagues in the secondary schools, we have developed an important feedback loop. They have been convinced of our sincerity in assisting them. Therefore, they have been very free and open with their comments and their criticisms. This in turn has given us a tremendous opportunity to continuously revise and our material. As a result, we are convinced of the validity of our approach.
Beyond formatting and fonts: Changing academic needs for computer-assisted document composition
Authors: Joel J. Mambretti
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

In the last ten years, major trends in academic computing have included a number of particularly interesting changes: 1) increases in CPU capacity, 2) increases in baud rates, 3) the substitution of terminals for card readers, 4) the shift from batch to interactive systems, and 5) the development of computerized text processing. The development of academic text processing has been substantial in several areas of application. This paper will present an overview of the past, present, and possible future of one of these areas: the processing of large and/or complex texts, a task which in this paper will be referred to as &ldquo;document composition.&rdquo;
Network user services and personnel issues
Authors: Clement Luk
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

In a network environment, users are remote from the computer center. User services personnel, being the initial and possibly the only contact, represent the computer center to the users. Conversely, they must represent the view of the users to exert the proper influence on the operation of the computer center. With timesharing, users have close contact and scrutiny of system software. This &ldquo;user intimate&rdquo; software should be developed and maintained by user services. Personnel issues for this expanded user services are discussed: staffing, organization, recruiting, training, appraisal and work satisfaction.
A microprogrammable dual processor based fast digital filter
Authors: Prakash Agarwal, Roland Priemer
Venue: Proceedings of the ACM 1980 annual conference (1980)

A programmable digital signal processing system is proposed in this paper. The system utilizes a 16 bit microprocessor for user interaction and a bit slice microprocessor for executing the filtering algorithm.
A prototyping and simulation approach to interactive computer system design
Authors: Paul R. Hanau, David R. Lenorovitz
Venue: Proceedings of the 17th Design Automation Conference (1980)

The design and development of user interfaces to interactive computer systems has suffered from the inability of designers to easily express their design concepts in concrete, comprehensive, and comprehensible working models. An effort is underway to improve the process of man-machine dialogue design and implementation by developing prototyping and simulation tools to be used as an integral part of the specification and design process. These include an interactive display building utility and a syntax-driven interactive dialogue controller.
The power of negative thinking in multiplying Boolean matrices
Authors: Vaughan R. Pratt
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

We are interested in combinational circuits synthesized from and-gates and or-gates. We first show that n3 distinct and-gate inputs are needed to form the product of two Boolean matrices, and hence O(n3) two-input and-gates are needed to compute the transitive closure of a Boolean matrix. While this result has the flavor of Kerr's (achievable)lower bound [Kerr 1970] of n3+-gates for computing the min/+ product of integer-valued matrices using only min-gates and +-gates, the problem turns out on closer inspection to be considerably more subtle, and in fact we have been able to come only to within a factor of two of the best known upper bound of n3and-gates. Secondly we use this result to study the effect on combinational circuts of not using not-gates inverters).
Structure charts and program correctness proofs
Authors: Shang-Cheng Chyou
Venue: Proceedings of the 7th international conference on Software engineering (1984)

Structured design has been widely used in the software industry with good results. On the other hand, program development hand-in-hand with program-correctness proof techniques has shown promising signs for future software development. This paper attempts to bridge the gap between structured design and program development with proofs. Three basic constructs used in structure charts have been modified to incorporate guarded commands. Software design can be proved informally using the modified structure charts. With this technique, the benefits of both structured design and program correctness proofs can be applied to the development of large programs.
Hidden line removal for vector graphics
Authors: M. Wein, P. Tanner, G. Bechthold, N. Burtnyk
Venue: Proceedings of the 5th annual conference on Computer graphics and interactive techniques (1978)

A system for removing hidden edges in line displays of three dimensional scenes is described. The hardware system is relatively low cost, and operates on several hundred vectors in real-time. The system consists of a graphics peripheral connected to a PDP 11/55 computer and a software package to drive the peripheral. As each convex object is displayed, the occlusion hardware extracts the silhouette and retains it in a one-plane &ldquo;matte memory&rdquo;. As subsequent objects, taken from a priority ordered list, are displayed, the vector generator tests the contents of the frame buffer at the coordinates along the vector. The contents of the matte memory determine which portions of the vector should be intensified. To produce the priority ordered list of objects, the software algorithm uses three ordering techniques applied selectively to different potions of the scene. One technique, used for ordering unconstrained pairs of objects is described in detail.
Lower bounds for the cycle detection problem
Authors: Faith E. Fich
Venue: Proceedings of the thirteenth annual ACM symposium on Theory of computing (1981)

Given a function f over a domain and an element x in the domain, the cycle detection problem is to find a repetition in the sequence of values x, f(x), f(f(x)), f3(x),. . . , if one exists. This paper investigates lower bounds on the number of function evaluations needed when there is a bound on the amount of memory available. For certain restricted classes of algorithms which use two memory locations optimality is achieved. A summary of the major results appears in the final section.
Common feature techniques for discrete optimization
Authors: A. J. Goldstein, A. B. Lesk
Venue: Proceedings of the 13th Design Automation Conference (1976)

We present a general approach to finding optimal arrangements of objects, given a cost function for evaluating an arrangement. The method is based on the assumption that features which are common to many weak local optima of a problem should be present in the global optimum. The algorithm identifies such common features and uses them to create &ldquo;blocks&rdquo; of objects which are treated as indivisible units. We have used general-purpose algorithms which do not exploit the peculiarities of any one problem. Thus, the method described here may not be as good as an heuristic which has been tailored to a particular problem. However, it is easily adaptable to different problems, and produces many near-optimal solutions. Two examples are discussed: an electrical-net wiring problem and the traveling salesman problem.
Why co-op in computer science? (Panel Discussion)
Authors: H. R. Halladay, Rich Hendin, Roberta Weller, T. C. Cunningham
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

To encourage Computer Science programs not in the co-op tradition (most are probably in Arts and Science Colleges) to once again consider the benefits of establishing such a program. It gives specific corporations more than an abstract reason for assisting computer science programs in any of the various ways which have been suggested (financial contributions, sharing staff, faculty interns, etc.). Cooperative education for computer science majors is beneficial for the students, the employers, and the schools.
Should we get involved in word processing?
Authors: Lois J. Secrist
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

Every computer center needs a strategy for word processing and other micro-based systems. This is something we can be sure of in the face of the current popularity of these systems. Micro-based systems won't go away because we refuse to think of them And actually, although we have to assimilate a lot of new information and handle more work, these systems can provide cost effective services never before available to us and to our clients. We must get involved in a positive way. We must establish a method of operation for micro-based systems. This methodology will vary from one campus to another, but a sharing of ideas will be helpful to all of us.
List-tracing in systems allowing multiple cell-types
Authors: Robert R. Fenichel
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

List-processing systems have each allowed use of only a single size and configuration of list cell. This paper describes a system which allows use of arbitrarily many different sizes and configurations of list cell, possibly not specified until run time.
Improved compaction by minimized length of wires
Authors: W. L. Schiele
Venue: Proceedings of the 20th Design Automation Conference (1983)

The compaction of IC or hybrid layouts by means of the &ldquo;longest path&rdquo; method yields a slack in the placement of part of the elements, which, in its turn, can be used to reduce the overall wire-length. The result is an improved electrical performance and a smaller layout. The optimization problem was transformed to a graphtheoretical problem in a way similar to the compaction problem itself. Our procedure starts by adding pieces of information out of the connectivity of the layout to the constraint graph. The succeeding heuristic algorithms generate a new tree of longest paths, taking the linear inequalities and the result of the longest path calculation into consideration. A few examples demonstrate the significant reduction of wire-length and sometimes even an additional reduction of layout area achieved with low computational effort.
Security and audit: Needs of the business sector for security and integrity controls
Authors: Leslie Chalmers, Charles C. Wood
Venue: Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge (1984)

This session presents the security and integrity needs of the business sector in the form of recommendations and design criteria. Concerns, requirements, and suggested specifications are discussed in the hopes that fifth generation designers integrate the recommendations into hardware and software.
Formal design verification of digital systems
Authors: Anthony S. Wojcik
Venue: Proceedings of the 20th Design Automation Conference (1983)

In present design automation systems, the standard approach that is taken to verify the correctness of proposed logic designs is that of simulation. However, due to several difficulties that arise as simulation is applied to more complex systems, designers have searched for other techniques to at least augment this traditional approach. The purpose of this paper is to briefly describe a research project to develop a formal design verification system using the Argonne Automated Reasoning Assistant (AURA). Some results of this investigation are presented, together with a discussion of some of the problems that have been encountered and plans for future work.
An interactive molecular graphics system with a satellite terminal closely coupled to its host
Authors: J. D. Foley, W. V. Wright
Venue: Proceedings of the 1975 annual conference (1975)

GRIP is an experimental interactive computer graphics system being developed at the University of North Carolina for displaying, evaluating and manipulating models of complex molecular structures. The system displays a molecule as a network of line segments representing the locations and orientations of the atoms and valence bonds in the structure. It can also display electron-density data (obtained by crystallographic methods) as a three-dimensional contour map. The user can command the system to measure selected distances and angles in the model and to calculate functions of the molecular conformation such as its internal potential energy. He can also move the atoms about in the model space, either singly or in groups as specified by a vector or to minimize certain functions of the conformation. The user commands the system to execute one of these operations by selecting a light button. The parameters for such a command are specified by other light buttons, by selecting lines representing bonds in the molecular display, and by keyboard entry of scalar values. In addition to these discrete commands, the user has continuous, real-time manual control of the direction from which he views the model and of the position and orientation of a selected part of the model.
Formal properties of recursive Virtual Machine architectures.
Authors: Gerald Belpaire, Nai-Ting Hsu
Venue: Proceedings of the fifth ACM symposium on Operating systems principles (1975)

A formal model of hardware/software architectures is developed and applied to Virtual Machine Systems. Results are derived on the sufficient conditions that a machine architecture must verify in order to support VM systems. The model deals explicitly with resource mappings (protection) and with I/O devices. Some already published results are retrieved and other ones, more general, are obtained.
Multiresolution Object-of-Interest Detection for Images with Low Depth of Field
Authors: Jia Li, James Ze Wang, Robert M. Gray, Gio Wiederhold
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

This paper describes a novel multi-resolution image segmentation algorithm for separating sharply focused objects-of-interest from other foreground or background objects in low depth of field (DOF) images, such as sports, telephoto, macro, and microscopic images.The algorithm takes a multi-scale context-dependent approach to segment images based on features extracted from wavelet coefficients in high frequency bands. The algorithm is fully automatic in that all parameters are image independent. Experiments with the algorithm on more than 100 low DOF images have shown results close to the human segmentation of these images. Besides high accuracy, the algorithm also provides high speed. A 768×512 pixel image can be segmented within two seconds on a Pentium Pro 300MHz PC.