ppxscal/embedding_network huggingface dataset:
Tracking Targets with Quality inWireless Sensor Networks
Authors: Guanghui He, Jennifer C. Hou
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Tracking of moving targets has attracted more and more attention due to its importance in utilizing sensor networks for surveillance. In this paper, we consider the issue of how to track mobile targets with certain level of quality ofmonitoring (QoM), while conserving power. We address the target tracking problem by taking into account of both the coverage and the QoM. In particular, QoM ensures that the probability of reporting inaccurate monitoring information (such as false alarm or target miss) should be as small as possible, even in the presence of noises and signal attenuation. We also analytically whether or not the detection/observation made by a single sensor suffices to tracking the target in a reasonably populated sensor network. Our finding gives a confirmative answer and challenges the long-held paradigm that high tracking quality (low tracking error) necessarily requires high power consumption.To rigorously analyze the impact of target movement on QoM, we derive both lower and upper bounds on the number of sensors (called duty sensors) required to keep track of a moving target. Based on the analysis, we have devised a cooperative, relay-areabased scheme that determines which sensor should become the next duty sensor when the target is moving. The simulation study indicates that the number of duty sensor required in the proposed scheme is, in the worst case, approximately 1.2 times larger than the lower bound. It also indicates that a trade-off exists among QoM, the number of duty sensors required, and the load balance.
Off-Line Robot Programming Framework
Authors: Vitor Santos Bottazzi, Jaime Francisco Cruz Fonseca
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The industrial robot programming is a work for specialist in robotics. Today, this work is very hard because there are many robot manufacturers with different languages and different programming environments. Although, off-line programming is an way that can reduce drastically the machines stop time to maintenance. With the use of object oriented design patterns, it is possible minimize the time spent in robot programming. In this work is proposed a off-line programming environment. This tool is based in one abstract model to program robots, encapsulate in java classes. This way has the main advantage of best source code utilization. Grouping the business classes in modules by functionalities, we can reduce complexity between low matching. Recognized patterns like Facade and Template Method will construct the base to develop this programming framework. The programming robot languages tested in this work was Rapid, Karel and Melfa Basic IV, respectively languages used by ABB, Fanuc and Mitsubishi constructors.
View-dependent tetrahedral meshing and rendering
Authors: Ralf Sondershaus, Wolfgang Straßer
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Interactive exploration of huge tetrahedral meshes is required by many applications but the limitations of the current hardware do not allow for the full dataset to be rendered at interactive frame rates. Multi resolution representations are an important tool to adapt the tetrahedral mesh complexity to the current viewing parameters in real time rendering environments.We present a meshing framework that builds a compact multi resolution representation for large tetrahedral meshes. A preprocessing step simplifies the mesh into a binary vertex hierarchy which is used at run time to adapt the mesh to viewing parameters. Exploiting the redundancy in the connectivity information of the mesh enables us to store the vertex hierarchy compactly such that a vertex split or edge collapse can be performed by knowing incremental updates only.We integrated this multiresolution representation into a volume rendering environment that supports direct volume rendering as well as a new point based rendering approach.
Comparison of auditory, visual, and audiovisual navigation in a 3D space
Authors: Matti Gröhn, Tapio Lokki, Tapio Takala
Venue: ACM Transactions on Applied Perception (TAP) (2005)

