Category: CSE Projects

Download All Computer Science Engineering Final Year Projects, Project Abstracts, Project Reports, C, C++, JAVA, .NET, C#, VB, PHP Projects. CSE projects listed here covers different topics in java for final year students for free download.

Posted on

NIT Project on A Fast and Low Bit rate Speech Coding Algorithm Pulse Position Linear Predictive Coding

Introduction to A Fast and Low Bit rate Speech Coding Algorithm Pulse Position Linear Predictive Coding Project:

This paper discussed about a robust algorithm which provides quality speech less algorithmic complexity and at low bit rates. From the implementation point of view, high quality speech at low bit rate always come with the huge algorithmic complexities. There is a need to develop robust low rate coders which can accommodate signals other than speech. Current research is focused upon achieving high quality speech at low information rates. 

Overview: 

Vocoders works at low rates but also capable to produce synthetic quality speech.  Vocoders works based on making vocal tract as a simple tube as with an excitation source at one end.As the algorithms used in this thesis are of lower complexity, the codec delay is also very less.  The new algorithm proposed here is compared with the other existing algorithms on basis of voice quality, performance and voice intelligibility. 

A common man always expects a modern communication should takes place with high quality at low rates. Low cost VoIP devices can achieve this goal, and these are developed with a fast and low complexity voice codec. The algorithm proposed in this paper provides high speech quality and intelligibility at low bit rate and low algorithmic complexity.  Mean opinion scores and informal listening tests are used to verify the quality of these developed coders. 

Conclusions: 

Researches have been takes place to develop new speech coders which can able to produce high quality speech at low data rates.  Excitation signal is the main factor which affects natural sounding speech synthesis.  This paper discussed about the new parametric representation of an excitation signal and also designs a vocoder depends on the new excitation signal. When we placed pulses at peaks and residue signal valleys then the new excitation signal will created. The new vocoder which designed based on new excitation signal provides good quality at low bit-rate and codec delay.

 Download  NIT Project on A Fast and Low Bit rate Speech Coding Algorithm Pulse Position Linear Predictive Coding.

Posted on

Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree

Introduction: 

This paper discussed about a distributed algorithm to compute all best swap edges for a minimum diameter spanning tree.   A Minimum Diameter Spanning Tree minimizes the largest distance between any pair of nodes, even if edge lengths are not uniform. 

Overview: 

One drawback of a spanning tree is that a single link failure disconnects the network. Whenever link failures occur, it has to replace by a single other link called swap link to reconnect the network. Among all possible swap links, there is a need to choose a best swap to minimize the resulting swap tree diameter.

Swap tree does not use the failed link like a minimum diameter spanning tree. The reason for preferring a swap tree is only one edge goes into service and routing can be managed with less effort. There is a moderate loss in diameter in choosing swap tree against adjusting an entire tree. When compared to that of the diameter of an entire adjusted tree which is a factor of 2.5 smaller than the swap tree diameter. There is a need to pre-compute each edge of the tree to get a best swap edge. Distributed computation of all best swaps has more efficiency as dependencies between the computations for failing edges can be exploited.  When a failing edge is replaced by a best swap edge, we have a compact routing scheme for trees which can quickly and inexpensively adapt routing in distributed algorithm.  

Distributed algorithm computes the best swap edge for every failing edge depends on the information available after the pre processing phase. To compute all best swap edges of a tree there is a need to execute this algorithm for each edge of tree independently. 

Conclusions: 

When computing best swap edges for a minimum diameter spanning tree, the solution obtained by this paper is asynchronous, needs a unique identifiers from a linearly ordered universe also uses time, small messages or messages size.


Posted on

Domain Visible Watermarking Technique on Images Base Paper

Introduction to Domain Visible Watermarking Technique on Images Project:

To protect publicly available image, there is a need to use visible watermarking, which is one type of digital watermarking. This paper discussed about how a visible watermarking technique applies to a host image in the DCT domain.  Few significant modifications done to the algorithm in order to make the watermark robust.

Overview:

