ppxscal/embedding_network huggingface dataset:
MIMO compute-and-forward
Authors: Jiening Zhan, Bobak Nazer, Michael Gastpar, Uri Erez
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

In many network communication scenarios, a relay in the network may only need to recover and retransmit an equation of the transmitted messages. In previous work, it has been shown that if each transmitter employs the same lattice code, the interference structure of the channel can be exploited to recover an equation much more efficiently than possible with standard multiple-access strategies. Here, we generalize this compute-and-forward framework to the multiple antenna setting. Our results show that it is often beneficial to use extra antennas at the receiver to rotate the channel coefficients towards the nearest integer vector instead of separating out the transmitted signals. We also demonstrate that in contrast to classical strategies, the multiplexing gain of compute-and-forward increases if the transmitters have channel state information. Finally, we apply our scheme to the two way relay network and observe performance gains over traditional strategies.
Proxy mobile IP extension for mobile multimedia multicast services
Authors: Young-Taek Kim, Seung-Jae Han
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Seamless mobility support and efficient network resource utilization is the key to the performance of mobile multimedia services. Currently, the PMIP (Proxy Mobile-IP) and the IMS (IP Multimedia Subsystem) are considered as the primary means to this end, mostly focusing on unicast applications (e.g., voice over IP). In this paper, we extend the application scope to multicast services and propose a solution framework combining the PMIP with IP multicast. Specifically, we propose an extension of the PMIP (called PMIP-M) for a seamless handover of multicast services that use existing IP multicast protocols, where gradual IP multicast deployment is taken into account for practicality. That is, a user can start or continue to receive multicast service even when he migrates to a network without IP multicast capability. The performance of the proposed scheme is analyzed by extensive simulations.
Adaptive filter design for image deblurring by using multi-criteria blurred image information
Authors: Ziya Telatar
Venue: Digital Signal Processing (2005)

This paper introduces a novel method to enhance the quality of blurred images. The proposed method is based on the estimation of the multi-criteria information of the degraded images. The multi-criteria information is extracted from the distribution model and the boundaries of the input image. The actual image blurred by an unknown distribution is correlated with predetermined reference models in order to choose the restoration filter model. The filter coefficient is then estimated using the edge information of the degraded image. Experiments have been conducted using simulated and real world images to evaluate the performance of the proposed method and the results are presented.
3D reconstruction from electron microscope images with TXBR
Authors: Albert F. Lawrence, Sébastien Phan, Farshid Moussavi
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Tomographic reconstruction from large format electron microscope requires special procedures to handle geometric distortions arising from electron optics as opposed to lightray optics. In particular, electrons travel in curvilinear paths through the sample and defocus and other aberrations can be more severe. We report on a software package, TxBR, which solves the inverse problem associated with a generalized ray transform. We also review the prospects for automated alignment, and discuss possible approaches.
Adaptive multi-channel MAC protocol for dense VANET with directional antennas
Authors: Xu Xie, Benxiong Huang, Shaoshi Yang, Tiejun Lv
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Directional antennas in Ad hoc networks offer more benefits than the traditional antennas with omni-directional mode. With directional antennas, it can increase the spatial reuse of the wireless channel. A higher gain of directional antennas makes terminals a further transmission range and fewer hops to the destination. This paper presents the design, implementation and simulation results of a multi-channel Medium Access Control (MAC) protocols for dense Vehicular Ad hoc Networks using directional antennas with local beam tables. Numeric results show that our protocol performs better than the existing multi-channel protocols in vehicular environment.
Detection error exponent for spatially dependent samples in random networks
Authors: Animashree Anandkumar, Lang Tong, Alan Willsky
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

The problem of binary hypothesis testing is considered when the measurements are drawn from a Markov random field (MRF) under each hypothesis. Spatial dependence of the measurements is incorporated by explicitly modeling the influence of sensor node locations on the clique potential functions of each MRF hypothesis. The nodes are placed i.i.d. in expanding areas with increasing sample size. Asymptotic performance of hypothesis testing is analyzed through the Neyman-Pearson type-II error exponent. The error exponent is expressed as the limit of a functional over dependency edges of the MRF hypotheses for acyclic graphs. Using the law of large numbers for graph functionals, the error exponent is derived.
Stochastic resonance and improvement by noise in optimal detection strategies
Authors: David Rousseau, François Chapeau-Blondeau
Venue: Digital Signal Processing (2005)

