ppxscal/embedding_network huggingface dataset:
A 3D Rectangular Mixed Finite Element Method to Solve the Stationary Semiconductor Equations
Authors: Guido E. Sartoris
Venue: SIAM Journal on Scientific Computing (1998)

A mixed finite element method using rectangular elements is presented to solve the drift-diffusion model of semiconductors. The method, which is, on the one hand, a classical primal mixed finite element method, generalizes the one-dimensional Scharfetter--Gummel scheme to three dimensions in a natural way. The major contribution to a successful implementation of the method is the development of a fast and exact numerical evaluation of exponential fitted integrals, to which considerable attention has been devoted. The essentials of the efficient computation of these integrals are described, with full details to be presented elsewhere. In order to use computer resources parsimoniously, with the help of Lagrange multipliers, admissible bases on irregular rectangular meshes are constructed which allow a local element refinement. To validate the method, the modeling of a three-dimensional magneto transistor is presented.
A human machine interface for silicon compilation
Authors: Gotaro Odawara, Masahiro Tomita, Kazuhiko Hattori, Osamu Okuzawa, Toshiaki Hirata, Masayasu Ochiai
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes a new human machine interface as a design environment for silicon compilation. It is important for a human machine interface to support a tool which realize quick Turn Around Time with few possibility of user errors. Designers should be able to work with little disturbance in thinking process. To realize such a design environment, we have developed an LCD digitizer, and it has been demonstrated that it can be a designer friendly human machine interface.
The General Product Machine: a New Model for Symbolic FSM Traversal
Authors: Giampiero Cabodi, Paolo Camurati, Fulvio Corno, Paolo Prinetto, Matteo Sonza Reorda
Venue: Formal Methods in System Design (1998)

Proving the equivalence of two Finite State Machines (FSMs) has many applications to synthesis, verification, testing, and diagnosis. Building their product machine is a theoretical framework for equivalence proof. There are some cases where product machine traversal, a necessary and sufficient check, is mandatory. This is much more complex than traversing just one of the component machines. This paper proposes an equivalence-preserving function that transforms the product machine in theGeneral Product Machine (GPM). Using the GPM in symbolic state space traversal reduces the size of the BDDs and makes image computation easier. As a result, GPM traversal is much less expensive than product machine traversal, its cost being close to dealing with a single machine.
Run-time spatial locality detection and optimization
Authors: Teresa L. Johnson, Matthew C. Merten, Wen-Mei W. Hwu
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

As the disparity between processor and main memory performance grows, the number of execution cycles spent waiting for memory accesses to complete also increases. As a result, latency hiding techniques are critical for improved application performance on future processors. We present a microarchitecture scheme which detects and adapts to varying spatial locality, dynamically adjusting the amount of data fetched on a cache miss. The Spatial Locality Detection Table, introduced in this paper, facilitates the detection of spatial locality across adjacent cached blocks. Results from detailed simulations of several integer programs show significant speedups. The improvements are due to the reduction of conflict and capacity misses by utilizing small blocks and small fetch sizes when spatial locality is absent, and the prefetching effect of large fetch sizes when spatial locality exists.
Schwarz Methods: To Symmetrize or Not to Symmetrize
Authors: Michael Holst, Stefan Vandewalle
Venue: SIAM Journal on Numerical Analysis (1997)

A preconditioning theory is presented which establishes sufficient conditions for multiplicative and additive Schwarz algorithms to yield self-adjoint positive definite preconditioners. It allows for the analysis and use of nonvariational and nonconvergent linear methods as preconditioners for conjugate gradient methods, and it is applied to domain decomposition and multigrid. It is illustrated why symmetrizing may be a bad idea for linear methods. It is conjectured that enforcing minimal symmetry achieves the best results when combined with conjugate gradient acceleration. Also, it is shown that the absence of symmetry in the linear preconditioner is advantageous when the linear method is accelerated by using the Bi-CGstab method. Numerical examples are presented for two test problems which illustrate the theory and conjectures.
Low power FPGA design&mdash;a re-engineering approach
Authors: Chau-Shen Chen, TingTing Hwang, C. L. Liu
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In this paper, technology mapping algorithmsfor minimizing power consumption in FPGA design are studied.The technology mapping problem for power minimizationhas been shown to be NP-complete.Furthermore, thereare other important objectives, such as the number of PLBs(Programmable Logic Blocks), the number of levels and soon, that should also be optimized simultaneously.We proposea transformational approach in which we start with amapping solution which optimizes certain objective(s) (e.g., the number of PLBs.)The mapping solution is then transformedto reduce the power consumption while keeping thenumber of PLBs fixed.Our algorithm explores the possibilitiesof transforming the functionality of the PLBs so thatthe switching densities of the output edges of the PLBs willbe reduced, leading to a reduction in total power consumption.Our transformational approach can also be viewed as are-engineering approach in which power reduction is achievedthrough re-routing after the PLBs have been placed, utilizingeffectively the capability of a PLB to realize any booleanfunction of up to k variables.
Analyzing the temporal association between health disorders and medical treatments using probability models and Monte Carlo simulation
Authors: Sheldon H. Jacobson, Douglas J. Morrice
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Statistical analysis is often used in medical studies to provide evidence for an association between a treatment and a patient condition. The work in this paper is motivated by a recent medical study which analyzes the temporal association between a treatment (i.e., an implant procedure) and the rare autoimmune disorders, polymyositis and dermatomyositis (PM/DM). To address this association mathematically, this paper develops a probability model based on the multinomial distribution that can be used to make statistical inferences about the timing of incidences of a treatment/condition pair. This paper details an empirical study of this model using Monte Carlo simulation. It also describes some analytical results developed in subsequent research efforts. Data from the medical study illustrate the application of this model and its results.
Managerial Use of Metrics for Object-Oriented Software: An Exploratory Analysis
Authors: Shyam R. Chidamber, David P. Darcy, Chris F. Kemerer
Venue: IEEE Transactions on Software Engineering (1998)

