ppxscal/embedding_network huggingface dataset:
Two-Phased Approximation Algorithms for Minimum CDS in Wireless Ad Hoc Networks
Authors: Peng-Jun Wan, Lixin Wang, Frances Yao
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc networks have been proposed in the literature. The majority of these distributed algorithms follow a general two-phased approach. The first phase constructs a dominating set, and the second phase selects additional nodes to interconnect the nodes in the dominating set. In this paper, we prove that the approximation ratio of the two-phased algorithm in [10] is at most 7 1\3, improving upon the previous best-known approximation ratio of 7.6 due to [12]. We also propose a new two-phased approximation algorithm and prove that its approximation ratio is at most 6 7\18. Our analyses exploit an improved upper bound on the number independent points that can be packed in the neighborhood of a connected finite planar set.
Modeling an e-based real-time quality control information system in distributed manufacturing shops
Authors: Iraj Mahdavi, Babak Shirazi, Namjae Cho, Navid Sahebjamnia, Shahram Ghobadi
Venue: Computers in Industry (2008)

In a distributed manufacturing shop (DMS), factories of various levels of manufacturing capabilities are equipped with diverse types of machines and tools and are scattered around many geographically different locations. Because of such geographical diversity, the quality control of sub-assemble products (SAP) is of great importance to ensure a high level of production quality. To address the challenges of DMS management, manufacturers need to access real-time operational information captured from multiple locations. A real-time quality control information system (RTQCIS) can help control the flow of quality-related information among shop floors in the production network. This paper suggests a unique design of RTQCIS based on a new mathematical model. This model concentrates on converting multi-attribute quality measurements into a quality value corresponding to each entity in the quality space. To validate the proposed approach a prototype e-RTQCIS-DMS is developed and applied to subcontractors of an automobile company.
Application of the Variational Iteration Method for Inverse Stefan Problem with Neumann's Boundary Condition
Authors: Damian Słota
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

In this paper, the possibility of application of the variational iteration method for solving the inverse Stefan problem with a Neumann boundary condition is presented. This problem consists in a calculation of temperature distribution as well as in the reconstruction of the function which describes the heat flux on the boundary, when the position of the moving interface is known. The validity of the approach is verified by comparing the results obtained with the analytical solution.
Grid computing of spatial statistics: using the TeraGrid for G <stack>i*</stack>(d) analysis
Authors: Shaowen Wang, Mary Kathryn Cowles, Marc P. Armstrong
Venue: Concurrency and Computation: Practice Experience (2008)

The massive quantities of geographic information that are collected by modern sensing technologies are difficult to use and understand without data reduction methods that summarize distributions and report salient trends. Statistical analyses, therefore, are increasingly being used to analyze large geographic data sets over a broad spectrum of spatial and temporal scales. Computational Grids coordinate the use of distributed computational resources to form a large virtual supercomputer that can be applied to solve computationally intensive problems in science, engineering, and commerce. This paper presents a solution to computing a spatial statistic, G <stack>i*</stack>(d) using Grids. Our approach is based on a quadtree-based domain decomposition that uses task-scheduling algorithms based on GridShell and Condor. Computational experiments carried out on the TeraGrid were designed to evaluate the performance of solution processes. The Grid-based approach to computing values for G <stack>i*</stack>(d) shows improved performance over the sequential algorithm while also solving larger problem sizes. The solution demonstrated not only advances knowledge about the application of the Grid in spatial statistics applications but also provides insights into the design of Grid middleware for other computationally intensive applications. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Neurobiologically Inspired, Multimodal Intention Recognition for Technical Communication Systems (NIMITEK)
Authors: Andreas Wendemuth, Jochen Braun, Bernd Michaelis, Frank Ohl, Dietmar Rösner, Henning Scheich, Ralf Warnemünde
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

