ppxscal/embedding_network huggingface dataset:
An efficient channel condition aware proportional fairness ressource allocation for powerline communications
Authors: Ali Maiga, Jean-Yves Baudais, Jean-François Hélard
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Powerline communications (PLC) become a viable local area network (LAN) solution for in-home networks. We are witnessing a growing number of in-home devices and services using PLC systems. In this paper, the resource allocation problem with peak BER constraint is investigated in multiuser context. A new proportional fairness resource allocation algorithm which takes into account the channel conditions is proposed for the downlink. This algorithm is based on linear precoded OFDM (LP-OFDM) which enables reliable high bit rate transmission under peak BER constraint. The algorithm tries to maximize the overall throughput of the system under different users required bit rate constraints. Simulations are run over PLC channels and it is shown that proposed algorithms under peak BER constraint give better performance than classical proportional fairness algorithms. In addition, the linear precoding technique brings significant data rate gain and reduces the number of unsatisfied users.
Coding for two-user Gaussian MAC with PSK and PAM signal sets
Authors: J. Harshan, B. Sundar Rajan
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Constellation Constrained (CC) capacity regions of a two-user Gaussian Multiple Access Channel (GMAC) have been recently reported. For such a channel, code pairs based on trellis coded modulation are proposed in this paper with M- PSK and M-PAM alphabet pairs, for arbitrary values of M, to achieve sum rates close to the CC sum capacity of the GMAC. In particular, the structure of the sum alphabets of M-PSK and M- PAM alphabet pairs are exploited to prove that, for certain angles of rotation between the alphabets, Ungerboeck labelling on the trellis of each user maximizes the guaranteed squared Euclidean distance of the sum trellis. Hence, such a labelling scheme can be used systematically to construct trellis code pairs to achieve sum rates close to the CC sum capacity. More importantly, it is shown for the first time that ML decoding complexity at the destination is significantly reduced when M -PAM alphabet pairs are employed with almost no loss in the sum capacity.
Capacity of channels with action-dependent states
Authors: Tsachy Weissman
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel states, and then creates the channel input sequence based on the state sequence. We characterize the capacity of such a channel both for the case where the channel inputs are allowed to depend non-causally on the state sequence and the case where they are restricted to causal dependence. Our setting covers previously considered scenarios involving transmission over channels with states known at the encoder, as well as various new coding scenarios for channels with a 'rewrite' option that may arise naturally in storage for computer memories with defects or in magnetic recoding. A few examples are worked out in detail.
Tunable tensor voting for regularizing punctate patterns of membrane-bound protein signals
Authors: Leandro A. Loss, George Bebis, Bahram Parvin
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Membrane-bound protein, expressed in the basal-lateral region, is heterogeneous and an important endpoint for understanding biological processes. At the optical resolution, membrane-bound protein can be visualized as being diffused (e.g., E-cadherin), punctate (e.g., connexin), or simultaneously diffused and punctate as a result of sample preparation or conditioning. Furthermore, there is a significant amount of heterogeneity as a result of technical and biological variations. This paper aims at enhancing membrane-bound proteins that are expressed between epithelial cells so that quantitative analysis can be enabled on a cell-by-cell basis. We propose a method to detect and enhance membrane-bound protein signal from noisy images. More precisely, we build upon the tensor voting framework in order to produce an efficient method to detect and refine perceptually interesting linear structures in images. The novelty of the proposed method is in its iterative tuning of the tensor voting fields, which allows the concentration of the votes only over areas of interest. The method is shown to produce high quality enhancements of membrane-bound protein signals with combined punctate and diffused characteristics. Experimental results demonstrate the benefits of using tunable tensor voting for enhancing and differentiating cell-cell adhesion mediated by integral cell membrane protein.
New low complexity DCT based video compression method
Authors: Tarek Ouni, Walid Ayedi, Mohamed Abid
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Generally, video signal has high temporal redundancies due to the high correlation between successive frames. Actually, this redundancy has not been exploited enough by current video compression technics. In this paper, we present a new video compression approach which tends to hard exploit the pertinent temporal redundancy in the video frames to improve compression efficiency with minimum processing complexity. It consists on a 3D to 2D transformation of the video frames that allows exploring the temporal redundancy of the video using 2D transforms and avoiding the computationally demanding motion compensation step. This transformation turns the spatial-temporal correlation of the video into high spatial correlation. Indeed, this technique transforms each group of pictures to one picture eventually with high spatial correlation. Thus, the decorrelation of the resulting pictures by the DCT makes efficient energy compaction, and therefore produces a high video compression ratio. Many experimental tests had been conducted to prove the method efficiency especially in high bit rate and with slow motion video. The proposed method seems to be well suitable for video surveillance applications and for embedded video compression systems.
Linear combinations of B-splines as generating functions for signal approximation
Authors: Manuel J. C. S. Reis, Paulo J. S. G. Ferreira, Salviano F. S. P. Soares
Venue: Digital Signal Processing (2005)

