ppxscal/embedding_network huggingface dataset:
Evolutionary genetic algorithm for efficient clustering of wireless sensor networks
Authors: Hyun-Sik Seo, Se-Jin Oh, Chae-Woo Lee
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Sensor nodes forming a sensor network usually have limited energy capacity so it is important to minimize sensor nodes' energy consumption because of difficulty in supplying additional energy for the sensor nodes. Much attention has been given to the clustering technique as an efficient way of reducing the energy consumption of a sensor node. Energy saving results can vary greatly depending on the number and size of clusters and the distance among the sensor nodes. In this paper, we aim to find an optimal cluster formation by applying a genetic algorithm in which the chromosome contains the information about the relative position of the nodes. The Location-aware two-dimensional GA (LA2D-GA) proposed in this paper can performs more efficient gene evolution than one-dimensional GA (1D-GA) by giving unique location information to each node. The effectiveness of our algorithm is shown by simulation.
A novel link quality assessment method for mobile multi-rate multi-hop wireless networks
Authors: Jinglong Zhou, Martin Jacobsson, Ertan Onur, Ignas Niemegeers
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Accurate and fast wireless link quality assessment (LQA) for wireless channels would bring huge benefits for mobile multi-hop and multi-rate wireless ad hoc and sensor networks in the form of improved end-to-end performance. In this paper, we propose a novel LQA method based on cross-layer information. The method is implemented in a real test-bed, which is based on IEEE 802.11b/g, and achieved a significant LQA improvement up to 50% in mobile scenarios without introducing overhead. The effectiveness of accurate and fast LQA is demonstrated by feeding it into the routing layer to enable the route decisions to adapt faster during changing situations, especially in mobile scenarios. The experiment results show that the proposed LQA method can lead to faster and smarter routing decisions and higher end-to-end throughput compared to traditional methods, which only use hello packets to determine the link quality in mobile scenario.
Object recognition in the ovary: quantification of oocytes from microscopic images
Authors: Angelos Skodras, Stamatia Giannarou, Mark Fenwick, Stephen Franks, Jaroslav Stark, Kate Hardy
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

The ovary is a female organ that houses a fixed supply of germ cells (oocytes). The absolute number of oocytes at any given stage can be a useful indicator of fertility. Obtaining accurate assessments of the oocyte reserve in humans and experimental models can be time consuming and error prone. In this paper a new approach to facilitate oocyte counting in microscope images of mouse ovaries is presented. The mouse vasa homolog (MVH), an oocyte-specific protein, was labeled in microscope sections and used to develop an algorithm that can identify, count and estimate the size and coordinates of the oocytes. We use this automated approach to generate comparable data with conventional methods of oocyte counting.
Wiretap channel type II with an active eavesdropper
Authors: Vaneet Aggarwal, Lifeng Lai, A. Robert Calderbank, H. Vincent Poor
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

The wiretap channel type II with an active eavesdropper is considered in this paper. Compared with the eavesdropper model considered in much of the literature, the eavesdropper considered here can not only overhear but also modify the signal transmitted over the channel. Two modification models are considered. In the first model, the eavesdropper erases the bits it observes. In the second model, the eavesdropper modifies the bits it observes. For this channel with memory (introduced by the activity of the eavesdropper), one should conduct the worst case scenario analysis. Novel concatenated coding schemes that provide perfect security for the communications are developed for both models to give bounds on the achievable secrecy rate. The technique to modify the inner code to maintain the secrecy properties of the outer code may be of independent interest.
A practical sparse channel estimation for current OFDM standards
Authors: Mahdi Soltanolkotabi, Mojtaba Soltanalian, Arash Amini, Farokh Marvasti
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Wireless channels especially for OFDM transmissions can be precisely approximated by a time varying filter with sparse taps (in the time domain). Sparsity of the channel is a criterion which can highly improve the channel estimation task in mobile applications. In sparse signal processing, many efficient algorithms have been developed for finding the sparsest solution to linear equations (Basis Pursuit, Matching Pursuit) in the presence of noise. In current OFDM standards, a number of the ending subcarriers at both positive and negative frequencies are left unoccupied (for ease of analog filtering at the receiver) which results in an ill-conditioned frequency to time transformation matrix. This means that the initial estimate for the impulse response of the channel (in time) easily varies as the noise vector changes. Thus in this case we cannot use most of the proposed algorithms in sparse signal processing. In this paper, we propose iteration with adaptive thresholding and MMSE methods to overcome this difficulty. Simulation results indicate that the proposed method is almost perfect for stationary channels and only minor performance degradation is observed with increase of Doppler frequency.
Analysis of LDPC decoding schedules
Authors: Eran Sharon, Noam Presman, Simon Litsyn
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Schedule is the order of passing messages between vertices of the bipartite graph defining an LDPC code during decoding. Schedules may significantly differ in the rate of decoding convergence. New efficient generalized serial schedules are described and analyzed. They provide significant convergence rate speedup factors compared to previously known schedules. For the proposed schedules, combinatorial and probabilistic analysis is presented, explaining the fast convergence observed in simulations. Using it, LDPC ensembles for which significantly better convergence rates can be obtained are identified.
Feature extraction from cancer images using local phase congruency: a reliable source of image descriptors
Authors: Tünde Szilágyi, Sir Michael Brady
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

