ppxscal/embedding_network huggingface dataset:
Optimal axis compensation in quantum key distribution protocols over unital channels
Authors: Shun Watanabe, Ryutaroh Matsumoto, Tomohiko Uyematsu
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The axis compensation is a procedure in which the sender and the receiver compensate the axes of their transmitter and detector so that the bit sequence can be transmitted more reliably. We show the optimal axis compensations maximizing the key generation rate. We consider the case in which only the receiver is allowed to compensate his axis, and the case in which both the sender and the receiver are allowed to compensate their axes. For unital channels, we clarify that the optimal key generation rates for both cases coincide if they utilize the mismatched measurement outcomes in the channel estimation. We also clarify that the optimal key generation rates for both cases do not coincide in general if they do not utilize the mismatched measurement outcomes in the channel estimation.
Provide VoD service in peer-to-peer network using offset ranking and epidemic diffusion
Authors: Xing Chen, Qing Yang
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The Peer-to-Peer solution provides a service model that is attractive for Video-on-demand (VOD). The key idea of using P2P technology is to aggregate storage and bandwidths capacity of peers to alleviate workload on the source server. Compared with P2P live streaming, it is much more challenge for VOD due to peers' asynchronous request, different interested portion and support for VCR-like operation. In this paper, we utilize two-scale list of peers, which is composed of R-peers and S-peers, to locate collaborator and support VCR operation. Demand-driven chunk swarming is proposed to exchange data with ragged collaborators in the VoD system. Simulation results show that the source sever load is significantly reduced, playback continuity is guaranteed and our method supports VCR operation quite well.
An approach for PAPR reduction based on tone reservation method
Authors: Yunmok Son, Chang Hyun Nam, Hwang Soo Lee
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In the multicarrier transmissions such as orthogonal frequency division multiplexing (OFDM), one of the main problem is the high peak-to-average power ratio (PAPR) of transmission signals due to the superposition of many subcarriers. In this paper, we propose an approach for PAPR reduction using tone reservation (TR). The proposed approach guarantees a certain bound of PAPR reduction gain by using only one reserved subcarrier symbol. The bound depends on the ratio of the first and second peak magnitude. The proposed approach can be applied to not only one reserved subcarrier but also multiple reserved subcarriers. In the latter case, two methods are presented. To get more PAPR reduction gain, the proposed approach can be modified by adjusting the appropriate threshold
Analysis and segmentation of brain MR images with blind-source-separation techniques
Authors: Eldad Vizel, David Carasso, Yehoshua Y. Zeevi
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

The intensity value of each voxel in a Brain MR image is considered to be a linear combination of signal intensities emitted from protons in aqueous and lipid environments inside that voxel. A novel model describing the Proton Density (PD) and fraction of protons in aqueous environment (Water Fraction - WF) as independent sources of an MR image is suggested. We consider an input set of registered T1 and T2 weighted images to be the mixtures. The sources are separated from these mixtures by applying a geometrical Blind-Source-Separation technique on Sparse projection of the mixtures. A novel model is proposed to relate between the observed scatter-plot and the actual orientations of the mixing matrix and its estimation. The resulting PD source-image is compared to available PD weighted image of the same patient. WF image is used for anatomic classification of the image into brain tissues - White Matter (WM), Grey Matter (GM), and Cerebrospinal Fluid (CSF).
Device driver isolation within virtualized embedded platforms
Authors: Sebastian Sumpf, Jörg Brakensiek
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Mobile device manufacturers are facing the challenge, to maintain device drivers across an increasing number of product variants. Isolation of device drivers into a separate domain using virtualization technology offers a way out of the resulting porting dilemma. This paper explains the architecture concept based on the L4/Fiasco microkernel, using an exemplary block device. The paper specifically details challenges and solutions with respect to enabling DMA access and ensuring access protection in the virtualized environment. Benchmark results are given to show the performance impact of the chosen architecture.
On the expressibility of stochastic switching circuits
Authors: Hongchao Zhou, Jehoshua Bruck
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Stochastic switching circuits are relay circuits that consist of stochastic switches (that we call pswitches). We study the expressive power of these circuits; in particular, we address the following basic question: given an arbitrary integer q, and a pswitch set {1/q, 2/q, ...., q-1/q}, can we realize any rational probability with dencimlnator qn (for arbitrary n) by a simple series-parallel stochastic switching circuit? In this paper, we generalized previous results and prove that when q is a multiple of 2 or 3 the answer is positive. We also show that when q is a prime number the answer is negative. In addition, we prove that any desired probability can be approximated well by a linear in n size circuit, with error less than q-n.
A spatio-temporally adaptive clustering protocol for wireless microsensor networks
Authors: Nagarjun Rao Kota, Piyush Grover, Pabitra Mitra
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

