ppxscal/embedding_network huggingface dataset:
Circuits for wide-window superscalar processors
Authors: Dana S. Henry, Bradley C. Kuszmaul, Gabriel H. Loh, Rahul Sami
Venue: Proceedings of the 27th annual international symposium on Computer architecture (2000)

Our program benchmarks and simulations of novel circuits indicate that large-window processors are feasible. Using our redesigned superscalar components, a large-window processor implemented in today's technology can achieve an increase of 10-60% (geometric mean of 31%) in program speed compared to today's processors. The processor operates at clock speeds comparable to today's processors, but achieves significantly higher ILP. To measure the impact of a large window on clock speed, we design and simulate new implementations of the logic components that most limit the critical path of our large-window processor: the schedule logic and the wake-up logic. We use log-depth cyclic segmented prefix (CSP) circuits to reimplement these components. Our layouts and simulations of critical paths through these circuits indicate that our large-window processor could be clocked at frequencies exceeding 500MHz in today's technology. Our commit logic and rename logic can also run at these speeds. To measure the impact of a large window on ILP, we compare two microarchitectures, the first has a 128-instruction window, an 8-wide fetch unit, and 20-wide issue (four integer, branch, multiply, float, and memory units), whereas the second has a 32-instruction window, and a 4-wide fetch unit and is comparable to today's processors. For each, we simulate different window reuse and bypass policies. Our simulations show that the large-window processor achieves significantly higher IPC. This performance increase comes despite the fact that the large-window processor uses a wrap-around window while the small-window processor uses a compressing window, thus effectively increasing its number of outstanding instructions. Furthermore, the large-window processor sometimes pays an extra clock cycle for bypassing.
A Combined Clustering and Neural Network Approach for Analog Multiple Hard Fault Classification
Authors: M. A. El-Gamal, M.F. Abu El-Yazeed
Venue: Journal of Electronic Testing: Theory and Applications (1999)

A new neural network-based fault classification strategy for hard multiple faults in analog circuits is proposed. The magnitude of the harmonics of the Fourier components of the circuit response at different test nodes due to a sinusoidal input signal are first measured or simulated. A selection criterion for determining the best components that describe the circuit behaviour under fault-free (nominal) and fault situations is presented. An algorithm that estimates the overlap between different faults in the measurement space is also introduced. The learning vector quantization neural network is then effectively trained to classify circuit faults. Performance measures reveal very high classification accuracy in both training and testing stages. Two different examples, which demonstrate the proposed strategy, are described.
A Jacobi Waveform Relaxation Method for ODEs
Authors: J. Sand, K. Burrage
Venue: SIAM Journal on Scientific Computing (1998)

A Jacobi waveform relaxation (WR) method for solving initial value problems for ordinary differential equations (ODEs) is presented. In each window the method uses a technique called dynamic fitting and a pair of continuous Runge--Kutta (RK) formulas to produce the initial waveform, after which a fixed number of waveform iterates are computed. The reliability and efficacy of the method are demonstrated numerically by applying it to qualitatively different problems for linear tridiagonal ODEs.
Multivariate visualization in observation-based testing
Authors: David Leon, Andy Podgurski, Lee J. White
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

We explore the use of multivariate visualization techniques to support a new approach to test data selection, called observation-based testing. Applications of multivariate visualization are described, including: evaluating and improving synthetic tests; filtering regression test suites; filtering captured operational executions; comparing test suites; and assessing bug reports. These applications are illustrated by the use of correspondence analysis to analyze test inputs for the GNU GCC compiler.
Ingham-Type Theorems for Vector-Valued Functions and Observability of Coupled Linear Systems
Authors: Vilmos Komornik, Paola Loreti
Venue: SIAM Journal on Control and Optimization (1999)

We propose a new approach to study the observability of coupled linear distributed systems. It is based on a generalization of some classical theorems of nonharmonic analysis to vector-valued functions. Applying this method we answer some questions of J.-L. Lions [ Contrôlabilité exacte et stabilisation de systèms distribués, Vol. 2, Masson, 1988] on the boundary observability of coupled linear distributed systems in particular cases.
Code motion for explicitly parallel programs
Authors: Jens Knoop, Bernhard Steffen
Venue: ACM SIGPLAN Notices (1999)

