ppxscal/embedding_network huggingface dataset:
An Efficient Anti-collision Protocol Using Bit Change Sensing Unit in RFID System
Authors: Young Tae Kim, Seong Joon Lee, Kwang Seon Ahn
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

A tag collision problem, which is one of core issues when building the RFID system, reduces the efficiency of identifying tags. To solve the tag collision problem, various protocols have been proposed and studied. Almost all the tree-based algorithms aim at generating the unique prefix, and identifying tags as quickly as possible. However, the existing protocols, when manytags are placed on the same range, are increasing the number of query , and expending a great deal of time in identifying tags. In this paper, we proposed the QTBSC protocol to reduce the number of query. The protocol creates a prefix by using bit change sensing unit and time slot. That is, the proposed protocol is designed so as to send the bits from the next bit of prefix to the bit which has the other value. Consequently, as sending bit group which can easily be tracking a new prefix, this method can reduce the number of query. As a result of a simulation, this paper shows that less time is needed for identifying tags by reducing the number of query-response more thanQuery Tree and 4-Ary Query Tree.
Web-Annotations for Humans and Machines
Authors: Norbert E. Fuchs, Rolf Schwitter
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

We propose to manually annotate web pages with computer-processable con trolled natural language. These annotations have well-defined formal properties and can be used as query relevant summaries to automatically answer questions expressed in controlled natural language, and as the basis for other forms of automated reasoning. Last, but not least, the annotations can also serve as human-readable summaries of the contents of the web pages. Arguably, annotations written in controlled natural language can bridge the gap between informal and formal notations and leverage true collaboration between humans and machines. This is a position paper that proposes a solution combining existing methods and techniques to achieve a highly relevant practical goal, namely how to effectively access information on the web. However, our solution introduces a "chicken and egg" problem: a critical mass of web annotations will be necessary that people perceive the value of these annotations and start annotating web pages themselves. Only the future will show whether this --- basically non-technical --- problem can be solved.
Clustering with alternative similarity functions
Authors: Wesam Barbakh, Colin Fyfe
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

We [6, 7] have recently investigated several families of clustering algorithms. In this paper, we show how a novel similarity function can be integrated into one of our algorithms as a method of performing clustering and show that the resulting method is superior to existing methods in that it canbe shown to reliably find a globally optimal clustering rather than local optima which other methods often find. We also extend the method to perform topology preserving mappings and show the results of such mappings on artificial and real data.
Detail preserving deformation of B-spline surfaces with volume constraint
Authors: Basile Sauvage, Stefanie Hahmann, Georges-Pierre Bonneau, Gershon Elber
Venue: Computer Aided Geometric Design (2008)

Geometric constraints have proved to be helpful for shape modeling. Moreover, they are efficient aids in controlling deformations and enhancing animation realism. The present paper addresses the deformation of B-spline surfaces while constraining the volume enclosed by the surface. Both uniform and non-uniform frameworks are considered. The use of level-of-detail (LoD) editing allows the preservation of fine details during coarse deformations of the shape. The key contribution of this paper is the computation of the volume with respect to the appropriate basis for LoD editing: the volume is expressed through all levels of resolution as a trilinear form and recursive formulas are developed to make the computation efficient. The volume constrained is maintained through a minimization process for which we develop closed solutions. Real-time deformations are reached thanks to sparse data structures and efficient algorithms.
Must Software Research Stand Divided?
Authors: Hakan Erdogmus
Venue: IEEE Software (2008)

A not-so-subtle divide separates empirical and constructionist software research. Constructionists maintain that software research should be about creating technologies, devising new methods. Empiricists are interested in studying and understanding existing approaches. The antagonism between the two camps does not serve our industry well—it needs both modes of research.
Active Tags for Semantic Analysis
Authors: Ivan Habernal, Miloslav Konopík
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

We propose a new method for semantic analysis. The method is based on handwritten context-free grammars enriched with semantic tags. Associating the rules of a context-free grammar with semantic tags is beneficial; however, after parsing the tags are spread across the parse tree and it is usually hard to extract the complete semantic information from it. Thus, we developed an easy-to-use and yet very powerful mechanism for tag propagation. The mechanism allows the semantic information to be easily extracted from the parse tree. The propagation mechanism is based on an idea to add propagation instruction to the semantic tags. The tags with such instructions are called active tags in this article. Using the proposed method we developed a useful tool for semantic parsing that we offer for free on our internet pages.
Local government: A digital intermediary for the information age?
Authors: Dave Griffin, Eddie Halpin
Venue: Information Polity (2002)

