ppxscal/embedding_network huggingface dataset:
An Implementation of Interprocedural Bounded Regular Section Analysis
Authors: P. Havlak, K. Kennedy
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

Regular section analysis, which summarizes interprocedural side effects on subarrays in a form useful to dependence analysis, while avoiding the complexity of prior solutions, is shown to be a practical addition to a production compiler. Optimizing compilers should produce efficient code even in the presence of high-level language constructs. However, current programming support systems are significantly lacking in their ability to analyze procedure calls. This deficiency complicates parallel programming, because loops withcalls can be a significant source of parallelism. The performance of regular section analysis is compared to two benchmarks: the LINPACK library of linear algebra subroutines and the Rice Compiler Evaluation Program Suite (RiCEPS), a set of complete application codes from a variety of scientific disciplines. The experimental results demonstrate that regular section analysis is an effective means of discovering parallelism, given programs written in an appropriately modular programming style.
Modified Stirling Numbers and p-Divisibility in the Universal Typical pk-Series
Authors: Jesús González
Venue: Journal of Algebraic Combinatorics: An International Journal (2003)

The 1-dimensional universal formal group law is a power series (in two variables and with coefficients in Lazard's ring) carrying a lot of geometrical and algebraic properties. For a prime p, we study the corresponding &ldquo;p-localized&rdquo; formal group law through its associated pk-series, [pk](x) &equals; &Sigma;s&ge;0ak,sxs(p&minus;1)+1&mdash;the pk-fold iterated formal sum of a variable x. The coefficients ak,s lie in the Brown-Peterson ring BP&ast; &equals; \Bbb Z(p)[v1,v2,&hellip;] and we describe part of their structure as polynomials in the variables vi with p-local coefficients. This is achieved by introducing a family of filtrations &lcub;W&phiv;&rcub;&phiv;&ge;1 in BP&ast; and studying the value of ak,s in each of the associated (bi)graded rings BP&ast;/W&phiv;. This allows us to identify, among monomials in ak,s of minimal W&phiv;-filtration (1 &le; &phiv; &le; k), an explicit monomial m&phiv;,k,s carrying the lowest possible p-divisibility. The p-local coefficient of m&phiv;,k,s is described as a Stirling-type number of the second kind and its actual value is computed up to p-local units. It turns out that mk,k,s not only carries the lowest Wk-filtration but, more importantly, the lowest p-divisibility among all other monomials in ak,s. In particular, we obtain a complete description of the p-divisibility properties of each ak,s.
Assessing Fast Network Interfaces
Authors: David E. Culler, Lok Tin Liu, Richard P. Martin, Chad O. Yoshikawa
Venue: IEEE Micro (1996)

We present a systematic performance assessment of the hardware and software that provides the interface between applications and emerging high-speed networks. Using LogP as a conceptual framework and Active Messages as the communication layer, we devise a set of communication microbenchmarks. These generate a graphical signature from which we extract the LogP performance parameters of latency, overhead, and bandwidth. The method is illustrated on three diverse platforms: Intel Paragon, Meiko CS-2, and a cluster of SparcStations with Myrinet. The study provides a detailed breakdown of the differences in communication performance among the platforms. While the details of our microbenchmark depend on Active Messages, the methodology can be applied to conventional communication layers.
R-trees: a dynamic index structure for spatial searching
Authors: Antonin Guttman
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

In order to handle spatial data efficiently, as required in computer aided design and geo-data applications, a database system needs an index mechanism that will help it retrieve data items quickly according to their spatial locations However, traditional indexing methods are not well suited to data objects of non-zero size located m multi-dimensional spaces In this paper we describe a dynamic index structure called an R-tree which meets this need, and give algorithms for searching and updating it. We present the results of a series of tests which indicate that the structure performs well, and conclude that it is useful for current database systems in spatial applications
Parameterized Families of Polynomials for Bounded Algebraic Curve and Surface Fitting
Authors: G. Taubin, F. Cukierman, S. Sullivan, J. Ponce, D. J. Kriegman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Interest in algebraic curves and surfaces of high degree as geometric models or shape descriptors for different model-based computer vision tasks has increased in recent years, and although their properties make them a natural choice for object recognition and positioning applications, algebraic curve and surface fitting algorithms often suffer from instability problems. One of the main reasons for these problems is that, while the data sets are always bounded, the resulting algebraic curves or surfaces are, in most cases, unbounded. In this paper, the authors propose to constrain the polynomials to a family with bounded zero sets, and use only members of this family in the fitting process. For every even number d the authors introduce a new parameterized family of polynomials of degree d whose level sets are always bounded, in particular, its zero sets. This family has the same number of degrees of freedom as a general polynomial of the same degree. Three methods for fitting members of this polynomial family to measured data points are introduced. Experimental results of fitting curves to sets of points in R/sup 2/ and surfaces to sets of points in R/sup 3/ are presented.
On restricted edge-colorings of bicliques
Authors: Dhruv Mubayi, Douglas B. West
Venue: Discrete Mathematics (2002)

We investigate the minimum and maximum number of colors in edge-colorings of Kn,n, such that every copy of Kp,p receives at least q and at most q' colors. Along the way we improve the bounds on some bipartite Turán numbers.
Creating Printed Music Automatically
Authors: Gary M. Rader
Venue: Computer (1996)

Some of today's music-score editing programs are capable of producing publication-quality scores. However, to produce scores as good as those music engravers and copyists create, the users must understand the positioning of many notational elements. However, most users of notational software have little or no music copyist training. This article presents a partial solution to this problem: How can users with little or no copyist training create publication-quality printed music? The solution, a program called MusicEase, applies constraints to notational information the user enters, automatically arranging graphical elements "correctly." This can also speed up the notation process, since the copyist doesn't have to make as many decisions or enter as much data. MusicEase incorporates a constraint-based technique to calculate the complex interaction of notational elements. Basically, it is a WYSIWYG editor with a menu system for novice users and keyboard shortcuts for advanced users. It imports and exports standard Musical Instrument Digital Interface (MIDI) files. MusicEase has been in use at the University of Colorado at Boulder and other places for several years now. According to user feedback, the word-processing paradigm and constraint-based approach work reasonably well for many routine, uncomplicated, notational tasks.
Performance Analysis of Synchronized Iterative Algorithms on Multiprocessor Systems
Authors: V. D. Agrawal, S. T. Chakradhar
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

A statistical model of parallel processing and a performance evaluation technique areintroduced. A task is characterized by the number of atoms and by activity. An atom isthe smallest part of computation that cannot be distributed to multiple processors and allatoms of a task are assumed to be equal in computational effort. Furthermore, atoms ofthe task became active with a fixed probability a called the activity. The task is equallydivided among processors and the computation is synchronized at periodic instanceswhen the results can be shared. The amount of computational activity of a processorwithin the period between synchronizations is assumed to be a binomial random variable.The performance of the multiprocessor system is derived from the maximumorder-statistic of these random variables. The theoretical performance predicted by theanalysis agrees well with the reported experimental performance of logic simulation ofproduction VLSI chips, and several observed phenomena are explainable.
The Weight Enumerator of Linear Codes over GF (q^m) Having Generator Matrix over GF (q)
Authors: Keisuke Shiromoto
Venue: Designs, Codes and Cryptography (1999)

We have the relationships between the Hamming weight enumerator of linear codes over { GF}(q^m) which have generator matrices over { GF}(q) , the support weight enumerator and the \lambda -ply weight enumerator.
Physical and electrical characterization of ALCVDTM TiN and WNxCy used as a copper diffusion barrier in dual damascene backend structures(08.2)
Authors: Steven Smith, Wei-Min Li, Kai-Erik Elers, Klaus Pfeifer
Venue: Microelectronic Engineering (2002)

The application of copper diffusion barrier films deposited by atomic layer deposition (ALD, ALCVD™) on functional multilevel, dual damascene structures is in its infancy. In this study, two different ALD barrier films (TiN and WNC) were evaluated to determine how they affected the electrical properties of two-metal layer, dual damascene copper structures built in SiO2. In addition, bulk properties of each film were evaluated. It was found that ALD films show feasibility of functioning electrically in fully integrated interconnect structures as well as acting as a copper diffusion barrier and copper adhesion layer.
Map Learning and Clustering in Autonomous Systems
Authors: D. Maio, S. Rizzi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Building autonomous systems, self-learning while moving in an unknown environment, finds a variety of challenging applications. This paper presents a new approach, called clustering by discovery, for identification of clusters in a map which is being learned by exploration. The concomitance of exploration and clustering, we argue, is a mandatory feature for an autonomous system, hence the clustering technique we propose is an incremental process performed while the system is learning the map. Clusters supply an abstract description of the environment and can be used to decrease the complexity of the navigational tasks. The environment is viewed as a map of distinctive places which we assume to be sensed and recognized by the system. The presence of distinctive places and the environment scale are the only facts which we assume known apriori to the system. Clustering by discovery is based on a heuristic indicator called scattering, whose increment is minimized at each exploration step compatibly with a connectivity constraint imposed on clusters. Scattering is defined according to a number of functional and structural requirements. Two variants are presented, and their performance is discussed on a sample of maps including a real urban map and some randomly generated ones. In particular, one of the variants shows robust behaviour in terms of independence of the exploration strategy adopted.
Towards Flexible Teamwork in Persistent Teams: Extended Report
Authors: Milind Tambe, Weixiong Zhang
Venue: Autonomous Agents and Multi-Agent Systems (2000)

Teamwork is a critical capability in multi-agent environments. Many such environments mandate that the agents and agent-teams must be persistent i.e., exist over long periods of time. Agents in such persistent teams are bound together by their long-term common interests and goals. This paper focuses on flexible teamwork in such persistent teams. Unfortunately, while previous work has investigated flexible teamwork, persistent teams remain unexplored. For flexible teamwork, one promising approach that has emerged is model-based, i.e., providing agents with general models of teamwork that explicitly specify their commitments in teamwork. Such models enable agents to autonomously reason about coordination. Unfortunately, for persistent teams, such models may lead to coordination and communication actions that while locally optimal, are highly problematic for the team's long-term goals. We present a decision-theoretic technique based on Markov decision processes to enable persistent teams to overcome such limitations of the model-based approach. In particular, agents reason about expected team utilities of future team states that are projected to result from actions recommended by the teamwork model, as well as lower-cost (or higher-cost) variations on these actions. To accommodate real-time constraints, this reasoning is done in an any-time fashion. Implemented examples from an analytic search tree and some real-world domains are presented.
A Loop Transformation Theory and an Algorithm to Maximize Parallelism
Authors: M. E. Wolf, M. S. Lam
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

An approach to transformations for general loops in which dependence vectors represent precedence constraints on the iterations of a loop is presented. Therefore, dependences extracted from a loop nest must be lexicographically positive. This leads to a simple test for legality of compound transformations: any code transformation that leaves the dependences lexicographically positive is legal. The loop transformation theory is applied to the problem of maximizing the degree of coarse- or fine-grain parallelism in a loop nest. It is shown that the maximum degree of parallelism can be achieved by transforming the loops into a nest of coarsest fully permutable loop nests and wavefronting the fully permutable nests. The canonical form of coarsest fully permutable nests can be transformed mechanically to yield maximum degrees of coarse- and/or fine-grain parallelism. The efficient heuristics can find the maximum degrees of parallelism for loops whose nesting level is less than five.
A 'Virtual Body' Model for Surgical Education and Rehearsal
Authors: K. h. Höhne, Bernhard Pflesser, Andreas Pommert, Martin Riemer, Thomas Schiemann, Rainer Schubert, Ulf Tiede
Venue: Computer (1996)

The risk and duration of a surgical intervention can be greatly reduced with the successful generation of a model of the human body that allows surgery to be simulated realistically. Computerized anatomy representations described so far do not meet this requirement. The authors describe a true space-filling "virtual body" model that overcomes the drawbacks of earlier systems. The key idea underlying the new approach is to combine in a single framework a detailed spatial model enabling realistic visualization with a symbolic model of human anatomy. The spatial model is derived from a living person with computerized and magnetic resonance tomography. The symbolic model--implemented with the technique of semantic networks--contains standard textbook knowledge. The resulting virtual-body model allows the computer user to act like a virtual anatomist, radiologist, or surgeon.
Rapid Digital System Prototyping: Current Practice, Future Challenges
Authors: Vijay K. Madisetti
Venue: IEEE Design Test (1996)

The successful Rapid Prototyping of Application-Specific Signal Processors (RASSP) program of the US Department of Defense (DARPA and Tri-Services) targets a 4X improvement in the design, prototyping, manufacturing, and support processes (relative to current practice). We present a "current industrial system design practice (circa 1993)" model for the design and prototyping of application-specific signal processors developed as part of the DARPA's RASSP Education & Facilitation (E&F) Program. A number of limitations in current design practice are highlighted together with a number of candidate RASSP solutions, and some of the future challenges.
Achieving fast and exact hazard-free logic minimization of extended burst-mode gC finite state machines
Authors: Hans Jacobson, Chris Myers, Ganesh Gopalakrishnan
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

This paper presents a new approach to two-level hazard-free logic minimization in the context of extended burst-mode finite state machine synthesis targeting generalized C-elements (gC). No currently available minimizers for literal-exact two-level hazard-free logic minimization of extended burst-mode gC controllers can handle large circuits without synthesis times ranging up over thousands of seconds. Even existing heuristic approaches take too much time when iterative exploration over a large design space is required and do not yield minimum results. The logic minimization approach presented in this paper is based on state graph exploration in conjunction with single-cube cover algorithms, an approach that has not been considered for minimization of extended burst-mode finite state machines previously. Our algorithm achieves very fast logic minimization by introducing compacted state graphs and cover tables and an efficient single-cube cover algorithm for single-output minimization. Our exact logic minimizer finds minimal number of literal solutions to all currently available benchmarks, in less than one second on a 333 MHz microprocessor -- more than three orders of magnitude faster than existing literal exact methods, and over an order of magnitude faster than existing heuristic methods for the largest benchmarks. This includes a benchmark that has never been possible to solve exactly in number of literals before.
A finite element study of the effect of friction in orthogonal metal cutting
Authors: Guoqin Shi, Xiaomin Deng, Chandrakanth Shet
Venue: Finite Elements in Analysis and Design (2002)

The process of orthogonal metal cutting is studied with the finite element method under plane strain conditions. A computational procedure has been developed for simulating orthogonal metal cutting using a general-purpose finite element code. The focus of the results presented in this paper is on the effect of friction on thermomechanical quantities in a metal cutting process. A series of finite element simulations have been performed, in which a modified Coulomb friction law is used to model the friction along the tool-chip interface, and a finite element nodal release procedure is adopted to simulate chip separation from the workpiece. A tool rake angle ranging from 15deg; to 30deg; and a friction coefficient ranging from 0.0 to 0.6 have been considered in the simulations. The results of these simulations are consistent with experimental observations in the literature. In particular, it is found that shear straining is localized in the primary shear zone while the material near the tool tip undergoes the largest plastic strain rate. However, the maximum temperature rise, which is induced by energy dissipation due to plasticity and friction, occurs along the tool-chip interface, not in the primary shear zone. Furthermore, the maximum temperature, the contact length, the shear angle, and the cutting force are found to depend strongly on the coefficient of friction.
A Method for Consistent Fault Coverage Reporting
Authors: Warren H. Debany Jr., Kevin A. Kwiat, Sami A. Al-Arian
Venue: IEEE Design Test (1993)

Procedure 5012 of Mil-Std-883, which describes requirements for the logic model, the assumed fault model and universe, fault classing, fault simulation and reporting of test results for digital microcircuits is described. The procedure provides a consistent means of measuring fault coverage regardless of the specific logic and fault simulator used. Procedure 5012 addresses complex, embedded structures such as random-access memories (RAMs), read-only memories (ROMs), and programmable logic arrays (PLAs) weighting gate-level and non-gate-level structures by transistor counts to arrive at overall fault coverage.
Introducing the IA-64 Architecture
Authors: Jerry Huck, Dale Morris, Jonathan Ross, Allan Knies, Hans Mulder, Rumi Zahir
Venue: IEEE Micro (2000)

Advances in microprocessor design, integrated circuits, and compiler technology have increased the interest in parallel instruction execution. The IA-64 processor instruction set architecture has been designed with parallelism in mind.
Iterative Instructions in the Manchester Dataflow Computer
Authors: A. P. W. Böhm, J. R. Gurd
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

The authors investigate the nature and extent of the benefits and adverse effects of iterative instructions in the prototype Manchester Dataflow Computer. Iterative instructions are shown to be highly beneficial in terms of the number of instructions executed and the number of tokens transferred between modules during a program run. This benefit is apparent at hardware level, giving significantly reduced program execution times. However, the full benefits are not realized due to interference between lengthy iterative instructions. It is suggested that restructuring of buffers and the function unit array in the prototype hardware configuration can reduce this interference. Other possibilities for improvement are suggested. For example, the slowdown effect observed in hardware speedup curves could be tackled by treating iterative instructions differently from fine-grain instructions. An alternative structure for the processing element in which certain function units are specialized for executing iterative instructions is being investigated in this connection.
Software-Reliability Engineering: Technology for the 1990s
Authors: John D. Musa, William W. Everett
Venue: IEEE Software (1990)

The author traces the US history of invention and technology transfer from the 1700s to the present and asks whether software development can stop being a process-centered cottage industry by the application of interchangeable parts technology. He maintains that a revolution is needed to accomplish this and outlines the steps of such a revolution. The author clarifies the meaning of object oriented, discusses the value rigidity trap, and provides a commercial example of the approach that he advocates.
EOS: A Real-Time Operating System Adapts to Application Architectures
Authors: Gianluigi Castelli, Gianluca Ragazzini
Venue: IEEE Micro (1995)

Rather than dictating the architecture of application software and hardware, a real-time operating system should be flexible enough to adapt to the application¿s needs. The EOS real-time operating system provides a modular, scalable software platform users can tailor to specific custom hardware architectures. Developers can use minimum configurations of EOS for simple systems or enhance it with their own code for complex systems. Ultimately, we provide a configurable software platform that helps embedded application developers create low-cost, time-effective products.
High-Order Algorithms for Large-Eddy Simulation of Incompressible Flows
Authors: R. Pasquetti, C. J. Xu
Venue: Journal of Scientific Computing (2002)

&ldquo;Defiltering-Transport-Filtering&rdquo; (DTF) algorithms are proposed for the large eddy simulation of incompressible flows by using high order methods. These new algorithms are based (i) on an approximate deconvolution method for the modeling of the sub-grid scale stress tensor and (ii) on a semi-Lagrangian method to handle the convective term. Such algorithms are implemented in 3D spectral solvers (one homogeneous direction), using differential operators to handle in an approximate way the filtering and defiltering operations. Stability and dissipation properties of the schema are discussed. Preliminary results, obtained with a Chebyshev collocation solver, for the 3D wake of a cylinder with Reynolds number equal to 1000 are presented.