In comparison to automatic parallelization, which is thoroughly studied in the literature [31, 33], classical analyses and optimizations of explicitly parallel programs were more or less neglected. This may be due to the fact that naive adaptations of the sequential techniques fail [24], and their straightforward correct ones have unacceptable costs caused by the interleavings, which manifest the possible executions of a parallel program. Recently, however, we showed that unidirectional bitvector analyses can be performed for parallel programs as easily and as efficiently as for sequential ones [17], a necessary condition for the successful transfer of the classical optimizations to the parallel setting.In this article we focus on possible subsequent code motion transformations, which turn out to require much more care than originally conjectured [17]. Essentially, this is due to the fact that interleaving semantics, although being adequate for correctness considerations, fails when it comes to reasoning about efficiency of parallel programs. This deficiency, however, can be overcome by strengthening the specific treatment of synchronization points.
An Improved Fast Multipole Algorithm for Potential Fields
Authors: Tomasz Hrycak, Vladimir Rokhlin
Venue: SIAM Journal on Scientific Computing (1998)

A new version of the fast multipole method (FMM) for potential fields is presented. We introduce a new representation of potentials, in which most translation operators are diagonal. As a result, for double precision calculations in two dimensions we obtain an improvement of a factor of two to four in speed, compared to previously published algorithms; the improvement is expected to be much greater in three dimensions. The performance of the method is illustrated with several numerical examples.
A Value Efficiency Approach to Incorporating Preference Information in Data Envelopment Analysis
Authors: Merja Halme, Tarja Joro, Pekka Korhonen, Seppo Salo, Jyrki Wallenius
Venue: Management Science (1999)

We develop a procedure and the requisite theory for incorporating preference information in a novel way in the efficiency analysis of Decision Making Units. The efficiency of Deci sion Making Units is defined in the spirit of Data Envelopment Analysis (DEA), complemented with Decision Maker's preference information concerning the desirable structure of inputs and outputs. Our procedure begins by aiding the Decision Maker in searching for the most preferred combination of inputs and outputs of Decision Making Units (for short, Most Preferred Solution) which are efficient in DEA. Then, assuming that the Decision Maker's Most Preferred Solution maximizes his/her underlying (unknown) value function, we approximate the indifference contour of the value function at this point with its possible tangent hyperplanes. Value Efficiency scores are then calculated for each Decision Making Unit comparing the inefficient units to units having the same value as the Most Preferred Solution. The resulting Value Efficiency scores are optimistic approximations of the true scores. The procedure and the resulting efficiency scores are immediately applicable to solving practical problems.
OpenMath and MathML: semantic markup for mathematics
Authors: O. Caprotti, D. Carlisle
Venue: Crossroads (1999)

Unambiguous representation of mathematics is crucial for communications among humans or among computer systems. OpenMath is a standard aimed at supporting a semantically rich interchange of mathematics among varied computational software tools such as computer algebra systems, theorem provers, and tools for visualizing or editing mathematical text. MathML is a W3C Recommendation for the encoding of mathematics 'on the web' which also includes mechanisms for encoding mathematical semantics. We introduce each of these two languages and describe their relationships.
Average-case analysis of greedy packet scheduling (extended astract)
Authors: Zvi Lotker, Boaz Patt-Shamir
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of delays in a few cases as follows. First, we show that the average number of delays is a function of the number of sources of packets, which is interesting in case a node may send many packets. Then, using a new concept we call delay race, we prove a tight bound on the average number of delays in a leveled graph. Finally, using delay races in a more involved way, we prove nearly-tight bounds on the average number of delays in directed acyclic graphs (DAGs). The upper bound for DAGs is expressed in terms of the underlying topology, and as a result it holds for any acyclic set of routes, even if they are not shortest paths. The lower bound for DAGs, on the other hand, holds even for shortest paths routes.
Deriving Trends in Historical and Real-Time Continuously Sampled Medical Data
Authors: Apkar Salatian, Jim Hunter
Venue: Journal of Intelligent Information Systems (1999)

Monitors in Intensive Care Units generate large volumes of continuous data which can overwhelm a database and result in information overload for the medical staff. Instead of reasoning with individual data samples of one or more variables, it is better to work with the trend of the data i.e., whether the data is increasing, decreasing or steady. We have developed a system which abstracts continuous data into trends; it consists of three consecutive processes: filtering which smooths the data&semi; temporal interpolation which creates simple intervals between consecutive data points&semi; and temporal inference which iteratively merges intervals which share similar characteristics into larger intervals. Storing trends can result in a reduction in database volume. Our system has been applied both to historical and real-time data.
Tracing multimedia benchmarks with five degrees of validation
Authors: Humayun Khalid
Venue: ACM SIGARCH Computer Architecture News (1999)

