ppxscal/embedding_network huggingface dataset:
On mismatches between incremental optimizers and instance perturbations in physical design tools
Authors: Andrew B. Kahng, Stefanus Mantik
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

The incremental, "construct by correction" design methodology has become widespread in constraint-dominated DSM design. We study the problem of ECO for physical design domains in the general context of incremental optimization. We observe that an incremental design methodology is typically built from a full optimizer that generates a solution for an initial instance, and an incremental optimizer that generates a sequence of solutions corresponding to a sequence of perturbed instances. Our hypothesis is that in practice, there can be a mismatch between the strength of the incremental optimizer and the magnitude of the perturbation between successive instances. When such a mismatch occurs, the solution quality will degrade -- perhaps to the point where the incremental optimizer should be replaced by the full optimizer. We document this phenomenon for three distinct domains -- partitioning, placement and routing -- using leading industry and academic tools. Our experiments show that current CAD tools may not be correctly designed for ECO-dominated design processes. Thus, compatibility between optimizer and instance perturbation merits attention both as a research question and as a matter of industry design practice.
Relationships Between Efficiency and Execution Time of Full Multigrid Methods on Parallel Computers
Authors: Ignacio Martín, Francisco Tirado
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

The large number of processing elements in current parallel systems necessitates the development of more comprehensive and realistic tools for the scalability analysis of algorithms on those architectures. This paper presents a simple analytical tool with which to study the scalability of parallel algorithm-architecture combinations. Our practical method studies separately execution time, efficiency, and memory usage in the accuracy-critical scaling model, where the problem size¿input data set size¿increases with the number of processors, which is the relevant one in many situations. The paper defines quantitative and qualitative measurements of the scalability and derives important relationships between execution time and efficiency. For example, results show that the best way to scale the system (to deteriorate as little as possible the properties of the system) is by maintaining constant execution time. These analytical results are verified with one candidate application for massive parallel computers: the full multigrid method. We study the scalability of a general d-dimensional full multigrid method on an r-dimensional mesh of processors. The analytical expressions are verified through experimental results obtained by implementing the full multigrid method on a Transputer-based machine and on the CRAY T3D.
Capital budgeting techniques using discounted fuzzy versus probabilistic cash flows
Authors: Cengiz Kahraman, Da Ruan, Ethem Tolga
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

Risk analysis involves the development of the probability distribution for the measure of effectiveness. The risk associated with an investment alternative is generally either given as the possibility of an unfavorable value of the measure of effectiveness or measured by the variance of the measure of effectiveness. In an uncertain economic decision environment, an expert's knowledge about discounting cash flows consists of a lot of vagueness instead of randomness. Cash amounts and interest rates are usually estimated by using educated guesses based on expected values or other statistical techniques to obtain them. Fuzzy numbers can capture the difficulties in estimating these parameters. In this paper, the formulas for the analyses of fuzzy present value, fuzzy equivalent uniform annual value, fuzzy future value, fuzzy benefit-cost ratio, and fuzzy payback period are developed and given some numeric examples. Then the examined cash flows are expanded to geometric and trigonometric cash flows and using these cash flows fuzzy present value, fuzzy future value, and fuzzy annual value formulas are developed for both discrete compounding and continuous compounding.
Partial linear complexes of PG(3,q)
Authors: K. Metsch, L. Storme
Venue: Discrete Mathematics (2002)

In this article, it is shown that the largest partial linear complex of PG(3,q) that is not contained in a linear complex has q3 + 3 lines. We also show that such an inextendable partial linear complex of size q3 + 3 is projectively unique except in the case q = 3.
The KWIC and the Dead: A Lesson in Computing History
Authors: Neville Holmes
Venue: Computer (2001)

Ideas published decades ago may suggest solutions to some of today's most pressing technological and social challenges.
Java Security: Present and Near Future
Authors: Li Gong
Venue: IEEE Micro (1997)

This paper gives an overview of the basics of Java-related security issues, and outlines the technical direction of Java in terms of the security architecture and desirable features. This document is a purely technical discussion for the wider Java community, and does not necessarily commit JavaSoft to any particular features or implementations.
Fault Detection in CVS Parity Trees with Application to Strongly Self-Checking Parity and Two-Rail Checkers
Authors: N. K. Jha
Venue: IEEE Transactions on Computers (1993)

