ppxscal/embedding_network huggingface dataset:
False-noise analysis using logic implications
Authors: Alexey Glebov, Sergey Gavrilov, David Blaauw, Supamas Sirichotiyakul, Chanhee Oh, Vladimir Zolotov
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Cross-coupled noise analysis has become a critical concern in today's VLSI designs. Typically, noise analysis makes an assumption that all aggressing nets can simultaneously switch in the same direction. This creates a worst-case noise pulse on the victim net that often leads to false noise violations. In this paper, we present a new approach that uses logic implications to identify the maximum set of aggressor nets that can inject noise simultaneously under the logic constraints of the circuit. We propose an approach to efficiently generate logic implications from a transistor-level description and propagate them in the circuit using ROBDD representations and a newly proposed laterial propagation method. We then show that the problem of finding the worst case logically feasible noise can be represented as a maximum weighted independent set problem and show how to efficiently solve it. Initially, we restrict our discussion to zero-delay implications, which are valid for glitch-free circuits and then extend our approach to timed implications. The proposed approaches were implemented in an industrial noise analysis tool and results are shown for a number of industrial test cases. We demonstrate that a significant reduction in the number of noise failures can be obtained from considering the logic implications as proposed in this paper, underscoring the need for false-noise analysis.
Ontologies for geographic information processing
Authors: U. Visser, H. Stuckenschmidt, G. Schuster, T. Vögele
Venue: Computers Geosciences (2002)

The development of geographical information systems (GIS) and the interoperability between these systems demands new requirements for the description of the underlying data. The exchange of data between GIS systems is problematic and often fails due to confusion in the meaning of concepts. The term semantic translator, a translator between GIS systems and/or catalogue systems which gives the user the option to map data between the systems is a topic of current research. This paper provides an overview of formal ontologies and how they can be used for geographical information processing. A description of an intelligent broker architecture for semantic-based information retrieval is introduced, and shows how this approach can be used for general purposes. In conclusion we attempt to provide a roadmap for the use of ontologies for geographic information processing.
The diagonalisation of the multivariate Bernstein operator
Authors: Shaun Cooper, Shayne Waldron
Venue: Journal of Approximation Theory (2002)

Let <i>B<inf>n</inf></i> be the multivariate Bernstein operator of degree <i>n</i> for a simplex in R<sup><i>s</i></sup>. In this paper, we show that <i>B<inf>n</inf></i> is diagonalisable with the same eigenvalues as the univariate Bernstein operator, i.e., <i>λ<inf>k</inf><sup>(n)</sup>:=n!/(n - k)! 1/n<sup>k</sup>, K = 1,...,n, 1= &lambda<inf>1</inf><sup>(n)</sup> < ... < λ<inf>n</inf><sup>(n)</sup> < 0</i>, and we describe the corresponding eigenfuctions and their properties. Since <i>B<inf>n</inf></i> reproduces only the linear polynomials, these are the eigenspace for λ<inf>1</inf><sup>(<i>n</i>)</sup> = 1. For <i>k</i> < 1, the λ<inf><i>k</i></inf><sup>(<i>n</i>)</sup>-eigenspace consists of polynomials of exact degree <i>k</i>, which are uniquely determined by their leading term. These are described in terms of the substitution of the barycentric coordinates (for the underlying simplex) into <i>elementary eigenfunctions.</i> It turns out that there are eigenfunctions of every degree <i>k</i> which are common to each <i>B<inf>n</inf></i>, <i>n ≥ k</i>, for sufficiently large <i>s</i>. The <i>limiting eigenfunctions</i> and their connection with orthogonal polynomials of several variables is also considered.
Heuristics for Iterative Software Development
Authors: Drasko Sotirovski
Venue: IEEE Software (2001)

The author discusses the foundation principles of iterative software development before proceeding to his main topic: a small set of useful heuristics for applying iterative development methods in practice.
On the minimum size of visibility graphs
Authors: Alfredo García Olaverri, Ferran Hurtado, Marc Noy, Javier Tejel
Venue: Information Processing Letters (2002)

