NIT Calicut Project on Process Based Monitoring of Thin Clients Java Project

Introduction to Process Based Monitoring of Thin Clients Java Project:

In order to develop a centralized Linux based administration this project approaches for and its focus on administrative tool in order to monitor the multi-user networked environment that is run by several users. It is almost similar to the NITC computer center. The software will enable the computer network administrator to terminate the process of any user.

In case of users who are using any particular applications like instant messenger, chat client and others it will also link in to their ids. An improvement can be made in this system in the future by adding a mechanism that can take users’ screenshots with the help of the restricted programs. It will store these programs so that the administrator can take a look into it later on.

Moreover this software will also provide information to the administrator about the processes that relate to the given specifications at the initial time of starting the particular application. The application will further able to identify the process successfully. If the user tries to make use the techniques mentioned in the introduction to hide its identity this application will not let him do so. At times this software becomes a bit heavy on the server as it needs the Apache tomcat server.

Supplying more options to the administrator can make this software more advantageous. This will also reduce the load on the server. This software is highly important for organizations where a number of computers are connected in a single network. This will enable the administrator to keep a watch on the various interconnected lines and also to prevent all kinds of misuses. It will disclose the identity of the user in case he wants to perform any illegal activities. Using the proposed system of screen shots will make the software more useful and demanding among the users.

Download NIT Calicut Project on Process Based Monitoring of Thin Clients Java Project.

Gossip Based Random Routing In Ad Hoc Networks Latest CSE Seminar Topic with Report

Introduction to Gossip Based Random Routing In Ad Hoc Networks  Seminar Topic:

Most of the Adhoc routing protocols experience variant of the flooding.  Because of this many messages which are used in the routing are forwarded unnecessarily. In this paper we come up with a gossiping based approach which allows each node for forwarding message with some probability, so that this problem can be reduced. 

In this paper we implement gossiping, i.e. we decide randomly to forward or not to forward the message so that it can minimize the number of the messages being routed significantly. From the percolation theory we can conclude that this feature of the Gossiping exhibits the feature of the bimodal.  

The nodes are used for joining in a dynamic manner and also can quit the networks depending on the situation. Moreover, the limitations on power consumption in a node transmission range are typically small when compared to the span of the network. This limits the propagation range of a mobile node. The main challenges involving in the design of the Adhoc networks include the dynamic routing protocol development where routes can be determined more efficiently. 

Our protocol is simple and also easy to implement into the existing routing protocols. Even when we add this feature of gossiping to the AODV, there is a significant performance increase in all the metrics which are considered also in the situations in network which are as small as with around 150 nodes. This approach of Gossiping has lot of advantages when compared to that of other approaches. A further limit exists for the amount of the non-local traffic which is being sent over the large networks. In spite of this problem the gossiping feature is still useful for the non-local messages which are being sent on the large networks.

Download Gossip Based Random Routing In Ad Hoc Networks Latest CSE Seminar Topic with Report.

Go Programming Language from Google Latest CSE Final Year Seminar Report

Introduction to Go Programming Language from Google Seminar Topic:

The paper is about the introduction to the programming language named GO. It is for programmers with c or c++ knowledge.  This project describes the language specification with a series of programs implementing key features of the language.

In this programming the declaration of the functions are similar to that of the programing languages like ‘C’ where the functions are declared with the keyword ‘func’, also the execution of the program starts from main method only. A string constant contains Unicode characters encoded in UTF-8. GO is also a multi-threaded language which increases the performance of the applications.

The declaration of comment is similar to that of declaration in c++     /* … */.  Regarding the semicolon we can notice that our general program has no semicolons.

When we speak about this language the compilers included are Gccgo which makes use of GCC back end. Usage of this type of compilers will run most fastly and also capable of generating less code when compared to that of Gccgo. It is similar to the usage of variable type specification of integer; float also unsigned integers like uint.

These compilers run faster but generate less code compared to that of Gccgo. Go defines variables of types such as int8, float64 and also unsigned integers like uint, uint32 and more.

With the channels we will be able to service the multiple clients without using the multiplexer explicitly .This covers some of the basic topics in general about Go programming language.

In this paper we have given the introduction to the programming language named GO. It is for programmers with c or c++ knowledge.  This project describes the language specification with a series of programs implementing key features of the language. 

Download Go Programming Language from Google Latest CSE Final Year Seminar Report.

Fuzzy Logic Computer Science Seminar Topic with Report 2011

Introduction to Fuzzy Logic  Computer Science Seminar Topic:

This paper is about land cover classification using C. The objects are divided into groups which are called as clusters. Here the objects of the similar type of clusters are grouped together whereas the objects of different objects are clustered separately. 

Land cover describes the land surface. It can be natural or semi-natural or can be man-made.

