ppxscal/embedding_network huggingface dataset:
Minmax optimal shape coding using skeleton decomposition
Authors: Haohong Wang, G. M. Schuster, A. K. Katsaggelos
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we consider the rate-distortion optimal encoding of shape information using a skeleton decomposition and the minimum maximum (minmax) distortion criterion. For bit budget constrained video communication applications, whose goal is to achieve as low as possible but almost constant distortion, the minmax criterion is the natural choice. We propose a 4D DAG (directed acyclic graph) shortest path algorithm implemented by dynamic programming to solve the minimum rate problem, and also provide a solution for the dual minimum distortion problem. Experimental results indicate that our algorithm has an outstanding performance compared with existing methods.
Optimizing MPI collective communication by orthogonal structures
Authors: Matthias Kühnemann, Thomas Rauber, Gudula Rünger
Venue: Cluster Computing (2006)

MPI collective communication operations to distribute or gather data are used for many parallel applications from scientific computing, but they may lead to scalability problems since their execution times increase with the number of participating processors. In this article, we show how the execution time of collective communication operations can be improved significantly by an internal restructuring based on orthogonal processor structures with two or more levels. The execution time of operations like MPI_Bcast() or MPI_Allgather() can be reduced by 40% and 70% on a dual Xeon cluster and a Beowulf cluster with single-processor nodes. But also on a Cray T3E a significant performance improvement can be obtained by a careful selection of the processor structure. The use of these optimized communication operations can reduce the execution time of data parallel implementations of complex application programs significantly without requiring any other change of the computation and communication structure. We present runtime functions for the modeling of two-phase realizations and verify that these runtime functions can predict the execution time both for communication operations in isolation and in the context of application programs.
Efficient Moving Object Extraction in Compressed Low-Bit-Rate Video
Authors: Chih-Chung Hsu, Hsuan T. Chang, Ting-Cheng Chang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Previous studies usually consider the motion object extraction (MOE) problem under uncompressed video, which is not practical since the high-frequency components are discarded already in the compressed low-bit-rate video. Moreover, extracting the motion object based only on illumination variation cannot work well when the moving object and background are with similar light intensities. Therefore, an MOE algorithm based on RGB-color model is proposed in this study. On the other hand, the blockbased background extraction method, which can more efficiently construct the background image, is also proposed. The simulation results show that the motion objects can be efficiently extracted using the proposed methods.
Development of five-fingered haptic interface: HIRO-II
Authors: Haruhisa Kawasaki, Tetsuya Mouri, M. Osama Alhalabi, Yasutaka Sugihashi, Yoshio Ohtuka, Sho Ikenohata, Kazushige Kigaku, Vytautas Daniulaitis, Kazuyasu Hamada, Tatsuo Suzuki
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents the design and the characteristics of a new developed five-fingered haptic interface robot named HIRO II. The haptic interface can present force and tactile feeling at the five fingertips of the human hand. It is designed to be completely safe and similar to the human upper limb both in shape and motion ability. Its mechanism consists of a 6 DOF arm and a 15 DOF hand. The interface is placed opposite to the human hand, which brings safety and no oppressive feeling, but this leads to difficulty in controlling the haptic interface because it should follow the hand poses of the operator. A redundant force control method in which all the joints of the mechanism were force controlled simultaneously to present the virtual force is studied. Experimental results to show high potential of a multi-fingered haptic interface are presented.
Cramer-Rao bounds and estimation of direction of arrival for narrowband signals
Authors: A. Satish, R. L. Kashyap
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

In the presence of two narrowband signal sources, the authors derive simplified explicit expressions for the Cramer-Rao lower bound (CRB) for the covariance matrix of all unknown direction of arrival (DOA) angles. A second order Taylor's series expansion is employed for the inverse of the data covariance matrix, R. The behavior of the covariance matrix is discussed by quantitative numerical comparisons for different values of correlation and spacing between the sources. By using positive definiteness of the Fisher information matrix, a strict lower limit on the angle of resolution is obtained for a given source correlation. A numerical study is included on the performance of the maximum likelihood (ML) method, which assumes signals radiated from the sources are random. The proposed method is compared with Root-MUSIC (B. D. Rao and K. V. S. Hari, IEEE Trans. vol.ASSP-37, no.12, p.1939-49 of 1989). The observations demonstrate the superiority of the proposed ML method to Root-MUSIC, and its performance agrees well with the theoretically derived bounds.
Data Mining and Predictive Analytics in Public Safety and Security
Authors: Colleen McCue
Venue: IT Professional (2006)

