ppxscal/embedding_network huggingface dataset:
The secrecy capacity region of the degraded vector Gaussian broadcast channel
Authors: Ghadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO channel. It is assumed that the channels are degraded and the wire-tapper has the worst channel. We establish the capacity region of this scenario. Our achievability scheme is a combination of the superposition of Gaussian codes and randomization within the layers which we will refer to as Secret Superposition Coding. For the outerbound, we use the notion of enhanced channel to show that the secret superposition of Gaussian codes is optimal. It is shown that we only need to enhance the channels of the legitimate receivers, and the channel of the eavesdropper remains unchanged.
A fractional bit encoding technique for the GMM-based block quantisation of images
Authors: Kuldip K. Paliwal, Stephen So
Venue: Digital Signal Processing (2005)

In this paper, a simple technique for encoding fractional bit components used in fixed-rate Gaussian mixture model-based (GMM) block quantisers is presented. While block transform image coding has not been very popular lately in the presence of current state-of-the-art wavelet-based coders, the GMM-based block quantiser, without the use of entropy coding, is still very competitive in the class of fixed-rate transform coders. It consists of a set of individual block quantisers operating at different bitrates, and the problem is that these bitrates are mostly fractional. Fixed-rate block quantisers based on an integer number of bits can be designed and through the use of heuristic algorithms, can approach the fractional target rate. However, the use of level-based scalar quantisers in the block quantiser allows better utilisation of the bit budget; a finer 'spread' of the bit budget across components; and better preservation of optimality. Our technique, which is based on a generalisation of positional value number systems, allows the use of level-based scalar quantisers in a fixed-rate coding framework. Experimental results comparing the use of the bits-based GMM-based block quantiser with the levels-based one in image coding show a finite improvement in the PSNR performance.
An efficient contents sharing method for DRM
Authors: Xue Feng, Zhi Tang, YinYan Yu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper presents a rights management method for the multiple devices of end-user. In recent years, most existing contents sharing solutions are based on Authorized Domain where legally acquired copyrighted content can seamlessly move from device to device. However, Authorized Domain systems are relatively complex and will usually increase the usage cost. In this paper, we propose an efficient contents sharing method for digital rights management system without authorized domain. In particular, we design a novel license acquisition and sharing mechanism based on ergodic encryption and machine authentication techniques. The mechanism works well in a loosely connected network environment. Our design supports efficient and flexible device alterations without expensive revocation mechanism. In addition, a novel pre-experiencing function is supported conveniently in our approach.
Information rate loss from radiation decoherence
Authors: Alfonso Martinez
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The information rates achievable by using electromagnetic radiation affected by thermal noise and signal decoherence are studied. The classical coherent-state Gaussian model is compared with an alternative photon gas model which represents lack of a shared phase reference between transmitter and receiver. At any frequency, the information rates in the presence of decoherence essentially coincide with those over a Gaussian model when the signal-to-noise ratio is below a threshold. Only above the threshold does decoherence cause a significant loss in information rates; the loss can amount to half of the capacity. The threshold exceeds 40 dB for radio frequencies and vanishes at optical frequencies.
A new construction method for networks from matroids
Authors: Salim El Rouayheb, Alex Sprintson, Costas Georghiades
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We study the problem of information flow in communication networks with noiseless links in which the dependency relations among the data flowing on the different network edges satisfy matroidal constraints. We present a construction that maps any given matroid to a network that admits vector linear network codes over a certain field if and only if the matroid has a multilinear representation over the same field. This new construction strengthens previous results in the literature and, thus, establishes a deeper connection between network coding and matroid theory. We also explore another, more general, mathematical construct referred to as FD-relation which is more suitable than matroids in capturing the dependency relations in general networks.
Tsallis differential entropy and divergences derived from the generalized Shannon-Khinchin axioms
Authors: Hiroki Suyari, Makoto Tsukada
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

