CSE Project Topic on Real Time Face Recognition Using Step Error Tolerance BPN Project

In the image collection of data the volume is ever increasing in the various sectors of medicines, science, security as well as other fields that bought the importance of extracting knowledge’s  The computer vision has the main challenge of face recognition or classification. This paper shows the details of the development of a real time face recognition system that is focused for operating in a less constrained area.

At the beginning it reviewed the popular techniques that are used for recognition of faces followed by the details of each step and explanation of the ideas behind it that lead to these techniques. It not only helps in the task of pattern recognition but the neural network process is a Spa application for the face recognition. In our study we have developed a face recognition system that is based on the step error tolerance back-propagation neural network.

Flexible and compact design id provided by the SET-BPN and it also help to reduce the step wise errors. This will make the system easy and readily operable. At the same time it will also provide the best results for classification. For system analysis we make several tests using the real data. According to the empirical results the method that is proposed to greatly enhance the speed of recognition of the the feature matching step.

In the service of security the face recognition plays the best role and in this document we proposed a model of recognition of the face using the step are tolerance back-propagation neural network concept and the processing of digital image which is simple, fast and accurate in constraint surroundings like in household or offices. This system helps in detection of human face and it also enables face recognition and eye localization in the speed almost close to the real time. There are many other advantages of this proposed method.

Improved Performance Models of Web-Based Software Systems ASP.Net Project

Some resources are accessed by the web based software while executing the clients’ request. At the same time typically several requests arrived which lead to a competition for the available resources. Such situations querying is based on models and it is recognized widely.

Novel models, algorithms have been proposed to limit the queue model of the factor of performance. Plus, it is also shown that the algorithms and proposed models can be used to predict the performance of a web based system software in the environment of ASP.NET. Our work aims to validate the models that is proposed as well as the algorithm to verify the accuracy of the prediction of the performance with the measurement of performance in the ASP.NET surroundings. The results showcased that the metrics performance and algorithms are much more correct and accurate that the algorithm and the original model.

The web based software application system is an important and complex consideration as it has a large number of users who provide high service availability with low time of response. At the same time a certain level of throughput is guaranteed. A properly designed model for performance and appropriate algorithm evaluation can help in the prediction of the metrics performance in the early development process.

Several methods have been proposed in the last few years  for this issue. Most of them is based on the queuing networks of the extended versions or directly on the queueing network. Petri-nets and stochastic Petri-nets are used by another group. Stochastic extension of the algebraic process is the third kind of approach like EMPA, TIPP and PEPA. There are many factors that can influence the performance of the metrics. Various configurable parameters have been investigated by various  papers. And they affect the web based software system performance. For retrieving the factors that influence the performance are used in the hypothesis tests and statistical methods.

Latest CSE Java Project Topic on Fast Adaptive Fuzzy AQM Controller for TCP/IP Networks Report

Currently Active Queue Management have been proposed to look after the degradation of performance of end-to end control of congestion. AQM algorithms do not able to provide stabilization to the heavy network loads. In this document a fuzzy control algorithm based on the novel adaptive system is used to enhance the  IP network performance. In comparison to the traditional AQM which includes PID and RED the proposal made by us avoid any sort of underflows Andover flow of buffer, reduce droppings with packets etc.

An on-line adpating mechanism is proposed by us that enable the capturing of fluctuating network in conditions. On the other hand, classical AQM requires tuning based on stats mode. The stability of the algorithm is proven mathematical. The results of simulation shows for the utilization of the same link and FAFC provides far more superb performance the PID and RED.

In this document we propose a new system that is acting as an adaptive fuzzy controller for FAFC and AQM. It enables a fast response in comparison to the classical controllers like PID and RED. Thanks to the Lyapunov theory  and the system’s stability is checked properly. The controller that is obtained is simple and allows quick implementation. At the same time it also improves the functions of the network and reduce the delay in work.

For multimedia packet loss rate and jitter are important applications. The experiments of stimulation demonstrate that FAFc allows to stabile the length of the queue quickly in spite of the TCP sessions variation.  The performance result that is demonstrated the capacity of FAFC enable network capturing that are in nonlinear formats. Our future work will aim in extending the FAFC so that it can deal with the requirements of the heterogeneous traffics which will further provide varieties of droppings probabilities in networks.