With the increasing use of object-oriented methods in new software development there is a growing need to both document and improve current practice in object-oriented design and development. In response to this need, a number of researchers have developed various metrics for object-oriented systems as proposed aids to the management of these systems. In this research an analysis of a set of metrics proposed by Chidamber and Kemerer [10] is performed in order to assess their usefulness for practicing managers. First, an informal introduction to the metrics is provided by way of an extended example of their managerial use. Second, exploratory analyses of empirical data relating the metrics to productivity, rework effort, and design effort on three commercial object-oriented systems are provided. The empirical results suggest that the metrics provide significant explanatory power for variations in these economic variables, over and above that provided by traditional measures, such as size in lines of code, and after controlling for the effects of individual developers.
A module area estimator for VLSI layout
Authors: Xinghao Chen, Michael L. Bushnell
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

An efficient Module Area Estimator for VLSI chip layout has been developed to reduce the number of design iterations required to develop a chip floor plan. Module area is estimated for Standard-Cell and Full-Custom layout methodologies. We discuss the structure of the estimator and its algorithms. The layout area estimates are very close to those of manually laid out modules.
CesiumSpray>: a Precise and Accurate Global Time Servicefor Large-scale Systems
Authors: Paulo Veríssimo, Luís Rodrigues, Antonio Casimiro
Venue: Real-Time Systems (1997)

In large-scale systems, such as Internet-based distributed systems, classical clock-synchronization solutions become impractical or poorly performing, due to the number of nodes and/or the distance among them. We present a global time service for world-wide systems, based on an innovative clock synchronization scheme, named CesiumSpray. The service exhibits high precision and accuracy; it is virtually indefinitely scalable; and it is fault-tolerant. It is deterministic for real-time machinery in the local area, which makes it particularly well-suited for, though not limited to, large-scale real-time systems. The main features of our clock synchronization scheme can be summarized as follows: hybrid external/internal synchronization protocol improves effectiveness of synchronization; heterogeneous failure semantics for clocks and processors improves previous lower bounds on processors; two-level hierarchy improves scalability. The root of the hierarchy is the GPS satellite constellation, which &rsquo;&rsquo;sprays&lsquo;&lsquo; its reference time over a set of nodes provided with GPS receivers, one per local network. The second level of the hierarchy performs internal synchronization, further &rsquo;&rsquo;spraying&lsquo;&lsquo; the external time inside the local network.
Real-time APL prototype of a GPS system
Authors: Henry M. Beisner, Jack G. Rudd, Robert H. Benner
Venue: ACM SIGAPL APL Quote Quad (1996)

