ppxscal/embedding_network huggingface dataset:
Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs
Authors: Fu-Kun Chen, Bo-Kai Su, Yue-Dar Jou
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

The algebraic code excited linear prediction (ACELP) algorithm, due to low complexity and high quality in its analysis-by-synthesis (AbS) optimization, has been adopted by many speech coding standards. In this paper, the scalability of computational complexity to the global pulse replacement search method for ACELP is proposed. In addition, the proposed method can achieve the lowest computational complexity with perceptually negligible degradation. Based on the standard subjective and objective quality measurements, the experimental results reflect the facts.
A novel optimistic unchoking algorithm for bittorrent
Authors: Zuhui Ma, Dongyu Qiu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Optimistic unchoking plays an important role in BitTorrent Peer-to-Peer (P2P) file sharing networks. Peers use optimistic unchoking to find upload bandwidth information about their neighbors. However, free-riders can also take advantage of optimistic unchoking and download from the network without uploading anything. In this paper, we propose a novel optimistic unchoking algorithm for BitTorrent. The main purposes of our algorithm are to prevent free-riding and to improve the efficiency of optimistic unchoking. We then propose a stochastic model to analyze the performance of our algorithm. We also verify the results by simulations. Both theoretical and simulation results show that our algorithm can effectively prevent free-riding and significantly improve the download rate of normal peers at the same time.
Rapid P2P overlay network programming on a distributed reduction machine
Authors: Kenji Saito, Kendai Miyazawa
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

To build dependable and sustainable systems requires many iterative trials and stepwise improvements. Rapid programming methods and languages have been studied in the field of peer-to-peer overlay network for this reason. This paper proposes a method for quick programming using Overlay GHC[1] language, an extension of Guarded Horn Clauses[2] for overlay network programming. The method involves a technique called RGP (Remote Goal Placement) instead of RPC over an environment that is viewed as a distributed reduction machine.
Low-complexity near-MAP decoding of large non-orthogonal STBCs using PDA
Authors: Saif K. Mohammed, A. Chockalingam, B. Sundar Rajan
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Non-orthogonal space-time block codes (STBC) from cyclic division algebras (CDA) are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a given number of transmit antennas) as well as full transmit diversity. Decoding of non-orthogonal STBCs with hundreds of dimensions has been a challenge. In this paper, we present a probabilistic data association (PDA) based algorithm for decoding non-orthogonal STBCs with large dimensions. Our simulation results show that the proposed PDA-based algorithm achieves near SISO AWGN uncoded BER as well as near-capacity coded BER (within 5 dB of the theoretical capacity) for large non-orthogonal STBCs from CDA. We study the effect of spatial correlation on the BER, and show that the performance loss due to spatial correlation can be alleviated by providing more receive spatial dimensions. We report good BER performance when a training-based iterative decoding/ channel estimation is used (instead of assuming perfect channel knowledge) in channels with large coherence times. A comparison of the performances of the PDA algorithm and the likelihood ascent search (LAS) algorithm (reported in our recent work) is also presented.
Incentives for P2P file sharing in mobile ad hoc networks
Authors: Afzal Mawji, Hossam Hassanein
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

P2P overlay networks are a natural fit for MANETs because both are decentralized and have dynamic topologies. Most nodes in P2P file sharing networks are freeloaders, nodes that do not contribute to the network. In order to have a useful P2P network, it is important that nodes not only share files but also forward data. In this paper we present Incite, an incentive scheme for P2P file sharing over MANETs in which nodes cooperate with one another based on their reputation and energy levels. Simulation results show that Incite allows more file downloads than typical P2P networks, is fairer, and uses less energy per downloaded byte.
Privacy preserving multiparty multilevel DRM architecture
Authors: Amit Sachan, Sabu Emmanuel, Amitabha Das, Mohan S. Kankanhalli
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Traditional digital rights management (DRM) systems are only two party systems, involving the owner and consumers. However, for scalability of business it is often necessary to involve additional levels of distributors and sub-distributors, who can promote and distribute the content in regions unknown to the owner. Thus, we propose an architecture for multiparty multilevel DRM system. The term 'multiparty' refers to involvement of many parties such as the owner, distributors, sub-distributors and consumers and the term 'multilevel' refers to multiple levels of distributors/sub-distributors. The architecture also supports the log files based violation detection, in case of violation of DRM system by any party. However, violation detection imposes a problem of preserving privacy of consumers. So, in the architecture, a provision is made to preserve their privacy.
Gaussian multiple description coding with individual and central distortion constraints
Authors: Jun Chen
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

