ppxscal/embedding_network huggingface dataset:
ELITE Design Methodology of Foundation IP for Improving Synthesis Quality
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The ELITE (Essential Library in Technology Evolution) design methodology of foundation IP (Intellectual Property) for synthesis quality is presented in this paper. The design idea is derived from RISC (Reduced Instruction Set Computer) design philosophy in computer architecture. After analyzing the use rate of each cell with benchmarks, it shows that too many cells in a library not only increase the loading on library development and maintenance but also affect the quality of the logic synthesis. The ELITE design methodology proposes removing unused and rarely used cells from original library, then composing the most frequently used cells by logic synthesis tool to a new ELITE library. Due to fewer cells in a library, designers can significantly reduce the development time of cell library, shorten design time and pay more attention to improve the quality of the cell library with deep sub-micron process characteristics. Moreover, the experimental results show that, when ELITE libraries are used in logic synthesis the speed measurements improve 14.22% to 17.35% and the area measurements decrease 13.98% to 15.5% in unconstraint condition. The experiments of ELITE library has almost equal synthesis results when it is compared to conventional library with aggressive constraints. However, there are only 34 cells in ELITE library compared with 470 ones in the original library. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
TCP-R: TCP mobility support for continuous operation
Authors: D. Funato, K. Yasuda, H. Tokuda
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

The TCP-R (TCP Redirection) is an extension of TCP, which maintains active TCP connections when the disconnection occurs due to the change of the IP address or the change of the network device. In mobile computing environments, the IP address may be changed frequently as the host moves across subnets or changes a network device. However, it is difficult for most network applications to work continuously in such a situation. There is much research to support such dynamics in the network layer, but these attempts in the IP layer tend to incur some complexity. This paper is intended as an investigation of the end-to-end mobility support in transport layer. We developed the simple and secure redirection mechanism in TCP, which enables us to keep our working activities without any intermediate agents. We also show that TCP-R can serve as a solution to the retransmission timeout problem which frequently occurs in mobile environments. We implemented and evaluated a prototype of TCP-R by modifying FreeBSD. The measured performance indicates that TCP-R can maintain operation continuously with minimal overhead and complexity.
Exact Counting is as Easy as Approximate Counting
Authors: Jin Cai, Lane A. Hemachandra
Venue:  (1986)

