ppxscal/embedding_network huggingface dataset:
Mobile robot vision-based navigation using self-organizing and incremental neural networks
Authors: Sirinart Tangruamsub, Manabu Tsuboyama, Aram Kawewong, Osamu Hasegawa
Venue: Proceedings of the 2009 international joint conference on Neural Networks (2009)

A new approach for vision-based navigation in mobile robots is presented. Instead of incremental spectral clustering (ISC), which is considered state-of-the-art, the method of self-organizing incremental neural networks (SOINN) is used for visual space clustering. Using SOINN, the number of nodes in the topological map matches well with the environment. The time used for incremental map building is markedly less than that used for ISC. Furthermore, the rate of single image classification is higher than that of ISC.
Spatial-domain unidirectional DVC with side-information dependent correlation channel estimation
Authors: Nikos Deligiannis, Adrian Munteanu, Tom Clerckx, Jan Cornelis, Peter Schelkens
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

Present distributed video coding (DVC) approaches assume the correlation channel to be side-information independent (SII). We have recently demonstrated that in reality the correlation channel in video is side-information dependent (SID) and that DVC systems which make SII assumptions suffer a significant performance penalty, depending entirely on the correlation statistics of the video data. In this paper, we present a novel spatial domain unidirectional DVC codec which is based on a novel SID technique enabling advanced correlation channel estimation at the decoder starting from a partial knowledge of it. Experimental results show that the proposed codec achieves superior performance compared to the state-of-the-art in Wyner-Ziv video coding while operating without a feedback channel.
On the separability of parallel Gaussian interference channels
Authors: Sang Won Choi, Sae-Young Chung
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

The separability in parallel Gaussian interference channels (PGICs) is studied in this paper. We generalize the separability results in one-sided PGICs (OPGICs) by Sung et al. to two-sided PGICs (TPGICs). Specifically, for strong and mixed TPGICs, we show necessary and sufficient conditions for the separability. For this, we show diagonal covariance matrices are sum-rate optimal for strong and mixed TPGICs.
Real deployment of consensus algorithm on self-organized wireless sensor networks
Authors: Elbhiri Brahim, Alba Pagès-Zamora, Driss Aboutajdine
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Reaching consensus on a self-organized wireless sensor networks through totally decentralized algorithms is a topic that has attracted considerable attention. The average consensus method is the most popular algorithm used in this kind of applications. The main advantage of these approaches is that the network does not involve a fusion center to organize nodes. Using a realistic environment to check the behavior of this scheme is the major objective of this work. Moreover, this paper contributes to answer and confirm some results which are approved by theoretical works.
Performance evaluation of Viterbi decoders by multicanonical Monte Carlo simulations
Authors: Marco Secondini, Dario Fertonani, Giulio Colavolpe, Enrico Forestieri
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

We propose a novel simulation-based method to evaluate the performance of Viterbi decoders. In particular, we address scenarios where the error probability is very low, that is, scenarios where classical Monte Carlo simulations would require impractical execution times before producing reliable results. As other recent fast-simulation approaches, the proposed method relies on the multicanonical Monte Carlo technique, but, unlike the existing general-purpose methods, it is specifically designed for Viterbi decoders, the algorithm being driven by a control variable that depends on the state metrics of the various survivors over the trellis. In simple scenarios for which analytical tools are available, the simulation results agree with them, while, in the most common scenarios, no analytical tool is available and the proposed method gives the fastest way for the estimation of low error probabilities.
Remote discovery and management of end-user devices in heterogeneous private networks
Authors: A. Delphinanto, B. A. G. Hillen, I. Passchier, B. H. A. van Schoonhoven, F. T. H. den Hartog
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

End-to-end broadband service delivery requires remote management of devices in the home network, beyond the home gateway (HG). The service provider can only put limited requirements to these of-the-shelf devices, and therefore has to make intelligent use of their given control and management protocols. The authors propose architectures for the unique remote discovery and management of such devices in a highly heterogeneous home network. We suggest to have the HG discovering these devices and to proxy management and control actions to the provider's remote servers. This approach has been recently adopted by the Home Gateway Initiative. A proof-of-concept is described for the remote management of UPnP devices in the home with a simple TR-069/UPnP proxy on the HG, but the architecture is basically generic for any combination of web-services like protocols.
Inter-domain mobility support scheme using multicast in proxy mobile
Authors: Jung-Woo Baik, Ju-Hyun Kim, June Sup Lee, Kyung-Geun Lee
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

