ppxscal/embedding_network huggingface dataset:
Hurwitz stable reduced order modeling for RLC interconnect trees
Authors: Xiaodong Yang, Chung Kuan Cheng, Walter H. Ku, Robert J. Carragher
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We present a new relizable reduced order modeling technique for RLC interconnect trees. Both lumped and distributed wire models can be used with this technique. Provable stability is achieved by using Hurwitz polynomials. Moment computation process is avoided but moments can still be matched implicitly. In experiments, the proposed Hurwitz three-pole model can accurately and efficiently capture inductive effect for both near end and far end nodes.
A Family of Efficient Regular Arrays for Algebraic Path Problem
Authors: Pen-Yuang Chang, Jong-Chuang Tsay
Venue: IEEE Transactions on Computers (1994)

The method of decomposing a dependence graph into multiple phases with an appropriate m-phase schedule function is useful for designing faster regular arrays for matrix multiplication and transitive closure. In this paper, we further apply this method to design several parallel algorithms for the algebraic path problem and derive N/spl times/N 2D regular arrays with execution times [9N/2]-2 (for the cylindrical array and the orthogonal one) and 4N-2 (for the spherical one).
The Application of Semantic Classification Trees to Natural Language Understanding
Authors: Roland Kuhn, Renato De Mori
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This article describes a new method for building a natural language understanding (NLU) system, in which the system¿s rules are learnt automatically from training data. The method has been applied to design of a speech understanding (SU) system. Designers of such systems rely increasingly on robust matchers to perform the task of extracting meaning from one or several word sequence hypotheses generated by a speech recognizer; a robust matcher processes semantically important islands of words and constituents rather than attempting to parse the entire word sequence. We describe a new data structure, the Semantic Classification Tree (SCT), that learns semantic rules from training data and can be a building block for robust matchers for NLU tasks. By reducing the need for handcoding and debugging a large number of rules, this approach facilitates rapid construction of an NLU system. In the case of an SU system, the rules learned by an SCT are highly resistant to errors by the speaker or by the speech recognizer because they depend on a small number of words in each utterance. Our work shows that semantic rules can be learned automatically from training data, yielding successful NLU for a realistic application.
Coupling Fluid Flow with Porous Media Flow
Authors: William J. Layton, Friedhelm Schieweck, Ivan Yotov
Venue: SIAM Journal on Numerical Analysis (2002)

The transport of substances back and forth between surface water and groundwater is a very serious problem. We study herein the mathematical model of this setting consisting of the Stokes equations in the fluid region coupled with the Darcy equations in the porous medium, coupled across the interface by the Beavers--Joseph--Saffman conditions. We prove existence of weak solutions and give a complete analysis of a finite element scheme which allows a simulation of the coupled problem to be uncoupled into steps involving porous media and fluid flow subproblems. This is important because there are many "legacy" codes available which have been optimized for uncoupled porous media and fluid flow.
Lessons Learned in Managing Object-Oriented Development
Authors: Matthew Pittman
Venue: IEEE Software (1993)

The author relates experience gained in developing tightly constrained, custom object-oriented systems, in which success depends on delivering a functional system on time and on budget, often for a fixed price. Many of the systems developed had the additional constraint of real-time requirements, and most had some kind of reuse goals. The organization, planning, and progress tracking of an object-oriented project are discussed. The management model and resources used in such a project are described.
A Framework for Reinforcement-Based Scheduling in Parallel Processor Systems
Authors: Albert Y. Zomaya, Matthew Clements, Stephan Olariu
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

Task scheduling is important for the proper functioning of parallel processor systems. The static scheduling of tasks onto networks of parallel processors is well-defined and documented in the literature. However, in many practical situations a priori information about the tasks that need to be scheduled is not available. In such situations, tasks usually arrive dynamically and the scheduling should be performed on-line or "on the fly." In this paper, we present a framework based on stochastic reinforcement learning, which is usually used to solve optimization problems in a simple and efficient way. The use of reinforcement learning reduces the dynamic scheduling problem to that of learning a stochastic approximation of an unknown average error surface. The main advantage of the proposed approach is that no prior information is required about the parallel processor system under consideration. The learning system develops an association between the best action (schedule) and the current state of the environment (parallel system). The performance of reinforcement learning is demonstrated by solving several dynamic scheduling problems. The conditions under which reinforcement learning can used to efficiently solve the dynamic scheduling problem are highlighted.
Bilattices and Reasoning in ArtificialIntelligence: Concepts and Foundations
Authors: Kwang Mong Sim
Venue: Artificial Intelligence Review (2001)

