ppxscal/embedding_network huggingface dataset:
Design automation standards need integration
Authors: L O'Connell
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

The issues to be faced by those wishing to integrate design data from different Design Automation systems are what concepts to send and receive, and how to automatically recognize what has been sent without ambiguity. The goal is to achieve Computer Integrated Manufacturing (CIM) of Electrical/Electronic Products. One of the major obstacles is communication barriers between various systems and applications. Fortunately, work is being done to overcome these barriers. The Working Group on Electronic Modeling has begun modeling the information content and structure needed for much of the design portion of the total Engineering/Manufacturing job. All who share this concern for the ability to integrate the engineering and manufacturing information needed for CIM are invited to participate in and avail themselves of the work being done by the WGEM.
Reflexive Incidence Matrx (RIM) Representation of Petri Nets
Authors: Sajal K. Das, V. K. Agrawal, Dilip Sarkar, L. M. Patnaik, P. s. Goel
Venue: IEEE Transactions on Software Engineering (1987)

Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of self-loops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix called "reflexive incidence matrix (RIM) Cr," which is a combination of two matrices, a "base matrix Cb," and a "power matrix Cp." This scheme preserves the reflexive and other properties of the Petri nets. Through a detailed analysis it is shown that the proposed scheme requires less memory space and less processing time for answering commonly encountered net queries compared to other schemes. Algorithms to generate the RIM from the given net description and to decompose RIM into input and output function matrices are also given. The proposed Petri net representation scheme is very useful to model and analyze the systems having shared resources, chemical processes, network protocols, etc., and to evaluate the performance of asynchronous concurrent systems.
Considerations on software workstation
Authors: T. Koizumi
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

Software Workstation(SWWS) will be one of the most important software productivity improving tools that support all the phases of software development. The fundamental techniques of SWWS includes graphics, window system. LAN(network), network window systems, man machine interface, and operating systems, which are developing remarkably. But the essentially important concepts to SWWS are tools for software development. Some of typical tools which are essential to SWWS are described below. Requirement definition phase tool (concepts from SPECDOQ) Requirement definition phase tool is composed of three major functions which are structured problem analysis in target domains, interactive documentation of system requirements specification, and integrated information management. The structured problem analysis supports the thinking activities through which engineers can probe into what is needed, structure problems and construct new system concepts. The interactive documentation of system requirements specification supports producing documents representing investigation and analysis results and various specifications using such information representing method as diagrams tables tree structures etc. The integrated information management supports management of information generated by above features as data base. Design phase tool (concepts from SDMS) Design phase tool is also composed of there major functions which are modular design module interface design and module detailed design. Modular design supports dividing whole system into subsystems/processes/blocks/units(corresponding to C function) hierarchically. module interface design supports defining interfaces(unit parameters and data types etc.) between divided elements. Module detailed design supports producing internal logic. Target link support in debugging phase Debugging phase is very important because software quality will be made sure through debugging. The debugging period becomes long according to project size and complexity. SWWS must therefore aid debugging phase efficiently. The important point of debugging through SWWS is target link method. The target computer must be accessed and treated as if it is a part of SWWS. Symbolic debugging tool is also important. As microprocessor based systems are becoming popular recently, the connection between ICE and SWWS and the usage of SWWS as target computer are needed. Tools supporting all phases of software development As a step of software productivity improvement, daily software productivity related data collection is necessary. Such data will be collected automatically by SWWS. Programmer communication tools such electrical mails have been developed and widely distributed software development becomes possible through these tools. It is also necessary to develop SWWS with TV conference facilities to assist this software development environment.
A template matching algorithm using optically-connected 3-D VLSI architecture
Authors: S. Fujita, R. Aibara, M. Yamashita, T. Ae
Venue: Proceedings of the 14th annual international symposium on Computer architecture (1987)

Three-dimensional VLSI (in short, 3-D VLSI) is a new device technology that is expected to realize high performance systems. In this paper, we propose an image processing architecture based on 3-D VLSI consisting of optically-connected layers. Since the optical inter-layer connection seems to have some of useful functions due to isotropic radiation of the light, we algebraicly formulate them as the picture processing operators. Moreover, we show that the operators are available for applications such as template matching. The availability of a proposed template matching algorithm is verified by simulation.
An adaptive subdivision method for surface-fitting from sampled data
Authors: Francis J M Schmitt, Brian A. Barsky, Wen-hui Du
Venue: Proceedings of the 13th annual conference on Computer graphics and interactive techniques (1986)

