ppxscal/embedding_network huggingface dataset:
Barrier integrity testing of Ta using triangular voltage sweep and a novel CV-BTS test structure
Authors: G. W. Book, K. Pfeifer, S. Smith
Venue: Microelectronic Engineering (2002)

Numerous techniques are available for evaluating the efficacy of barrier materials at preventing the diffusion of copper into dielectric materials. In this study, the capability of triangular voltage sweep (TVS) as a means of determining barrier integrity is investigated. Also in the study, a new test structure is introduced for performing capacitance voltage bias temperature stress (CV-BTS) tests. This test structure, which is designed to mimic barrier performance at the bottom of vias where step coverage is a challenge, was used to determine the diffusion barrier properties of PVD deposited tantalum as a function of Ta thickness in 0.25-µm vias.
Enterprise Computing
Authors: Richard Mateosian
Venue: IEEE Micro (2002)

In the March/April 1998 Micro Review, I reviewed a book by Roger Sessions about Microsoft's vision for distributed computing. Microsoft has continued to march down that road. As I found out at the VSLive conference in February 2002, the company seems to have assembled all of the pieces (COM+, .NET, C#, and Visual Basic) and is ready to put them together with XML into something called Web services.
Benefits of Automating Data Translation
Authors: Sandra A. Mamrak, Julie Barnes, Conleth S. O'Connell
Venue: IEEE Software (1993)

A description is given of the Integrated Chameleon Architecture, (ICA), a special software environment that automatically generates translation code, eliminating the error-prone process of writing and updating code, and enforces completeness in the high-level translator specification and correctness in the translated data. Two sets of translaters developed using ICA are examined. The first set translates ICA's user manual from the La Tex markup language to Troff markup macros. The second translates documents encoded in schemes like Refer (from the roff macro family) and Bibtex (La Tex's bibliographic package) into an encoding conventional imposed by a central bibliographic database for human-machine interaction.
Fault Models and Tests for a 2-Bit-per-Cell MLDRAM
Authors: Michael Redeker, Bruce F. Cockburn, Duncan G. Elliott
Venue: IEEE Design Test (1999)

This article presents a fault model and testing strategies for a 2-bit per cell dynamic random-access memory (DRAM). Multilevel DRAM technology may become an important way of increasing the storage density of semiconductor memory for a given process and minimum feature size. The multilevel DRAM that we consider re-uses many proven elements from a conventional 1-bit per cell DRAM cell array. From a list of reported DRAM physical defects we develop a fault model using both manual analysis and analog simulation. Several alternative testing strategies are proposed that make different trade-offs between testing cost and possible design for testability enhancements.
An Integrated Runtime and Compile-Time Approach for Parallelizing Structured and Block Structured Applications
Authors: Gagan Agrawal, Alan Sussman, Joel Saltz
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In compiling applications for distributed memory machines, runtime analysis is required when data to be communicated cannot be determined at compile-time. One such class of applications requiring runtime analysis is block structured codes. These codes employ multiple structured meshes, which may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular mesh problems). In this paper, we present runtime and compile-time analysis for compiling such applications on distributed memory parallel machines in an efficient and machine-independent fashion. We have designed and implemented a runtime library which supports the runtime analysis required. The library is currently implemented on several different systems. We have also developed compiler analysis for determining data access patterns at compile-time and inserting calls to the appropriate runtime routines. Our methods can be used by compilers for HPF-like parallel programming languages in compiling codes in which data distribution, loop bounds and/or strides are unknown at compile-time. To demonstrate the efficacy of our approach, we have implemented our compiler analysis in the Fortran 90D/HPF compiler developed at Syracuse University. We have experimented with a multiblock Navier-Stokes solver template and a multigrid code. Our experimental results show that our primitives have low runtime communication overheads and the compiler parallelized codes perform within 20% of the codes parallelized by manually inserting calls to the runtime library.
Storage Management in Virtual Tree Machines
Authors: F. W. Burton
Venue: IEEE Transactions on Computers (1988)

