ppxscal/embedding_network huggingface dataset:
Investigation of the baseline wander effect on Gbps wireless infrared system employing 8B10B coding
Authors: Jianhui Li, Mike Wolf, Martin Haardt
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

The performance of on-off Keying (OOK) based wireless infrared transmission can be seriously deteriorated by the so called "transient baseline wander", which is caused by the inherent high-pass characteristics of the receiver. The signal distortion induced by such an impairment can be mitigated by using a line code. In this paper, we propose two 8B10B line coding schemes for Gbps wireless infrared line-of-sight (LOS) transmission based on the non-return to zero (NRZ) OOK modulation: the classic IBM code and the concatenated flipped bit insertion (CFBI) code. The latter is newly designed and enables simpler and more effective encoding and decoding algorithms. Simulation results demonstrate a small susceptibility to the transient baseline wander. Both codes are DC-balanced and offer regular state transitions.
Media delivery for wireless converged networks
Authors: Matthew Walker, Rory Turnbull, Barry Crabtree
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Portable devices are becoming increasingly capable of rendering high quality music and videos providing the capability for entertainment on the move. Deploying content onto those devices is often time consuming, requiring significant amounts of user intervention and prone to failure. Streaming systems can potentially offer very large catalogues, but require continuous high speed connectivity. Download and play services (e.g. podcasting) often require devices to be docked together and have catalogues limited to those chosen by the user. This paper recognizes the potential of high speed local area networks in the deployment of content to devices. It gives an overview of a method for automating the initial content transfer and the lifetime management of on-device content in a more coordinated and intelligent way than current systems. Although further work is required to realize these methods, we believe it can provide a number of benefits for both end users and service providers.
Steerable filters for orientation estimation and localization of fluorescent dipoles
Authors: François Aguet, Stefan Geissbühler, Iwan Märki, Theo Lasser, Michael Unser
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Fluorescence localization microscopy (i.e., PALM, STORM) has enabled optical imaging at nanometer-scale resolutions. The localization algorithms used in these techniques rely on fitting a 2-D Gaussian to the in-focus image of individual fluorophores. For fixed fluorophores, however, the observed diffraction pattern depends on the orientation of the underlying molecular dipole and does not necessarily correspond to a section of the system's point spread function. By using a physically realistic image formation model for dipoles to perform the fit, both the position and orientation of the dipole can be estimated with high accuracy, improving upon Gaussian localization. In this paper, we present an algorithm for joint position and orientation estimation based on a 3-D steerable filter, and show that the results are near-optimal with respect to the Cramér-Rao bounds. We show that patterns generated using estimated positions and orientations closely fit experimental measurements.
Sparsity-embracing multiuser detection for CDMA systems with low activity factor
Authors: Hao Zhu, Georgios B. Giannakis
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

The number of active users in code-division multiple access (CDMA) systems is often much lower than the spreading gain. The present paper exploits fruitfully this a priori information to improve performance of multiuser detectors. A low-activity factor manifests itself in a sparse symbol vector with entries drawn from a finite alphabet that is augmented by the zero symbol to capture user inactivity. The nonequiprobable symbols of the augmented alphabet motivate a sparsity-exploiting maximum a posteriori probability (S-MAP) criterion, which is shown to yield a cost comprising the l2 least-squares error penalized by the p-th norm of the wanted symbol vector (p = 0, 1, 2). Related optimization problems appear in variable selection (shrinkage) schemes developed for linear regression, as well as in the emerging field of compressive sampling (CS). The contribution of this work to CDMA systems is a gamut of sparsity-embracing multiuser detectors trading off performance for complexity requirements. From the vantage point of CS and the least-absolute shrinkage selection operator (Lasso) spectrum of applications, the contribution amounts to sparsity-exploiting algorithms when the entries of the wanted signal vector adhere to finite-alphabet constraints.
A new secure communication framework for smart cards
Authors: H. Karen Lu, Asad M. Ali, Stephane Durand, Laurent Castillo
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Smart cards have provided security services in many domains over the past two decades. They should be able to offer security services to the Internet and prevent online identity theft as well. Having developed a smart-card-based solution for preventing identity theft, we have found that it is very difficult to push it to the consumer market. A common critical requirement from both users and service providers is that smart card tokens must be plug-and-play without any software installation. However, conventional smart cards require installations of device drivers and middleware on host computers. The key to solving this problem is to develop a new communication framework for smart cards. This paper presents such a framework that enables USB smart cards to be plug-and-play. We leverage preinstalled device drivers present in all modern computer operating systems. A USB smart card emulates such devices to communicate with its client software, which resides on the smart card and runs on the host computer. The client software enables the smart card to use a web browser for its human interface and to support web applications. All communications among smart card services, the web browser, and remote web servers are secured using TLS.
Performance evaluation of a deployed WiMAX system operating in the 4.9GHz public safety band
Authors: Nickolas LaSorte, W. Justin Barnes, Ben Zigreng, Hazem Refai
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper presents an evaluation of a deployed WiMAX system operating in the 4.9GHz Public Safety Band in the City of Tulsa. The study includes propagation analysis for the coverage and network performance tests to demonstrate the viability of a WiMAX system as a medium for public safety. We considered existing propagation models in the UHF band (300 MHz to 3 GHz) to be applied to 4.9 GHz and compared the characteristics predicted by the models with the measured data. The results show that of the three models presented, the Cost-231 Hata Model best predicts the characteristics of the deployed WiMAX system. Network performance tests were also conducted to measure the throughput of the system at various adaptive modulation rates.
DOCSIS IP-video bypass architecture (DIBA), an architecture for IPTV over cable
Authors: Gerald Joyce, Jeffrey Bao, Michael Patrick, Dave Flanagan
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

