ppxscal/embedding_network huggingface dataset:
An efficient surface-based low-power buffer insertion algorithm
Authors: Rajeev R. Rao, David Blaauw, Dennis Sylvester, Charles J. Alpert, Sani Nassif
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Buffer insertion is an important technique used to achieve timing closure in high performance VLSI designs. As the number of buffers in ASIC designs has increased with process scaling, the power con-sumption of buffers has become a critical concern. In this paper, we present an efficient algorithm that performs van Ginneken style buffer insertion on RC trees and minimizes the total power con-sumption under a given delay constraint. Our algorithm is based on a formulation that uses a buffer library consisting of continuous buffer sizes. We construct solution candidates in the form of surfaces in the 3-D delay, capacitance and power (DCP) space and show the mecha-nisms to propagate and merge them in the interconnect tree. Instead of a single minimal power solution, the algorithm produces an entire DCP surface from which a suitable solution point can be selected. We also present a post-processing step where buffers with continu-ous (non-standard) sizes are snapped to discrete size values corre-sponding to the buffers in a given library. The proposed algorithm has a worst-case runtime complexity that is polynomial (quadratic) in the number of possible buffer locations. We implemented and tested our proposed algorithm on a number of large benchmark nets and observed that our method produces a speedup in runtime of 5-6X in comparison with previous power aware buffer insertion methods.
The fast Gauss transform with complex parameters
Authors: Fredrik Andersson, Gregory Beylkin
Venue: Journal of Computational Physics (2005)

We construct a fast method, O(NlogN), for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Gauss transform methods.
A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
Authors: Robin Pemantle
Venue: Journal of Algorithms (2005)

Gosper's algorithm is a cornerstone of automated summation of hypergeometric series. Milenkovic and Compton in 2002 gave an analysis of the run time of Gosper's algorithm applied to a random input. The main part of this was an asymptotic analysis of the random degree of the cancellation polynomial c(k) under various stipulated laws for the input. Their methods use probabilistic transform techniques. These results may also be obtained via probabilistic methods. Limit laws of the type proved by Milenkovic and Compton will be shown to follow from a general functional central limit theorem. Advantages to this approach include applicability to a more general class of input distributions and transparancy, in the sense that a non-quantitative limit theorem may be proved with no computation. A disadvantage to probabilistic methods is that one may typically derive only the leading term behavior. This is due to the inherent limit on precision in the Central Limit Theorem.
Do we need more web performance research?
Authors: Michael Rabinovich, Giovanni Pacifici, Michele Colajanni, Krithi Ramamritham, Bruce Maggs
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This panel will discuss the future and purpose of Web performance research, concentrating on the reasons for modest success in the adoption of research results in practice. The panel will in particular examine factors that hinder technology transfer in the Web performance area, consider examples of past successes and failures in this arena, and stimulate the discussion on how to make Web performance research more relevant.
Automatic Detection of Heads in Colored Images
Authors: Justin Garcia, Niels da Vitoria Lobo, Mubarak Shah, Jason Feinstein
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We use shape based searching to detect head contours of arbitrary size in single images. We begin by looking for a head model which is optimal for finding head contours of various orientations. Then we develop a search technique for finding contours of arbitrary size, and present a way in which the search space can be narrowed using color and intensity gradient information. We show results and discuss how the method could be improved.
Compiler-Directed Code Restructuring for Reducing Data TLB Energy
Authors: M. Kandemir, I. Kadayif, G. Chen
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Prior work on TLB power optimization considered circuit and architectural techniques. A recent software-based technique for data TLBs has considered the possibility of storing the frequently used virtual-to-physical address translations in a set of translation registers (TRs), and using them when necessary instead of going to the data TLB. This paper presents a compiler-based strategy for increasing the effectiveness of TRs. The idea is to restructure the application code in such a fashion that once a TR is loaded, its contents are reused as much as possible. Our experimental evaluation with six array-based benchmarks from the Spec2000 suite indicates that the proposed TR reuse strategy brings significant reductions in data TLB energy over an alternate strategy that employs TRs but does not restructure the code for TR reuse
A framework of greedy methods for constructing interaction test suites
Authors: Renée C. Bryce, Charles J. Colbourn, Myra B. Cohen
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Greedy algorithms for the construction of software interaction test suites are studied. A framework is developed to evaluate a large class of greedy methods that build suites one test at a time. Within this framework are many instantiations of greedy methods generalizing those in the literature. Greedy algorithms are popular when the time for test suite construction is of paramount concern. We focus on the size of the test suite produced by each instantiation. Experiments are analyzed using statistical techniques to determine the importance of the implementation decisions within the framework. This framework provides a platform for optimizing the accuracy and speed of "one-test-at-a-time" greedy methods.
Efficiency test of pseudorandom number generators using random walks
Authors: Mihyun Kang
Venue: Journal of Computational and Applied Mathematics (2005)

