ppxscal/embedding_network huggingface dataset:
Unroll-and-jam using uniformly generated sets
Authors: Steve Carr, Yiping Guan
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

Modern architectural trends in instruction-level parallelism (ILP) are to increase the computational power of microprocessors significantly. As a result, the demands on memory have increased. Unfortunately, memory systems have not kept pace. Even hierarchical cache structures are ineffective if programs do not exhibit cache locality. Because of this compilers need to be concerned not only with finding ILP to utilize machine resources effectively, but also with ensuring that the resulting code has a high degree of cache locality. One compiler transformation that is essential for a compiler to meet the above objectives is unroll-and-jam, or outer-loop unrolling. Previous work either has used a dependence-based model to compute unroll amounts, significantly increasing the size of the dependence graph, or has applied a more brute force technique. In this paper, we present an algorithm that uses a linear-algebra-based technique to compute unroll amounts. This technique results in an 84% reduction over dependence-based techniques in the total number of dependences needed in our benchmark suite. Additionally, there is no loss in optimization performance over previous techniques and a more elegant solution is utilized.
Report on the fifth European workshop on software process technology
Authors: Carlo Montangero
Venue: ACM SIGSOFT Software Engineering Notes (1997)

This is a short resume of the actual proceedings of the fifth European Workshop on Software Process Technology, held in Nancy, 9-11 October 1996. It is a post-hoc integration of the report that is included in the proceedings of the fourth International Conference on the Software Process, held in Brighton, UK, 3-5 December 1996, and published by IEEE Press. It is based on the presentations of the session rapporteurs, whom I gratefully acknowledge, together with E. Ellmer, who took minutes of the last wrap-up session. The papers that triggered the discussions are available by Springer Verlag, as volume 1149 of the Lecture Notes in Computer Science.
Behavioral modeling for system design (panel)
Authors: Tom Blank
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