NIMITEK investigates basic principles of the processing of input (speech, mimics, direct modes), knowledge representation and decision making in dialogue situations between biological / human and technical cognitive systems. This is prototypical for the basic problem of modeling intelligent behavior in interaction with a non-transparent and rapidly changing environment. NIMITEK provides a technical demonstrator to study these principles in a dedicated prototypical task, namely solving the game "Towers of Hanoi". In this paper, we will describe the general approach NIMITEK takes to emotional man-machine interactions, and we will present the principles of the demonstrator.
Estimation of Multiple Objects at Unknown Locations with Active Contours
Authors: Margarida Silveira, Jorge S. Marques
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper presents an algorithm for the estimation of multiple regions with unknown shapes and positions using multiple active contour models (ACM's). The algorithm organizes edge points into strokes and computes the association between those strokes and the ACM's using the component wise EM algorithm (CEM) for MAP estimation. The algorithm is randomly initialized with a high number of ACM's and performs online model selection using importance sampling. Experimental results show the effectiveness of the proposed technique.
A lightweight rao-cauchy detector for additive watermarking in the dwt-domain
Authors: Roland Kwitt, Peter Meerwald, Andreas Uhl
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

This paper presents a lightweight, asymptotically optimal blind detector for additive spread-spectrum watermark detection in the DWT domain. In our approach, the marginal distributions of the DWT detail subband coefficients are modeled by one-parameter Cauchy distributions and we assume no knowledge of the watermark embedding power. We derive a Rao hypothesis test to detect watermarks of unknown amplitude in Cauchy noise and show that the proposed detector is competitive with the Generalized Gaussian detector, yet is more efficient in terms of required computations.
Continuous Skyline Tracking on Update Data Streams
Authors: Li Tian, Le Wang, Aiping Li, Peng Zou, Yan Jia
Venue: Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management (2007)

We consider the continuous skyline computation in a new scenario named as update stream, where the First-In-First-Out rule (which is the basic character in sliding window model) does not hold, causing the existing algorithms inapplicable. An algorithm called BUSM is developed and analyzed, which can continuous compute the change of skyline caused by update messages; then a progressive algorithm GUSM based on a novel grid-indexed data structure is proposed, which makes use of the character that deletion and addition operation appears simultaneously in update streams, and represents the influence region by grids for early elimination. Analytical analysis and experimental evidences show the efficiency of proposed approaches.
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Authors: Vladimir Kolesnikov, Thomas Schneider
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

We consider general secure function evaluation (SFE) of private functions (PF-SFE). Recall, privacy of functions is often most efficiently achieved by general SFE [18,19,10] of a Universal Circuit (UC).Our main contribution is a new simple and efficient UC construction. Our circuit UC k , universal for circuits of k gates, has size ~1.5 k log2 k and depth ~k logk. It is up to 50% smaller than the best UC (of Valiant [16], of size ~19klogk) for circuits of size up to ≈ 5000 gates.Our improvement results in corresponding performance improvement of SFE of (small) private functions. Since, due to cost, only small circuits (i.e. < 5000 gates) are practical for PF-SFE, our construction appears to be the best fit for many practical PF-SFE.We implement PF-SFE based on our UC and Fairplay SFE system [11].
Accessibility commons: a metadata infrastructure for web accessibility
Authors: Shinya Kawanaka, Yevgen Borodin, Jeffrey P. Bigham, Darren Lunn, Hironobu Takagi, Chieko Asakawa
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Research projects, assistive technology, and individuals all create metadata in order to improve Web accessibility for visually impaired users. However, since these projects are disconnected from one another, this metadata is isolated in separate tools, stored in disparate repositories, and represented in incompatible formats. Web accessibility could be greatly improved if these individual contributions were merged. An integration method will serve as the bridge between future academic research projects and end users, enabling new technologies to reach end users more quickly. Therefore we introduce Accessibility Commons, a common infrastructure to integrate, store, and share metadata designed to improve Web accessibility. We explore existing tools to show how the metadata that they produce could be integrated into this common infrastructure, we present the design decisions made in order to help ensure that our common repository will remain relevant in the future as new metadata is developed, and we discuss how the common infrastructure component facilitates our broader social approach to improving accessibility.
Exploratory Identification of Image-Based Biomarkers for Solid Mass Pulmonary Tumors
Authors: Ifeoma Nwogu, Jason J. Corso
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

If imaging is to serve as a valid biomarker in the assessment of the response of cancer to therapies, a reproducible and predictive radiologic metric is required. A biomarker is an indicator of a biological property that can be used to measure the progress of disease. While current size-based, quantitative techniques provide numerical representations of tumors, they are not necessarily indicative of disease progression for advanced cancers. In this paper, we present an end-to-end process to explore the use of other image-based features especially statistical textural features for cancer change detection. We exploit the earth mover's distance metric for measuring the change in the tumor burden over a period, between the time the baseline scans were taken, and the time the therapy response scans were taken. The time-to-progression (TTP) of the disease is our known patient outcome. We analyze the correlations between TTP and our change measurements and discover that the local texture energy feature is most predictive of disease progression, more so than the tumor burden size on which current quantitative measures are made.
Programmability Models for Sensor Networks
Authors: Torsten Braun
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Hard-coding of algorithms with tuneable parameters is not flexible in sensor networks. Also downloading executable files into each sensor node individually might be a problem when single sensor nodes are not permanently reachable or only with high costs. A user should have the possibility for programming a sensor network as a whole in a dynamic way such that the user issues instructions into the sensor network once and code is automatically distributed / executed in the whole sensor network. There are several models for (re)programming wireless sensor networks: the active sensor model based on script interpreters and virtual machines, the mobile agent model, and the database model. The tutorial focuses on the active sensor model and the database model. Reliable transport is essential for transporting management information, configuration data, and code. The tutorial discusses transport protocol design in order to perform error and congestion control.
Approximate schemas, source-consistency and query answering
Authors: Michel Rougemont, Adrien Vieilleribière
Venue: Journal of Intelligent Information Systems (2008)

We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are ¿-close if every word (tree) of one language is ¿-close to the other. A transducer model is introduced to compare tree languages (schemas) with different alphabets and attributes. Using the statistical embedding of Fischer et al. (Proceedings of 21st IEEE Symposium on Logic in Computer Science, pp. 421---430, 2006), we show that Source-Consistency and Approximate Query Answering are testable on words and trees, i.e. can be approximately decided within ¿ by only looking at a constant fraction of the input.
Distributed Intelligent System for Personalized Therapy of Speech Disorders
Authors: Mirela Danubianu, Stefan-Gheorghe Pentiuc, Ovidiu Andrei Schipor, Marian Nestor, Ioan Ungureanu
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

The aim of this paper is to describe an intelligent system designed for assisting the personalized therapy of dyslalia for the Romanian prescholars children. This system is developed in the frame of TERAPERS project that can be included in a very important research area: informational technologies in response to society challenges - for health: early diagnosis, personalized therapy. Taking into consideration the fact that Romanian language is a phonetic one that has its own special linguistic particularities, there is a real need for the development and use of audio-video systems, which can be used in the therapy of different speech problems. The system has a high degree of originality because his objective is to treat the pronunciation disorders in Romanian language. Also the complexity of the project results from the high number of different research areas involved: artificial intelligence, virtual reality, digital signal processing, digital electronic and psychology.
Arabic Handwritten Characters Classification Using Learning Vector Quantization Algorithm
Authors: Mohamed A. Ali
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

In this module, Learning Vector Quantization LVQ neural network is first time introduced as a classifier for Arabic handwritten character. Classification has been performed in two different strategies, in first strategy, we use one classifier for all 53 Arabic Character Basic Shapes CBSs in training and testing phases, in second strategy we use three classifiers for three subsets of 53 Arabic CBSs, the three subsets of Arabic CBSs are; ascending CBSs, descending CBSs and embedded CBSs. Three training algorithms; OLVQ1, LVQ2 and LVQ3 were examined and OLVQ1 found as the best learning algorithm.
Particle Filter with Swarm Move for Optimization
Authors: Chunlin Ji, Yangyang Zhang, Mengmeng Tong, Shengxiang Yang
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

We propose a novel generalized algorithmic framework to utilize particle filter for optimization incorporated with the swarm move method in particle swarm optimization (PSO). In this way, the PSO update equation is treated as the system dynamic in the state space model, while the objective function in optimization problem is designed as the observation/measurement in the state space model. Particle filter method is then applied to track the dynamic movement of the particle swarm and therefore results in a novel stochastic optimization tool, where the ability of PSO in searching the optimal position can be embedded into the particle filter optimization method. Finally, simulation results show that the proposed novel approach has significant improvement in both convergence speed and final fitness in comparison with the PSO algorithm over a set of standard benchmark problems.
OLAP for Trajectories
Authors: Oliver Baltzer, Frank Dehne, Susanne Hambrusch, Andrew Rau-Chaplin
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

In this paper, we present an OLAP framework for trajectories of moving objects. We introduce a new operator GROUP_TRAJECTORIES for group-by operations on trajectories and present three implementation alternatives for computing groups of trajectories for group-by aggregation: group by overlap, group by intersection, and group by overlap and intersection. We also present an interactive OLAP environment for resolution drill-down/roll-up on sets of trajectories and parameter browsing. Using generated and real life moving data sets, we evaluate the performance of our GROUP_TRAJECTORIES operator. An implementation of our new interactive OLAP environment for trajectories can be accessed at http://OLAP-T.cgmlab.org .
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
Authors: Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Robert Plemmons, Shun-Ichi Amari
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way blind source separation (BSS), multi-sensory or multi-dimensional data analysis, and sparse image coding. We consider alpha- and beta-divergences as error (cost) functions and derive three different algorithms: (1) multiplicative updating; (2) fixed point alternating least squares (FPALS); (3) alternating interior-point gradient (AIPG) algorithm. We also incorporate these algorithms into multilayer networks. Experimental results confirm the very useful behavior of our multilayer 3D NTF algorithms with multi-start initializations.
Symmetry in quantum walks
Authors: Todd A. Brun
Venue:  (2007)

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. We derive an expression for hitting time using superoperators, and numerically evaluate it for the walk on the hypercube for various coins and decoherence models. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks can have infinite hitting times for some initial states. We seek criteria to determine if a given walk on a graph will have infinite hitting times, and find a sufficient condition, which for discrete time quantum walks is that the degeneracy of the evolution operator be greater than the degree of the graph. The phenomenon of infinite hitting times is in general a consequence of the symmetry of the graph and its automorphism group. Symmetries of a graph, given by its automorphism group, can be inherited by the evolution operator. Using the irreducible representations of the automorphism group, we derive conditions such that quantum walks defined on this graph must have infinite hitting times for some initial states. Symmetry can cause the walk to also be confined to a subspace of the original Hilbert space for cartain initial states. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. We conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speed-up. Finally, we use symmetry and the theory of decoherence-free subspaces to determine when the subspace of the quotient graph is a decoherence-free subspace of the dynamics.
A Novel Bimodal Identification Approach Based on Hand-Print
Authors: Hui Yan, Duo Long
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

A new approach for the personal identification using hand images is presented. This paper attempts to improve the performance of palm-print-based verification system by integrating hand geometry features and finger-print features. Unlike other bimodal biometric systems, the users do not have to undergo the inconvenience of using two diferent sensors since the palm-print, finger-print and hand geometry features can be acquired from the same image. Three kinds of handprint features are extracted for the identification. First the hand geometric feature is used for a coarse matching to select the similar candidates from database. Then the finger print and palm print feature are presented by wavelet zero-crossing. After that both of the two kinds of 1-D features are used in the fine level identification stage. The proposed algorithm has been shown to classify hand-prints with an accuracy of 97%.
Analysis and Improvements of Two Identity-Based Perfect Concurrent Signature Schemes
Authors: Zhenjie Huang, Kefei Chen, Xuanzhi Lin, Rufen Huang
Venue: Informatica (2007)

The notion of concurrent signatures was introduced by Chen, Kudla and Paterson in their seminal paper in Eurocrypt 2004. In concurrent signature schemes, two entities can produce two signatures that are not binding, until an extra piece of information (namely the keystone) is released by one of the parties. Upon release of the keystone, both signatures become binding to their true signers concurrently. In ICICS 2005, two identity-based perfect concurrent signature schemes were proposed by Chow and Susilo. In this paper, we show that these two schemes are unfair. In which the initial signer can cheat the matching signer. We present a formal definition of ID-based concurrent signatures which redress the flaw of Chow et al.'s definition and then propose two simple but significant improvements to fix our attacks. This work is supported by the National Natural Science Foundation of China under Grant No.60673078, the China Postdoctoral Science Foundation under Grant No. 20060390152, the Natural Science Foundation of Fujian Province of China under Grant No.2006J0045 and the Innovation Foundation for Young Technological Talents of Fujian Province of China under Grant No.2005J055.