The problem of single stuck-at, stuck-open, and stuck-on fault detection in cascode voltage switch (CVS) parity trees is considered. The results are also applied to parity and two-rail checkers. It is shown that, if the parity tree consists of only differential cascode voltage switch (DCVS) EX-OR gates, then the test set consists of at most five vectors (in some cases only four vectors are required) for detecting all detectable single stuck-at, stuck-open, and stuck-on faults, independent of the number of primary inputs and the number of inputs to any EX-OR gate in the tree. If, however, only a single-ended output is desired from the tree, then the final gate will be a single-ended cascode voltage switch (SCVS) EX-OR gate, for which the test set has only eight vectors. For a strongly self-checking (SSC) CVS parity checker, the size of a test set consisting of only codewords is nine, whereas for an SSC CVS two-rail checker the size of a test set consisting of only codewords is at most five.
Easy-to-Use Object-Oriented Parallel Processing with Mentat
Authors: Andrew S. Grimshaw
Venue: Computer (1993)

Mentat, an object-oriented parallel processing system designed to directly address the difficulty of developing architecture-independent parallel programs, is discussed. The Mentat system consists of two components: the Mentat programming language and the Mentat runtime system. The Mentat programming language, which is based on C++, is described. Performance results from implementing the Mentat runtime system on a network of Sun 3 and 4 workstations, the Silicon Graphics Iris, the Intel iPSC/2, and the Intel iPSC/860 are presented.
PKI: It's Not Dead, Just Resting
Authors: Peter Gutman
Venue: Computer (2002)

Like other flexible objects, the public key infrastructure sacrifices someutility in trying to be all things to all people. Mainly, PKI's generic, all-purposeidentity certificates fall short of what the marketplace demands, forcingvendors to develop more economically efficient, useful, and imaginative businessmodels. Thus, we must adapt the PKI design to the real world rather than trying to constrain the real world to match the PKI. A variety of alternative approaches, ranging from simple workarounds to designing the application to sidestep PKI'sshortcomings entirely, can help solve the problems inherent in the standard X.509model.
Arise: Advanced CASE Environment for Telecommunications
Authors: Patrick McLaughlin
Venue: IEEE Software (1993)

Arise (A reusability infrastructure for software engineering), one of the RACE I programming-infrastructure projects, is reviewed. Arise identified the key issues in the use of CASE environments and tools in telecommunications and specified solutions. In most cases, the project team demonstrated technical feasibility of the proposed solutions through prototypes, including the Arise prototype development environment. Among other issues, Arise addressed reuse, configuration management, distributed development, quality assurance, and integration.
An Interactive Fuzzy CAD Tool
Authors: Jason Moore, Mahmoud A. Manzoul
Venue: IEEE Micro (1996)

The use of fuzzy logic in real-time control applications necessitates special, application-specific hardware. We propose a CAD tool that assists in creating a systolic VLSI array directly from a set of fuzzy descriptive rules. The CAD tool acts as an interface between the fuzzy control designer and the VLSI technology. Using the description of the fuzzy controller, the developed tool generates three files. The first file is a netlist that describes the systolic architecture. This file is further used as input to the OCT tool suite, which is then used to create the layout. The second file contains information necessary to simulate the layout created from the first file. The third file is a parameter file that contains data used in the revision of the fuzzy rules, if necessary. The output files produced are in a format compatible with the OCT tool suite. However, the concepts proposed can be applied to most text-based VLSI design tools.
An Evaluation Model for Integrated Services on Wireless Broadband CDMA Networks
Authors: Songchar Jiang, Wan-De Weng
Venue: Wireless Personal Communications: An International Journal (1999)

This paper proposes a performance evaluation approach for integrated voice and data services on a broadband code division multiple access (CDMA) network. For random access schemes, the dynamic behavior of a CDMA channel infers that we must be cautious with a performance judgment. We must be especially careful when choosing a mathematical model that has to include the effect of dynamic error rates. The approach shown in this paper is to employ a Poisson error model that takes the occurrence of errors as a Poisson process with the occurring rate dependent on the channel traffic. Based on this assumption, we developed a continuous-time Markov chain model to evaluate the throughput and delay performance. This approach can certainly apply to the evaluation of many integrated services protocols.
Performance Analysis of Cellular Mobile Communications under MultipathInterference
Authors: Jyh-Horng Wen, Di-Yar Han
Venue: Wireless Personal Communications: An International Journal (2000)