The Global Positioning System (GPS) consists of a constellation of 24 high-altitude satellites with very accurate atomic clocks, along with a global network of satellite tracking stations and sophisticated ground processing stations, that together provide precise navigation coordinates to any user who possesses a small, readily available GPS receiver.The precision that is achieved depends on[1] the number of GPS satellites in view of the user and the geometries involved;[2] the design of the user's receiver (e.g., military or civilian);[3] the presence of nearby objects that may interfere with or degrade the reception of signals from one or more satellites;[4] and other factors.In most cases civilian users (whose receivers can read only unencrypted, intentionally corrupted GPS signals) can expect navigation accuracy on the order of 50-100 meters. The advertised accuracy for users with military receivers, which read the encrypted GPS signals, is 16 meters. Coalition forces in Desert Shield / Desert Storm relied heavily on GPS, and U.S. military authorities praised GPS effusively for its effectiveness as a force multiplier in that conflict.Loral Federal Systems (formerly IBM Federal Systems Division) in Gaithersburg, Maryland has been intimately involved with GPS from its concept validation phase through operations and maintenance. People in this group analyzed the physical dynamics, designed the mathematical algorithms and associated software, and performed the system integration work that culminated in the GPS ground control segment.APL was used over the years in most major aspects of GPS design and analysis. Early in the full-scale development phase, APL was used to model the initial GPS system design, to perform design tradeoffs, to model and test candidate algorithms, and to perform error analyses to estimate future system performance. In later phases APL was used to monitor and analyze actual GPS system performance, to compare it with theoretically achievable performance, and to analyze and isolate anomalies [Allan].
An Operational Calculus for Matrix-Exponential Distributions, with Applications to a Brownian (Q, Q) Inventory Model
Authors: Soqren Asmussen, David Perry
Venue: Mathematics of Operations Research (1998)

A distribution G on [math not displayed] is called matrix-exponential if the density has the form &#945;eTz s where &#945; is a row vector, T a square matrix and s a column vector. Equivalently, the Laplace transform is rational. For such distributions, we develop an operator calculus, where the key step is manipulation of analytic functions f(z) extended to matrix arguments. The technique is illustrated via an inventory model moving according to a reflected Brownian motion with negative drift, such that an order of size Q is placed when the stock process down-crosses some level q. Explicit formulas for the stationary density are found under the assumption that the leadtime Z has a matrix-exponential distribution, and involve expressions of the form f(T) where [math not displayed].
An intermediate design language and its analysis
Authors: Daniel Jackson
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

A simple relational language is presented that has two desirable properties. First, it is sufficiently expressive to encode, fairly naturally, a variety of software design problems. Second, it is amenable to fully automatic analysis. This paper explains the language and its semantics, and describes a new analysis scheme (based on a stochastic boolean solver) that dramatically outperforms existing schemes.
Following Cusps
Authors: Roberto Cipolla, Gordon Fletcher, Peter Giblin
Venue: International Journal of Computer Vision (1997)

It is known that the deformation of the apparent contours of a surface under perspective projection and viewer motion enable the recovery of the geometry of the surface, for example by utilising the epipolar parametrization. These methods break down with apparent contours that are singular i.e., with cusps . In this paper we study this situation and show how, nevertheless, the surface geometry (including the Gauss curvature and mean curvature of the surface) can be recovered by following the cusps. Indeed the formulae are much simpler in this case and require lower spatio-temporal derivatives than in the general case of nonsingular apparent contours. We also show that following cusps does not by itself provide us with information on viewer motion.
A structural representation for VLSI design
Authors: Richard Barth, Bertrand Serlet
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents a data structure for representing the structure of VLSI circuits and basic operations for manipulating this data structure. Its features include conceptual integrity, rich expressive power, and high extensibility. It forms the nucleus of a design analysis and synthesis system which has been used to design several major chips.
Optical Font Recognition Using Typographical Features
Authors: Abdelwahab Zramdini, Rolf Ingold
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

A new statistical approach based on global typographical features is proposed to the widely neglected problem of font recognition. It aims at the identification of the typeface, weight, slope and size of the text from an image block without any knowledge of the content of that text. The recognition is based on a multivariate Bayesian classifier and operates on a given set of known fonts. The effectiveness of the adopted approach has been experimented on a set of 280 fonts. Font recognition accuracies of about 97 percent were reached on high-quality images. In addition, rates higher than 99.9 percent were obtained for weight and slope detection. Experiments have also shown the system robustness to document language and text content and its sensitivity to text length.
The object-ownership model: a case study for inheritance and operator overloading
Authors: Adair Dingle
Venue: ACM SIGCSE Bulletin (1997)

Any comprehensive course on object-oriented programming must cover the topics of inheritance and overloading. In addition, in view of the relatively large size of some objects, one should also cover the efficiency of parameter passing techniques. By using recent research results, we motivate and present an effective case study that thoroughly examines the concepts and subtleties of each of these topics.
An active service framework and its application to real-time multimedia transcoding
Authors: Elan Amir, Steven McCanne, Randy Katz
Venue: ACM SIGCOMM Computer Communication Review (1998)