They are directly observable. The reason for knowing about the land coverage maps is for giving the brief idea about the natural and also the built resources. 

The Fuzzy C is a method of clustering which allows one data to belong to two or more clusters and is frequently used in image segmentation and pattern recognition. 

A new reformed fuzzy C means technique has been proposed for land cover classification. The satellite image segmentation and land cover classification by RFCM are compared with that of FCM and PFCM on the quality measures PSNR, compression ratio, and execution time and Kappa coefficient. 

The application which is developed also tested with various pictures and the results is proved to be successful. The program is also tested for its consistency and its reliability. This work is useful for land cover mapping. Land cover maps are essential inputs to environmental and land use planning at local, regional, and national levels. They are being used directly in resource inventories like woodland census, state of the environment reporting like distribution establishment, extent and quality in case of the key habitats. They also act as input to the development and monitoring of a range of land use and conservation policies.

Download Fuzzy Logic  Computer Science Seminar Topic with Report 2011.

ECE Training Report On GSM Architecture

Introduction to GSM Architecture Seminar Topic:

The paper is about the GSM, the global system for mobile communication. It is a standard which is being developed for describing the technologies for the digital cellular networks.

This is being developed for replacing the first generation of Analog cellular networks. Firstly the data transmission was done via circuits later the data was been transmitted via packets names as the GPRS. Their speed was improved with the help of EDGE. Later the GSM has attained its standard by the third generation. A GSM network has introduced 4G standards.

The implementation of this systems are complex, and is composed of the three components which are radio-equipped, also the cell sites of handsets and also includes the fabric of communications. 

For making the systems to work the companies has defined the set of standards that allow makers to operate so that the users can use the phones.  These are the standards which are been provided by the vendors and also being analysed by different parts of the system. 

The services which are offered by the GSM include, the basic and foremost service is telephony, and the speech is encoded digitally and is transmitted via the GSM network. The other service includes the data services where the users are capable of sending and receiving the data up to a speed of 9600 bps. 

The unique and new feature of GSM which is not found in the Analog system previously is the service of Short Message Service.  The message allows the alphanumeric characters which can be of 160 bytes. It is a bidirectional service. It is even capable of meeting the requirements even for the personal communication system.

Download ECE Training Report On GSM Architecture.

Bittorrent B.tech Final Year CSE Seminar Topic with Report

Introduction to BitTorrent Seminar Topic:

The paper is about the BitTorrent. It is defined as a protocol which enables the peer-peer communication of file sharing system. It is mostly used when we are dealing with large volumes of data which is transmitted via the internet.  

This protocol is used for reducing the impact on the network and also a server for transmitting the large files. The file is made into segments called as pieces. Each peer gets a piece of the file is distributed, and then it becomes the source in case of other peers.

It is capable of dividing or distributing the task i.e. the distribution of the file is shared to the peer who is requesting it. It is also even capable of sending the copy of the file and gets it distributed among the other unlimited peers.

The existing studies which are considered are single-torrent based, but most of the peers have the capability for dealing with the torrents which are multiple based on our analysis. Also, these studies are not even accurate for the single-torrent based due to some assumptions. Therefore our analysis of the Bit Torrent system has provided with various assumptions.

The limitations with the systems related to the BitTorrent are, the decrease in case of the peer arrival rate impacts the service availability which makes down and also the file becomes difficult to search and also even download.

Other limitation includes the fluctuation in the client performance and changes with peer population. Also, the systems which we are using now are not offering the good services to the peers. The limitations which are discussed above helps us for providing a new approach to the multi-torrent model.

Ajax Technology CSE Seminar Topic with Documentation

Introduction to Ajax Technology Seminar Topic:

The paper is about the Ajax technology.  The technology Ajax is used for creating the customized web applications which are dynamic in nature.  It forms a communication which is asynchronous and also two-way; this communication exists between the server and also the web browser.  The aim of this paper is for providing the information about the technology AJAX, what all the duties that are performed by this technology, and also the situations when this technology should be implemented and also when not to use. This paper also includes the future enhancements when compared to that of present.

This type of communication which is asynchronous helps user to browse the webpage, as they are being loaded as sections. It has also capability of adding information which is new or being updated recently without the page being refreshed. In the present situation the application of Ajax is being used in many companies as many customers prefer the application which is being developed using this technology.

Developing an Ajax application includes the writing of the code with three sections, where the first section includes the code which is being written in HTML, where the second section is written in the JavaScript, whereas the third section is written in server script written in PHP.  Where each section of code represent the Ajax request and if there is any missing in the request then the section may fail.

AJAX helps to develop internet applications. It makes use of XML for communication with server. Overall they provide application which is interactive. We can conclude that AJAX is easy technology to learn with a little knowledge of html. Al Though the Ajax provides the web applications which are interactive and rich but if they are not properly used can create security problems.

