ppxscal/embedding_network huggingface dataset:
Efficient voice activity detection in reverberant enclosures using far field microphones
Authors: Theodoros Petsatodis, Christos Boukis
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

An algorithm suitable for voice activity detection under reverberant conditions is proposed in this paper. Due to the use of far-filed microphones the proposed solution processes speech signals of highly-varying intensity and signal to noise ratio, that are contaminated with several echoes. The core of the system is a pair of Hidden Markov Models, that effectively model the speech presence and speech absence situations. To minimise mis-detections an adaptive threshold is used, while a hang-over scheme caters for the intra-frame correlation of speech signals. Experimental results conducted in a typical office room using a single far field microphone to support the analysis.
Remote management of non-TR-069 UPnP end-user devices in a private network
Authors: 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. We developed a demonstrator for the remote management of Universal Plug and Play (UPnP) devices in the home with a simple TR-069/UPnP proxy on the HG. It shows how UPnP devices can be discovered, configured, controlled and monitored with a legacy TR-069 auto-configuration server.
VP2P: a virtual machine-based P2P testbed for VoD delivery
Authors: Yih-Farn Chen, Rittwik Jana, Daniel Stern, Hailong Sun, Bin Wei, Mike Yang
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Recent advances in P2P technology have made it a viable alternative for the delivery of rich media by both content and service providers. However, to better understand and utilize P2P technologies in building a scalable media distribution platform, the nature of the underlying network must be taken into consideration. Although many P2P simulations have been conducted previously, very few were evaluated on a real P2P testbed with the properties of the physical network in mind. In this paper, we describe VP2P, a virtual machine-based P2P testbed, which supports P2P studies with the consideration of typical service provider networks. We use four fully equipped MacPro's to emulate 32 peers in the current implementation. Experiments of three P2P algorithms for Video On Demand (VoD) services: BitTorrent, Toast, and Zebra, were run on the testbed. We discuss the rationales behind the hardware and software architecture of VP2P, report our results, and conclude with lessons learned and future directions for VM-based testbeds.
Power adaptive feedback communication over an additive individual noise sequence channel
Authors: Yuval Lomnitz, Meir Feder
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We consider a real-valued additive channel with an individual unknown noise sequence. We present a simple sequential communication scheme based on the celebrated Schalkwijk-Kailath scheme, which varies the transmit power according to the power of the sequence, so that asymptotically the relation between the SNR and the rate matches the Gaussian channel capacity R ≈ 1/2 log(1 + SNR) for almost every noise sequence.
On performance evaluation of a generic IP signaling protocol
Authors: Nadia Boukhatem, Phuoc Nguyen Tran, Thanh Tra Luu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

We designed the GISP (Generic sIgnaling Service Protocol) protocol to contribute to the effort of the NSIS (Next Steps In Signaling) IETF working group in defining a generic IP signaling protocol. In this paper, we summarize the GISP characteristics and focus on its performance results. In particular, a comparison with the GIST (General Internet Signaling Transport) protocol under development by the NSIS WG is provided. We study performance aspects such as session setup and modification latencies, memory and CPU consumption. Our results highlight good performance of the GISP and validate the implementation and design choices.
Efficient parametric decoder of low density lattice codes
Authors: Yair Yona, Meir Feder
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

A new efficient parametric algorithm for implementing the low density lattice codes belief propagation decoder is presented. In the new algorithm the messages passed over the edges are represented by Gaussian parameters lists, and the decoding algorithm uses the low density lattice codes propagation properties in order to group lists efficiently according to a new criteria. The new algorithm attains essentially the same performance as the quantized decoder, proposed in previous work. The new algorithm advantage in comparison to previous works is its smaller storage requirements and its relatively low computational complexity.
Differential privacy with compression
Authors: Shuheng Zhou, Katrina Ligett, Larry Wasserman
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

