ppxscal/embedding_network huggingface dataset:
SmartSearch: situation-aware web search on mobile devices
Authors: Henry Song, Swaroop Kalasapur, Sangoh Jeong, Doreen Cheng
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

To provide consumers with the right information at the time of need, we developed a SmartSearch application that is able to extract a user's situational interests from usage data. It automatically constructs search queries based on situational interests. We extract the situational interests automatically without prior training and user involvement. In addition, SmartSearch is a client-side solution running completely on a mobile device to protect user's privacy.
An active surface model for volumetric image segmentation
Authors: Noha El-Zehiry, Adel Elmaghraby
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

In this paper, we introduce a graph cut based active surface model that incorporates graph cuts optimization tools with implicit surface representation to solve the segmentation problem. We will introduce a discrete formulation of the surface evolution problem, prove that the discrete energy function is graph representable and propose how to optimize it using graph cuts. The advantage of this model is two fold: First, Graph cuts are mostly global optimization tools which makes the model very robust and not sensitive to initialization, moreover, the dynamic labeling associated with graph cuts optimization tools makes the model very fast. Second, the implicit representation of the surface makes it robust to topology changes.
System architecture design considerations for distributed WiMedia MAC protocol
Authors: Gopa Sen, Peng Xiaoming, Qu Xuhong, Tan Kian Seng
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Embedded wireless communication devices are getting more and more complex with its requirements to meet higher speed, lower power consumption and enhanced functionality. In order to shorten the time to market and achieve flexibility of design for future upgrade, a hardware/firmware co-design approach is been adopted often. In this paper, we discuss some of the system architectural design considerations based on this approach to realize the full potential of the distributed WiMedia MAC protocol. To achieve optimal partition of hardware and firmware the best balance of critical timing blocks, complexity of implementation and flexibility of function upgrade are being considered. The protocol requirements and various other factors also influence the hardware architectural design decisions. Application of these concepts in the context of our realizing the full MAC protocol on an embedded platform with ease of portability to ASIC, has been discussed in this paper.
SIP method escalation algorithm for NGN application network interface
Authors: Kiyoshi Ueda, Hitoshi Shimizu, Tetsuya Iwata, Hiroshi Sunaga, Akira Fukuda
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

The Next-Generation Network (NGN) has Application Network Interfaces (ANIs) by which 3rd party application services are easily created. For session-control ANI (for example, "makeCallSession" of the Parlay-X), Application Server (AS) functions process a call using three SIP methods (REFER method, 3rd Party Call Control (3PCC) method, Media Bridge method). We propose a SIP method escalation algorithm where each escalation level corresponds to the SIP protocol capabilities a terminal has. We evaluate the proposed algorithm front the viewpoints of resource consumption and session connecting delay, and performed research on issues regarding commercial use. The results are expected to contribute to the future Service Delivery Platform (SDP) or Proactive network Provider Participation for P2P (P4P).
Peer-to-peer voice communication for massively multiplayer online games
Authors: Tonio Triebel, Benjamin Guthier, Thomas Plotkowiak, Wolfgang Effelsberg
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

