ppxscal/embedding_network huggingface dataset:
Parameterized RTL power models for combinational soft macros
Authors: Alessandro Bogliolo, Roberto Corgnati, Enrico Macii, Massimo Poncino
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We propose a new RTL power macromodel that is suitable for re-configurable, synthesizable soft-macros. The model is parameterized with respect to the input data size (i.e., bit-width), and can be automatically scaled with respect to different technology libraries and/or synthesis options. Scalability is obtained through a single additional characterizations run, and does not require the disclosure of any intellectual property. The model is derived from empirical analysis of the sensitivity of power on input statistics, input data size and technology. The experiments prove that, with limited approximation, it is possible to de-couple the effects on power of these three factors. The proposed solution is innovative, since no previous macromodel supports automatic technology scaling, and yields estimation errors within 15%.
PSCR: A Coherence Protocol for Eliminating Passive Sharing in Shared-Bus Shared-Memory Multiprocessors
Authors: Roberto Giorgi, Cosimo Antonio Prete
Venue: IEEE Transactions on Parallel and Distributed Systems (1999)

In high-performance general-purpose workstations and servers, the workload can be typically constituted of both sequential and parallel applications. Shared-bus shared-memory multiprocessor can be used to speed-up the execution of such workload. In this environment, the scheduler takes care of the load balancing by allocating a ready process on the first available processor, thus producing process migration. Process migration and the persistence of private data into different caches produce an undesired sharing, named passive sharing. The copies due to passive sharing produce useless coherence traffic on the bus and coping with such a problem may represent a challenging design problem for these machines. Many protocols use smart solutions to limit the overhead to maintain coherence among shared copies. None of these studies treats passive-sharing directly, although some indirect effect is present while dealing with the other kinds of sharing. Affinity scheduling can alleviate this problem, but this technique does not adapt to all load conditions, especially when the effects of migration are massive. We present a simple coherence protocol that eliminates passive sharing using information from the compiler that is normally available in operating system kernels. We evaluate the performance of this protocol and compare it against other solutions proposed in the literature by means of enhanced trace-driven simulation. We evaluate the complexity in terms of the number of protocol states, additional bus lines, and required software support. Our protocol further limits the coherence-maintaining overhead by using information about access patterns to shared data exhibited in parallel applications.
Using accurate arithmetics to improve numerical reproducibility and stability in parallel applications
Authors: Yun He, Chris H. Q. Ding
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

Numerical reproducibility and stability of large scale scientific simulations, especially climate modeling, on distributed memory parallel computers are becoming critical issues. In particular, global summation of distributed arrays is most susceptible to rounding errors, and their propagation and accumulation cause uncertainty in final simulation results. We analyzed several accurate summation methods and found that two methods are particularly effective to improve (ensure) reproducibility and stability: Kahan's self-compensated summation and Bailey's double-double precision summation. We provide an MPI operator MPLSUMDD to work with MPI collective operations to ensure a scalable implementation on large number of processors. The final methods are particularly simple to adopt in practical codes.
Stochastic Calculus for Fractional Brownian Motion I. Theory
Authors: Tyrone E. Duncan, Yaozhong Hu, Bozenna Pasik-Duncan
Venue: SIAM Journal on Control and Optimization (2000)

In this paper a stochastic calculus is given for the fractional Brownian motions that have the Hurst parameter in (1/2, 1). A stochastic integral of Itô type is defined for a family of integrands so that the integral has zero mean and an explicit expression for the second moment. This integral uses the Wick product and a derivative in the path space. Some Itô formulae (or change of variables formulae) are given for smooth functions of a fractional Brownian motion or some processes related to a fractional Brownian motion. A stochastic integral of Stratonovich type is defined and the two types of stochastic integrals are explicitly related. A square integrable functional of a fractional Brownian motion is expressed as an infinite series of orthogonal multiple integrals.
Network communities: supporting distributed field organizations
Authors: John C. Tang, Nicole Yankelovich
Venue: ACM SIGGROUP Bulletin (1998)