IETF (Internet Engineering Task Force) has proposed the use of PMIPv6 (Proxy Mobile IPv6) over Mobile IPv6 which has the problem of handover latency and signaling overhead caused by binding update(BU). However, considering that PMIPv6 provides the fast handover only in intra-domain, not inter-domain. IETF is debating whether to go back to the previously proposed method, MIPv6, which allows handover in inter-domain [1]. Using MIPv6 in intra-domain also has two major drawbacks: it requires IP update which cannot maintain L4 connectivity and it takes longer handover time due to the latency in binding update of MIPv6. This paper proposed adding the multicast server to PMIPv6, a method that allows the handover in inter-domain without delaying the handover in intra-domain. Adding the multicast server keeps L4 connectivity in both domains and application layer as well; therefore, it enables the seamless service based on IP anywhere. Moreover, this method reduces handover latency so that it takes much less time than using MIPv6. To prove this, the performance of PMIPv6 and the new MIPv6 used in intra and inter domains have been analyzed and compared in practical point of view.
Maximum likelihood time-of-arrival estimation of optical pulses via photon-counting photodetectors
Authors: Baris I. Erkmen, Bruce Moision
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Many optical imaging, ranging, and communications systems rely on the estimation of the arrival time of an optical pulse. In systems utilizing photon-counting photodetectors, which are finding increased use, the detected process is well modeled as a Poisson point process. In this paper, we analyze the performance of maximum likelihood (ML) estimators of the arrival time of an optical pulse, based on observations of a Poisson process. We develop an analytic model for the mean-square error of the ML estimator, illustrating two phenomena that cause deviations from the Cramér-Rao bound at low signal photon flux. The model accurately predicts the ML performance over all regimes considered. We also derive an approximation to the threshold at which the ML estimator essentially fails to provide better than a random guess of the pulse arrival time.
Performance of TH-PPM ultra wideband systems in multipath environments
Authors: Moez Hizem, Ridha Bouallegue
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

This paper presents a performance of the UWB system in a time hopping binary pulse position ultra-wideband modulation scheme (TH BPPM-UWB) in the presence of an AWGN channel. This performance was illustrated using an analytical method based on the evaluation of the bit error probability versus signal to noise ratio(SNR). We have extend the method used in a one path environment to the multipath environments and finally a comparison was made between both.
Using generalized query tree to cope with the capture effect in RFID singulation
Authors: Victor K. Y. Wu, Roy H. Campbell
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The Query Tree Protocol (QT) in [1] is an efficient RFID tag singulation algorithm that is guaranteed to read all the tags in the broadcast range of a reader. However, QT ignores the capture effect. That is, after the reader broadcasts a bit string query prefix, it is assumed that it can distinguish one of three responses, namely {no response, one response, collision}. If the capture effect is modeled, QT would no longer be guaranteed to singulate all the tags in the reader's range, since "capturing" a tag ID in the midst of a collision would leave all the other tags in that collision unsingulated. In this paper, we introduce two modifications to QT that always singulate all the tags even when the capture effect is considered. We call these the Generalized Query Tree Protocols (GQT1, GQT2). We provide analytical bounds and simulation results of the singulation times of these new protocols in relation to QT.
A novel cooperative caching scheme for unstrutured peer-to-peer networks
Authors: Tomonori Mori, Takuya Asaka, Tatsuro Takahashi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Unstructured peer-to-peer (P2P) networks have power-law topology, and the number of content requests also follows power-law distributions. These properties cause two problems: the high-load of high-degree peers and the quick deletion of rarely requested contents. We propose a new caching scheme that replaces the cache on the basis of the number of request messages per unit of time. It significantly reduces the load of high-degree peers and improves the hit rate. Moreover, we use a simulation to show the effectivity of our proposed method.
Stochastic maximum likelihood mean and cross-spectrum structure modelling in neuro-magnetic source estimation
Authors: Raoul P. P. P. Grasman, Hilde M. Huizenga, Lourens J. Waldorp, Peter C. M. Molenaar, Koen B. E. Böcker
Venue: Digital Signal Processing (2005)

