ppxscal/embedding_network huggingface dataset:
Probabilistic diagnosis for sparsely interconnected systems
Authors: Y.-H. Choi, T. Jung
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

In this paper, we present a system level fault diagnosis algorithm for identifying faulty and fault-free units in sparsely interconnected systems. The algorithm is partially based on a comparison approach where identical test vectors are applied to all units and their outputs are compared among themselves. Typical comparison diagnosis schemes based on majority voting or voting with threshold=1 are shown to be inappropriate for diagnosing those systems implemented on a single chip or wafer. Unlike other schemes, our scheme can adjust algorithm parameters depending on unit yield, degree of connectivity, and the probability that common mode failures will occur. Further improvements in fault coverage are made by disseminating test results to neighbors. The fault coverage of our diagnosis algorithm is remarkably high, and diagnosis decisions are made in a distributed fashion.
Inverse Perspective Transform Using Zero-Curvature Contour Points: Application to the Localization of Some Generalized Cylinders from a Single View
Authors: M. Richetin, M. Dhome, J. T. Lapresté, G. Rives
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1991)

The localization of some kinds of modeled generalized cylinders from a single brightness perspective image is addressed. It is shown how the zero-curvature points of their contours can be used to solve the inverse perspective problem. Three key theorems about the perspective projection of space curves and of the limbs of a straight homogeneous generalized cylinder whose scaling function has at least one zero-curvature point are discussed. In view of the localization of homogeneous generalized cylinders, an algorithm previously developed by the authors which estimates the pose of a line-triplet is adapted. A new theoretical result about the inverse perspective projection of cones of revolution useful for the localization of objects of revolution is presented. The corresponding algorithms have been implemented, and results of experiments demonstrate the feasibility of the proposed localization methods.
The Recovery and Understanding of a Line Drawing from Indoor Scenes
Authors: M. Straforini, C. Coelho, M. Campani, V. Torre
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1992)

A general procedure for the understanding of a class of indoor scenes is proposed. The suggested algorithm makes use of an extensive 2-D processing of the image that provides a faithful line drawing of the viewed scene. It also uses procedures adequate for the understanding of the 3-D structure and for the recognition of several items in the scene. The approach is specific for indoor scenes, such as corridors, offices, and laboratory rooms, where long straight edges are predominant and vanishing points can be detected.
Increased productivity using a preprocessor for Dataflex Fourth Generation Database Language (abstract)
Authors: Herbert E. Longenecker,  Jr., S. Tariq Ali, Michael V. Doran
Venue: Proceedings of the 1990 ACM annual conference on Cooperation (1990)

Reusable code and higher generation languages have been sited as methods for systems development which will cause reduction of time to develop new code, and which will lead to significant reduction of developmental errors. In each generation of language syntactic elements of the language decompose into multiple statements at a lower level. Dataflex is a 4th GL associated with a hierarchical database. While it is an efficient language, it nonetheless consumes considerable numbers of statements to solve routine problems not solvable with its standard macros. Many routines seem to be repeated during development of many similar systems. A technique common among professional programmers is to clone whole programs. We proposed to build a preprocessor to automate the cloning process. It would either recognize keywords in a statement and then use associated parameters in an expansion process, or if no keywords were present, the statement would be copies without expansion. A scrolling window display routine command sequence was developed to test the preprocessor. Productivity gains of 25-50 to 1 were obtained with reduction or elimination of errors. While scrolling window routines are not inherently difficult, as much as 500 lines of code are required to handle a simple window, including editable fields, lookup or display-only type fields. To implement such a window #lines = 3 + # of fields in a line using the preprocessor. In development of accounting systems, posting routines were cloned wherein similar fields in one file were posted to fields in another file. Copy and update preprocessing macros increased coding efficiency by at least 25 to 1 these routines.
Lazy code motion
Authors: Jens Knoop, Oliver Rüthing, Bernhard Steffen
Venue: ACM SIGPLAN Notices (1992)

We present a bit-vector algorithm for the optimal and economical placement of computations within flow graphs, which is as efficient as standard uni-directional analyses. The point of our algorithm is the decomposition of the bi-directional structure of the known placement algorithms into a sequence of a backward and a forward analysis, which directly implies the efficiency result. Moreover, the new compositional structure opens the algorithm for modification: two further uni-directional analysis components exclude any unnecessary code motion. This laziness of our algorithm minimizes the register pressure, which has drastic effects on the run-time behaviour of the optimized programs in practice, where an economical use of registers is essential.
Developing Ada software without target hardware
Authors: Philip P. Scarlato
Venue: ACM SIGSOFT Software Engineering Notes (1991)