Network Communities is a new project starting in Sun Laboratories at Sun Microsystems, Inc. Our goal is to develop new technologies to support distributed work groups so that they can conveniently find the right expertise at the right time. Our experience in studying distributed work groups has indicated that accomplishing their work often relies on personal networking with their colleagues. For example, among the system support engineers who provide technical support to our customers, when a customer has a technical problem, the engineers sometimes need to network with their colleagues around the world to find out who has the right expertise to resolve their problem. This can be a hit or miss process, and the engineers are looking for ways of helping them be more efficient and effective in finding the right expertise at the right time.We've been intrigued with the popularity of virtual community technologies in on-line socializing, and particularly the ways they have engaged people to invest time and effort into building their community on-line. Studies of virtual communities suggest that they encourage people to engage in social networking [Wellman et al., 1996]. It's interesting to note that they achieve such engagement using relatively simple technology (typically text chat rooms), and usually without tangible rewards outside of the social status within the virtual community.We would like to apply virtual community technologies to help support the social networking that our distributed work groups need to do to accomplish their work. We plan to apply ethnographic methods to study how a particular distributed work group accomplishes their work, and use that information to guide the design of a prototype system to support their work [1]. We will then deploy that system into the work group and observe how they use it over time. Although we have not designed our system yet, we imagine the following scenario of use.
Symbolic computation of divided differences
Authors: W. Kahan, R. J. Fateman
Venue: ACM SIGSAM Bulletin (1999)

Divided differences are enormously useful in developing stable and accurate numerical formulas. For example, programs to compute f(x)-f(y) as might occur in integration, can be notoriously inaccurate. Such problems can be cured by approaching these computations through divided difference formulations. This paper provides a guide to divided difference theory and practice, with a special eye toward the needs of computer algebra systems that should be programmed to deal with these often-messy formulas.
Adaptive reduction parallelization techniques
Authors: Hao Yu, Lawrence Rauchwerger
Venue: Proceedings of the 14th international conference on Supercomputing (2000)

In this paper, we propose to adapt parallelizing transformations, more specifically, reduction parallelizations, to the actual reference pattern executed by a loop, i.e., to the particular input data and dynamic phase of a program. More precisely we will show how, after validating a reduction at run-time (when this is not possible at compile time) we can dynamically characterize its reference pattern and choose the most appropriate method for parallelizing it. For this purpose, we develop a library of parallel reduction algorithms, including both previously known and novel schemes, which includes algorithms specialized for different classes of access behavior. In particular, each algorithm in our library has identified strengths related to specific reference pattern characteristics, which are matched, at run-time, with measured characteristics of the actual reference pattern. The matching of algorithm to reference pattern is performed using a decision-tree based selection scheme. The contribution of this work consists in new optimizations for reduction parallelization and in the introduction of a new approach to the optimization of irregular applications: Characteristic based customization.
Compressions and Dilations of Numerical Ranges
Authors: J. Maroulas, M. Adam
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Inner and outer approximation of numerical ranges of n x n complex matrices and matrix polynomials is investigated in this paper, which is based on the numerical ranges of matrices of smaller or double dimensions.
Independence-reducible database schemes
Authors: Edward P. F. Chan, Hector J. Hernandez
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

A class of cover embedding database schemes, called independence-reducible, is proposed and is proven to be bounded and algebraic-maintainable, and therefore is highly desirable with respect to query answering and constraint enforcement. This class of schemes is shown to properly contain a superset of all previously known classes of cover embedding BCNF database schemes which are bounded (and constant-time-maintainable). An efficient algorithm is found which recognizes exactly this class of database schemes. Independence-reducible database schemes properly contain a class of constant-time-maintainable database schemes and a condition which characterizes this class of schemes is found, this condition can be tested efficiently. Throughout, it is assumed that a cover of the functional dependencies is embedded in the database scheme in the form of key dependencies.
KeyLinking: dynamic hypertext in a digital library
Authors: Bob Pritchett
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

This paper describes KeyLinking, a framework for dynamic resolution of soft and implied hypertext links to the most appropriate available resource at the time of usage.
A review of magnetic resonance (MR) imaging of trabecular bone micro-architecture: contribution to the prediction of biomechanical properties and fracture prevalence
Authors: S. Majumdar
Venue: Technology and Health Care (1998)

Bone mineral density and three-dimensional trabecular structure play a significant role in predicting bone strength and biomechanical properties. MR is a non-invasive technique for determining trabecular architecture both in vivo and in vitro. In this paper we review the use of magnetic resonance imaging to obtain high resolution images of trabecular bone structure and quantify the three-dimensional architecture of the trabecular bone network. Studies assessing the anisotropy of the trabecular architecture in human cadaveric specimens from the distal and proximal femur, and the thoracic and lumbar vertebrae, are reviewed. The contributions of the MR derived measures of 3D trabecular bone structure to the biomechanical strength of the specimen are presented. In vivo, the relationship between the high resolution MR derived trabecular bone structure parameters in the distal radius and calcaneus in patients with hip fractures, are compared to age matched normal controls. MR derived measures are compared to measures of trabecular bone mineral density (BMD) in the hip using dual X-ray absorptiometry (DXA).
Agent technology in computer science and engineering curriculum
Authors: Yi Shang, Hongchi Shi, Su-Shing Chen
Venue: ACM SIGCSE Bulletin (2000)