Digital watermarking is a process of inserting watermark into a multimedia object to protect the object’s owner’s right. The original and watermark images are divided into blocks and the corresponding DCT coefficients are also need to be observed. For each block of original image, some mathematical calculations need to be done as per algorithm. After all the modifications done to each block of the image, watermarked image will get generated. To protect the quality of watermarked image there is a need to consider and manage both embedding and scaling factors. 

Modification to watermark: 

The algorithm proposed to generate a watermark image from an original image is not robust for images having few objects and more uniform areas. So, if we apply this algorithm for such images then it is easier for a digital thief to remove the watermark from a watermarked image. So modifications need to be done to watermark insertion technique.   

Conclusions: 

In the DCT Domain, a visible watermarking technique has proposed. To exploit the HVS texture sensitivity a mathematical model has developed. This paper discusses about few modifications which need to be done for watermark insertion algorithm to make it more effective for all images and also to increase the robustness of the watermark. Watermark should be used in different portions in different sizes and for different images also it should not available publicly for more robustness.  Even when images are printed on paper, to make the watermark more prominent by consider lower values of amin and amax, also higher values of bmin and bmax.  Visible watermark is a technique which is used in current digital TV, ecommerce and digital library etc.

 Download  Domain Visible Watermarking Technique on Images Base Paper.

Posted on

Extending Grids with Cloud Resource Management for Scientific Computing Seminar Report

Introduction to Extending Grids with Cloud Resource Management for Scientific Computing Seminar Topic:

Extending Grids with Cloud Resource Management for Scientific Computing explains about using  super computers, scientific computing is constant to the next levels such as cluster computing, Meta computing. Grid computing gained the high popularity in the field of scientific computing. Scientific computing is a traditional high work load.

Today in this generation cloud computing is emerging as the paradigm for the next generation of large scale scientific computing, the cloud computing has the four main advantages they are

  1. The cloud cannot buy their own hardware they promote the concept of leasing remote resources which frees from permanent maintenance costs and eliminate the burden of hardware.
  2. Cloud technology reduces cost of installation by removing extra hardware applications that need to be added to super computer but fulfills recruitment. To the resources needed. Through the new concept of “scaling-by credit card”.
  3. The concept of hardware virtualization can represent a significant breakthrough automatic and scalable deployment of complex scientific software.
  4. The provision of resources through business relationships contains specialized data Centre companies in offering reliable services which existing grid infrastructure fail to deliver. For scientific applications there exist several integrated environments for transparent programming and high performance.

Background concepts:

There are several workflow execution middle wares for grid computing, it is used to support the new type of cloud infrastructure.

ASKALON:

ASKALON is a grid application. In this the user composes workflow application at a high level of abstraction using a UML graphical modeling tool. The abstract workflow is given in a XML form to the ASKALON middleware services for transparent execution on to the grid.

CLOUD COMPUTING:

It is used for the provisioning services through internet which are built like utilities. The most popular interpretation of cloud computing is infrastructure as a service (iaas).  Iaas provides modern hardware facilities to customers that pay only for what you use effectively.

Virtualization in (iaas) is distributed, automatic, scalable, deployment, installation and maintenance software. 

Download Extending Grids with Cloud Resource Management for Scientific Computing seminar report.

Posted on

MS Dissertation Project on A Development of Computerized Chess Game Board Source Code

Aims and Objectives

Following are the aims and objectives of this research

Aim: To develop a desktop application for Chess Game that can be played between human player and computer using the tools related to artificial intelligence techniques.

Objectives:

Following are the research objectives

  • To critically review the computer games and the usage range of these games
  • To identify the role of AI in developing a chess game and different algorithms used across to develop a desktop chess game
  • To develop a single user desktop chess game that can be used to play against the computer
  • To evaluate the performance of the AI algorithm in terms of their moves 

Deliverables 

  • A Desktop game for Chess board that can be played against human and computer.
  • The application offers some major features like undo and redo functions, and also has an option for loading and saving the game and also the application will be a user friendly application that will have a good GUI (Graphical User Interface).
  • The application that’s developed will meet all the requirements and the validation of moves for the chess board. 

Research question(s):

  • How can Artificial Intelligence improve the challenge and entertainment of the chess game?
  • Which artificial tools would be more suited?

 Download MS Dissertation Project on A Development of Computerized Chess Game Board Source Code.

Posted on