We present an approach for integrating voice communication into massively multiplayer online games (MMOG). The currently available third-party software solutions involve additional fees and are not connected to the game logic. Other approaches use the game servers directly for mixing and transmitting speech. Doing so allows for a tight coupling of speech and in-game events but consumes large amounts of bandwidth and computational power on the servers. Our novel idea is a mix between server-based signaling and peer-to-peer data transmission. While the entire game context resides on the server, audio streams are transmitted in a peer-to-peer fashion and processed at the peer nodes only. This technique splits up the workload among all machines while still allowing to relate speech processing to game events. We further improve the processing performance on the clients by using SOUND, a novel technique for distance based resampling.
Is physical layer error correction sufficient for video multicast over IEEE 802.11g networks?
Authors: Özgü Alay, Thanasis Korakis, Yao Wang, Shivendra Panwar
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Wireless video multicast enables delivery of popular events to many mobile users in a bandwidth efficient manner. However, providing good and stable video quality to a large number of users with varying channel conditions remains elusive. A promising solution to this problem is the use of packet level Forward Error Correction (FEC) mechanisms. However, the adjustment of the FEC rate is not a trivial issue due to the dynamic wireless environment. This decision becomes more complicated if we consider the multi-rate capability of the existing wireless LAN technology that adjusts the transmission rates based on the channel conditions and the coverage range. In this paper, we explore the dynamics of Forward Error Correction (FEC) schemes in multi-rate wireless local area networks. We study the fundamental behavior of a 802.11g network which already has embedded error correction in physical layer, under unicast and broadcast modes in a real outdoor environment. We then explore the effectiveness of packet level FEC over wireless networks with multi-rate capability. In order to evaluate the system quantitatively, we implemented a prototype using open source drivers, and ran experiments. Based on the experimental results, we provide guidelines on how to efficiently use FEC for wireless multicast services in order to improve the overall system performance. We argue that even there is a physical layer error correction, using a higher transmission rate together with stronger FEC is more efficient than using a lower transmission rate with weaker FEC for multicast.
Indirect camera calibration for surgery tracking
Authors: Bennet Tillapaugh, Andreas Savakis
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Embedding cameras in surgical lights allows full view of surgery for tracking and storage purposes. However, it presents the challenge of camera calibration, as camera lights frequently change position. In this paper, we propose a novel indirect calibration method that utilizes static ceiling cameras that detect the position of light cameras and calibrate their extrinsic parameters every time there is significant movement. In our experimental setup, indirect calibration was able to locate light cameras with an average error of 4.81 mm of the position found by standard camera calibration methods and offers the added advantage of avoiding interference with the surgeons.
Comparative performance evaluation of routing algorithms in IEEE 802.11 ad hoc networks
Authors: Evangelos Chatzistavros, Georgios Stamatelos
Venue: Proceedings of the 16th international conference on Telecommunications (2009)

In this paper we examine the behavior of Ad Hoc networks through simulations, using different routing protocols and various topologies. We examine the difference in performance, using a CBR application, with packets of different size through a variety of topologies, showing that the way nodes are place in a network has an impact in networks performance. We show that the choice of routing protocol plays an important role on network's performance. We also quantify node mobility effects, by looking into both static and fully mobile configurations. Our paper presents a systematic analysis of a variety of different ad hoc network topologies in terms of node placement, node mobility and routing protocols through several simulated scenarios.
Feedback communication over individual channels
Authors: Yuval Lomnitz, Meir Feder
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

We consider the problem of communicating over a channel for which no mathematical model is specified. We present achievable rates as a function of the channel input and output sequences known a-posteriori for discrete and continuous channels. Furthermore we present a rate-adaptive scheme employing feedback which achieves these rates asymptotically without prior knowledge of the channel behavior.
Delay minimization in multiple access channels
Authors: Jing Yang, Sennur Ulukus
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4 (2009)

We investigate a delay minimization problem in a multiple access wireless communication system. We consider a discrete-time non-fading additive white Gaussian noise (AWGN) multiple access channel. In each slot, bits arrive at the transmitters randomly according to some distribution, which is i.i.d. from user to user and from slot to slot. Each transmitter has an average power constraint of P. Our goal is to allocate rates to users, from the multiple access capacity region, based on their current queue lengths, in order to minimize the average delay of the system. We formulate the problem as a Markov decision problem (MDP) with an average cost criterion. We first show that the value function is increasing, symmetric and convex in the queue length vector. Taking advantage of these properties, we show that the optimal rate allocation policy is one which tries to equalize the queue lengths as much as possible in each slot, while working on the dominant face of the capacity region.
Optimistic on-demand cache replication for service discovery in wireless mesh networks
Authors: Martin Krebs, Karl-Heinz Krempels
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

Current approaches for service discovery in Mobile ad-hoc Networks (MANETs) are optimized for highly dynamic environments. These approaches do not scale in Wireless Mesh Networks (WMNs) which are intended for long-time usage. Service discovery approaches for static wired networks are also not applicable. We present a scalable two-layered approach for service discovery in WMNs where clients communicate with anycast with the best Service Cache (SC) to register or query for services. SCs do not replicate the client registrations immediately; instead they push their information to all other SCs on-demand only. To avoid severe duplicate information dissemination, appropriate cache replication techniques like backoff and send control mechanisms are presented. Finally, the measurements performed in the department's wireless mesh testbed are discussed with results and conclusions.
Adding the community to channel surfing: a new approach to IPTV channel change
Authors: Marie-José Montpetit, Henry Holtzman, Herb Calhoun, Dan Grossman
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