In recent years, agent technology has been used increasingly in information management and distributed computing. A CSE curriculum that cultivates the knowledge of agent technology will increase the likelihood that the next generation of IT professionals have the background needed to design and develop software systems that are scalable, reliable, adaptable, and secure. In this paper, we present the rationale and our practice in incorporating agent technology into the CSE curriculum. We develop agent-based teaching materials and software modules and apply them to existing CSE courses including artificial intelligence, parallel and distributed processing, networking, and software engineering. Promising results have been obtained in teaching two graduate level courses using agent components.
Hidden algebra and concurrent distributed software
Authors: Joseph Goguen
Venue: ACM SIGSOFT Software Engineering Notes (2000)

Cleverly designed software often fails to strictly satisfy its specifications, but instead satisfies them behaviorally, in the sense that they appear to be true under all possible experiments. Hidden algebra extends prior work on abstract data types and algebraic specification [2, 6] to concurrent distributed systems, in a surprisingly simple way that also handles nondeterminism, internal states, and more [4, 3]. Advantages of an algebraic approach include decidability results for problems that are undecidable for more expressive logics, and powerful algorithms like term rewriting and unification, for implementing equational logic tools. Much work in formal methods has addressed code verification, but since empirical studies show that little of software cost comes from coding errors, our approach focuses on behavioral specification and verification at the design level, thus avoiding the distracting complications of programming language semantics.
A Two-Level Method with Backtracking for the Navier--Stokes Equations
Authors: W. Layton, L. Tobiska
Venue: SIAM Journal on Numerical Analysis (1998)

We consider a two-level method for resolving the nonlinearity in finite element approximations of the equilibrium Navier--Stokes equations. The method yields L2 and H1 optimal velocity approximations and an L2 optimal pressure approximation. The two-level method involves solving one small, nonlinear coarse mesh system, one Oseen problem (hence, linear with positive definite symmetric part) on the fine mesh, and one linear correction problem on the coarse mesh. The algorithm we study produces an approximate solution with the optimal, asymptotic in h, accuracy for any fixed Reynolds number. We do not consider the behavior of the error for fixed h as $Re\rightarrow \infty$, i.e., for flows in transition to turbulence.
Engineering federated information systems: report of EEFIS '99 workshop
Authors: S. Conrad, W. Hasselbring, U. Hohenstein, R.-D. Kutsche, M. Roantree, G. Saake, F. Saltor
Venue: ACM SIGMOD Record (1999)