A method is developed for surface-fitting from sampled data. Surface-fitting is the process of constructing a compact representation to model the surface of an object based on a fairly large number of given data points. In our case, the data is obtained from a real object using an automatic three-dimensional digitizing system. The method is based on an adaptive subdivision approach, a technique previously used for the design and display of free-form curved surface objects. Our approach begins with a rough approximating surface and progressively refines it in successive steps in regions where the data is poorly approximated. The method has been implemented using a parametric piecewise bicubic Bernstein-B eacute;zier surface possessing G1 geometric continuity. An advantage of this approach is that the refinement is essentially local reducing the computational requirements which permits the processing of large databases. Furthermore, the method is simple in concept, yet realizes efficient data compression. Some experimental results are given which show that the representation constructed by this method is faithful to the original database.
Solving (cyclic) tridiagonal systems
Authors: Richard Reuter
Venue: ACM SIGAPL APL Quote Quad (1988)

An APL2 function is presented for solving cyclic tridiagonal and tridiagonal systems of linear equations. Those systems frequently occur in various areas, e. g. interpolation by spline functions, numerical solution of elliptic differential equations, etc.. The function is based on a modification of the cyclic reduction method [1], [2]. Time measurements show impressive speed-ups over the domino ( ) function and the APL2 versions of the Gaussian elimination method, specialized for cyclic tridiagonal and tridiagonal systems.
IDL: sharing intermediate representations
Authors: David Alex Lamb
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1987)

IDL (Interface Description Language) is a practical and useful tool for controlling the exchange of structured data between different components of a large system. IDL is a notation for describing collections of programs and the data structures through which they communicate. Using IDL, a designer gives abstract descriptions of data structures, together with representation specifications that specialize the abstract structures for particular programs. A tool, the IDL translator, generates readers and writers that map between concrete internal representations and abstract exchange representations.
Report of WIPCIS working group on granularity and functions
Authors: D. Denning, C. Helsing, P. Karger, K. Meiser, R. Moulton
Venue: ACM SIGSAC Review (1988)

In addition to sharing direct work on the Clark-Wilson Model, this working group was askedto address thoseissuesrelating to the granularity of Transformation Procedures [TPs] and Constrained Data Items [CDIs]. Specifically, we were asked to provide guidelines as to the size of data objects that would provide appropriate separation of duties while not imposing an undue administrative burden. We were also asked to deal with the functions all TPs could be expected to perform.
A fast signature simulation tool for built-in self-testing circuits
Authors: S. B. Tan, K. Totton, K. Baker, P. Varma, R. Porter
Venue: Proceedings of the 24th ACM/IEEE Design Automation Conference (1987)

This paper describes a Fast Signature Simulator (FSS) tool for Built-In Self-Testing (BIST) circuits. The FSS consists of a simulator generator and a compiled code simulator. The simulator generator comprises a controlling program called the EXECUTIVE and translation software called SIM-GEN. SIM-GEN accepts a Hardware Description Language (HDL) representation of the circuit-under-test as its input and produces C code simulation modules comprising Boolean relations that represent the structure of the circuit. These C code modules are then compiled and linked together to form the basis of the compiled code simulator. Simulation is invoked by executing the compiled C code description of the circuit. The simulation time is minimised by the use of parallel simulation techniques in conjunction with efficient functional models and novel mapping techniques for the LFSRs. Performances approaching 5 Million Gate Evaluations Per Second (GEPS) have been achieved using the FSS.
NP is as easy as detecting unique solutions
Authors: L G Valiant, V V Vazirani
Venue: Proceedings of the seventeenth annual ACM symposium on Theory of computing (1985)

For all known NP-complete problems the number of solutions in instances having solutions may vary over an exponentially large range. Furthermore, most of the well-known ones, such as satisfiability, are parsimoniously interreducible, and these can have any number of solutions between zero and an exponentially large number. It is natural to ask whether the inherent intractability of NP-complete problems is caused by this wide variation. In this paper we give a negative answer to this using randomized reductions. We show that the problems of distinguishing between instances of SAT having zero or one solution, or finding solutions to instances of SAT having unique solutions, are as hard as SAT itself. Several corollaries about the difficulty of specific problems follow. For example if the parity of the number of solutions of SAT can be computed in RP then NP = RP. Some further problems can be shown to be hard for NP or DP via randomized reductions.
On-campus cooperative education
Authors: Scott N. Woodfield, Gordon E. Stokes, Vern J. Crandall
Venue: ACM SIGCSE Bulletin (1987)

