ppxscal/embedding_network huggingface dataset:
Resource-Oriented Multicommodity Market Algorithms
Authors: Fredrik Ygge, Hans Akkermans
Venue: Autonomous Agents and Multi-Agent Systems (2000)

In search for market equilibrium in multicommodity markets, price-oriented schemes are normally used. That is, a set of prices (one price for each commodity) is updated until supply meets demand for each commodity. In some cases such an approach is rather inefficient, and a resource-oriented scheme can be highly competitive. In a resource-oriented scheme the allocations are updated until the market equilibrium is found. It is well known that in a two-commodity market resource-oriented schemes are possible. In this article we show that resource-oriented algorithms can be used for the general multicommodity case as well, and present and analyze an algorithm. The algorithm has been implemented and some performance properties, for a specific example, are presented.
Multiprocessors from a Software Perspective
Authors: Saman P. Amarasinghe, Jennifer M. Anderson, Christopher S. Wilson, Shih-Wei Liao, Brian R. Murphy, Robert S. French, Monica S. Lam, Mary W. Hall
Venue: IEEE Micro (1996)

Multiprocessor systems have become common place, but little software takes advantage of their capabilities. Automatic parallelization is particularly attractive as it enables sequential code to exploit parallel hardware and realize improved performance, without additional programmer effort. This article demonstrates that automatic parallelization techniques are now mature enough to parallelize many numeric programs written in both Fortran and C. Using these techniques, the SPEC92fp and SPEC95fp benchmarks were successfully parallelized and run on an 8-processor Digital AlphaServer 8400 machine to obtain the highest recorded SPEC92fp and SPEC95fp ratios. The capabilities of state-of-the-art parallelizing compilers should be taken into account in future processor design. A multiprocessor in combination with a parallelizing compiler may outperform approaches to processor design which attempt to exploit increasing levels of instruction-level parallelism.
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping
Authors: Witold Litwin, Tore Risch
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

LH*g is a high-availability extension of the LH* Scalable Distributed Data Structure. An LH*g file scales up with constant key search and insert performance, while surviving any single-site unavailability (failure). We achieve high-availability through a new principle of record grouping. A group is a logical structure of up to k records, where k is a file parameter. Every group contains a parity record allowing for the reconstruction of an unavailable member. The basic scheme may be generalized to support the unavailability of any number of sites, at the expense of storage and messaging. Other known high-availability schemes are static, or require more storage, or provide worse search performance.
Neural methods for antenna array signal processing: a review
Authors: K.-L Du, A. K. Y. Lai, K. K. M. Cheng, M. N. S. Swamy
Venue: Signal Processing (2002)

The neural method is a powerful nonlinear adaptive approach in various signal-processing scenarios. It is especially suitable for real-time application and hardware implementation. In this paper, we review its application in antenna array signal processing. This paper also serves as a tutorial to the neural method for antenna array signal processing.
A genetic algorithm for finding the pagenumber of interconnection networks
Authors: Nidhi Kapoor, Mark Russell, Ivan Stojmenovic, Albert Y. Zomaya
Venue: Journal of Parallel and Distributed Computing (2002)

A "book-embedding" of a graph G comprises embedding the graph's nodes along the spine of a book and embedding the edges on the pages so that the edges embedded on the same page do not intersect. This is also referred to as the page model. The "pagenumber" of a graph is the thickness of the smallest (in number of pages) book into which G can be embedded. The problem has been studied only for some specific kind of graphs. The pagenumber problem is known to be NP-complete, even if the order of nodes on the spine is fixed. Using genetic algorithms, we describe the first algorithm for solving the pagenumber problem that can be applied on arbitrary graphs. Experimental results for several kinds of graphs are obtained. We were particularly interested in graphs that correspond to some well-known interconnection networks (such as hypercubes and meshes). We also introduced and experimented with 2-D pagenumber model for embedding graphs.
Optimal and Efficient Probabilistic Distributed Diagnosis Schemes
Authors: S. Lee, K. G. Shin
Venue: IEEE Transactions on Computers (1993)

The distributed self-diagnosis of a multiprocessor/multicomputer system based on interprocessor tests with imperfect fault coverage that permits intermittently faulty processors is addressed. Focusing on probabilistic diagnosis methods, the authors define several different categories of probabilistic diagnosis based on the type of fault syndrome information used in the diagnosis. Rigorous probabilistic analysis is then used to derive diagnosis algorithms optimal in terms of diagnostic accuracy for the diagnosis categories introduced. Analysis and simulations are used to evaluate the performance of the diagnosis algorithms introduced.
A framework for performance evaluation and optimization of an emerging multimedia DS-CDMA network
Authors: Vladimir Marbukh
Venue: Proceedings of the 4th ACM international workshop on Wireless mobile multimedia (2001)