A stochastic resonance effect, under the form of a noise-improved performance, is shown feasible for a whole range of optimal detection strategies, including Bayesian, minimum error-probability, Neyman-Pearson, and minimax detectors. In each case, situations are demonstrated where the performance of the optimal detector can be improved (locally) by raising the level of the noise. This is obtained with a nonlinear signal-noise mixture where a non-Gaussian noise acts on the phase of a periodic signal.
3D spatial drift correction using Kalman filtering for fluorescence based imaging
Authors: T. Dorval, C. B. Moraes, A. Ogier, L. H. Freitas-Junior, A. Genovesio
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

In this paper we present a framework for correcting the spatial drift that can occur in 3D optical fluorescence microscopy images. These shifts happen during long time acquisition and can corrupt further analysis. This artifact has to be taken into account especially if the application requires an high spatial detection accuracy. Our correction method is based on the use of a microsphere located within the biological assay. As the bead does not provide the same correction quality for each Z-slice, we propose here, to include a level of confidence depending on the depth in a Kalman filtering process. This framework allows then to extend the motion compensation along the complete 3D images. This method is validated on real data and provides an easy and accurate way to correct 3D images corrupted along Z by a XY motion.
A collusion-resistant automation scheme for social moderation systems
Authors: Jing-Kai Lou, Kuan-Ta Chen, Chin-Laung Lei
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

For current Web 2.0 services, manual examination of user uploaded content is normally required to ensure its legitimacy and appropriateness, which is a substantial burden to service providers. To reduce labor costs and the delays caused by content censoring, social moderation has been proposed as a front-line mechanism, whereby user moderators are encouraged to examine content before system moderation is required. Given the immerse amount of new content added to the Web each day, there is a need for automation schemes to facilitate rear system moderation. This kind of mechanism is expected to automatically summarize reports from user moderators and ban misbehaving users or remove inappropriate content whenever possible. However, the accuracy of such schemes may be reduced by collusion attacks, where some work together to mislead the automatic summarization in order to obtain shared benefits. In this paper, we propose a collusion-resistant automation scheme for social moderation systems. Because some user moderators may collude and dishonestly claim that a user misbehaves, our scheme detects whether an accusation from a user moderator is fair or malicious based on the structure of mutual accusations of all users in the system. Through simulations we show that collusion attacks are likely to succeed if an intuitive count-based automation scheme is used. The proposed scheme, which is based on the community structure of the user accusation graph, achieves a decent performance in most scenarios.
Active TV: enter into a cross media, community-based experience
Authors: Emmanuel Marilly, Alexis Germaneau, Bertrand Boidart, Olivier Martinot
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The Active TV concept offers solutions providing end users with easy access to new audiovisual services and applications from various terminals. A unique experience with new types of group interactions becomes possible in the form of advanced local and community services. To enable the delivery of such services with the required quality and security, Active TV addresses the problem of pushing a part of the service logic as close as possible to the end-user - that is to the residential gateway and end-user equipment.
Cross-layer design of embedded modulation and retransmission diversity for prioritized packet transmission in wireless networks
Authors: A. Annamalai, D. Vaman, J. Matyjas, M. Medley
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The current and future wireless systems need to support a multitude of services with a wide range of data rates and reliability requirements. The limited battery resource at the mobile terminals coupled with the hostile multipath fading channel makes the problem of providing reliable multimedia services challenging. In this article, we develop a novel method to mechanize a prioritized unicast transmission at the physical layer in response to the disparate quality of service requirements for multimedia traffic (imposed by upper layers) and investigate how the unequal bit error protection offered by multiresolution modulation is capitalized at the data link layer to yield a substantial throughput gain and minimize the packet loss probability of the "more important" packets in an inte-- grated voice/data and delay-sensitive applications (especially in poor and moderate channel conditions). However, there exists a slight throughput penalty in the high signal-to-noise ratio regime due to competitive nature of the "optimal reliable signaling rate" in an unknown time-varying channel.
Fragile watermarking based on localized histogram modification
Authors: Hyang-Mi Yoo, Sang-Kwang Lee, Jae-Won Suh
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, we propose a fragile watermarking algorithm for image authentication and integrity. Existing fragile watermarking algorithms had to accept the image distortion in order to insert the watermark. To overcome this drawback, we propose a new fragile watermarking algorithm which can recover the original image after extracting the watermark. Experimental results are presented to demonstrate the validity of the proposed algorithm.
Analysis of packet error probability in delay constrained communication over fading channels
Authors: Xihua Dong, Xiaochen Li, Dapeng Wu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Future wireless networks are expected to provide quality of service (QoS) guarantees. QoS requirements at the networking layers include data rate, delay bound, and packet error probability. However, these QoS requirements pose significant challenges since wireless fading channels may cause severe QoS violations. To mitigate fading effects, adaptive schemes such as transmission rate control and power control are usually used. In this paper, we study a wireless communication system that adapts the transmission rate; we assume that the channel state information (CSI) is available at the transmitter side, and the transmission power is fixed. The system under study consists of 1) a discrete-time queueing system on the link layer, and 2) a channel coding system on the physical layer. The objective of this paper is to analyze the relationship among packet error probability, data rate, delay bound, and buffer size. In our analysis, we consider three types of packet errors, i.e., 1) packet drop due to full buffer, 2) packet drop due to delay bound violation, and 3) packet decoding error due to channel noise. We derive packet drop probability and decoding error probability for our system, and obtain an upper bound on the packet error probability. Furthermore, by minimizing the packet error probability over the transmission rate, we obtain an optimal rate control law that guarantees the user-specified data rate and delay bound. Our results show that our analysis agrees well with simulation.
A distributed energy-efficient cluster formation protocol for wireless sensor networks
Authors: Ali Chamam, Samuel Pierre
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Maximizing network lifetime and minimizing energy consumption are among the central concerns in the design of applications and protocols for wireless sensor networks (WSN). Clustering has been proven energy-efficient in sensor networks since data processing, filtering routing and relaying are operated only by cluster heads, thus reducing network load and alleviating the bandwidth. In this paper, we propose a novel distributed clustering algorithm where cluster heads are elected following a three-way message exchange between each sensor and its neighbors. Sensor's eligibility to be elected cluster head is mainly based on its residual energy and its degree. Our protocol has a message exchange complexity of O(1) and a worst-case convergence time complexity of O(N). Simulations show that our algorithm outperforms EESH, a recently published distributed clustering algorithm, in terms of network lifetime and ratio of elected cluster heads.
Searching for high-rate convolutional codes via binary syndrome trellises
Authors: Florian Hug, Irina E. Bocharova, Rolf Johannessen, Boris D. Kudryashov
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