Several recent proposals for an "active networks" architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range of new applications and protocols, including reliable multicast transports, mechanisms to foil denial of service attacks, intra-network real-time signal transcoding, and so forth. This laudable goal, however, creates a number of very difficult research problems, and although a number of pioneering research efforts in active networks have solved some of the preliminary small-scale problems, a large number of wide open problems remain. In this paper, we propose an alternative to active networks that addresses a restricted and more tractable subset of the active-networks design space. Our approach, which we (and others) call "active services", advocates the placement of user-defined computation within the network as with active networks, but unlike active networks preserves all of the routing and forwarding semantics of current Internet architecture by restricting the computation environment to the application layer. Because active services do not require changes to the Internet architecture, they can be deployed incrementally in today's Internet.We believe that many of the applications and protocols targeted by the active networks initiative can be solved with active services and, toward this end, we propose herein a specific architecture for an active service and develop one such service in detail --- the Media Gateway (MeGa) service --- that exploits this architecture. In defining our active service, we encountered six key problems --- service location, service control, service management, service attachment, service composition, and the definition of the service environment --- and have crafted solutions for these problems in the context of the MeGa service. To verify our design, we implemented and fielded MeGa on the UC Berkeley campus, where it has been used regularly for several months by real users who connect via ISDN to an "on-line classroom". Our initial experience indicates that our active services prototype provides a very flexible and programmable platform for intra-network computation that strikes a good balance between the flexibility of the active networks architecture and the practical constraints of incremental deployment in the current Internet.
Strategic directions in computer science education (panel)
Authors: Peter Wegner, Eric Roberts, Roy Rada, Allen B. Tucker
Venue: ACM SIGCSE Bulletin (1997)

This panel will discuss major issues and challenges in computer science education across a wide range of institutions. It originates from a report developed by the Education Working Group of the Strategic Directions in Computing Research (SDCR) Workshop. That report appears in its entirety in the ACM Computing Surveys issue [Wegner96] which is distributed to all attendees to this SIGCSE 97 conference.) In this panel, we will discuss the general aims and accomplishments of the SDCR conference, highlighting the specific recommendations of the Education Working Group. We will outline ideas for improving the quality and effectiveness of computer science programs at the undergraduate, graduate, and K-12 levels. We will also argue for the creation of a Resource Center for developing and distributing computer science and engineering curricular materials, including the idea of developing a "Virtual Computing University."
Parallel Mesh Algorithms for Grid Graph Shortest Paths with Application to Separation of Touching Chromosomes
Authors: Hongchi Shi, Paul Gader, Hongzheng Li
Venue: The Journal of Supercomputing (1998)

The grid graph shortest path problem has many applications. In this paper, we present practical mesh algorithms using a local cost-reducing operation for various forms of the grid graph shortest path problem. The algorithms are very simple and can easily mark the vertices on shortest paths between any two vertices. The time complexity of the algorithm is proportional to the maximum length of the shortest paths with a very small multiplicative constant. Also in this paper, we discuss the application of the parallel algorithms in automatic chromosome analysis to intelligently split touching chromosomes. We identify local features useful for finding a potential path to separate touching chromosomes. We then define a distance measure based on the local features and find the best splitting path to cut touching chromosomes. The splitting algorithm only uses local information and is highly parallel.
A comparison of data prefetching on an access decoupled and superscalar machine
Authors: G. P. Jones, N. P. Topham
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

In this paper we investigate the behavior of data prefetching on an access decoupled machine and a superscalar machine. We assess if there are benefits to using the decoupling paradigm given that an out-of-order (o-o-o) superscalar architecture could in principle prefetch to the same degree as an access decoupled machine. We have found that for large issue width the access decoupled machine can hide memory latency more effectively than a single instruction window o-o-o superscalar architecture. Our findings also demonstrate that an access decoupled machine offers the benefit of reducing the complexity of window issue logic.
Primitivity of Positive Matrix Pairs: Algebraic Characterization, Graph Theoretic Description, and 2D Systems Interpretation
Authors: Ettore Fornasini, Maria Elena Valcher
Venue: SIAM Journal on Matrix Analysis and Applications (1998)

In this paper the primitivity of a positive matrix pair (A,B) is introduced as a strict positivity constraint on the asymptotic behavior of the associated two-dimensional (2D) state model. The state evolution is first considered under the assumption of periodic initial conditions. In this case the system evolves according to a one-dimensional (1D) state updating equation, described by a block circulant matrix. Strict positivity of the asymptotic dynamics is equivalent to the primitivity of the circulant matrix, a property that can be restated as a set of conditions on the spectra of $A + e^{i \omega} B$, for suitable real values of $\omega$. The theory developed in this context provides a foundation whose analytical ideas may be generalized to nonperiodic initial conditions. To this purpose the spectral radius and the maximal modulus eigenvalues of the matrices $e^{i \theta} A + e^{i \omega} B$, $\theta$ and $\omega \in \hbox{{\bbb R}},$ are related to the characteristic polynomial of the pair (A,B) as well as to the structure of the graphs associated with A and B and to the factorization properties of suitable integer matrices. A general description of primitive positive matrix pairs is finally derived, including both spectral and combinatorial conditions on the pair.