The rate region of Gaussian multiple description coding with individual and central distortion constraints is completely characterized. It is shown that each supporting hyperplane of the rate region is associated with a saddle point of a min-max problem.
Optimal illumination patterns for fluorescence tomography
Authors: Joyita Dutta, Sangtae Ahn, Anand A. Joshi, Richard M. Leahy
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Fluorescence tomography has become increasingly popular for detecting molecular targets for imaging gene expression and other cellular processes in vivo in small animal studies. In this imaging modality, multiple sets of data are acquired by illuminating the animal surface with different excitation patterns, each of which produces a distinct spatial pattern of fluorescence. This work addresses one of the most intriguing, yet unsolved, problems of fluorescence tomography, which is to determine how to optimally illuminate the animal surface so as to maximize the information content in the acquired data. The key idea of this work is to parameterize the illumination pattern and to maximize the information content in the data by improving the conditioning of the Fisher information matrix. We formulate our problem as a constrained optimization problem. We compare the performance of different geometric illumination schemes with those generated by this optimization approach using the Digimouse atlas.
On the power consumption of security algorithms employed in wireless networks
Authors: Dimitrios Meintanis, Ioannis Papaefstathiou
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Supporting high levels of security in wireless networks is a challenging issue because of the specific problems this environment poses; the provided security by small mobile systems, such as PDAs and mobile phones, is often restricted by their limited battery power and their limited processing power. Driven by these restrictions, the designer will have to decide whether to implement the wireless network security schemes in software or to add special purpose hardware units to the system, executing those CPU intensive tasks. This paper demonstrates and compares the Hardware and Software implementations of a number of widely used security applications employed in wireless networks. We measured the total energy consumption for each security algorithm when implemented in reconfigurable hardware devices and we compared it with the total energy consumption of the equivalent software applications. We demonstrate, that the hardware implementations on a state-of-the-art FPGA are significantly faster while they consume three orders of magnitude less power when compared with the software implementations executed on a state-of-the-art hard-core CPU which is embedded in the same FPGA device.
Evaluation of policy-based admission control mechanisms in NGN
Authors: Pedro Gonçalves, Ricardo Azevedo, Diogo Gomes, José Luís Oliveira, Rui L. Aguiar
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

The 3GPP consortium proposed in the release 7 of the IP Multimedia Subsystem (IMS) a Diameter interface for the resource admission communication process replacing the previous COPS solution. Although both academic and industry communities have deeply debate the advantages and disadvantages of each protocol, its impact in NGN may have not been thoroughly quantified. This paper compares both protocols in terms of messages exchanged between network entities, and of bandwidth requirements during the admission control process. Based on general network operator environment characteristics, we present several exploitation scenarios where it is analyzed the scalability and adequacy of each protocol.
Optimal transmission scheduling for scalable wireless video broadcast with rateless erasure correction code
Authors: Zhu Li, Ying Li, Mung Chiang, Robert Calderbank, Y. C. Chen
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

With the advances in wireless technology and explosive growth of mobile devices and wireless networks, mobile TV is becoming a popular application. The main technical challenge to wireless video broadcast is to provide the best quality of service possible under the radio resource constraints. In this paper we propose an application layer middleware solution that utilizes the scalability in video coding with rateless erasure correction codes to achieve a balance in the quality of service (QoS) and radio resource efficiency. Simulation results demonstrate the effectiveness of the solution.
Insertion rate and optimization of redundancy of constrained systems with unconstrained positions
Authors: Hiroshi Kamabe
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

It was recently shown that the code rate of a simple coding scheme is better than a previously established maxentropic bound for the Wijngaarden-Immink reversed modulation and error control scheme(W-I coding scheme). This paper analyzes code rates of coding schemes for a given insertion rate of the W-I coding scheme using finite state transition diagrams. A new coding scheme is proposed and a new bound for the code rate of the W-I coding scheme is derived. It is proved that the new bound is better than the maxentropic bound when the insertion rate is 1/2.
An effective batching scheme utilizing the segment interval time for wireless IPTV
Authors: Chi Hyun Cho, Kyung Tae Kim, Hee Yong Youn, Sung Oh Hwang
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The demand on IPTV services has been greatly increasing in the area of wireless communication. For supporting a large number of users with limited resources, the development of effective transmission technology is inevitable. In this paper we propose an efficient batching scheme enhancing the performance of VoD system over wireless IPTV. The proposed approach capitalizes the notion of segment interval time to maximize the channel utilization. Computer simulation shows that the proposed approach allows seamless service with a small number of channels as one or two for practical operational conditions, while the existing batching scheme requires a much larger number of channels. Moreover, the start-up latency is reduced.
Fast encoding and decoding of Gabidulin codes
Authors: Danilo Silva, Frank R. Kschischang
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