This paper proposes a framework for performance evaluation and optimization of an emerging multimedia, packet Direct-Sequence Code Division Multiple Access (DS-CDMA) network with a wide range of Quality of Service (QoS) requirements on losses and delays. The need for a new framework arises from inability of the traditional approach, based on the outage probability, to capture the queueing aspects of DS-CDMA network behavior in presence of delay tolerant traffic. Accounting for these aspects becomes essential for emerging multimedia DS-CDMA networks attempting to approach their capacity limits by using coding and spreading gain control, retransmissions, as well as transmission scheduling/power control. Since in a DS-CDMA network transmissions compete for simultaneous access to several resources, including wireless bandwidth and transmission power, the paper proposes to approximate the feasible QoS region for the network by the intersection of the feasible QoS regions for the corresponding single-resource systems. The feasible QoS region for a single-resource system is estimated by using M / G / 1 conservation laws. Based on this "bottleneck resource" approximation, the paper estimates the admission region for the network and outlines the approach to the network management aimed at maximizing the admission region.
Flexible Syntactic Matching of Curves and Its Application to Automatic Hierarchical Classification of Silhouettes
Authors: Yoram Gdalyahu, Daphna Weinshall
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

Curve matching is one instance of the fundamental correspondence problem. Our flexible algorithm is designed to match curves under substantial deformations and arbitrary large scaling and rigid transformations. A syntactic representation is constructed for both curves and an edit transformation which maps one curve to the other is found using dynamic programming. We present extensive experiments where we apply the algorithm to silhouette matching. In these experiments, we examine partial occlusion, viewpoint variation, articulation, and class matching (where silhouettes of similar objects are matched). Based on the qualitative syntactic matching, we define a dissimilarity measure and we compute it for every pair of images in a database of 121 images. We use this experiment to objectively evaluate our algorithm: First, we compare our results to those reported by others. Second, we use the dissimilarity values in order to organize the image database into shape categories. The veridical hierarchical organization stands as evidence to the quality of our matching and similarity estimation.
Adopting GQM-Based Measurement in an Industrial Environment
Authors: Frank van Latum, Rini van Solingen, Markku Oivo, Barbara Hoisl, Dieter Rombach, Günther Ruhe
Venue: IEEE Software (1998)

Although software engineers generally agree that software measurement must be goal oriented, little has been published on the results of shifting to goal-orientation and still less on how to systematically make that transition. Thus, when we at Schlumberger RPS decided to adopt the Goal/Question/Metric approach, we resolved to document each step and record our experiences at each stage of the transition. This article is both a summary of our experiences and a brief description of how the GQM approach has greatly improved our measurement programs. We have tried to describe the activities in our measurement programs in a way that will help more organizations shift to goal-oriented measurement. We hope that others will also document their efforts so that the software engineering community can better understand the benefits of the GQM approach.
Well-graded spaces of valued sets
Authors: Sergei Ovchinnikov
Venue: Discrete Mathematics (2002)

Well-graded spaces of valued sets and relations are introduced and their properties are investigated. In particular, it is shown that the space of valued partial orders on a finite set is well-graded. This is a generalization of a well-known result of Bogart (J. Math. Soc. 3 (1973) 49). Motivation for these studies comes from media theory (Falmagne, J. Math. Psych. 41 (2) (1997) 129; Discrete Appl. Math., submitted) where well-graded families of usual sets play an important role.
Mixed-Signal Circuit Classification in a Pseudo-Random Testing Scheme
Authors: C. Marzocca, F. Corsi
Venue: Journal of Electronic Testing: Theory and Applications (2002)

Pseudo-random testing techniques for mixed-signal circuits offer several advantages compared to explicit time-domain and frequency-domain test methods, especially in a BIST structure. To fully exploit these advantages a suitable choice of the pseudo-random input parameters should be done and an investigation on the accuracy of the circuit response samples needed to reduce the risk of misclassification should be carried out. Here these issues have been addressed for a testing scheme based on the estimation of the impulse response of the device under test (DUT) by means of input-output cross-correlation. Moreover, new acceptance criteria for the DUT are suggested which solve some ambiguity problems arising if the classification of the DUT as good or bad is based on a few samples of the cross-correlation function. Examples of application of the proposed techniques to real cases are also shown in order to assess the impact of the measurement system inaccuracies on the reliability of the test.
A Software Engineering Tool for Expert System Design
Authors: Joan M. Francioni, Abraham Kandel
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The properties of design tools for expert systems are identified. A design tool is presented for constructing production-type knowledge bases that provides a straightforward methodology and adheres to these properties. The use of decision tables in software design is discussed, and a modified table that can be used for the present application is presented.
An alternative to model selection in ordinary regression
Authors: Nicholas T. Longford
Venue: Statistics and Computing (2003)