In this paper we give tight lower bounds on the size of the visibility graph, the contracted visibility graph, and the bar-visibility graph of n disjoint line segments in the plane, according to their vertex-connectivity.
A Spherical Representation for Recognition of Free-Form Surfaces
Authors: Martial Hebert, Katsushi Ikeuchi, Hervé Delingette
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We introduce a new surface representation for recognizing curved objects. Our approach begins by representing an object by a discrete mesh of points built from range data or from a geometric model of the object. The mesh is computed from the data by deforming a standard shaped mesh, for example, an ellipsoid, until it fits the surface of the object. We define local regularity constraints that the mesh must satisfy. We then define a canonical mapping between the mesh describing the object and a standard spherical mesh. A surface curvature index that is pose-invariant is stored at every node of the mesh. We use this object representation for recognition by comparing the spherical model of a reference object with the model extracted from a new observed scene. We show how the similarity between reference model and observed data can be evaluated and we show how the pose of the reference object in the observed scene can be easily computed using this representation.We present results on real range images which show that this approach to modelling and recognizing 3D objects has three main advantages: First, it is applicable to complex curved surfaces that cannot be handled by conventional techniques. Second, it reduces the recognition problem to the computation of similarity between spherical distributions; in particular, the recognition algorithm does not require any combinatorial search. Finally, even though it is based on a spherical mapping, the approach can handle occlusions and partial views.
Using a Relational Database to Support Explanation in a Knowledge-Based System
Authors: A. Basu, R. Ahad
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

In knowledge-based system (KBS) applications where the number of facts in the knowledge base is very large, the amount of information that is needed for effective explanation support can become too voluminous to be stored in main memory. The authors present an approach to modeling and managing the information needed for explanation rising a relational database. It is shown how different types of explanation can then be produced by appropriate queries on this database. The authors formulate representative queries for some major types of explanation using ESQL, an extension of structured query language (SQL).
Chabot: Retrieval from a Relational Database of Images
Authors: Virginia E. Ogle, Michael Stonebraker
Venue: Computer (1995)

With its digitized image collection growing and the number of requests for prints and slides increasing, the State of California Department of Water Resources is looking to Chabot to enhance its search and retrieval capabilities. Chabot is a picture retrieval system for a database that will eventually include more than 500,000 digitized multiresolution images. The authors describe the design and construction of this system, which uses the relational database management system Postgres for storing and managing the images and their associated textual data. For retrieval, Chabot uses tools provided by Postgres, such as representation of complex data types, a rich query language, and extensible types and functions. To implement retrieval from the current collection of 11,643 images, Chabot integrates the use of stored text and other data types with content-based analysis of the images to perform "concept queries." As a first step toward integrating content analysis into the retrieval system, the authors implemented a method for image color analysis. They describe how the effectiveness of content analysis was tested by measuring the recall and precision obtained with certain concept queries. The use of either keywords or content alone failed to give satisfactory image retrieval results, but when concept queries combined both methods, results showed significant improvement.
Effect of Noise on Analog Circuit Testing
Authors: Madhu K. Iyer, M. L. Bushnell
Venue: Journal of Electronic Testing: Theory and Applications (1999)

The effect of test environment noise (tester noise) on test waveforms is considered. We show that tests generated ignoring the tester noise characteristics are prone to failure when actually applied to the circuit-under-test (CUT). The failure may result in the good circuit being declared faulty or the faulty circuit being declared good. This failure is independent of the fault model and nature of the test, i.e., AC or DC, time domain or frequency domain. We characterize the total noise at the primary outputs (PO&lsquo;s) of the circuit using second order statistics. We use the noise power spectrum and root mean square (RMS) values to make decisions about the test waveforms and recommend more noise-robust tests. For non-linear circuits we use the Central Limit Theorem of statistics to approximate narrow band noise at a primary input (PI) by a sum of sinusoidal distributions, and we use Monte-Carlo simulations to determine the noise at the PO&lsquo;s in the time domain. Results of experiments on an instrumentation amplifier, a biquadratic filter, and a Gilbert multiplier are presented, which prove that valid tests in a noise-free environment are invalid when tester noise is considered.
Collecting Unused Processing Capacity: An Analysis of Transient Distributed Systems
Authors: L. Kleinrock, W. Korfhage
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