Many parallel algorithms, particularly divide-and-conquer algorithms, may be structured as dynamic trees of tasks. In general, as parallelism increases, storage requirements also increase. A sequential program keeps storage requirements small by finishing one task (or procedure invocation) before going on to another, so that the entire task tree is never in existence at any one time. This corresponds to a depth-first expansion of a tree of tasks. On the other hand, a breadth-first expansion often produces a higher degree of parallelism, but also may produce an exponential growth in storage requirements. The resources (processors and memory) of a given system can be matched by alternating between depth-first and breadth-first expansion. The author's approach is to determine how much storage would have been available to a task in a sequential system, and to ensure that at least as much storage is available to the task when it is executed in a distributed system.
A Decision Model for Choosing the Optimal Level of Storage in Temporal Databases
Authors: Debabrata Dey, Terence M. Barron, Aditya N. Saharia
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

A database allows its users to reduce uncertainty about the world. However, not all properties of all objects can always be stored in a database. As a result, the user may have to use probabilistic inference rules to estimate the data required for his decisions. A decision based on such estimated data may not be perfect. We call the costs associated with such suboptimal decisions the cost of incomplete information. This cost can be reduced by expanding the database to contain more information; such expansion will increase the data-related costs because of more data collection, manipulation, storage, and retrieval. A database designer must then consider the trade-off between the cost of incomplete information and the data-related costs, and choose a design that minimizes the overall cost to the organization. In temporal databases, the sheer volume of the data involved makes such a trade-off at design time all the more important. In this paper, we develop probabilistic inference rules that allow us to infer missing values in spatial, as well as temporal, dimension. We then use the framework for developing guidelines for designing and reorganizing temporal databases, which explicitly includes a trade-off between the incomplete information and the data-related costs.
National Productivity and Computers
Authors: Ralph E. Gomory
Venue: Computer (1995)

We are the first generation of Americans who think that their children will not live substantially better than we do. In the United States, national output has been growing very slowly over the past twenty years, and the average real wage has been stagnant. While economists disagree on many things, they do agree that they don't understand this slowdown in national productivity. Looking back at the economic history of the US, this article suggests that the postwar emphasis on science and technology came perhaps at the expense of the engineering skills--the attention to detail--so critical to US productivity. It takes a hard look at the oft-heard argument that improved education and increased R&D and investment are panaceas for stagnant economic growth. Above all, the author urges us to place our economic prejudices under the macroscope, to not let our predispositions blind us to the details of national productivity.
Similar-Shape Retrieval In Shape Data Management
Authors: Rajiv Mehrotra, James E. Gary
Venue: Computer (1995)

Retrieval of similar-looking shapes is an important problem in shape or visual database management. The authors describe the fundamentals of similar-shape retrieval and discuss the central issues that need to be resolved in designing a shape retrieval technique. They also present their own technique for retrieval of similar shapes, Feature Index- Based Similar-Shape Retrieval (FIBSSR). This system can handle images of articulated or rigid objects and query images of partially visible, overlapping, or touching objects. Query images can be simple or complex. In describing FIBSSR, the authors focus on shape representation, index structure, and query processing. Shape representation involves shape boundary and boundary points, called interest points. The shape boundary is coded as an ordered sequence of interest points. For the index structure, encoded feature vectors representing the shape boundary features help form a feature index for the shape database. The Euclidean distance between two feature vectors defines the similarity between the two respective features. And query processing involves query feature selection, formulation of possibly similar shapes, and formulation of the final response set. The authors also describe a prototype system based on FIBSSR to demonstrate how the key issues are resolved in the design of a typical shape retrieval system and to outline the important steps involved in its operation. A database of 101 rigid-and six articulated- shapes, with two components each, was used in several experiments to test this prototype system.
Heterogeneous Multimedia Reasoning
Authors: Anne Brink, Sherry Marcus, V. s. Subrahmanian
Venue: Computer (1995)

