ppxscal/embedding_network huggingface dataset:
Cost-free scan: a low-overhead scan path design methodology
Authors: Chih-Chang Lin, Mike Tien-Chien Lee, Malgorzata Marek-Sadowska, Kuang-Chien Chen
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Conventional scan design imposes considerable area and delay overhead by using larger scan flip-flops and additional scan wires without utilizing the functionality of the combinational logic. We propose a novel low-overhead scan design methodology, called cost-free scan, which exploits the controllability of primary inputs to establish scan paths through the combinational logic. The methodology aims at reducing scan overhead by (1) analyzing the circuit to determine all the cost-free scan flip-flops, and (2) selecting the best primary input vector to establish the maximum number of cost-free scan flip-flops on the scan chain. Significant reduction in the scan overhead is achieved on ISCAS89 benchmarks, where in full scan environment, as many as 89% of the total flip-flops are found cost-free scannable, while in partial scan environment, reduction can be as high as 97% in scan flip-flops needed to break sequential loops.
Tools for teaching CCRs, monitors, and CSP concurrent programming concepts
Authors: Ronald A. Olsson, Carole M. McNamee
Venue: ACM SIGCSE Bulletin (1995)

This paper describes three preprocessors that, respectively, convert conditional critical region (CCR) notation, monitor notation, and Communicating Sequential Processes (CSP) notation into equivalent programs written in the SR concurrent programming language. Our goal is to allow students to experiment and to obtain hands-on experience with these notations. Together with native SR, the three preprocessors provide a teaching tool for a wide spectrum of synchronization mechanisms. This paper also describes the favorable experience obtained in using the preprocessors in several courses. The preprocessors are part of the standard SR distribution, which runs on most UNIX systems; they are in the public domain and available via ftp.
The human factors of speech-based interfaces: a research agenda
Authors: James H. Bradford
Venue: ACM SIGCHI Bulletin (1995)

This article outlines some of the characteristics of speech technology that distinguish it from traditional interaction techniques. A number of human factors issues relating to speech will be discussed in the context of a proposed research agenda for speech-based interfaces.
Exponential Stability of Coupled Beams with Dissipative Joints: A Frequency Domain Approach
Authors: Richard Rebarber
Venue: SIAM Journal on Control and Optimization (1995)

Two examples of coupled Euler-Bernoulli beams with a dissipative joint are considered. The joint placements that lead to exponential stability for these systems are characterized. The technique used shows input-output stability of a related controlled, observed system, and then shows that in these examples, input-output stability implies exponential stability. In the first example, the energy dissipation arises from a discontinuity in the shear at the joint. In the second example, the energy dissipation arises from a discontinuity in the bending moment at the joint. The analysis of this system involves a complete spectrum analysis of the zero dynamics of the associated controlled, observed system.
An optimal clock period selection method based on slack minimization criteria
Authors: En-Shou Chang, Daniel D. Gajski, Sanjiv Narayan
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1996)

An important decision in synthesizing a hardware implementation from a behavioral description is selecting the clock period to schedule the datapath operations into control steps. Prior to scheduling, most existing behavioral synthesis systems either require the designer to specify the clock period explicitly or require that the delays of the operators used in the design be specified in multiples of the clock period. An unfavorable choice of clock period could result in operations being idle for a large portion of the clock period and, consequently, affect the performance of the synthesized design. In this article, we demonstrate the effect of clock slack on the performance of designs and present an algorithm to find a slack-minimal clock period. We prove the optimality of our method and apply it to several examples to demonstrate its effectiveness in maximizing design performance.
The unwinding number
Authors: Robert M. Corless, David J. Jeffrey
Venue: ACM SIGSAM Bulletin (1996)

From the Oxford English Dictionary we find that to unwind can mean "to become free from a convoluted state". Further down we find the quotation "The solution of all knots, and unwinding of all intricacies", from H. Brooke (The Fool of Quality, 1809). While we do not promise that the unwinding number, defined below, will solve all intricacies, we do show that it may help for quite a few problems.Our original interest in this area came from a problem in which an early version of DERIVE was computing the wrong answer when simplifying sin(sin-1 z), which should always be just z. For z gt; 1, DERIVE was getting -z as the answer. This bug has of course long since been fixed.What was happening was that in order to improve internal efficiency, all the inverse trig functions were represented as arctangents. Consulting an elementary book of tables, one finds the identitysin-1 z = tan-1 (z/ radic;1 - z2). (1)In the same vein, one finds thatsin(tan-1 w) = w/ radic;1 + w2. (2)Substituting equations (1) and (2) into sin(sin-1 z) and simplifying, we getz/ radic;1 - z2 1/ radic;1/1 - z2, (3)which DERIVE quite properly refused to simplify to z, because this is not always equal to z (see [2]).The fix in this case was to replace equation (2) withsin(tan-1 w) = w radic;1/1 + w2. (4)which differs from the original only on the branch cut. See [7] for more discussion. This change allows the simplification of sin(sin-1 z) to z. Verifying that this approach worked, and indeed trying to understand the problem to begin with, led us to attempt various definitions of a 'branch function'. This introductory problem turned out to be the tip of an iceberg of problems connected with using the principal branch of multivalued elementary functions.
High performance TCP in ANSNET
Authors: Curtis Villamizar, Cheng Song
Venue: ACM SIGCOMM Computer Communication Review (1994)

