Application of Rough Sets in Data Mining
A Project Report
Submitted in partial fulfilment of
the requirements for the award of the degree of
Master of Technology
in
Computer Science and Engineering
by
Abdul Nassar . A.A.
M105101
Department of Computer Science & Engineering
College of Engineering Trivandrum
Ker ....etc

[:=Read Full Message Here=:]

Abstract:
Given an undirected, unweighted graph G = (V, E), the minimum vertex cover problem is a subset of whose cardinality is minimum subject to the premise that the selected vertices cover all edges in the graph. There are various other algorithms that follows heuristic based approaches, but using those approaches we are not able to find optimal solution always in the same manner Greedy algorithms solves the same problems but some problems have no efficient result, but up to a certain extend the Greedy algorithm ....etc

[:=Read Full Message Here=:]

Abstract—In recent years, there has been a significant amount of work done in developing low-complexity scheduling schemes to achieve high performance in multihop wireless networks. A centralized suboptimal scheduling policy, called Greedy Maximal Scheduling ( GMS) is a good candidate because its empirically observed performance is close to optimal in a variety of network settings. However, its distributed realization requires high complexity, which becomes a major obstacle for practical implementation. In this paper, we develop simple distri ....etc

[:=Read Full Message Here=:]

ABSTRACT
Abstract—Data caching can significantly improve the efficiency of information access in a wireless ad hoc twork by reducing theaccess latency and bandwidth usage. wever, designing efficient distributed caching algorithms is ontrivial when network nodeshave limited memory. In this article, we consider the cache placement problem of nimizing total data access cost in ad hoc networkswith multiple data items and nodes with limited memory pacity. The above optimization problem is known to be NP-hard. Definingb ....etc

[:=Read Full Message Here=:]

VORONOI DIAGRAM BASED PATHPLANNING

SEMINAR REPORT
SUBMITTED BY
SABARINATH P.M.
APPLIED ELECTRONICS AND INSTRUMENTATION
COLLEGE OF ENGINEERING, TRIVANDRUM
2007-11 BATCH


INTRODUCTION
The path-planning problem was originally studied extensively in robotics, and, through this research, it has gained more relevance in areas such as computer graphics, simulations, geographic information systems (GIS), very-large-scale integration (VLSI) design, and games. Path planning ....etc

[:=Read Full Message Here=:]

detailed example for successive approxmation ....etc

[:=Read Full Message Here=:]

IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 16, NO. 1, FEBRUARY 2008 105
Two Techniques for Fast Computation of
Constrained Shortest Paths
Shigang Chen, Member, IEEE, Meongchul Song, Member, IEEE, and Sartaj Sahni, Fellow, IEEE
Abstract—Computing constrained shortest paths is fundamental
to some important network functions such as QoS routing, MPLS
path selection, ATM circuit routing, and traffic engineering. The
problem is to find the cheapest path that satisfies certain constraints.
In particular, finding the cheapest delay-constraine ....etc

[:=Read Full Message Here=:]

ABSTRACT:
The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilizing grid facilities.
In this project presents ROSSE, a Rough sets-based search engine for grid service discovery. Building on the Rough sets theory, ROSSE is novel in its capability to deal with the uncertainty of properties when matching services. In this way, ROSSE ca ....etc

[:=Read Full Message Here=:]

microcontroller based power monitoring for 600KVA BATTERY BACK UP
1.INTRODUCTION
The microcontroller-based power monitoring system is an electronic device used to continuously monitor the parameters of power such as voltage, current, frequency, etc at the various points of an electric or electronics devices. The entire system is controlled by the microcontroller (80C31) and it is the real time monitoring of various parameters. Thus the name REAL TIME MONITORING OF HIGH CAPACITY (400KVA-600KVA) BATTERY BACK UP SYSTEM. This system is an 8-chan ....etc

[:=Read Full Message Here=:]

Abstract
We study nonlinear n-term approximation in Lp(R2) (0 < p < 1) from Courantelements or (discontinuous) piecewise polynomials generated by multilevel nested triangulationsof R2 which allow arbitrarily sharp angles. To characterize the rate ofapproximation we introduce and develop three families of smoothness spaces generatedby multilevel nested triangulations. We call them B-spaces because they can beviewed as generalizations of Besov spaces. We use the B-spaces to prove Jackson andBernstein estimates for n-term piecewise polyno ....etc

[:=Read Full Message Here=:]

PYRAMIDAL WATERSHED SEGMENTATION OF MEDICAL IMAGES


MAIN PROJECT
DONE BY


ANJALI ANIL.S (07406004)
FIONA MIRIAM ABRAHAM (07406018)
S.JEETHU REGHUNATH (07406049)
SANGITA ANN JACOB (07406052)



DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

LBS INSTITUTE OF TECHNOLOGY FOR WOMEN

POOJAPPURA, THIRUVANANTHAPURAM



ABSTRACT




....etc

[:=Read Full Message Here=:]

Abstract
We study nonlinear n-term approximation in Lp(R2) (0 < p < 1) from Courantelements or (discontinuous) piecewise polynomials generated by multilevel nested triangulationsof R2 which allow arbitrarily sharp angles. To characterize the rate ofapproximation we introduce and develop three families of smoothness spaces generatedby multilevel nested triangulations. We call them B-spaces because they can beviewed as generalizations of Besov spaces. We use the B-spaces to prove Jackson andBernstein estimates for n-term piecewise polyno ....etc

[:=Read Full Message Here=:]

ABSTRACT
The overall goal of the work presented in this thesis is to extend the physical understanding of the external aerodynamics associated with the rotating case of Hovering Rotor using Computational Fluid Dynamics (CFD) technique.
Rotating blades encounter tip vortices coming from preceding blades, which results in Blade Vortex Interaction(BVI) responsible for producing dynamic effects. Understanding the complex flow field due to this dynamic effects produced by wakes is therefore very important for the prediction of effects such as blad ....etc

[:=Read Full Message Here=:]