In the past, on-site cooperative education has been the primary means of providing practical experience for computer science students. On-campus cooperative education is proposed as a viable alternative. This paper describes on-campus cooperative education as practiced at BYU. Advantages and disadvantages for the sponsoring company, university, students, faculty, and company personnel involved are also presented. The last part of the paper describes several guidelines which, if followed, should improve the educational experience.
Environments as first class objects
Authors: D. Gelernter, S. Jagannathan, T. London
Venue: Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1987)

We describe a programming language called Symmetric Lisp that treats environments as first-class objects. Symmetric Lisp allows programmers to write expressions that evaluate to environments, and to create and denote variables and constants of type environment as well. One consequence is that the roles filled in other languages by a variety of limited, special purpose environment forms like records, structures, closures, modules, classes and abstract data types are filled instead by a single versatile and powerful structure. In addition to being its fundamental structuring tool, environments also serve as the basic functional object in the language. Because the elements of an environment are evaluated in parallel, Symmetric Lisp is a parallel programming language; because they may be assembled dynamically as well as statically, Symmetric Lisp accommodates an unusually flexible and simple (parallel) interpreter as well as other history-sensitive applications requiring dynamic environments. We show that first-class environments bring about fundamental changes in a language's structure: conventional distinctions between declarations and expressions, data structures and program structures, passive modules and active processes disappear.
An Aggregation Technique for the Transient Analysis of Stiff Markov Chains
Authors: A Bobbio, K S Trivedi
Venue: IEEE Transactions on Computers (1986)

An approximation algorithm for systematically converting a stiff Markov chain into a nonstiff chain with a smaller state space is discussed in this paper. After classifying the set of all states into fast and slow states, the algorithm proceeds by further classifying fast states into fast recurrent subsets and a fast transient subset. A separate analysis of each of these fast subsets is done and each fast recurrent subset is replaced by a single slow state while the fast transient subset is replaced by a probabilistic switch. After this reduction, the remaining small and nonstiff Markov chain is analyzed by a conventional technique.
C++ versus LISP: a case study
Authors: Howard Trickey
Venue: ACM SIGPLAN Notices (1988)

A large application program was simultaneously coded in both C++ and Lisp. This note compares the two implementations. The conclusion is that programming in the two languages takes roughly the same amount of time and effort, but C++ seems better for a number of reasons.
Residue number conversion
Authors: C. N. Zhang, B. Shirazi, D. Y. Y. Yun
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

This paper describes an algorithm for converting a number in Residue Number System (RNS) to its equivalent in Binary Weighted System using Chinese Remainder Theorem. The Proposed linear algorithm uses binary addition to compute a conversion from a residue representation with n moduli to a binary representation in (n) time steps. However, if the algorithm is to be implemented, we can take advantage of parallelism at the architecture level through a tree structured network of processing elements. Each processing element can perform one step of the algorithm to compute the conversion in (log n) time steps. Furthermore, we show that we can achieve parallelism at the computation level by using carry-save addition instead of binary addition. The advantages of this approach are twofold: (1) it simplifies the detection of overflow in our computations, and (2) it reduces the addition delay to a constant time, making the design highly suitable for very large integers.
On table fragmentation in virtual memory management
Authors: I Rattan, L P S Singh
Venue: ACM SIGOPS Operating Systems Review (1986)

Virtual memory management (VMM) schemes have been in use for several years. All the text books on Operating Systems, including the widely used ones [1, 2], present the ideas involved in some detail. However, none of these provides details of a rather important aspect, namely, table fragmentation. In [1] there is a passing reference (p. 229) "... The waste of storage due to excessively large tables is called table fragmentation", and in [2] there is no mention of it at all.
A simulation model for analyzing the performance behavior of token-ring local area networks
Authors: W. F. Dudzik
Venue: Proceedings of the 20th annual symposium on Simulation (1987)

This paper describes the design and capabilities of a simulation program that models the behavior of a token-ring access local area network (LAN). Such networks consist of a variety of devices connected to a high speed transmission medium having a geographic extent limited to a few kilometers. Topologically, the transmission medium and devices constitute a closed loop or ring. Devices transmit messages on the ring only after obtaining control of a permission token that regulates access to the transmission medium. Attention is focused on the token-ring access protocol since the available evidence (see [1] and [2] for example) suggests that this protocol results in small delays at light workloads and controlled delay at heavy workloads. Based on this favorable assessment of performance, the token-ring access protocol is expected to be widely used in the future.
Managing on oft overlooked resource: student employees
Authors: Mark B. Johnson
Venue: Proceedings of the 15th annual ACM SIGUCCS conference on User Services (1987)