As with other video service providers, the cable industry is anticipating IP-video and IPTV, and plans to deliver these over the DOCSISTM (data over cable service interface specification) protocol that cable modems use. The delivery of IP video services will lead to a tremendous increase in DOCSIS traffic, higher IP bandwidth provisioning, and a lessening of the reliance on traditional, non-IP digital video. Indeed, DOCSIS 3.0 was developed with multiple downstream channels to the cable modems, in part, for the delivery of IP video services. The Modular CMTS separated the downstream modulators (EdgeQAMs) from the CMTS core to allow scaling of the number of downstream channels, mainly for IP video. However, there is an economic issue in play, namely that digital video bandwidth is still only a fraction of the cost of the IP / DOCSIS bandwidth that would supplant it. The DOCSIS IP-video Bypass Architecture (DIBA) mitigates this problem by exploiting the repetitiveness of video packets. IP-video is made to follow the same path as digital video, but still emerge with correct DOCSIS encapsulation. DIBA promises IP-video at cost parity with digital video.
Feasibility of a socially aware authentication scheme
Authors: Andrew Dathan Frankel, Muthucumaru Maheswaran
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Social interaction is already a proven component of informal identification: humans are naturally skilled at recognizing other people and are unlikely to be duped by impersonation. Based on this premise, a fourth-factor, someone-you-know, has already been proposed as an emergency authentication method. This paper explores leveraging a user's preexisting social actions as a primary authentication tool, one that operates transparently and automatically without explicit user guidance. Specifically, we describe the feasibility of capturing a user's local social context using short range wireless devices and evaluate the uniqueness of that context in comparison to that of possible aggressors.
Trapping set enumerators for repeat multiple accumulate code ensembles
Authors: Christian Koller, Alexandre Graell i Amatt, Jörg Kliewer, Daniel J. Costello
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The serial concatenation of a repetition code with two or more accumulators has the advantage of a simple encoder structure. Furthermore, the resulting ensemble is asymptotically good and exhibits minimum distance growing linearly with block length. However, in practice these codes cannot be decoded by a maximum likelihood decoder, and iterative decoding schemes must be employed. For low-density parity-check codes, the notion of trapping sets has been introduced to estimate the performance of these codes under iterative message passing decoding. In this paper, we present a closed form finite length ensemble trapping set enumerator for repeat multiple accumulate codes by creating a trellis representation of trapping sets. We also obtain the asymptotic expressions when the block length tends to infinity and evaluate them numerically.
On the design of PN codes in decentralized networks
Authors: Kamyar Moshksar, Amir K. Khandani
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