The (semi-) automatic detection of significant (feature) points is a key task in in vivo assessment of cancer staging and progression. However, this is a challenging task due to the relatively poor signal-to-noise, limited resolution and variable intensity of medical images. We propose to use phase congruence (PC), the Morrone and Owens (1987) feature model, to extract local descriptors. We overcome the limitations of the currently accepted PC measure, estimate PC without using an image energy weighting factor. We show that: (i) relative phase values from a single scale are not equivalent to phase values from PC, and should not be used to assess local image structure; and (ii) our approach results in higher specificity to features of interest, and lower sensitivity to noise, as demonstrated in in vitro microscopy (e.g. tumour microvessels) and in vivo pre-clinical pancreatic cancer images.
Navigation using environmental constraints
Authors: Yiming Ji
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Location and mobility management are critical issues for the growing worldwide market in location based services (LBS). Existing research generally requires either special hardware to measure time (thus the distance) and angle or manually constructing database maps using one or a combination of techniques such as lateration, triangulation, database mapping or dead reckoning. In contrast, pathways that uniquely exploit sharing spaces among collaborating objects for the purpose of navigation are far less studied. This paper first analyzes the FreeMobility, a simpler but effective location determination technique, that exploits wireless communications abilities under a broad environmental context; then detailed comparison with database mapping based methods is conducted using measurement data from both GSM and Wi-Fi networks. Results indicate that the adoption of environmental constraints will transform wireless localization research from straightforward hardware dominated approaches to a more independent system approach and thus it opens a new window of opportunity valuable to the research community.
A sparsity detection framework for on-off random access channels
Authors: Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

This paper considers a simple on-off random multiple access channel (MAC), where n users communicate simultaneously to a single receiver. Each user is assigned a single codeword which it transmits with some probability λ over m degrees of freedom. The receiver must detect which users transmitted. We show that detection for this random MAC is mathematically equivalent to a standard sparsity detection problem. Using new results in sparse estimation we are able to estimate the capacity of these channels and compare the achieved performance of various detection algorithms. The analysis provides insight into the roles of power control and multi-user detection.
Coding improves the throughput-delay trade-off in mobile wireless networks
Authors: Zhenning Kong, Edmund M. Yeh, Emina Soljanin
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We study the throughput-delay performance trade-off in large-scale wireless ad hoc networks. It has been shown that the per source-destination pair throughput can be improved from Θ(1/√n log n) to Θ(1) if nodes are allowed to move and a 2-hop relay scheme is employed. The price paid for such an improvement on throughput is large delay. Indeed, the delay scaling of the 2-hop relay scheme is Θ(n log n) under the random walk mobility model. In this paper, we employ coding techniques to improve the throughput-delay trade-off for mobile wireless networks. For the random walk mobility model, we improve the delay from Θ(n log n) to Θ(n) by employing Reed-Solomon (RS) codes. Our approach maintains the diversity gained by mobility while decreasing the delay.
AOI-cast strategies for P2P massively multiplayer online games
Authors: Luca Genovali, Laura Ricci
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper presents a P2P support for Massively Multiplayer On line Games. The P2P overlay is defined by considering a Voronoi diagram where the sites correspond to the peers and a link connects Voronoi neigbours. An AOI-cast mechanism is defined to notify events generated by a peer to peers located in its Area of Interest. A routing algorithm exploiting the properties of the Voronoi graph has been defined as well. AOI-cast has been evaluated through a set of simulations developed by Peersim.
Distributed lossy averaging
Authors: Han-I Su, Abbas El Gamal
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