The advantages of B-splines for signal representation are well known. This paper explores a fact that seems to be less well known, namely, the possibility of using linear combinations of B-splines to obtain representations that are more stable than the usual ones. We give the best possible Riesz bounds for these linear combinations and calculate their duals, in a generalized sampling context.
Improving packet delivery ratio estimation for indoor ad hoc and wireless sensor networks
Authors: Cheng Guo, Jinglong Zhou, Przemysław Pawełczak, Ramin Hekmat
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Many protocols in wireless sensor networks use Packet Delivery Ratio (PDR) as a metric to select the best route, transmission rate or power. PDR is normally estimated either by counting the number of received hello/data messages in a small period of time, i.e., less than 1 second, or by taking the history of PDR into account. The first method is accurate but requires many packets to be sent, which costs too much energy. The second one is energy efficient, but fails to achieve good accuracy. Therefore in this paper we propose a novel estimation method which takes advantage of receiving signal strength. We show with extensive experimental results that the proposed method is 25% more accurate than the second estimation method, while being simple and energy efficient at the same time.
Delay-throughput tradeoff for overlaid wireless networks of different priorities
Authors: Changchuan Yin, Long Gao, Shuguang Cui
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We study the delay-throughput tradeoffs for two coexisting wireless networks that operate in the same geographic region. The primary network consists of Poisson distributed legacy users of density n, and the secondary network consists of Poisson distributed cognitive users of density m, with m > n, The primary users have a higher priority to access the spectrum without particular considerations for the secondary users, while the secondary users have to act conservatively in order to limit the interference to the primary users. With a practical assumption that the secondary users only know the locations of the primary transmitters (not the primary receivers), based on our previous work in [1], we show that both networks can achieve the same delay-throughput tradeoff as the optimal one established by El Gamal et al. [2] for a stand-alone wireless network.
Image guided complex dose delivery for small animal radiotherapy
Authors: Mohammad Matinfar, Santosh Iyer, Eric Ford, John Wong, Peter Kazanzides
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

The purpose of the Small Animal Radiation Research Platform (SARRP) is to demonstrate computed tomography, conformal irradiation, and treatment planning capabilities for small animals. The SARRP is a portable system for precision irradiation with beam sizes down to approximately 0.5 mm and optimally planned radiation with on-board cone-beam CT (CBCT) guidance. This paper describes the utilization of the precision radiation beam on the SARRP for "dose painting" complex structures in the mouse brain. Pencil beam dose painting aims to target the tumor as accurately as possible and give it the highest dose of radiation while sparing normal tissue as much as possible.
Octopus: an application independent DRM toolkit
Authors: Gilles Boccon-Gibod, Julien Boeuf, Jack Lacy
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Digital Rights Management systems originally arose as an example of a solution to one of the most basic problems associated with secure systems design, the problem of governing access by a credentialed entity to a resource in the context of a set of policies established to restrict or define such access. Most DRMs that are in use today are based on DRM-specific declarative rights expression languages and authorization mechanisms that have strong semantic coupling to the application in which they are employed. A notable exception to this approach can be found in the Octopus system described in this paper. Octopus employs several concepts from the trust management philosophy originally posited by Blaze, et al. in 1996, but perhaps its most striking similarity can be found in its clear separation of authorization mechanism from application semantics.
Durability of wireless networks of battery-powered devices
Authors: Maryam Soltan, Massoud Pedram
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Given the criticality of energy awareness in wireless networks, it has become essential to devise an improved definition of the network lifetime at the system design stage. The new definition must capture the life profile of the network while accounting for its functionality and specific design parameters. This paper presents the notion of network durability, which captures the spatiotemporal life/death patterns of devices in a wireless network by examining the time evolution of spatial patterns according to which devices are progressively forced to exit the network having exhausted their energy resource. Using network durability, we show how networks can satisfy different levels of monitoring criticality, even when they exhibit the same conventionally defined lifetime. Finally, as an example application, we consider a heterogeneous location-aware modulation scheme where the proposed durability model is effectively employed to characterize the network lifetime.
On the heat channel and its capacity
Authors: Edwin Hammerich
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The heat channel is defined by an analog filter and a subsequent inaccurate measurement of the filter output signal. The filter is related to the solution of the heat equation and to the heat kernel of the quantum mechanical harmonic oscillator, so the name of the channel. The channel is modeled as an infinite-dimensional vector Gaussian channel and the capacity in terms of average energy of the input signal is derived. The relation to rate distortion theory is investigated by calculating the rate distortion function of a closely connected Gaussian process. Then a second formula for the capacity of the heat channel based on average energy of the measured filter output signal is given. The result is interpreted in context of estimation theory and a parallel to a famous formula connecting mutual information with minimum mean-square error in Gaussian channels is presented.
On the delay of network coding over line networks
Authors: Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