Rate R = (c-1)/c convolutional codes of constraint length ν can be represented by conventional syndrome trellises with a state complexity of s = ν or by binary syndrome trellises with a state complexity of s = ν or s = ν + 1, which corresponds to at most 2s states at each trellis level. It is shown that if the parity-check polynomials fulfill certain conditions, there exist binary syndrome trellises with optimum state complexity s = ν. The BEAST is modified to handle parity-check matrices and used to generate code tables for optimum free distance rate R = (c - 1)/c, c = 3, 4, 5, convolutional codes for conventional syndrome trellises and binary syndrome trellises with optimum state complexity. These results show that the loss in distance properties due to the optimum state complexity restriction for binary trellises is typically negligible.
Field trial on cognitive radio technology: adaptive co-use of heterogeneous wireless media on multiple base stations
Authors: Toshiaki Yamamoto, Jong-Ok Kim, Tetsuro Ueda, Sadao Obana
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

As advanced integrated network architecture, "cognitive radio technologies," which aim to improve the spectrum efficiency, have been studied. In the cognitive radio networks, each node recognizes radio conditions, and according to them, optimizes their wireless communication routes with the integration of the heterogeneous wireless media not only by switching over them but also aggregating and utilizing them simultaneously. The Adaptive control of switchover use and concurrent use of various wireless media will offer a stable and flexible wireless communication. In this paper, we introduce our cognitive radio testbed that has IEEE802.16 and IEEE802.11 interfaces, and perform the field trial in order to experimentally examine the effectiveness of the cognitive radio technologies. The experimental results show that the concurrent use of IEEE802.16 and IEEE802.11 wireless media offers high IP throughput performance and furthermore, the adaptive route control according to the radio conditions improves the IP throughput by more than 20% and reduce the one-way delay to less than 1/6. It is found that the cognitive radio technologies can provide the appropriate wireless communication routes to meet various demands for application QoS.
On the estimation of random unobserved signals by maximization of target likelihoods and its application to blind timing and phase recovery
Authors: Joaquín Míguez, Mónica F. Bugallo
Venue: Digital Signal Processing (2005)