MS Dissertation Topic on Airline Reservation System

Introduction to MS Dissertation Topic on Airline Reservation System:

The main aim of this paper is to develop an automated airline reservation system. At present, our system is based on paper work which is manual. There are many disadvantages which arise by this system such as errors and long time is required. To avoid these problems, this software is being developed. By using this software, user can fulfill his desire such as information’s about Flight time schedule and Passenger detail. This software requires Microsoft Visual Basic 6.0,MS Access and operating system.

Brief into Airline Reservation System:

This is a software package that generates the ticket and result is stored automatically. This software includes two platforms i.e., exercise reservation platform and management platform. To access this software unique use rid and password is given. The user can login by giving the appropriate username and password given to them ad can search for the details of flight schedule. In this user can search the flight based on its type , class , to and from station and date.

After searching the flight he can book the details by filling in all the details given in the passenger information form. All the data is stored automatically with a single click. Even the flight maintenance, cancellations can be done. This software is tested and provided an error free environment to the user . It adopts several safety technologies.

Advantages:

This helps to avoid errors caused due to errors and by using this we can improve accuracy. It gives fast responses when compared to responses given by manual system. It is highly secured system.

Download MS Dissertation Topic on Airline Reservation System .

Posted on

The Network Monitoring Tool Pick packet Filtering Ftp And Http Packets Project Report

Introduction to The Network Monitoring Tool Pick packet Filtering Ftp And Http Packets Project:

The widespread utilization of computers and networks for interchange of knowledge has also had divisions on the development and extension of crime via their utilization. In order to discover and restrain the crime, the law imposing departments require following the evolving traits in these regions. Amidst the various requirements of these departments is the necessity to supervise, examine and evaluate unwanted network traffic. Though the supervising, examining and evaluating of this traffic might be opposing the objective of managing the privacy of people whose network interactions are being supervised.

This project explains about Pickpocket, which is a Network Monitoring Tool and can discuss the incompatible problems of network monitoring and privacy via its reasonable utilization. This tool was created as a section of an investigation project patroned by the Ministry of Communications and Information Technology, New Delhi.

Pick Packet contains four elements- the Pickpocket Configuration File Generator for aiding the user in organizing the guidelines for catching packets, the Pick Packet Filter for catching packets, the Pick Packet Post-Processor for evaluating packets and the Pick Packet Data Viewer for displaying the attained data to the viewer. Pick Packet is a beneficial tool for collecting and giving data moving across the network. The model of Pick Packet is modular, manageable, strong and effective. Reasonable utilization of the system can also assist to defend the privacy of people and can discard only the required information to the disk. Tools for post-processing and consequential giving makes it a simple and easy tool to be utilized.

This project also deals with the modules for refining FTP and HTTP packets. The users of Pick Packet can indicate names of users, file names and text search strings for refining packets pertaining to FTP sessions. For refining packets pertaining to HTTP sessions, Host names, path names and text search strings are indicated.

Download The Network Monitoring Tool Pick packet Filtering Ftp And Http Packets Project Report .

Posted on

Routing With Security in Mobile ADHOC Networks Project Report

Introduction to Routing With Security in Mobile ADHOC Networks Project:

This project is planned employing Java Swing alongside Java Application Programming Interfaces involving Microsoft SQL Server as database. Mobile adhoc networks dismiss the reliance on a stable network framework by dealing each accessible node as an in between switch, by stretching the degree of nodes farther than their base transmitters. Manets also help in calamity management. Route Discovery or creation and Route maintenance are the two major techniques included. The ideas of Dynamic Source Routing algorithm are included here. 

Each node manages a file for recognizing its neighbor node and finds out the route among the source and the destination, in Route Discovery. On finding out the path once, the information is arranged alongside the source and the destination. In Route Maintenance, the route among the source and the destination is managed as long as the information is being sent. Every node associates its address with the source during conveying between the source and the destination. While the data is being sent, the safety is used by executing the route randomizing, which also discovers a new route that has not been employed for any earlier information transfer. 

Mobile adhoc network is a comparatively new conception in the sphere of wireless technology. Wireless investigation mainly stresses on the functional prospects of manets which have been executed as a project for the refined transfer of packets from a node to another. This system is consistent to alterations that may take place in future. 