An analysis of several of the Ada software projects recently completed at the E-Systems ECI Division reveals that although the software is very target specific, a large portion of this software could be developed independent of the target hardware. Only a very small portion of this software could not be developed in some way without the physical target hardware. However, it seems that the projects that experienced the most difficulty in completing the software task had a large portion of the software that was target test dependent. To visualize this software development difficulty, the target test dependent portion of software can be thought of as the small portion of an iceberg's mass that is visible above the water line as illustrated in figure 1 - the greater the mass above the water line, the greater the overall mass of the iceberg, the longer the melt down, and the greater the threat to navigation. Therefore, to reduce the overall navigation threat to project completion, this target test dependent software should be limited in a manner that allows the bulk of the iceberg to be verified and fine tuned independent of the target hardware.This paper discusses software development tactics used to reduce the overall risk in developing software for a project in which hardware and software were developed in parallel and access to the target hardware was limited or unavailable until after the majority of the software was developed. These tactics are useful in partitioning the software into a manageable form, can help prevent the creation of duplicate software development, and can allow Computer Software Component (CSC) integration and test of the majority of the software in the host environment before the target hardware becomes available.
Designing for cooperation: cooperating in design
Authors: Morten Kyng
Venue: Communications of the ACM (1991)

This article will discuss how to design computer applications that enhance the quality of work and products, and will relate the discussion to current themes in the field of Computer-Supported Cooperative Work (CSCW). Cooperation is a key element of computer use and work practice, yet here a specific &ldquo;CSCW approach is not taken.&rdquo; Instead the focus is cooperation as an important aspect of work that should be integrated into most computer support efforts in order to develop successful computer support, however, other aspects such as power, conflict and control must also be considered.
The 1988-89 Taulbee Survey Report
Authors: David Gries, Dorothy Marsh
Venue: Computer (1990)

Significant findings from the 1988-9 Taulbee report, which is based on a December 1989 survey of the Forsythe list of computing departments, are summarized. The survey focuses on the production and employment of PhDs who graduated in 1988-89 and the faculty of PhD-granting computing departments during the 1989-90 academic year. Among the findings is an 8% increase in PhDs granted. Of the 625 new PhDs, none are black, six are Hispanic, and 87 are women. The 129 CS departments have 2550 faculty members (an increase of 123, or nearly one per department) and reported hiring 204 faculty and losing 161.
Comparative evaluation of approximate methods for modelling of network systems
Authors: A. E. Fateyev, S. M. Porotskiy, V. I. Drujinin
Venue: ACM SIGMETRICS Performance Evaluation Review (1991)

The paper discloses the results of a comparative evaluation of several approximate methods of queueing network analysis concerning their accuracy, fields of validity and computational consumptions; the comparison is being carried out with varying values of network parameters.
Total quality management manifested through Ada
Authors: John S. Medley
Venue: Proceedings of the eighth annual Washington Ada symposium summer SIGAda meeting on Ada: software: foundation for competitveness (1991)

Depending on the source, Total Quality Management (TQM) is a philosophy, methodology, style, system, concept, or tool, or some combination thereof. As a solution to the dire predictions of America's dwindling leadership in the world marketplace, it can be said that TQM is the product of good old American ingenuity, inspired in the marketplace, in particular the high technology market, TQM will be of prime importance. This paper alerts to the pitfalls of TQM implementations based upon short term visions, profits, and gains. It suggests such implementations will lead to large financial losses over the long term. This paper addresses the following premises: &ndash; TQM is the embodiment of that leadership, which, throughout the organization, has the responsibility and authority to cause cultural change &ndash; TQM is sufficently flexible to include the philosophy of leaders who are successful and who can change organizational processes &ndash; A successful firm's tried and tested practices and tools will be beneficial to long term financial objectives under TQM &ndash; TQM can be adopted by any leader, regardless of style &ndash; TQM, as a system, should serve the leadership that evolves from top management's commitment &ndash; The high quality performance envisioned under TQM, may be found in the environment of an Ada development project. Quality has been essential in developing the Ada programming language. As with Ada, the manifestation of TQM must have quality, unemcumbered by political motives, as its essential criterion. As Ada evolved through its strawman phase to its current environmental stoneman phase, it fostered a cultural change in the technical community. As Ada evolved it retained quality as its bedrock. TQM needs a cultural change to realize, fully, its quality objectives. Ada, because of its compelling adherence to good software engineering principles, produces a cultural change. This paper will show that the natural ingredients of TQM already exist in the successful organization. This will be shown using excerpts from the works of an actual project, the development of the largest management information system in Ada by Computer Sciences Corporation. Examples of pre-existing TQM ingredients and Ada's inherent ability to enforce engineering disciplines, will be presented as evidence of a TQM and Ada synergy. The Ada vision does not manifest itself as the final solution to software engineering problems. Nor should TQM be the final solution to American leadership in the world marketplace. Yet, there are aspects of the market that will benefit from combining Ada's power to generate quality software with TQM's power to multiply quality throughout the marketplace.
Trip report: Chi '90 Seattle, Washington, April 1&ndash;5 1990
Authors: Jakob Nielson
Venue: ACM SIGCHI Bulletin (1990)

