ppxscal/embedding_network huggingface dataset:
Jordan Normal Form via Elementary Transformations
Authors: A. Bujosa, R. Criado, C. Vega
Venue: SIAM Review (1998)

This paper presents a method based on elementary transformations which may be applied to a matrix A, whose characteristic polynomial has been decomposed into linear factors, in order to obtain a nonsingular matrix P such that $P-1 AP is in Jordan normal form. This method can be used in the classroom, among other problems, to directly solve a linear ODE with constant coefficients. We also present a symbolic Maple program implementing the method.
Throughput optimization of general non-linear computations
Authors: Inki Hong, Miodrag Potkonjak, Lisa M. Guerra
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper addresses an optimal technique for throughput optimization of general non-linear data flow computations using a set of transformations. Throughput is widely recognized as the most important design metric of the modern DSP and communication applications. Numerous approaches have been proposed for throughput optimization, but most was restricted to limited classes of computations. They have limited effectiveness when applied to large complex non-linear DSP and communication computations. The new technique is used as an optimization engine in a divide-and-conquer global approach for throughput optimization. We demonstrate the effectiveness of the new technique on numerous real-life non-linear designs.
Optimizing cell-size in grid-based DDM
Authors: Rassul Ayani, Farshad Moradi, Gary Tan
Venue: Proceedings of the fourteenth workshop on Parallel and distributed simulation (2000)

In a large-scale distributed simulation with thousands of dynamic objects, efficient communication of data among these objects is an important issue. The broadcasting mechanism specified by the Distributed Interactive Simulation (DIS) standards is not suitable for large scale distributed simulations. In the High Level Architecture (HLA) paradigm, the Runtime Infrastructure (RTI) provides a set of services, such as data distribution management (DDM) among federates. The goal of the DDM module in RTI is to make the data communication more efficient by sending the data only to those federates that need the data, as opposed to the broadcasting mechanism employed by DIS. Several DDM schemes have appeared in the literature. In this paper, we discuss grid-based DDM and develop a DDM model that uses grids for matching the publishing/subscription regions, and for data filtering. We show that appropriate choice of the grid-cell size is crucial in obtaining good performance. We develop an analytical model and derive a formula for identifying the optimal cell size in grid-based DDM.
Transparent adaptive parallelism on NOWs using OpenMP
Authors: Alex Scherer, Honghui Lu, Thomas Gross, Willy Zwaenepoel
Venue: ACM SIGPLAN Notices (1999)

We present a system that allows OpenMP programs to execute on a network of workstations with a variable number of nodes. The ability to adapt to a variable number of nodes allows a program to take advantage of additional nodes that become available after it starts execution, or to gracefully scale down when the number of available nodes is reduced. We demonstrate that the cost of adaptation is modest; the system allows a program to adapt at a moderate rate without much performance loss.Two ideas underlie the efficiency of our design. First, we recognize that OpenMP programs exhibit convenient adaptation points during their execution, points at which the cost of adaptation can be much reduced. Second, by allowing a process a certain grace period before it must leave a node, we insure that most adaptations can occur at these adaptation points, and thus at low cost. Migration of a process, a much more expensive method for providing adaptivity, is used only as a back-up solution, when the process cannot reach an adaptation point within the grace period.Our implementation consists of an OpenMP pre-processor that generates TreadMarks distributed shared memory (DSM) programs, and a version of TreadMarks modified to adapt to a variable number of nodes. Using a DSM as the underlying substrate facilitates the data (re-)distribution necessary after an adaptation.
Paging area optimization based on interval estimation in wireless personal communication networks
Authors: Zhuyu Lei, Cem U. Saraydar, Narayan B. Mandayam
Venue: Mobile Networks and Applications (2000)

We consider an optimum personal paging area configuration problem to improve the paging efficiency in PCS/cellular mobile networks. The approach is to set up the boundaries of a one-step paging area that contain the locations of a mobile user with a high probability and to adjust the boundaries to gain a coverage that is matched to the mobile user's time-varying mobility pattern. We formulate the problem as an interval estimation problem. The objective is to reduce the paging signaling cost by minimizing the size of the paging area constrained to certain confidence measure (probability of locating the user), based on a finite number of available location observations of the mobile user. Modeling user mobility as a Brownian motion with the drift stochastic process and by estimating the parameters of the location probability distribution of the mobility process, the effects of the mobility characteristics and the system design parameters on the optimum paging area are investigated. Results show: (1) the optimum paging area expands with the time elapsed after the last known location of the user; (2) it also increases with the length of a prediction interval and the location probability; (3) the relative change in the paging area size decreases with the increase in the number of location observations.
Practical considerations of clock-powered logic
Authors: William Athas
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

