ppxscal/embedding_network huggingface dataset:
A caGRID-enabled, learning based image segmentation method for histopathology specimens
Authors: David J. Foran, Lin Yang, Oncel Tuzel, Wenjin Chen, Jun Hu, Tahsin M. Kurc, Renato Ferreira, Joel H. Saltz
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Accurate segmentation of tissue microarrays is a challenging topic because of some of the similarities exhibited by normal tissue and tumor regions. Processing speed is another consideration when dealing with imaged tissue microarrays as each microscopic slide may contain hundreds of digitized tissue discs. In this paper, a fast and accurate image segmentation algorithm is presented. Both a whole disc delineation algorithm and a learning based tumor region segmentation approach which utilizes multiple scale texton histograms are introduced. The algorithm is completely automatic and computationally efficient. The mean pixel-wise segmentation accuracy is about 90%. It requires about 1 second for whole disc (1024×1024 pixels) segmentation and less than 5 seconds for segmenting tumor regions. In order to enable remote access to the algorithm and collaborative studies, an analytical service is implemented using the caGrid infrastructure. This service wraps the algorithm and provides interfaces for remote clients to submit images for analysis and retrieve analysis results.
SLAAP: stream location-aware alliance partitioning in bittorrent networks for video-on-demand systems
Authors: Sean Salmon, Hala ElAarag
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper proposes a solution to the colossal needs of VoD by using a modified version of the popular file-sharing protocol BitTorrent. Our technique uses self-adjusting peer groups, called alliances, to cluster peers together that need similar parts of a video. In doing so, it ensures that peers receive the necessary video segments in a timely manner, and that bandwidth utilization is optimized.
Device-aware discovery and ranking of mobile services
Authors: Eyhab Al-Masri, Qusay H. Mahmoud
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

While several service discovery protocols and standards have been proposed for supporting service discovery from mobile devices, this remains a challenging problem. In many cases, mobile clients may discover services which they consider relevant but soon realize that such services are not completely usable on their mobile devices due to compatibility and interoperability issues. Without integrating device capabilities into the discovery process, or a device-aware mobile service discovery, it becomes extremely difficult to determine whether discovered services may or may not function properly within the device's constraints. This paper introduces a solution to this problem and proposes MobiEureka, a mobile device-aware system for enhancing the discovery of mobile services using mobile devices. This paper presents experimental validation, results, and analysis of the presented ideas.
Interest-based self organization in group-structured P2P networks
Authors: Sardar Kashif Ashraf Khan, Laurissa N. Tokarchuk
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Peer-to-Peer (P2P) Networks are becoming very popular these days. The scattered environment in P2P networks makes it different from the traditional networks. Each member in P2P network can act as a client as well as a server, which is different from its traditional counterpart such as internet, where a central server is required to control the network. Finding resources in P2P systems is a major issue. Extensive search may be needed to resolve queries in the network. In traditional P2P search algorithms such as in Gnutella protocol V0.4 search is via query flooding with significant exploration cost. In this paper, a group-structured P2P network is proposed. The group-based search provides well-organized searching technique by targeting particular group or community. We propose a new protocol for building and repairing of overlay topologies based on the formation of interest-based superpeers. An interest-based superpeer algorithm creates groups or societies that have common interests. Simulations indicate that the proposed protocol is highly capable and powerful even in the dynamic nature of P2P networks, where nodes are continually joining and leaving the network and the protocol supports restoration of the network even after the catastrophic failure of interest-based superpeers.
Distributed sphere decoding
Authors: Charlotte Dumard, Erwin Riegler
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Based on a simple gossip algorithm, which computes the sum of values known by several nodes, we investigate the research challenge of distributed sphere decoding. We provide distributed algorithms to perform both the QR decomposition as well as the tree search. Compared to the case where one declares one node as a centralized unit, this approach is much more robust against node and link failures. This is due to the fact that the target nodes for the gossip algorithm are chosen uniformly at random in each iteration. Numerical simulations show that even for a very small number of iterations the results coincide with the traditional centralized sphere decoder.
Geelix LiveGames: remote playing of video games
Authors: Ole-Ivar Holthe, Ola Mogstad, Leif Arne Rønningen
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Geelix LiveGames is an experimental new approach to playing video games, remotely, over the Internet. Based on the latest in human computer interaction research, hardware accelerated graphics, and streaming video technologies, the proposed system illustrates a new and unique way of playing video games and future distribution of interactive entertainment.
A post nonlinear geometric algorithm for independent component analysis
Authors: Thang Viet Nguyen, Jagdish Chandra Patra, Amitabha Das
Venue: Digital Signal Processing (2005)