In this paper we have extended our methodology, presented earlier in [1], for generating and validating representative traces. Our novel technique was applied to a relatively realistic and difficult multimedia benchmark suite called MediaMark. We have also introduced a new metric called the K-metric (Khalid - metric) that was used for validation. The aim of our present research was to demonstrate that the proposed methodology can be successful even for complex and challenging benchmarks like multimedia benchmarks. Earlier our methodology was shown to be the most successful one as compared to the popular contemporary techniques for tracing relatively simple and primitive suite of applications contained within SPEC trade;95 benchmark suite [1]. Experimental results in this article demonstrate that our methodology works in the worst case scenarios.
Misconceptions of designing: a descriptive study
Authors: Michael McCracken, Wendy Newstetter, Jeff Chastine
Venue: ACM SIGCSE Bulletin (1999)

Our experience in designing and teaching a cross-disciplinary freshman design class has led us to believe that students entering design fields (e.g., computer science or engineering) are saddled with na iuml;ve or (mis)conceptions about design and design activity. It is our belief that for students to become effective designers, they must be helped to recognize and overcome these misconceptions through appropriate educational interventions. To better understand the nature and substance of these misconceptions, we conducted a descriptive survey study of 290 freshman in a technological institute. Our findings begin to suggest a consistent profile of misconceptions across declared majors that start to explain observations we have made of na iuml;ve designers in our freshman design class. This paper reports on those findings.
Of crawlers, portals, mice, and men: is there more to mining the Web?
Authors: Minos N. Garofalakis, Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

The World Wide Web is rapidly emerging as an important medium for transacting commerce as well as for the dissemination of information related to a wide range of topics (e.g., business, government, recreation). According to most predictions, the majority of human information will be available on the Web in ten years. These huge amounts of data raise a grand challenge for the database community, namely, how to turn the Web into a more useful information utility. This is exactly the subject that will be addressed by this panel.
Efficient Spectral-Galerkin Methods IV. Spherical Geometries
Authors: Jie Shen
Venue: SIAM Journal on Scientific Computing (1999)

Fast spectral-Galerkin algorithms are developed for elliptic equations on the sphere. The algorithms are based on a double Fourier expansion and have quasi-optimal (optimal up to a logarithmic term) computational complexity. Numerical experiments indicate that they are significantly more efficient and/or accurate when compared with the algorithms based on spherical harmonics and on finite difference. Extensions to problems in spherical layers and to vector equations are also discussed.
Evolution and change in data management &mdash; issues and directions
Authors: John F. Roddick
Venue: ACM SIGMOD Record (2000)

One of the fundamental aspects of information and database systems is that they change. Moreover, in so doing they evolve, although the manner and quality of this evolution is highly dependent on the mechanisms in place to handle it. While changes in data are handled well, changes in other aspects, such as structure, rules, constraints, the model, etc., are handled to varying levels of sophistication and completeness. In order to study this in more detail a workshop on Evolution and Change in Data Management was held in Paris in November 1999. It brought together researchers from a wide range of disciplines with a common interest in handling the fundamental characteristics and the conceptual modelling of change in information and database systems. This short report of the workshop concentrates on some of the general lessons that emerged during the four days.
Purpose and usability of digital libraries
Authors: Yin Leng Theng, Norliza Mohd-Nasir, Harold Thimbleby
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

A preliminary study was conducted to help understand the purpose of digital libraries (DLs) and to investigate whether meaningful results could be obtained from small user studies of digital libraries. Results stress the importance of mental models, and of "traditional" library support.
Interpolation in Lie Groups
Authors: Arne Marthinsen
Venue: SIAM Journal on Numerical Analysis (1999)

We consider interpolation in Lie groups. Based on points on the manifold together with tangent vectors at (some of) these points, we construct Hermite interpolation polynomials. If the points and tangent vectors are produced in the process of integrating an ordinary differential equation in terms of Lie-algebra actions, we use the truncated inverse of the differential of the exponential mapping and the truncated Baker--Campbell--Hausdorff formula to relatively cheaply construct an interpolation polynomial.Much effort has lately been put into research on geometric integration, i.e., the process of integrating differential equations in such a way that the configuration space of the true solution is respected by the numerical solution. Some of these methods may be viewed as generalizations of classical methods, and we investigate the construction of intrinsic dense output devices as generalizations of the continuous Runge--Kutta methods.
Improving Service by Informing Customers About Anticipated Delays
Authors: Robert Plante, Herbert Moskowitz, Jen Tang, Jeff Duffy, Ward Whitt
Venue: Management Science (1999)