An information theoretic formulation of distributed averaging is presented. We assume a network with m nodes each observing an i.i.d, source; the nodes communicate and perform local processing with the goal of computing the average of the sources to within a prescribed mean squared error distortion. The network rate distortion function R* (D) for a 2-node network with correlated Gaussian sources is established. A general cutset lower bound on R* (D) with independent Gaussian sources is established and shown to be achievable to within a factor of 2 via a centralized protocol. A lower bound on the network rate distortion function for distributed weighted-sum protocols that is larger than the cutset bound by a factor of log m is established. An upper bound on the expected network rate distortion function for gossip-based weighted-sum protocols that is only a factor of log log m larger than this lower bound is established. The results suggest that using distributed protocols results in a factor of log m increase in communication relative to centralized protocols.
No-reference video quality measurement using neural networks
Authors: Jihwan Choe, Kwon Lee, Chulhee Lee
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

Objective video quality measurements emerge as an important issue as multimedia data is increasingly transmitted over the channels where bandwidth may not be guaranteed. Among various objective models for video quality measurement, no-reference models have the largest application areas. In this paper, we propose a no-reference video quality assessment method for H.264 using artificial neural networks. Various features are extracted from H.264 bit-stream data and these features are inputted to a neural network. The neural network is trained to predict subjective video quality scores obtained by a number of evaluators. Experimental results show promising results, though a larger database would be required to train neural networks to provide robust performance.
Evolving the TV experience
Authors: Simon J. Gibbs, Anugeetha Kunjithapatham, Phuong Nguyen, Priyang Rathod, Mithun Sheshagiri
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

As television content moves online, we need to reexamine the television user experience. This paper presents "Smart Channels", a new approach to navigating and sharing television content. Smart channels provide a simple and familiar TV experience for video content on the Internet. This paper describes how smart channels are constructed and their use in a prototype system.
Impact of heterogeneous packet sizes on flow fairness
Authors: Jari Nieminen, Jouni Karvo, Pasi Lassila, Markus Peuhkuri
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

We analyze the fairness of bandwidth sharing between competing flows when the flows use different packet sizes. For systems where router buffers are defined in packets, we notice that larger packets get preferential treatment. Specifically, in networks, where a higher capacity link is followed by a lower capacity link, packet loss seen by streams with bigger packet size is smaller. We verify our findings by simulating both UDP and TCP traffic in ns2.
Accelerating regularized iterative CT reconstruction on commodity graphics hardware (GPU)
Authors: Wei Xu, Klaus Mueller
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Iterative reconstruction algorithms augmented with regularization can produce high-quality reconstructions from few views and even in the presence of significant noise. In this paper we focus on the particularities associated with the GPU acceleration of these. First, we introduce the idea of using exhaustive benchmark tests to determine the optimal settings of various parameters in iterative algorithm, here OS-SIRT, which proofs decisive for obtaining optimal GPU performance. Then we introduce bilateral filtering as a viable and cost-effective means for regularization, and we show that GPU-acceleration reduces its overhead to very moderate levels.
Polar codes: characterization of exponent, bounds, and constructions
Authors: Satish Babu Korada, Eren Sasoǧlu, Rüdiger Urbanke
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Polar codes were recently introduced by Arikan. They achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. The original polar code construction is closely related to the recursive construction of Reed-Muller codes and is based on the 2 × 2 matrix [1 0 1 1]. It was shown by Arikan and Telatar that this construction achieves an error exponent of 1/2, i.e., that for sufficiently large blocklengths the error probability decays exponentially in the square root of the length. It was already mentioned by Arikan that in principle larger matrices can be used to construct polar codes. A fundamental question then is to see whether there exist matrices with exponent exceeding 1/2. We characterize the exponent of a given square matrix and derive upper and lower bounds on achievable exponents. Using these bounds we show that there are no matrices of size less than 15 with exponents exceeding 1/2. Further, we give a general construction based on BCH codes which for large matrix sizes achieves exponents arbitrarily close to 1 and which exceeds 1/2 for size 16.
Using energy-efficient wireless sensor network for cold chain monitoring
Authors: Rahim Kacimi, Riadh Dhaou, André-Luc Beylot
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Temperature control is a major concern in cold chain monitoring and traceability services for the largest cause of food poisoning. Considerable work has examined the use of wireless solutions in warehouses. However, the maintaining of the chain during the transportation phase remains very crucial. In this paper, we present new wireless sensor network (WSN) solution for cold chain monitoring. This solution is based on self-organizing protocols and aims at saving energy in order to increase the sensor lifetime and as a result the global network longevity within the given context. Furthermore, this solution does not need any base station or central equipment. To save energy, periodical active/sleep schedule is adopted in the design of our protocols which were dimensioned and validated by an analytical model described in this paper.
Rank q-cyclic and pseudo-q-cyclic codes
Authors: Ernst M. Gabidulin
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