We present a Spatio-Temporally Adaptive Clustering (STACK) protocol for wireless microsensor networks. It takes into account data correlation, both spatial and temporal, using dynamically computed nearness and activity functions. The objective is to uniformly budget energy expenditure over space and time. All three forms of energy expenditure, namely transmission, reception and computation are considered. The STACK protocol also enhances the lifetime of the network by predicting the survivability of the formed clusters. STACK provides a higher variance for the set of data collected, thus leading to a more accurate picture of the region of interest. Our simulation demonstrates this and achieves better energy efficiency and lifetime compared to existing approaches.
A seamless QoS-enabled mobility management mechanism for moving networks
Authors: George Kamel, Paul Pangalos, Andrej Mihailovic, A. Hamid Aghvami
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

The demand for resource-hungry applications whilst on the move is growing, and is being fuelled in particular by the increasing availability of high-quality multimedia services. To this end, micro-mobility protocols play an important role in providing seamless data delivery to terminals as they roam across different networks. However, such protocols typically lead to bottleneck congestion occurring within the access network. Within moving networks, in which a potentially vast number of terminals are present, the bottleneck congestion problem is significantly magnified, and can lead to increased call dropping probability and/or quality-of-service degradation. This paper therefore presents a novel mechanism, designed to ensure that the continuity of all sessions of a moving network is seamlessly preserved as it performs handovers to and within micro-mobility-enabled access networks.
Compressed network coding vectors
Authors: Mahdi Jafari, Lorenzo Keller, Christina Fragouli, Katerina Argyraki
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

In networks that employ network coding, two main approaches have been proposed in the literature to allow the receivers to recover the source information: (i) use of coding vectors, that keep track of the linear combinations the received packets contain, and (ii) subspace coding, that dispenses of the need to know the linear combinations, since information is conveyed from the choice of subspaces alone. Both these approaches impose the strong requirement that all source packets get potentially combined. We here present a third approach that relaxes this assumption, and is thus not a special case from either of the previous two. This relaxation allows to employ compressed coding vectors to efficiently convey the coding coefficients, without altering the operation of intermediate network nodes. We develop optimal designs for such vectors.
Rank pattern-based selection of input/output ARMA model order
Authors: Karl Gerlach, Michael Frey
Venue: Digital Signal Processing (2005)

Rational transfer functions are standard models for radar targets and adaptive beamforming. Fitting these models essentially involves estimating the transfer function ''poles and zeroes.'' A key preliminary step in this estimation process is to determine the numbers of poles and zeros, or equivalently to determine the order of the corresponding ARMA model. A pattern-based method of order selection using matrix ranks is proposed for input/output (I/O) ARMA models, where ARMA model inputs and outputs are each observed in additive noise with known variances. This I/O ARMA model encompasses two distinct scenarios: observational studies in which all observations-those of both inputs and outputs-are erred, and controlled experiments in which outputs are observed with error while inputs are known without error. The proposed rank pattern method exploits the eigenvalue structure of the covariance matrices associated with the observed data and performs well for short data records at moderate SNRs.
Stent graft removal for improving 2D-3D registration
Authors: Maximilian Baust, Stefanie Demirci, Nassir Navab
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Being performed under extensive radiation exposure, endovascular stent graft placements would greatly benefit from a reliable navigation solution. A successful implementation of such a system requires an accurate 2D-3D registration. Since the stent graft is only visible in the radiograph, registration algorithms can easily be attracted to wrong structures. In this paper, we address this problem by presenting a fast algorithm for removing the stent graft which meets real-time constraints. Based on Poisson editing, our method is easy to implement and extremely user-friendly as it requires neither parameter adjustment nor precise presegmentation. Moreover, we prove the significance of our algorithm by a realistic ground truth study.
Segmentation of brain magnetic resonance images through morphological operators and geodesic distance
Authors: Juan I. Pastore, Emilce G. Moler, Virginia L. Ballarin
Venue: Digital Signal Processing (2005)