In discrete systems, Shannon entropy is well known to be characterized by the Shannon-Khinchin axioms. Recently, this set of axioms was generalized for Tsallis entropy, one-parameter generalization of Shannon entropy. In continuos systems, Shannon differential entropy has been introduced as a natural extension of the above Shannon entropy without using an axiomatic approach. We derive the generalized entropy function as a solution of the functional equation determined by the generalized Shannon additivity, one of the most important axiom of the generalized Shannon-Khinchin axioms for Tsallis entropy. This generalized entropy function naturally introduces Tsallis differential entropy and two Tsallis divergences. In particular, one (Csiszár type) of the divergences has almost the same form as the α-divergence in information geometry and the other the Bregman type divergence. Our results reveal that the generalized Shannon additivity representing a branch structure of a rooted tree plays an essential role in the determination of these entropies.
Equitable quality video streaming
Authors: B. Crabtree, M. Nilsson, P. Mulroy, S. Appleby
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Video streaming has frequently been deployed using constant bit rate video encoding and transmission as these are easily implemented and network provisioning, although requiring admission control, is straightforward. However, it is sub-optimal for both the user, who experiences time varying quality, and the network operator, who can not fully utilize the network during periods of low usage and is faced with admission control and session refusal at busy times. Instead we propose an equitable quality scheme in which the available network bandwidth is divided between the concurrent sessions so that the same quality is delivered in each. We show that we can increase average quality (Mean Opinion Score) by 0.74, or alternatively increase the number of sessions that can be supported at the same average overall quality by 80%.
Selective mapping for channel inversion precoding in multiple-antenna broadcast systems
Authors: Amin Mobasher, Mohammad-Ali Maddah-Ali, Amir K. Khandani
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In this paper, a new Selective Mapping (SLM) technique is introduced for a Multiple-Input Multiple-Output (MIMO) broadcast (or MIMO point-to-point) system with channel inversion. We present a unified framework which links the problem of minimizing the average transmit energy from the constellation point of view, to the sum-rate maximization problem from the capacity viewpoint. First, we consider the point-to-point setup and derive the average transmit energy that can asymptotically be achieved by the proposed SLM technique. It is established that SLM achieves the minimum theoretical average transmit energy achievable by constellation shaping. Then, using the same idea, the average transmit energy in a broadcast system is derived and the relation between this value and the transmission rate is established. Finally, it is shown that the proposed SLM method can achieve the sum-capacity of the MIMO broadcast (or capacity of a MIMO point-to-point) channel at high SNR values.
Distortion exponents for decode-and-forward multi-relay cooperative networks
Authors: Jing Wang, Jie Liang, Sami Muhaidat
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

In this paper, we consider the transmission of a Gaussian signal in a multi-relay cooperative system, where each relay is half-duplex and employs the decode-and-forward relaying protocol. We focus on the analysis of the distortion exponent, which characterizes the high signal-to-noise ratio (SNR) behavior of the end-to-end distortion. Specifically, we investigate the layered source coding with progressive or broadcast transmission. Each transmission scheme is further combined with the repetition-based or relay-selection-based multi-relay cooperation protocol. We derive the distortion exponents of all four cases and illustrate the effect of the bandwidth expansion ratio, number of relays and cooperation protocols on the optimal distortion exponent. We also establish the successive refinability of the diversity-multiplexing tradeoff of the repetition-based and relay-selection-based cooperation protocols in multi-relay cooperative systems.
Quantitative study of an outdoor multi-hop 802.11 network performance using a novel passive measurement approach
Authors: Ting Zhou, Hamid Sharif, Michael Hempel, Puttipong Mahasukhon, Wei Wang
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper presents a novel passive measurement approach to accurately evaluate the performance of outdoor multi-hop 802.11 networks from the wireless side directly. Our approach employs five processing steps to evaluate per-hop system performances. Firstly, reference packets are identified from multiple independent packet traces. Secondly, multiple packet traces in one channel are merged together using the identified reference packets. Thirdly, redundant packets are filtered from the merging packet traces. To adjust for propagation differences between access points and monitors, the status of each packet is then corrected according to its context packets. Finally, an inference approach based on finite state machines (FSM) is designed to infer missing packets which are not recorded in any of the monitor traces but known to have existed in the real traffic. The unique features in our approach include propagation delay evaluation and FSM designs for existing packet status correction and missing packet inference. The measurement results collected from our outdoor multi-hop 802.11 testbed are used to validate the accuracy of our approach.
Noise adaptive matrix edge field analysis of small sized heterogeneous onion layered textures for characterizing human embryonic stem cell nuclei
Authors: Mukund Desai, Rami Mangoubi, Paul Sammak
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

