ppxscal/embedding_network huggingface dataset:
Using data compression in an MPSoC architecture for improving performance
Authors: O. Ozturk, M. Kandemir, M. J. Irwin
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Multiprocessor-System-on-a-Chip (MPSoC) performance and power consumption are greatly affected by the application data access characteristics. While the way the application is written is critical in shaping the data access pattern, the compiler optimizations employed can also make a significant difference. Considering that cost of off-chip memory accesses is continuously rising (in terms of CPU cycles), minimizing the number and volume of off-chip data traffic in MPSoCs can be very important. This paper addresses this problem by proposing data compression for increasing the effective on-chip storage space in an MPSoC-based environment. A critical issue is to schedule compressions and decompressions intelligently such that they do not conflict with application execution. In particular, one needs to decide which processors should participate in the compression (and decompression) activity at any given point during the course of execution. We propose both "static" and "dynamic" algorithms for this purpose. In the static scheme, the processors are divided into two groups (those performing compression/decompression and those executing the application), and this grouping is maintained throughout the execution of the application. In the dynamic scheme, on the other hand, the execution starts with some grouping but this grouping can change during the course of execution, depending on the dynamic variations in the data access pattern.
A fragment-based approach for efficiently creating dynamic web content
Authors: Jim Challenger, Paul Dantzig, Arun Iyengar, Karen Witting
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

This article presents a publishing system for efficiently creating dynamic Web content. Complex Web pages are constructed from simpler fragments. Fragments may recursively embed other fragments. Relationships between Web pages and fragments are represented by object dependence graphs. We present algorithms for efficiently detecting and updating Web pages affected after one or more fragments change. We also present algorithms for publishing sets of Web pages consistently; different algorithms are used depending upon the consistency requirements.Our publishing system provides an easy method for Web site designers to specify and modify inclusion relationships among Web pages and fragments. Users can update content on multiple Web pages by modifying a template. The system then automatically updates all Web pages affected by the change. Our system accommodates both content that must be proofread before publication and is typically from humans as well as content that has to be published immediately and is typically from automated feeds.We discuss some of our experiences with real deployments of our system as well as its performance. We also quantitatively present characteristics of fragments used at a major deployment of our publishing system including fragment sizes, update frequencies, and inclusion relationships.
FeelTip: tactile input device for small wearable information appliances
Authors: Sunyu Hwang, Geehyuk Lee, Buyong Jeong, Woohun Lee, Ilyeon Cho
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The ever decreasing size of information devices these days does not allow even the space for small input devices such as a touchpad or a 3x4 keypad. We introduce here an input device, FeelTip, as a solution for very small information devices. The main idea is to exchange the usual roles of a finger and a surface in a touchpad; a device has a tip and a finger now provides a surface. The result is an input device requiring minimal space but is potentially more efficient than a touchpad due to the tactile feedback of a tip on a finger. Our first prototype consists of a transparent tip and a small CMOS image sensor that tracks the movement of a finger on a tip. In a series of experiments, it outperformed a small analog joystick in free pointing tasks, and was comparable with a 3x4 keypad in text entry tasks.
Dynamic RWA Based on the Combination of Mobile Agents Technique and Genetic Algorithm in WDM Networks with Sparse Wavelength Conversion
Authors: Vinh Trong Le, Xiaohong Jiang, Son Hong Ngo, Susumu Horiguchi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