Simple linear independent component analysis (ICA) algorithms work efficiently only in linear mixing environments. Whereas, a nonlinear ICA model, which is more complicated, would be more practical for general applications as it can work with both linear and nonlinear mixtures. In this paper, we introduce a novel method for nonlinear ICA problem. The proposed method follows the post nonlinear approach to model the mixtures, and exploits the difference between a linear mixture and a nonlinear one from their nature of distributions in a multidimensional space to develop a separation scheme. The nonlinear mixture is represented by a nonlinear surface while the linear mixture is represented by a plane. A geometric learning algorithm named as post nonlinear geometric ICA (pnGICA) is developed by geometrically transforming the nonlinear surface to a plane, i.e., to a linear mixture. Computer simulations of the algorithm provide promising performance on different data sets.
RP-MAC: a receiver preamble MAC protocol for wireless sensor networks
Authors: Inwhee Joe, Sungmin Jung
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this paper, we propose a novel MAC protocol (RP-MAC) with a receiver preamble for wireless sensor networks. Energy efficiency is the most critical and fundamental factor in wireless sensor networks, because sensor nodes rely on the limited power source. For energy efficiency, the existing MAC protocols such as B-MAC and X-MAC change the active and sleep states periodically with a duty cycle. Even if these protocols work well in the sleep state, transmission overhead due to the preamble is very large when changing to the active state, because the sender transmits a preamble repetitively. In our approach, the receiver transmits instead a preamble only once, thereby minimizing the overhead. With this concept we implement real source code working on the telosb platform with TinyOS 1.1.15 version. The test results show that the proposed protocol provides better performance in terms of energy efficiency and delay compared to X-MAC.
A note on BSD codes constructed from T-codes
Authors: Ulrich Speidel
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

The T-augmentation process is used to construct variable-length T-codes. In a previous paper, the author and T.A. Gulliver showed that it may also be used to construct block codes with bounded synchronization delay (BSD codes) as subsets of T-code codewords of a fixed length. However, only the existence of a bound on the synchronization delay was shown, and an actual bound was left as an open problem. The present paper formulates such an upper bound. The paper also discusses whether some of these subsets may represent maximal comma-free codes.
The throughput-reliability tradeoff in 802.11-based vehicular safety communications
Authors: Zhe Wang, Mahbub Hassan
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

There is a promising development in wireless communications technology which indicates that road accidents could be significantly reduced if vehicles were allowed to communicate with each other. By regularly exchanging their current position, velocity, etc., vehicles could predict an upcoming accident and alert the human drivers in time or proactively take precautionary actions to avoid the accident. The realization of this vision would require the design of wireless channel access schemes that can guarantee a high level of message reliability as well as a minimum throughput for vehicles to communicate frequently enough. In this paper, we propose a Markov chain model to analytically derive the throughput and reliability of the popular 802.11 protocol which has been adopted for vehicular communications. The model reveals the existence of a throughput-reliability tradeoff influenced by the contention window, the parameter which coordinates the access to the underlying wireless channel. By adjusting this window, it is possible to gain an extra level of reliability at the expense of some throughput. Through numerical experiments, we show that, for low to medium vehicular traffic density, it is possible to achieve a very high message reliability by trading off the "excess" throughput not required for vehicular communications. Our study also reveals that, the tradeoff capability of 802.11 diminishes with increasing traffic density. For extremely dense traffic, it may not be possible to meet the requirements of vehicular safety communications by simply adjusting the 802.11 parameters.
A new approach for achieving traffic-exchange localization in P2P-based content distribution
Authors: Chaojiong Wang, Ning Wang, Michael Howarth
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