Markov chain Monte Carlo methods and computer simulations usually use long sequences of random numbers generated by deterministic rules, so-called pseudorandom number generators. Their efficiency depends on the convergence rate to the stationary distribution and the quality of random numbers used for simulations. Various methods have been employed to measure the convergence rate to the stationary distribution, but the effect of random numbers has not been much discussed. We present how to test the efficiency of pseudorandom number generators using random walks.
The BPEL Orchestrating Framework for Secured Grid Services
Authors: Pichet Amnuaykanjanasin, Natawut Nupairoj
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Workflow has been considered as a crucial component in several Grid projects. Among many workflow standards, BPEL, Business Process Execution Language, is emerging as a de-facto workflow standard in Grid and Web services communities. In this paper, we present the adoption of standard BPEL to orchestrate Grid services based on OGSI specification. Our approach is based on proxy services, which enable user to interact with OGSI Grid services supporting GSI security mechanisms, OGSI factory mechanism, and notification mechanism. Our proposed architecture is platform-neutral as it does not depend on any specific security architecture. With our implementation, the proxy services will be generated automatically for each target Grid service. Thus, they are not limited to pre-defined Grid services. In addition, our proxy services also remove designtime binding limitations of BPEL and allow user to define the binding information of proxy services in run-time. As our approach utilizes original BPEL specification without special modification, we believe that developing Grid applications on our architecture will benefit from standard BPEL-compliant tools and generic Web services tools. We illustrate the example of using our proposed framework by orchestrating drug discovery processes using BPEL and Grid services.
Application Development on the SRC Computers, Inc. Systems
Authors: Daniel S. Poznanovic
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

This paper describes application development for the SRC-6 system. Programs are written in high level programming languages of C and Fortran. The SRC-6 architecture is described, and performance advantage of Direct Execution Logic over microprocessors is explained. Optimizations available to programmers and example codes are discussed: 1) string searching, 2) median filter-edge detector.
Performance of 1 and 10 Gigabit Ethernet cards with server quality motherboards
Authors: Richard Hughes-Jones, Peter Clarke, Steven Dallison
Venue: Future Generation Computer Systems (2005)

System administrators often assume that just by plugging in a Gigabit Ethernet Interface, the system will deliver line rate performance; sadly this is not often the case. The behaviour of various 1 and 10 Gigabit Ethernet Network Interface cards (NICs) has been investigated using server quality motherboards. The latency, throughput, and the activity on the PCI buses and Gigabit Ethernet links were chosen as performance indicators. The tests were performed using two PCs connected back-to-back and sending UDP/IP frames from one to the other. This paper shows the importance of having a good combination of memory and peripheral bus chipset, Ethernet Interface, CPU power, good driver, and operating system designs and proper configuration to achieve and sustain gigabit transfer rates. With these considerations taken into account, and suitably designed hardware, transfers can operate at gigabit and multi-gigabit speeds. Some recommendations are given for high performance data servers.
Shock Filters Based on Implicit Cluster Separation
Authors: Vinay P. Namboodiri, Subhasis Chaudhuri
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