In this paper, we study the dynamic RWA problem in WDM networks with sparse wavelength conversion and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithm. By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously update the routing tables, the new hybrid algorithm has the ability to promptly determine the first population of routes for a new request based on the routing table of its source node without requiring the time consuming process associated with the available GA-based dynamic RWA algorithms. To achieve a good load balance in WDM networks with sparse wavelength conversion, we adopt in our hybrid algorithm a new reproduction scheme and a new fitness function that simultaneously takes into account the path length, number of free wavelengths and wavelength conversion capability in route selection. Our new algorithm has the capabilities of achieving a better load balance and resulting a significantly lower blocking probability than that of the promising Fixed-Alternate routing algorithm for both the optical networks with sparse and full-range wavelength converters and the optical networks with sparse and limited-range wavelength converters, as verified by an extensive simulation study upon the ns-2 network simulator. The ability to guarantee both a low blocking probability and a small setup delay makes the new hybrid dynamic RWA algorithm very attractive for both the optical circuit switching networks and future optical burst switching networks.
PDM Sorting Algorithms That Take A Small Number of Passes
Authors: Sanguthevar Rajasekaran, Sandeep Sen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The Parallel Disk Model (PDM) has been proposed to alleviate the I/O bottleneck. Sorting is an important problem that has ubiquitous applications. Several asymptotically optimal PDM sorting algorithms are known and now the focus has shifted to developing algorithms for problem sizes of practical interest. In this paper we present several novel algorithms for sorting on the PDM that take only a small number of passes through the data. We also present a generalization of the zero-one principle for sorting. A shuffling lemma is presented as well. These lemmas should be of independent interest for average case analysis of sorting algorithms as well as for the analysis of randomized sorting algorithms.
Conformal Deskewing of Non-Planar Documents
Authors: Michael S. Brown, Charles J. Pisula
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents an approach that uses conformal mapping to parameterize a documentýs 3D shape to a 2D plane. Using this conformal parametrization, a restorative mapping between an image of the distorted document and a "flattened" representation of the document can be computed and used to deskew the image. Our experiments show that arbitrarily distorted documents can be restored to within a single pixel of their true planar format. In addition, surface points can be constrained to mapped to specified locations in the restored 2D plane.
Scene-consistent detection of feature points in video sequences
Authors: Ariel Tankus, Yehezkel Yeshurun
Venue: Computer Vision and Image Understanding (2005)

Detection of feature points in images is an important preprocessing stage for many algorithms in Computer Vision. We address the problem of detection of feature points in video sequences of 3D scenes, which could be mainly used for obtaining scene correspondence. The main feature we use is the zero crossing of the intensity gradient argument. We analytically show that this local feature corresponds to specific constraints on the local 3D geometry of the scene, thus ensuring that the detected points are based on real 3D features. We present a robust algorithm that tracks the detected points along a video sequence, and suggest some criteria for quantitative evaluation of such algorithms. These criteria serve in a comparison of the suggested operator with four other feature trackers. The suggested criteria are generic and could serve other researchers as well for performance evaluation of stable point detectors.
A specialized hardware device for the protein similarity search: Research Articles
Authors: A. Marongiu, P. Palazzari, V. Rosato
Venue: Concurrency and Computation: Practice Experience (2004)

This work presents the architecture of PROSIDIS, a special purpose processor designed to search for the occurrence of substrings similar to a given &lsquo;template string&rsquo; within a proteome. Similarity is determined by means of a weighting matrix which measures the degree of similarity between any two amino acids.The paper recalls the basis of the PHG (Parallel Hardware Generator) tool, developed in the framework of the HADES project (Hardware Design for Scientific Applications). Through PHG it is possible to design, in a nearly automatic way, a parallel hardware which efficiently implements an algorithm described through recurrence equations; PHG is able to generate a synthesizable VHDL which represents a parallel system derived from the System of Affine Recurrence Equations (SARE) describing the problem.In this work we illustrate the advantages derived from designing a special purpose processor to face the protein similarity discovery problem. Some preliminary results are given, reporting the time spent by several conventional computing architectures and by the PROSIDIS processor hosted by a personal computer to solve the same protein analysis problem. The results show that PROSIDIS, implemented on a Xilinx XV1000 FPGA, gives speedup figures ranging from 5.6 up to 55.6. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Authors: Alberto Cerpa, Jennifer L. Wong, Miodrag Potkonjak, Deborah Estrin
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Recently, several studies have analyzed the statistical properties of low power wireless links in real environments, clearly demonstrating the differences between experimentally observed communication properties and widely used simulation models. However, most of these studies have not performed in depth analysis of the temporal properties of wireless links. These properties have high impact on the performance of routing algorithms.Our first goal is to study the statistical temporal properties of links in low power wireless communications. We study short term temporal issues, like lagged autocorrelation of individual links, lagged correlation of reverse links, and consecutive same path links. We also study long term temporal aspects, gaining insight on the length of time the channel needs to be measured and how often we should update our models.Our second objective is to explore how statistical temporal properties impact routing protocols. We studied one-to-one routing schemes and developed new routing algorithms that consider autocorrelation, and reverse link and consecutive same path link lagged correlations. We have developed two new routing algorithms for the cost link model: (i) a generalized Dijkstra algorithm with centralized execution, and (ii)a localized distributed probabilistic algorithm.
Region Competition via Local Watershed Operators
Authors: Huseyin Tek, Ferit Akova, Alper Ayvacy
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region based deformable models. Traditionally, watersheds are computed in the whole image and then some region merging techniques are applied on them to reach the segmentation of structures. Here, we propose that watershed regions can be used as operators in region-based deformable models. These regions are computed only when the deformable models reach them. Then, they are added to (or subtracted from) the deformable models via a measure computed from two terms: (i) statistical fit of regions to the models, region competition; (ii) smoothness of such fits, smoothness constraint. The proposed algorithm is computationally efficient because it operates on regions instead of pixels. In addition, this algorithm allows better boundary localization due to the edge information brought by watersheds. Moreover, the proposed algorithm can handle topological changes, e.g., split or merge, during the evolutions without an additional embedded surface as in the case of level set formulation. Furthermore, structure-based smoothness of segmented objects is obtained by using the smoothness term computed from the alignment of regions. We illustrate the efficiency and accuracy of the proposed technique on several medical data such as MRA and CTA data.
Experimental context classification: incentives and experience of subjects
Authors: Martin Höst, Claes Wohlin, Thomas Thelin
Venue: Proceedings of the 27th international conference on Software engineering (2005)