Due to the fact that P2P applications have dominantly accounted for the entire Internet traffic, how to efficiently manage P2P traffic has become increasingly important. It has been recently proposed that the underlying network information can be shared between ISPs and P2P service providers in order to achieve efficient resource utilization, with the locality-based peer selection being a specific example. Based on such collaboration, we propose a proportional traffic-exchange localization scheme for making efficient use of network resources. Our approach employs locality Information in order to regulate the volume of traffic exchange between peers according to their physical distance between peers. The key objective of our approach is to further reduce both intra- and interautonomous system (AS) traffic compared with basic locaIity-based peer selection solutions. Our simulation-based results have shown that this approach is not only able to reduce a significant of inter-AS P2P traffic, but also to balance the network utilization in comparison to existing approaches.
Robust graph-based tracking through crossing fibre configurations
Authors: Stamatios N. Sotiropoulos, Christopher R. Tench, Paul S. Morgan, Li Bai
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Graph-based distributed tractography of the brain provides an alternative to streamline approaches. However, graph-based tracking through complex fibre configurations has not been extensively studied and existing methods have inherent limitations. In the study, we discuss these limitations and present a new approach for robustly propogating through fibre crossings, as these are depicted by the Q-ball orientation distribution fuctions (ODFs). Complex ODFs are decomposed to components representative of single-fibre populations and an appropriate image graph is created. Path strengths are calculated using a modified version of Dijkstra's shortest path algorithm. A comparison with existing methods is performed on simulated and on human Q-ball imaging data.
Correlated sources over broadcast channels
Authors: Paolo Minero, Young-an Kim
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

An alternative characterization is given for the coding theorem by Han and Costa, which finds a set of admissible source pairs that can be transmitted reliably over the broadcast channel. The associated coding technique is conceptually simpler and the resulting admissible source region can be shown to include the Gray-Wyner distributed source coding region in a straightforward manner. Incidentally, this new characterization illustrates how the common part between the two random sources does not play any role in broadcasting correlated sources, unlike transmission of correlated sources over the multiple access channel.
An efficient method for the exact computation of Legendre moments of binary images
Authors: Zhifang Dong, Hui Zhang, Huazhong Shu
Venue: Proceedings of the 16th international conference on Digital Signal Processing (2009)

Legendre moments have been widely used as feature descriptors in image analysis. This paper presents a new approach for the exact computation of Legendre moments of binary images. Using a Green's formula, the double integral is first transformed into a simple integration along the boundary which is represented by a polygon. We then propose an efficient method for computing the line moments. Comparison with some known algorithms shows that the proposed algorithm is more accurate, and is independent of the slope, so that it is stable in numerical computation.
Enumerative maximum-transition-run codes
Authors: Thomas Mittelholzer
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