Although various multimedia systems exist in the commercial market today, most development efforts have proceeded along ad hoc lines that apply in narrow domains. The authors propose central principles around which multimedia database systems can be uniformly built for a variety of applications, independent of domain. These principles can be implemented in a shell/compiler. Domain-specific components, which vary from application to application, can be added to this compiler. The authors show that for most media data, it is possible to build meta data atop the physical medium. This meta data can be generated by a human, an image processing program, or a combination of the two. The data may also involve various degrees of certainty and reliability. A unified query language can be used to query this meta data. The language has a well-understood syntax and semantics rooted in formal logic. Based on this formal model, the authors have developed a prototype implementation of a system called the MACS (Media Abstraction Creation System), which provides the shell facilities alluded to above. In parallel, they have developed a general-purpose framework called Hermes (Het-erogeneous Reasoning and Mediator System), which uses the concept of a mediator to integrate diverse forms of information. MACS and Hermes can be combined to provide efficient support for multimedia reasoning with access to heterogeneous data sources.
Analysis of a Discontinuous Least Squares Spectral Element Method
Authors: Marc I. Gerritsma, Michael M. J. Proot
Venue: Journal of Scientific Computing (2002)

This paper addresses the development of a Discontinuous Spectral Least-Squares method. Based on pre-multiplication with a mesh-dependent function a discontinuous functional can be set up. Coercivity of this functional will be established. An example of the approximation to a continuous solution and a solution in which a jump is prescribed will be presented. The discontinuous least-squares method preserves symmetry and positive definiteness of the discrete system.
An Algebraic Approach to Formal Verification of Microprocessors
Authors: Kanji Hirabayashi
Venue: Journal of Electronic Testing: Theory and Applications (2001)

In this letter we report the formal verification of microprocessors. After we describe algebraically a bit-sliced microprocessor at both function and logic levels, we apply the symbolic manipulation of Mathematica.
Using Metrics to Evaluate Software System Maintainability
Authors: Don Coleman, Dan Ash, Bruce Lowther, Paul Oman
Venue: Computer (1994)

Software metrics have been much criticized in the last few years, sometimes justly but more often unjustly, because critics misunderstand the intent behind the technology. Software complexity metrics, for example, rarely measure the "inherent complexity" embedded in software systems, but they do a very good job of comparing the relative complexity of one portion of a system with another. In essence, they are good modeling tools. Whether they are also good measuring tools depends on how consistently and appropriately they are applied.
The Power Test for Data Dependence
Authors: M. Wolfe, C. W. Tseng
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A data dependence decision algorithm called the power test is introduced. The powertest is a combination of the extended GCD algorithm and the Fourier-Motzkin method to eliminate variables in a system of inequalities. This is the first test that can generate the information needed for some advanced transformations, and that can handle complex simultaneous loop limits. Previous work in data dependence decision algorithms is reviewed. Some examples which motivated the development of this test are examined, including those which demonstrate the additional power of the power test. Although it may be too expensive for use as a general-purpose dependence test in a compiler, the power test has proved useful in an interactive program restructuring environment.
Boundary slip phenomena in a binary gas mixture
Authors: I. N. Ivchenko, S. K. Loyalka, R. V. Tompson
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