This paper provides a unified measure to design binary pseudo-random (PN) codes in a wireless decentralized network in which several transmitter-reciever pairs share the spectrum. In a decentralized network, users are not aware of the code-books of each other. Hence, in the high SNR regime, interference highly degrades the achievable rates of users as interference cancellation is impossible. On the other hand, decentralized networks have no fixed underlying infrastructure, i.e., there is no central management to assign "good" PN codes with appropriate cross-correlation properties to different users. As such, choosing the same PN code by different users may result in losing the packets transmitted by these users. These shortcomings motivate us to propose a decentralized scheme that enables all users to coexist fairly, while utilizing the spectrum efficiently. We introduce a distributed signaling scheme (using i.i.d. Gaussian code-books) called Bernoulli-Direct-Sequence (BDS) where all users spread their signals by locally generated binary PN codes. Due to the dynamic nature of interference, sensing the spectrum to measure the interference is practically not possible. This makes the interference plus noise probability density function (PDF) be mixed Gaussian. We obtain upper and lower bounds on the rates of users that coincide as SNR tends to infinity. This enables us to derive a general formula for the sum-rate multiplexing gain in the network. Subsequently, we propose a general rule to design the PN codes in the sense of increasing the sum-rate multiplexing gain in the network. It is shown that depending on the number of active users in the system, there is a certain amount of spreading length that leads to the highest multiplexing gain per user. Several design examples are provided at the end.
A fair transaction mechanism for P2P file-sharing applications
Authors: Dongsheng Peng, Weidong Liu, Chuang Lin, Zhen Chen
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In P2P file-sharing applications, distributed virtual payment mechanism is designed to encourage resource sharing among peers and thus restrain free-riding behaviors. However, it does not provide any protection on the security of the transaction process and the quality of the trading contents. We design a fair transaction mechanism for P2P file-sharing applications, in which a trusted third party is constructed and used to guarantee the atomic operation of the file-money exchange, in virtue of the property of distributed payment mechanism. The trading file is signed with the seller's private key, which can be used as proof in case of dissension. Performance analysis indicates that the costs of fair transaction mechanism are limited in both trading session latency and overhead to the system.
A characterization of max-min SIR-balanced power allocation with applications
Authors: Sławomir Stanczak, Michał Kaliszan, Nicholas Bambos, Marcin Wiczanowski
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We consider a power-controlled wireless network with an established network topology in which the communication links (transmitter-receiver pairs) are subject to some constraints on transmit powers and corrupted by the co-channel interference and background noise. The interference is completely determined by a so-called gain matrix. Assuming irreducibility of the gain matrix, we provide an elegant characterization of the max-min SIR-balanced power allocation under general power constraints. This characterization gives rise to two types of algorithms for computing the max-min SIR-balanced power allocation. It also allows for an interesting saddle point characterization of the Perron root of extended gain matrices.
A step to support real-time in virtual machine
Authors: Seehwan Yoo, Miri Park, Chuck Yoo
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Real-time is one of the unique requirements in embedded systems. In this paper, we perform a feasibility study on how to support real-time in an embedded virtual machine system. Firstly, we argue that the I/O model of the current virtual machine monitor like Xen is not suitable to support real-time applications because it lacks in predictability and it does not guarantee a deterministic I/O processing. We provide an alternative I/O model for virtualized embedded systems. Devices are categorized into four groups: dedicated, active, running, dynamic. Dedicated devices make a virtual machine simple because they do not need to be virtualized for isolation. However, dedication does not mean the performance isolation. Our experimental results with dedicated device show that traditional dedication cannot guarantee the timely responsiveness in heavy interrupt cases. Specifically, responsiveness of real-time OS degrades as interrupt load increases. There-ore, a proper interrupt control mechanism is required at virtual machine monitor level in order to support timely responsiveness. In addition, our result supports that 1) short and prioritized interrupt processing helps responsiveness in a virtual machine system; 2) smaller time quantum results in better responsiveness also.
Media-aware caching mechanism in Diffserv networks
Authors: Y. Abdelmalek, A. Abdelal, T. Saadawi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Video transmission is becoming an increasingly essential part of the current internet; however before the high video quality at the client side becomes a reality, the best effort model has to adapt the video characteristic to the network conditions. In this paper, we are proposing a media middleware component that can be added to the edge routers in DiffServ network in order to have the responsibility to enhance QoS at the receivers' side. Passing such video frames to differentiated service network increases the video quality and treats the video frames based on their priorities. The media aware sub-layer has the responsibility to cache high priority video frames. We demonstrate through network simulation that the proposed technique decreases the average packet delay, and the packet loss, which yields a better video quality at the clients compared to existing techniques.
Chinese MPEG-21 rights expression language: enhancing digital rights management adoption to digital libraries in hong kong
Authors: Z. H. Eliot Liu, Y. K. Richard Fung, W. K. David Chung
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Rights Expression Language in digital library scenario is described as rights management metadata, which are becoming a significant impetus for the development of digital libraries. However, the research on it just starts and is still immature in China. This paper aims to fill up the gap by discussing the issues of localizing MPEG-21 REL into Chinese language. A well-established and notable model called HowNet is adopted for semantic mapping, and a case example is created to demonstrate the application of the Chinese REL.
An efficient routing approach over mobile wireless ad-hoc sensor networks
Authors: Hamdy Soliman, Mohammad AlOtaibi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, we efficiently adapt the prominent Ad Hoc On-Demand Distance Vector (AODV) routing protocol with a reactive Local Link Repair, AODV-LR, for effective deployment in restricted power-budget and bandwidth mobile ad hoc sensor networks (MASNET). We introduce a better replacement mechanism to the local repair phase of the AODV. Our new approach is a preemptive, self-repairing AODV (called AODV-PSR) scheme that is able to find an alternative link to a failing link. The new preemptive protocol achieves better performance than the ADOV-LR, due to its avoidance of packet buffering delay and excess use of control messages during link repair. Experimental results show a much lower obtained packet delay, a higher packet delivery ratio, and lower control message overhead. Hence, our mechanism is amenable to deployment in areas of restricted power-budget and bandwidth, such as a MASNET domain.
A hierarchically structured global data collection network
Authors: I. Rhead, M. Merabti, H. Mokhtar, P. Fergus
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The operation of a network of sensing devices on a global scale requires an architecture to support efficient node registration and querying across billions, if not trillions of nodes. Whilst our work to date has concentrated on the development of a Worldwide Sensor Web framework, a global data collection network architecture could also be applied to any effort involving data retrieval from geographically identifiable nodes. The paper presents a new network architecture, overlaid onto the fabric of the Internet, to support the efficient registration and querying of geographically based nodes on a global scale.
Secure communication in the low-SNR regime: a characterization of the energy-secrecy tradeoff
Authors: Mustafa Cenk Gursoy
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived. Transmission strategies required to achieve these derivatives are identified. In particular, it is shown that it is optimal in the low-SNR regime to transmit in the maximum-eigenvalue eigenspace of Φ = H†mHm -Nm/NeH†eHe where Hm and He denote the channel matrices associated with the legitimate receiver and eavesdropper, respectively, and Nm and Ne are the noise variances at the receiver and eavesdropper, respectively. Energy efficiency is analyzed by finding the minimum bit energy required for secure and reliable communications, and the wideband slope. Increased bit energy requirements under secrecy constraints are quantified. Finally, the impact of fading is investigated.
Separating and tracking ERP subcomponents by constrained particle filtering
Authors: Delaram Jarchi, Bahador Makki Abadi, Saeid Sanei
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