We analyze a simple network where a source and a receiver are connected by a line of erasure channels of different reliabilities. Recent prior work has shown that random linear network coding can achieve the min-cut capacity and therefore the asymptotic rate is determined by the worst link of the line network. In this paper we investigate the delay for transmitting a batch of packets, which is a function of all the erasure probabilities and the number of packets in the batch. We show a monotonicity result on the delay function and derive simple expressions which characterize the expected delay behavior of line networks. Further, we use a martingale bounded differences argument to show that the actual delay is tightly concentrated around its expectation.
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes
Authors: Mitsugu Iwamoto, Hirosuke Yamamoto, Hiroki Koga
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

It is known that a secret sharing scheme (SSS) with perfect cheating detection cannot be realized because such a SSS requires infinite share rates. However, this impossibility comes from the fact that block coding is not used and any decoding error is not allowed in the SSS. Hence, in this paper, we consider a SSS constructed by block coding with an arbitrarily small decoding error probability. It is shown that the perfect cheating detection with finite rates is possible for the 2-out-of-2 SSS in a certain asymptotic sense. Furthermore, the supremum of the achievable exponent in the maximum success probability of impersonation attack turns out to be the mutual information between the two shares.
On the rate-limited Gelfand-Pinsker problem
Authors: Ravi Tandon, Sennur Ulukus
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We study a rate-limited version of the well known problem of coding for channels with random parameters which was studied by Gelfand and Pinsker [1]. In particular, we consider a state-dependent channel when the transmitter is supplied with the state information at a rate Re, We obtain a new upper bound on the capacity, C(Re), for this channel. We explicitly evaluate this upper bound for the rate-limited dirty paper coding (DPC) problem and show that it strictly improves upon the DPC capacity for certain values of Re.
Spatio-temporal deconvolution of perfusion CT data in rectal tumor patients
Authors: L. He, B. B. Orten, S. Do, W. C. Karl, A. Kambadakone, D. V. Sahani, H. Pien
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Anatomical imaging modalities such as MR and CT produce high resolution images that are essential in modern health care. Anatomical imaging, however, can be supplemented with functional imaging to provide additional insights into the status and progression of disease. In perfusion imaging, a bolus of contrast entering a tissue region of interest is carefully monitored in order to derive hemodynamic parameters. While useful, perfusion parameter maps tend to be noisy, in part because the parameters of every voxel are computed independently of its neighboring voxels. A spatio-temporally correlated approach to estimating perfusion parameters has been previously introduced. In this paper, we expand upon this earlier formulation and demonstrate its functionality on a set of rectal tumor patients undergoing CT perfusion (CTp) studies. Our results show that our spatio-temporal deconvolution approach is less noisy than conventional singular value deconvolution approach, and show greater separation between normal and cancerous regions.
On the methodology for the evaluation of unconstrained multicast routing algorithms
Authors: Maciej Stasiak, Maciej Piechowiak, Piotr Zwierzykowski
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Having in mind various implementations of methods for generating network topology [1], [2], [3], there is also a need for a wider mechanism determining receiving nodes in a network by geographical positioning, or one that would be related to link and node parameters. This will allow us to answer the question whether the way receiving nodes are distributed has any influence on the quality of multicast trees constructed by algorithms. The paper proposes methods that arrange group members in packet-switched networks. In the research we discuss the influence of the group arrangement method on the total cost of tree and the average cost of path in a tree for unconstrained routing algorithms for multicast connections. The methods for the receiving nodes distribution in the network have not been hitherto addressed and analyzed in literature.
Toward interoperable publish/subscribe communication between wireless sensor networks and access networks
Authors: Pruet Boonma, Junichi Suzuki
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Traditional wireless sensor networks (WSNs) often do not consider interoperability between WSNs and access networks. To address the issue, this paper investigates interoperable publish/subscribe communication in WSNs. The proposed middleware, called TinyDDS, provides two types of interoperability, programming language interoperability and protocol interoperability, by customizing standard data types, data representation and session protocol. Evaluation results show that TinyDDS simplifies the development of publish/subscribe applications and it is implemented efficient in memory footprint and power consumption.
Automating content update for MHP applications: a practical experience
Authors: R. P. Martínez Álvarez, J. L. Rodríguez-Diez-Caballero, J. M. Pousada-Carballo, S. Costas-Rodríguez, P. S. Rodríguez-Hernández, F. J. González-Castaño, M. J. Fernández-Iglesias
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper focuses on automated content update for MHP applications. Some of the authors have been involved in the first MHP trials of TVG, the TV channel of Galicia, NW Spain (three million population). It has a 30% share at regional level, competing with national channels. However, the initial MHP trials have raised the problem of manual content update cost, since in many key applications, like news and weather forecasts, contents vary on a daily basis. We have reviewed the status of MHP deployment in similar TV channels, and we have determined that the problem is currently relevant. We describe our solutions for automated content update with minimal human intervention, and our practical experience with them.
Code design for quadratic Gaussian multiterminal source coding: the symmetric case
Authors: Yifu Zhang, Yang Yang, Zixiang Xiong
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Whereas the theory and practice of two-terminal quadratic Gaussian multiterminal (MT) source coding is complete, the theory with more than two terminals is only partial, with the sum-rate limit only known in the symmetric case where all sources are positively symmetric and all target distortions equal. This paper proposes the first code design for quadratic Gaussian MT source coding in this symmetric setup. The aim is to approach corner points of the rate region via TCQ for quantization and LDPC codes for Slepian-Wolf compression. We provide high-rate analysis of our code design. Simulations with three and four terminals show a very small sum-rate loss.
An algebraic tool for obtaining conditional non-vanishing determinants
Authors: Camilla Hollanti, Hsiao-Feng Lu, Roope Vehkalahti
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