With the development of e-commerce, digital intermediaries have joined the value chain linking suppliers and consumers. These intermediaries add value by undertaking several roles: aggregation, facilitation, matching and providing an environment of trust for transacting parties. In the public sector, the UK Government is driving forward the introduction of electronic service delivery by local authorities. In some of its dealings, local government intermediates between consumers and other organsations. This paper examines how local authorities have undertaken the role of digital intermediary. The service delivery of two 'life episode' transactions are evaluated. It concludes that most local authorities are currently operating as emerging or partial intermediaries.
Straight Skeletons of Three-Dimensional Polyhedra
Authors: Gill Barequet, David Eppstein, Michael T. Goodrich, Amir Vaxman
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

We study the straight skeleton of polyhedra in 3D. We first show that the skeleton of voxel-based polyhedra may be constructed by an algorithm taking constant time per voxel. We also describe a more complex algorithm for skeletons of voxel polyhedra, which takes time proportional to the surface-area of the skeleton rather than the volume of the polyhedron. We also show that any n-vertex axis-parallel polyhedron has a straight skeleton with O(n 2) features. We provide algorithms for constructing the skeleton, which run in O( min (n 2logn,klog O(1) n)) time, where k is the output complexity. Next, we show that the straight skeleton of a general nonconvex polyhedron has an ambiguity, suggesting a consistent method to resolve it. We prove that the skeleton of a general polyhedron has a superquadratic complexity in the worst case. Finally, we report on an implementation of an algorithm for the general case.
The Rao Detection of Weak Signal in Gaussian Mixture Noise
Authors: Qianxue Fang, Yongliang Wang, Shouyong Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

The expectation maximization (EM) algorithm is available for Gaussian mixture density estimation. However, if there is not an appropriate initialization, the iterative computation will stop at initialization trap and lead to improper estimation. In this paper, the moment-EM algorithm is proposed to overcome the problem. It means to compute the moment-estimation of parameter and initialize parameter with moment-estimation firstly, and then amend the estimation through EM algorithm. In succession, with the Gaussian filter based on estimated parameter, the paper presents the Rao decision rule of the weak signal with unknown amplitude under Gaussian mixture noise environment. Simulation results indicate that moment-EM algorithm can estimate parameter accurately and the detection performance of Rao test based on moment-EM Algorithm outperforms that of Rao test based on EM Algorithm
An Empirical Case-Study of a Central-Server-Model on System Performance
Authors: Stefan Schreieck, Reinhard German, Kai-Steffen Hielscher
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

This paper investigates from a practical point of view the applicability and the limits of a simple Central-Server-Model for performance modeling. To model the prolific webserver at the University of Applied Sciences in Kempten the study uses a Central-Server-Queuing-Theory-Model consisting of a single CPU server/queue and a single Disk server/queue. First the webserver is monitored and the model is calibrated using real data. Then performance is predicted using the model and the outcomes are compared to reality. In addition the model is validated analyzing the calculated and the measured response times with the aid of replaying a sequence of requests. A key point the paper deals with, is the question which and how much information gets lost using such a simple model.
Autonomous Reconfiguration in a Self-assembling Multi-robot System
Authors: Rehan O'Grady, Anders Lyhne Christensen, Marco Dorigo
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

Self-assembling multi-robot systems can, in theory, overcome the physical limitations of individual robots by connecting to each other to form particular physical structures (morphologies) relevant to specific tasks. Here, we show for the first time how robots in a real-world multi-robot system can autonomously self-assemble into and reconfigure between arbitrary morphologies. We use a distributed control paradigm. The robots are individually autonomous and homogeneous - they all independently execute the same control program. Inter-robot communication is visual and strictly local. We demonstrate our technique on real robots.
Searching Correlated Objects in a Long Sequence
Authors: Ken C. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Sequence, widely appearing in various applications (e.g. event logs, text documents, etc) is an ordered list of objects. Exploring correlated objects in a sequence can provide useful knowledge among the objects, e.g., event causality in event log and word phrases in documents. In this paper, we introduce correlation query that finds correlated pairs of objects often appearing closely to each other in a given sequence. A correlation query is specified by two control parameters, distance bound, the requirement of object closeness, and correlation threshold, the minimum requirement of correlation strength of result pairs. Instead of processing the query by scanning the sequence multiple times, that is called Multi-Scan Algorithm (MSA), we propose One-Scan Algorithm (OSA) and Index-Based Algorithm (IBA). OSA accesses a queried sequence once and IBA considers correlation threshold in the execution and effectively eliminates unneeded candidates from detail examination. An extensive set of experiments is conducted to evaluate all these algorithms. Among them, IBA, significantly outperforming the others, is the most efficient.
Speed control of double stator synchronous machine supplied by two independent voltage source inverters
Authors: Nazih Moubayed
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