We present a methodology for characterizing small size heterogeneous textures that are hard to analyze in general due to the paucity of pixels and textural heterogeneity. The methodology overcomes the limitation for a large class of heterogeneous textures that exhibit onion layer type textural variation, where we may assume that within a layer the behavior is homogeneous, but may vary from layer to layer. The shape of the onion layers is data dependent; radial symmetry is not required. We use an energy functional approach for simultaneous smoothing and segmentation that relies on two key innovations: a matrix edge field, and adaptive weighting of the measurements relative to the smoothing process model. The matrix edge function adaptively and implicitly modulates the shape, size, and orientation of smoothing neighborhoods over different regions of the texture. It thus provides directional information on the texture that is not available in the more conventional scalar edge field based approaches. The adaptive measurement weighting varies the weighting between the measurements at each pixel. Image based analysis of human embryonic stem cells is the motivating application for this new approach, and we show how the features extracted using this approach can be used to automate the classification of pluripotent vs. differentiated stem cell nuclei based on confocal images of fluorescent GFP-labeled chromatin.
Lower bounds on the information rate of intersymbol interference channels based on the ungerboeck observation model
Authors: Fredrik Rusek, Dario Fertonani
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We consider the problem of lower bounding the information rate of intersymbol interference channels via Monte Carlo algorithms. We adopt a novel approach based on the Ungerboeck observation model, unlike the existing ones that are all based on the Forney model. The two approaches, yet equivalent in the case of full-complexity detection, lead to different results in the case of reduced-complexity detection, which is the only viable option when the channel memory is large. The proposed approach significantly outperforms the existing ones for all practical values of the signal-to-noise ratio.
Software development for neuroimaging: promoting community access and best practices through nitrc
Authors: David N. Kennedy, Christian Haselgrove, Robert Buccigrossi, Jeffrey Grethe
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

The Neuroimaging Informatics Tools and Resources Clearinghouse, NITRC, is a resource for organizing knowledge about the publicly available resources for neuroimaging. Located at www.nitrc.org, it is based on GForge, and brings a common environment for downloading, discussion, education, rating, and documentation for a growing number of resources. Moreover, NITRC provides a platform to support 'best practices' in software engineering and helps to remove barriers that have limited software sharing in the past. We present its design and status, and report on its uses not only to promote software, but also to foster communities of users that promote technological advances specific domain topics. Resources for neuroanatomic segmentation of structural MRI and functional connectivity analysis in fMRI are used as case studies.
A unified approach for repairing packet loss and accelerating channel changes in multicast IPTV
Authors: Ali C. Begen, Neil Glazebrook, William Ver Steeg
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In multicast-based IPTV distribution networks, when an IPTV viewer tunes to a new channel, the IP set-top box (STB) joins a new multicast session. Upon join, the IP STB needs to acquire and parse certain key information before it can process any data sent in the multicast session. Depending on the join time, length of the key information repetition interval, size of the key information as well as the application and transport properties, the time lag before the IP STB can usefully consume the multicast data, which we refer to as the synchronization delay, varies and may be large. This is an undesirable phenomenon and degrades the quality of experience perceived by the IPTV viewers. In this study, we describe a unified standards-based approach that can be used both to repair lost packets in real time and reduce the synchronization delay.
PIAX: toward a framework for sensor overlay network
Authors: Yuuichi Teranishi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, requirements and technologies for realizing sensor overlay networks are introduced. Sensor overlay networks should provide distributed data fusion mechanism, i.e. in-network computing feature, for effective computing on distributed sensors. Sensor overlay networks should also have scalability, maintainability and sustainability. To treat such requirements, we have developed an open source framework called 'PIAX'. The overview of PIAX and its technologies to treat sensor overlay networks are described in this paper.
Near maximum-likelihood detection with low complexity for collaborative spatial multiplexing in uplink mobile WiMAX systems
Authors: Sanhae Kim, Dongjun Lee, Oh-Soon Shin, Yoan Shin
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In mobile WiMAX systems, uplink collaborative MIMO (Multiple Input Multiple Output) performs spatial multiplexing with two PSSs (Portable Subscriber Stations), each with one antenna. As two PSSs transmit collaboratively on the same sub-channel, the overall uplink capacity will be doubled. To perform this interesting technique with high performance, most system venders demand the optimal MLD (Maximum-Likelihood Detection) in the RAS (Radio Access Station). However, the MLD is difficult to implement due to its explosive computational complexity. In this paper, we propose a two-step MIMO decoding scheme which achieves near ML performance with low complexity for CSM (Collaborative Spatial Multiplexing) in uplink mobile WiMAX systems that having an iterative channel decoder using bit LLR (Log-Likelihood Ratio) information. Simulation results show that the proposed scheme has almost the same BLER (BLock Error Rate) performance of the MLD with only about 15.75% computational complexity in terms of real multiplication, when both PSSs transmit with 16QAM (Quadrature Amplitude Modulation) modulation.
On the capacity of bounded rank modulation for flash memories
Authors: Zhiying Wang, Anxiao Jiang, Jehoshua Bruck
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