One of the classic problems in low level vision is image restoration. An important contribution toward this effort has been the development of shock filters by Osher and Rudin [15]. It performs image de-blurring using hyperbolic partial differential equations. In this paper we relate the notion of cluster separation from the field of pattern recognition to the shock filter formulation. A kind of shock filter is proposed based on the idea of gradient based separation of clusters. The proposed formulation is general enough as it can allow various models of density functions in the cluster separation process. The efficacy of the method is demonstrated through various examples.
Quadrinomial Modular Arithmetic using Modified Polynomial Basis
Authors: Christophe Negre
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Finite field arithmetic has advantageous space and time complexity when the field is constructed with a sparse polynomial.Katti and Brennan in [Low Complexity Multiplication in Finite Field Using Ring Representation] introduced a new type of polynomial, which we will call here the Nearly All One Polynomial (NAOP), and they show that NAOP modular arithmetic is roughly equivalent to quadrinomial arithmetic.In this paper we will introduce a new representation: the modified polynomial basis, to compute modulo quadrinomials.We obtain a faster bit-parallel multiplier in F_{2^n} with time complexity equal to T_A + (2 + [log¿ (n + 1)])T_X and a space complexity equal to (n + 1)^2 AND and ((N + 1)^2 + m - k - 1) XOR. For fields F_{2^n} of degree n ranging between 160 and 500, which cannot be constructed with an irreducible trinomial or an optimal normal basis, our multiplier improve by 8% the time complexity of the previous multipliers proposed of [7, 4, 9], in compensation the space complexity is increased by 1.5%.
Interactive navigation services through value-added CycloMedia panoramic images
Authors: Edward Verbree, Siyka Zlatanova, Kees Smit
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Most people have problems to understand the scenery of a city using just topographical maps and descriptive city guides. Especially maintaining the route by comparing the current position using the map and to get directions where to go by a written guidance is quite complicated. One possibility to increase the interaction between the map and the user is to use a handheld navigation system, in which a GPS receiver or another kind of locating tool is used to pinpoint the current location of the user in the map display. This approach solves the 'where am I' and 'where to go' questions and even the 'how to get there' problem when supported by a road-database. But the user still has to translate the information projected on the map to the real world and visa versa.This paper addresses a way out of this problem by avoiding the need of map information processing by applying panoramic images as the 'background' layer to display upon certain geometric features, guiding directions, and information labels. The company CycloMedia provides the panoramic images or so-called Cyclorama's. We give some directions how to decide which value-added information can be augmented within the Cyclorama and which not because real world features do obstruct it.
Efficient Algorithms for Mining and Incremental Update of Maximal Frequent Sequences
Authors: Ben Kao, Minghua Zhang, Chi-Lap Yip, David W. Cheung, Usama Fayyad
Venue: Data Mining and Knowledge Discovery (2005)

We study two problems: (1) mining frequent sequences from a transactional database, and (2) incremental update of frequent sequences when the underlying database changes over time. We review existing sequence mining algorithms including GSP, PrefixSpan, SPADE, and ISM. We point out the large memory requirement of Pref ixSpan, SPADE, and ISM, and evaluate the performance of GSP. We discuss the high I/O cost of GSP, particularly when the database contains long frequent sequences. To reduce the I/O requirement, we propose an algorithm MFS, which could be considered as a generalization of GSP. The general strategy of MFS is to first find an approximate solution to the set of frequent sequences and then perform successive refinement until the exact set of frequent sequences is obtained. We show that this successive refinement approach results in a significant improvement in I/O cost. We discuss how MFS can be applied to the incremental update problem. In particular, the result of a previous mining exercise can be used (by MFS) as a good initial approximate solution for the mining of an updated database. This results in an I/O efficient algorithm. To improve processing efficiency, we devise pruning techniques that, when coupled with GSP or MFS, result in algorithms that are both CPU and I/O efficient.
Analysis of Statistical Question Classification for Fact-Based Questions
Authors: Donald Metzler, W. Bruce Croft
Venue: Information Retrieval (2005)

Question classification systems play an important role in question answering systems and can be used in a wide range of other domains. The goal of question classification is to accurately assign labels to questions based on expected answer type. Most approaches in the past have relied on matching questions against hand-crafted rules. However, rules require laborious effort to create and often suffer from being too specific. Statistical question classification methods overcome these issues by employing machine learning techniques. We empirically show that a statistical approach is robust and achieves good performance on three diverse data sets with little or no hand tuning. Furthermore, we examine the role different syntactic and semantic features have on performance. We find that semantic features tend to increase performance more than purely syntactic features. Finally, we analyze common causes of misclassification error and provide insight into ways they may be overcome.
Joint Nonparametric Alignment for Analyzing Spatial Gene Expression Patterns in Drosophila Imaginal Discs
Authors: Parvez Ahammad, Cyrus L. Harmon, Ann Hammonds, S. Shankar Sastry, Gerald M. Rubin
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