In high power applications, power division methods for AC high power converters and machines are used. The rated power of the elementary converters and/or machines becomes lower when the number of converters and/or machines increases. Therefore, power switches with high switching frequency can be used. Then, the current and torque ripples would have theoretically lower amplitude. The speed control of a double stator synchronous machine supplied by two independent voltage source inverters, which is an application of power division, is studied in this paper. After presenting the system under consideration, three strategies of current control are treated. The speed control method is also discussed.
Peer-to-Peer Large-Scale Collaborative Storage Networks
Authors: Thomas Bocek, Burkhard Stiller
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

This paper presents the idea of a fully decentralized peer-to-peer col-laborative network with a robust, scalable and incentive-compatible system ena-bling storage, retrieval, and manipulation of documents. Modified documents are reviewed in a voting session by other peers. Derived from a scenario, which follows the idea of a distributed encyclopedia, key research questions are concluded.
OpenHouse: A Secure Platform for Distributed Home Services
Authors: Jani Suomalainen, Seamus Moloney, Juha Koivisto, Kari Keinänen
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

A large amount of versatile services are emerging as home networks and devices are opened for different manufacturers and service developers. With this complexity comes a need to make these services more personalized and secure. However, at the same time, the home network should be easy to manage for non-expert users. In this paper, we propose OpenHouse, a TLS based distributed security architecture for use in home networks. We have adopted a fine-grained role and domain based authorization model and studied how the configuration burden for end users can be minimized by classifying services in a security relevant manner and providing homes with default security policies. We evaluated the feasibility of the proposal by implementing a secured UPnP based platform on Nokia N800 Internet tablet and Gumstix low-end Linux devices. We report the implications the approach has for developers and for end user experience as well as the challenges it still faces.
A User-Centered Approach for Ubiquitous Service Evaluation: An Evaluation Metrics Focused on Human-System Interaction Capability
Authors: Joohwan Lee, Joobong Song, Hyungsup Kim, Junyoung Choi, Myung Hwan Yun
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

As the ubiquitous era took off, the interactions between ubiquitous services and users have come to take an important position. So it is necessary to develop new evaluation method that evaluates interactivity with a user-centered perspective. The main objective of this study is the development of user-centered interactivity evaluation metrics of ubiquitous service attributes. For this objective, first, existing ubiquitous service evaluation methodologies are reviewed to define the evaluation attributes for ubiquitous service evaluation. Second, user oriented interactive metrics that can overcome the limitations of those service evaluation methodologies, such as personal service evaluation techniques, usability evaluation techniques and psychometrics based evaluation techniques, are developed. As a validation study, suggested evaluation metrics is utilized to evaluate the u-home service, and priority of each metrics is derived. The suggested evaluation metrics can be used to evaluate the interactivity level of ubiquitous service and identify the potential users and their requirements at the stage of service development.
The TSRM Approach in the Document Retrieval Application
Authors: Efthymios Drymonas, Kalliopi Zervanou, Euripides G. Petrakis
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

We propose TSRM, an alternative document retrieval model relying on multi-word, rather than mere single key-word domain terms, typically applied in traditional IR.
Proposed framework to manage cognitive load in computer program learning
Authors: Muhammed Yousoof, Mohd Sapiyan, K. Ramasamy
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