Many important problems in signal processing can be reduced to the adequate selection of the parameters of a (possibly nonlinear) filter in order to obtain an output signal that complies with some desired properties. In this work, we analyze a novel criterion for selecting filter parameters that relies on the ability to characterize the desired filter output in terms of a target probability density function (pdf). This target pdf can be handled as a likelihood function to be maximized, thus we refer to the new criterion as maximum target-likelihood (MTL). We present a very general signal model where the MTL criterion can be applied and derive necessary and sufficient conditions for asymptotic convergence of the method. The relationship and differences between MTL and standard maximum likelihood (ML), minimum Kullback-Leibler divergence (MKLD), and minimum entropy (ME) methods are explored. Finally, as an example, we apply the novel criterion to the problem of blind timing and phase recovery in a digital transmission system and show that the resulting algorithm is competitive with existing non-data-aided ML-based algorithms.
On the number of minimum weight codewords of SFA-LDPC codes
Authors: Yuichi Kaji
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

The number of minimum weight codewords is an important parameter to measure the potential performance of a linear block code. This paper studies the number of minimum weight codewords of simple and full-length array (SFA) LDPC codes. The notion of a cyclic shift closure is introduced, and it is shown that the set of minimum weight codewords of the code is partitioned by cyclic shift closures of minimum weight codewords. Each cyclic shift closure is generated from a special codeword. With the help of computer experiment, general algebraic forms of the special codewords are determined. As the result, the numbers of minimum weight codewords of several classes of SFA-LDPC codes are clearly expressed by formulas.
Strong converse for Gel'fand-Pinsker channel
Authors: Pierre Moulin
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

A strong converse for the Gel'fand-Pinsker channel is established in this paper. The method is then extended to a multiuser scenario. A strong converse is established for the multiple-access Gel'fand-Pinsker channel under the maximum error criterion, and the capacity region is determined.
Interference alignment and the generalized degrees of freedom of the X channel
Authors: Chiachi Huang, Viveck R. Cadambe, Syed A. Jafar
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We study the sum capacity of the X channel generalization of the symmetric 2-user interference channel. In this X channel, there are 4 independent messages, one from each transmitter to each receiver. We characterize the sum capacity of a deterministic version of this channel, and obtain the generalized degrees of freedom characterization for the Gaussian version. The regime where the X channel outperforms the underlying interference channel is explicitly identified, and an interesting interference alignment scheme based on a cyclic decomposition of the signal space is shown to be optimal in this regime.
On the supply function equilibrium and its applications in electricity markets
Authors: Aleksandr Rudkevich
Venue: Decision Support Systems (2005)

The paper deals with the Supply Function Equilibrium (SFE) as a model of competition in electricity markets. It introduces theoretical advancement through relaxing traditional assumptions of continuity of supply functions and provides a foundation for efficient computational algorithms. Two special examples are considered. One demonstrates that continuous equilibrium could be impossible while an infinite set of discontinuous equilibria exists. Another example proves the convergence to a linear equilibrium through learning in linear supply system. A possibility of a similar convergence for piece-wise linear system is being discussed.
Segmentation and classification of triple negative breast cancers using DCE-MRI
Authors: Shannon C. Agner, Jun Xu, Hussain Fatakdawala, Shridar Ganesan, Anant Madabhushi, Sarah Englander, Mark Rosen, Kathleen Thomas, Mitchell Schnall, Michael Feldman, John Tomaszewski
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Triple-negative (TN) breast cancer has gained much interest recently due to its lack of response to receptor-targeted therapies and its aggressive clinical nature. In this study, we evaluate the ability of a computer-aided diagnosis (CAD) system to not only distinguish benign from malignant lesions on dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI), but also to quantitatively distinguish triple negative breast cancers from other molecular subtypes of breast cancer. 41 breast lesions (24 malignant, 17 benign) as imaged on DCE-MRI were included in the dataset. Of the 24 malignant cases, 13 were of the TN phenotype. Using the dynamic signal intensity information from the DCE-MRIs, an Expectation Maximization-driven active contours scheme is used to automatically segment the breast lesions. Following quantitative morphological, textural, and kinetic feature extraction, a support vector machine classifier was employed to distinguish (a) benign from malignant lesions and (b) TN from non-TN cancers. In the former case, the classifier yielded an accuracy of 83%, sensitivity of 79%, and specificity of 88%. In distinguishing TN from non-TN cases, the classifier had an accuracy of 92%, sensitivity of 92%, and specificity of 91%. The results suggest that the TN phenotype has distinct and quantifiable signatures on DCE-MRI that will be instrumental in the early detection of this aggressive breast cancer subtype.