This work studies formal utility and privacy guarantees for a simple multiplicative database transformation, where the data are compressed by a random linear or affine transformation, reducing the number of data records substantially, while preserving the number of original input variables. We provide an analysis framework inspired by a recent concept known as differential privacy. Our goal is to show that, despite the general difficulty of achieving the differential privacy guarantee, it is possible to publish synthetic data that are useful for a number of common statistical learning applications. This includes high dimensional sparse regression [24], principal component analysis (peA), and other statistical measures [16] based on the covariance of the initial data.
A virtual window system for CE devices based on system virtualization
Authors: Sung-Min Lee, Sang-Bum Suh, Sangdok Mo, Alexander Trofimov, Bokdeuk Jeong
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Owing to the benefits of system virtualization, even CE devices have come to take advantage of the technology. However, due to the lack of windowing system which fits virtualization-based CE devices, it is not only inefficient but also difficult for end users to utilize the CE devices running multiple domains. In this paper we present an effective virtual window system for CE devices based on system virtualization. Our approach has three major advantages: (1) by modifying X window system, it provides shared windowing services between domains without dependency of a specific network protocol; (2) by providing a unified graphical user interface which integrates icons of all the applications from every domain, it frees users from remembering which applications are located in which domain and from doing tedious operations for application launching and installation; (3) it provides efficiency in terms of size (storage and memory) and performance to CE devices. We have implemented a prototype of the virtual window system on the basis of Secure Xen on ARM. Our evaluation shows that our approach is usable and efficient enough to be practically adopted for CE devices based on system virtualization.
Window design for SISO and MIMO OFDM systems
Authors: Tseng-Wen Feng, Ben Williams, Pao-Chu Wang, Shyh-Kang Jeng
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, we conduct the window design for single-input single-output (SISO) and multiple-input multiple-output (MIMO) OFDM systems. The key value of this paper is to optimize the receiver SINR when carrier frequency offset (CFO) and phase noise both affecting an OFDM system. To our best knowledge, this is the first research to design window coefficients through leveraging the CFO and phase noise statistics for SISO and MIMO OFDM systems over frequency-selective channels. CFO and phase noise will destroy the orthogonality of OFDM system and lead to inter-carrier interference (ICI). Simulation results show that our proposed method can improve the system performance.
Performance of network coding for ad hoc networks in realistic simulation scenarios
Authors: Claudia Campolo, Claudio Casetti, Carla-Fabiana Chiasserini, Saed Tarapiah
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Network coding has recently emerged as an effective solution for multicast and broadcast communications in ad hoc networks. We focus on broadcast traffic and design a network coding-based scheme that we compare against simpler solutions, by using the network simulator ns-2. Indeed, while often the benefits of network coding have been shown via theoretical analysis or in simplified simulation scenarios, our aim is to assess the performance of network coding in ad hoc networks when a realistic MAC protocol is considered. Our results show that the performance of network coding for traffic broadcasting strongly depends on the network node density and on the generation size. In particular, network coding leads to significant gains in terms of end-to-end packet loss probability and protocol overhead only when the average number of neighbors per node is higher than 12.
Transrectal ultrasound prostate biopsy tracking with efficient and accurate deformation estimation
Authors: Michael Baumann, Pierre Mozer, Vincent Daanen, Jocelyne Troccaz
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Prostate cancer is the most frequent cancer for men and the second cause of cancer death. Confirmation of cancer requires transrectal prostate biopsies. Tracking systems for transrectal prostate biopsies make it possible to generate biopsy distribution maps for intra- and post-interventional quality control, 3D visualisation of histological results for treatment planning, and to guide clinicians toward nonultrasound (US) targets. In this paper, a 3D US based tracking system for fast and accurate estimation of nonlinear prostate tissue deformation is proposed. Linear elasticity and inverse consistency a priori models are used to improve performance. A variant of the SSD image distance measure is proposed for filtering of local intensity shifts, which are frequent in US images. System accuracy was evaluated to 0.83±0.54 mm using point fiducial on 295 US volumes from 18 patients.
A security model proposal for a social communications broker
Authors: Oscar M. Solá, Remi de La Vieuville, Jorge Serna, Alejandro Cadenas
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Today the current trend of Online Social Networks services is changing the way people relate each other on the Internet. In this context, telecommunication operators have the opportunity to enrich the users online social environment integrating their services with the Social Networks, leading to a new "social communications experience". Given the importance of privacy and security issues on the operator's world, a security model defining basic principles and policies is needed for the success of this new set of services. In this article four key points are defined for this security model.
Joint performance and link budget analysis of HF RFID technology over fast and block fading channels
Authors: Roger P. F. Hoefel, Diogo Franco
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Firstly, we analyze, analytically and by simulation, the bit error rate and block error rate of high frequency radio frequency identification technology operating over different environments: additive white Gaussian noise channel, temporally uncorrelated and block flat fading Rayleigh channels. Then, we develop an analytical tool to calculate the downlink and uplink link budget in order to estimate the system coverage when it is operating in the near field.
Automatic modulation recognition of MPSK signals using constellation rotation and its 4th order cumulant
Authors: Maciej Pedzisz, Ali Mansour
Venue: Digital Signal Processing (2005)