A navigation test was carried out in a spatially immersive virtual environment. The test was a gamelike experience where the task of subjects was to find as many gates as possible while they navigated through a track guided by auditory and/or visual cues. The results are presented as a function of the number of found gates, searching times, and normalized path lengths. Audiovisual navigation was clearly the most efficient. Visual navigation was second and the auditory navigation the least efficient. Further analysis of travel paths indicate that auditory cues were utilized in the beginning to locate the next gate; a visual cue was the most important in the final approach to the gate.
Managing E-Commerce Catalogs in a DBMS with Native XML Support
Authors: Lipyeow Lim, Min Wang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Electronic commerce is emerging as a major application area for database systems. A large number of e-commerce stores provide electronic product catalogs that allow customers to search products of interest and store owners to manage various product information. Due to the constant schema evolution and the sparsity of e-commerce data, most commercial e-commerce systems use the so-called vertical schema for data storage. However, query processing for data stored using vertical schema is extremely inefficient because current RDBMSs, especially its cost-based query optimizer, are specifically designed to deal with traditional horizontal schemas. In this paper, we show that e-catalog management can be naturally supported in IBM's System RX, the first DBMS that truly supports both XML and relational data in their native forms. By leveraging on System RX's hybrid nature, we present a novel solution for storing, managing, and querying e-catalog data. In addition to traditional queries, we show that our solution supports semantic queries as well. Our solution does not require a separate query optimization layer, because query optimization is handled within the hybrid DBMS engine itself.
Adaptive Product Normalization: Using Online Learning for Record Linkage in Comparison Shopping
Authors: Mikhail Bilenko, Sugato Basu, Mehran Sahami
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The problem of record linkage focuses on determining whether two object descriptions refer to the same underlying entity. Addressing this problem effectively has many practical applications, e.g., elimination of duplicate records in databases and citation matching for scholarly articles. In this paper, we consider a new domain where the record linkage problem is manifested: Internet comparison shopping. We address the resulting linkage setting that requires learning a similarity function between record pairs from streaming data. The learned similarity function is subsequently used in clustering to determine which records are co-referent and should be linked. We present an online machine learning method for addressing this problem, where a composite similarity function based on a linear combination of basis functions is learned incrementally. We illustrate the efficacy of this approach on several real-world datasets from an Internet comparison shopping site, and show that our method is able to effectively learn various distance functions for product data with differing characteristics. We also provide experimental results that show the importance of considering multiple performance measures in record linkage evaluation.
Design and analysis of contention resolution techniques in optical packet-switched networks
Authors: Tao Zhang
Venue:  (2005)

In order to meet the demand of fast-growing Internet traffic, wavelength division multiplexing (WDM), as a key transmission technology in the optical domain, has been progressing steadily and can now provide more than 1 Tb/s bandwidth on a single optical fiber. To fully utilize such high bandwidth, optical packet switching (OPS) technology has been proposed and is becoming increasingly important. Optical packet-switched networks can provide ultimate bandwidth efficiency and flexibility for future applications. However, there are still a number of critical issues affecting the implementation of optical packet-switched networks. In this work, we have proposed solutions to address two critical issues in OPS networks: contention resolution and quality of service (QoS). Furthermore, we have also developed accurate analytical models to evaluate the performance for each proposed scheme. In a traditional electronic switch, contention can generally be resolved through random access memory (RAM). In the optical domain, RAM-like buffers are not yet available. Several approaches, such as wavelength conversion, deflection routing, and optical buffering, have been proposed for resolving contention. To support differentiated quality of service, we propose a framework for providing label-based differentiated contention resolution by exploiting recirculation buffering and deflection routing. To accommodate more options for differentiation and to avoid the potential problem of forwarding packets in a network indefinitely, two classes of loopless deflection algorithms are provided. We develop an analytical model to evaluate the packet loss probability and the end-to-end delay for different buffering and deflection routing schemes. Simulation and analytical results show that the proposed scheme can provide sufficient options for supporting differentiated service requirements. We introduce a shared optical buffering architecture which can reduce the buffer size at a switch while achieving good packet loss performance. We propose an analytical model to evaluate the packet loss probability and the average delay for shared buffers at a single switch. We study the performance of FDL buffers in asynchronous packet-based optical networks with wavelength conversion. An analytical model is developed to evaluate the performance in terms of packet loss probability and average delay. We address the architecture and performance issue of FDL buffers in packet-based asynchronous multifiber optical networks (PAMFONET), in which each link in the network may consist of multiple optical fibers. We propose a framework for FDL buffers in PAMFONET, in which we provide three essential architectures and corresponding packet scheduling policies. In general, all the proposed solutions are effective for resolving contention and quality of service provisioning, which are crucial problems faced by optical packet-switched networks.
Unsupervised content discovery in composite audio
Authors: Rui Cai, Lie Lu, Alan Hanjalic
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Automatically extracting semantic content from audio streams can be helpful in many multimedia applications. Motivated by the known limitations of traditional supervised approaches to content extraction, which are hard to generalize and require suitable training data, we propose in this paper an unsupervised approach to discover and categorize semantic content in a composite audio stream. In our approach, we first employ spectral clustering to discover natural semantic sound clusters in the analyzed data stream (e.g. speech, music, noise, applause, speech mixed with music, etc.). These clusters are referred to as audio elements. Based on the obtained set of audio elements, the key audio elements, which are most prominent in characterizing the content of input audio data, are selected and used to detect potential boundaries of semantic audio segments denoted as auditory scenes. Finally, the auditory scenes are categorized in terms of the audio elements appearing therein. Categorization is inferred from the relations between audio elements and auditory scenes by using the information-theoretic co-clustering scheme. Evaluations of the proposed approach performed on 4 hours of diverse audio data indicate that promising results can be achieved, both regarding audio element discovery and auditory scene categorization.
On quantum versions of record-breaking algorithms for SAT
Authors: Evgeny Dantsin, Vladik Kreinovich, Alexander Wolpert
Venue: ACM SIGACT News (2005)