With the ever-present need for quality user services support, a computing center can ill afford to overlook any resource which might aid in accomplishing it. To arrive at this end, a staff must remain abreast of the constant change in computer technology, as well as the changing needs and wants of its users. At the University of Notre Dame, we have found that student employees have the potential to excel in the area of user services support, and many times they can do so in a more cost effective manner than a full-time staff member. With careful planning and consideration on the part of those supervising the students, their employ can grow to benefit themselves, the full-time staff, and most importantly, the users. If the process of successfully utilizing students were as easy as it sounds, this paper would have no raison d'&ecirc;tre, but there are serious questions to be posed when considering student employees: who to hire, and why; how they should be trained; how to motivate them to reach their fullest potential; and how to most effectively manage them.
The NTree: a two dimension partial order for protection groups
Authors: Ravinderpal S. Sandhu
Venue: ACM Transactions on Computer Systems (TOCS) (1988)

The benefits of providing access control with groups of users rather than with individuals as the unit of granularity are well known. These benefits are enhanced if the groups are organized in a subgroup partial order. A class of such partial orders, called ntrees, is defined by using a forest of rooted trees or inverted rooted trees as basic partial orders and combining these by refinement. Refinement explodes an existing group into a partially ordered ntree of new groups while maintaining the same relationship between each new group and the nonexploded groups that the exploded group had. Examples are discussed to show the practical significance of ntrees and the refinement operation. It is shown that ntrees can be represented by assigning a pair of integers called lr-values to each group so that g is a subgroup of h if and only if l[g] &le; l[h] and r[g] &le; r[h]. Refinement allows a complex ntree to be developed incrementally in a top-down manner and is useful for the initial definition of an ntree as well as for subsequent modifications. To make the latter use of refinement practical, a method is presented for assigning lr-values to the new groups introduced by refinement so lr-values assigned to nonexploded groups need not be changed. It is also shown how to guarantee that the lr-values of the exploded group will get assigned to one of the new groups.
Applications of Ramsey's theorem to decision tree complexity
Authors: Shlomo Moran, Marc Snir, Udi Manber
Venue: Journal of the ACM (JACM) (1985)

Combinatorial techniques for extending lower bound results for decision trees to general types of queries are presented. Problems that are defined by simple inequalities between inputs, called order invariant problems, are considered. A decision tree is called k-bounded if each query depends on at most k variables. No further assumptions on the type of queries are made. It is proved that one can replace the queries of any k-bounded decision tree that solves an order-invariant problem over a large enough input domain with k-bounded queries whose outcome depends only on the relative order of the inputs. As a consequence, all existing lower bounds for comparison-based algorithms are valid for general k-bounded decision trees, where k is a constant. An &OHgr;(n log n) lower bound for the element uniqueness problem and several other problems for any k-bounded decision tree, such that k = O(nc) and c < 1/2 is proved. This lower bound is tight since there exist n1/2-bounded decision trees of complexity O(n) that solve the element-uniqueness problem. All the lower bounds mentioned above are shown to hold for nondeterministic and probabilistic decision trees as well.
A knowledge structure for reusing abstract data types
Authors: D. W. Embley, S. N. Woodfield
Venue: Proceedings of the 9th international conference on Software Engineering (1987)

A knowledge structure for a software library consisting of abstract data types (ADTs) is defined. Both automatically-derived and explicitly-defined relationships are used to impose a knowledge structure on the ADTs. ADTs are defined by an ADT descriptor and one or more ADT implementations. Performance characteristics and default implementations are provided to assist users in choosing among alternatives. An explanation is given as to how the knowledge structure helps users find ADTs of interest, browse through similar ADTs to investigate alternatives, and build and customize executable software components from ADTs in the library.
Relational database design using an object-oriented methodology
Authors: Michael R. Blaha, William J. Premerlani, James E. Rumbaugh
Venue: Communications of the ACM (1988)

Of the many approaches to relational database design, the Object Modeling Technique (OMT) is particularly effective. A comprehensive explanation and two applications show the semantic improvement of OMT over other approaches.
The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time
Authors: Jim Gray, Franco Putzolu
Venue: ACM SIGMOD Record (1987)

If an item is accessed frequently enough, it should be main memory resident. For current technology, &ldquo;frequently enough&rdquo; means about every five minutes. Along a similar vein, one can frequently trade memory space for CPU time. For example, bits can be packed in a byte at the expense of extra instructions to extract the bits. It makes economic sense to spend ten bytes of main memory to save one instruction per second. These results depend on current price ratios of processors, memory and disc accesses. These ratios are changing and hence the constants in the rules are changing.