It is suggested that if the large numbers of idle computers and workstations in distributedsystems could be used then considerable computing power could be harnessed at lowcost. Such systems are analyzed using Brownian motion with drift to model the executionof a program distributed over the idle computers in a network of idle and busy processors.The ways in which the use of these transient processors affects a program's executiontime is determined. The probability density of a program's finishing time on both single and multiple transient processors is found. These results are explored for qualitative insight. Some approximations for the finishing time probability density are suggested.
The Role of Test Protocols in Automated Test Generation for Embedded-Core-Based System ICs
Authors: Erik Jan Marinissen
Venue: Journal of Electronic Testing: Theory and Applications (2002)

Modular testing is an attractive approach to testing large system ICs, especially if they are built from pre-designed reusable embedded cores. This paper describes an automated modular test development approach. The basis of this approach is that a core or module test is dissected into a test protocol and a test pattern list. A test protocol describes in detail how to apply one test pattern to the core, while abstracting from the specific test pattern stimulus and response values. Subsequent automation tasks, such as the expansion from core-level tests to system-chip-level tests and test scheduling, all work on test protocols, thereby greatly reducing the amount of compute time and data involved. Finally, an SOC-level test is assembled from the expanded and scheduled test protocols and the (so far untouched) test patterns. This paper describes and formalizes the notion of test protocols and the algorithms for test protocol expansion and scheduling. A running example is featured throughout the paper. We also elaborate on the industrial usage of the concepts described.
JSTL: JSP Standard Tag Library Kick Start, 4th edition
Authors: Jeff Heaton
Venue:  (2002)

:The JSP Standard Tag Library is a collection of commonly used functions and tools invaluable to JSP developers to avoid re-creating the same functions on site after site. Sun has indicated that JSP development should be based around using tag libraries going forward, and will relase JSP STL, as their official library. This book starts with an in-depth deiscussion of the JSP STL, then goes beyond the standard library to teach developers to create their own tags to further encapsulate the most common features of their specific applications. Along the way, readers will also learn to use tags to access data, process XML, handle expressions, and further customize pages for international visitors. Later chapters explain how readers can expand the Standard Tab Library by creating their own tags.Author Biography: Jeff Heaton is a consultant, college instructor, and author who currently works for the Reinsurance Company of America (RGA) as a Java Software Designer. Jeff also teaches Java and C++ at St. Louis Community College at Meramec, and has worked with companies such as Mastercard, Anheuser-Busch, and Boeing. He's a Sun Certified Java Programmer and a member of the IEEE, and has published numerous articles in Java magazines and journals. Previously, Jeff wrote Programming Spiders, Bots, and Aggregators in Java, 0782140408, Sybex, March 2002.
Efficient Local Search with Conflict Minimization: A Case Study of the n-Queens Problem
Authors: R. Sosic, J. Gu
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Backtracking search is frequently applied to solve a constraint-based search problem, but it often suffers from exponential growth of computing time. We present an alternative to backtracking search: local search with conflict minimization. We have applied this general search framework to study a benchmark constraint-based search problem, the n-queens problem. An efficient local search algorithm for the n-queens problem was implemented. This algorithm, running in linear time, does not backtrack. It is capable of finding a solution for extremely large size n-queens problems. For example, on a workstation it can find a solution for 3000000 queens in less than 55 s.
DC Built-In Self-Test for Linear Analog Circuits
Authors: Abhijit Chatterjee, Bruce C. Kim, Naveena Nagi
Venue: IEEE Design Test (1996)