This paper investigates the effect upon performance in a service system, such as a telephone call center, of giving waiting customers state information. In particular, the paper studies two M/M/s/r queueing models with balking and reneging. For simplicity, it is assumed that each customer is willing to wait a fixed time before beginning service. However, customers differ, so the delay tolerances for successive customers are random. In particular, it is assumed that the delay tolerance of each customer is zero with probability &#946;, and is exponentially distributed with mean &#945;-1 conditional on the delay tolerance being positive. Let N be the number of customers found by an arrival. In Model 1, no state information is provided, so that if N &#8805; s, the customer balks with probability &#946;; if the customer enters the system, he reneges after an exponentially distributed time with mean &#945;-1 if he has not begun service by that time. In Model 2, if N - s + k &#956; s, then the customer is told the system state k and the remaining service times of all customers in the system, so that he balks with probability &#946; + (1 - &#946;)(1 - qk), where qk = P(T &gt; Sk), T is exponentially distributed with mean &#945;-1, Sk is the sum of k + 1 independent exponential random variables each with mean (s&#956;)-1, and &#956;-1 is the mean service time. In Model 2, all reneging is replaced by balking. The number of customers in the system for Model 1 is shown to be larger than that for Model 2 in the likelihood-ratio stochastic ordering. Thus, customers are more likely to be blocked in Model 1 and are more likely to be served without waiting in Model 2. Algorithms are also developed for computing important performance measures in these, and more general, birth-and-death models.
Adaptive Mesh Refinement Using Wave-Propagation Algorithms for Hyperbolic Systems
Authors: Marsha J. Berger, Randall J. LeVeque
Venue: SIAM Journal on Numerical Analysis (1998)

An adaptive mesh refinement algorithm developed for the Euler equations of gas dynamics has been extended to employ high-resolution wave-propagation algorithms in a more general framework. This allows its use on a variety of new problems, including hyperbolic equations not in conservation form, problems with source terms or capacity functions, and logically rectangular curvilinear grids. This framework requires a modified approach to maintaining consistency and conservation at grid interfaces, which is described in detail. The algorithm is implemented in the AMRCLAW package, which is freely available.
Timing-driven partitioning for two-phase domino and mixed static/domino implementations
Authors: Min Zhao, Sachin S. Sapatnekar
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

Domino logic is a high-performance circuit configuration that is usually embedded in static logic environment and tightly coupled with the clocking scheme. In this paper, the timing-driven partitioning algorithms that partition a logic network between (1) static and domino implementations, and (2) the phases of a two-phase clock, are provided. In addition, an efficient static mapping algorithm is described.
On Convergence and Stability of the Explicit Difference Method for Solution of Nonlinear Schrödinger Equations
Authors: F. Ivanauskas, M. Radziunas
Venue: SIAM Journal on Numerical Analysis (1999)

The first boundary value problem for a nonlinear Schrödinger equation is investigated. The conditional convergence and stability on the initial data of the explicit three-level difference scheme of DuFort--Frankel type in C and W_2^1$ norms are proved. Grid analogues of energy conservation laws and grid multiplicative inequalities are used.
Efficient algorithms for scheduling data broadcast
Authors: Sohail Hameed, Nitin H. Vaidya
Venue: Wireless Networks (1999)

With the increasing acceptance of wireless technology, mechanisms to efficiently transmit information to wireless clients are of interest. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. It has been proposed that in such systems the server should broadcast the information periodically. A broadcast schedule determines what is broadcast by the server and when. This paper makes the simple, yet useful, observation that the problem of broadcast scheduling is related to the problem of fair queueing. Based on this observation, we present a log-time algorithm for scheduling broadcast, derived from an existing fair queueing algorithm. This algorithm significantly improves the time-complexity over previously proposed broadcast scheduling algorithms. Modification of this algorithm for transmissions that are subject to errors is considered. Also, for environments where different users may be listening to different number of broadcast channels, we present an algorithm to coordinate broadcasts over different channels. Simulation results are presented for proposed algorithms.
Elevator Group Control Using Multiple Reinforcement Learning Agents
Authors: Robert H. Crites, Andrew G. Barto
Venue: Machine Learning (1998)

Recent algorithmic and theoretical advances in reinforcement learning (RL) have attracted widespread interest. RL algorithms have appeared that approximate dynamic programming on an incremental basis. They can be trained on the basis of real or simulated experiences, focusing their computation on areas of state space that are actually visited during control, making them computationally tractable on very large problems. If each member of a team of agents employs one of these algorithms, a new collective learning algorithm emerges for the team as a whole. In this paper we demonstrate that such collective RL algorithms can be powerful heuristic methods for addressing large-scale control problems.Elevator group control serves as our testbed. It is a difficult domain posing a combination of challenges not seen in most multi-agent learning research to date. We use a team of RL agents, each of which is responsible for controlling one elevator car. The team receives a global reward signal which appears noisy to each agent due to the effects of the actions of the other agents, the random nature of the arrivals and the incomplete observation of the state. In spite of these complications, we show results that in simulation surpass the best of the heuristic elevator control algorithms of which we are aware. These results demonstrate the power of multi-agent RL on a very large scale stochastic dynamic optimization problem of practical utility.