Recovering and reusing circuit energies that would otherwise be dissipated as heat can reduce the power dissipated by a VLSI chip. To accomplish this requires a power source that can efficiently inject and extract energy, and an efficient power delivery system to connect the power source to the circuit nodes. The additional circuitry and timing required to support this process can readily exceed the power-savings benefit. Clock-powered logic is a circuit-level, energy-recovery approach that has been implemented in two generations of small-scale microprocessor experiments. The results have shown that it is possible and practical to extract useful amounts of power savings by leveraging the additional circuitry for other compatible purposes. The capabilities and limitations of clock-powered logic as a competitive low-power approach are presented and discussed in this paper.
Code compression as a variable in hardware/software co-design
Authors: Haris Lekatsas, Jörg Henkel, Wayne Wolf
Venue: Proceedings of the eighth international workshop on Hardware/software codesign (2000)

We present a new way to practice and view handware/software co-design: rather than raising the level of abstraction in order to exploit the highest possible degree of optimization, we use code compression i.e. we practice co-design at the bit-level. Through our novel architecture combined with our compression methodology this results in optimization of all major design goals/constraints. In particular, we present a compression methodology that deploys what we call a &ldquo;post-cache architecture&rdquo; (i.e. the detached decompression unit is located between the CPU and the instruction cache). We present a design methodology that allows the designer to control parameters like speed, power, and area through the choice of compression parameters. In addition we show that our compression methodology (using a Markov Model) is more efficient than the widely used Huffman compression scheme.
New technologies for rapid development of Web orientated database applications
Authors: Nick Hatzigeorgiu, Apostolos Syropoulos
Venue: ACM SIGCUE Outlook (1999)

Many new Internet technologies are available to Web programmers. Using these technologies it is now easy to develop dynamic Web based applications that use databases. We describe some of these new technologies and we briefly present two examples showing how we can use these technologies in real world applications.
Efficient manipulation algorithms for linearly transformed BDDs
Authors: Wolfgang Günther, Rolf Drechsler
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Binary Decision Diagrams (BDDs) are the state-of-the-art data structure in VLSI CAD. But due to their ordering restriction only exponential sized BDDs exist for many functions of practical relevance. Linear Transformations (LTs) have been proposed as a new concept to minimize the size of BDDs and it is known that in some cases even an exponential reduction can be obtained.In addition to a small representation, the efficient manipulation of a data structure is also important. In this paper we present polynomial time manipulation algorithms that can be used for Linearly Transformed BDDs (LT-BDDs) analogously to BDDs. For some operations, like synthesis algorithms based on ITE, it turns out that the techniques known from BDDs can be directly transferred, while for other operations, like quantification and cofactor computation, completely different algorithms have to be used. Experimental results are given to show the efficiency of the approach.
Formal specification and verification of a dataflow processor array
Authors: Thomas A. Henzinger, Xiaojun Liu, Shaz Qadeer, Sriram K. Rajamani
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We describe the formal specification and verification of the VGI parallel DSP chip [1], which contains 64 compute processors with ~30K gates in each processor. Our effort coincided in time with the &ldquo;informal&rdquo; verification stage of the chip. By interacting with the designers, we produced an abstract but executable specification of the design which embodies the programmer's view of the system. Given the size of the design, an automatic check that even one of the 64 processors satisfies its specification is well beyond the scope of current verification tools. However, the check can be decomposed using assume-guarantee reasoning. For VGI, the implementation and specification operate at different time scales: several steps of the implementation correspond to a single step in the specification. We generalized both the assume-guarantee method and our model checker MOCHA to allow compositional verification for such applications. We used our proof rule to decompose the verification problem of the VGI chip into smaller proof obligations that were discharged automatically by MOCHA. Using our formal approach, we uncovered and fixed subtle bugs that were unknown to the designers.
The impact of fluid documents on reading and browsing: an observational study
Authors: Polle T. Zellweger, Susan Harkness Regli, Jock D. Mackinlay, Bay-Wei Chang
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Fluid Documents incorporate additional information into a page by adjusting typography using interactive animation. One application is to support hypertext browsing by providing glosses for link anchors. This paper describes an observational study of the impact of Fluid Documents on reading and browsing. The study involved six conditions that differ along several dimensions, including the degree of typographic adjustment and the distance glosses are placed from anchors. Six subjects read and answered questions about two hypertext corpora while being monitored by an eyetracker. The eyetracking data revealed no substantial differenccs in eye behavior between conditions. Gloss placement was significant: subjects required less time to use nearby glosses. Finally, the reaction to the conditions was highly varied, with several conditions receiving both a best and worst rating on the subjective questionnaires. These results suggest implications for the design of dynamic reading environments.
Learning Perl/Tk
Authors: Nancy Walsh
Venue:  (1999)