When segmenting magnetic resonance (MR) images, a wide range of useless information arises, which has to be discarded as a step prior to classifying the different cerebral cortex areas. To obtain effective results during the classification process, it is necessary to work with images solely containing the brain and eliminate the cranium and surrounding meninges. This work introduces an automatic method for the detection of said structures based on the application of morphology alternating sequential filters by reconstruction with structuring elements of growing size. Apart from enhancing and filtering in this way, this method captures the interior of a closed simple curve employing geodesic distance. Said curve represents the external brain boundary.
Information embedding with reversible stegotext
Authors: Orna Sumszyk, Yossef Steinberg
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

Information embedding is the transmission of an independent data embedded into a host signal via a noisy channel. Reversible information embedding (RIE) extends this model by adding the requirement of decoding the host signal. In some applications however, this requirement is too strong. For example, if the user is interested in decoding the data and further transmitting the stegotext, i.e, the result of the embedding of independent data into the host, then full decoding of the host is not needed, only re-production of the stegotext. This work expands the study of information embedding channels by adding the requirement of retrieving the stegotext at the destination. A single-letter characterization of the achievable rate-distortion region is developed. In particular, it is shown that a rate higher than the RIE rate can be achieved, under the (more relaxed) requirement of stegotext decoding. Two examples are solved, and an iterative algorithm that computes numerically the capacity is provided.
A novel construction of complex orthogonal designs with maximal rate and low-PAPR
Authors: Smarajit Das, B. Sundar Rajan
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas. In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For n transmit antennas, the maximal rate of a COD is 1/2 + 1/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.
Directional antenna for multipath ad hoc routing
Authors: Hamid Gharavi, Bin Hu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Multipath routing can be effectively used to maximize the utilization of network resources for real-time traffic. In mobile ad-hoc network environments, this approach can suffer from co-channel interference due to the simultaneous transmission of packets via multiple routes. In this paper, by exploiting the directionality of directional antennas, a Directional Dynamic Source Routing (DDSR)-based Multipath routing protocol is proposed for mobile wireless ad hoc networks. Three metrics are considered in the route discovery process in order to select the best multiple routes. These are hop count, beam overlaps, and the number of joint nodes between the different routes. The proposed directional routing protocol has shown to be capable of minimizing inter-path and intra-path interference, hence significantly improving the system throughput performance for simultaneous transmission of multimedia information over multiple routes.
A novel probabilistic data association based MIMO detector using joint detection of consecutive symbol vectors
Authors: Shaoshi Yang, Tiejun Lv
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

A new probabilistic data association (PDA) approach is proposed for symbol detection in spatial multiplexing multiple-input multiple-output (MIMO) systems. By designing a joint detection (JD) structure for consecutive symbol vectors in the same transmit burst, more a priori information is exploited when updating the estimated posterior marginal probabilities for each symbol per iteration. Therefore the proposed PDA detector (denoted as PDA-JD detector) outperforms the conventional PDA detectors in the context of correlated input bit streams. Moreover, the conventional PDA detectors are shown to be a special case of the PDA-JD detector. Simulations and analyses are given to demonstrate the effectiveness of the new method.
Contextual advertising for IPTV using automated metadata generation
Authors: Lee Begeja, Paul Van Vleck
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Current IPTV monetization focuses on mainstream programming that is well understood, with metadata that is stored in advance. Current contextual advertising is focused on web searches and static information. As the demand for online internet video grows into the IPTV market, the need to monetize it effectively becomes important. As the advertising market for IPTV expands into less mainstream video (e.g. YouTube and other user generated content) it becomes more important to automate the generation of metadata for the video The metadata associated with self-described YouTube videos are unreliable and can not be used as a basis for effective contextual advertising. Automatic generation, however, brings down the cost of creating metadata and gives advertisers a neutral party that evaluates the data. We propose a system in which a trusted intermediary automatically generates reliable metadata for multimedia.
Coding stimulus information with cooperative neural populations
Authors: Mehdi Aghagolzadeh, Seif Eldawlatly, Karim Oweiss
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Understanding the mechanism underlying distributed neural coding is a fundamental goal in computational neuroscience. With the ability to simultaneously observe the activity of large networks of neurons in response to external stimuli, a natural question arises: how the outside world is represented in the collective activity of these neurons? In this work, we provide an information theoretic approach for determining the role of cooperation among neurons in encoding external stimuli, Specifically, we show that statistical independence between neuronal outputs may not provide the best coding strategy when these outputs depend on the history of other neuronal constituents in the network. Rather, cooperation among neurons can provide a near optimal and lossless coding strategy under specific constraints governing their network structure. Using a statistical learning model, we demonstrate the performance of the proposed approach in decoding a motor task with both discrete targets and continuous trajectory using spike trains from a small subset of a large network. We demonstrate its superiority in minimizing the decoding error compared to a statistically independent model and to other classical decoders reported in the literature.
Mobility management architecture based on integrated HIP and SIP protocols
Authors: Yong Li, Wentao Chen, Li Su, Depeng Jin, Lieguang Zeng
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