Data mining and predictive analytics are finding roles outside of business, offering new lessons in translating data into actionable information.
Reliability Modeling and Analysis of Service-Oriented Robot Management System
Authors: Ping Zhang, Renqing Lu, Jing Zhang
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

It is an obvious trend that computer network and robot technology will more and more closely combine with each other. And the robot, especially the service robot such as house robot, entertainment robot, etc, will provide different kinds of services to the mankind. This paper introduces a Service-Oriented Network Robotic Management System (SONRMS) to coordinate and management the behaviors between robots and their users so as to provide high reliability and safety measures to users. Then SONRMS' architecture is put forward. SONRMS reliability model is described by use of Stochastic Reward Net, Reliability Block Datagram and Hierarchical Model. The influence among parameters of the system upon SONRMS reliability is analyzed in the end.
Probabilistic validation of aggregated data in vehicular ad-hoc networks
Authors: Fabio Picconi, Nishkam Ravi, Marco Gruteser, Liviu Iftode
Venue: Proceedings of the 3rd international workshop on Vehicular ad hoc networks (2006)

Vehicular ad-hoc networks present great opportunity for information exchange and equal opportunity for abuse. Validating traffic information without imposing significant communication overheads is a hard problem. In this paper, we propose a solution for validating aggregated data. The main idea is to use random checks to probabilistically catch the attacker, and thereby discourage attacks in the network. Our solution relies on PKI based authentication and assumes a tamper-proof service in each car to carry out certain secure operations such as signing and timestamping. We try to keep the set of secure operations as small as possible, in accordance with the principle of economy of mechanism. We show that our solution provides security without significant communication overheads.
Spacewire Interface Simulation
Authors: Gisbert Peter, Ulf Rohbeck, Rainer Berlin, Natascha Russ, Bernd Ulmer
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

Spacewire [1] is an interface standard for high rate peer-to-peer intercommunication between several nodes and routers for example between payloads and a spacecraft on-board computer. The functionalities of Spacewire continue to increase, mainly due to the increase of on-board software complexity. New facilities have to be provided to support the development and testing of Spacewire and on-board software applications. This paper provides an overview of a generic "request - action list" concept for real-time interface simulation physically implemented as a Spacewire Interface Simulator (SWIS). The SWIS concept provides a means of generic peer-to-peer interface simulations of the packet, protocol and application layer with free user- defined functionality for several simultaneous Spacewire links. A payload simulation can be established by "drag and drop" in a much shorter time than usually needed for project specific software development. Using the SWIS test and system engineers as well as managers can prepare simulations without any need for real-time software development. The effort (i.e. cost and time) for development of the test facility is reduced and the quality may increase significantly.
Does pseudo-relevance feedback improve distributed information retrieval systems?
Authors: Fernando Martínez-Santiago, Miguel A. García-Cumbreras, L. Alfonso Ureña-Lòpez
Venue: Information Processing and Management: an International Journal (2006)

This paper presents a thorough analysis of the capabilities of the pseudo-relevance feedback (PRF) technique applied to distributed information retrieval (DIR). Previous studies have researched the application of PRF to improve the selection process of the best set of collections from a ranked list. This work emphasizes the effectiveness of PRF applied to the collection fusion problem. Usually, DIR systems apply PRF in the same way as traditional Information Retrieval systems. For each collection, local results are improved through PRF. A first question which arises is whether this local improvement is preserved in the final result. In addition, DIR systems merge the documents of rankings that are returned from a set of collections. Since a new global list of documents is available, we could use that list to apply PRF again, but on global level rather than on a local level. In order to apply global PRF, we have developed a merging approach called two-step RSV. Finally, we describe a number of experiments involving the two levels, local and global, of application of the PRF techniques.
Discovering Gene Clusters via Integrated Analysis on Time-Series and Group-Comparative Microarray Datasets
Authors: Vincent S. Tseng, Lien-Chin Chen, Yao-Dung Hsieh
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