It is well known that a straightforward application of Grover's quantum search algorithm enables to solve SAT in O(2n/2) steps. Ambainis (SIGACT News, 2004) observed that it is possible to use Grover's technique to similarly speed up a sophisticated algorithm for solving 3-SAT. In this note, we show that a similar speed up can be obtained for all major record-breaking algorithms for satisfiability. We also show that if we use Grover's technique only, then we cannot do better than quadratic speed up.
Code Normal Forms
Authors: Markus Pizka
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Because of their strong economic impact, complexity and maintainability are among the most widely used terms in software engineering. But, they are also among the most weakly understood! A multitude of software metrics attempts to analyze complexity and a proliferation of different deffinitions of maintainability can be found in text books and corporate quality guide lines. The trouble is that none of these approaches provides a reliable basis for objectively assessing the ability of a software system to absorb future changes. In contrast to this, relational database theory has successfully solved very similar dif- ficulties through normal forms. In this paper, we transfer the idea of normal forms to code. The approach taken is to introduce semantic dependencies as a foundation for the definition of code normal form criteria.
Sub-Ontology Evolution for Service Composition with Application to Distributed E-Learning
Authors: Yuxin Mao, William K. Cheung, Zhaohui Wu, Jiming Liu
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

In order to meet the on-demand requirement of service composition at a large scale, one should go beyond the use of static domain ontologies but allow different focused aspects of the ontologies to be distributed as sub-ontologies. To demonstrate the feasibility of the sub-ontology idea, we suggest a possible implementation using the Semantic Web technology and apply it to distributed e-Learning.
Neural Based Binarization Techniques
Authors: Hatem HAMZA, Abdel BELAID, Eddie SMIGIEL
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper introduces three neural based binarization techniques. These techniques start with a Self Organizing Map (SOW applied on the image to extract its most representative grey levels or colors. The classiJication goes further in two different ways. In the case of grey level images, the Kmeans algorithm or Sauvola 's or Niblack S thresholds are used, whereas a Multi Layer Perceptron (MLP) is used in the case of color images. The obtained results are discussed and we show that they are better than those of some classical binarization techniques.
Modeling and performance analysis for wireless mobile networks: a new analytical approach
Authors: Yuguang Fang
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

In wireless mobile networks, quantities such as call blocking probability, call dropping probability, handoff probability, handoff rate, and the actual call holding times for both complete and incomplete calls are very important performance parameters in the network performance evaluation and design. In the past, their analytical computations are given only when the classical exponential assumptions for all involved time variables are imposed. In this paper, we relax the exponential assumptions for the involved time variables and, under independence assumption on the cell residence times, derive analytical formulae for these parameters using a novel unifying analytical approach. It turns out that the computation of many performance parameters is boiled down to computing a certain type of probability, and the obtained analytical results can be easily applied when the Laplace transform of probability density function of call holding time is a rational function. Thus, easily computable results can be obtained when the call holding time is distributed with the mixed-Erlang distribution, a distribution model having universal approximation capability. More importantly, this paper develops a new analytical approach to performance evaluation for wireless networks and mobile computing systems.
Semantic Query Transformation Using Ontologies
Authors: Chokri Ben Necib, Johann-Christoph Freytag
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Traditional approaches to query processing aim at rewriting a given query into another more efficient one that uses less time and/or resources during the execution. There by, the rewritten query must be equivalent to the initial one, i.e., it must provide the same result. However, rewriting queries in equivalent ways do not always satisfy the user¿s needs, in particular when the user does not receive any answer at all. In this paper we propose a new approach for query processing which allows to rewrite a query into another one which is not necessary equivalent but can provide more meaningful result satisfying the user¿s intention. For this purpose, we illustrate how semantic knowledge in form of ontologies could be effectively used. We develop a set of rewriting rules which rely on semantic information extracted form the ontology associated with the database. In addition, we discuss features of the necessary mappings between the ontology and its underlying database.
The SINE WAVE ORCHESTRA stay
Authors: Kazuhiro Jo, Ken Furudate, Daisuke Ishida, Mizuki Noguchi
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This is a report of creative and technical considerations in building a participatory sound performance The SINE WAVE ORCHESTRA stay. In this performance, the participants one by one leave their own sine wave in the performance space. These sine waves form a mutually interfering sound space while the sound field of a room changes during the performance.
Embodied Communication in Humans and Machines --- A Research Agenda
Authors: Ipke Wachsmuth, Günther Knoblich
Venue: Artificial Intelligence Review (2005)

The challenge to develop an integrated perspective of embodiment in communication has been taken up by an international research group hosted by Bielefeld University's Center for Interdisciplinary Research (ZiF) from October, 2005 through September, 2006. An international conference was held there on 12---15 January, 2005 to define a research agenda that will explicitly address Embodied Communication in Humans and Machines.
Sigma: a mobility architecture for terrestrial and space networks
Authors: Mohammed Atiquzzaman
Venue:  (2005)

Internet Protocol (IP) mobility can be handled at different layers of the protocol stack. Mobile IP has been developed to handle mobility of Internet hosts at the network layer. Mobile IP suffers from a number of drawbacks such as the requirement for infrastructure change, high handover latency, high packet loss rate, and conflict with network security solutions. As an alternative solution, a few transport layer mobility protocols have been proposed in the context of Transmission Control Protocol (TCP), for example, MSOCKS and TCP connection migration. In this dissertation, a S&barbelow;eamless I&barbelow;P-diversity-based G&barbelow;eneralized M&barbelow;obility Architecture (SIGMA) is described. SIGMA works at the transport layer and utilizes IP diversity to achieve seamless handover, and is designed to solve many of the drawbacks of Mobile IP. It can also cooperate with normal IPv4 or IPv6 infrastructure without the support of Mobile IP. The handover performance, signaling cost, and survivability issues of SIGMA are evaluated and compared with those of Mobile IP. A hierarchical location management scheme for SIGMA is developed to reduce the signaling cost of SIGMA, which is also useful to other transport layer mobility solutions. SIGMA is shown to be also applicable to managing satellite handovers in space. Finally, the interoperability between SIGMA and existing Internet security mechanisms is discussed.
Quality Assured Ad Hoc Grids
Authors: Kaizar Amin, Gregor von Laszewski, Armin R. Mikler
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This paper presents an integrated architecture for ad hoc Grids developed within the Java CoG Kit project. It provides an overview of the key component frameworks that collectively build the ad hoc Grid architecture. Further, it outlines a formal model that can be formally evaluated. The paper also presents an enhancement to the Java CoG Kit to address requirements posed by ad hoc Grids. It integrates into the Java CoG Kit commodity technologies such as Jxta, and ClassAds.
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
Authors: Eamonn Keogh, Jessica Lin, Ada Fu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the rest of the time series subsequences. They thus capture the sense of the most unusual subsequence within a time series. Time series discords have many uses for data mining, including improving the quality of clustering, data cleaning, summarization, and anomaly detection. As we will show, discords are particularly attractive as anomaly detectors because they only require one intuitive parameter (the length of the subsequence) unlike most anomaly detection algorithms that typically require many parameters. We evaluate our work with a comprehensive set of experiments. In particular, we demonstrate the utility of discords with objective experiments on domains as diverse as Space Shuttle telemetry monitoring, medicine, surveillance, and industry, and we demonstrate the effectiveness of our discord discovery algorithm with more than one million experiments, on 82 different datasets from diverse domains.
Designing time-based interactions with multimedia
Authors: Eric Lee
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The current model of time in multimedia frameworks poses particular problems when designing multimedia systems with time-based interaction. We propose to expand and extend an existing distinction between semantic time and real time from music and film theory to multimedia systems design. The semantic time concept also forms the foundation of a new software framework for multimedia systems that we are building, that, unlike most existing frameworks, includes mechanisms for time-based effects such as time-stretching.