The past few decades have seen a resurgence of reasoning techniques in artificial intelligence involving both classical and non-classical logics. In his paper, ``Multi-valued Logics: A Uniform Approach to Reasoning in Artificial Intelligence'', Ginsberg has shown that through the use of bilattices, several reasoning techniques can be unified under a single framework. A bilattice is a structure that can be viewed as a class of truth values that can accommodate incomplete and inconsistent information and in certain cases default information. In bilattice theory, knowledge is ordered along two dimensions: truth/falsity and certainty/uncertainty. By defining the corresponding bilattices as truth spaces, Ginsberg has shown that the same theorem prover can be used to simulate reasoning in first order logic, default logic, prioritized default logic and assumption truth maintenance system. Although this is a significant contribution, Ginsberg's paper was lengthy and involved. This paper summarizes some of the essential concepts and foundations of bilattice theory. Furthermore, it discusses the connections of bilattice theory and several other existing multi-valued logics such as the various three-valued logics and Belnap's four-valued logic. It is noted that the set of four truth values in Belnap's logic form a lattice structure that is isomorphic to the simplest bilattice. Subsequently, Fitting proposed a conflation operation that can be used to select sub-sets of truth values from this and other bilattices. This method of selecting sub-sets of truth values provides a means for identifying sub-logic in a bilattice.
Partitioned Encoding Schemes for Algorithm-Based Fault Tolerance in Massively Parallel Systems
Authors: J. Rexford, N. K. Jha
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Considers the applicability of algorithm based fault tolerance (ABET) to massively parallel scientific computation. Existing ABET schemes can provide effective fault tolerance at a low cost For computation on matrices of moderate size; however, the methods do not scale well to floating-point operations on large systems. This short note proposes the use of a partitioned linear encoding scheme to provide scalability. Matrix algorithms employing this scheme are presented and compared to current ABET schemes. It is shown that the partitioned scheme provides scalable linear codes with improved numerical properties with only a small increase in hardware and time overhead.
Engineering a Device for Electron-Beam Probing
Authors: William T. Lee
Venue: IEEE Design Test (1989)

The principles of electron-beam probing for diagnostic work are described. Guidelines are presented to help users of electron-beam probe stations optimize their IC design and manufacturing procedures for electron-beam probing. The guidelines cover: observability, maintaining line of sight, direct versus indirect measuring, using test points, accuracy, improving signal-to-noise ratio, reducing crosstalk, maintaining a consistent environment, usability, reducing acquisition time, packaging, and linking with CAD/CAE databases.
Direct surface extraction from 3D freehand ultrasound images
Authors: Youwei Zhang, Robert Rohling, Dinesh K. Pai
Venue: Proceedings of the conference on Visualization '02 (2002)

This paper presents a new technique for the extraction of surfaces from 3D ultrasound data. Surface extraction from ultrasound data is challenging for a number of reasons including noise and artifacts in the images and non-uniform data sampling. A method is proposed to fit an approximating radial basis function to the group of data samples. An explicit surface is then obtained by iso-surfacing the function. In most previous 3D ultrasound research, a pre-processing step is taken to interpolate the data into a regular voxel array and a corresponding loss of resolution. We are the first to represent the set of semi-structured ultrasound pixel data as a single function. From this we were able to extract surfaces without first reconstructing the irregularly spaced pixels into a regular 3D voxel array.
Expert Design of Local Area Networks
Authors: Stefano Ceri, Letizia Tanca
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The Expert LAN Designer (ELAND) is described. It is a rule-based expert system for configuring distributed information systems operating on a LAN. A general overview of the system and the motivations for major design choices is presented, and the modules comprising ELAND's inference engine are explained. An example session with ELAND is provided.
Greylevel difference classification algorithm in fractal image compression
Authors: Chen Yisong, Lu Jian, Sun Zhengxing, Zhang Fuyan
Venue: Journal of Computer Science and Technology (2002)

This paper proposes the notion of a greylevel difference classification algorithm in fractal image compression. Then an example of the greylevel difference classification algorithm is given as an improvement of the quadrant greylevel and variance classification in the quadtree-based encoding algorithm. The algorithm incorporates the frequency feature in spatial analysis using the notion of average quadrant greylevel difference, leading to an enhancement in terms of encoding time, PSNR value and compression ratio.
Building a community
Venue: IEEE Design Test (2002)

IEEE Design & Test is more than just a magazine. It represents a community a community of communities, really with technical interests in microelectronics design, design automation, and test. Once a year, these communities find a meeting ground: the Design automation Conference (DAC) for the design and design automation communities, and the International Test Conference (ITC) for the test community. This issue and the following one showcase our relationships with the DAC and ITC forums.
Networking Home Entertainment Devices with HAVi
Authors: Rodger Lea, Simon Gibbs, Alec Dara-Abrams, Edward Eytchison
Venue: Computer (2000)