This tutorial for Perl/Tk, the extension to Perl for creating graphical user interfaces, shows how to use Perl/Tk to build graphical, event-driven applications for both Windows and UNIX. Rife with illustrations, it teaches how to implement and configure each Perl/Tk graphical element.
Controlling cgi programs
Authors: Bernhard Wagner
Venue: ACM SIGOPS Operating Systems Review (1998)

In the beginning the World Wide Web contained mostly hypertext documents, but since then, a growing number of applications have required cgi programs. Therefore, a web designer should be able to provide a cgi program for web use as easily as HTML documents are provided. Cgi programs, however, are executed by the web server process, with all its permissions and capabilities enabled. To avoid this most undesirable situation we propose a program, chuid, which changes the webmaster's userid to that of the cgi program provider before that cgi program is executed. In order to use the chuid program, the URL's of all cgi programs have to be slightly changed. Chuid may be used in all Unix-based web servers. The source code of chuid written in C is available via the World Wide Web.
Synchronous equivalence for embedded systems: a tool for design exploration
Authors: Harry Hsieh, Felice Balarin
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper presents a new protocol for parallel and distributed simulation of VLSI systems. It is novel in two aspects: first, it combines optimistic and conservative synchronization methods, allowing processes to self-adapt for maximal utilization of concurrency. Second, it does not require any application-dependent information like lookahead, which in many cases is unknown, zero, or difficult to automatically obtain from a design in a hardware description language. All these features make it very convenient and practical, extending the class of applications to at least all VHDL circuits, including delta cycle. The proposed protocol has been implemented and used for VHDL simulation. Experimental results on several large VHDL circuits (between 1411 and 14704 processes) have shown promising linear speedups. We also observed that the dynamic synchronization, in which processes automatically adapt to optimistic or conservative behavior, follows closely or finds a very good configuration. This protocol may have a string impact for mixed-signal circuit simulation, where digital parts may be optimistic and heavy-state analog parts, conservative.
A Fast Algorithm for Deblurring Models with Neumann Boundary Conditions
Authors: Michael K. Ng, Raymond H. Chan, Wun-Cheung Tang
Venue: SIAM Journal on Scientific Computing (1999)

Blur removal is an important problem in signal and image processing. The blurring matrices obtained by using the zero boundary condition (corresponding to assuming dark background outside the scene) are Toeplitz matrices for one-dimensional problems and block-Toeplitz--Toeplitz-block matrices for two-dimensional cases. They are computationally intensive to invert especially in the block case. If the periodic boundary condition is used, the matrices become (block) circulant and can be diagonalized by discrete Fourier transform matrices. In this paper, we consider the use of the Neumann boundary condition (corresponding to a reflection of the original scene at the boundary). The resulting matrices are (block) Toeplitz-plus-Hankel matrices. We show that for symmetric blurring functions, these blurring matrices can always be diagonalized by discrete cosine transform matrices. Thus the cost of inversion is significantly lower than that of using the zero or periodic boundary conditions. We also show that the use of the Neumann boundary condition provides an easy way of estimating the regularization parameter when the generalized cross-validation is used. When the blurring function is nonsymmetric, we show that the optimal cosine transform preconditioner of the blurring matrix is equal to the blurring matrix generated by the symmetric part of the blurring function. Numerical results are given to illustrate the efficiency of using the Neumann boundary condition.
Design of Multiparameter Steerable Functions Using Cascade Basis Reduction
Authors: Patrick C. Teo, Yacov Hel-Or
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

An efficient method of computing the least-squares optimal basis functions to steer any function locally is presented. The method combines the Lie group-theoretic and the singular value decomposition approaches. Its efficiency is demonstrated with the design of basis functions to steer a Gabor function under the four-parameter linear transformation group.
The Stationary Current-Voltage Characteristics of the Quantum Drift-Diffusion Model
Authors: René Pinnau, Andreas Unterreiter
Venue: SIAM Journal on Numerical Analysis (1999)

This paper is concerned with numerical algorithms for the bipolar quantum drift-diffusion model. For the thermal equilibrium case, a quasi-gradient method minimizing the energy functional is introduced and strong convergence is proved. The computation of current-voltage characteristics is performed by means of an extended Gummel-iteration. It is shown that the involved fixed point mapping is a contraction for small applied voltages. In this case the model equations are uniquely solvable and convergence of the proposed iteration scheme follows. Numerical simulations of a one-dimensional resonant tunneling diode are presented. The computed current-voltage characteristics are in good qualitative agreement with experimental measurements. The appearance of negative differential resistances is verified for the first time in a quantum drift-diffusion model.
High-level power estimation with interconnect effects
Authors: Kavel M. Büyükşahin, Farid N. Najm
Venue: Proceedings of the 2000 international symposium on Low power electronics and design (2000)