In [R.P.P.P. Grasman et al., Frequency domain simultaneous source and source coherence estimation with an application to MEG, IEEE Trans. Biomed. Eng. 51 (1) (2004) 45-55] we proposed to analyze cross-spectrum matrices obtained from electro- or magnetoencephalographic (EEG/MEG) signals, to obtain estimates of the EEG/MEG sources and their coherence. In this paper we extend this method in two ways. First, by modelling such interactions as linear filters, and second, by taking the mean of the signals across different trials into account. To obtain estimates we propose a stochastic maximum likelihood (SML) method, and obtain the concentrated likelihood that includes the trial means.
Efficient LDPC codes over GF(q) for Lossy data compression
Authors: Alfredo Braunstein, Farbod Kayhan, Riccardo Zecchina
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In this paper we consider the lossy compression of a binary symmetric source. We present a scheme that provides a low complexity lossy compressor with near optimal empirical performance. The proposed scheme is based on b-reduced ultrasparse LDPC codes over GF(q). Encoding is performed by the Reinforced Belief Propagation algorithm, a variant of Belief Propagation. The computational complexity at the encoder is O(< d >.n.q.log2 q), where < d > is the average degree of the check nodes. For our code ensemble, decoding can be performed iteratively following the inverse steps of the leaf removal algorithm. For a sparse parity-check matrix the number of needed operations is O(n).
Design and implementation of imaging protocol for mobile phones
Authors: Tomoyuki Osano, Ishikawa Ishikawa, Kitagawa Kitagawa, Fumio Nagasaka
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper describes the design and implementation of an imaging protocol for mobile phones. This protocol enables a user to transfer content from a mobile phone to various display devices (e.g. projector) and control content presentation (e.g. display, forward, backward, etc.) by the same mobile phone, via various network interfaces (e.g. WLAN, Bluetooth, USB and IrDA). Using the proposed protocol, a mobile phone user can realize a content presentation equivalent to that possible with a PC. To ensure interoperability with existing display devices, we set a gateway between the mobile phone and the display devices. The gateway outputs the commands accepted by the device selected to allow the mobile phone user to control the device transparently.
On the probabilistic computation of the stopping redundancy of LDPC codes
Authors: Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

On the binary erasure channel (BEC), the performance of low-density parity-check (LDPC) codes decoded by iterative algorithms is estimated by the small stopping sets in the codes. The size of smallest stopping set is called the stopping distance. Since it depends on the structure of parity-check matrix for the code, we can construct the parity-check matrix by adding dependent rows so that the stopping distance is equal to the minimum distance. The stopping redundancy is defined as the smallest number of rows in such a parity-check matrix. In this paper, we propose a probabilistic algorithm for computing the stopping redundancy of LDPC codes. Additionally, we show numerical results of computing the stopping redundancy of (155,64), (504,252) and (1008,504) LDPC codes.
Data management of wireless sensor networks
Authors: Haiying Shen, Ting Li
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Wireless sensor networks can monitor physical and environmental conditions inexpensively, and the networks have been widely used in military and civilian applications. The sensor nodes in the networks not only have the ability to sense, but also can supply data storage, computation and communicate with each other. However, energy efficiency is the major concern in wireless sensor networks, which usually rely on battery for energy source. Centralized data storage and query processing schemes lead to high energy consumption. This paper proposes a distributed data storage scheme (DDS) that disseminates related event data in a neighborhood in wireless sensor networks. Besides offering data query according to event names, DDS also provides distributed querying. Experimental results show that the DDS scheme yields higher efficiency and effectiveness than the centralized scheme.
A generalized cut-set bound
Authors: Amin Aminzadeh Gohari, Venkat Anantharam
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

In this paper, we generalize the well known cut-set bound (see for example [1, p. 444]) to the problem of lossy transmission of functions of arbitrarily correlated sources over a discrete memoryless multiterminal network.
MIMO techniques and full frequency reuse in mobile WiMAX systems
Authors: Hikmet Sari, Serdar Sezginer
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

We first review recent developments in multiple-input multiple-output (MIMO) techniques for mobile WiMAX systems and discuss full-rate and high-rate space-time codes of low decoder complexity. Next, we discuss the frequency reuse issue in sectored cells and point out the limitations due to overlapping of antenna radiation patterns of adjacent sectors and the resulting interference. Then, we discuss several frequency reuse concepts for the uplink and for the downlink. Some of these techniques are half rate, while others are full rate, both of them providing transmit diversity.
Fast multi-hop broadcast over vehicular networks: a real testbed evaluation
Authors: Claudio E. Palazzi, Stefano Ferretti, Marco Roccetti
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