In a radio communication environment, no matter whether signal is transmitted outdoors or indoors, the phenomenon of multipath interference is unavoidable. Therefore, it is necessary for us to thoroughly study the effect of multipath interference on cellular mobile systems. In this paper, we first investigate the effect of multipath interference on the performance of a single cell system with finite users. In order to use the Markov chain method, a system model with 2-dimensional state vector is presented. With his model, the system performance under multipath interference has been successfully derived. Next, an extended-slot method to reduce the multipath interference triggered by LOS packets occurring in the previous slot is proposed. Numerical results show that this method can remarkably enhance the system performance. Finally, we further analyze the combined effect of co-channel interference and multipath interference on the performance of multicell systems. Numerical results show that the system performance suffers some degradation compared to the single cell environment. However, the degradation under typical environments with path-loss exponent around 4 is insignificant.
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
Authors: W. J. Dally, H. Aoki
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The use of adaptive routing in a multicomputer interconnection network improves network performance by using all available paths and provides fault tolerance by allowing messages to be routed around failed channels and nodes. Two deadlock-free adaptive routing algorithms are described. Both algorithms allocate virtual channels using a count of the number of dimension reversals a packet has performed to eliminate cycles in resource dependency graphs. The static algorithm eliminates cycles in the network channel dependency graph. The dynamic algorithm improves virtual channel utilization by permitting dependency cycles and instead eliminating cycles in the packet wait-for graph. It is proved that these algorithms are deadlock-free. Experimental measurements of their performance are presented.
Atlas: A Nested Relational Database System for Text Applications
Authors: Ron Sacks-Davis, Alan Kent, Kotagiri Ramamohanarao, James Thom, Justin Zobel
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Advanced database applications require facilities such as text indexing, image storage, and the ability to store data with a complex structure. However, these facilities are not usually included in traditional database systems. In this paper we describe Atlas, a nested relational database system that has been designed for text-based applications. The Atlas query language is TQL, an SQL-like query language with text operators. The query language is supported by signature file text indexing techniques, and by a parser that can be configured for different text formats and even some foreign languages. Atlas can also be used to store images and audio.
Short stripe effect and electromigration stress
Authors: E. E. Glickman
Venue: Microelectronic Engineering (2002)

From the perspective of the recent contributions to the field, we discuss essential physics behind the short-stripe effect in drift velocity electromigration (EM), transition to the creep controlled electromigration in short, near-threshold interconnects, the role of dynamic EM stresses and possible mechanism of their relaxation by non-constrained diffusional creep into hillocks.
Teaching Distributed Multidisciplinary Software Development
Authors: Lisa J. Burnell, John W. Priest, John R. Durrett
Venue: IEEE Software (2002)

Based on actual experience, we present an innovative teaching method for software development in distributed multi-disciplinary environments similar to those found in industry. The case study describes a project developed by teams of students from multiple departments and universities. The process used and lessons learned are reported.
Qualitative and Quantitative Temporal Constraints and Relational Databases: Theory, Architecture, and Applications
Authors: Vittorio Brusoni, Luca Console, Paolo Terenziani, Barbara Pernici
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Many different applications in different areas need to deal with both: 1) databases, in order to take into account large amounts of structured data, and 2) quantitative and qualitative temporal constraints about such data. In this paper, we propose an approach that extends: 1) temporal databases, and 2) artificial intelligence temporal reasoning techniques and integrate them in order to face such a need. Regarding temporal reasoning, we consider some results that we proved recently about efficient query answering in the Simple Temporal Problem framework and we extend them in order to deal with partitioned sets of constraints and to support relational database operations. Regarding databases, we extend the relational model in order to consider also qualitative and quantitative temporal constraints both in the data (data expressiveness) and in the queries (query expressiveness). We then propose a modular architecture integrating a relational database with a temporal reasoner. We also consider classes of applications that fit into our approach and consider patient management in a hospital as an example.
On decomposing Kn-I into cycles of a fixed odd length
Authors: Mateja Sajna
Venue: Discrete Mathematics (2002)

We show that if Kn - I, the complete graph on n vertices with a 1-factor removed, can be decomposed into cycles of a fixed odd length m for all n in the range m ≤ n > 3m that satisfy the obvious necessary conditions, then Kn - I can be decomposed into m-cycles for all n ≥ m satisfying the necessary conditions.
Successfully applying software metrics
Authors: Robert B. Grady
Venue: Computer (1994)

The word success is very powerful. It creates strong, but widely varied, images that may range from the final seconds of an athletic contest to a graduation ceremony to the loss of 10 pounds. Success makes us feel good; it's cause for celebration. All these examples of success are marked by a measurable end point, whether externally or self-created. Most of us who create software approach projects with some similar idea of success. Our feelings from project start to end are often strongly influenced by whether we spent any early time describing this success and how we might measure progress. Software metrics measure specific attributes of a software product or a software development process. In other words, they are measures of success. It's convenient to group the ways that we apply metrics to measure success into four areas. What do you need to measure and analyze to make your project a success? We show examples from many projects and Hewlett Packard divisions which may help you chart your course.
Dependent Types for Program Termination Verification
Authors: Hongwei Xi
Venue: Higher-Order and Symbolic Computation (2002)

Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is still undeniably a difficult task to design a termination checker for a realistic programming language that supports general recursion. In this paper, we present an approach to program termination verification that makes use of a form of dependent types developed in Dependent ML (DML), demonstrating a novel application of such dependent types to establishing a liveness property. We design a type system that enables the programmer to supply metrics for verifying program termination and prove that every well-typed program in this type system is terminating. We also provide realistic examples, which are all verified in a prototype implementation, to support the effectiveness of our approach to program termination verification as well as its unobtrusiveness to programming. The main contribution of the paper lies in the design of an approach to program termination verification that smoothly combines types with metrics, yielding a type system capable of guaranteeing program termination that supports a general form of recursion (including mutual recursion), higher-order functions, algebraic datatypes, and polymorphism.
Improved bounds for asymmetric communication protocols
Authors: Eduardo Sany Laber, Leonardo Gomes Holanda
Venue: Information Processing Letters (2002)