This report concentrates on specific requirements and goals of the research networks supported by ANSNET, but applies to any TCP dominated high speed WAN and in particular those striving to support high speed end-to-end flows. Measurements have been made under conditions intended to better understand performance barriers imposed by network equipment queueing capacities and queue drop strategies.The IBM RS/6000 based routers currently supporting ANSNET performed very well in these tests. Measurements have been made with the current software and performance enhanced software. Single TCP flows are able to achieve 40 Mb/s and competing multiple TCP flows achieve over 41 Mb/s link utilization on 44.7 Mb/s DS3 links with delays comparable to US cross continent ANSNET delays. Congestion collapse is demonstrated with intentionally reduced queueing capacity and using window sizes much larger than optimal.A variation of Floyd and Jacobson's Random Early Detection (RED) algorithm [1] is tested. Performance improved with the use of RED for tests involving multiple flows. With RED and queueing capacity at or above the delay bandwidth product, congestion collapse is avoided, allowing the maximum window size to safely be set arbitrarily high.Queueing capacity greater than or equal to the delay bandwidth product and RED are recommended. RED provides performance improvement in all but the single flow case, but cannot substitute for adequate queueing capacity, particularly if high speed flows are to be supported.
An annotated bibliography on active databases (short version)
Authors: Ulrike Jaeger, Johann Christoph Freytag
Venue: ACM SIGMOD Record (1995)

This is a bibliography on active databases and active database systems which reflects the various research activities in this field. We compiled this bibliography for our own use, but hopefully it might be useful to other people as well. All papers that appear in the following list, are generally accessible.We do not claim that the bibliography is exhaustive and covers the complete range of literature that deals with activities. We decided to focus on central approaches, concepts, methods, and systems in the area of active databases. It does not contain entries in the area of "pure" real-time, object-oriented, temporal, and deductive databases. But we did include publications related to those approaches, as long as they discuss active databases.We divided the material into various sections following our own personal perception of the field. The sections provide an overview on different projects in the area of active databases, followed by sections on relevant research topics. Each section contains a few remarks followed by a list of cross references into the annotated bibliography. Papers might appear in more than one section in case they discuss different topics relevant to different sections.Additionally, when relevant we also included unpublished, but publicly available material. For those papers we included information how to obtain them from the authors or from the organizations where the were produced.The beauty of our work is the individual annotation to almost all publications. Due to space limitations we are forced to leave out those annotations in the version published here. For a complete annotated bibliography we refer to the entry in our WWW server.The effort to build up such a bibliography is an endless task. Since we believe it now provides a comprehensive overview on the existing literature in the field, we decided to publish it. However, we invite all readers to add remarks, corrections, updates, additions (including further annotations).Part of this work was done while we were associated with the FORWISS Institute of the Technical University of Munich. We would like to thank our student, Markus Blaschka, who compiled many references during his master's thesis.
Performance tradeoffs for client-server query processing
Authors: Michael J. Franklin, Björn Thór Jónsson, Donald Kossmann
Venue: ACM SIGMOD Record (1996)

The construction of high-performance database systems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectures that can fully exploit client and server resources in a flexible manner. The two predominant paradigms for client-server query execution are data-shipping and query-shipping We first define these policies in terms of the restrictions they place on operator site selection during query optimization. We then investigate the performance tradeoffs between them for bulk query processing. While each strategy has advantages, neither one on its own is efficient across a wide range of circumstances. We describe and evaluate a more flexible policy called hybrid-shipping, which can execute queries at clients, servers, or any combination of the two. Hybrid-shipping is shown to at least match the best of the two "pure" policies, and in some situations, to perform better than both. The implementation of hybrid-shipping raises a number of difficult problems for query optimization. We describe an initial investigation into the use of a 2-step query optimization strategy as a way of addressing these issues.
Prediction of memory consumption in conservative parallel simulation
Authors: Yung-Chang Wong, Shu-Yuen Hwang
Venue: ACM SIGSIM Simulation Digest (1995)