Cognitive load experienced while learning programming is very high due to the high element of interactivity and poor instructional design. Prior researchers [2][5][6][8] have focused to minimize the load such as program visualization, pair programming etc. The impact of these measures is not determinable since there is no mechanism to monitor the load and thus the results of the previous researches are very subjective. In this paper, we propose a framework which consists of 3 layers. This framework will help in managing the load by monitoring the load. When the load exceeds the capacity, the instructional design could be altered or customized to enable the learning. This framework is a novel way to ease the learning process of computer programming. This paper conceptually proposes the framework with the necessary algorithms.
Realization of Dynamically Adaptive Weather Analysis and Forecasting in LEAD: Four Years Down the Road
Authors: Lavanya Ramakrishnan, Yogesh Simmhan, Beth Plale
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Linked Environments for Atmospheric Discovery (LEAD) is a large-scale cyberinfrastructure effort in support of mesoscale meteorology. One of the primary goals of the infrastructure is support for real-time dynamic, adaptive response to severe weather. In this paper we revisit the conception of dynamic adaptivity as appeared in our 2005 DDDAS workshop paper, and discuss changes since the original conceptualization, and lessons learned in working with a complex service oriented architecture in support of data driven science.
Exploiting locality of interaction in factored Dec-POMDPs
Authors: Frans A. Oliehoek, Matthijs T. J. Spaan, Shimon Whiteson, Nikos Vlassis
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute an expressive framework for multiagent planning under uncertainty, but solving them is provably intractable. We demonstrate how their scalability can be improved by exploiting locality of interaction between agents in a factored representation. Factored Dec-POMDP representations have been proposed before, but only for Dec-POMDPs whose transition and observation models are fully independent. Such strong assumptions simplify the planning problem, but result in models with limited applicability. By contrast, we consider general factored Dec-POMDPs for which we analyze the model dependencies over space (locality of interaction) and time (horizon of the problem). We also present a formulation of decomposable value functions. Together, our results allow us to exploit the problem structure as well as heuristics in a single framework that is based on collaborative graphical Bayesian games (CGBGs). A preliminary experiment shows a speedup of two orders of magnitude.
Large-scale phylogenetic analysis on current HPC architectures
Authors: Michael Ott, Jaroslaw Zola, Srinivas Aluru, Andrew D. Johnson_aff3n4, Daniel Janies, Alexandros Stamatakis
Venue: Scientific Programming (2008)

Phylogenetic inference is considered a grand challenge in Bioinformatics due to its immense computational requirements. The increasing popularity and availability of large multi-gene alignments as well as comprehensive datasets of single nucleotide polymorphisms (SNPs) in current biological studies, coupled with rapid accumulation of sequence data in general, pose new challenges for high performance computing. By example of RAxML, which is currently among the fastest and most accurate programs for phylogenetic inference under the Maximum Likelihood (ML) criterion, we demonstrate how the phylogenetic ML function can be efficiently scaled to current supercomputer architectures like the IBM BlueGene/L (BG/L) and SGI Altix. This is achieved by simultaneous exploitation of coarse- and fine-grained parallelism which is inherent to every ML-based biological analysis. Performance is assessed using datasets consisting of 270 sequences and 566,470 base pairs (haplotype map dataset), and 2,182 sequences and 51,089 base pairs, respectively. To the best of our knowledge, these are the largest datasets analyzed under ML to date. Experimental results indicate that the fine-grained parallelization scales well up to 1,024 processors. Moreover, a larger number of processors can be efficiently exploited by a combination of coarse- and fine-grained parallelism. We also demonstrate that our parallelization scales equally well on an AMD Opteron cluster with a less favorable network latency to processor speed ratio. Finally, we underline the practical relevance of our approach by including a biological discussion of the results from the haplotype map dataset analysis, which revealed novel biological insights via phylogenetic inference.
Multimodal Unit Selection for 2D Audiovisual Text-to-Speech Synthesis
Authors: Wesley Mattheyses, Lukas Latacz, Werner Verhelst, Hichem Sahli
Venue: Proceedings of the 5th international workshop on Machine Learning for Multimodal Interaction (2008)

Audiovisual text-to-speech systems convert a written text into an audiovisual speech signal. Lately much interest goes out to data-driven 2D photorealistic synthesis, where the system uses a database of pre-recorded auditory and visual speech data to construct the target output signal. In this paper we propose a synthesis technique that creates both the target auditory and the target visual speech by using a same audiovisual database. To achieve this, the well-known unit selection synthesis technique is extended to work with multimodal segments containing original combinations of audio and video. This strategy results in a multimodal output signal that displays a high level of audiovisual correlation, which is crucial to achieve a natural perception of the synthetic speech signal.
A Hybrid Model of Partial Least Squares and RBF Neural Networks for System Identification
Authors: Nini Wang, Xiaodong Liu, Jianchuan Yin
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks (2008)

A novel learning algorithm is presented to construct radial basis function (RBF) networks by incorporating partial least squares (PLS) regression method. The algorithm selects hidden units one by one with PLS regression method until an adequate network is achieved, and the resulting minimal RBF-PLS (MRBF-PLS) network exhibits satisfying generalization performance and noise toleration capability. The algorithm provides an efficient approach for system identification, and this is illustrated by modelling nonlinear function and chaotic time series.