Networking home entertainment devices such as digital television receivers facilitate resource sharing and information exchange so that new applications can coordinate the control of several devices simultaneously. The increasing connectivity of home audiovideo devices requires interoperability so that products from different vendors can comply with well defined connection and communication protocols. The home audio/video in teroperability (HAVi) architecture is a set of application programming interfaces (APIs), services, and an on the wire protocol specified by an industry initiative. HAVi facilitates multivendor interoperability between consumer electronics devices and computing devices, and simplifies the development of distributed applications on home networks. The HAVi architecture, discussed and explained in this article, also facilitates the innovation and introduction of new features or refinements. A key feature is thateach physical device has an associated software proxy. Adding new proxies to a home system makes new features or devices accessible even to applications running on older devices.
Postponing the Choice of Penalty Parameter and Step Length
Authors: Fernando R. Villas-Bôas, Clovis Perin
Venue: Computational Optimization and Applications (2003)

We study, in the context of interior-point methods for linear programming, some possible advantages of postponing the choice of the penalty parameter and the steplength, which happens both when we apply Newton's method to the Karush-Kuhn-Tucker system and when we apply a predictor-corrector scheme. We show that for a Newton or a strictly predictor step the next iterate can be expressed as a linear function of the penalty parameter &mu;, and, in the case of a predictor-corrector step, as a quadratic function of &mu;. We also show that this parameterization is useful to guarantee either the non-negativity of the next iterate or the proximity to the central path. Initial computational results of these strategies are shown and compared with PCx, an implementation of Mehotra's predictor-corrector method.
Tabu Machine: A New Neural Network Solution Approach for Combinatorial Optimization Problems
Authors: Minghe Sun, Hamid R. Nemati
Venue: Journal of Heuristics (2003)

A new artificial neural network solution approach is proposed to solve combinatorial optimization problems. The artificial neural network is called the Tabu Machine because it has the same structure as the Boltzmann Machine does but uses tabu search to govern its state transition mechanism. Similar to the Boltzmann Machine, the Tabu Machine consists of a set of binary state nodes connected with bidirectional arcs. Ruled by the transition mechanism, the nodes adjust their states in order to search for a global minimum energy state. Two combinatorial optimization problems, the maximum cut problem and the independent set problem, are used as examples to conduct a computational experiment. Without using overly sophisticated tabu search techniques, the Tabu Machine outperforms the Boltzmann Machine in terms of both solution quality and computation time.
Simple Radix-4 Division with Operands Scaling
Authors: M. D. Ercegovac, T. Lang
Venue: IEEE Transactions on Computers (1990)

A radix-4 division algorithm with operands scaling is proposed. The algorithm uses a recurrence with redundant addition (carry-save or signed-digit) and combines simple scaling with a quotient-selection function that depends only on the estimate of the partial remainder and is independent of the divisor. The scheme results in a significant speedup with respect to both the radix-2 and radix-4 without scaling.
Bounds for the Vanishing Order for Solutions of a Linear Differential System
Authors: C. Moura
Venue: Journal of Dynamical and Control Systems (2003)

We provide upper bounds for the order of vanishing of a polynomial restricted to a solution of a linear differential system through a nonsingular point. We deduce an estimate on the maximum order of inflection of the trajectories of a linear nonautonomous vector field.
Integration, Inference, and Management of Spatial Information Using Bayesian Networks: Perceptual Organization
Authors: S. Sarkar, K. L. Boyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The formalism of Bayesian networks provides a very elegant solution, in a probabilistic framework, to the problem of integrating top-down and bottom-up visual processes, as well serving as a knowledge base. The formalism is modified to handle spatial data, and thus the application of Bayesian networks is extended to visual processing. The modified form is called the perceptual inference network (PIN). The theoretical background of a PIN is presented, and its viability is demonstrated in the context of perceptual organization. Perceptual organization imparts robustness, efficiency, and a qualitative and holistic nature to vision. Thus far, the approaches to the problem of perceptual organization have been purely bottom up, without much top-down knowledge-base influence, and are therefore entirely dependent on the inputs, which are obviously imperfect. The knowledge base, besides coping with such input imperfection, also makes it possible to integrate multiple organizations and form a composite organization hypothesis. The PIN imparts an active inferential and integrating nature to perceptual organization in an elegant probabilistic framework.
Stresses in thin films and interconnect lines
Authors: P. Gudmundson, A. Wikström
Venue: Microelectronic Engineering (2002)

The mechanical behavior of thin films and interconnect lines is investigated. Firstly, theoretical models of thermal stress evolution in thin films and passivated or unpassivated lines are considered. Secondly, the effect of texture in a copper thin film with a columnar grain structure is studied from a theoretical point of view. The film consists of three different constituents with (111), (100) and randomly oriented texture. Global properties as well as local stress distributions are considered in detail within a thermoelastic framework. The results are in qualitative agreement with available experimental results. Implications with regards to plastic behavior are briefly discussed. Finally, the potential of the curvature measurement technique for experimental stress evaluation in thin films is considered for initially flat and curved substrate/film systems.
Geometric Properties of the Union of Maximal Neighborhoods
Authors: L. P. Cordella, G. Sanniti di Baja
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