There is a need to identify factors that affect the result of empirical studies in software engineering research. It is still the case that seemingly identical replications of controlled experiments result in different conclusions due to the fact that all factors describing the experiment context are not clearly defined and hence controlled. In this article, a scheme for describing the participants of controlled experiments is proposed and evaluated. It consists of two main factors, the incentives for participants in the experiment and the experience of the participants. The scheme has been evaluated by classifying a set of previously conducted experiments from literature. It can be concluded that the scheme was easy to use and understand. It is also found that experiments that are classified in the same way to a large extent point at the same results, which indicates that the scheme addresses relevant factors.
Hierarchical Clustering Algorithms for Document Datasets
Authors: Ying Zhao, George Karypis, Usama Fayyad
Venue: Data Mining and Knowledge Discovery (2005)

Fast and high-quality document clustering algorithms play an important role in providing intuitive navigation and browsing mechanisms by organizing large amounts of information into a small number of meaningful clusters. In particular, clustering algorithms that build meaningful hierarchies out of large document collections are ideal tools for their interactive visualization and exploration as they provide data-views that are consistent, predictable, and at different levels of granularity. This paper focuses on document clustering algorithms that build such hierarchical solutions and (i) presents a comprehensive study of partitional and agglomerative algorithms that use different criterion functions and merging schemes, and (ii) presents a new class of clustering algorithms called constrained agglomerative algorithms, which combine features from both partitional and agglomerative approaches that allows them to reduce the early-stage errors made by agglomerative methods and hence improve the quality of clustering solutions. The experimental evaluation shows that, contrary to the common belief, partitional algorithms always lead to better solutions than agglomerative algorithms; making them ideal for clustering large document collections due to not only their relatively low computational requirements, but also higher clustering quality. Furthermore, the constrained agglomerative methods consistently lead to better solutions than agglomerative methods alone and for many cases they outperform partitional methods, as well.
Web-based progressive geometry transmission using subdivision-surface wavelets
Authors: Jens Jessl, Martin Bertram, Hans Hagen
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

Web-based geometry transmission profits from a transmission system, which is both progressive and compressive. For this application, the wavelet transform has emerged as a suitable tool. We present a new zerotree coding scheme for compressing coefficients resulting from the wavelet transform of B-spline and Catmull-Clark surfaces. It results from a generalization of the original zerotree coding algorithm for image compression. The main idea is the construction of a suitable forest-structure of wavelet coefficients. Furthermore we present a system architecture for web-based progressive geometry transmission. Its main features are the separation of the transmission algorithms from the implementation of several geometry types, a set of parameters for regulating transmission properties, and a thread system for concurrent receiving and visualizing a scene. The power of the zerotree coding scheme is demonstrated by some numerical examples.
Aeneas: Real-Time Performance Evaluation Approach for Distributed Programs with Reliability-Constrains
Authors: Yunfa Li, Hai Jin, Zongfen Han, Chao Xie, Deqing Zou, Hao Wu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