The weaknesses of established model selection procedures based on hypothesis testing and similar criteria are discussed and an alternative based on synthetic (composite) estimation is proposed. It is developed for the problem of prediction in ordinary regression and its properties are explored by simulations for the simple regression. Extensions to a general setting are described and an example with multiple regression is analysed. Arguments are presented against using a selected model for any inferences.
Isometric embedding by surface reconstruction from distances
Authors: Ingrid Hotz
Venue: Proceedings of the conference on Visualization '02 (2002)

To display the intuitive meaning of an abstract metric it is helpful to look on an embedded surface with the same inner geometry as the given metric. The resulting partial differential equations have no standard solution. Only for some special cases satisfactory methods are known. I present a new algorithmic approach which is not based on differential equations. In contrast to other methods this technique also works if the embedding exists only locally. The fundamental idea is to estimate Euclidean distances, from which the surface is built up. In this paper I focus on the reconstruction of a surface from these estimated distances. Particular the influence of a perturbation of the distances on the shape of the resulting surface is investigated.
Minimizing the number of successor states in the stubborn set method
Authors: Kimmo Varpaaniemi
Venue: Fundamenta Informaticae (2002)

Combinatorial explosion which occurs in parallel compositions of LTSs can be alleviated by letting the stubborn set method construct on-the-fly a reduced LTS that is CFFD- or CSP-equivalent to the actual parallel composition. This article considers the problem of minimizing the number of successor states of a given state in the reduced LTS. The problem can be solved by constructing an and/or-graph with weighted vertices and by finding a set of vertices that satisfies a certain constraint such that no set of vertices satisfying the constraint has a smaller sum of weights. Without weights, the and/or-graph can be constructed in low-degree polynomial time w.r.t. the length of the input of the problem. However, since actions can be nondeterministic and transitions can share target states, it is not known whether the weights are generally computable in polynomial time. Consequently, it is an open problem whether minimizing the number of successor states is as "easy" as minimizing the number of successor transitions.
Achieving Robustness and Minimizing Overhead in Parallel Algorithms Through Overlapped Communication/Computation
Authors: Arun K. Somani, Allen M. Sansano
Venue: The Journal of Supercomputing (2000)

One of the major goals in the design of parallel processing machines and algorithms is to achieve robustness and reduce the effects of the overhead introduced when a given problem is parallelized or a fault occurs. A key contributor to overhead is communication time, in particular when a node is faulty and another node is substuiting for its operation. Many architectures try to reduce this overhead by minimizing the actual time for a communication to occur, including latency and bandwidth figures. Another approach is to hide communication by overlapping it with computation assuming that the computation is the most prominent factor. This paper presents the mechanisms provided in the Proteus parallel computer and its effective use of communication hiding through overlapping communication/computation techniques with and without the presence of a fault. These techniques are easily extended for use in compiler support of parallel programming. We also address the complexity (or rather simplicity) in achieving complete exchange on the Proteus Machine.
Fast Updating Algorithms for TCAMs
Authors: Devavrat Shah, Pankaj Gupta
Venue: IEEE Micro (2001)

One popular hardware device for performing fast routing lookups and packet classification is a ternary content-addressable memory (TCAM). We propose two algorithms to manage the TCAM such that incremental update times remain small in the worst case.
A Systolic-Based Parallel Bin Packing Algorithm
Authors: J. O. Berkey, P. Y. Wang
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

A systolic based parallel approximation algorithm that obtains solutions to the I-D bin packing problem is presented. The algorithm has an asymptotic error bound of 1.5 and time complexity O(n). An experimental study demonstrates that the heuristic offers improved packing and execution performance over parallelizations of two well-known serial algorithms.
High-performance data mining with skeleton-based structured parallel programming
Authors: Massimo Coppola, Marco Vanneschi
Venue: Parallel Computing (2002)

We show how to apply a structured parallel programming (SPP) methodology based on skeletons to data mining (DM) problems, reporting several results about three commonly used mining techniques, namely association rules, decision tree induction and spatial clustering. We analyze the structural patterns common to these applications, looking at application performance and software engineering efficiency. Our aim is to clearly state what features a SPP environment should have to be useful for parallel DM. Within the skeleton-based PPE SkIE that we have developed, we study the different patterns of data access of parallel implementations of Apriori, C4.5 and DBSCAN. We need to address large partitions reads, frequent and sparse access to small blocks, as well as an irregular mix of small and large transfers, to allow efficient development of applications on huge databases. We examine the addition of an object/component interface to the skeleton structured model, to simplify the development of environment integrated, parallel DM applications.
Predicting Software Reliability
Authors: Alan Wood
Venue: Computer (1996)

