plzzzzzzzzzzzzzzz send me the ppt for this topic i have seminar on this for 50 marks ....etc

[:=Read Full Message Here=:]

This paper introduces a message forwarding algorithm for search applications within mobile ad hoc networks that is based on the concept of selecting the nearest node from a set of designated nodes. The algorithm, which is called Minimum Distance Packet Forwarding (MDPF), uses routing information to select the node with the minimum distance. The goal of the proposed algorithm is to minimize the average number of hops taken to reach the node that holds the desired data. Numerical analysis and experimental evaluations using the network simulation ....etc

[:=Read Full Message Here=:]

Abstract

Distance Education is defined as a planned teaching/learning experience that uses a wide spectrum of technologies to reach learners at a distance and it is designed to teach students who do not have easy access to a traditional classroom. With this kind of technology one can teach to a remote site such as a rural area or it can make corporate training more economical.
With the advent of the new technologies distance learning is a convenient rather than a necessary learning tool. The tools that can be used are: videotape reco ....etc

[:=Read Full Message Here=:]

Abstract:
This paper presents an approach for integrating e-learning with the traditional education system. A conceptual map is then created for this integration leading to a functional model for open and flexible learning. In the proposed integration, convergence of CD-based, class based and web based education in recommended and architecture to achieve this convergence is presented. In order to transform the existing schools, colleges and universities into digital campuses, an inclusive system architecture is designed for digital campus. A c ....etc

[:=Read Full Message Here=:]

i need the paper presentation in mdpf in manet
i.e iee paper of iee tranction on mobile computing vol 8 no 10october 2009
plz send me ineed it for 50 marks seminars ....etc

[:=Read Full Message Here=:]

a new approach to compositional adaptation based on the idea of constituting the final solution in a way that its global difference with a set of solutions belonging to the retrieved cases can get minimized. Within this respect, the normalized distance between the current problem and each retrieved case is taken into account, using a global distance function, which makes use of the normalized local distances between the candidate final solution and the retrieved cases' solutions as the variables, and some coefficients as its parameters. Here, a ....etc

[:=Read Full Message Here=:]

Abstract :

This project is targeted to design a website for Dronacharya Institute of Distance Education. The codename WebPro is coined in order to facilitate the reference to our project in the writing of its different features and tools.

The website will present complete information regarding various programs - their eligibility criteria, syllabus, structure, duration, procedure, and other information. The Focal Point of this website will be UID, i.e., user interface design. We are using Microsoft Visual Studio 2005 for website ....etc

[:=Read Full Message Here=:]

The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be exploited to greatly reduce the energy required by postponing communication until the sender moves close to a target receiver, subject to application deadline constraints. In this paper, we characterize the fundamental performance limit, namely the lower bound expected communication distance, achievable by any postponement algorithm within given deadline constraints. Our analy ....etc

[:=Read Full Message Here=:]

A polychotomous classifier assigns an observation to one of the K categories with K€¢3. Multiple binary classifiers (K=2) such as the popular Support Vector Machines can be combined to achieve multi-class classification. Commonly used approaches include the one-vs-others scheme and the one-vs-one (pairwise coupling) scheme. While literature reported better performance from pairwise coupling than one-vs- others, the number of base learners required by pairwise coupling is quadratic in K. Alternatively, error correcting ....etc

[:=Read Full Message Here=:]

Abstract—In this paper, we present a novel framework, called learning by propagability, for two essential data mining tasks, i.e., classification and regression. The whole learning process is driven by the philosophy that the data labels and the optimal feature representation jointly constitute a harmonic system, where the data labels are invariant with respect to the propagation on the similarity graph constructed based on the optimal feature representation. Based on this philosophy, a unified framework of learning by propagability is propos ....etc

[:=Read Full Message Here=:]