Gabidulin codes are the rank-metric analogs of Reed-Solomon codes and have a major role in practical error control for network coding. This paper presents new encoding and decoding algorithms for Gabidulin codes based on low-complexity normal bases. In addition, a new decoding algorithm is proposed based on a transform-domain approach. Together, these represent the fastest known algorithms for encoding and decoding Gabidulin codes.
Pilot-aided channel estimation methods for ICI reduction in mobile OFDM systems
Authors: Shih-Kang Wang, Dah-Chung Chang
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In a time-varying mobile channel, the Doppler effect causes intercarrier interference (ICI) in an OFDM system. Some researches have been found to mitigate the ICI effect in order to improve the system performance. However, ICI reduction algorithms usually require the information of the channel impulse response (CIR) even on each sample. In this paper we study several channel estimation algorithms for CIR estimation, including the frequency-domain and the time-domain approaches. We have shown that the time-domain Kalman filter channel estimator has better performance than others because it can estimate CIR sample by sample Simulation results also show that a proposed ICI mitigation algorithm incorporating the time-domain Kalman channel estimator achieves better BER performances at different mobile speeds.
On the energy benefit of network coding for wireless multiple unicast
Authors: Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We consider energy savings offered by network coding for multiple unicast in wireless networks. For d-dimensional wireless networks we show that the maximum possible benefit is at least 2d/⌊ √d ⌋.
Performance analysis of uncompressed video streaming over IEEE 802.15.3c MAC protocol
Authors: Xizhi An, Seokho Kim, Sangkyoon Nam, Yongsun Kim, Wooyong Lee, KyungSup Kwak
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, we analyze and evaluate the performance of IEEE 802.15.3c MAC standard, especially for high-definition uncompressed video transmission. At first, the improvements of IEEE 802.15.3c MAC, such as aggregation method and block ACK, are discussed. Then the transmission efficiency concerned with superframe size, channel time allocation, ACK policies, and payload size etc. is analyzed. Simulation results show performance of video streaming over MAC under different conditions. Based on these results, we propose some useful suggestions in order to fully exploit the network capacity and perfectly represent such video application.
Distributed threshold selection for aggregate threshold monitoring in sensor networks
Authors: Mohammad S. Talebi, Ahmad Khonsari, Ali Abbasi
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Motivated by applications like sensor, peer to peer, ad hoc networks there has been growing interest in monitoring large scale distributed systems. In these applications typically we wish to monitor a global system condition which is defined as a function of local network elements parameters. In this paper, we study Aggregate Threshold Queries in sensor networks, which are used to detect when an aggregate value of all sensor measurements crosses a predetermined threshold. The major constraint in designing monitoring applications is reducing the amount of communication burden which is the dominant factor of energy drain in wireless sensor networks. In this study, we address the aggregate threshold monitoring problem by proposing a distributed algorithm to set local thresholds on each sensor node so that only those sensors whose measurements crosses their local thresholds commence communication. We adopt the FPTAS optimization formulation of the problem [1] and propose a distributed algorithm as the solution to the problem. Simulation results demonstrate the validity of the proposed distributed algorithm in attaining very close performance as the centralized scheme.
Energy minimization methods for cell motion correction and intracellular analysis in live-cell fluorescence microscopy
Authors: Oleh Dzyubachyk, Wiggert A. Van Cappellen, Jeroen Essers, Wiro Niessen, Erik Meijering
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

The ultimate aim of many live-cell fluorescence microscopy imaging experiments is the quantitative analysis of the spatial structure and temporal behavior of intracellular objects. This requires finding the precise geometrical correspondence between the time frames for each individual cell and performing intracellular segmentation. In a previous paper we have developed a powerful multi-level-set based algorithm for automated cell segmentation and tracking of many cells in timelapse images. In this paper, we propose approaches to exploit the output of this algorithm for the subsequent tasks of cell motion correction and intracellular segmentation. Both tasks are formulated as energy minimization problems and are solved efficiently and effectively by distance-transform and graph-cut based algorithms. The potential of the proposed approaches for intracellular analysis is demonstrated by successful experiments on biological image data showing PCNA-foci and nucleoli in HeLa cells.
Automatically learning cortical folding patterns
Authors: Matthew Toews, D. Louis Collins, Tal Arbel
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