The problem of computing area and perimeter of a digital figure presented by its discrete medial axis transform (MAT) is addressed. The figure is seen as the union of the square-shaped maximal neighborhoods centered on the local maxima of the MAT. The contribution given by each maximal neighborhood to figure area and perimeter is computed while tracing the MAT. Multiple overlaps among the maximal neighborhoods are possible. However, due to the properties of the local maxima and their associated maximal neighborhoods a single tracing of the MAT is provided to be sufficient to obtain the desired result. Thus, the procedure requires O(N) time, where N is the number of MAT pixels.
An approach to a theory of software evolution
Authors: M. M. Lehman, J. F. Ramil
Venue: Proceedings of the 4th International Workshop on Principles of Software Evolution (2001)

This paper outlines plans for the proposed development of a theory of software evolution. Apart from its intrinsic value, such a theory will advance understanding of the attributes of the software evolution phenomenon, its drivers and its practical impact on the software process and its products. If achieved, such a theory will provide means to identify and justify best practice in a world increasingly dependent on computers, where continuous software process improvement is of major, universal concern.
Effect of carrier-induced hall current on magneto-optical spectra of carbon nanotubes
Authors: Hiroshi Ajiki
Venue: Microelectronic Engineering (2002)

Absorption spectra of a single-wall carbon nanotube in a magnetic field perpendicular to the tube axis are calculated for parallel polarized light. Hall current is induced by carrier doping and it strongly reduces the lowest spectral peak.
Spin Models of Index 2 and Hadamard Models
Authors: Kazumasa Nomura
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

A spin model (for link invariants) is a square matrix W with non-zero complex entries which satisfies certain axioms. Recently it was shown that tWW&minus;1 is a permutation matrix (the order of this permutation matrix is called the &ldquo;index&rdquo; of W), and a general form was given for spin models of index 2. Moreover, new spin models, called non-symmetric Hadamard models, were constructed. In the present paper, we classify certain spin models of index 2, including non-symmetric Hadamard models.
Complete Decomposition of Stochastic Petri Nets Representing Generalized Service Networks
Authors: C. Murray Woodside, Yao Li
Venue: IEEE Transactions on Computers (1995)

Complete decomposition is a new strategy for evaluating the performance of a network of generalized service centers, represented in the notation of Generalized Stochastic Petri Nets (GSPNs). Each service center can have arbitrary internal structure (including internal parallelism), but it must conserve tokens at the boundaries, and its inputs must be i/o-connected to its outputs. Routing between centers can depend on the state of the departure center. The new method adapts a delay equivalence decomposition technique used previously. Within this framework, it reduces the solution complexity of the auxiliary models which must be solved in the iteration. This new method is applied to a scalable model for computer system performance.
A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems
Authors: Ken Barker, Subhrajyoti Bhar
Venue: Distributed and Parallel Databases (2001)

This paper contributes by providing an allocation taxonomy to analyze DOBS models and identify the primary characteristics of a DOBS allocation. A graphical optimization technique, based on the work by Kernighan and Lin (The Bell System, Technical Journal, pp. 291&ndash;307, 1970), is basis of our approach. The algorithm attempts to arrive at a &ldquo;near optimal&rdquo; distribution of fragments by exchanging and/or moving fragments between every pair of sites. The algorithms are implemented and are tested with carefully generated test data to obtain an analysis of the performance. The design, implementation and analysis of the allocation algorithms form the most significant contribution of this paper. Several significant insights are derived from the analysis of the results obtained that can be usefully applied to any real life DOBS allocation design. The applicability of the allocation algorithms for the DOBS model of interest may be verified by a cost benefit analysis based on their efficiency. The optimization of the initial allocation is meaningful only if the improvement obtained by optimization justifies the additional overhead. If significant improvement is not obtainable by optimization then our efficient initial allocation scheme alone may serve the purpose.
Apple Macintosh's Energy Consumption
Authors: Jacob R. Lorch, Alan Jay Smith
Venue: IEEE Micro (1998)

The utility of a portable computer is critically dependent on the period it can be used while running off the battery. In this article, we present a study of power consumption in Apple Macintosh computers. We measure the existing power consumption for each system component using built-in measuring tools. Since total power consumption is a function of user workload, we use eight user workload traces to determine power use as observed in practice. Apple currently implements some simple power-saving features, and the effectiveness of those features is estimated; we find typical power savings of 41-66%. After the use of basic power-saving techniques, we find that the major power users are the backlight (25-26%), the CPU (9-25%), the display (4-17%), the video circuitry (6-10%), and the hard drive (4-9%). We then evaluate possible changes in system hardware and software with regard to the power savings they might offer.