DC testing of analog circuits is inexpensive compared to AC testing and provides high coverage of many fault classes including some that are not detected by AC tests. It is also particularly effective in detecting catastrophic failures such as line opens and shorts. In this article, we present an efficient low-cost built-in self-test (BIST) methodology for linear analog circuits that is targeted towards faults that can be detected with DC tests. The methodology is based on the use of checksum encodings of matrix representations of the DC transfer function of the circuit under test (CUT). A small amount of circuitry called the checking circuitry is appended to the CUT for the purpose of on-chip fault detection. In test mode, DC stimulus is applied to the CUT via low-cost on-chip BIST circuitry. The presence of a non-zero signal at the output of the checking circuit indicates the presence of a fault.
A Numerical Investigation of High-Order Finite Elements for Problems of Elastoplasticity
Authors: A. Düster, A. Niggl, V. Nübel, E. Rank
Venue: Journal of Scientific Computing (2002)

A high order finite element approach is applied to elastoplastic problems in two as well as in three dimensions. The element formulations are based on quadrilaterals and hexahedrals, taking advantage of the blending function method in order to accurately represent the geometry. A comparison of h- and p-extensions is drawn and it is shown that thin-walled structures commonly being analysed by dimensionally reduced elements may be consistently discretized by high order hexahedral elements leading to reliable and efficient computations even in case of physically nonlinear problems.
Testing and Diagnosing Managed Networks
Authors: Randall Mcree
Venue: IEEE Design Test (1995)

Suppliers of computers and networking products face a considerable challenge in verifying the functionality of their equipment, both when manufactured and after installation. This problem is exacerbated for the customer by the fact that, increasingly, such equipment is used as part of a heterogeneous network constructed of diverse products purchased from a wide range of suppliers.The ISO/ITU test management protocol described in this article is designed to alleviate this problem by standardizing the interface between testing and diagnostic tools and the networked computer and/or communications systems under test. Through this interface, tests can be initiated, controlled, and observed in a uniform manner, independent of the design or supplier of the systems from which the network is constructed.
The vertex-cover polynomial of a graph
Authors: F. M. Dong, M. D. Hendy, C. H. C. Little
Venue: Discrete Mathematics (2002)

In this paper we define the vertex-cover polynomial Ψ(G, τ) for a graph G. The coefficient of τr in this polynomial is the number of vertex covers V' of G with |V'| = r. We develop a method to calculate Ψ(G, τ). Motivated by a problem in biological systematics, we also consider the mappings f from {1, 2,...,m} into the vertex set V(G) of a graph G, subject to f-1(x) ∪ f-1(y) ≠ φ for every edge xy in G. Let F(G,m) be the number of such mappings f. We show that F(G, m) can be determined from Ψ(G, τ).
The Origins of Ontologies and Communication Conventions in Multi-Agent Systems
Authors: Luc Steels
Venue: Autonomous Agents and Multi-Agent Systems (1998)

The paper proposes a complex adaptive systems approach to the formation of an ontology and a shared lexicon in a group of distributed agents with only local interactions and no central control authority. The underlying mechanisms are explained in some detail and results of some experiments with robotic agents are briefly reported.
A Distributed Real-Time Operating System
Authors: Kang G. Shin, Dilip D. Kandlur, Daniel L. Kiskis, Paul S. Dodd, Harold A. Rosenberg, Atri Indiresan
Venue: IEEE Software (1992)

Two versions of the HARTS operating system, which is based on Software Components Group's pSOS uniprocessor kernel, are presented. In one version, pSOS services are enhanced to provide interprocessor communication and a distributed naming service. In the second version, real-time fault-tolerant communication, including reliable broadcasting, clock synchronization, and group communication are added to the HARTS operating system. Three tools to evaluate the performance and fault tolerance dependability of HARTS hardware and software-a synthetic-workload generator, a monitor, and a fault injector-are described. The generator produces a synthetic workload, the monitor collects the performance data, and the fault injector simulates faulty behavior for further study. Together these tools create a facility that lets the user perform a wide range of experiments. The tools are independent, so they are equally effective separately or together, depending on the requirements.
Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs
Authors: Siegfried Benkner, Viera Sipkova
Venue: International Journal of Parallel Programming (2003)