CHI'90 was the largest CHI-conference yet with 2,300 participants.1 As a matter of fact, the growth of human-computer interaction as a profession was an important theme in itself this year. SIGCHI has been the fastest growing ACM special interest group for several years and continues to retain this distinction.
A model of the contention resolution time for binary tree protocols
Authors: Jagan P. Agrawal, Mary L. Gerken
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

In a binary tree type local area network (LAN) protocol, the number of probe slots (K) needed for contention resolution, when M out of N terminals are contending for the bus access depends not only on the value of M but also on the pattern of the active terminals, i.e., where the physical addresses of the active terminals are located in the logical binary tree structure. The value of M depends on the traffic intensity and increases with the packet arrival rate. In this paper, we develop simple mathematical models for the upper and lower bounds on K as a function of M, with N as a parameter taking into account the above active terminal patterns. The models developed are useful in determining the maximum and minimum transmission frame durations for the performance evaluation of binary type LAN protocols and other reservation type LAN protocols which employ binary tree type probing algorithm. In the case of integrated traffic, when frame duration is to be fixed, the model will enable to optimize bandwidth allocation to different types of traffic.
Self-stabilizing deadlock detection algorithms
Authors: Mitchell Flatebo, Ajoy Kumar Datta
Venue: Proceedings of the 1992 ACM annual conference on Communications (1992)

A distributed system consists of a set of loosely connected state machines which do not share a global memory. All the possible global states of the system can be split up into legal and illegal states. A self-stabilizing system is a network of processors, which, when started from an arbitrary (and possibly illegal) initial state, always returns to a legal state in a finite number of steps. Self-stabilization has already been applied to some areas of distributed systems such as mutual exclusion, communication protocols, leader election, etc. [3][4]. This paper will present self-stabilizing deadlock detection algorithms, for single and multiple outstanding requests. Self-stabilizing methods for deadlock resolution and prevention are also discussed.
Tissue models, with programming problems from God's notebook.
Authors: W. Richard Stark
Venue: ACM SIGBIO Newsletter (1992)

The individual cells within a multicellular organism do not operate autonomously but instead interact together in a controlled and co-ordinated manner. In order that an organism can function ... there must be some form of communication between the component cells. ... [It] may take the form of direct communication between adjacent cells ... through permeable membrane channels known as gap junctions. MacDonald [Ma85].
Learning Automata from Ordered Examples
Authors: Sara Porat, Jerome A. Feldman
Venue: Machine Learning (1991)

Connectionist learning models have had considerable empirical success, but it is hard to characterize exactly what they learn. The learning of finite-state languages (FSL) from example strings is a domain which has been extensively studied and might provide an opportunity to help understand connectionist learning. A major problem is that traditional FSL learning assumes the storage of all examples and thus violates connectionist principles. This paper presents a provably correct algorithm for inferring any minimum-state deterministic finite-state automata (FSA) from a complete ordered sample using limited total storage and without storing example strings. The algorithm is an iterative strategy that uses at each stage a current encoding of the data considered so far, and one single sample string. One of the crucial advantages of our algorithm is that the total amount of space used in the course of learning for encoding any finite prefix of the sample is polynomial in the size of the inferred minimum state deterministic FSA. The algorithm is also relatively efficient in time and has been implemented. More importantly, there is a connectionist version of the algorithm that preserves these properties. The connectionist version requires much more structure than the usual models and has been implemented using the Rochester Connectionist Simulator. We also show that no machine with finite working storage can iteratively identify the FSL from arbitrary presentations.
A fast planar partition algorithm, II
Authors: Kentan Mulmuley
Venue: Journal of the ACM (JACM) (1991)

Randomized, optimal algorithms to find a partition of the plane induced by a set of algebraic segments of a bounded degree, and a set of linear chains of a bounded degree, are given. This paper also provides a new technique for clipping, called virtual clipping, whose overhead per window W depends logarithmically on the number if intersections between the borders of W and the input segments. In contrast, the overhead of the conventional clipping technique depends linearly on this number of intersections. As an application of virtual clipping, a new simple and efficient algorithm for plannar point location is given.
Raising the self confidence and self esteem of final year female students prior to job interviews
Authors: Joy Teague
Venue: ACM SIGCSE Bulletin (1992)

