ppxscal/embedding_network huggingface dataset:
Connectivity of Imase and Itoh Digraphs
Authors: N. Homobono, C. Peyrat
Venue: IEEE Transactions on Computers (1988)

An important problem in the design of efficient interconnection networks consists of finding digraphs with a minimal diameter for a given number of nodes n and a given degree d. The best family known at present, denoted by G(n,d), has been proposed by Imase and Itoh. Its vertex set is the set of integers modulo n and its arc set A is defined as A=((x,y)/y identical to -dx-a, 1>or=a>or=d). The authors determine the connectivity of these digraphs, which proves that they are highly reliable. More precisely, we show that provided that the diameter is greater than 4, the connectivity of G(n,d) is d if n=k(d+1) and gcd(n,d)
A real-time monitor for a distributed real-time operating system
Authors: Hideyuki Tokuda, Makoto Kotera, Clifford E. Mercer
Venue: Proceedings of the 1988 ACM SIGPLAN and SIGOPS workshop on Parallel and distributed debugging (1988)

Monitoring and debugging for a distributed real-time system is a complicated problem due to the lack of a set of advanced tools and adequate operating system capability. Software tools can cover the wide range of the software development life cycle from the requirement analysis phase to debugging and maintenance phases. However, many of these modern tools are not effective for building or analyzing complex real-time systems. Real-time software tools and effective kernel support are essential to reduce the complexity of real-time software. In this paper, we first address the issues in real-time monitoring and debugging, such as capturing the timing error, the monitor's invasive nature and visualization of system behavior. We then describe the architecture of the ART Real-Time Monitor which is being built for a distributed real-time OS, called ARTS. The built-in monitoring/debugging kernel primitives are also mentioned.
Multi-level logic synthesis using communication complexity
Authors: T.-T. Hwang, R. M. Owens, M. J. Irwin
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We present a new multi-level logic synthesis technique based on minimizing communication complexity. Intuitively, we believe this approach is viable because for many types of circuits lower bounds on the area needed to implement those circuits have been obtained considering only communication complexity. It performs especially well for functions which are hierarchically decomposable (e.g., adders, parity generators, comparators, etc.). Unlike many other multi-level logic synthesis techniques, a lower bound can be computed to determine how well the synthesis was performed. We also present a new multi-level logic synthesis program based on the techniques described for reducing communication complexity.
Case-based design and learning in telecommunications
Authors: C. Tsatsoulis
Venue: Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1989)

Design has been one of the most difficult problems that Artificial Intelligence has faced until now. Design knowledge is almost impossible to gather and put into rules or other structured reasoning tool, and studies of human expert designers have shown that often the design process seems ad hoc and based on &ldquo;intuition&rdquo;. This paper presents a novel approach to automating design by using case-based reasoning and learning. It discusses how cases of previous designs are stored, how they are retrieved, how they are judged based on their adherence to design specifications, how the designs are created, and how the memory of design cases is expanded by learning. Finally, this paper presents the current state of an automated design tool based on these principles, which will be used in the intelligent design of network topologies.
Reduction Techniques for Selection in Distributed Files
Authors: N. Santoro, R. Suen
Venue: IEEE Transactions on Computers (1989)

The problem of selecting the Kth smallest element of a set of N elements distributed among d sites of a communication network is examined. A reduction technique is a distributed algorithm that transforms this problem to an equivalent one where either K or N (or both) are reduced. A collection of distributed reduction techniques is presented; the combined use of the algorithms offers new solutions for the selection problem in shout-echo networks and in a class of point-to-point networks. The communication complexity of these solutions is analyzed and shown to represent an improvement on the multiplicative constant of existing bounds for those networks.
Introducing knowledge-based projects in a systems development course
Authors: Vijay Kanabar
Venue: ACM SIGCSE Bulletin (1988)

Due to recent advances in knowledge-based systems technology it is suggested that students in a systems development course be given exposure to the concept of designing and implementing knowledge-based systems. The purpose of this paper is to describe the objective, scope, methods and procedures of knowledge-based projects. The first half of the paper introduces the knowledge-based approach and describes the structure and components of such a system. The second half of the paper deals with course design procedures. The scope, topics, project characteristics and experiences pertaining to such a project are covered here. A practical Knowledge-based Systems Development Life Cycle (KSDLC) is also proposed for use in such a course. It is a suitable methodology as it resembles the traditional Systems Development Life Cycle.
On Recognizing and Positioning Curved 3-D Objects from Image Contours
Authors: D. J. Kriegman, Jean Ponce
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