We derive and analyze a new pattern recognition approach for automatic modulation recognition of MPSK (2, 4, and 8) signals in broad-band Gaussian noise. Presented method is based on constellation rotation of the received symbols, and a 4th order cumulant of a 1D distribution of the signal's in-phase component. Using Fourier series expansion of this cumulant as a function of the rotation angle, we extract invariant features which are then used in a neural classifier. Discrimination power of the proposed set of features is verified through extensive simulations, and the performance of the suggested algorithm is compared to the maximum-likelihood (ML) classifiers. Corresponding results show that our technique is comparable to the coherent ML classifier and outperforms the non-coherent pseudo-ML method for all considered signal-to-noise ratio (SNR) without the computational overhead of the latter.
Analog network coding mappings for the Gaussian multiple-access relay channel
Authors: Sha Yao, Mikael Skoglund
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

We consider the multiple-access relay channel with two source nodes, one relay node and one destination node. For practical simplicity, we consider orthogonal transmission of the source messages and half-duplex relaying. Further, we assume that the relay is memoryless and is implemented based on a two-to-one deterministic mapping. Essentially the proposed mappings combine the two incoming analog signals and forward them to the destination, thus we term them analog network coding mappings. We investigate both linear and non-linear mappings. In particular, we propose to use mappings based on the Archimedean spiral for analog non-linear combining. In addition, we also propose to couple spiral mappings with sawtooth-like mappings to exploit the potential side information provided by the direct links. We investigate the resulting achievable rate regions and sum rates, and demonstrate significant gains.
VANETS without limitations: an optimal distributed algorithm for multi-hop communications
Authors: Alessandro Amoroso, Marco Roccetti, Massimo Nanni, Lorenzo Prati
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

We present a distributed algorithm to fast multi-hop message propagation for ad hoc vehicular networks (VANET). Our protocol obtains optimal performances in challenging scenarios which are likely in real situations, but that have been not extensively studied in the literature as they are complex to be tackled. In particular, the Farther Relay and Oracle for VANET (FROV) deals with asymmetric communications and varying transmission ranges. Even in this case, FROV broadcast any application message with the minimal number of hops. Moreover, FROV is both scalable with respect to the number of participating vehicles, and tolerant to faults and changes of membership of the platoon, vehicles that leave or join it. At the current state of development, our protocol is optimal in the case of unidimensional roads and we are studying its extension to a web of urban roads. This paper presents the preliminary results of simulations carried out to verify the main characteristics of FROV.
Elastic source selection for in vivo imaging of neuronal ensembles
Authors: Logan Grosenick, Todd Anderson, Stephen J. Smith
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Advances in microscopy and biochemistry now allow investigators to image the calcium dynamics of hundreds to thousands of neurons in awake behaving animals. However, as speed and resolution of such techniques rapidly increase, so do the dimension and complexity of the data collected. ICA has been widely employed to reveal independent non-Gaussian sources underlying large data sets consisting of mixed sources. We apply a recently developed sparse regression method, the Elastic Net (ENET), to the columns of the mixing matrix of a Independent Component Analysis (ICA) procedure. This regression method automatically selects only those columns of the mixing matrix relevant to a dependent variable of interest. Further, because ICA is a linear operator, we can easily project the "relevance filtered" data back into the native data space for interpretation. We demonstrate the utility of this method on 3D calcium imaging data collected from the optic tectum of an awake behaving larval zebrafish watching a prey-like stimulus.
Source location anonymity for sensor networks
Authors: Ali Abbasi, Ahmad Khonsari, Mohammad S. Talebi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Motivated by applications like sensor, peer to peer networks there has been growing interest in monitoring large scale distributed systems. In these applications, source location anonymity is an attractive and critical security property. Most of prior works assumed a weak adversary model where the adversary sees only local network traffic, but here we consider source anonymity against a global eavesdropper. Attaining location unobservability under global attacker is very difficult and expensive to achieve, because sensor networks are very limited in resources. In this work we propose a distributed algorithm to mix real event traffic with carefully chosen dummy traffic to hide the real event traffic pattern. We assume that we have fixed amount of resources to send dummy traffic and we try to share it among sensors so as to maximize the degree of anonymity of the system. Through simulation, we illustrate that the proposed technique is efficient in protecting location information from the eavesdropper.
On systematic variable length unordered codes
Authors: Laura Pezza, Luca G. Tallini, Bella Bose
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