In this paper, we propose a novel gene clustering method named TGmix through integrated analysis on two types of datasets, namely the time-series and twogroup microarray datasets. The goal of the proposed method is to discover genes as biomarkers that have similar expression profiles in time-series conditions and are also significantly differentially expressed in two-group conditions. We applied the proposed method to microarray datasets for rat's wound healing experiment, and the genes discovered in the same cluster conform to the analysis goal with related biological functions.
Social Network Applications using Cellular Phones with E-mail Function
Authors: Hirokazu Tomiyasu, Takuya Maekawa, Takahiro Hara, Shojiro Nishio
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Recently, there has been an increasing interest in social networking, in which users can form new relationships between friends by introducing friends with each other. In this paper, we describe the design and implementation of a query propagation mechanism and its applications to realize a social network composed of mobile users. Our realized social network consists of multiple mobile phones and a server with the query propagation mechanism.
Covering minimum spanning trees of random subgraphs
Authors: Michel X. Goemans, Jan Vondrák
Venue: Random Structures Algorithms (2006)

We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we consider are subgraphs induced by a random subset of vertices, each vertex included independently with probability p, and subgraphs generated as a random subset of edges, each edge with probability p.Let n denote the number of vertices, choose p &isin; (0, 1) possibly depending on n, and let b = 1&#x002F;(1 - p). We show that in both random models, for any weighted graph G, there is a set of edges Q of cardinality O(n logbn) that contains the minimum spanning tree of a random subgraph of G with high probability. This result is asymptotically optimal. As a consequence, we also give a bound of O(kn) on the size of the union of all minimum spanning trees of G with some k vertices (or edges) removed. More generally, we show a bound of O(n logbn) on the size of a covering set in a matroid of rank n, which contains the minimum-weight basis of a random subset with high probability. Also, we give a randomized algorithm that calls an MST subroutine only a polylogarithmic number of times and finds the covering set with high probability. &copy; 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006
Saliency and Segregation Without Feature Gradient: New Insights for Segmentation from Orientation-Defined Textures
Authors: Ohad Ben-Shahar
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

The analysis of texture patterns, and texture segregation in particular, are at the heart of perceptual organization. In this paper we question the widely accepted view that the detection (both perceptual and computational) of salient perceptual singularities between perceptually coherent texture regions is tightly dependent upon feature gradients. Specifically, we study smooth orientation-defined textures (ODTs) and show that they exhibit striking perceptual singularities even without any outstanding gradients in their defining feature, namely orientation. We further show how these generic singularities are not only unpredictable from the orientation gradient, but that they also defy popular segmentation algorithms and neural models. We then examine smooth ODTs from a (differential) geometric point of view and develop a theory that fully predicts their perceptual singularities from two ODT curvatures. The computational results exhibit striking correspondence to segregation performed by human subjects and provide a conclusive evidence for the role of curvature in texture segregation. Extensions and implications of our results are developed for various aspects of visual processing.
Using RDL to Facilitate Customization of Variability Points
Authors: Toacy C. Oliveira, Marcilio Mendonca
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Reusable software assets have variability points, which are locations for customization. Reusable asset consumers, i.e. reusers, must become knowledgeable about the techniques used to implement variability, and the activities required to customize the variability points. Moreover reuse activities must be constrained to a specific sequence to avoid a lengthy error-prone reuse process and inconsistencies in the final application. Specifying reuse activities required to customize variability points using a programming language is a valuable contribution to the reuse process, given the way reuse is clearly exposed. Moreover reuse scripts described in such a language can be input to a reuse environment for automatic or semi-automatic assistance to the reuse process. In this work we discuss software reuse activities and illustrate how RDL (Reuse Description Language) can be used to facilitate variability point's customization.
Getting to the Point...?
Authors: Markus Gross
Venue: IEEE Computer Graphics and Applications (2006)

This viewpoint focuses on the utility of point primitives for computer graphics and visualization. The author analyzes recent advancements in modeling, rendering, and animation, and he compares essential properties of point primitives with those of triangles and voxels.
Research on Hot Line Lottery-Ticket-Buying Project Based on PSTN SMS
Authors: Yong Xu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