A new class of maximum-transition-run (MTR) block codes is presented which is based on a novel enumerative encoding scheme to construct codes with predetermined j and k constraints. These MTR codes are a generalization of Fibonacci codes, and they share a similar optimality property: For a given length N, they contain the maximum number of length-N codewords satisfying the (j, k) constraint. Furthermore, by using a slight modification of the code construction, one obtains practical high-rate modulation codes with limited error propagation.
Cooperation above the physical layer: the case of a simple network
Authors: Beiyu Rong, Anthony Ephremides
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In this paper, we investigate the effects of "network-level" cooperation in a wireless three-node network with packet erasure links. Cooperation is achieved through the relaying of packets from the node farthest away from the destination by the intermediate node. We consider both scheduled access and random access, and compare the performance metrics of "stability region" and "throughput region". We observe that the throughput region depends on the priority choices at the relay node, and mayor may not be equal to the stability region, which is shown to be independent of the priority choices. By contrast, in the non-cooperative random access system, the stability region and the throughput region are proved to be identical. Furthermore, if we apply network coding at the relay node, there is no improvement either in the stability region or in the throughput region over plain store-and-forward routing.
Dermoscopic interest point detector and descriptor
Authors: Howard Zhou, Mei Chen, James M. Rehg
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Dermoscopy is an imaging technique dermatologists use to better visualize pigmented skin lesions (PSLs) and determine their malignancy. Dermoscopic features revealed by this technique have been shown to correlate with histopathology features, and are used as diagnosis indicators by many dermatologists. Hence, automated detection and classification of these features is the first step toward computer-aided diagnosis of melanoma in dermoscopy. In this paper, we present a novel scale- and rotation-invariant feature detector and descriptor specifically designed as a general visual vocabulary of dermoscopic features. We compare our feature detector and descriptor to the popular interest point detectors in the vision community, namely, SIFT, and a more recent fast variant, SURF. We demonstrate that our feature detector is more discriminative and reliable for dermoscopic features.
Performance analysis of STBC MB-OFDM UWB
Authors: Qinghai Yang, Kyung Sup Kwak, Fenglin Fu
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper addresses the performance analysis for orthogonal space-time block coded (STBC) multiband orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) systems. As the channel model considers the log-normal fading, the resultant signal to noise ratio (SNR) will be the product of a log-normal distributed variable and a variable of sum of several Gamma-distributed variants. Based on this, the exact expressions for the bit error probability and the outage probability are derived theoretically. And their approximate expressions can be obtained via the Gauss-Hermite and the Gauss-Laguerre quadratures, respectively. Simulation results verify the theoretical solutions.
On the delay limited secrecy capacity of fading channels
Authors: Karim Khalil, Moustafa Youssef, O. Ozan Koyluoglu, Hesham El Gamal
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.
Experimental study of broadcatching in BitTorrent
Authors: Zengbin Zhang, Yuan Lin, Yang Chen, Yongqiang Xiong, Jacky Shen, Hongqiang Liu, Beixing Deng, Xing Li
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Broadcatching is a promising mechanism to improve the experience of BitTorrent users by automatically downloading files advertised through RSS feeds. However, though widely used, the mechanism itself has not been well studied. In this paper, we conducted extensive experiments on PlanetLab to evaluate the performance of Broadcatching under different typical scenarios. The results demonstrated the effectiveness of the Broadcatching: it reduces the average completion time and downloading failure ratio. It also improves the overall fairness of the system: the subscribers are encouraged to share more while downloading faster, which results in the increased share ratio. Our study is the first work to systematically evaluate the benefit of Broadcatching and sheds lights on how to improve performance of BitTorrrent by manipulating peer's behavior like Broadcatching.
On the performance evaluation of spectrum sharing algorithms between two UMTS operators
Authors: Gbenga Salami, Rahim Tafazolli
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

This paper proposes two new algorithms that address spectrum sharing between two Universal Mobile Telecommunication System (UMTS) operators on a pool and non-pooled basis in the UMTS extension band (2500MHz-2690MHz). The proposed pool based algorithm exploits the de-correlation in the traffic pattern based on the expected call requests. The non-pool based algorithm takes advantage of the opportunities avallable on the primary system during capacity limited situations on the secondary system. The simulated performance of the two Dynamic Spectrum Allocation (DSA) algorithms under peak hour loading shows improvement of 4.5% and 11% respectively over Fixed Spectrum Allocation (FSA). It is shown in the pool based algorithm that the DSA gain increases, as the traffic correlation coefficient between the two operators decrease. The results also show that the call setup delay associated with scheme depends on whether the operators share the Radio Network Controller (RNC).
On an information theoretic approach to model anonymous MANET communications
Authors: Dijiang Huang
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Measuring communication anonymity (e.g., unlink-ability) of anonymous communication systems is a critical, however, unsolved problem. To address this issue, we present an information theoretic model for unlinkability measure for MANETs. Our approach is based on evidence theory, where the basic measuring component is a "set". We present a traffic slicing method to model mobility followed by theoretical models to evaluate sender and receiver unlinkability, path unlinkability and system unlinkability.
Minimum overlapping layers and its variant for prolonging network lifetime in PMRC-based wireless sensor networks
Authors: Qiaoqin Li, Mei Yang, Hongyan Wang, Yingtao Jiang, Jiazhi Zeng
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

The Overlapping Layers (OL) scheme proposed in our previous work provides a solution to balance the load of cluster heads at different layers in the PMRC-based wireless sensor networks. However, in the OL scheme, the layer boundary and the overlap range are static through the network lifetime. The network lifetime is still limited by some nodes which have only one candidate cluster head. To overcome this limitation, in this paper, we propose the Minimum Overlapping Layers (MOL) scheme with gradually changed layer boundary through network lifetime and its variant, the MOL with Initial Overlap (MOLIO) scheme. The simulation results of the OL, MOL, and MOLIO schemes show that the MOL scheme significantly prolongs the network lifetime than the OL scheme for most transmission ranges and the MOLIO scheme achieves better results than the MOL scheme at larger transmission ranges.