The slip phenomena in gas mixtures are of fundamental significance in the specification of boundary conditions for flows in the slip regime. In a recent paper, new explicit results for the slip coefficients appropriate to binary gas mixtures were reported. The present work being reported extends the previous work to a higher level of accuracy by involving a higher order Chapman-Enskog expansion. In particular, new expressions for the slip coefficients are presented which are applicable for arbitrary models of the intermolecular interaction. Limiting expressions for the slip coefficients are given (for a simple gas) and the accuracy of the theory is discussed. Numerical calculations of the slip coefficients for different binary gas mixtures using the first and second order Chapman-Enskog approximations and the rigid sphere and Lennard-Jones (12-6) potential models have been carried out. The thermal creep and diffusion slip coefficients are found to be sensitive to the order of the approximation and to the potential model used. A comparison of the new higher order results with some of our previously obtained experimental data for the thermal transpiration effect has also been carried out and shows excellent agreement between the theory and the experiments which confirms the accuracy of the theory.
The marriage of effects and monads
Authors: Philip Wadler, Peter Thiemann
Venue: ACM Transactions on Computational Logic (TOCL) (2003)

Gifford and others proposed an effect typing discipline to delimit the scope of computational effects within a program, while Moggi and others proposed monads for much the same purpose. Here we marry effects to monads, uniting two previously separate lines of research. In particular, we show that the type, region, and effect system of Talpin and Jouvelot carries over directly to an analogous system for monads, including a type and effect reconstruction algorithm. The same technique should allow one to transpose any effect system into a corresponding monad system.
Theory of coulomb blockade in Tomonaga-Luttinger liquid connected with fermi liquids
Authors: Chika Tanaka, Shuichi Iwabuchi
Venue: Microelectronic Engineering (2002)

A self-consistent microscopic theory of Coulomb blockade in Tomonaga-Luttinger liquid island connected with Fermi liquid electrodes is proposed. The charging effect as well as Tomonaga-Luttinger nature are treated in consistent manner by bosonization technique with zero mode under open boundary condition. Tunneling current is calculated up to the lowest order. It is shown that the current is expressed in terms of the local spectral density modified by the open boundary condition as well as charging effect. For the ultrasmall island, the value of power-law exponent is not always definite.
A multikey hashing scheme using predicate trees
Authors: Patrick Valduriez, Yann Viemont
Venue: ACM SIGMOD Record (1984)

A new method for multikey access suitable for dynamic files is proposed that transforms multiple key values into a logical address This method is based on a new structure, called predicate tree, that represents the function applied to several keys A predicate tree permits to specify in a unified way various hashing schemes by allowing for different definitions of predicates A logical address qualifies a space partition of a file according to its predicate tree This address is seen as a single key by a digital hashing method which transforms it into a physical address This method is used to address records in a file and to transform a retrieval qualification on a file into a set of partitions to access Finally, a qualitative analysis of the behavior of the method is given which exhibits its value
Optimization of CVD dielectric process to achieve reliable ultra low-k air gaps
Authors: Vincent Arnal, Joaquin Torres, Jean-Philippe Reynard, Philippe Gayet, Christophe Vérove, Marc Guillermet, Philippe Spinelli
Venue: Microelectronic Engineering (2002)

The capability of CVD silicon oxide has been studied to achieve a controlled air gap between copper interconnects for sub-quarter micron CMOS technologies. Several deposition parameters have been investigated and their influence on air gap morphology and electrical performances are shown in this paper. A reliable process has been obtained from these experiments. The parasitic capacitance between lines is reduced by half using SiO2 air gap material.
Short Polynomial Representations for Square Roots Modulo p
Authors: Simon Joseph Agou, Marc Deléglise, Jean-Louis Nicolas
Venue: Designs, Codes and Cryptography (2003)

Let p be an odd prime number and a a square modulo p. It is well known that the simple formula a \frac{p+1}{4} mod p gives a square root of a when p &equiv; 3 mod 4. Let us write p &minus; 1 &equals; 2n s with s odd. A fast algorithm due to Shanks, with n steps, allows us to compute a square root of a modulo p. It will be shown that there exists a polynomial of at most 2n&minus;1 terms giving a square root of a. Moreover, if there exists a polynomial in a representing a square root of a modulo p, it will be proved that this polynomial would have at least 2n&minus;1 terms, except for a finite set \mathcal{P}n of primes p depending on n.
Failure Diagnosis of Structured VLSI
Authors: John Waicukauski, Eric Lindbloom
Venue: IEEE Design Test (1989)

