ppxscal/embedding_network huggingface dataset:
Optimal Cache Memory Exploitation for Continuous Media: To Cache or to Prefetch?
Authors: Antonis Hondroulis, Costas Harizakis, Peter Triantafillou
Venue: Multimedia Tools and Applications (2004)

Network continuous-media applications are emerging with a great pace. Cache memories have long been recognized as a key resource (along with network bandwidth) whose intelligent exploitation can ensure high performance for such applications. Cache memories exist at the continuous-media servers and their proxy servers in the network. Within a server, cache memories exist in a hierarchy (at the host, the storage-devices, and at intermediate multi-device controllers). Our research is concerned with how to best exploit these resources in the context of continuous media servers and in particular, how to best exploit the available cache memories at the drive, the disk array controller, and the host levels. Our results determine under which circumstances and system configurations it is preferable to devote the available memory to traditional caching (a.k.a. &ldquo;data sharing&rdquo;) techniques as opposed to prefetching techniques. In addition, we show how to configure the available memory for optimal performance and optimal cost. Our results show that prefetching techniques are preferable for small-size caches (such as those expected at the drive level). For very large caches (such as those employed at the host level) caching techniques are preferable. For intermediate cache sizes (such as those at multi-device controllers) a combination of both strategies should be employed.
Applications of storage mapping optimization to register promotion
Authors: Patrick Carribault, Albert Cohen
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop transformations, whether based on uniform dependence vectors or more expressive polyhedral abstractions. Conversely, few loop transformations have been proposed to facilitate register promotion, namely loop fusion, unroll-and-jam or tiling. Building on array data-flow analysis and expansion, we extend storage mapping optimization to improve opportunities for register promotion.Our work is motivated by the empirical study of a computational biology benchmark, the approximate string matching algorithm BPR from NR-grep, on a wide issue micro-architecture. Our experiments confirm the major benefit of register tiling (even on non-numerical benchmarks) but also shed the light on two novel issues: prior array expansion may be necessary to enable loop transformations that finally authorize profitable register promotion, and more advanced scheduling techniques (beyond tiling and unroll-and-jam) may significantly improve performance in fine-tuning register usage and instruction-level parallelism.
Geometry Image Matching for Similarity Estimation of 3D Shapes
Authors: Hamid Laga, Hiroki Takahashi, Masayuki Nakajima
Venue: Proceedings of the Computer Graphics International (2004)

In this paper we describe our preliminary findings inapplying the spherical parametrization and geometry imagesto the task of 3D shape matching and similarity basedcomparison of polygon soup models. Unlike traditional approachwhere multiple 2D views of the same object are requiredto capture the relevant geometry features, our proposedtechnique uses spherical parametrization and geometryimages for 3D shape matching. This technique reducesthe problem to the 2D space without computing 2Dprojections and guaranties the preservation of small details.Moreover, we take advantage from the hierarchicalnature of the parametrization process, through the ProgressiveMesh simplification, to derive a multiresolution analysistechnique. Our proposed algorithm is invariant to similaritytransformations such as rotation and scaling. Theefficiency of this approach is discussed through a set of experiments.
BYPASS: Topology-Aware Lookup Overlay for DHT-based P2P File Locating Services
Authors: Gisik Kwon, Kyung Dong Ryu
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