In an unordered code no codeword is contained in any other codeword. Unordered codes are All Unidirectional Error Detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are optimal unordered codes with r = ⌈log2(k+1)⌉ check bits. This paper gives some new theory on variable length unordered codes and introduces a new class of systematic unordered codes with variable length check symbols. The average redundancy of these new codes is r ≈ (1/2) log2(πek/2) = (1/2) log2 k + 1.047, where k ∈ IN is the number of information bits. It is also shown that such codes are optimal in the class of systematic unordered codes with fixed length information symbols and variable length check symbols. The generalization to the non-binary case is also given.
Time-varying cosine-modulated filter banks
Authors: Guangyu Wang
Venue: Digital Signal Processing (2005)

In applications of the linear time-invariant (LTI) cosine-modulated filter banks, the idea to adapt analysis filter banks in order to match the signal statistical properties has existed for a long time. A typical example is found in audio coding, where audio signals are segmented as different block sizes using different analysis filter banks with the aim to eliminate the pre-echo phenomenon. Such a technique usually called window-switching. However, there was not any reasonable theoretical support for such techniques. In this work, we have generally studied time-varying cosine-modulated filter banks. The general PR conditions for an LTV cosine-modulated filter bank are given. Applying the theory in analyzing a special time-varying cosine-modulated filter bank, namely time-varying modulated lapped transforms (LTV MLTs), we have provided a solid theoretical support for the well-known window-switching techniques.
Optimal secure message transmission by public discussion
Authors: Hongsong Shi, Shaoquan Jiang, Reihaneh Safavi-Naini, Mohammed Ashraful Tuhin
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

Secure message transmission assumes n channels between a sender and a receiver such that up to t channels are under the control of a computationally unlimited adversary. In secure message transmission by public discussion protocol, sender and receiver have access to a public authenticated channel. In this paper we show that if n ≥ t + 1, a secure protocol requires at least 3 rounds of communication and 2 rounds invocation of the public channel. This gives a complete answer to a question raised by Garay and Ostrovsky in Eurocrypt 2008. We also describe a round optimal protocol that has constant transmission rate over the public channel.
Rule identification from Web pages by the XRML approach
Authors: Juyoung Kang, Jae Kyu Lee
Venue: Decision Support Systems (2005)

In the world of Web pages, there are oceans of documents in natural language texts and tables. To extract rules from Web pages and maintain consistency between them, we have developed the framework of XRML (eXtensible Rule Markup Language). XRML allows the identification of rules on Web pages and generates the identified rules automatically. For this purpose, we have designed the Rule Identification Markup Language (RIML), which is similar to the formal Rule Structure Markup Language (RSML), both as parts of XRML. RIML 2.0 is designed to identify rules not only from texts, but also from tables on Web pages, and to transform to the formal rules in RSML syntax automatically. While designing RIML 2.0, we considered the features of sharing variables and values, omitted terms, and synonyms. We have conducted an experiment to evaluate the potential benefit of the XRML approach with real world Web pages of Amazon.com, BarnesandNoble.com, and Powells.com. We found that 100.0% of the rules and 99.7% of the rule components could be identified and automatically generated if we do not count the statements for linkages, which generically do not exist on the Web pages. Since the linkage components occupy 11.2% of all components in the rule base, the overall limitation of automatic rule generation is 88.8%. In this setting, 88.5% of the overall rule components could be generated from the identified rules from the Web pages. The result provides solid proof that XRML can facilitate the extraction and maintenance of rules from Web pages while building expert systems in the Semantic Web environment.
Patch antenna bandwidth enhancement through the use of metamaterials
Authors: Hafid Griguer, Eric Marzolf, Hicham Lalj, Fatima Riouch, M'hamed Drissi
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

This paper presents how Metamaterials can be used to enhance Antenna Bandwidth. To this purpose, a particular Metamaterial cell is introduced for which its design parameters are detailed. This cell is then used to enhance the performances of a microstrip antenna which can be found in communication systems.