As the technology available on cars is increasing, a wide range of applications, from safety to entertainment, are becoming available for this scenario. Many of these applications involve interactive multi-hop broadcast of messages over a certain area-of-interest. To this aim, specific solutions have been proposed to deal with the high mobility and density of a vehicular network scenario. In particular, we developed a simple, yet effective, solution for allowing cars to estimate their communication range through including few parameters in exchanged application messages. Then, this range estimation is exploited to reduce the number of hops and the delay required by a broadcast message to reach all the vehicles in the area-of-interest. Since so far the evaluation of our solution has been focused on simulations, we have now created a real testbed. Here, we report on results achieved through this real testbed, showing that they confirm the efficacy of our solution in estimating vehicles' transmission range and choosing the most appropriate forwarder for transmitted messages.
Re-encoding of perceptually quantized wavelet packet transform coefficients of audio and high quality speech
Authors: Omid Ghahabi, Mohammad H. Savoji
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

This paper reports on the results of four reencoding schemes on perceptually quantized wavelet packet transform (WPT) coefficients of audio and high quality speech. These schemes comprises: 1- Embedded Zero-tree Wavelet (EZW) 2- The set partitioning in hierarchical trees (SPIHT) 3- JPEG-based entropy/run length Huffman and 4- JPEG-type Audio Huffman coding algorithms. Since EZW and SPIHT are designed for image compression, some new modifications have been implemented in these schemes for their better matching with audio signals. The performances of these four re-encoders are compared in terms of average output bit rate and computation time of a same codec. It is concluded that the JPEG-type Audio Huffman coding achieves the best results although it is not possible to truncate the bit stream, in this case, to easily match the bit rate to the fixed channel capacity.
AQM applications in MAODV ad hoc network
Authors: Manuel A. P. de Barros, Mohammed EI Koutbi
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Disaster relief, education, and military are common situations where nodes need to communicate in areas without any preexisting infrastructure. In these situations, ad-hoc networks are used. Active Queue Management (AQM) bas been successfully demonstrated as a solution to tbe global synchronization problem in the context of wired networks. To the best of our knowledge there is limited research work on the effect of queuing mechanisms in these networks (multicast in particular). We provided performance comparisons of Priority Queuing (PriQ), Drop Tail (DT) and Deficit Round Robin (DRR) which are some queues mechanisms, in ad-hoc network using MAODV protocol.
An integral approach to programming sensor networks
Authors: Remi Bosman, Johan Lukkien, Richard Verhoeven
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper we present a complete approach to programming sensor networks. The main contribution concerns the separation of three abstraction levels, viz., application level, network level and node level, leaving more room for standardization than with current practices. In addition we propose to program the network from an overall perspective rather than programming individual nodes. The proposed model is event-based, corresponding closely to the nature of wireless sensors and admits content-based addressing of nodes and groups of nodes. The paper describes how the three abstraction levels come together and gives examples of the approach at all three levels.
Signaling architecture and protocols for the next generation network
Authors: Hyeong Ho Lee
Venue: Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3 (2009)

ITU-T (International Telecommunication Union, Telecommunication Standardization Sector) made remarkable achievement in international standardization of the Next Generation Network (NGN) during the last Study Period (2005-2008). This paper gives a brief overview and functional architecture of ITU-T NGN, and presents signaling architecture and protocols for the ITU-T NGN.
Broadcast delay of epidemic routing in intermittently connected networks
Authors: Philippe Jacquet, Bernard Mans, Georgios Rodolakis
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

We analyze the performance of epidemic routing in large-scale intermittently connected networks, under a random geometric graph model and for different mobility parameters (such as the random-waypoint, random walk and Brownian motion models). We derive a generic scaling law on the delay, which provides us with lower bounds: the average delay from a source to a destination and the average broadcast delay are both Ω (Rn√n/vn), where n is the number of nodes in the network, vn the maximum node speed, and Rn the radio range.
Sharing the experience with mobile video: a student community trial
Authors: Jukka K. Nurminen, Olli Karonen, Lóránt Farkas, Timo Partala
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

To understand the technical feasibility and user perception of mobile video, we conducted a two-week trial where a student community used mobile phone and web technologies to share the events of a campus festival. The questions we investigated included the capability of contemporary smart phones to capture and share the events via real time and stored video; the usage patterns that arise within mobile video community; and the social connections between shooters and viewers. Outcomes on the technical level indicate that challenges remain. The bandwidth of 3G cellular connections limits the quality of live videos and video transfer via public WLAN networks is unreliable causing lost connections. The best results today can be achieved by sending the captured videos from mobile phones to the server in the background and providing video-on-demand rather than live video service. The observed consumption patterns show that freshness of the videos is the least important selection factor while manual and automatic textual tagging is important. Seamless integration of video sharing to camera application would improve the user experience.