Mining Weighted Association Rules without Preassigned Weights .Net project

Abstract

• Association rule mining is a key issue in data mining.
• However, the classical models ignore the difference between the transactions, and the weighted association rule mining does not work on databases with only binary attributes.
• In this paper, we introduce a new measure w-support, which does not require pre-assigned weights.
• It takes the quality of transactions into consideration using link-based models.
• A fast mining algorithm is given, and a large amount of experimental results are presented.
• The weights are completely derived from the internal structure of the database based on the
• Assumption that good transactions consist of good items.

 

Mining Weighted Association Rules without Preassigned Weights -
minigweighted -

Estimation of Defects Based On Defect Decay Model ED3M .Net Project

Abstract:   

An accurate prediction of the number of defects in a software product during system testing contributes not only to the management of the system testing process but also to the estimation of the product’s required maintenance. Here, a new approach, called Estimation of Defects based on Defect Decay Model (ED3M) is presented that computes an estimate the defects in an ongoing testing process. ED3M is based on estimation theory. Unlike many existing approaches, the technique presented here does not depend on historical data from previous projects or any assumptions about the requirements and/or testers’ productivity. It is a completely automated approach that relies only on the data collected during an ongoing testing process. This is a key advantage of the ED3M approach as it makes it widely applicable in different testing environments. Here, the ED3M approach has been evaluated using five data sets from large industrial projects and two data sets from the literature. In addition, a performance analysis has been conducted using simulated data sets to explore its behavior using different models for the input data. The results are very promising; they indicate the ED3M approach provides accurate estimates with as fast or better convergence time in comparison to well-known alternative techniques, while only using defect data as the input.

BASE PAPER -
estim -

Efficient Routing In Intermittently Connected Mobile .Net Project

   Abstract

Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested to use flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the  over head of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that “spray” a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing
not only performs significantly fewer transmissions per message, but also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays.

efficient routing in intermittently connected mobile network -
spray -

A Cost-Based Approach to Adaptive Resource Management .Net Project

Abstract:

          Data stream management systems need to adaptively control their resources, since stream characteristics and query workload may vary over time. In this paper, we investigate an approach to adaptive resource management for continuous sliding window queries that adjusts window sizes and time granularities to keep resource usage within bounds. These two novel techniques differ from standard load shedding approaches based on sampling, as they ensure exact query answers for given user-defined quality of service specifications, even under query reoptimization. In order to quantify the effects of both techniques on the various operations in a query plan, we develop an appropriate cost model for estimating operator resource allocation in terms of memory usage and processing costs. A thorough experimental study not only validates the accuracy of our cost model but also demonstrates the efficacy and scalability of the proposed techniques

000 BasePaper _ Cost-Based Approach -
Cost-Based Approach -

Greedy Routing With Anti-Void Traversal For Wireless Sensor Networks .NET Project

The unreachability problem (i.e., the so-called void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the void problem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption of control overheads.

Moreover, the hop count reduction (HCR) scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor’s traffic, while the intersection navigation (IN) mechanism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion.

 In order to maintain the network requirement of the proposed RUT scheme under the non-UDG networks, the partial UDG construction (PUC) mechanism is proposed to transform the non-UDG into UDG setting for a portion of nodes that facilitate boundary traversal. These three schemes are incorporated within the GAR protocol to further enhance the routing performance with reduced communication overhead. The proofs of correctness for the GAR scheme are also given in this paper.

 

greedy -

ACTIVE LEARNING METHODS FOR INTERACTIVE IMAGE RETRIEVAL .NET Project

Human interactive systems have attracted a lot of research interest in recent years, especially for content- based image retrieval systems. Contrary to the early systems, which focused on fully automatic strategies, recent approaches have introduced human-computer interaction. In this paper, we focus on the retrieval of concepts within a large image collection. We assume that a user is looking for a set of images, the query concept, within a database. The aim is to build a fast and efficient strategy to retrieve the query Concept. In content-based image retrieval (CBIR), the search may be initiated using a query as an example. The top rank similar images are then presented to the user. Then, the interactive process allows the user to refine his request as much as necessary in a relevance feedback loop. Many kinds of interaction between the user and the system have been proposed, but most of the time, user information consists of binary labels indicating whether or not the image belongs to the desired concept.

 

active -

Bidding system with Multi brand Product Selection .NET Project

The “Bidding System with Multi Brand & Product Selection” is a collection of agreements and conventions describing the meanings of calls used during the bidding phase of contract bridge. The good features of all these forums are incorporated in to this Product Selection to make it really an online solution for all forum needs.

The “Bidding system with Multi brand & Product Selection” is a web-based enterprise application that automates all possible business functionalities of the bidding sector such as providing information catalog of various companies’ products, participate the new action to the particular product, providing information of the company’s, providing particular product cost, deposited the amount and providing alerts to the user who is participate the actions. As this is a web application, it supports to the customers to purchase the product easy way.

bid -