While IPTV architecture and user interfaces have received a lot of interest in recent years much less focus has been given to the issues of channel surfing in the IPTV era. IPTV is rapidly transitioning from a Telco solution into a generic service over any broadband access network. Traffic issues that relate to channel change are moving to the mainstream and are the talk of a number of standards organizations. This paper proposes a new approach to channel change. It uses peering and viewing statistics to reduce channel change delays and improve the user quality of experience.
On truth, belief and knowledge
Authors: Flemming Topsøe
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1 (2009)

Truth, belief and knowledge are important aspects of the overall concept of information. Speculating over the possible connections between these entities, new concepts come up naturally and also, specific relationships among them are derived. In particular, a relatively narrow class of measures of entropy and divergence are isolated which have special interpretations related to the world of which we are a part. The classical Shannon world and the world of a black hole may be conceived as extreme examples. Emphasis is on the underlying philosophy and the resulting cognitive paradigm which allows for an interaction between truth, belief and knowledge. The specific concepts which emerge are basically known and, apart from the central concepts related to Shannon theory, they were introduced by Havrda and Charvát, by Daróczy, by Lindhard and Nielsen and by Tsallis.
Efficient implementation of image interpolation as an inverse problem
Authors: S. E. El-Khamy, M. M. Hadhoud, M. I. Dessouky, B. M. Salam, F. E. Abd El-Samie
Venue: Digital Signal Processing (2005)

This paper presents three computationally efficient solutions for the image interpolation problem which are developed in a general framework. This framework is based on dealing with the problem as an inverse problem. Based on the observation model, our objective is to obtain a high resolution image which is as close as possible to the original high resolution image subject to certain constraints. In the first solution, a linear minimum mean square error (LMMSE) approach is suggested. The necessary assumptions required to reduce the computational complexity of the LMMSE solution are presented. The sensitivity of the LMMSE solution to these assumptions is studied. In the second solution, the concept of entropy maximization of the required high resolution image a priori is used. The implementation of the suggested maximum entropy solution as a single sparse matrix inversion is presented. Finally, the well-known regularization technique used in iterative nature in image interpolation and image restoration is revisited. An efficient sectioned implementation of regularized image interpolation, which avoids the large number of iterations required in the interactive technique, is presented. In our suggested regularized solution, the computational time is linearly proportional to the dimensions of the image to be interpolated and a single matrix inversion of moderate dimensions is required. This property allows its implementation in interpolating images of any dimensions which is a great problem in iterative techniques. The effect of the choice of the regularization parameter on the suggested regularized image interpolation solution is studied. The performance of all the above-mentioned solutions is compared to traditional polynomial based interpolation techniques such as cubic O-MOMS and to iterative interpolation as well. The suitability of each solution to interpolating different images is also studied.
On feedback in network source coding
Authors: Mayank Bakshi, Michelle Effros
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2 (2009)

We consider source coding over networks with unlimited feedback from the sinks to the sources. We first show examples of networks where the rate region with feedback is a strict superset of that without feedback. Next, we find an achievable region for multiterminal lossy source coding with feedback. Finally, we evaluate this region for the case when one of the sources is fully known at the decoder and use the result to show that this region is a strict superset of the best known achievable region for the problem without feedback.
Capacity regions of two new classes of 2-receiver broadcast channels
Authors: Chandra Nair
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Motivated by a simple broadcast channel, we generalize the notions of a less noisy receiver and a more capable receiver to an essentially less noisy receiver and an essentially more capable receiver respectively. We establish the capacity regions of these classes by borrowing on existing techniques to obtain the characterization of the capacity region for certain new and interesting classes of broadcast channels. We also establish the relationships between the new classes and the existing classes.
Battery-aware power efficient downlink scheduling in the wireless LAN
Authors: Sang-Wook Kwon, Dong-Ho Cho
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In the wireless LAN (WLAN), when a node transmits PS POLL packet to receive downlink packet from an access point during a beacon transmission interval, the transmission order of PS_POLL packet is determined competitively without any policy. This results in needless power exhaustion of nodes. Therefore, we propose a battery-aware power efficient downlink scheduling in the WLAN. The proposed scheme differentiates PS_POLL packet transmission according to remaining battery quantity. Simulation results show that the proposed scheme consumes the power of overall node uniformly and increases life time of node compared with conventional scheme.
A novel surface-based geometric approach for 3D dendritic spine detection from multi-photon excitation microscopy images
Authors: Qing Li, Xiaobo Zhou, Zhigang Deng, Matthew Baron, Merilee A. Teylan, Yong Kim, Stephen T. C. Wong
Venue: Proceedings of the Sixth IEEE international conference on Symposium on Biomedical Imaging: From Nano to Macro (2009)