A P2P Architecture for Internet Scale Content Based Search and Retrieval Project

Introduction to A P2P Architecture for Internet Scale Content Based Search and Retrieval Project:

The model peer-to-peer is one of the most popular software and with the passing of time it has become more attractive and powerful. This helps in modifying and developing the system of internet scale for the resource sharing which includes documents and files. Nodes are used for distribution of these systems and they are usually located across several networks as well as domains. It affects the efficient retrieval of the important information’s  Plus, in this document we take in consideration all the effects of the construction  that is overlaid and logically aware on the peer-to-peer keyword search algorithms.

As per the existing system the participating nodes of planet construct an inverted index globally over the space of the keyboard which is constructed partially by each node. The basis of the framework includes bloom filters which usually capture Pi nodes. In the rest of the community these filters are gossiped about randomly so that every peer can make a membership query about the Pi contents. Foam filters can be disseminated efficiently in an environment because of its small size that helps in maintaining the filter. The P2P churn rate system makes the peer maintenance an endeavor job.

System Flow Diagram:

P2P Architecture for Internet Scale

The individual peer numbers can be defined by the churn rate that helps in moving out and in from a network over a particular time period thus it may be possible that high rate can translate into the process of maintenance of the bloom filters. In contrast to our framework PlanetP can enable the users to find out the answers of the users’ queries in less timings. It depends on the filter contents like with the peer contents filters go into synchrony.

As per the the context of the Internet-Scale this presumption cannot be easily given a satisfactory explanation and therefore we focus only on the local knowledge that too at an increased amount to get the correct results. The utilization as bloom filters are considered and it is supplementary to the approach made by us. This is just ideal when the network size is limited.

Supporting Chat Protocols in PickPacket IIT Project for Computer Science Students

Online world media is actually ubiquitous for the electronic transfer of both business and private qualified data. In any case, the same media could be and has been utilized for unlawful exercises. This mandates the requirement for quite customizable grid observing instruments to catch suspected conveyances over the system and to break down them. On the other hand, electronic observation may violate the privileges of security, unhindered discourse and acquaintanceship, Pick Packet-a system following apparatus, can handle the clashing issues of grid screening and protection through its reasonable utilization.

Prior variant of Pick Packet had underpin for four requisition orders-SMTP, HTTP, FTP and Telnet, Chat orders, by which a bunch of users shape a grid to impart informative content around them, have progressed ubiquity in the final few years. Dynamic utilize of the proposed orders on the Internet moved the requirement for backing of visiting orders in Pick Packet, This thesis examines augmentation of Pick Packet for a few visiting orders (IEC and Yahoo Messenger), all parts of the Pick Packet have been redesigned for the backing of newfangled methodologies, and Pick Packet has been tested for accuracy and exhibition estimation.

Mode of Internet for electronic transfer of both business and private qualified information is truly well known. Accordingly, Internet has come to be a nexus asset of qualified data. However the same Internet could be and has been utilized by terrorists, crooks and others to impart qualified data about unlawful exercises.

Groups excessively need to secure their intelligent property from falling into the hands of their contenders. Hence, they turn to knowledge get-together over the system to check if any agent is sending such informative data unlawfully. Consequently, there is a pressing require for infrastructure of instruments that can screen and catch undesirable correspondences over the system.

Checking apparatuses perform their work by sniffing parcels from the system and sifting them on the groundwork of user specified manages. The devices that furnish the facility of defining basic administers for sifting bundles are called Packet sifts. They utilize settled balance parcel informative content like IP addresses and port numbers for sifting. Instruments that sift parcels dependent upon the intricate controls and perform post-catch analysis of gathered activity are termed as Network observing instruments.

Statistical Techniques for Detecting Traffic Anomalies DFD Diagram and Documentation

The main aim of the project is to reduce the traffic caused by the network while transmitting data’s using an egress router and ingress router. In order to reduce the traffic that is caused by the network during the transmission of data with the help of ingress and egress router is the main focus of this project.