We extend earlier work on high-level average power estimation to include the power due to interconnect loading. The resulting technique is a combination of a RTL-level gate count prediction method and average interconnect estimation based on Rent's rule. The method can be adapted to be used with different place and route engines and standard cell libraries. For a number of benchmark circuits, the method is verified by extracting wire lengths from a layout of each circuit and then comparing the predicted (at RTL) power against that measured using SPICE. An average error of 14.4% is obtained for the average interconnect length, and an average error of 25.8% is obtained for average power estimation including interconnect effects.
DCT-Domain Embedded Memory Compression for Hybrid Video Coders
Authors: Richard P. Kleihorst, René J. Van Der Vleuten
Venue: Journal of VLSI Signal Processing Systems (2000)

Hybrid video compression schemes such as MPEG2 and H.263 use an image memory for motion-compensated coding. In VLSI implementations, this image is usually stored in external RAM because of its large size. To reduce the overall system costs, we propose to compress the image by a factor of 4 to 5 before storage, which then enables embedding of the image memory on the encoder IC itself. The proposed encoder architecture remains in the DCT-domain, so motion estimation and compensation are now performed from this domain. To control and guarantee the actual storage, scalable compression is used. A hardware implementation is feasible and worthwhile compared to traditional encoders with no noticeable loss in performance.
The humane interface: new directions for designing interactive systems
Authors: Jef Raskin
Venue:  (2000)

"Deep thinking is rare in this field where most companies are glad to copy designs that were great back in the 1970s. The Humane Interface is a gourmet dish from a master chef. Five mice!" --Jakob Nielsen, Nielsen Norman Group Author of Designing Web Usability: The Practice of SimplicityThis unique guide to interactive system design reflects the experience and vision of Jef Raskin, the creator of the Apple Macintosh. Other books may show how to use today's widgets and interface ideas effectively. Raskin, however, demonstrates that many current interface paradigms are dead ends, and that to make computers significantly easier to use requires new approaches. He explains how to effect desperately needed changes, offering a wealth of innovative and specific interface ideas for software designers, developers, and product managers.The Apple Macintosh helped to introduce a previous revolution in computer interface design, drawing on the best available technology to establish many of the interface techniques and methods now universal in the computer industry. With this book, Raskin proves again both his farsightedness and his practicality. He also demonstrates how design ideas must be built on a scientific basis, presenting just enough cognitive psychology to link the interface of the future to the experimental evidence and to show why that interface will work.Raskin observes that our honeymoon with digital technology is over: We are tired of having to learn huge, arcane programs to do even the simplest of tasks; we have had our fill of crashing computers; and we are fatigued by the continual pressure to upgrade. The Humane Interface delivers a way for computers, information appliances, and other technology-driven products to continue to advance in power and expand their range of applicability, while becoming free of the hassles and obscurities that plague present products. 0201379376B07092001
Diagnosing Rediscovered Software Problems Using Symptoms
Authors: Inhwan Lee, Ravishankar K. Iyer
Venue: IEEE Transactions on Software Engineering (2000)

This paper presents an approach to automatically diagnosing rediscovered software failures using symptoms, in environments in which many users run the same procedural software system. The approach is based on the observation that the great majority of field software failures are rediscoveries of previously reported problems and that failures caused by the same defect often share common symptoms. Based on actual data, the paper develops a small software failure fingerprint, which consists of the procedure call trace, problem detection location, and the identification of the executing software. The paper demonstrates that over 60 percent of rediscoveries can be automatically diagnosed based on fingerprints; less than 10 percent of defects are misdiagnosed. The paper also discusses a pilot that implements the approach. Using the approach not only saves service resources by eliminating repeated data collection for and diagnosis of reoccurring problems, but it can also improve service response time for rediscoveries.
Running the Economy: A Review of the Internet-Based Fairmodel
Authors: Mark A. Roscam Abbing
Venue: Computational Economics (1998)

Since February 1997, Fair&lsquo;s large macroeconometric multi-country model has been freely available through the internet. In this article both the history and the use of the Fairmodel are discussed. The Fairmodel enables students to work with real data and it makes economic theory come to life. A drawback is that getting started with the model can take up a great deal of time. A realistic example of working with the model is presented. The Fairmodel shows that the internet could drastically change the manner in which economics is taught.