After the successful first International Workshop on Engineering Federated Database Systems (EFDBS'97) in Barcelona in June 1997 [CEH+ 97], the goal of this second workshop was to bring together researchers and practitioners interested in various issues in the development of federated information systems, whereby the scope has been extended to cover database and non-database information sources (the change from EFDBS to EFIS reflects this). This report provides details of the workshop content and the conclusions reached in the final discussion.
Supercomputers and distributed computing
Authors: David J. Kuck
Venue: Proceedings of the 1985 ACM thirteenth annual conference on Computer Science (1985)

Multiprocessor supercomputers and distributed systems share many common properties in a logical sense. The physical implementation of these systems may be quite different, particularly with respect to timing considerations. Some of the recent work on supercomputer hardware and software may be of use in the distributed processing community. We discuss some aspects of how to relate program and data structures to architectural models.
Phrase processing methods for Japanese text retrieval
Authors: Noriko Kando, Kyo Kageura, Masaharu Yoshioka, Keizo Oyama
Venue: ACM SIGIR Forum (1998)

This paper examines the effectiveness of different phrase identification and weighting methods for Japanese text retrieval in an operational information retrieval (IR) system, called NACSIS-IR. Based on our previous experiments, we used character-based indexing with positional information and word-or phrase-based query processing, which allowed us to implement sophisticated linguistic analysis on large-scale databases while maintaining adequate efficiency. The results of retrieval experiments on a large-scale Japanese test collection showed that the combination of enhanced phrase identification using patterns defined over part-of-speech tags and our algorithms Phrase2 and Phrase5 made a significant positive contribution to retrieval effectiveness. The paper also discusses indexing and phrase processing of Japanese or East Asian languages.
ServerWORKS manager: network management integrated with enterprise and applications servers
Authors: Katherine J. Jones
Venue: International Journal of Network Management (1997)

In response to the dilemma of increasing system costs and decreasing personnel costs, Digital Equipment Corporation has bundled ServerWORKS Manager with every Digital Prioris server. This provides the customer with a complete package of integrated network management software tools at no additional charge. &copy; 1997 John Wiley & Sons, Ltd.
The tangled Web we wove: a taskonomy of WWW use
Authors: Michael D. Byrne, Bonnie E. John, Neil S. Wehrle, David C. Crow
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

A prerequisite to the effective design of user interfaces is an understanding of the tasks for which that interface will actually be used. Surprisingly little task analysis has appeared for one of the most discussed and fastest-growing computer applications, browsing the World-Wide Web (WWW). Based on naturally-collected verbal protocol data, we present a taxonomy of tasks undertaken on the WWW. The data reveal that several previous claims about browsing behavior are questionable, and suggests that that widget-centered approaches to interface design and evaluation may be incomplete with respect to good user interfaces for the Web.
Two-Equation RNG Transport Modeling of High Reynolds Number Pipe Flow
Authors: Yansi Zhang, Steven A. Orszag
Venue: Journal of Scientific Computing (1998)

New solutions of two-equation RNG turbulence transport model are used to calculate high Reynolds number pipe flows. The results are compared with experimental &ldquo;Superpipe&rdquo; data of Zagarola et al. (1996) up to Reynolds number of 3.5 &times; 107.
LOF: identifying density-based local outliers
Authors: Markus M. Breunig, Hans-Peter Kriegel, Raymond T. Ng, Jörg Sander
Venue: ACM SIGMOD Record (2000)

For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common patterns. Existing work in outlier detection regards being an outlier as a binary property. In this paper, we contend that for many scenarios, it is more meaningful to assign to each object a degree of being an outlier. This degree is called the local outlier factor (LOF) of an object. It is local in that the degree depends on how isolated the object is with respect to the surrounding neighborhood. We give a detailed formal analysis showing that LOF enjoys many desirable properties. Using real-world datasets, we demonstrate that LOF can be used to find outliers which appear to be meaningful, but can otherwise not be identified with existing approaches. Finally, a careful performance evaluation of our algorithm confirms we show that our approach of finding local outliers can be practical.
High-Order Approximations and Generalized Necessary Conditions for Optimality
Authors: Urszula Ledzewicz, Heinz Schättler
Venue: SIAM Journal on Control and Optimization (1999)

In this paper we derive generalized necessary conditions for optimality for an optimization problem with equality and inequality constraints in a Banach space. The equality constraints are given in operator form as $Q=\{x\in X:F(x)=0\}$ where $F:X\rightarrow Y$ is an operator between Banach spaces; the inequality constraints are given by smooth functionals or by closed convex sets. Models of this type are common in the optimal control problem. The paper addresses the case when the Fréchet-derivative F '(x*)is not onto and hence the classical Lyusternik theorem does not apply to describe the tangent space to Q. In this case the classical Euler--Lagrange type necessary conditions are trivially satisfied, generating abnormal cases. A high-order generalization of the Lyusternik theorem derived earlier [U. Ledzewicz and H. Schättler, Nonlinear Anal., 34 (1998), pp. 793--815] is used to calculate high-order tangent cones to the equality constraint at points $x_{*}\in Q$ where F '(x*) is not onto. Combining these with high-order approximating cones related to the other constraints of the problem (feasible cones respectively cones of decrease) a high-order generalization of the Dubovitskii--Milyutin theorem is given and then applied to derive generalized necessary conditions for optimality. These conditions reduce to classical conditions for normal cases, but they give new and nontrivial conditions for abnormal cases.
Edge-Bandwidth of Graphs
Authors: Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West
Venue: SIAM Journal on Discrete Mathematics (1999)

The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly sharp bounds on the change in edge-bandwidth under addition, subdivision, or contraction of edges. We compute edge-bandwidth for Kn, Kn,n, caterpillars, and some theta graphs.
Note. Satisfying Due Dates in Large Job Shops
Authors: Thom J. Hodgson, Denis Cormier, Alexander J. Weintraub, Andrew Zozom,  Jr.
Venue: Management Science (1998)

For the multi-machine job shop scheduling problem, a conceptually simple simulation-based procedure (first proposed by Lawrence and Morton 1986) is shown to be both effective and efficient in providing optimal, or near optimal, schedules for minimizing the maximum lateness, Lmax. Computational experimentation is used to identify the conditions under which the approach is most viable.
Model structure and load balancing in optimistic parallel discrete event simulation
Authors: Tapas K. Som, Robert G. Sargent
Venue: Proceedings of the fourteenth workshop on Parallel and distributed simulation (2000)

The concept of strong groups is introduced to describe the structure of simulation models. It is shown that logical processes within strong groups process at approximately the same rate and that different strong groups can progress at different rates. An algorithm based on the rates of the strong groups is presented to balance the load among the physical processors and for flow control.