MIT-World Peace University (MIT-WPU) is a top educational institute located in Pune, India. It is recognized within&nbsp;UGC under Government of Maharashtra Act No. XXXV 2017.&nbsp;

It is part of the MIT group of institutions (established in 1983) which covers 10+ campuses across India and has more than 50,000+ students enrolled across various disciplines at a given point of time. The institute houses 15 schools ranging from Engineering &amp; Technology, Design, Pharmacy, Commerce, Governance among others. It offers undergraduate, postgraduate and PhD programs among different disciplines.&nbsp;

&nbsp;

MIT World Peace University

School of Computer Engineering & Technology

Collaborative caching and browsing allow a group of users to utilize internet bandwidth in an optimal manner by minimizing outgoing requests and allowing cooperation during web research activities. LetSurf allows a group of clients to retrieve cached materials from within the group while collaborating through a user interface to access items indicative of group behavior, such as the most recent links visited by peer users and the most popular links visited. An implementation of the system is presented and evaluated in terms of latency in loading a sample set of web elements. © 2011 IEEE.

Engineering and Technology

World University root node

2011 Fourth International Conference on Emerging Trends in Engineering &amp; Technology

LetSurf-Implementing Collaborative Surfing

Journal of information, knowledge and research in computer engineering

Crosswalk detection system using mobile phone

International Journal of Computer Science Issues (IJCSI)

Data-acquisition, data analysis and prediction model for share market

This paper describes a way to efficiently utilize free disk space on Desktop machines connected over a network. In many Networks today, the local disks of a client node are only used sporadically. This is an attempt to manage the data storages in a network efficiently and to provide the software support for sharing of disk space on Desktop machines in LAN. In the current situation, storage expansion on conventional servers has constraints like, maximum expansion limitation, costly affair and in case of hardware replacement, up gradation, the manual relocation of Data becomes messy. UVS (Unified Virtual Storage) is an attempt to efficiently utilize freely available disk space on Desktop machines connected over a network. Its purpose is to reduce load of data traffic on network server, to efficiently utilize space on client nodes thereby avoiding wastage of space. It also eliminates Hardware restriction for Storage Expansion and provides Location transparency of data store. The main advantage of UVS is that it can be seamlessly integrated into the existing infrastructure (Local Area Network system). Virtual Storage is virtually infinite supporting scalable architecture. The client node can use the Unified Virtual Drive as a single point access for Distributed Storage across different servers thereby eliminating an individual addressing of the servers. The performance of prototype implemented on a UVS Server connected by network and performance is better than the centralized system and that the overhead of the framework is moderate even during high load.

International Journal of Computer Applications

Unified Virtual Storage: Virtualization of Distributed Storage in a Network

Root Cause Analysis of Congestion in Wireless Sensor Network

Since the inception of the web searching technology, people have been searching for almost everything and anything on the internet. The ever-increasing dependency of users on these search engines and the dynamic nature of the World Wide Web has reduced the accuracy of the search results and increased the search time of an individual. Today, more than ever before, there is a need for search engines to be relevant and precise to the user's needs and to be able to make decisions about what the user wants to search, and should be able to suggest him similar or related topics of his interest. This increasing need of the search engine to become a decision engine [1] (term coined by Stefan Weitz [2]) brought to fore various creative technological ideas like Tag clouds and AutoComplete [3]. For a better and more relevant search experience, it is crucial that we study the present search behavior of users and its corresponding response by the search engine. This work contemplates the nature of searches made and how they evolve from time to time. In this paper we examine and construe data from various angles and then provide our suggestions and conclusions for a better, more personalized and relevant search. © 2010 IEEE.

2010 3rd International Conference on Emerging Trends in Engineering and Technology

User web search behaviour

Number 3-Article 4 Year of Publication: 2010

Direct Hashing and Pruning algorithm of ARM performs well at initial passes by smaller candidate 2-itemset generation and turns out to be very powerful to facilitate initial itemset generation. Efficient pruning technique of AprioriTid algorithm is highly effective for frequent itemset generation in the later passes. Theoretical and practical studies reveals the underneath facts for the scope of improvement for both the algorithms. This paper describes a hybrid approach for association rule mining, based on coupling of best part of two well known ARM algorithms, AprioriTid and DHP with a binary approach which significantly improves the performance. © 2010 Springer-Verlag.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

DHPTID-HYBRID Algorithm: A Hybrid Algorithm for Association Rule Mining

Ontology Driven Software Engineering in Multi-Site Software Development

Steganography is the art of hiding the existence of data in another transmission medium to achieve secret communication. It does not replace cryptography but rather boosts the security using its obscurity features. Steganography method used in this paper is based on biometrics. And the biometric feature used to implement steganography is skin tone region of images [1]. Here secret data is embedded within skin region of image that will provide an excellent secure location for data hiding. For this skin tone detection is performed using HSV (Hue, Saturation and Value) color space. Additionally secret data embedding is performed using frequency domain approach - DWT (Discrete Wavelet Transform), DWT outperforms than DCT (Discrete Cosine Transform). Secret data is hidden in one of the high frequency sub-band of DWT by tracing skin pixels in that sub-band. Different steps of data hiding are applied by cropping an image interactively. Cropping results into an enhanced security than hiding data without cropping i.e. in whole image, so cropped region works as a key at decoding side. This study shows that by adopting an object oriented steganography mechanism, in the sense that, we track skin tone objects in image, we get a higher security. And also satisfactory PSNR (Peak-Signal-to-Noise Ratio) is obtained. © 2010 IEEE.