An approach for explicitly relating the shape of image contours to models of curved three-dimensional objects is presented. This relationship is used for object recognition and positioning. Object models consist of collections of parametric surface patches and their intersection curves; this includes nearly all representations used in computer-aided geometric design and computer vision. The image contours considered are the projections of surface discontinuities and occluding contours. Elimination theory provides a method for constructing the implicit equation of these contours for an object observed under orthographic or perspective projection. This equation is parameterized by the object's position and orientation with respect to the observer. Determining these parameters is reduced to a fitting problem between the theoretical contour and the observed data points. The proposed approach readily extends to parameterized models. It has been implemented for a simple world composed of various surfaces of revolution and tested on several real images.
Comparison of the Efficiency of Deterministic and Stochastic Algorithms for Visual Reconstruction
Authors: A. Blake
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

Piecewise continuous reconstruction of real-valued data can be formulated in terms of nonconvex optimization problems. Both stochastic and deterministic algorithms have been devised to solve them. The simplest such reconstruction process is the weak string. Exact solutions can be obtained for it and are used to determine the success or failure of the algorithms under precisely controlled conditions. It is concluded that the deterministic algorithm (graduated nonconvexity) outstrips stochastic (simulated annealing) algorithms both in computational efficiency and in problem-solving power.
A framework for comparing type systems for database programming languages
Authors: Antonio Albano, Alan Dearle, Giorgio Ghelli, Chris Marlin, Ron Morrison, Renzo Orsini, David Stemple
Venue: Proceedings of the second international workshop on Database programming languages (1989)

Several proposals have been published in recent years for database programming languages (DBPLs), many of which have been object-oriented. Our goal in this paper is not to argue for or against specific solutions, but simply to provide a framework for comparing certain critical points of type system design. This framework may be used in the description of a DBPL. It is our hope that the framework will promote clear communication among designers and developers of DBPLs.
Efficient floorplan area optimization
Authors: D. F. Wong, P. S. Sakhamuri
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

The floorplan area optimization problem is to determine the shape and dimensions of all the modules when the topology of the floorplan is given. The objective is to minimize the area of the resulting floorplan. Existing methods only apply to slicing floorplans. We present in this paper an algorithm for general hierarchical floorplans. Our algorithm combines the curve-adding technique used in the case of slicing floorplans and a new technique that computes shape curves by iterative modification of the shape and dimensions of individual modules. We also present an optimal points selection algorithm using the technique of dynamic programming to further enhance the process of shape curves construction.
Application of symbolic algebra to the analysisof plates on variable elastic foundation
Authors: Moshe Eisenberger
Venue: Journal of Symbolic Computation (1990)

The analysis of plates on elastic foundation is very common in engineering. Usually the Winklermodel is adopted, and it is assumed that the foundation stiffness is constant over the area of the plate. In many cases, such as large foundation mats and in vertical slurry walls, the foundation stiffness varies and approximate solutions are found. Using symbolic algebra, an approximate finite element displacement method is introduced to analyse the problem of plates on a variable Winkler elastic foundation. It is proposed to add to the conventional plate element stiffness matrix, another matrix that will account for the effect of the variable foundation. The solution using this approach is compared to the solutions which were obtained using other approximation techniques. With the proposed method the convergence is much faster, with fewer elements, and saves computer and data preparation time.
A knowledge based message interpretation for the maintenance of an electronic switching system
Authors: Jaehoon Kim, Kyunghyu Lee, Hwanseung Yong, Youngwan Lim, Chuhwan Yim
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

For the maintenance of a switching system, many levels of expert's decisions may be required to find a correct cause and its appropriate repair procedure. Output messages generated by our switching system, called TDX-1A, for the maintenances have, in general, the following characteristics: A bunch of maintenance messages generated only by even not many trouble/faults make it hard for an operator to maintain. Approximately 10 messages are generated by a fault. To figure out a correct cause, its fault name and its repair procedure, several kinds of knowledges for the switching system architecture, the message interpretation, the trouble history, the system options etc. may be utilized. By analyzing maintenance messages, we found the correlation between output messages and the system architecture for an interpretation, and set up a model for a navigation of a fault diagnosis. Based on the correlation and the model, an inference model for the fault diagnosis was found and the knowledge base had been classified into sub-knowledge bases according to the navigation model. Furthermore, to improve the performance of the inference model, we used meta control knowledges and the dynamic rule weighting mechanism. The intelligent maintenance system was implemented on the lisp machine LAMBDA 2x2/Plus using the expert system tool, KEE(Knowledge Engineering Environment) and tested for a couple of months.
Optimal Robust Compression of Test Responses
Authors: M. G. Karpovsky, P. Nagvajara
Venue: IEEE Transactions on Computers (1990)

