In cloud computing, cloud providers can offer cloud consumers two provisioning plans for computing resources, namely reservation and on-demand plans. In general, cost of utilizing computing resources provisioned by reservation plan is cheaper than that provisioned by on-demand plan, since cloud consumer has to pay to provider in advance. With the reservation plan, the consumer […]
Archives for August 2012
Handling Selfishness in Replica Allocation over a Mobile Ad Hoc Network
In a mobile ad hoc network, the mobility and resource constraints of mobile nodes may lead to network partitioning or performance degradation. Several data replication techniques have been proposed to minimize performance degradation. Most of them assume that all mobile nodes collaborate fully in terms of sharing their memory space. In reality, however, some nodes […]
An Autonomous Engine for Services Configuration and Deployment
The runtime management of the infrastructure providing service-based systems is a complex task, up to the point where manual operation struggles to be cost effective. As the functionality is provided by a set of dynamically composed distributed services, in order to achieve a management objective multiple operations have to be applied over the distributed elements […]
Weakly Supervised Joint Sentiment-Topic Detection from Text
Sentiment analysis or opinion mining aims to use automated tools to detect subjective information such as opinions, attitudes, and feelings expressed in text. This paper proposes a novel probabilistic modeling framework called joint sentiment-topic (JST) model based on latent Dirichlet allocation (LDA), which detects sentiment and topic simultaneously from text. A reparameterized version of the […]
Image Reduction Using Means on Discrete Product Lattices
We investigate the problem of averaging values on lattices and, in particular, on discrete product lattices. This problem arises in image processing when several color values given in RGB, HSL, or another coding scheme need to be combined. We show how the arithmetic mean and the median can be constructed by minimizing appropriate penalties, and […]
A Secret-Sharing-Based Method for Authentication of Grayscale Document Images via the Use of the PNG Image With a Data Repair Capability
A new blind authentication method based on the secret sharing technique with a data repair capability for grayscale document images via the use of the Portable Network Graphics (PNG) image is proposed. An authentication signal is generated for each block of a grayscale document image, which, together with the binarized block content, is transformed into […]
A Primal–Dual Method for Total-Variation-Based Wavelet Domain Inpainting – Image Processing – 2012
Loss of information in a wavelet domain can occur during storage or transmission when the images are formatted and stored in terms of wavelet coefficients. This calls for image inpainting in wavelet domains. In this paper, a variational approach is used to formulate the reconstruction problem. We propose a simple but very efficient iterative scheme […]
Making Sensor Networks Immortal: An Energy-Renewal Approach With Wireless Power Transfer
Wireless sensor networks are constrained by limited battery energy. Thus, finite network lifetime is widely regarded as a fundamental performance bottleneck. Recent breakthrough in the area of wireless power transfer offers the potential of removing this performance bottleneck, i.e., allowing a sensor network to remain operational forever. In this paper, we investigate the operation of […]
Timescale Decoupled Routing and Rate Control in Intermittently Connected Networks
We study an intermittently connected network (ICN) composed of multiple clusters of wireless nodes. Within each cluster, nodes can communicate directly using the wireless links. However, these clusters are far away from each other such that direct communication between the clusters is impossible except through “mobile” contact nodes. These mobile contact nodes are data carriers […]
Efficient Algorithms for Neighbor Discovery in Wireless Networks
Neighbor discovery is an important first step in the initialization of a wireless ad hoc network. In this paper, we design and analyze several algorithms for neighbor discovery in wireless networks. Starting with a single-hop wireless network of $n$ nodes, we propose a $Theta(nln n)$ ALOHA-like neighbor discovery algorithm when nodes cannot detect collisions, and […]