Hardware Requirements:

 An Intel Pentium III Processor, 550,650 MHz, a 512 MB RAM, a Hard Disk of 10 GB and a Wi-fi Router are required.

Software Requirements: 

A Microsoft Windows 2000 and Windows XP OS, Programming Language- Java Swing, J2SDK 1.5 and Java APIs and a database-MS SQL Server are required.

Download Routing With Security in Mobile ADHOC Networks Project Report .

Posted on

Robust Lane Detection for Video-Based Navigation Systems Java Project

Introduction to Robust Lane Detection for Video-Based Navigation Systems Project:

Video based car navigation systems are evolving as the latest car navigation systems that offer virtual navigation services than traditional navigation systems based upon map. The technique needed to create these systems involves collecting object information through cameras and the drawn out characteristic is carried out to attain information regarding colour, margin and thing.

Drawn out characteristics include several sounds like shadow, spoiled outer face of the road and cars obstructing road markings. To identify road and things on the road, dismissal of outliers and thing identification techniques are employed. Path discovery is important to identify things on the road. But path discovery is a serious problem for several illumination states like shadow, sunset, rear lights etc. This paper suggests a new concept that identifies path for several roads and illumination, path markings situations like spoiled road outer faces obstructed by a car, shadow, backlights etc. For strong path discovery, the shape knowledge of drawn out path markings and a moving average filtering are merged, refining the precision of identification. 

 Here, a system has been employed to create a robot which can move by itself minus the assistance of anyone else and go to its destination. 

Proposed System:

In the times to come, intelligent Vehicles, as a section of Intelligent Transportation Systems(ITS) would cause a major influence. They can comprehend their close surroundings and can interact with fellow traffic partners like vehicles, frameworks and traffic maintenance centers. 

Hardware Requirements:

A Pentium IV Processor, a 32 Bit System Bus, a 512 MB RAM, a HDD of 40 GB, a SVGA Colour display and a Windows /Linux keyboard are required. 

Software Requirements:

A front end –J2EE, a back end-My Sql, a Windows/Linux OS and a Net Beans IDE are required.

Download Robust Lane Detection for Video-Based Navigation Systems Java Project .

Posted on

Resource Allocation in of DMA Wireless Communications Systems Supporting Multimedia Services

Introduction to Resource Allocation in of DMA Wireless Communications Systems Supporting Multimedia Services:

A resource allocation algorithm for downlink of orthogonal frequency division multiple access (OFDMA) systems upholding real-time (RT) and best-effort(BE) services concurrently over a time-differing wireless route is crafted. The suggested algorithm’s chief objective is increasing system throughput while gratifying quality of service(QoS) needs of the RT and BE services. 

Two types of QoS services are considered. First includes the necessary average transfer rate for RT and BE services. Second includes the bearable average absolute deviation of transmission rate (AADTR) which is only for RT services and is employed to curb the variation in transfer rates and to restrict the RT packet defer to a temperate degree. We define the maximization problem portraying the resource allocation being regarded, and resolve it by employing the dual optimization technique and the projection stochastic sub gradient method. Assumption outcome displays that the supposed algorithm satisfies the QoS needs with great throughput and surpasses the modified largest weighted delay first (M-LWDF) algorithm that upholds same QoS needs. 

Though this approach refines the system throughput, it can lead to the deprivation of the user who is facing a difficulty from a faulty route since long, that leads to extensive packet defer. As far as the RT users are concerned, the extensive defer heads to extreme deterioration of performance. The suggested algorithm conquers this hurdle by the limited use of route deviation, where the limitation is provided by the QoS needs of RT and BE traffic. 

Hardware Requirements: 

The system should have a Pentium- IV 2.4 GHz processor, a Hard Disk of 40GB, A Floppy Drive of 1.44MB, a 15 VGA colour Monitor, a Logitech mouse and a RAM of 256 MB. 

Software Requirements: 

The system should have an Operating Software-Windows XP Professional, a Front end-Visual Studio 2005, a Coding Language-Visual C# .Net and a Back-End-Sql Server 2000.

Download Resource Allocation in of DMA Wireless Communications Systems Supporting Multimedia Services.