Computer Science Projects







Implementation of revised algorithms for efficiently retrieving and manipulating R Trees.  Spatial databases play a very important role in many day to day applications like geographical information system. They are different from other databases and need special indexing structures for efficient query processing. Structures based on exact matching of values, such as hash tables and that uses one dimensional ordering of key values such as b trees,do not work because the search space is multidimensional. The R tree data structure is very suitable for indexing spatial databases. A very dynamic and efficient insertion, deletion and updation algorithms makes accessing and retrieving data items quickly according to their spatial location. K M Anju AslamHaseena K

Shanimol E M


Performance analysis and application of memory bounded anytime heuristic search algorithm in travelling salesman problem.  Memory-bounded Anytime Window A*(MAWA*) is a heuristic search algorithm. Exponential memory requirement and long delay in finding optimal solution makes a * search algorithm unsuitable for large and complex problems. These drawbacks of heuristic search techniques have been solved by proposing variants of A* which works under restricted memory. The algorithm A*, MA*, AWA*, jointly form the basis of MAWA* algorithm.It uses the window-bounded anytime search methodology of AWA* algorithm as the basic framework and combines it with the memory-bounded A*-like approach to handle restricted memory situations. Pruning of the least promising node is done according to the heuristic functions when the memory constraints are violated. MAWA* localizes the global competition within a fixed size window in order to find a solution quickly. The window size is gradually increased to allow more nodes to be taken into consideration until the goal is reached. Experimental evaluation using Travelling Salesman Problem proves the efficiency of this algorithm.  Arathy RaviMahitha S

Styne Ane John


E-voting system using iris scanning authentication with modified weighted majority voting scheme.  Iris scanning in particular is among the most accurate biometric authentication technologies currently available. However despite their extremely high accuracy under ideal imaging conditions, existing iris recognition methods degrades when the iris images are noisy or enrollment and verification imaging conditions are substantially different. To address this issue and enable iris recognition on less than ideal images ,we introduce a weighted majority voting technique applicable to any biometric authentication system using bitwise comparison of enrollment time and verification time iris templates. The method outperforms the existing majority voting and reliable bit selection techniques. This method is simple and efficient mean to improve upon the accuracy of existing virus recognition systems. This technology is used as a security module for voting.  Able JohnsonBibin Jose

Febin Zachariah



Branch prediction using software prefetch  The large latency of memory accesses is a major obstacle in obtaining high processor utilization in large scale shared memory multiprocessors. The provision of coherent caches in many recent machines has alleviated the problem. Even though cache misses still occur frequently enough that they significantly lower performance. The main reason for this cache miss is the branching instructions existing in the program with lead to non linear execution of the program which will flesh the cache blocks fetched from main memory lead to the loss of CPU cycles. Instruction pre-fetch algorithm attempt to reduce the performance degradation by bringing lines into the instruction cache before they are needed by the CPU fetch unit, even in this case of branching instructions. In this paper we evaluate the effectiveness of software-controlled prefetching in high level language programs which include sequential as well as non sequential execution flows. Prefetching is software-controlled since the program must explicitly issue prefetch instructions.  Anusree K PJomol Thomas

Meenu Mohan


Safe Contiki Embedded systems, especially Wireless Sensor Nodes are highly prone to Type Safety and memory safety issues. Contiki, a prominent Operating System in the domain is even more affected by the problem since it makes extensive use of Type casts and Pointers. The work is an attempt to nullify the possibility of Safety violations in Contiki. We use a powerful, still efficient tool called Deputy to achieve this. We also try to automate the process. Contiki is an open source, highly portable, multi tasking operating system for memory efficient networked embedded systems and wireless sensor networks. The OS core itself consists of around 300 files. The work comprises of annotating each pointer access in all these files and recompiling with Deputy. Once the core is free of Type/Safety errors, we can go for the safety of applications.  Amaldeep PrakashArshad A

Sumeesh A M


Multidimensional user data modeling and  web personalization In this digital world the volume of data is increasing daily. So it is very difficult to find the relevant information for a particular user from the internet. Also different users need different types of data for the same query. A multidimensional user data model is used to reflect the behavior of a user so that it can be used for the personalization of the web contents. User model represents all kind of information related to user and user’s context, which are required in order to provide personalized user experience. It can hold various features of the user (user characteristics) as an individual such as demographic information (age, education level, interests, preferences, knowledge etc.), or can represent the overall context of the user’s work, including platform, bandwidth or location. This User model can be used for the personalization applications for the user. The existing search engine is improved by providing the facility to reflect the personalized views of the particular user. The most relevant information for the particular user is listed first according to the user data model. Also the user model can be used for the personalization of the mail system. The intelligent mail system can rank the mails according to the importance to the user. Mails can be sorted based on this rank and the system can provide more personalized experience for the user. More and more researches can be conducted in this field so that more web related applications can be personalized.  Nithin  K AnilSreekanth V

Sipin S



Virtual interacting prototyping  Virtual interactive prototyping is a virtual reality prototyping method based on sixth sense and an existing prototyping method called Display Objects. In this method a physical model is first made from cardboard or Styrofoam in the actual size and shape of the equipment to be prototyped. The components of the equipments are then projected from a projector connected to the computer into the physical model and reacts appropriately. It uses Computer Vision techniques as well as Sound Processing techniques to detect user interactions so that the user can touch and interact with the prototype like actual working equipments.VIP is a fast, flexible and interactive prototyping method and has many advantages over existing prototyping methods.  Kurien ZachariaLijins Joseph

Dileep R Dominic


Mulitquality data replication in multimedia databases  In contrast to other database applications multimedia data can have a wide range of quality parameters, such as spatial and temporal resolution and compression format. Users can request data with specific quality requirements due to the needs of their application or the limitations of their resources. The database can support multiple qualities by converting data from the original quality to another quality to support a user’s query or recomputed and store multiple quality replicas of data items. On-the-fly conversion of multimedia data such as video transcoding is very CPU intensive and can limit the level of concurrent access supported by the database. Hard-Quality and Soft-Quality. Under the Soft-Quality model, users are willing to negotiate their quality needs, as opposed to the hard quality system wherein users will only accept the exact quality request. Extensive simulations show that our algorithm perform significantly better than other heuristics. The algorithms are flexible in that they can be extended to deal with changes in query pattern.  Vinu DominicVipin T

Vishnu Suresh


Testing framework  Testing framework is an application developed using c# and .net platform. As the name suggests this application is a framework that creates a platform for testing different types of applications simultaneously. It includes 3 types of testing, Dynamic link library(DLL) testing, Database testing and application load testing.DLL testing itself contain unit testing ,regression testing and load testing of DLL’s. Database testing includes table comparison and stored procedure comparison. Table comparison includes structure and data comparisons of tables in different database environments. Application load testing is to check hoe an application utilizes the system components like memory and process time when it repeatedly running.  Sudheesh A PJithin Prems

Joseph Antony



Leave a Reply