An algebraic tool from the theory of central simple algebras is proposed to obtain families of complex matrices satisfying the conditional non-vanishing determinant (CNVD) property. Such property is of great use in e.g. the design of multiuser space-time (ST) codes, in which context it is not always crucial for the transmission matrix to be invertible. On the other hand, whenever it is invertible, it is important that it has a nonvanishing determinant. Also any submatrix of any subset of users multiplied with its transpose conjugate should preferably have a non-vanishing determinant, provided it is non-zero. In recent submissions by Lu et al. it has been shown that, with suitable multiplexing, such property yields a construction of space-time codes that achieve the optimal diversity-multiplexing tradeoff (DMT) of the multiple-input multiple-output (MIMO) multiple access channel (MAC) and outperform the previously known ST codes.
Information storage, reduction and dissemination in sensor networks: a survey
Authors: Q. Le-Trung, A. Taherkordi, T. Skeie, H. N. Pham, P. E. Engelstad
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

There is a large body of work addressing information storage, reduction, and dissemination in Wireless Sensor Networks (WSNs), but there seems to be no contribution giving a survey of this literature. In this paper we take on such a challenge and review previous WSN research and further presents a framework that we use for classifying the different proposed approaches and techniques. The framework is structured into 3 tiers: 1) routing and network infrastructure, 2) logical network infrastructure, and 3) information storage and processing. The paper, however, mainly focuses on tier-2 and tier-3. We also discuss future visions and challenges within the WSN community.