Published research and anecdotal evidence suggest that women may be disadvantaged when seeking employment. This paper describes a one day seminar on handling job interviews, conducted for female computer science students at the beginning of the final year of their undergraduate degree. Initial evaluations completed by the participants at the time that they participated in the seminar and a survey some six months later have been extremely positive. It appears that, if women are prepared for the interview process, they approach their first interviews with greater confidence and consequently are better equipped to deal with one of the most vital series of interactions that will occur in their lifetimes.
The Tree-Match Chip
Authors: David R. Smith, Jing C. Lin
Venue: IEEE Transactions on Computers (1991)

A chip organization is proposed for the classical tree-pattern-matching problem. It is based on an algorithm which uses a combination of a content-addressed memory, shift registers, and one-bit-wide stacks. All tree pattern matches are found simultaneously in one scan of the subject stream. The chip could be operated as a coprocessor to speed up functional language processing implementations. Multiple chips can be cascaded to increase capacity, similar to the way in which memory chips are utilized. An example chip has been laid out in CMOS technology in a 40-pin standard frame. Comparisons to previous algorithms are discussed.
Knowledge of command usage in a spreadsheet program
Authors: H. Albert Napier, Richard R. Batsell, David M. Lane, Norman S. Guadagno
Venue: ACM SIGMIS Database (1992)

Knowledge of how software is actually used by people can assist software developers and internal MIS application development personnel to improve the user-interface of existing software, in creating new user interface styles for existing software packages, and to improve the training for personnel using software packages. This article reports results from a study that examined the use of a popular spreadsheet software by 40 experienced users in their work environment. Of the 505 commands that could be used, 18 (3.6%) accounted for over 80% of the usage. More than 50% of the available commands were never used. Most of the command usage was related to creating, maintaining, and printing spreadsheets.
User centered development of a general practice medical workstation: the PEN PAD experience
Authors: A. L. Rector, B. Horan, M. Fitter, S. Kay, P. D. Newton, W. A. Nowlan, D. Robinson, A. Wilson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

The goal of the PEN PAD project is to design and develop a useful and usable medical workstation for day&ndash;to&ndash;day use in patient care. The project has adopted a user centred approach and direct observations of doctors, participative design and Formative Evaluation have therefore been an integral part of the process of software development. Indeed, doctors have been involved from the earliest stages of the project. The project has focussed on British General Practitioners, but the methods which have been evolved are general. This paper describes the strategy by which doctors can be involved in the successful design and development of a medical workstation.
A theory of organization
Authors: Hermann von Issendorff
Venue: ACM SIGPLAN Notices (1991)

A theory of organization has been presented last year in the August and September issue of SIGPLAN Notices. Meanwhile some errors and several additional transformation rules were discovered. They are listed below following the order of the paper.
Analyzing Error-Prone System Structure
Authors: Richard W. Selby, Victor R. Basili
Venue: IEEE Transactions on Software Engineering (1991)

Using measures of data interaction called data bindings, the authors quantify ratios of coupling and strength in software systems and use the ratios to identify error-prone system structures. A 148000 source line system from a prediction environment was selected for empirical analysis. Software error data were collected from high-level system design through system testing and from field operation of the system. The authors use a set of five tools to calculate the data bindings automatically and use a clustering technique to determine a hierarchical description of each of the system's 77 subsystems. A nonparametric analysis of variance model is used to characterize subsystems and individual routines that had either many or few errors or high or low error correction effort. The empirical results support the effectiveness of the data bindings clustering approach for localizing error-prone system structure.
User interface programming survey
Authors: Brad A. Myers, Mary Beth Rosson
Venue: ACM SIGCHI Bulletin (1991)

Are you tired of seeing papers start out with a line like "user interfaces are hard to build and take 28% to 75% of the development time" followed by a reference like (Sutton 78)? We are, and anecdotal evidence suggests that the percentage spent on the user interface is rising. Therefore, we are attempting to get more relevant and realistic data about the proportion of code and effort that is devoted to programming user interfaces in end-user applications. If you have experience with this aspect of application programming either in industry or research labs, we would very much appreciate your responses to the questions in this survey. If you have worked on an appropriate system but you do not feel qualified to answer this survey, please pass it along to someone who can answer the questions. Also, if you know someone who we might ask to participate, please send us his or her name and address. We will mail a copy of the resulting report to all who participate, and it will be published in an appropriate forum.