Attack on network infrastructure is very frequent and various types of  worms and denial service are used which lead to the need of several latest techniques for monitoring and analyzing the traffic work. If only some efficient tools would have existed then it could be possible to detect the anomalies and attacks. It would also make it possible to take necessary actions to reduce their actions before they can further propagate in the network. For detection of attacks and anomaly various studies are being carried on to know the possibilities of traffic analysis that are based on mechanisms. The onset of traffic can be estimated with a sudden hike in traffic on a particular port.

We approach two types of detection mechanisms that will help to detect the anomalies – real time modes and post mortem. The latter technique usually consumes a lot of time of data as a single set and also employ  rigorous processing methods. Further it is a technique that demands lots of resources for accurate analyzing.

This kind of analysis is usually very beneficial for engineering purposes and understanding the peak demand. On the other side, there is the real time method that analyzes and concentrate a small window of data traffic. It provides a quick dirty waning of the ongoing and impending anomalies of traffic. This analysis does no require any sophisticated equipment’s and resources. This is widely used because of its features like imminence of attacks and less demands. 

Planning Of Wireless Sensor Networks Energy Efficient Clustering Under the Joint Router Abstract

The Wireless mesh networks posses the mesh routers and mesh clients. The mesh routers are having the low mobility and are the important part of the Wireless mesh network. The WMN is developed for the network accessing of the mesh and the clients. The WMN are combined with the networks like internet, cellular, sensor, networks is done by the gateway and the combining activities of the mesh routers.

The network client may be the stationery and the mobile, the client are able to make the client mesh network itself and also with the mesh routers. The Wireless mesh networks are able to overcome the demerits and efficiently upgrade the performance of the temporary networks, wireless local area networks, wireless personal area networks, wireless metropolitan area networks.

The system has vast progression and encouraging in terms of the applicability. The wireless mesh networks is able to provide the various services like different applications personal, local, campus and metropolitan cities. Although the system wireless meshes network has developed but it seeks more advancement in the protocol layers. The article is about the latest developments and researches in the wireless mesh networks.

The article deals with the system structure and the various applications of the wireless mesh networks and also the important criteria’s enhance protocol development. The various theoretical aspects and the standard protocols of the wireless mesh networks are implemented to focus on the various research areas. At last the tests, industrial works and the latest standard criteria related to the wireless mesh networks are explained.

CSE Term Paper Topic with Report on Fuzzy Set Theory In The Context Of Database Security

The Database Management System is a combination of the data and the programs to retrieve the data. The Database technology has put the huge image in the field of computers. The Database are now implemented in various areas like business, e- commerce, engineering, medical science, law, academic, library etc. 

The database posses collection of the similar data. For instance the telephone directory that posses the names, addresses, telephone numbers, profession. These all details are stored in somewhere previously in the diary of index book and now in computer in the MS Excel or MS Access. The information is the Database. 

The Project Fuzzy Set Theory is developed particularly for mathematical problems that are not accurate and unsolved by the human cognitive behavior by their intelligence. The traditional approach is unable to solve the concept of Fuzzy Set Theory. 

One example is the implementation of the Fuzzy Adaptive Resonance Theory with the neural network for identifying the abnormal intrusion detection in the Database operation. We have developed the Integrated Fuzzy set theory and the intrusion detection technique to identify the Hidden Anomaly in the Database that is accurate in real time. This technique is useful to measure the fractional number between the Zero and the One. We are calculating a fraction of the integer 1 with its uncertain degree. 

The conclusion of the Project is to protect the computer system from hacking and unauthorized access. The system administrator has less option to protect the systems. How ever the firewalls and the Intrusion Detection System are provided the solution for the protection. The more advanced technique is now developing known as the Intrusion prevention systems. The system has integrated techniques of the firewalls and the Intrusion Detection System to detect and inhibit the abnormal behavior. The preventing of the attacks is done by seeing the application layer information in the packets. The system is still more to be protected. The changing of attacks varies. The Fuzzy set theory is helpful and still need to be more developed. 