In the theory of codes based on Hamming metric, three classes of codes are well known: cyclic codes, shortened cyclic codes and pseudo-cyclic codes. An important result is that the class of linear shortened cyclic codes coincides with the class of linear pseudo-cyclic codes [1]. No similar results are known in the theory of rank-metric based codes. In this paper, we generalize the notion of q-cyclic codes and introduce two new families of codes, namely, shortened q-cyclic codes and pseudo-q-cyclic codes. It is proved that the class of pseudo-q-cyclic codes coincides with the class of shortened q-cyclic codes if the number of positions to shorten is a multiple of the extension degree. The problem is still open for other shortening.
Truncated pyramid peer-to-peer architecture with vertical tunneling model
Authors: Zhonghong Ou, Jiehan Zhou, Erkki Harjula, Mika Ylianttila
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Peer-to-Peer (P2P) technologies have many advantages over traditional client/server technologies, including cost-effectiveness, scalability and robustness, due to their decentralized network structure. However, the performance has traditionally been an issue in P2P systems. Especially the higher lookup latencies, when compared with the traditional client/server systems, have been the bottleneck in many P2P systems. In this paper, we propose a truncated pyramid P2P architecture together with an enhanced model, Vertical Tunneling Model (VTM) for improving the lookup performance. The proposed architecture is built on Peer-to-Peer SIP (P2PSIP) network. VTM builds up vertical tunnels between the upper and lower sub-overlays to speed up the service lookup and decrease the session setup delay. Based on the performance analysis and results, it is shown that VTM has better performance compared with the existing systems in average lookup hops, which is about 1/3 of that of the existing systems, the predominance is more evident as the network scale increases.
Poisson inverse gradient approach to vascular myocyte detection and segmentation
Authors: Scott T. Acton, Clare Yang, John A. Hossack, Brian R. Wamhoff
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

This paper addresses the detection and segmentation of vascular myocytes. The detection and segmentation of these cells are critical to the investigation of atherosclerosis among other cardiovascular diseases. Our approach to detection is unique in that it attempts to compute the underlying external energy in an active contour model. Isolines in this computed external energy can be employed to localize boundaries of the cell nuclei. The process used to solve the inverse problem of obtaining the energy from the force vectors is called Poisson inverse gradient due to the Poisson-based solution. From the initial contours given by the isolines in the computed energy, parametric active contours are used to find the subtle cell boundaries. The results indicate that the Poisson inverse gradient improves detection accuracy and reduces false positives compared to existing morphological methods. Furthermore, the contourbased detection allows segmentation of the cell boundaries.
Ultrastructural mapping of neural circuitry: a computational framework
Authors: J. R. Anderson, B. W. Jones, J.-H. Yang, M. V. Shaw, C. B. Watt, P. Koshevoy, J. Spaltenstein, E. Jurrus, U. V. Kannan, R. Whitaker, D. Mastronarde, T. Tasdizen, R. E. Marc, B. W. Jones
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Complete mapping of neuronal networks requires data acquisition at synaptic resolution with canonical coverage of tissues and robust neuronal classification. Transmission electron microscopy (TEM) remains the optimal tool for network mapping. However, capturing high resolution, large, serial section TEM (ssTEM) image volumes is complicated by the need to precisely mosaic distorted image tiles and subsequently register distorted mosaics. Moreover, most cell or tissue class markers are not optimized for TEM imaging. We present a complete framework for neuronal reconstruction at ultrastructural resolution, allowing the elucidation of complete neuronal circuits. This workflow combines TEM-compliant small molecule profiling with automated image tile mosaicking, automated slice-to-slice image registration and terabyte-scale image browsing for volume annotation. Networks that previously would require decades of assembly can now be completed in months, enabling large-scale connectivity analyses of both new and legacy data. Additionally, these approaches can be extended to other tissue or biological network systems.
Capacity analysis of two-user opportunistic scheduling for wireless network coding
Authors: Poramate Tarasak, Ubolthip Sethakaset, Sumei Sun
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

This paper provides an analytical formulation of average capacity and outage capacity for two-user opportunistic scheduling for wireless network coding (OWNC). It is shown that our derived capacity formulas can be easily evaluated without numerical integration and match exactly with the simulation results. At high SNR, it is shown that the average capacity of OWNC is double of logarithm (base 2) of average SNR subtracted by a loss term composed of the 'scheduling loss' and 'concavity loss' factors.