A novel approach, based on the execution state of distributed programs, is proposed in this paper, called Aeneas. It is for the real-time performance analysis of distributed programs with reliability-constrains. In Aeneas, there are two important factors, the available data files and the transmission paths of each available data file. Some algorithms are designed to find all the transmission paths of each data file needed while the program executes, count the transmission time for each transmission path, then get the aggregate transmission time, calculate the fastest and the slowest response time of distributed programs with reliability-constrains. A representative case is analyzed, and the results show that it is an efficient way to evaluate the real-time performance of distributed programs with reliability-constrains.
Finding your way with GPSdrive
Authors: Charles Curley
Venue: Linux Journal (2005)

Integrate this navigation package with speech synthesis, wireless network mapping and your choice of map data.
Analysis of topic dynamics in web search
Authors: Xuehua Shen, Susan Dumais, Eric Horvitz
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

We report on a study of topic dynamics for pages visited by a sample of people using MSN Search. We examine the predictive accuracies of probabilistic models of topic transitions for individuals and groups of users. We explore temporal dynamics by comparing the accuracy of the models for predicting topic transitions at increasingly distant times in the future. Finally, we discuss directions for applying models of search topic dynamics.
SNAP: Efficient Snapshots for Back-in-Time Execution
Authors: Liuba Shrira, Hao Xu
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

SNAP is a novel high-performance snapshot system for object storage systems. The goal is to provide a snapshot service that is efficient enough to permit "back-in-time" read-only activities to run against application-specified snapshots. Such activities are often impossible to run against rapidly evolving current state because of interference or because the required activity is determined in retrospect. A key innovation in SNAP is that it provides snapshots that are transactionally consistent, yet non-disruptive. Unlike earlier systems, we use novel in-memory data structures to ensure that frequent snapshots do not block applications from accessing the storage system, and do not cause unnecessary disk operations. SNAP takes a novel approach to dealing with snapshot meta-data using a new technique that supports both incremental meta-data creation and efficient meta-data reconstruction. We have implemented a SNAP prototype and analyzed its performance. Preliminary results show that providing snapshots for back-in-time activities has low impact on system performance even when snapshots are frequent.
Ad Hoc Image Retrieval Using Hierarchical Semantic-Based Index
Authors: Bo Yang, Ali R. Hurson
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Content-based image retrieval is a challenging problem in mobile ad hoc networks due to the multiple limitations such as network bandwidth, infrastructure-free nature, and node mobility. The traditional systems employ either centralized or flooding strategies, which may result in low fault tolerance or high search cost. In this paper, we propose a decentralized non-flooding retrieval scheme in multi-hop ad hoc networks ¿ Semantic Ad hoc Image Retrieval (SAIR). The novelty of SAIR stems from several factors including: (1) representation of image contents using first-order logic expressions; (2) clustering mobile nodes based on their data contents; and (3) performing content-based image retrieval within a reduced scope of mobile nodes. Through extensive simulations, we show that relative to the flooding strategy, SAIR can retrieve the semantically most similar image objects by accessing only a small portion of the mobile nodes with lower search cost. Moreover, it is scalable to large network sizes and large number of data objects.
Extending tangible interfaces for education: digital montessori-inspired manipulatives
Authors: Oren Zuckerman, Saeed Arida, Mitchel Resnick
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

This paper introduces a new framework for thinking about tangible interfaces in education, with specific focus on abstract problem domains.Manipulatives are physical objects specifically designed to foster learning. We offer a new classification of Manipulatives: "Froebel-inspired Manipulatives" (FiMs) and "Montessori-inspired Manipulatives" (MiMs). We argue that FiMs are design materials, fostering modeling of real-world structures, while MiMs foster modeling of more abstract structures. We show that our classification extends to computationally enhanced versions of manipulatives.We present Digital MiMs - computationally enhanced building blocks. We describe two prototypical members of the Digital MiMs class: FlowBlocks and SystemBlocks, physical, modular interactive systems that serve as general-purpose modeling and simulation tools for dynamic behavior. We present findings from qualitative studies, and conclude that digital MiMs are accessible to young children, engaging, and encourage learning of abstract structures of dynamic behavior through an iterative process of hands-on modeling, simulating, and analogizing.