To compare spatial patterns of gene expression, one must analyze a large number of images as current methods are only able to measure a small number of genes at a time. Bringing images of corresponding tissues into alignment is a critical first step in making a meaningful comparative analysis of these spatial patterns.Significant image noise and variability in the shapes make it hard to pick a canonical shape model. In this paper, we address these problems by combining segmentation and unsupervised shape learning algorithms. We first segment images to acquire structures of interest, then jointly align the shapes of these acquired structures using an unsupervised nonparametric maximum likelihood algorithm along the lines of ýcongealingý [12], while simultaneously learning the underlying shape model and associated transformations. The learned transformations are applied to corresponding images to bring them into alignment in one step. We demonstrate the results for images of various classes of Drosophila imaginal discs and discuss the methodology used for a quantitative analysis of spatial gene expression patterns.
DRMR: dynamic-ring-based multicast routing protocol for ad hoc networks
Authors: Yuan Zhou, Guang-Sheng Li, Yong-Zhao Zhan, Qi-Rong Mao, Yi-Bin Hou
Venue: Journal of Computer Science and Technology (2004)

Recently a number of multicast routing protocols for ad hoc networks have been proposed, however, most of them do not provide proper tradeoffs between effectiveness, efficiency and scalability. In this paper, a novel multicast routing protocol is presented for ad hoc networks. The protocol, termed as dynamic-ring-based multicast routing protocol (DRMR), uses the concept of dynamic ring whose radius can be adjusted dynamically and DRMR configures this type of ring for all group member nodes. According to the principle of zone routing, two nodes whose rings overlap can create route to each other, thus, when the ring graph composed of all rings is connected, each member node has one or more routes to others. DRMR uses the method of expanding ring search (ERS) to maintain the connected ring graph, and also can decrease the radius of the ring to reduce the overhead. The performances of DRMR were simulated and evaluated with NS2, and results show that DRMR has a high data packet delivery ratio, low control overhead and good scalability.
CHAMP code calculations of surface and subsurface explosions (abstract)
Authors: L. L. Edwards, R. B. Hickman, J. K. Hobson, T. C. Michels
Venue: ACM SIGNUM Newsletter (1975)

The CHAMP (<u>C</u>oupled <u>H</u>EMP <u>a</u>nd <u>M</u>ultifluid Eulerian <u>P</u>rogram) computer code package solves complex radiation diffusion and hydrodynamics problems. We discuss the structure of the code package and its applications to high-energy explosions on the ground surface and at shallow depths of burial.
Review of "Privacy: What Developers and IT Professionals Should Know by J. C. Cannon," Addison-Wesley Professional, 2004, $49.99. ISBN: 0321224094
Authors: Don Chand
Venue: Queue (2005)

Addison-Wesley Professional, 2004, $49.99 ISBN: 0321224094 I have been teaching an advanced course on design methodologies for more than a decade, and its content has evolved to keep up with changes in the application domains, implementation technologies, and advancements in design methods. Until I read this book, however, I did not realize that, as designers of software solutions, we need to have a good understanding of how to actually build privacy functionalities into the solutions we develop and deliver. Therefore, just as implementing security in software solutions is now viewed as a responsibility of software architects, I feel that privacy will be the next new responsibility of designers of software solutions. The question arises: What do we need to know to fulfill this new responsibility? This book provides an answer to this question. Specifically, it suggests that software designers need to know about privacy legislation, understand privacy-enhancing technologies, and possess the expertise to build privacy-aware applications.
Parallel Algorithm for Pricing American Asian Options with Multi-Dimensional Assets
Authors: Kai Huang, Ruppa K. Thulasiram
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

In this paper, we develop parallel algorithms for pricing American-style Asian options employing binomial tree method. We describe the algorithm, explain the complexities, and study the performance. We have extended our algorithm to handle Asian options with up to 10 underlying assets and shown that the multi-asset Asian options offer a better problem for parallel computation.
A Closest Point Algorithm for Parametric Surfaces with Global Uniform Asymptotic Stability
Authors: Volkan Patoglu, R. Brent Gillespie
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

We present an algorithm that determines the point on a convex parametric surface patch that is closest to a given (possibly moving) point. Any initial point belonging to the surface patch converges to the (possibly moving) closest point without ever leaving the patch. Thus the algorithm renders the patch invariant and is globally uniformly asymptotically stable. The algorithm is based on a control problem formulation and solution via a switching controller and common control Lyapunov function. Analytic limits of performance are available, delineating values for control gains needed to out-run motion (and shape) and preserve convergence under discretization. Together with a top-level Voronoi diagram-based switching algorithm, the closest point algorithm treats parametric models formed by tiling together convex surface patches. Simulation results are used to demonstrate invariance of the surface patch, global convergence, limits of performance, relationships between low-level and top-level switching, and a comparison to competing Newton-iteration based methods.