A compression of test responses technique for a built-in self-test (BIST) VLSI design is presented. The authors introduce the notion of a robust compression technique which incorporates prior knowledge of the statistics of fault-free responses under pseudorandom testing to achieve a guaranteed error detectability independent of a distribution of errors. The presented robust quadratic compressor requires two r-bit registers (r-bit signature) more than a multiple-input linear feedback shift register; however, it provides for equal protection against all error patterns. Therefore, quadratic compressors are optimal and robust with respect to a statistics of errors in a device under test.
The empirical study of knowledge elicitation techniques
Authors: Nigel Shadbolt, A. Mike Burton
Venue: Issue 108 (April 1989) (1989)

This article reports on work conducted at Nottingham University to investigate the utility and efficacy of selected knowledge elicitation (KE) techniques. The experimental approach taken to this research is advanced as a necessary and essential part of the process of coming to understand how to make acquisition more tractable. We discuss the results of our work and possible implications for programmes of acquisition. We also describe the assumptions implicit in our work and the attendant caveats that have to be borne in mind.
Skeletonization via the Realization of the Fire Front's Propagation and Extinction in Digital Binary Shapes
Authors: Y. Xia
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A sequential method of skeletonization for digital binary images is proposed. The method realizes in a discrete plane prairie-fire propagation model. The techniques of contour following is adopted to simulate the simultaneous fire spreading off of the grass perimeter. The algorithm contains two steps: (1) find and mark all of the contours of the input image during a conventional scan. Then, after the borders a 'lighted', (2) repeatedly examine the borders and strip deletable edge points until no more can be removed. In this way only the successive contours, but not the whole image, will be processed. The second step is subdivided as follows: first, the contours representing the current fire fronts are traced, all the edge points are memorized, and the next fire fronts are marked. Second, the algorithm verifies the memorized edge points and those marked only once are removed. Although no neighborhood's test is needed during this stage of peeling, the connectedness of objects to thinning is conserved. Insignificant spurs can, optionally, be removed during thinning.
Evaluating correctness criteria for transactions
Authors: D. E. Langworthy
Venue: Proceedings of the 1988 ACM SIGPLAN workshop on Object-based concurrent programming (1988)

We propose a metric to evaluate correctness criteria for transactions which measures the number of conflicts between transactions and the amount of concurrency a criterion allows. This metric is then used to evaluate several correctness criteria.
Graphical Configuration Programming
Authors: J. Kramer, J. Magee, K. Ng
Venue: Computer (1989)

The structural description, construction, and evolution of software systems using the Conic graphs environment are discussed. The configuration programming concepts embodied in conic are described and illustrated by the example of a patient monitoring system. The characteristics of the ConicDraw graphic workstation are examined. Browsing and animation extensions are described.
The portable common runtime approach to interoperability
Authors: M. Weiser, A. Demers, C. Hauser
Venue: Proceedings of the twelfth ACM symposium on Operating systems principles (1989)

Operating system abstractions do not always reach high enough for direct use by a language or applications designer. The gap is filled by language-specific runtime environments, which become more complex for richer languages (CommonLisp needs more than C+ +, which needs more than C). But language-specific environments inhibit integrated multi-lingual programming, and also make porting hard (for instance, because of operating system dependencies). To help solve these problems, we have built the Portable Common Runtime (PCR), a language-independent and operating-system-independent base for modern languages. PCR offers four interrelated facilities: storage management (including universal garbage collection), symbol binding (including static and dynamic linking and loading), threads (lightweight processes), and low-level I/O (including network sockets). PCR is &ldquo;common&rdquo; because these facilities simultaneously support programs in several languages. PCR supports C. Cedar, Scheme, and CommonLisp intercalling and runs pre-existing C and CommonLisp (Kyoto) binaries. PCR is &ldquo;portable&rdquo; because it uses only a small set of operating system features. The PCR source code is available for use by other researchers and developers.
Computer centres - the next decade
Authors: J. L. Alty
Venue: ACM SIGUCCS Newsletter (1988)

When trying to predict what will happen in the next decade it is always instructive to step back a decade and see how things have, or have not changed. It is often said that the computing world is a rapidly changing one, and this is certainly true of some key parameters, for example CPU power, store size and reliability. However, we should not be misled into thinking that change has been rapid in all areas. For example, progress in user-friendly interfaces, proof of correctness, and reliable software design techniques has been slow.
The evaluation of program-based software test data adequacy criteria
Authors: E. J. Weyuker
Venue: Communications of the ACM (1988)