Download Ajax Technology CSE Seminar Topic with Documentation.

High Speed Adder Used In Digital Signal Processing Technical Seminar Topic for CSE

Introduction to High speed adder used in digital signal processing Seminar Topic:

At the very least, most people expect computers to do some kind of arithmetic computation and thus, most people expect computers to add. Combinational logic circuits that perform binary addition are known as adders. We have half adder and full adder. Half adder is a combinational circuit which performs the addition of two bits.

In half adder circuit we have two binary inputs and two binary outputs. Full adder is also a combinational circuit which performs the addition of three bits. Full adder circuit may also be implemented from the combination of two half adder circuits. 

             We have some problems with this adder like it is very slow and some times it may give wrong results because of slow propagation of signals. To overcome these problems we have several adders, those are: Ripple adder, Carry Look Ahead adder, Carry Select adder, 2’s compliment adder, Conditional Sum adder, Carry Save adder.

Download High Speed Adder Used In Digital Signal Processing Technical Seminar Topic for CSE .

 

Numerical Problem a Parallel Approach Topic for CSE Technical Seminar with PPT

Introduction to Numerical Problem a Parallel Approach Topic Presentation:

We know that in sequential processing we need to process the data sequentially that is one by one which is very time consuming and in sequential approach there is a lack of interprocessor communication. Parallel processing is solving a problem by working at a time on different parts of that problem. We require algorithms, programming languages, operating systems, compilers and so many numbers of processors that may be in tens or in millions also. Parallel processing reduces the time taking to solve the problems. 

Flynn’s Classification

1. Single instruction stream, single data stream (SISD) Computer:

            In SISD computer we have only one control and one processor instruction stream is sent to processor from the control and processed the data stream is sent to the memory. 

2. Multiple instruction stream, single data stream (MISD) computer:

            In MISD computers we have number of processors and controls. A single data stream is sent from the memory to the processor then numbers of instruction stream are sent to the controls. 

3. Single instruction stream, multiple data stream (SIMD) computer:

            In SIMD computer we have number of processors and a single control. Numbers of data streams are sent to the processors from the memory and a single instruction stream is sent to all the processors from the single control. 

4. Multiple instruction stream, multiple data stream (MIMD) computer:

            In MIMD we have number of processors and controls. Numbers of data streams are sent from the shared memory or interconnection network to the processor and numbers of instructon streams are sent to the processor from the number of controls. 

In parallel processing we use number of parallel algorithms. A parallel algorithm is a solution method to be solved on a parallel computer. The quality of the parallel algorithm depends on the speedup it produces. The larger the speedup, the better the parallel algorithm.

Download Numerical Problem a Parallel Approach Topic for CSE Technical Seminar with PPT.

Quality of Service Routing Approaches and Algorithms CSE Technical Seminar

Introduction to Quality of Service Routing Approaches and Algorithms Technical Seminar:

Now-a-days so many applications are there in the internet that need service guarantee in order to maintain the functionality. So far there were no preferences to traffic; internet has followed best effort service. But now, the applications need the service guarantee, to provide this we need a system which provides these kinds of guarantees.

Quality of Service includes some mechanisms and provides such guarantees. QoS considers hop count and doesn’t follow shortest path routing. QoS routing is a routing scheme, under which paths for flows would be determined based on some knowledge of Resource availability in the network as well as the QoS requirements of the flow. 

Objectives: 

            The objectives of QoS are based on the information about network state and resource availability. These are as follows

  • Dynamic determination of feasible paths.
  • Optimization of resource usage.
  • Graceful performance degradation. 

Routing algorithms

            We have several problems in QoS routing and we can solve these problems using some algorithms. The two complex problems are MCOP (Multi-Constrained Optimal Path routing problem) and MCP (Multi-Constrained Path routing problem).these can be solved by heuristic approaches. The algorithms that are for the optimization problem MCOP can easily solve also the MCP problem by just checking if the optimal path is feasible with regard to the given constraints. For solving the MCP problem we have several algorithms. Those are Chen and Nahrstedt’s algorithm, Jaffe’s algorithm, Tunable Accuracy Multiple Constraints Routing Algorithm, Iwata’s algorithm, Randomized algorithm.

Routing strategies and approaches:

            QoS routing algorithms are divided into 3 broad classes based on the different tasks done by the QoS routing. Those are i) Source routing ii) Distributed routing iii) Hierarchical routing.

            QoS routing is more popular now because of OSPF protocol.Qospf uses three metrics: Available bandwidth, Propagation delay, Hop count

 Download Quality of Service Routing Approaches and Algorithms CSE Technical Seminar.