Free BTech BE Projects | MTech ME Projects | MCA Projects | MBA Projects
Category: CSE Seminar Topics
Download All Computer Science Engineering Seminar Topics, Technical Presentations, White Papers, Paper Presentations, ppt’s. Here we cover latest topics and provide idea for cse students to chose best topic for final year seminar topic.
The research paper Data Warehousing Implementation talks about effective ways of implementing Data Warehousing techniques. The speed at which data is churned out is astronomical. Data is released from any responsible organization almost at a second to second basis. Researchers say that Data is going to be doubled in just a few years. But the rate at which the data is secured is not at all in harmony with its production. Effective Data Base Management Systems empower organizations.
What are Mining and Warehousing:
Data mining offers some practical solutions to manage data and put them in some manageable patterns and formats. Data Mining helps the organizations to discover some invaluable ‘hidden’ data. This hidden data might expedite the business processes or help business in doing some very good competitor analyses. Data Warehousing is a valuable tool that helps in putting the data in patterns so as to facilitate prediction, forecast and analyses. The aim of warehousing is to see that almost all crucial decision business making goes ‘online’.
Problems: The research paper casts light on some practical issues faced by giant companies like AT and T which rely heavily on data warehousing without which tackling problems pertaining to storage and analyses becomes a herculean task.
Conclusion: Data warehousing projects are highly vulnerable and harder in comparison with traditional projects. Data warehousing experts alone can tweak the problems concerned to the domain. Data Warehousing works on Boolean Logic which the users might not be able to comprehend.
Data Warehousing has a very promising future although it might have a few initial hiccups.
The research paper Electro Dynamic Suspension Electro Magnetic Suspension speaks about Magnetic Levitation (Maglev) in which automobiles do not run over wheels/tyres but they surf over an electromagnetic wave. Maglev enabled automobiles run at a speed of 330 miles/hour. The research paper talks about two types of Magnetic Levitation.
1. Electro Dynamic Suspension ( EDS)
2. Electro Magnetic Suspension (EMS)
EDS is known as repulsive levitation and EMS is known as attractive levitation. The maglev enabled vehicles run over specific guideways although they can adapt themselves to respective topography. However the construction cost of such automobiles may definitely be on the higher side with respect to construction costs, electricity that is very efficiently stored in electromagnets, The magnetic levitation is a breakthrough research which will enable a train run over a electromagnetic track not touching it. Since commuting through air is not possible, magnetic levitation can give a very close traveling experience like that. A magnetic levitated train will run at a speed of 60 km per hour in simpler words a person aspiring to reach Delhi from Hyderabad will reach Delhi in flat 4 hours!
How Maglev works: In the EMS-attractive system, the electromagnets which do the work of levitation are attached on the top side of a casing that extends below and then curves back up to the rail that is in the center of the track. The rail, which is in the shape of an inverted T, is a ferromagnetic rail. When a current is passed through it, and the electromagnet switched on, there is attraction, and the levitation electromagnets, which are below the rail, raise up to meet the rail. The car levitates. The gap between the bottom of the vehicle and the rail is only 3/8″ and an electronic monitoring system, by controlling the amount of attractive force, must closely control the size of the gap.
Conclusion: Although magnetic levitated vehicles are seeing the light of the day in other countries it might take some time for the concept to hit India.
Download Electro Dynamic Suspension Electro Magnetic Suspension.
Description: The research paper DNS Domain Name System Technical Paper talks about Domain name systems. It suggests that it is not possible to have an email id indicating the IP address it would create a problem when the person moves his/her office. In a scenario like this email ids have to keep changing. In order to avoid huge confusion such a thing might rope in the Domain name system has come into existence.
The essence of DNS is the invention of a hierarchical, domain-based naming scheme and a distributed database system for implementing this naming scheme. It is primarily used for mapping host names and e-mail destinations to IP addresses but can also be used for other purposes. DNS is defined in RFCs 1034 and 1035.
What is Domain Name System: The research paper suggested that the Domain Name System (DNS) is a set of protocols and services on a TCP/IP network that allows users of the network to utilize hierarchical user-friendly names when looking for other hosts (that is, computers) instead of having to remember and use their IP addresses. This system is used extensively on the Internet and in many private enterprises today. If you’ve used a Web browser, Telnet application, FTP utility, or other similar TCP/IP utilities on the Internet, then you have probably used a DNS server.
The research paper mentions that the DNS protocol’s best-known function is mapping user-friendly names to IP addresses. For example, suppose the FTP site at Microsoft had an IP address of 157.55.100.1. Most people would reach this computer by specifying FTP.microsoft.com and not the less “friendly” IP address. Besides being easier to remember, the name is more dependable. The numeric address could change for any number of reasons, but the name can always be used.
Conclusion: The Domain name system has helped users have a user friendly email id because remembering the Internet Protocol Address could generate colossal confusion.
Description: The research paper DNA Computing Seminar Vs Silicon Chip Seminar Report speaks about the differences between traditional computing using Silicon Microprocessor as the storage device and DNA Computing that uses the DNA recombination technique.
DNA Computing that works on the principle of nucleotide sequencing has potential to increase the storage potential of any information/ data over a billion times. The breakthrough research was first conducted in the labs of University of Southern California when Professor Adleman first thought of nucleotide sequencing to replace the traditional binary 1’s and 2’s of traditional computing. He also used a primitive algorithm to find solutions to the famous Hamilton Pathway problem wherein the shortest distance to be traveled through seven cities was to be determined for a salesman.
Adleman mixed the DNA strands to get a recombinant nucleotide sequencing each sequence was unique and represented distance between two cities. And shortest distance at that. The only problem was the unnecessary intermediary chemical reactions which Adleman meticulously eliminated. This research has opened vistas for DNA Computing which has become a buzz word ever since.
The silicon microprocessor can store data but in comparison with DNA Computing it is just a fragment of information that it can store. The storage capacity of DNA is suggested to be almost unlimited and in the future the scientists predict that silicon chip will be completely replaced with DNA.
Conclusion: DNA Computing is not as easy as it sounds to be. The tear drop sized DNA Computer has to be understood and welcomed. The test tube method of storing information and the type of lab environment that facilitates DNA Computing could be intimidating. There are many potential hiccups as of now. There could be many unnecessary chemical reactions in DNA Computing which need to meticulously removed by the subject experts. The manual assistance required for DNA Computing makes it a hard dream to realize.
Download DNA Computing Seminar Vs Silicon Chip Seminar Report.
Intrusion detection in Wireless Sensor Network Java Project is for computer science final year students.This project main idea is to trace moving objects which will be useful in fields like military and aviation.This application can be useful in battle field in order to find out moving objects.
Data transfer is done using wireless sensor network. This application is implemented using two sensor detection models :single sensing and multiple sensing detection. This project will show advantages of multiple heterogeneous wireless networks.
Existing System:
1) In present existing system single sensing detection is used where only one object is detected for a single time in wireless sensor network.
2) Our Previous work was according to homogeneous and heterogeneous single sensor in wireless sensor network
Proposed System:
1) In Heterogeneous wireless sensor ,Intruder detected anywhere in the network.
2) We are detecting the intruder in multiple sensor heterogeneous wireless sensor network.
Modules:
1) Constructing Sensor Network
2) Packet Creation
3) Find authorized and un authorized port
4) Constructing Inter-Domain Packet Filters
5) Receiving the valid packet
Modules Descriptions:
Module-1:
In this module, we are going to connect the network .Each node is connected the neighboring node and it is independently deployed in network area. And also deploy the each port no is authorized in a node.
Module-2:
In this module, browse and select the source file. And selected data is converted into fixed size of packets. And the packet is send from source to detector.
Module-3:
The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers.
In this module check whether the path is authorized or unauthorized. If path is authorized the packet is send to valid destination. Otherwise the packet will be deleted. According port no only we are going to find the path is authorized or Unauthorized.
Module-4:
If the packet is received from other than the port no it will be filtered and discarded. This filter only removes the unauthorized packets and authorized packets send to destination.
Module-5:
In this module, after filtering the invalid packets all the valid Packets will reach the destination.
CONCLUSION.
This paper presented a novel highly automated approach for protecting Web applications from SQLIAs. Our approach consists of
1) Identifying trusted data sources and marking data coming from these sources as trusted,
2) Using dynamic tainting to track trusted data at runtime, and
3) Allowing only trusted data to form the semantically relevant parts of queries such as SQL keywords and operators.
Unlike previous approaches based on dynamic tainting, our technique is based on positive tainting, which explicitly identifies trusted (rather than untrusted) data in a program. This way, we eliminate the problem of false negatives that may result from the incomplete identification of all untrusted data sources.
False positives, although possible in some cases, can typically be easily eliminated during testing. Our approach also provides practical advantages over the many existing techniques whose application requires customized and complex runtime environments: It is defined at the application level, requires no modification of the runtime system, and imposes a low execution overhead.
download Project Report,Code and paper presentation of CSE Intrusion detection in Wireless Sensor Network Java Project .
DNA Computing and Bio Informatics Word Document talks about the biological link between DNA and Computing. The traditional Silicon Microprocessor has kept to quite some extent the herculean task of safeguarding oodles and oodles of data and it’s still promising to come up with even more sophisticated trends. This has now become a routine but not until 2001 when the computer Scientists of Israel proclaimed to have come up with a computer that is just the size of a water droplet but with a capacity of storing data billion times more. Such an announcement has astonished the world.
How DNA Computing has come into existence: Many theories have come up stating the use of biological elements that could marvelously help in computing, earlier ATP or the Adenosine Tri Phosphate the energy powerhouse of the cell was considered to perform many wonderful computations. Now it is the DNA with its uniquely sequencing nucleotides Adenine, Guanine, Thymine and Cytosine.
What is Bio Informatics: Bio informatics is the science that uses the principles of biology to deal with some computational problems.
What Bio Informatics Can do? Analysis and interpretation of various types of biological data including: nucleotide and amino acid sequences, protein domain, and protein structures.
Development of new algorithms and statistics with which to assess biological information, such as relationships among members of large data sets.
Development and implementation of tools that enable efficient access and management of different types of information, such as various databases, integrated mapping information.
Conclusion: The research paper closes on a note that there is a huge inflow of information on a day to day basis. Silicon microprocessor can store data but DNA computing facilitates storage of unlimited data. Scientists predict that sometime in the future the silicon microprocessor will be completely replaced with the DNA thus facilitating unlimited storage.
Download DNA Computing and Bio Informatics Word Document.
Description: DNA Computing Student Seminaris the field of Information technology is expanding unendingly. Something new is added to the domain almost daily. Such a thing is DNA Computing. It is considered a breakthrough in the field of computing and data storage. Information that is churned out needs storage and it’s almost an eternal process. Data Base Management Systems have been coming up with new ideas almost incessantly. But still there are concerns regarding efficient storage systems. The silicon microprocessor has been stealing the lime light since ages immemorial. The storage capacity of the Silicon chip a challenge in itself has been worked upon and increased on a day to day basis, not until Adleman came to suggesting that what wonders genes could do to mankind they could do similarly to computers. This is where thought ceases and leaves us agape!
How DNA Computing came into being: It happened in 1994 when Adleman used a primitive algorithm and DNA to help a salesman connect to 7 different cities via the shortest route possible. To this effect Adleman used DNA strands and mixed them to get unique nucleotide bonding between the 4 nucleotides Adenine, Guanine, Thymine and Cytosine. Each combination specified the distance to a city. An unusually quick solution was achieved for a pensive problem, opening gates for the whole new world of DNA Computing.
Conclusion: The research paper concludes on a note suggesting that enzymes and amino acids in DNA Computing do what software does in traditional computing. There are many drawbacks as of now firstly the tear drop sized may be far for being accepted .The test tube may seem to be intimidating to computer scientists and the unnecessary chemical reactions need to be weeded out by subject experts alone. All these make DNA Computing a distance and a far-fetched dream to be realized.
The research paper DNA Computing Technique says that DNA Computers have billion times more storage capacity than the conventional microchip processor. The DNA Computing technique uses the recombination methods of the nucleotides. The sequence patterns that are unique can solve many storage problems pertaining to traditional computing methods. The speed can increase billion times. The DNA Computing technology can offer processing and storage results like never before.
What is DNA Computing all about?
DNA Computing that works on the principle of nucleotide sequencing has potential to increase the storage potential of any information/ data over a billion times. The breakthrough research was first conducted in the labs of University of Southern California when Professor Adleman first thought of nucleotide sequencing to replace the traditional binary 1’s and 2’s of traditional computing. He also used a primitive algorithm to find solutions to the famous Hamilton Pathway problem wherein the shortest distance to be traveled through seven cities was to be determined for a salesman.
Adleman mixed the DNA strands to get a recombinant nucleotide sequencing each sequence was unique and represented distance between two cities. And shortest distance at that. The only problem was the unnecessary intermediary chemical reactions which Adleman meticulously eliminated. This research has opened vistas for DNA Computing which has become a buzz word ever since.
Conclusion: DNA Computing is not as easy as it sounds to be. The tear drop sized DNA Computer has to be understood and welcomed. The test tube method of storing information and the type of lab environment that facilitates DNA Computing could be intimidating. There are many potential hiccups as of now. There could be many unnecessary chemical reactions in DNA Computing which need to meticulously eliminated by the subject experts. The manual assistance required for DNA Computing makes it a far- fetched dream.
The research paper DNA Computing Final Sem Paper Download talks about DNA Computing as the breakthrough research in the domain of Computing. The world always changes sooner than later. If there is anything that is constant in the ever expanding field of technology it is ‘Change’.
There has been a time when the silicon microprocessor held the world in its grip. The capacity of the chip has been increasing day after day. Computer scientists are envisaging something almost miraculous that could happen within the domain.
Not until the year 1994 when Adleman a Computer Scientist working at the University of South California thought of replacing the traditional binary elements required for coding with the nucleotide sequence of DNA- the Deoxyribo Nucleic Acid. The double helical structure of DNA is bound to the nucleotide sequences which follow a pattern, Adleman.
Adleman also solved the problem the world was speculating named the ‘Hamilton Pathway problem’. The world was also awaiting a proper solution which Adleman ingeniously developed in his laboratory within a test tube. A DNA strand was allowed to recombine into all the possible sequences. Each sequence was considered the distance between the two cities. There were seven possible solutions given to the problem each without a repetition. The problem posed that the salesman was supposed to travel between the shortest routes possible between 7 places not repeating even one. The solution DNA gave astonished the world and there has been no looking back ever since.
There were seven possible solutions given to the problem each without a repetition. The problem posed that the salesman was supposed to travel between the shortest routes possible between 7 places not repeating even one. The solution DNA gave astonished the world and there has been no looking back ever since.
Conclusion: DNA Computing could do what a Super Computer could. DNA Computing is said to be more effective in terms of data storage and computing.
The world has every need to look forward to this tear drop sized computer whose performance will be restricted to a test tube. The disadvantages posed are the unnecessary chemical reactions that might impede the speed of the processes and manual assistance without which DNA computing at the moment is not possible.
Description: The research paper DNA Computer Vs Silicon Computer speaks about DNA Computing as befitting replacement of Super Computer. DNA or the Deoxyribonucleic acid present in the biological cells of the body, the animal body-mammals specifically stores information in huge amounts and safely passes it to the posterity without any manipulation. This inherent potential of the DNA Molecule has been understood by the Computer Scientist Adleman who works at the University of South California. In 1994 he posited the breakthrough-DNA Computing. There has been no looking back ever since.
About DNA Computing: The silicon chip has been ruling the roost since the time there was the mention of the word ‘computer’. There cannot be ignoring of the fact that the silicon microprocessor has been working relentlessly and unyielding to process and safeguard data since many eons. The fact is that the silicon microprocessor uses binary elements 0 and 1 to process and store the data, where as the DNA Computing allows 4 nucleic acids- Adenine, guanine, cytosine and thiamine do the same thing in no time. So at ground level it could be understood that the speed of DNA computing is almost double the speed of traditional computing. What the intermediary software does is taken over by enzymes and amino acids in DNA Computing.
Conclusion: DNA computing as of now uses a primitive algorithm and has to evolve by bounds to hit the day. The tear drop size computer needs a test tube for operations and this kind of replacement might sound intimidating to the computer scientists. DNA Computing has its own inherent drawbacks: A DNA Computer has to be manually assisted/ tackled; there could be unnecessary chemical combination which might prove disruptive to a specific procedure. All these aside the domain has a very promising future and could have some very effective solutions for almost obstinate problems pertaining to storage and security of data.