To deal with increasing number of the mobile devices and applications in the next generation all-IP wireless networks, effective mobility management has become a critical problem. In this paper, we propose a new mobility management architecture, named I-HSIP, which integrates Host Identity Protocol (HIP) and Session Initiation Protocol (SIP) to handle TCP and UDP applications respectively. In this architecture, we utilize the joint optimization of HIP and SIP while exploring both of their advantages. The redundant entities for the similar function are merged to simplify the mobility management procedures such as registration, session initiation and handoff by reducing the system signaling. The simulation results show that I-HSIP outperforms the previous mobility architecture such as Integrated MIP-SIP and SHIP on the signaling overhead and handoff delay.
Performance evaluation and ASIC design of LDPC decoder for IEEE 802.11n
Authors: W. A. Syafei, R. Yohena, H. Shimajiri, T. Yoshida, M. Kurosaki, Y. Nagao, B. Sai, H. Ochi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper presents our investigation on performance enhancement due to the implementation of low density parity check (LDPC) codes on IEEE 802.11n system and its Application Specific Integrated Circuit design. Simulation result shows that in higher coding rate, LDPC codes gives 6 dB better performance compared to binary convolutional codes. Logic synthesis is succesfully done on 0.13 µm CMOS technology with low-power standard cell library.
A cooperative routing method for multiple overlay networks
Authors: Hiroki Okada, Tran Nguyen Trung, Kazuhiko Kinoshita, Koso Murakami, Nariyoshi Yamai
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

When multiple overlay networks are constructed over the same underlying IP network, overlay paths on different overlay networks may share some links on the IP network. In general, however, because overlay networks do not recognize the existence of each other, they have no consideration on such shared physical links. In this paper, a cooperative routing method for multiple overlay networks is proposed to improve the throughput of all overlay networks.
On observable delegation of personal data by watermarking
Authors: Sven Wohlgemuth, Günter Müller, Noboru Sonehara, Isao Echizen
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Privacy in business processes for personalized services is currently a matter of trust, since business processes require the delegation of personal data and users are not able to control their usage and so their delegation. Existing privacy-enhancing technologies like identity management systems consider access control but not the usage of personal data. Current work on usage control mainly considers classification and formalization of usage rules, so called obligations, and the delegation of personal data with a trusted third party (TTP). We investigate on digital watermarking in order to observe the enforcement of obligations for a delegation of personal data without a TTP.
On concentric spherical codes and permutation codes with multiple initial codewords
Authors: Ha Q. Nguyen, Vivek K. Goyal, Lav R. Varshney
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Permutation codes are a class of structured vector quantizers with a computationally-simple encoding procedure. In this paper, we provide an extension that preserves the computational simplicity but yields improved operational rate-distortion performance. The new class of vector quantizers has a codebook comprising several permutation codes as subcodes. Methods for designing good code parameters are given. One method depends on optimizing the rate allocation in a shapegain vector quantizer with gain-dependent wrapped spherical shape codebook.