Software vendors need to know if their products are reliable before they are delivered to customers. Software reliability growth models help provide that information. Unfortunately, very little real data from commercial applications have been published about the utility of these models, possibly because of the proprietary nature of the data. Using transformed data to protect proprietary information, this article reports Tandem's experience with software reliability growth models. The data involves products for four major software releases. The author and his colleagues at Tandem collected defect occurrence times during system test and statistically correlated the data with known mathematical functions, using eight software reliability growth models. The authors found that, although they are still in the experimental stage, software reliability growth models can be used to provide reasonable predictions of the number of defects remaining, which is an indication of whether software is ready to release to customers. The results show that predictions from simple models of defect occurrence times correlate reasonably well with field data. However, the many choices for data representation and model type must be evaluated across multiple software releases to determine the appropriate models and obtain confidence in the results.
Fuzzy Logic Microcontroller
Authors: Alessandra Costa, Alessandro De Gloria, Fabrizio Giudici, Mauro Olivieri
Venue: IEEE Micro (1997)

We present a 16 bit microcontroller with hardware support for fuzzy logic. We show that special support both at the instruction level and at the micro-architecture level allows a remarkable speed up for fuzzy logic control algorithms. The fuzzy logic support has been concurrently studied at the hardware and software level to reach a synergy by the codesign approach. Moreover we propose a template for fuzzy control applications specifically studied to reduce the memory accesses during the algorithm execution. All these resorts lead to a speed-up factor of more than two in fuzzy logic computation. The microcontroller has also been designed for executing typical control applications and has been tested on traditional benchmarks. All the design cycle has constantly aimed to optimize the cost performance trade-off to define a cost effective architecture that can be applied in a large spectrum of applications.
A comparison of spectral smoothing methods for segment concatenation based speech synthesis
Authors: David T. Chappell, John H. L. Hansen
Venue: Speech Communication (2002)

There are many scenarios in both speech synthesis and coding in which adjacent time-frames of speech are spectrally discontinuous. This paper addresses the topic of improving concatenative speech synthesis with a limited database by proposing methods to smooth, adjust, or interpolate the spectral transitions between speech segments. The objective is to produce natural-sounding speech via segment concatenation when formants and other spectral features do not align properly. We consider several methods for adjusting the spectra at the boundaries between waveform segments. Techniques examined include optimal coupling, waveform interpolation (WI), linear predictive parameter interpolation, and psychoacoustic closure. Several of these algorithms have been previously developed for either coding or synthesis, while others are enhanced. We also consider the connection between speech science and articulation in determining the type of smoothing appropriate for given phoneme-phoneme transitions. Moreover, this work incorporates the use of a recently-proposed auditory-neural based distance measure (ANBM), which employs a computational model of the auditory system to assess perceived spectral discontinuities. We demonstrate how actual ANBM scores can be used to help determine the need for smoothing. In addition, formal evaluation of four smoothing methods, using the ANBM and extensive listener tests, reveals that smoothing can distinctly improve the quality of speech but when applied inappropriately can also degrade the quality. It is shown that after proper spectral smoothing, or spectral interpolation, the final synthesized speech sounds more natural and has a more continuous spectral structure.
Hybrid Load-Value Predictors
Authors: Martin Burtscher, Benjamin G. Zorn
Venue: IEEE Transactions on Computers (2002)

Load instructions diminish processor performance in two ways. First, due to the continuously widening gap between CPU and memory speed, the relative latency of load instructions grows constantly and already slows program execution. Second, memory reads limit the available instruction-level parallelism because instructions that use the result of a load must wait for the memory access to complete before they can start executing. Load-value predictors alleviate both problems by allowing the CPU to speculatively continue processing without having to wait for load instructions, which can significantly improve the execution speed. While several hybrid load-value predictors have been proposed and found to work well, no systematic study of such predictors exists. In this paper, we investigate the performance of all hybrids that can be built out of a register value, a last value, a stride 2-delta, a last four value, and a finite context method predictor. Our analysis shows that hybrids can deliver 25 percent more speedup than the best single-component predictors. An examination of the individual components of hybrids revealed that predictors with a poor standalone performance sometimes make excellent components in a hybrid, while combining well-performing individual predictors often does not result in an effective hybrid. Our hybridization study identified the register value + stride 2-delta predictor as one of the best two-component hybrids. It matches or exceeds the speedup of two-component hybrids from the literature in spite of its substantially smaller and simpler design. Of all the predictors we studied, the register value + stride 2-delta + last four value hybrid performs best. It yields a harmonic-mean speedup over the eight SPECint95 programs of 17.2 percent.