As system designers make increasing use of complex standard components (such as microcomputers, RAM, standard DSP's) and ASIC's in the same design, or even on the same semi-custom integrated circuit, the problem of modeling the behavior of the system for verification using simulation is becoming increasingly acute. While chip designers have made extensive use of simulation for design verification, system designers have been slow to follow their lead. Will vendors provide detailed simulation models of their complex standard components and, if so, in what format? Can VHDL be used effectively in this role or is it too complex to use? How can the IC vendor provide a model without giving away its design to competitors? Can an accurate model be created by a third party, from the part and its specification sheets, in all cases? Will IC vendors qualify such a model? What is the role of hardware modeling; are hardware modelers and behavioral models complements or competitors? Can software simulators meet the challenge of design size and design complexity? How important is mixed analog-digital simulation in this process?
Singularities of Illuminated Surfaces
Authors: L. Donati, N. Stolfi
Venue: International Journal of Computer Vision (1997)

We study local singularities that appear in pictures of illuminated objects: we suppose there is only one light source and we look at the shadow it casts on the surface. We focus on the frontier between shadow and light. In the visual plane, these curves interact with the apparent contour of the surface. The search of generic situations translates into a classification problem in singularity theory. We are thus able to give the list of the six stable and generic views of illuminated surfaces.
The road less traveled: a baccalaureate degree in software engineering
Authors: Michael J. Lutz, J. Fernando Naveda
Venue: ACM SIGCSE Bulletin (1997)

In the fall of 1996, RIT admitted the first students to a new undergraduate program in software engineering. Our goal in creating the program was to provide for the education of a new type of engineer: the software engineer. This paper presents the rationale for developing such a program, the process we followed in its design, and an outline of the distinctive features it possesses.
Programming with variable functions
Authors: Martin Odersky
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

What is a good method to specify and derive imperative programs? This paper argues that a new form of functional programming fits the bill: where variable functions can be updated at specified points in their domain.Traditional algebraic specification and functional programming are a powerful pair of tools for specifying and implementing domains of discourse and operations on them. Recent work on evolving algebras has introduced the function update in algebraic specifications, and has applied it with good success in the modelling of reactive systems. We show that similar concepts allow one to derive efficient programs in a systematic way from functional specifications. The final outcome of such a derivation can be made as efficient as a traditional imperative program with pointers, but can still be reasoned about at a high level.Variable functions can also play an important role in the structuring of large systems. They can subsume object-oriented programming languages, without incurring the latter's problems with pointer aliasing and modularity.
The Carnot Heterogeneous Database Project: Implemented Applications
Authors: Munindar P. Singh, Philip E. Cannata, Michael N. Huhns, Nigel Jacobs, Tomasz Ksiezyk, Kayliang Ong, Amit P. Sheth, Christine Tomlinson, Darrell Woelk
Venue: Distributed and Parallel Databases (1997)

The Carnot project was an ambitious research project in heterogeneous databases. It integrated a variety of techniques to address a wide range of problems in achieving interoperation in heterogeneous environments. Here we describe some of the major implemented applications of this project. These applications concern (a) accessing a legacy scientific database, (b) automating a workflow involving legacy systems, (c) cleaning data, and (d) retrieving semantically appropriate information from structured databases in response to text queries. These applications support scientific decision support, business process management, data integrity enhancement, and analytical decision support, respectively. They demonstrate Carnot&lsquo;s capabilities for (a) heterogeneous query processing, (b) relaxed transaction and workflow management, (c) knowledge discovery, and (d) heterogeneous resource model integration.
Bounds on the Number of Examples Needed for Learning Functions
Authors: Hans Ulrich Simon
Venue: SIAM Journal on Computing (1997)

We prove general lower bounds on the number of examples needed for learning function classes within different natural learning models which are related to pac-learning (and coincide with the pac-learning model of Valiant in the case of {0,1}-valued functions). The lower bounds are obtained by showing that all nontrivial function classes contain a "hard binary-valued subproblem." Although (at first glance) it seems to be likely that real-valued function classes are much harder to learn than their hardest binary-valued subproblem, we show that these general lower bounds cannot be improved by more than a logarithmic factor. This is done by discussing some natural function classes like nondecreasing functions or piecewise-smooth functions (the function classes that were discussed in [M. J. Kearns and R. E. Schapire, Proc. 31st Annual Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1990, pp. 382--392, full version, J. Comput. System Sci., 48 (1994), pp. 464--497], [D. Kimber and P. M. Long, Proc. 5th Annual Workshop on Computational Learning Theory, ACM, New York, 1992, pp. 153--160]) with certain restrictions concerning their slope.
The Context Interchange mediator prototype
Authors: S. Bressan, C. H. Goh, K. Fynn, M. Jakobisiak, K. Hussein, H. Kon, T. Lee, S. Madnick, T. Pena, J. Qu, A. Shum, M. Siegel
Venue: Proceedings of the 1997 ACM SIGMOD international conference on Management of data (1997)

The Context Interchange strategy presents a novel approach for mediated data access in which semantic conflicts among heterogeneous systems are not identified a priori, but are detected and reconciled by a context mediator through comparison of contexts. This paper reports on the implementation of a Context Interchange Prototype which provides a concrete demonstration of the features and benefits of this integration strategy.
Instruction sets and their implementations
Authors: Michael J. Flynn
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

A view of some of the major issues facing architects and designers in the nineties is presented. For example, as processor cycles shorten the number of cycles per instruction increases, since cache/memory access time does not scale with processor speed. Thus, the kind of tradeoffs applicable in the eighties may be quite different in the nineties.
Modeling file-system input traces via a two-level arrival process
Authors: Peter P. Ware, Thomas W. Page,  Jr., Barry L. Nelson
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A method for analyzing, modeling and simulating a two-level arrival--counting process is presented. This method is particularly appropriate when the number of independent processes is large. The initial motivation for this method was the need to analyze and represent computer file system trace data that involves activity on some 8,000 files. The method is also applicable to network trace data characterizing communication patterns between pairs of computers. Cluster analysis with a novel stopping rule is used to decompose the arrival process into groups. The resulting clusters can be characterized using the time between clusters, the time between arrivals within clusters, and the size of each cluster. Each of these three components is then analyzed as a univariate problem. The effectiveness of this method is measured by comparing the output of a simulation driven by the original trace data to the output of the same simulation driven by the input model.
Explicit Symplectic Integrators Using Hessian--Vector Products
Authors: M. A. López-Marcos, J. M. Sanz-Serna, Robert D. Skeel
Venue: SIAM Journal on Scientific Computing (1997)

In 1991 Rowlands proposed an effectively fourth-order, effectively two-stage, explicit symplectic integrator based on using a Hessian--vector product to modify the force evaluation in the leapfrog method, and evidence indicates that for modest accuracy this method is highly competitive. Here we explore the possible existence of even more efficient fourth-order explicit symplectic integrators, also based on the use of Hessian--vector products and the concept of effective order. First it is shown that the cost of a force evaluation plus a Hessian--vector product is less than twice the cost of the force alone for a sum of two-body interactions. Then a new method is found that is generally better than both the method of Rowlands and that of Calvo, according to both a theoretical measure of the error and limited numerical experiments. The basic motivation behind the new method is quite simple: do a Hessian--vector computation only every other step, significantly cutting costs while only marginally increasing the error. The idea of effective order means that we allow for both the possibility of preprocessing the initial values before application of the basic method and the possibility of postprocessing the values obtained by the basic method, but at output points only. For some applications processing is unnecessary, but in any case processing has been shown to be possible at low additional cost. The derivation of the new method illustrates how to simplify by the use of H-series the determination of parameters for methods of increased effective accuracy.
Quality-of-service adaptation in distributed multimedia applications
Authors: Abdelhakim Hafid, Gregor v. Bochmann
Venue: Multimedia Systems (1998)

High-speed networks and powerful end-systems enable new types of applications, such as video-on-demand and teleconferencing. Such applications are very demanding on quality of service (QoS) because of the isochronous nature of the media they are using. To support these applications, QoS guarantees are required. However, even with service guarantees, violations may occur because of resources shortage, e.g., network congestion. In this paper we propose new adaptation approaches, which allow the system to recover automatically, if possible, from QoS violations (1) by identifying a new configuration of system components that might support the initially agreed QoS and by performing a user-transparent transition from the original configuration to the new one, (2) by redistributing the levels of QoS that should be supported, in the future, by the components, or (3) by redistributing the levels of QoS that should be supported immediately to meet end-to-end requirements based on the principle that (local) QoS violation at one component may be recovered immediately by the other components participating in the support of the requested service. The proposed approaches, together with suitable negotiation mechanisms, allow us (1) to reduce the probability of QoS violations which may be noticed by the user, and thus, to increase the user confidence in the service provider, and (2) to improve the utilization of the system resources, and thus to increase the system availability.
Representation of fractal curves by means of L systems
Authors: Manuel Alfonseca, Alfonso Ortega
Venue: ACM SIGAPL APL Quote Quad (1996)

Fractals can be represented by means of L-systems (Development Grammars), together with a graphic interpretation. Two families of graphic interpretations have been used: turtle graphics and vector graphics. This paper describes an APL2/PC system able to draw fractals represented by L-systems, with both graphic interpretations. A theorem has been proved on the equivalence conditions for both interpretations. Another point shown is the fact that supposed deficiencies in L-systems that have prompted proposals of extensions are really deficiencies in the graphic translation scheme.
Simulating semiconductor manufacturing systems: successes, failures, and deep questions
Authors: Karl G. Kempf
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Over the past several years, engineers at Intel Corporation have used modeling and simulation techniques to solve various high volume manufacturing problems. Our current goal is to use a persistent model over the entire life cycle of a factory to promote integration and continuous improvement of all of the components of the manufacturing system. The uses of this model are detailed as well as our progress towards realization of this goal. A summary of problems that we have encountered along the way is included as both a warning to those who have a similar goal and as a work list for vendors of simulation packages. Two disturbing questions about the basis of manufacturing simulation are asked that should be of concern to practicing simulation engineers as well as university researchers.
Technology retargeting for IC layout
Authors: John Lakos
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

The ability to recognize polygon-based layout as a collection ofobjects representing circuit elements connected by path-based wires,enables existing designs implemented using an older fabricationprocess to be reimplanted quickly in a new process.The approachtaken here, based on layout generator technology, is to create acollection of parameterized circuit objects that, with appropriatearguments, are able to represent the devices (e.g., transistors,contacts) implicitly described in the flattened design.Therecognition engine is fully programmable, is independent of anyparticular technology or device set, and is not restricted to manhattanor even octilinear geometries.In this paper, we describe a novelthree-phase approach to object recognition: device recognition, exactwire recognition, and wire synthesis.We believe exact wire recognitionto be entirely new and cover it in detail.Experimental resultsdemonstrate the effectiveness of the algorithms on actual layout.
Mesh Smoothing Using A Posteriori Error Estimates
Authors: Randolph E. Bank, R. Kent Smith
Venue: SIAM Journal on Numerical Analysis (1997)

We develop a simple mesh-smoothing algorithm for adaptively improving finite-element triangulations. The algorithm makes use of a posteriori error estimates which are now widely used in finite-element calculations. In this paper we derive the method, present some numerical illustrations, and give a brief analysis of the issue of uniqueness.
Supercomputer performance evaluation and the Perfect Benchmarks
Authors: George Cybenko, Lyle Kipp, Lynn Pointer, David Kuck
Venue: Proceedings of the 4th international conference on Supercomputing (1990)

In the past three years, the Perfect BenchmarkTM Suite has evolved from a supercomputer performance evaluation plan, presented by Kuck and Sameh at the 1987 International Conference on Supercomputing, to a vigorous international activity. This paper surveys the current state of this supercomputer performance evaluation effort with particular focus on the adopted methodology. While there has been considerable success in achieving the goals of the plan, some issues remain unresolved, and new questions have surfaced.
Two Neural Network Construction Methods
Authors: G. Thimm, E. Fiesler
Venue: Neural Processing Letters (1997)

Two low complexity methods for neural network construction, that are applicable to various neural network models, are introduced and evaluated for high order perceptrons. The methods are based on a Boolean approximation of real-valued data. This approximation is used to construct an initial neural network topology which is subsequently trained on the original (real-valued) data. The methods are evaluated for their effectiveness in reducing the network size and increasing the network&lsquo;s generalization capabilities in comparison to fully connected high order perceptrons.
Efficient Error-Correcting Viterbi Parsing
Authors: Juan C. Amengual, Enrique Vidal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

The problem of Error-Correcting Parsing (ECP) using an insertion-deletion-substitution error model and a Finite State Machine is examined. The Viterbi algorithm can be straightforwardly extended to perform ECP, though the resulting computational complexity can become prohibitive for many applications. We propose three approaches in order to achieve an efficient implementation of Viterbi-like ECP which are compatible with Beam Search acceleration techniques. Language processing and shape recognition experiments which assess the performance of the proposed algorithms are presented.
Some better results estimating the shift function in terms of busy beaver function
Authors: Ruiguang Yang, Longyun Ding, Shurun Xu
Venue: ACM SIGACT News (1997)

About the relation between the shift function S(n) and the busy beaver function &Sigma;(n), there have been some results. In 1992, A. Julstrom gave his result: S(n) < &Sigma;(20n); in 1994, Wang Kewen and Xu Shurun obtained: S(n) < &Sigma;(10n). In this paper, we shall show that S(n) &le; &Sigma;(3n -f c)(c is a constant).
Computer-aided design of free-space opto-electronic systems
Authors: S. P. Levitan, P. J. Marchand, T. P. Kurzweg, M. A. Rempel, D. M. Chiarulli, C. Fan, F. B. McCormick
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

This paper presents a system capable of static and dynamic simulationsof heterogeneous opto-electronic systems. It is capable ofmodeling Gaussian optical signal propagation with mechanicaltolerancing at the system level. We present results which demonstratethe system's ability to predict the effects of various componentparameters, such as detector geometry, and system levelparameters, such as alignment tolerances, on system performance.
Extending Backward Error Assertions to Tolerance of Large Errors in Floating Point Computations
Authors: Patrick Fitzpatrick
Venue: IEEE Transactions on Computers (1997)

The use of backward error assertions combined with iterative refinement has been suggested for the correction of small fault induced errors in the floating point solution of linear systems. We extend this to the correction of large errors, typically caused by the failure of a single processor (or column of processors) in an array.
Migration Processes I: The Continuous Case
Authors: Sándor Fejes, Azriel Rosenfeld
Venue: Journal of Mathematical Imaging and Vision (1998)

In this paper the general concept of a migration process (MP) is introduced; it involves iterative displacement of each point in a set as function of a neighborhood of the point, and is applicable to arbitrary sets with arbitrary topologies. After a brief analysis of this relatively general class of iterative processes and of constraints on such processes, we restrict our attention to processes in which each point in a set is iteratively displaced to the average (centroid) of its equigeodesic neighborhood. We show that MPs of this special class can be approximated by &ldquo;reaction-diffusion&rdquo;-type PDEs, which have received extensive attention recently in the contour evolution literature. Although we show that MPs constitute a special class of these evolution models, our analysis of migrating sets does not require the machinery of differential geometry. In Part I of the paper we characterize the migration of closed curves and extend our analysis to arbitrary connected sets in the continuous domain (R^m) using the frequency analysis of closed polygons, which has been rediscovered recently in the literature. We show that migrating sets shrink, and also derive other geometric properties of MPs. In Part II we will reformulate the concept of migration in a discrete representation (Z^m).
Principles of conservative parallel simulation
Authors: David M. Nicol
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This tutorial describes considerations in writing parallelized discrete-event simulations. We identify key principles behind various synchronization methods tailored to simulate complex systems.
A simulation model for evaluating personnel schedules in a hospital emergency department
Authors: Gerald W. Evans, Tesham B. Gor, Edward Unger
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper describes an Arena simulation model of a particular hospital's emergency department. The model allows the simulation of the process flows of 13 different types of patients, and is used to evaluate various feasible schedules for nurses, technicians, and doctors. The main performance measure used in the evaluation process is the average length-of-stay of patients in the emergency department.