We show that exact counting and approximate counting are polynomially equivalent. That is $P^{#P} = P^{Approx#P}$, where #$P$ is a function that computes the number of solutions to a given Boolean formula $f$ (denoted by $|| f ||$), and Approx#P computes a short list that contains $|| f ||$. It follows that if there is a good polynomial time approximator for #$P$ (i.e., one where the list has at most $O(|f|^{1-\epsilon})$ elements), then $P = NP = P^{#P}$ and probabilistic polynomial time equals polynomial time. Thus we have strong evidence that #$P$ cannot be easily approximated.
A Theory of Interleavers
Authors: Kenneth Andrews, Chris Heegard, Dexter Kozen
Venue:  (1997)

An interleaver is a hardware device commonly used in conjunction with error correcting codes to counteract the effect of burst errors. Interleavers are in widespread use and much is known about them from an engineering standpoint. In this paper we propose a mathematical model that provides a rigorous foundation for the theoretical study of interleavers. The model captures precisely such notions as block and convolutional interleavers, spread, periodicity, causality, latency, and memory usage. Using this model, we derive several optimality results on the latency and memory usage of interleavers. We describe a family of block interleavers and show that they are optimal with respect to latency among all block interleavers with a given spread. We also give tight upper and lower bounds on the memory requirements of interleavers.
A Comparision of Line Clipping Algorithms
Authors: J. D. Day
Venue:  (1991)

Various algorithms for clipping lines against rectangular windows are compared. Some are suitable for computations in either object space (floating point arithmetic) or image space (integer arithmetic) or both. A test data set of lines is proposed which is suitable for benchmarking these algorithms in a machine independent manner. Timing tests on a variety of systems verify the usefulness of this test set for comparing clipping algorithms, and some conclusions regarding their relative merit are made. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Enhancing the Nuprl Proof Development System and Applying it to Computational Abstract Algebra
Authors: Paul B. Jackson
Venue:  (1995)

This thesis describes substantial enhancements that were made to the software tools in the Nuprl system that are used to interactively guide the production of formal proofs. Over 20,000 lines of code were written for these tools. Also, a corpus of formal mathematics was created that consists of roughly 500 definitions and 1300 theorems. Much of this material is of a foundational nature and supports all current work in Nuprl. This thesis concentrates on describing the half of this corpus that is concerned with abstract algebra and that covers topics central to the mathematics of the computations carried out by computer algebra systems. The new proof tools include those that solve linear arithmetic problems, those that apply the properties of order relations, those that carry out inductive proof to support recursive definitions, and those that do sophisticated rewriting. The rewrite tools allow rewriting with relations of differing strengths and take care of selecting and applying appropriate congruence lemmas automatically. The rewrite relations can be order relations as well as equivalence relations. If they are order relations, appropriate monotonicity lemmas are selected. These proof tools were heavily used throughout the work on computational algebra. Many examples are given that illustrate their operation and demonstrate their effectiveness. The foundation for algebra introduced classes of monoids, groups, rings and modules, and included theories of order relations and permutations. Work on finite sets and multisets illustrates how a quotienting operation hides details of datatypes when reasoning about functional programs. Theories of summation operators were developed that drew indices from integer ranges, lists and multisets, and that summed over all the classes mentioned above. Elementary factorization theory was developed that characterized when cancellation monoids are factorial. An abstract data type for the operations of multivariate polynomial arithmetic was defined, and the correctness of an implementation of these operations was verified. The implementation is similar to those found in current computer algebra systems. This work was all done in Nuprl''s constructive type theory. The thesis discusses the appropriateness of this foundation, and the extent to which the work relied on it.
An Asynchronous Microprocessor in Gallium Arsenide
Authors: Jose A. Tierno, Alain J. Martin, Drazen Borkovic, Tak K Lee
Venue:  (1993)

In this paper, several techniques for designing asynchronous circuits in Gallium Arsenide are presented. Several new circuits were designed, to implement specific functions necessary to the design of a full microprocessor. A sense-amplifier, a completion tree, and a general circuit structure for operators specified by production rules are introduced. These circuit were used and tested in a variety of designs, including two asynchronous microprocessors and two asynchronous static RAM''s. One of the microprocessor runs at over 100 MIPS with a power consumption of 2 Watts.
Availability Issues in Data Replication in Distributed Database
Authors: Donald B. Johnson, Larry Raab
Venue:  (1991)

Replication of data at more than one site in a distributed database has been reported to increase the availability in data in systems where sites and links are subject to failure. We have shown in results summarized in this paper that in many interesting cases the advantage is slight. A well-placed single copy is available to transactions almost as much of the time as is correct replicated data no matter how ingeniously it is managed. We explain these findings in terms of the behavior of the partitions that form in networks where components fail. We also show that known and rather simple protocols for the maintenance of multiple copies are essentially best possible by comparing them against an unrealizable "protocol" that knows the future. We complete our study of these questions by reporting that while computing the availability of data is #P-complete, nonetheless there is a tight analytical bound on the amount replication can improve over a well-located single copy. We close with some observations regarding system design motivated by this work.
Process support for reuse
Authors: R. Conradi
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Software process improvement is evolving rapidly both as a research field and as an industrial practice. There is also a large and growing interest in software reuse, due to its obvious potential for improving quality, productivity and predictability of software production. The author discusses levels of process support for software reuse and reviews the state-of-the-art practice.
A Distributed Strategy for Resource Allocation
Authors: Ann Kratzer
Venue:  (1986)

In this paper, we present a decentralized algorithm for determining how resources should be allocated to sites. This algorithm is general in the sense that it can be used for allocating different kinds of resources. This algorithm can be applied either statically, used on a quiescent system, or used dynamically as the system runs. Throughout, we consider only systems in which a resource has a fixed cost associated with it regardless of where it may be located (i.e. the system is homogeneous). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Isotropic Effective Energy Simulated Annealing Searches for Low Energy Molecular Cluster States
Authors: Thomas F. Coleman, David Shalloway, Zhijun Wu
Venue:  (1992)

The search for low energy states of molecular clusters is associated with the study of molecular conformation and especially protein folding. This paper describes a new global minimization algorithm which is effective and efficient for finding low energy states and hence stable structures of molecular clusters. The algorithm combines simulated annealing with a class of effective energy functions which are transformed from the original energy function based on the theory of renormalization groups. The algorithm converges to low energy states asymptotically and is more efficient than a general simulated annealing method.
On One Tape Versus Two Stacks
Authors: Ming Li
Venue:  (1984)

We develop a simple method which enables us to prove three new lower bounds (for both worst and average cases) for on-line computations, answering two open problems summarized in [DGPR]. We give a language that requires $\Omega (n^{2})$ time for any 1-tape deterministic on-line machine, but it can be accepted by a 2-stack 1-reversal bounded deterministic on-line machine in real time. This provides a tight lower bound, closing the gap between $\Omega ( n(logn)^{1/2})$ lower bound by [P2] and the trivial $O(n^{2})$ upper bound. We also prove that 1-tape nondeterministic real time is much stronger than its deterministic version. For 1-tape on-line machines, we give language L (L'''') which is in nondeterministic linear (real) time but requires $\Omega(n^{2})(\Omega (n^{1.5}))$ deterministic time. Finally we give a language which can be accepted by a 2-stack 1-reversal bounded deterministic machine in real time, but it requires $\Omega(n^{1+1/2})$ time for any one tape nondeterministic online machine. This sharply improves an $nlogn$ lower bound in [DGPR]. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Incidence Propagation Method
Authors: W. Liu
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Incidence calculus is a probabilistic logic developed from propositional logic which associates probabilities with sets of possible worlds rather than with formulae directly. The probability of a formula is defined as the probability of the set of possible worlds in which this formula is true. This set of possible worlds is named as the incidence set of this formula. So the task of calculating probabilities of formulae relies on the task of obtaining incidence sets for formulae.In this paper, we present an approach for manipulating incidences in extended incidence calculus in the situation that the language set is large. We will show how to decompose this large set into small, but coherent sets and then how to propagate incidences among these sets. In this way incidence sets can be calculated efficiently. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Load Balancing Schemes for High-Throughput Distributed Fault-Tolerant Servers
Authors: Roy Friedman, Daniel Mosse
Venue:  (1996)

Clusters of workstations, connected by a fast network, are emerging as a viable architecture for building high-throughput fault-tolerant servers. This type of architecture is more scaleable and more cost-effective than a tightly coupled multiprocessor and may achieve as good a throughput. Two of the most important issues that a designer of such clustered servers must consider in order for the system to meet its fault-tolerance and throughput goals are the load balancing scheme and the fault-tolerance scheme that the system will use. This paper explores several combinations of such fault tolerance and load-balancing schemes, and compare their impact on the maximum throughout achievable by the system, and on its survivability. In particular, we show that a fault-tolerance scheme may have an effect on the throughput of the system, while a load-balancing scheme may affect the ability of the system to override failures. We study the scaleability of the different schemes under different loads and failure conditions. The validation of our schemes is done using data taken from emulations of an intelligent networking coprocessor of a telephone switch, which follows, for example, the SS7 signaling protocol.
An Advanced Internet XML/EDI Model Based on Secure XML Documents
Authors: Tatsuo Miyazawa, Takayuki Kushida
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, we propose an advanced Internet XML/EDI model that allows an Application Service Provider (ASP) to provide purchasing application services over the Internet. The model allows trading partners (buyers and suppliers) to securely exchange XML-based business documents over the Internet via ASP, instead of traditional EDI-based messages via value-added networks (VANs).It eliminates the costs of implementing EDI-related applications and the costs of communication. It also simplifies business automation at the ASP site and backend system integration at buyers' and suppliers' sites. In the model, XML security technologies such as XML digital signatures and XML element-wise encryption are also employed to achieve secure business transactions with trading partners. The security of transactions is ensured not by the system but by the documents themselves. The proposed model significantly reduces the disadvantages of traditional VAN-EDI and Web-based Internet EDI, and accelerates the spread of electronic exchange of business documents among trading partners.
Research report: improving browsing in information by the automatic display layout
Authors: P. Luders, R. Ernst
Venue: Proceedings of the 1995 IEEE Symposium on Information Visualization (1995)

It is well known that graphical representations could be very helpful to browse in graph structured information. But this promising approach requires the capability of an automatic layout system because the tedious and time consuming task of a manual layout leads to a rejection of this approach by the user. In our approach, we split the task of retrieving information into two phases that are getting the orientation within the network and reading currently visited information. We present layout algorithms for both phases which have the benefit of being flexible and adaptable to individual user requests and ensure the topological consistency, i.e. the stability of the topology of the information layout during a sequence of display layouts. The results show that especially the possibility of an animation of the layout process can assist the user essentially in maintaining the orientation in the information network.
Verilog modeling and simulation of a communication coprocessor for multicomputers
Authors: A. Shyamprakash, C. P. Ravikumar
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

We describe the Verilog modeling and design of a static fault-tolerant hardware router for use in a communication coprocessor in distributed memory multicomputer. The coprocessor employs a wormhole routing technique for packets. Virtual channels are used to better utilize the communication bandwidth offered by the physical links. The router implements a fault-tolerant routing algorithm, which can tolerate link faults in the multicomputer. We have carried out behavioral modeling of the communication coprocessor using Verilog. We have simulated the routing in a 3-dimensional hypercube to verify the hardware design of the coprocessor.
Safe and Efficient Cluster Communication in Java using Explicit Memory Management
Authors: Chi Chang
Venue:  (1999)

This thesis presents a framework for using explicit memory management to improve the communication performance of JavaTM cluster applications. The framework allows programmers to explicitly manage Java communication buffers, called jbufs, which are directly accessed by the DMA engines of high-performance network interfaces and by Java programs as primitive-typed ar-rays. The central idea is to remove the hard separation between Java''s gar-bage-collected heap and the non-collected memory region in which DMA buffers must normally be allocated. The programmer controls when a jbuf is part of the garbage-collected heap so that the garbage collector can ensure it is safely re-used or de-allocated, and when it is not so it can be used for DMA transfers. Unlike other techniques, jbufs preserve Java''s storageand type-safety and do not depend on a particular garbage collection scheme. The safety, efficiency, and programmability of jbufs are demonstrated throughout this thesis with implementations of an interface to the Virtual In-terface Architecture, of an Active Messages communication layer, and of Java Remote Method Invocation (RMI). The impact on applications is also evalu-ated using an implementation of cluster matrix multiplication as well as a publicly available RMI benchmark suite. The thesis proposes in-place object de-serialization (de-serialization with-out allocation and copying of objects) to further enhance the performance of RMI on homogeneous clusters. This optimization takes advantage of the zero-copy capabilities of network devices to reduce the per-object de-serialization costs to a constant irrespective of object size, which is particularly beneficial for large objects such as arrays. In-place de-serialization is realized using jstreams, an extension of jbufs with object I/O streams. Jstreams use the ex-plicit memory management offered by jbufs to incorporate de-serialized ob-jects into the receiving Java virtual machine without compromising its integrity, without restricting the usage of those objects, and without making assumptions about the underlying garbage collection scheme. The perform-ance impact of jstreams on Java RMI and the benchmark suite is evaluated. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
IDebug: An Advanced Debugging Framework for Java
Authors: Joseph R. Kiniry
Venue:  (1998)

IDebug, the Infospheres debugging framework, is an advanced debugging framework for Java. This framework provides the standard core debugging and specification constructs such as assertions, debug levels and categories, stack traces, and specialized exceptions. Debugging functionality can be fine-tuned to a per-thread and/or a per-class basis, debugging contexts can be stored to and recovered from persistent storage, and several aspects of the debugging run-time are configurable at the meta-level. Additionally, the framework is designed for extensibility. Planned improvements include support for debugging distributed object systems via currying call stacks across virtual machine contexts and debug information logging with a variety of networking media including unicast, multicast, RMI, distributed events, and JavaSpaces. Finally, we are adding support for debugging mobile agent systems by providing mobile debug logs.