Clusters of SMPs are hybrid-parallel architectures that combine the main concepts of distributed-memory and shared-memory parallel machines. Although SMP clusters are widely used in the high performance computing community, there exists no single programming paradigm that allows exploiting the hierarchical structure of these machines. Most parallel applications deployed on SMP clusters are based on MPI, the standard API for distributed-memory parallel programming, and thus may miss a number of optimization opportunities offered by the shared memory available within SMP nodes. In this paper we present extensions to the data parallel programming language HPF and associated compilation techniques for optimizing HPF programs on clusters of SMPs. The proposed extensions enable programmers to control key aspects of distributed-memory and shared-memory parallelization at a high-level of abstraction. Based on these language extensions, a compiler can adopt a hybrid parallelization strategy which closely reflects the hierarchical structure of SMP clusters by automatically exploiting shared-memory parallelism based on OpenMP within cluster nodes and distributed-memory parallelism utilizing MPI across nodes. We describe the implementation of these features in the VFC compiler and present experimental results which show the effectiveness of these techniques.
A hybrid learning network for shift-invariant recognition
Authors: Ruye Wang
Venue: Neural Networks (2001)

A neural network and the associated learning algorithm are presented as a generic approach for invariant recognition of visual patterns independent of their geometric attributes, such as spatial location, orientation and scale. The network is a multi-layer hierarchy with each layer composed of a set of groups of nodes. The groups of the input layer represent local areas spatially arranged in the visual field according to the geometric variations. Each node in the subsequent higher layers receives input laterally from other groups of the same layer as well as vertically from the layer below. The learning that takes place in the vertical feed forward paths between layers is based on an unsupervised hybrid algorithm combining both competitive learning and Hebbian learning. As the result of the architecture and the hybrid learning, the desired invariant recognition emerges at the output layer of the network. The network can serve as a simple and biologically plausible computational model to account for the invariant object recognition in the biological visual system. Also, as the algorithm is generic and robust, it can be applied to solve various practical recognition problems.
Wrapping web data into XML
Authors: Wei Han, David Buttler, Calton Pu
Venue: ACM SIGMOD Record (2001)

The vast majority of online information is part of the World Wide Web. In order to use this information for more than human browsing, web pages in HTML must be converted into a format meaningful to software programs. Wrappers have been a useful technique to convert HTML documents into semantically meaningful XML files. However, developing wrappers is slow and labor-intensive. Further, frequent changes on the HTML documents typically require frequent changes in the wrappers. This paper describes XWRAP Elite, a tool to automatically generate robust wrappers. XWRAP breaks down the conversion process into three steps. First, discover where the data is located in an HTML page and separating the data into individual objects. Second, decompose objects into data elements. Third, mark objects and elements in an output format. XWRAP Elite automates the first two steps and minimizes human involvement in marking output data. Our experience shows that XWRAP is able to create useful wrapper software for a wide variety of real world HTML documents.
On the Convergence of the Fourier Approximation for Eigenvalues and Eigenfunctions of Discontinuous Problems
Authors: M. S. Min, D. Gottlieb
Venue: SIAM Journal on Numerical Analysis (2002)

In this paper, we consider a model eigenvalue problem with discontinuous coefficients in order to study the convergence of the Fourier methods applied to this problem. We prove that the rate of convergence of the Fourier--Galerkin method is third order for the eigenvalues and order 2.5 for the eigenfunctions. For the Fourier collocation method we obtained only second order accuracy.We also show that the Fourier collocation method can be improved by a preprocessing of the coefficients.The theory is confirmed by numerical results.