This paper proposes a critical path-like analyzer to predict the amount of memory consumed in a specific Chandy-Misra simulation: Segments of code are inserted into the existing sequential simulation program, and this modified simulation program is called a memory analyzer. The amount of memory needed in the corresponding Chandy-Misra simulation is computed along with the execution of the memory analyzer. Experiments to evaluate the analyzer are in groups.
System Equivalence for Periodic Models and Systems
Authors: Osvaldo M. Grasselli, Sauro Longhi, Antonio Tornambe
Venue: SIAM Journal on Control and Optimization (1995)

In this paper, the problem is considered of obtaining a periodic description in state-space form of a linear process which can be modelled by linear difference equations with periodic coefficients. On the basis of a polynomial time-invariant description of a linear periodic process, system equivalence between two such processes is introduced and studied. For a given periodic causal process, under an additional assumption, a periodic state-space description is found which is system equivalent to it. It is shown that the order, the characteristic multipliers and the stacked transfer matrix at any initial time of the periodic system thus obtained coincide with those of the original periodic process, and that the asymptotic stability, the reachability, the observability, the controllability, the reconstructibility, the stabilizability, the detectability, and even the Jordan form of the monodromy matrix of such a system, are determined by the original periodic model, as well as the existence of a solution of the robust tracking and regulation problem.
Methodology for simulation application to virtual manufacturing environments
Authors: Tracey L. Geller, Suzanne E. Lammers, Gerald T. Mackulak
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Supply chain management, enterprise integration and global optimization are all necessary to compete in today's global market. As new products are developed and partnerships are formed, companies will need to focus on "global optimization" across the entire supply chain, not just a portion. This paper describes the application of discrete event simulation for modeling the entire supply chain, or what has been coined "virtual factories." Using simulation during the design and implementation phases provides the supply chain with valuable insight into upstream and downstream processes to allow them to understand impacts before contracts are settled, schedules are defined or facilities are developed. There are many benefits to he realized from virtual factory modeling. The first and most obvious is it provides the means and visibility to make decisions at the global level. This includes areas such as: optimization of shared resources (e.g., shipping containers); schedule alignment (evaluation of strategic inventory); and contingency planning. Secondly, it aids in communication between the suppliers and customers by providing better visibility into all of the business operations, policies and assumptions. Finally, it is the only tool that provides a visual representation of the entire virtual factory. It is the one place where management can see how their products an moving through this virtual factory without traveling from one company to the next. Implementation experience with the IRIDIUM low earth orbit satellite communications system is described. This virtual factory simulation model along with focus on lean manufacturing and global optimization is what has driven Motorola and its partners to produce 66 satellites at an unheard of rate of 1 satellite per week.
Building reusable components in the public administration domain
Authors: S. Castano, V. De Antonellis, B. Pernici
Venue: ACM SIGSOFT Software Engineering Notes (1995)

The paper proposes methods and tools for building reusable components from families of Information System conceptual schemas, based on the identification of similar components in different schemas, and on their engineering into normalized descriptions. Clustering and abstraction techniques to help identifying similar components, and techniques to build corresponding reusable components are described in the paper.
Superior Information is Insufficient to Win in Games Between FiniteAutomata
Authors: Vladimir Chernorutskii, Rauf Izmailov, Alexei Pokrovskii
Venue: SIAM Journal on Control and Optimization (1996)

A game between two computers is considered: the first computer generates a binary sequence while the second one tries to predict the next element of this sequence using the previous elements. Both computers operate with the same pool of strategies, which is the set of all boolean functions of $N$ arguments. Notwithstanding the asymmetry of the game, it turns out that the value of the game is zero. An algorithm for choosing an optimal superstrategy for the first computer is proposed, and several generalizations of the game are considered.
A trace-driven simulation methodology
Authors: Humayun Khalid
Venue: ACM SIGARCH Computer Architecture News (1995)

This paper presents a simulation methodology for evaluating the performance of CISC computers. The method is called Message Flow Technique (MFT). MFT has several advantages over Instruction Flow Technique (IFT) we presented in [1]. The proposed methodology is applied to a single and two-level cache CISC system using 80486 SX as a case study. It was found that with a single-level on-chip cache of size 8K, the performance of the system is considerably limited by the service time of BIU(Bus Interface Unit). The average service time of BIU, per instruction, was found to be around 1.0135 microseconds for our Modified Gibson Mix (MGM). With a second-level external cache of sizes 16K, 32K, 64K, and 128K the average performance improvements were found to be 1.4%, 18.6%, 39% and 53% respectively. The methodology presented here is an efficient and easy to use tool that could help performance analysts in evaluating computer systems.
Bridging information technology and business&mdash;some modelling aspects
Authors: Stephanie Teufel
Venue: ACM SIGOIS Bulletin (1995)