In this paper we propose a novel peer-to-peer filelocation system, BYPASS, to enhance the distributed filelookup time in DHT-based P2P systems. BYPASSconstructs a secondary overlay in which file locationinformation is distributed considering heterogeneity ofpeer capabilities and network proximity between requestsand results. The secondary overlay in BYPASS allows onlyhigh-capability peers to participate in the system-wide filelookup and takes advantage of physical network proximitybased on the Autonomous System (AS) network topology.We evaluate effectiveness of BYPASS using a set of large-scalesimulations. The results show that BYPASS cansignificantly reduce file lookup latency at the cost ofadditional, yet acceptable storage and network resources.
PRUNER: Algorithms for Finding Monad Patterns in DNA Sequences
Authors: Ravi VijayaSatya, Amar Mukherjee
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We present new algorithms for discovering monad patterns in DNA sequences. Monad patterns are of the form (l, d)-k, where l is the length of the pattern, d is the maximum number of mismatches allowed, and k is the minimum number of times the pattern is repeated in the given sample. The time-complexity of some of the best known algorithms to date is O(nt^2 l^d \left| \sum\right|^d ), where t is the number of input sequences, and n is the length of each input sequence. The first algorithm that we present takes O(n^2 t^2 l^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}}\left| \Sigma\right|^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} ) and space 0(ntl^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \left| \Sigma\right|^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} ), and the second algorithm takes 0(n^3 t^3 l^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \left| \Sigma\right|^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} ) time using 0(l^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \left| \Sigma\right|^{{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} ) space. In practice, our algorithms have much better performance provided the d/l ratio is small.
A Parallel Semi-Coarsening Multigrid Algorithm for Solving the Reynolds-Averaged Navier-Stokes Equations
Authors: Kiattisak Ngiamsoongnirn, Ekachai Juntasaro, Varangrat Juntasaro, Putchong Uthayopas
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

The multigrid method adopted in conjunction with the parallel computing is presented. The standard multigrid doubling the mesh size in all directions, called full-coarsening technique, suffers from the partitioning of data for parallel computing. To remedy this problem, the semi-coarsening technique should be used instead. This paper is aimed to present an algorithm of the semi-coarsening multigrid technique combined with the parallel computing technique. The parallel computing technique used is the one based on the distributed memory machine. The MPI library is adopted in order to exchange the data among processors. The solver code is developed for three-dimensional turbulent flows and validated with the available experimental data.
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate
Authors: D. Noutsos, S. Serra Capizzano, P. Vassalos
Venue: Theoretical Computer Science (2004)

In the last decades several matrix algebra optimal and superlinear preconditioners (those assuring a strong clustering at the unity) have been proposed for the solution of polynomially ill-conditioned Toeplitz linear systems. The corresponding generalizations for multilevel structures are neither optimal nor superlinear (see e.g. Contemp. Math. 281 (2001) 193). Concerning the notion of superlinearity, it has been recently shown that the proper clustering cannot be obtained in general (see Linear Algebra Appl. 343-344 (2002) 303; SIAM J. Matrix Anal. Appl. 22(1) (1999) 431; Math. Comput. 72 (2003) 1305). In this paper, by exploiting a proof technique previously proposed by the authors (see Contemp. Math. 323 (2003) 313), we prove that the spectral equivalence and the essential spectral equivalence (up to a constant number of diverging eigenvalues) are impossible too. In conclusion, optimal matrix algebra preconditioners in the multilevel setting simply do not exist in general and therefore the search for optimal iterative solvers should be oriented to different directions with special attention to multilevel/multigrid techniques.
Real-Time Facial Expression Recognition in the Interactive Game Based on Embedded Hidden Markov Model
Authors: Xiaoxu Zhou, Xiangsheng Huang, Yangsheng Wang
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Combine the facial expression of the game player with the game role and the context can highly enhance the interaction and attractiveness of the interactive computer game. In this paper, we propose a novel framework to real-time facial expression recognition in the interactive computer game environment. There are two main contributions of this work. First, an embedded HMM proposed by Nefian et al. for face recognition [1] is used in real-time facial expression recognition. Second, face alignment is used in facial expression environment. In this paper, the embedded HMM uses two-dimensional Discrete Cosine Transform (2D-DCT) coefficients as the observation vectors opposite to previous HMM approaches which use pixel intensities to form the observation vectors. Our proposed system reduces the complexity of the training and recognition system.
Multi-Homing Tunnel Broker
Authors: Marcelo Bagnulo, Juan Fco. Rodriguez-Hervella, Alberto Garcia-Martinez, Arturo Azcorra
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

A proper support for communications has to provide fault tolerance capabilities such as the preservation of established connections in case of failures. Multi-homing addresses this issue, but the currently available solution based in massive BGP route injection presents serious scalability limitations, since it contributes to the exponential growth of the BGP table size. An alternative solution based on the configuration of tunnels between the multihomed site exit routers and the ISP border routers has been proposed for IPv6 in RFC 3178. However, the amount of manual configuration imposed by this solution on the ISP side prevents its wide adoption. In particular, this solution requires at the ISP the manual configuration of a tunnel endpoint per each multihomed client that it serves. In this paper we present a Multi-Homing Tunnel Broker (MHTB) that provides automatic creation of the tunnel endpoint at the ISP side.
Experiences with Java(tm) JIT Optimization
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

This paper presents some experiences with a Java(tm) just-in-time compiler developed at Intel Corporation. For a few optimizations, the issues that are specific to Java programs are discussed. Furthermore, because in the context of a just-in-time compilation, compile-time directly contributes to the run-time of the application, some remarks are made on how program analysis time is kept limited in our compiler. A preliminary experiment explores the impact of the presented optimizations.
ORDPATHs: insert-friendly XML node labels
Authors: Patrick O'Neil, Elizabeth O'Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, Nigel Westbury
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

We introduce a hierarchical labeling scheme called ORDPATH that is implemented in the upcoming version of Microsoft&reg; SQL Server&trade;. ORDPATH labels nodes of an XML tree without requiring a schema (the most general case---a schema simplifies the problem). An example of an ORDPATH value display format is "1.5.3.9.1". A compressed binary representation of ORDPATH provides document order by simple byte-by-byte comparison and ancestry relationship equally simply. In addition, the ORDPATH scheme supports insertion of new nodes at arbitrary positions in the XML tree, their ORDPATH values "careted in" between ORDPATHs of sibling nodes, without relabeling any old nodes.
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results
Authors: Nikhil R. Devanur
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

The traditional model of market equilibrium supports impressive existence results, including the celebrated Arrow-Debreu Theorem. However, in this model, polynomial time algorithms for computing (or approximating) equilibria are known only for linear utility functions. We present a new, and natural, model of market equilibrium that not only admits existence and uniqueness results paralleling those for the traditional model but is also amenable to efficient algorithms.
FPGA based hardware acceleration for elliptic curve public key cryptosystems
Authors: M. Ernst, B. Henhapl, S. Klupsch, S. Huss
Venue: Journal of Systems and Software (2004)

This paper addresses public key cryptosystems based on elliptic curves, which are aimed to high-performance digital signature schemes. Elliptic curve algorithms are characterized by the fact that one can work with considerably shorter keys compared to the RSA approach at the same level of security. A general and highly efficient method for mapping the most time-critical operations to a configurable co-processor is proposed. By means of real-time measurements the resulting performance values are compared to previously published state of the art hardware implementations.A generator based approach is advocated for that purpose which supports application specific co-processor configurations in a flexible and straight forward way. Such a configurable CryptoProcessor has been integrated into a Java-based digital signature environment resulting in a considerable increase of its performance. The outlined approach combines in an unique way the advantages of mapping functionality to either hardware or software and it results in high-speed cryptosystems which are both portable and easy to update according to future security requirements.
Barely random algorithms for multiprocessor scheduling
Authors: Steve Seiden
Venue: Journal of Scheduling (2003)

We consider randomized algorithms for on-line scheduling on identical machines. For two machines, a randomized algorithm achieving a competitive ratio of 4/3 was found by Bartal et al. (1995). Seiden has presented a randomized algorithm which achieves competitive ratios of 1.55665, 1.65888, 1.73376, 1.78295, and 1.81681, for m = 3, 4, 5, 6, 7, respectively (Seiden, 2000). A barely random algorithm is one which is a distribution over a constant number of deterministic strategies. The algorithms of Bartal et al. and Seiden are not barely random--in fact, these algorithms potentially make a random choice for each job scheduled. We present the first barely random on-line scheduling algorithms. In addition, our algorithms use less space and time than the previous algorithms, asymptotically.
Unstructured modelling growth of Lactobacillus acidophilus as a function of the temperature
Authors: L. Bâati, G. Roux, B. Dahhou, J.-L. Uribelarrea
Venue: Mathematics and Computers in Simulation (2004)

We present modelling software developed under MATLAB in which parameter estimations are obtained by using non-linear regression techniques. The different parameters appear in a set of non-linear algebraic and differential equations representing the model of the process. From experimental data obtained in discontinuous cultures a representative mathematical model (unstructured kinetic model) of the macroscopic behaviour of Lactobacillus acidophilus has been developed. An unstructured model expressed the specific rates of cell growth, lactic acid production and glucose consumption for batch fermentation. The model is formulated by considering the inhibition of growth under sub-optimal culture conditions during Lactobacillus acidophilus fermentation, which is accompanied by an increase of the maintenance energy. This study permits to predict the cellular behaviour at low growth temperatures and enables to define the response of the strain to sub-optimal temperature stress.
Real Time Noise Cleaning of Ultrasound Images
Authors: A. Hazra, J. Bhattacharyya, S. Banerjee
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper presents an efficient algorithm for real time noise cleaning of biomedicalultrasonic images and its VLSI implementation into FPGA. An optimized architecture has beendesigned with proper parallelism and pipelining as well as removing redundancies to achievehigh speed. The implementation has been done in Xilinx XCV50TQ144-5 chip to yield athroughput of one output data per clock cycle with an operating speed of 51 MHz.
One-step lithography for various size patterns with a hybrid mask-mold
Authors: Xing Cheng, L. Jay Guo
Venue: Microelectronic Engineering (2004)

Nanoimprint lithography (NIL) has been successfully employed in nanoscale patterning, however, it is known to have limitations in replicating large-scale (hundreds of microns and larger) and nanoscale patterns simultaneously. In this letter, we present a novel lithographic technique that integrates photolithography into the NIL patterning process. This technique uses a hybrid mask-mold that has large metal pads embedded in a transparent NIL mold. Such a hybrid mold allows both large-and nanoscale patterns to be replicated in one step by a combination of imprinting and photolithography. In addition, this new technique offers the advantages of simplifying residual layer distribution and avoiding NIL failures resulting from insufficient polymer flow.
A Framework for Evaluating Storage System Dependability
Authors: Kimberly Keeton, Arif Merchant
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

Designing storage systems to provide businesscontinuity in the face of failures requires the use of variousdata protection techniques, such as backup, remote mirroring,point-in-time copies and vaulting, often in concert.Predicting the dependability provided by such compositionsof techniques is difficult, yet necessary for dependable systemdesign. We present a framework for evaluating the dependabilityof data storage systems, including both individualdata protection techniques and their compositions. Ourmodels estimate storage system recovery time, data loss,normal mode system utilization and operational costs undera variety of failure scenarios. We demonstrate the effectivenessof these modeling techniques through a case studyusing real-world storage system designs and workloads.
Adopting the SW-CMM in a Small IT Organization
Authors: Felipe Guerrero, Yadran Eterovic
Venue: IEEE Software (2004)

The software development global market is opening its doors to more countries, giving small organizations an opportunity to benefit from more competitive conditions. A requisite for being competitive is to adopt internationally accepted software process practices. Small organizations trying to start their own effort must carefully identify how their environment affects an improvement initiative.The authors report on the adoption of SW-CMM Level 2 in Link, a Chilean organization. This was a software process improvement initiative led by one of the authors. They explain Link's organizational environment, the initiative performed, and the factors that affected the initiative. They found a strong relationship between organizational environment and the initiative's success factors; specifically, that Link's small size helped the SW-CMM's adoption.
Henry's Garden
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

The story of a monster who loves flowers and experiences a harsh transformation of his environment. It's a tale of joy, loss, rejuvenation, and the enduring power of nature. "Henry's Garden" was produced on Windows NT workstations using Alias|Wavefront's Maya Unlimited, Right Hemisphere's Deep Paint 3D, Adobe Photoshop and Adobe Premiere. Copyright held by creator.
Caching Support for Push-Pull Data Dissemination using Data-Snooping Routers
Authors: Ismail Ari, Ethan L. Miller
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Internet applications such as the HTTP-Web, audio-videostreaming and file sharing depend on wide-area data dissemination. Clients of these applications suffer from long delays due to network queuing, bandwidth limitations andadverse effects of bandwidth sharing between differenttraffic.Caching reduces delays and saves network bandwidthby holding the fetched data and responding to the subsequent requests locally. Existing distributed caching solutions are application-specific and do not support deliveryin the push-pull directions at the same time. Our proposed architecture, called Storage Embedded Networks, gives application- and direction-independent caching support by using memory-embedded, data-snooping routers.These router caches can act both as a client proxy anda server accelerator. We compare our architecture to theweb caches operating in forward proxy mode. We reportadditional reductions in client response times and serverloads over proxies using the same cache sizes.
Mickey's buddy
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

Mickey's life has changed forever since his dog died. He found a new dog to keep him company though. He's a good dog but very lazy. He never wants to play ball or even go for a walk without a struggle. See what happens when a surprise visitor stumbles upon them. Copyright held by creator.
cc-COMA: The Compiler-Controlled COMA as a Framework for Parallel Computing
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

In order to provide a fully-automatic parallelzing compiler with the function of both automatic data partitioning and distribution, we propose a compiler-controlled cache only memory architecture (cc-COMA). The cc-COMA runtime system is based on a software-emulated COMA which covers a variety of parallel architectures from NUMA to NOW. The compiler generates both the user code and control code for the emulated cache based on the Entry Consistency model. The runtime system of cc-COMA executes the generated code following the suggestions of the compiler. In this paper we present an outline of what we call cc-COMA system. It is also described aout an implementation of the cc-COMA runtime system for networks of workstations, named Laurasia. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Average-clicks: a new measure of distance on the World Wide Web
Authors: Yutaka Matsuo, Yukio Ohsawa, Mitsuru Ishizuka
Venue: Journal of Intelligent Information Systems (2003)

The pages and hyperlinks of the World Wide Web may be viewed as nodes and edges in a directed graph. In this paper, we propose a new definition of the distance between two pages, called average-clicks. It is based on the probability to click a link through random surfing. We compare the average-clicks measure to the classical measure of clicks between two pages, and show the average-clicks fits better to the users' intuition of distance.