Determining the relationship between the dendritic spine morphology and its functional properties is a fundamental while challenging problem in neurobiology research. In particular, how to accurately and automatically analyze meaningful structural information from a large microscopy image dataset is far away from being resolved. In this paper, we propose a novel method for the automated neuron reconstruction and spine detection from fluorescence microscopy images. After image processing, backbone of the neuron is obtained and the neuron is represented as a 3D surface. Based on the analysis of geometric features on the surface, spines are detected by a novel hybrid of two segmentation methods. Besides the automated detection of spines, our algorithm is able to extract accurate 3D structures of spines. Comparison results between our approach and the state of the art shows that our algorithm is more accurate and robust, especially for detecting and separating touching spines.
Multi-hop transmission performance of cognitive temporary bypassing for wireless ad hoc networks
Authors: Kenichi Nagao, Yusuke Kadowaki, Yasushi Yamao
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In wireless ad hoc networks, the link SNR varies due to fading and this causes a temporary link error and blocks the multi-hop packet transmission. The cognitive temporary bypassing method was proposed to improve the transmission quality. In this paper, the proposed protocol is improved by adding acknowledgement and anti-collision functions necessary to achieve reliable multi-hop transmission. Packet success probability with the improved method has been analyzed for Rayleigh faded wireless links as functions of hop count. Simulation results using a modified QualNet simulator validate that packet success probability is remarkably improved with the method for maximum Doppler frequencies up to 30Hz.
Performance and construction of polar codes on symmetric binary-input memoryless channels
Authors: Ryuhei Mari, Toshiyuki Tanaka
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

Channel polarization is a method of constructing capacity achieving codes for symmetric binary-input discrete memoryless channels (B-DMCs) [1]. In the original paper, the construction complexity is exponential in the blocklength. In this paper, a new construction method for arbitrary symmetric binary memoryless channel (B-MC) with linear complexity in the blocklength is proposed. Furthermore, new upper bound and lower bound of the block error probability of polar codes are derived for the BEC and arbitrary symmetric B-MC, respectively.
RealClass: an interactive-enable multi-channel live teaching system on overlay service network
Authors: Weizhan Zhang, Qinghua Zheng, Yanze Lian, Xingzhuo Liu, Jixin Hou
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

In this demonstration, a prototype of live teaching system on overlay service network is presented. The system evolves the following novel characteristics: (1) Firstly, an infrastructure-based overlay multicast structure is introduced, providing multi-channel live media delivery with service differentiation on shared overlay service network. (2) Secondly, the system can support two-way interactive media as well as one-way live media at the same time. The enabling technology is a dynamic user interaction adjustment based on pre-reserved resources in the top layers of the tree. In the demonstration, diversified real-time services will be presented, including audio, video, instant message delivery for multi-channel live teaching scenario, and flexible interactive communication for group discussion.
Coding for the bidirectional broadcast channel with random states known at the encoder
Authors: Tobias J. Oechtering, Mikael Skoglund
Venue: Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3 (2009)

In this work, coding for a discrete memoryless broadcast channel with random states and two receivers is studied. Each receiver knows one of the two information sources at the sender and wants to know the other one. Since it is assumed that the sender knows the channel state sequence noncausally, an achievable rate region using Gel'fand-Pinsker-coding is derived. Further, a simpie outer bound to the capacity region as well as convexity and cardinality properties regarding the input probability distributions are discussed. The problem is motivated by the application of bidirectional comm unication between two terminals in a cellular system.
Wireless network architecture for diagnosis and monitoring applications
Authors: Zeashan Hameed Khan, Jean Marc Thiriet, Denis Genon-Catalot
Venue: Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference (2009)

This paper describes a distributed wireless network architecture for remote diagnosis and monitoring. A windmill farm is considered as a target application, which is further grouped into small clusters of windmills communicating with each other for the purpose of distributed diagnosis. Wireless links are commonly used for long-range communication in SCADA systems. In order to extend wireless networks for remote diagnosis applications, strict requirements on availability, robustness, reliability and performance have to be satisfied in order to meet industrial standards. This paper is intended to present a wireless network architecture for tele-operation of large industrial applications.