Rank modulation has been recently introduced as a new information representation scheme for flash memories. Given the charge levels of a group of flash cells, sorting is used to induce a permutation, which in turn represents data. Motivated by the lower sorting complexity of smaller cell groups, we consider bounded rank modulation, where a sequence of permutations of given sizes are used to represent data. We study the capacity of bounded rank modulation under the condition that permutations can overlap for higher capacity.
Model alignment of anthrax attack simulations
Authors: Li-Chiou Chen, Kathleen M. Carley, Douglas Fridsma, Boris Kaminsky, Alex Yahja
Venue: Decision Support Systems (2006)

This paper describes our experience aligning two simulation models of disease progression after biological attacks. The first model is the Incubation-Prodromal-Fulminant (IPF) model, a variation of the Susceptible-Infected-Recovered (SIR) epidemiological model, and the second is an agent-based model called BioWar. We run BioWar simulations to see whether the results will, at the population level, match the IPF results. We showed that BioWar can generate population level results that are close to IPF. In addition, BioWar outputs emergent properties that cannot be simulated in IPF. This study provides insights for modelers who are developing simulation tools for investigating bioterrorism attacks and for decision makers who use these tools.
New bounds on the maximal error exponent for multiple-access channels
Authors: Ali Nazari, S. Sandeep Pradhan, Achilleas Anastasopoulos
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The problem of bounding the reliability function of a multiple-access channel (MAC) is studied. An upper bound on the minimum Bhattacharyya distance between codeword pairs is derived. For a certain large class of two-user discrete memoryless (DM) MAC, a lower bound on the maximal probability of decoding error is derived as a consequence of the upper bound on Bhattacharyya distance. Further, an upper bound on the average probability of decoding error is studied. It is shown that the corresponding upper and lower bounds have a similar structure. Using a conjecture about the structure of the multi-user code, a tighter lower bound for the maximal probability of decoding error is derived and is shown to be tight at zero rates.
A4.2 mW 5.7-GHz frequency synthesizer with dynamic-logic (TSPC) frequency divider
Authors: J. P. Carmo, P. M. Mendes, J. H. Correia
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

This paper presents a Phase-Locked Loop (PLL) used as a frequency synthesizer for a radio-frequency (RF) transceiver for use in the 5.7 ISM band, which were designed in tbe UMC RF 0.18 µm CMOS process. Tbe PLL produces a set of different 16 digitally programmable frequencies in tbe [5424; 5830 MHz] frequency range. The low-power operation is achieved with the use of dynamic logic in the feedback path. Simulations shown a total power consumption of 4.2 mW. Target applications are wireless sensors and microsystems applications that need RF transceivers for operation in the 5.7 GHz band.
MIMO Gaussian broadcast channels with confidential messages
Authors: Ruoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (a prefix channel) and random binning.
The legal environment for copyright protection and trust management in China
Authors: Lei Sun, Li Zhao, Xin Tong, W. Knox Carey
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper surveys the legal and regulatory environment surrounding copyright protection technologies, focusing on China in particular. The paper begins with a discussion of some of the interactions between law and technology in copyright protection, which has led to the creation of international treaties to protect the technologies that protect copyrights. A comparison of the various national responses to these conventions is presented, followed by a discussion of the structure and development of the relatively advanced Chinese system for copyright protection technology. The last section outlines some of the unique challenges that have arisen in China for copyright protection technologies and the businesses that depend upon them.