we introduce & study the MCSC problem. Given a finite ground set X and a constraint t, find the minimum number of consistent subsets that cover X, where a subset of X is consistent if it satisfies t. The MCSC problem generalizes the traditional set covering problem and has minimum clique partition (MCP), a dual […]
Archives for March 2013
Scalable Database-Driven Reverse Dictionary In A Building
we describe the design and implementation of a reverse dictionary. Unlike a traditional forward dictionary,which maps from words to their definitions, a reverse dictionary takes a user input phrase describing the desired concept, and returns a set of candidate words that satisfy the input phrase. This work has significant application not only for the general […]
Website Structure Improvement through Facilitating Effective User Navigation
A primary reason is that the web developers’ understanding of how a website should be structured can be considerably different from that of the users. While various methods have been proposed to relink webpages to improve navigability using user navigation data, the completely reorganized new structure can be highly unpredictable, and the cost of disorienting […]
MANET Allocating replica building the SCF-tree
we address the problem of selfishness in the context of replica allocation in a MANET, i.e., a selfish node may not share its own memory space to store replica for the benefit of other nodes. In this paper, we shall refer to such a problem as the selfish replica allocation. Simply, selfish replica allocation refers […]
Wireless Sensor Networks Implementation In Trust Aware Routing Framework
To protect WSNs from the harmful attacks exploiting the replay of routing information, we have designed and implemented a robust trust-aware routing framework, TARF, to secure routing solutions in wireless sensor networks. The design of TARF centers on trustworthiness and energy efficiency. EnergyWatcher is responsible for recording the energy cost for each known neighbor, based […]
Dynamic Load balancing with Access Point Selection Algorithm
Abstract Maximizing network throughput while providing fairness is one of the key challenges in wireless LANs (WLANs). This goal is typically achieved when the load of access points (APs) is balanced. In this article, we study this AP selection problem in a decentralized manner with the objective of maximizing the minimum throughput among all […]