In this paper a new method based on particle filtering for separating and tracking event related-potential (ERP) subcomponents in different trials is presented. The latency and amplitude of each ERP subcomponent is formulated in the state space model Based on some knowledge about ERP subcomponents, a constraint on the state space variables is provided to prevent the generation of invalid particles and also make use of a small number of particles which are most effective especially in high dimensions. The method is applied on the simulated and real P300 data. The algorithm has the ability of tracking P300 subcomponents i.e. P3a and P3b, in single trials even in the low signal-to-noise ratio situations.
Privacy preserving DRM solution with content classification and superdistribution
Authors: Jun Yao, Sunnam Lee, Suhyun Nam
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Digital Rights Management (DRM) is indispensable to prevent various kinds of illegal content usage. However, personal privacy is vulnerable for disclosure when the detailed consumption reports are collected by the service provider to charge consumers. Usually those kinds of data could apparently render the work and rest schedule and reveal the hobby of certain customers. Although it is claimed that all of the private data should be protected without the fear for disclosure, it had better to avoid generating those sensitive records. Therefore, a new DRM solution is proposed to provide an obscure consumption report to the service provider with content classification and superdistribution while maintain the normal charge system. In addition, a novel key management scheme is presented to support the above solution. In this scheme, multiple encryption keys and decryption keys in the same content level are designed through a specific algorithm. Distributing a unique decryption key set to each user facilitates the tracing in case of deliberate key leakage and then assists realistic deployment of the DRM system.