Business strategies of today's companies are influenced by the permanent change of the relevant environment. This change, which has to be handled by the companies, is mainly driven by factors such as increased market dynamics, higher customer requirements, new technologies, broader competition boundaries and new innovative products and processes. This results in the fact that information, and especially its processing by means of information technology (IT), becomes a critical success factor. Therefore, the challenge of strategic management is to find efficient methods to bring business and information technology together. The Strategic Alignment Model supporting strategic management and the Customer Supplier Protocol supporting the design of business processes are introduced in this paper.
Stabilizability Does Not Imply Homogeneous Stabilizability for Controllable Homogeneous Systems
Authors: Rodolphe Sepulchre, Dirk Aeyels
Venue: SIAM Journal on Control and Optimization (1996)

This paper presents an example of a homogeneous planar controllable system which is stabilizable while not stabilizable by homogeneous feedback. Addition of an integrator to the system provides a three-dimensional {\it affine} system with the same properties.
Storage assignment to decrease code size
Authors: Stan Liao, Srinivas Devadas, Kurt Keutzer, Steve Tjiang, Albert Wang
Venue: ACM SIGPLAN Notices (1995)

DSP architectures typically provide indirect addressing modes with auto-increment and decrement. In addition, indexing mode is not available, and there are usually few, if any, general-purpose registers. Hence, it is necessary to use address registers and perform address arithmetic to access automatic variables. Subsuming the address arithmetic into auto-increment and auto-decrement modes improves the size of the generated code.In this paper we present a formulation of the problem of optimal storage assignment such that explicit instructions for address arithmetic are minimized. We prove that for the case of a single address register the decision problem is NP-complete. We then generalize the problem to multiple address registers. For both cases heuristic algorithms are given. Our experimental results indicate an improvement of 3.
A theory of weak bisimulation for core CML
Authors: William Ferreira, Matthew Hennessy, Alan Jeffrey
Venue: ACM SIGPLAN Notices (1996)

Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this papes we build upon John Reppy's reduction semantics for CML by constructing a compositional operational semantics for a fragment of CML, based on higher-order process algebra. We use this to build a semantic theory for CML, based on weak bisimulation equivalence. We give some small examples of proofs about CML expressions, and show that our semantics corresponds to Reppy's up to weak first-order bisimulation.
Efficient decomposition of polygons into L-shapes with application to VLSI layouts
Authors: Mario A. Lopez, Dinesh P. Mehta
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1996)

We present two practical algorithms for partitioning circuit components represented by rectilinear polygons so that they can be stored using the L-shaped corner stitching data structure; that is, our algorithms decompose a simple polygon into a set of nonoverlapping L-shapes and rectangles by using horizontal cuts only. The more general of our algorithms computes and optimal configuration for a wide variety of optimization functions, whereas the other computes a minimum configuration of rectangles and L-shapes. Both algorithms run in O(n + h log h time, where n is the number of vertices in the polygon and h is the number of H-pairs. Because for VLSI data h is small, in practice these algorithms are linear in n. Experimental results on actual VLSI data compare our algorithms and demonstrate the gains in performance for corner stitching (as measured by different objective functions) obtained by using them instead of more traditional rectangular partitioning algorithms.
Hypergraph based reorderings of outer join queries with complex predicates
Authors: Gautam Bhargava, Piyush Goel, Bala Iyer
Venue: Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)

Complex queries containing outer joins are, for the most part, executed by commercial DBMS products in an "as written" manner. Only a very few reorderings of the operations are considered and the benefits of considering comprehensive reordering schemes are not exploited. This is largely due to the fact there are no readily usable results for reordering such operations for relations with duplicates and/or outer join predicates that are other than "simple." Most previous approaches have ignored duplicates and complex predicates; the very few that have considered these aspects have suggested approaches that lead to a possibly exponential number of, and redundant intermediate joins. Since traditional query graph models are inadequate for modeling outer join queries with complex predicates, we present the needed hypergraph abstraction and algorithms for reordering such queries with joins and outer joins. As a result, the query optimizer can explore a significantly larger space of execution plans, and choose one with a low cost. Further, these algorithms are easily incorporated into well known and widely used enumeration methods such as dynamic programming.