A data-driven technique is presented for automatically learning cortical folding patterns from MR brain images of different subjects. Cortical patterns are represented in terms of generic scale-invariant image features. Learning automatically identifies a set of features that occur with statistical regularity in appearance and geometry from a large set of MR volume renderings, based on a predescribed anatomical region of interest. A filtering technique is presented for distinguishing between valid cortical features and those likely to arise from incorrect correspondences, based on feature geometry. Expert validation of 100 feature instances shows that 77% correctly identify the same underlying cortical structure in different brains despite high inter-subject variability, and filtering improves the ability to identify the most meaningful patterns.
A security framework with strong non-repudiation and privacy in VANETs
Authors: Jaeduck Choi, Souhwan Jung
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper proposes a security framework with strong non-repudiation and privacy using new approach of ID-based cryptosystem in VANETs. To remove the overheads of certificate management in PKI, security frameworks using an ID-based cryptosystem are proposed. These systems, however, cannot guarantee strong non-repudiation and private communication since they suffer from the inherent weakness of an ID-based cryptosystem like the key escrow problem. The key idea of this paper is that the ID of the third-party is used as the verifier of vehicle's ID and self-generated RSA public key instead of using the ID of the peers. Our scheme provides strong nonrepudiation and privacy preservation without the inherent weaknesses of an ID-based cryptosystem in VANETs. Also, the proposed scheme is efficient in terms of signature and verification time for safety-related applications.
Integrating multi-scale blob/curvilinear detector techniques and multilevel sets for automated segmentation of stem cell images
Authors: Huiming Peng, Xiaobo Zhou, Fuhai Li, Xiaofeng Xia, Stephen T. C. Wong
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Studies of differentiation abilities of stem cells have been attracting a lot of attention over the last years. Microscopy can be used to record details of the differentiation process of stem cells under different perturbations and is an important tool for studying stem cell differentiation. Since it is infeasible to quantitatively analyze a huge amount of image data manually, automated image analysis systems are urgently needed. However, the complicated morphological appearances of stem cells are challenging to the existing segmentation methods. Herein, we propose a new, automated scheme for stem cell segmentation. This scheme first uses the multi-scale blob and curvilinear structure detectors to delineate the skeletons of stem cells quickly and then segment out stem cells by refining the skeletons to the cell boundaries using multi-level sets. The initial experimental results indicate the effectiveness of the proposed scheme.
Accelerating MR image reconstruction on GPUs
Authors: Wen-mei W. Hwu, Deepthi Nandakumar, Justin Haldar, Ian C. Atkinson, Brad Sutton, Zhi-Pei Liang, Keith R. Thulborn
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

With the explosive development of advanced image reconstruction algorithms, there is an urgent need for acceleration of these algorithms to facilitate their use in practical applications. This paper describes our experience using graphics processing units (GPUs) for advanced MR image reconstruction from non-Cartesian data. We show that implementation of MR image reconstruction on NVIDIA CUDA-enabled GPUs can significantly accelerate the solution of this type of image reconstruction problem. Given the acceleration afforded by the GPU, we expect our strategy to be applied to other computationally intensive imaging algorithms.
Efficient implementation of the generalized Tunstall code generation algorithm
Authors: Michael B. Baer
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

A method is presented for constructing a Tunstall code that is linear time in the number of output items. This is an improvement on the state of the art for non-Bernoulli sources, including Markov sources, which require a (suboptimal) generalization of Tunstall's algorithm proposed by Savari and analytically examined by Tabus and Rissanen. In general, if n is the total number of output leaves across all Tunstall trees, s is the number of trees (states), and D is the number of leaves of each internal node, then this method takes O((1 + (log s)/D)n) time and O(n) space.
Realizing zones using UPnP
Authors: Amitabh Thapliyal, Prakash S. Bhagavathi, Thenmozhi Arunan, Deepak Dasaratha Rao
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper describes the concept of "Zone" and also the method of realizing a Zone using UPnP. We present the details of how a mobile device can detect that it is in a Zone using RFID based mechanism. In this paper we propose a framework for creating a Zone, discovering Zone and service delivery by leveraging the existing technologies like UPnP and short range wireless radio as a bearer.