Adler and Maggs [FOCS'98, 1998, 522] introduced some protocols for asymmetric communication channels. For one of them, the "computational efficient" one, they prove that the expected number of bits sent by the client to the server is at most 1.71H(D) + 1, where H(D) is the entropy of the distribution of probability D maintained by the server. In this paper, we show that their protocol is much better. In fact, we prove that the expected number of bits sent by the client is at most H(D)/(log2 3 - 2/3) + 1 ≈ 1.089H(D) + 1. We also argue that this upper bound is tight in the sense that there is a distribution for which this protocol does not perform any better.
Database Technology for Decision Support Systems
Authors: Surajit Chaudhuri, Umeshwar Dayal, Venkatesh Ganti
Venue: Computer (2001)

Decision support systems form the core of business IT infrastructures because they let companies translate business information into tangible and lucrative results. Collecting, maintaining, and analyzing large amounts of data, however, involves expensive technical challenges that require organizational commitment. Many commercial tools are available for each of the three major data warehousing tasks: populating the data warehouse from independent operational databases, storing and managing the data, and analyzing the data to make intelligent business decisions. Data cleaning relates to heterogeneous data integration, a problem studied for many years. More work must be done to develop domain-independent tools that solve the data cleaning problems associated with data warehouse development. Most data mining research has focused on developing algorithms for building more accurate models or building models faster. However, data preparation and mining model deployment present several engaging problems that relate specifically to achieving better synergy between database systems and data mining technology.
Edge-cuts leaving components of order at least three
Authors: Paul Bonsma, Nicola Ueffing, Lutz Volkmann
Venue: Discrete Mathematics (2002)

Let G be a graph with vertex set V(G) and edge set E(G). For X ⊆ V(G) let G[X] be the subgraph induced by X,X = V(G) - X, and (X,X) the set of edges in G with one end in X and the other in X. If G is a connected graph and S ⊆ E(G) such that G - S is disconnected, and each component of G - S consists of at least three vertices, then we speak of an order-3 edge-cut. The minimum cardinality |S| over all order-3 edge-cuts in G is called the order-3 edge-connectivity, denoted by λ3=λ3(G). A connected graph G is λ3-connected, if λ3(G) exists. An order-3 edge-cut S in G is called a λ3-cut, if |S| = λ3. First of all, we characterize the class of graphs which are not λ3-connected. Then we show for λ3-connected graphs G that λ3(G) ≤ ξ3(G), where ξ3(G) is defined by ξ3(G) = min{|(X,X)|: X ⊆ V(G),|X| = 3, G[X] is connected}. A λ3-connected graph G is called λ3-optimal, if λ3(G) = ξ3(G). If (X,X) is a λ3-cut, then X ⊆ V(G) is called a λ3-fragment. Let r3(G) = min{|X|:X is a λ3-fragment of G}. We prove that a λ3-connected graph G is λ3-optimal if and only if r3(G) = 3. Finally, we study the λ3-optimality of some graph classes. In particular, we show that the complete bipartite graph Kr,s with r,s ≥ 2 and r + s ≥ 6 is λ3-optimal.
A Comparison of MPI, SHMEM and Cache-Coherent Shared Address Space Programming Models on a Tightly-Coupled Multiprocessors
Authors: Hongzhang Shan, Jaswinder Pal Singh
Venue: International Journal of Parallel Programming (2001)

We compare the performance of three major programming models on a modern, 64-processor hardware cache-coherent machine, one of the two major types of platforms upon which high-performance computing is converging. We focus on applications that are either regular, predictable or at least do not require fine-grained dynamic replication of irregularly accessed data. Within this class, we use programs with a range of important communication patterns. We examine whether the basic parallel algorithm and communication structuring approaches needed for best performance are similar or different among the models, whether some models have substantial performance advantages over others as problem size and number of processors change, what the sources of these performance differences are, where the programs spend their time, and whether substantial improvements can be obtained by modifying either the application programming interfaces or the implementations of the programming models on this type of tightly-coupled multiprocessor platform.