Latest CSE Project Topics List for Final Year Students

DATA MINING

The Data Mining consists of the application and the monitoring optimal and heuristic algorithms for the following functions.

  1. The Computing Association Rules
  2. To generate and develop the optimal and near optimal classification trees
  3. To generate clusters 
  4. The Project develops the new algorithm. 

INTELLIGENT INTERFACE FOR DATABASE SYSTEMS 

The Project consists of the procedures to develop the designing of the intelligent interfaces for the database systems that gives the patterns to program the database if one does not have the skills of the SQL and the Tables. The Project develops the intelligent interface with the help of the system. 

FAULT TOLERANT ROUTING IN INTERCONNECTION NETWORKS WITH MULTIPLE PASSES AND FIXED CONTROL VARIABLES 

The Project launches the advanced system of the operation of multistage interconnection networks termed as the Dynamic Access with permanent control values. The system gives the speed and easy fault tolerant routing in the networks. 

FAULT TOLERANCE ANALYSIS OF SORTING NETWORKS 

       The model is developed for the analysis of the fault tolerance features of the sorting  

        networks by simulation and the theoretical analysis. 

HARDWARE AND HIGH SPEED COMPUTER ARITHMETIC USING THE RESIDUE NUMBER SYSTEM

 The Project needs the skilled mathematical ability and the knowledge of the hardware. The Project explains the designing of the new converters with new module and high dynamic ability. The explanation of integer and  exponentiation of integer presented by the Residue Number System. 

IMPLEMENTATION AND EVALUATION OF FAST ALGORITHMS FOR ONE WAY HASHING FUNCTIONS 

      The Project will develop the new algorithms for the one way hashing function. The project also look the application and the monitoring of the developed algorithms. 

TESTING EMBEDDED SOFTWARE SYSTEMS 

The Project consists of the monitoring and the evaluating various techniques for testing of the embedded systems. 

FAULT DIAGNOSIS AND IDENTIFICATION IN BOOLEAN FUNCTIONS REPRESENTED BY ORDERED DECISION DIAGRAM 

The project consists of the Ordered binary decision diagram (OBD) that identifies the fault diagnosis in the Boolean functions. 

OPTIMAL SELECTION AS AN OPTIMIZATION PROBLEM OVER RULE BASED CONSTRAINTS 

      The Project solves the problem of optimization subjected to rule based constrains. The Project evaluates and solves this problem. 

PERIOD, COMPLEXITY, RANDOMNESS PROPERTIES OF DECIMAL AND BINARY SEQUENCES 

The Project aims to develop the computing the period, complexity and autocorrelation function of some composite sequences. 

Latest CSE Project Idea on A Scalable Shoulder-Surfing Resistant Textual-Graphical Password Authentication Scheme

The textual password vulnerabilities have become quite popular and thus users choose small and easy passwords thus making it easy for the hackers to break through. Textual password is moreover vulnerable to hidden camera, shoulder surfing and spyware attack. As an alternative option graphical password scheme is proposed and it is based on images instead of textual passwords. This kid of passwords is only vulnerable to shoulder surfing. Here, we propose a scalable shoulder surfing resistant textual-graphical password authentication scheme or S3PAS in short.

This scheme includes both text and graphical password system and it is a perfect way of providing protection to shoulder surfing., spyware attack and hidden camera. It can be easily replaced with the the system of textual password without making any kind of changes in the user existing password profile. Through the volatile and dynamic session password it is easily immune to brute force attack. S3PAS shows a bridging gap between the graphical password and textual password.

We proposed a password authentication system that enables security of the user’s password profile. It is immune to spyware attack, hidden camera and shoulder surfing. This scheme seamlessly matches the test based passwords and can also facilitate various lengths of the passwords that requires zero percent effort on the part of the users to transmigrate to S3PAS, their existing passwords.

There are certain drawbacks in this particular scheme and it include a longer process for login, making it time consuming and complicated for the users. Therefore we are planning to develop a new version of this scheme that will include a lower level of security thus making it is for the adoption of the users. This version will be more simple and will be easy from the view point of logging in in comparison to the older version.