In earlier work, a preliminary set of axioms for software test data adequacy was introduced in order to formalize properties which should be satisfied by any good program-based adequacy criterion. Here, we extend this work by augmenting the set with additional axioms which substantially strengthen the set. In doing so, we rule out several types of unsuitable notions of adequacy.
Deductive synthesis of sorting programs
Authors: Jonathan Traugott
Venue: Journal of Symbolic Computation (1989)

Using the deductive synthesis framework developed by Manna and Waldinger we have derived a wide variety of recursive sorting programs. These derivations represent the first application of the deductive framework to the derivation of nontrivial algorithms. While the programs given were derived manually, we ultimately hope that a computer implementation of the system (of which none currently exists) will find similar programs automatically. Our derivations are intended to suggest this possibility; the proofs are short in relation to program complexity (on the order of 40 steps per program) and individual derivation steps are uncontrived. We also present a new rule for the generation of auxiliary procedures, a common ''eureka'' step in program construction.
The influence of relaxed supernode partitions on the multifrontal method
Authors: Cleve Ashcraft, Roger Grimes
Venue: ACM Transactions on Mathematical Software (TOMS) (1989)

In this paper we present an algorithm for partitioning the nodes of a graph into supernodes, which improves the performance of the multifrontal method for the factorization of large, sparse matrices on vector computers. This new algorithm first partitions the graph into fundamental supernodes. Next, using a specified relaxation parameter, the supernodes are coalesced in a careful manner to create a coarser supernode partition. Using this coarser partition in the factorization generally introduces logically zero entries into the factor. This is accompanied by a decrease in the amount of sparse vector computations and data movement and an increase in the number of dense vector operations. The amount of storage required for the factor is generally increased by a small amount. On a collection of moderately sized 3-D structures, matrices speedups of 3 to 20 percent on the Cray X-MP are observed over the fundamental supernode partition which allows no logically zero entries in the factor. Using this relaxed supernode partition, the multifrontal method now factorizes the extremely sparse electric power matrices faster than the general sparse algorithm. In addition, there is potential for considerably reducing the communication requirements for an implementation of the multifrontal method on a local memory multiprocessor.
On the Number of Digital Straight Line Segments
Authors: Carlos A. Berenstein, David Lavine
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

A closed-form expression has been reported in the literature for L/sub N/, the number of digital line segments of length N that correspond to lines of the form y=ax+ beta , O>or= alpha , beta >1. The authors prove an asymptotic estimate for L/sub N/ that might prove useful for many applications, namely, L/sub N/=N/sup 3// pi /sup 2/+O(N/sup 2/ log N). An application to an image registration problem is given.
Computational Improvements in Prolog Applications by Predicate Variable Pointers
Authors: Gerald M. Karam
Venue: IEEE Transactions on Software Engineering (1990)

The programming tradeoffs between structure-oriented and clause-oriented operations on data structures in Prolog are limited in current implementations because the assertion of clauses that include uninstantiated variables destroys any binding between these variables and those with which they are unified in the execution of the program. Built-in predicates for Prolog that allow one to assert predicate variables pointers, which are constants, rather than uninstantiated variables, are presented. The author shows: the possible performance benefits of clause-oriented implementations of data structures over equivalent structure-oriented versions, the logical implications of the proposed built-in predicates, and their practical significance by integrating them in C-Prolog and evaluating the two different implementations of the symbol table dictionary in D.H.D. Warren's pseudo-Pascal compiler example.
A new approach to the rectilinear Steiner tree problem
Authors: Jan-ming Ho, G. Vijayan, C. K. Wong
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in our approach is to determine L-shaped layouts for the edges of the MST, so as to maximize the overlaps between the layouts, thus minimizing the cost (i.e., wire length) of the resulting RST. We describe a linear time algorithm for constructing a RST from a MST, such that the RST is optimal under the restriction that the layout of each edge of the MST is an L-shape. The RST's produced by this algorithm have 8-33% lower cost than the MST, with the average cost improvement, over a large number of random point sets, being about 9%. The running time of the algorithm on an IBM 3090 processor is under 0.01 seconds for point sets with cardinality 10. We also discuss a property of RST's called stability under rerouting, and show how to stabilize the RST's derived from our approach. Stability is a desirable property in VLSI global routing applications.