The authors describe a method for diagnosing the failures observed in testing VLSI designs that use the scan-path structure. Diagnosis consists of simulating selected faults after testing using a fault simulator that allows the application of several patterns in parallel. The method is also suitable for signature-based random-pattern testing. The authors discuss diagnostic fault simulation, fault-list generation, relating faults to defects, diagnostic strategy, and random-pattern failures, and they report some experimental results to indicate the procedure's power.
Cross-talk immune VLSI design using a network of PLAs embedded in a regular layout fabric
Authors: Sunil P. Khatri, Robert K. Brayton, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We present a VLSI design methodology to address the cross-talk problem, which is becoming increasingly important in Deep Sub-Micron (DSM) IC design. In our approach, we implement the logic netlist in the form of a network of medium sized PLAs. We utilize two regular layout "fabrics" in our methodology, one for areas where PLA logic is implemented, and another for routing regions between such logic blocks. We show that a single PLA implemented in the first fabric style is not only cross-talk immune, but also about 2&times; smaller and faster than a traditional standard cell based implementation of the same logic. The second fabric, utilized in the routing region between individual PLAs, is also highly cross-talk immune. Additionally, in this fabric, power and ground signals are essentially "pre-routed" all over the die.Our synthesis flow involves decomposing the design into a network of PLAs, each of which has a bounded width and height. The number of inputs and outputs of each PLA are flexible as long as the resulting PLA width is bounded. We perform folding of PLAs to achieve better logic density. Routing is performed using 2, 3, 4, 5 and 6 routing layers. State-of-the-art commercial routing tools are utilized for the experiments involving the use of 3, 4, 5 and 6 routing layers.We have implemented the entire design flow using these ideas. Our scheme results in a reduction in the cross-talk between signal wires of between one and two orders of magnitude. As a result, for a 0.1&mu;m process, the delay variation due to cross-talk dramatically drops from 2.47:1 to 1.02:1. Additionally, our methodology results in circuits that are extremely fast and dense, with a timing improvement of about 15% and an overall area penalty of about 3% compared to standard cells. The regular arrangement of metal conductors in our scheme results in low and highly predictable inductive and capacitive parasitics, resulting in highly predictable designs. The crosstalk immunity, high speed, low area overhead and high predictability of our methodology indicate that it is a strong candidate as the preferred design methodology in the DSM era.
An interpretation of &#x03BB;&#x00B5;-calculus in &#x03BB;-calculus
Authors: Ken-etsu Fujita
Venue: Information Processing Letters (2002)

We show that any λ-model gives rise to a λµ-model, in the sense that if we have M =λµ N in the equational theory of type free λµ-calculus then [[M]] = D [[N]] holds true for some structure 〈[[-]], D〉 induced from a λ-model. The construction of λµ-models can be given by the use of a fixed point operator and the Gödel-Gentzen translation.
Capsules: A Shared Memory Access Mechanism for Concurrent C/C++
Authors: N. H. Gehani
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Concurrent C/C++ is a superset of C and C++ that provides parallel programming facilities based on message passing. Upon porting Concurrent C/C++to a shared memorymultiprocessor, the authors believed it would be appropriate to supplement ConcurrentC/C++ with explicit facilities for synchronizing accesses to shared data structures. Thecapsule, which is a shared memory access mechanism designed especially for ConcurrentC/C++ to match the C++data abstraction facility called the class, is discussed. Capsulesare like monitors but they have significant advantages. Capsules satisfy T. Bloom's (1979) criteria for expressiveness of synchronization conditions, support inheritance, allow operations to execute in parallel, and permit them to time out. The design of capsules is reviewed. The author evaluates existing shared memory mechanisms, describes capsules, gives examples of capsules, compares capsules with monitors, and discusses how capsules are implemented by the Concurrent C compiler.