This paper introduces a kind of hot line lottery-ticket-buying project based on China's Publish Switch Telephone Network (PSTN) Short Message System (SMS). This project expands and improves on SMS. It adds a trade module of Chinese Terminal Service Interface (CTSI) server, operation trade gateway and specialized CP system (it also means to connect with the lottery service system and the lottery center), and meanwhile expands the CTSI protocol to enable SMS to connect with lottery center interactively, which can overcome the shortages of SMS that just carries out storage and retransmit functions. Different from lottery-ticket-buying system nowadays in China, this system is a kind of hot line system which can extends the deadline of bet and increases the lottery sale. The content of this paper are system constitution, protocol expanding, system function and advantages and disadvantages of this system.
Lattice Boltzmann Method for Real-Time Simulation of Lava Flows
Authors: Daniel van Raay, Terry Bossomaier
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

Methods for simulating viscous liquid flows, such as volcanic lava, are developed for use in real-time interactive graphical applications such as computer games. Eulerian Lattice Boltzmann methods are implemented and compared to simpler models based on cellular automata and particle systems. A new storage method, the chunky octree, a technique for removing instabilities through velocity limiting and a local approximation to global conservation, the swell and decay method are introduced to achieve real-time performance with frame creation to match video frame rates on desktop computers.
Cooperation of Computational Intelligence Agents
Authors: Roman Neruda
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

In this paper, a multi agent platform targeted toward the area of computational intelligence modeling is presented. We show the design of various computational agents creating multi agent systems, as well as the infrastructure capabilities. The focus of the system is the cooperation of agents, their interchangeability autonomous behavior, and emergence of new models. Two main areas of cooperation are presented: automated creation of a multi-agent system satisfying given constraints, and decision support for agent partner selection. It is demonstrated that such a system is able to assist in building hybrid artificial intelligence models based on data in a distributed environment.
Comparing the fault-proneness of new and modified code: an industrial case study
Authors: Piotr Tomaszewski, Lars-Ola Damm
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Faults are considered as one of the important factors affecting the cost of software development projects. To be able to efficiently handle faults, we must increase our understanding of the factors that make the code fault-prone. A majority of large software systems evolve during their lifetime. In each new release of the system the functionality can be added by writing new classes or/and by modifying already existing ones. In this study we compared the fault-proneness of new and modified classes in such systems. Our study is based on two releases of two large telecommunication systems developed at Ericsson. The major finding of the study is that the risk of introducing faults (the number of faults in the class /the number of new or modified lines of code in the class) is 20 to 40 times as high in modified classes compared to new ones. In the systems which we analyzed a small modification (a few percent) of the class resulted in as many faults as we would expect when the same class was written from scratch. Previous research on this relationship does not appear to exist. Partly in conflict with related research, we found that there is no statistically significant difference between the average number of faults in modified and new classes, and that the average fault-densities (the number of faults/the size of the entire class) in new and in modified classes are very similar. Finally, we also suggest how our findings can be used in practice.
Design and Implementation of Flash File System in S3C44B0X Embedded System
Authors: Guo Peiyuan, Chen Wenhua, Bao Man, Chen Yan, He Xiaoyan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

In this paper, we will introduce a kind of design scheme of Flash file system which aims at embedded system based on S3C44B0X processor. And we will solve the problems of Flash's low working speed and erasure times limit especially. The feasibility will be showed after realization in K9F2808U0C.
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Authors: Ivan Frain, Abdelaziz M'zoughi, Jean-Paul Bahsoun
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintaining the data consistent between replicas may become difficult if the read/write system has to ensure sequential consistency. In this paper, we limit the overhead due to the data consistency protocols by introducing a new dynamic quorum protocol called the elementary permutation protocol.This protocol permits the dynamic reconfiguration of a tree-structured coterie [2] in function of the load of the machines that possess the data replicas. It applies a tree transformation in order to obtain a new less loaded coterie. This permutation is based on the load information of a small group of machines possessing the copies. The implementation and the evaluation of our algorithm have been based on the existing atomic read/write service of [14]. We demonstrate that the elementary permutation ameliorates the system's throughput upto 50% in the best case. The results of our simulation show that the tree reconfiguration based on the elementary permutation is more efficient for a relatively small number of copies.
Survey of Test Vector Compression Techniques
Authors: Nur A. Touba
Venue: IEEE Design Test (2006)

Test data compression consists of test vector compression on the input side and response compaction on the output side. Test vector compression has been an active area of research, yielding a wide variety of techniques. This article summarizes and categorizes these techniques, explaining how they relate to one another. The goal is to provide a framework for understanding the theory and research in this area.