<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-9054341064925295351</id><updated>2012-02-16T18:49:11.194-08:00</updated><title type='text'>Paper Presentation Topics</title><subtitle type='html'>This Blog Provide Abstracts for various paper presentation Topics.After reading abstract you can download corresponding paper by clicking the link given at the bottom.On the right side bar select your branches CSE, ECE , EEE, IT ,MCA ,MBA ,Civil ,Mechanical departments and more stuff will be added from time to time.So please be in touch with this blog for more and apt information.</subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://pptcontent.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><link rel='next' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default?start-index=101&amp;max-results=100'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>379</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8225397378039535043</id><published>2012-02-05T17:09:00.002-08:00</published><updated>2012-02-05T17:10:23.523-08:00</updated><title type='text'>Speech Compression</title><content type='html'>&lt;div style="text-align: justify;"&gt;This article explains a novel method of speech compression and transmission. This method lessens the transmission bandwidth required for the speech signal by a very good considerable amount. This process also exploits the feature of low pass nature of the speech signal. This method also applies equally well for any type of signal which is low pass in nature and speech being  much more widely used in real time communication. As per this technique the low pass signal (speech) at the transmitter is divided into set of packets each containing N number of samples.Among these N samples per packet only few lesser number of samples say aN alone are only transmitted.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18241794/Compressingspeechwithhigherbandwidt.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8225397378039535043?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8225397378039535043'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8225397378039535043'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/speech-compression.html' title='Speech Compression'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5645684238709926648</id><published>2012-02-05T17:09:00.001-08:00</published><updated>2012-02-05T17:09:46.761-08:00</updated><title type='text'>DATA SECURITY</title><content type='html'>&lt;div style="text-align: justify;"&gt;Steganography is the art and science of communication in such a way that the presence of any messages can not be tracked. It may be associated with field of hiding information  which has received considerable attention in recent times. One may differentiate two general directions in information hiding which is determined by the power of an adversary and protection  against only the detection of a message by  passive adversary and hiding a message such that can never be removed by an any active adversary .So information theoretic model for steganography with  passive adversary is proposed. The adversarys task of distinguishing between an innocent cover message C &amp;amp; the modified message S containing  hidden information is interpreted as a hypothesis testing problem.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18243434/datasecurity.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5645684238709926648?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5645684238709926648'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5645684238709926648'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/data-security.html' title='DATA SECURITY'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3952383250603724251</id><published>2012-02-05T17:08:00.002-08:00</published><updated>2012-02-05T17:09:07.343-08:00</updated><title type='text'>ARTIFICIAL NEURAL NETWORKS</title><content type='html'>&lt;div style="text-align: justify;"&gt;In this topic the proposed system of self organized map method is used to recognize the devanagiri characters. The som is given training for hundred hand written devanagari characters. The som is trained for hundreds of hand written devanagari numerals. The network is tested for different sort of parameters such as o/p nodes, neighborhood size and no of cycle. The process of this training is repeated for a number of times. We begin thisn by considering an Artificial neural n/w architecture in which every node is connected to other node and these are connected to each other such as  either excitatory or inhibitory or irrelevant.A single node is too much insufficient for many patricidal problems and very large number of nodes are used frequently.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18262078/artificialneuralnetworks.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3952383250603724251?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3952383250603724251'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3952383250603724251'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/artificial-neural-networks.html' title='ARTIFICIAL NEURAL NETWORKS'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-9139125851380796934</id><published>2012-02-05T17:08:00.001-08:00</published><updated>2012-02-05T17:08:28.650-08:00</updated><title type='text'>MOLETRONICS</title><content type='html'>&lt;div style="text-align: justify;"&gt;Through a scientific pursuit searching for a viable successor to the silicon computer technology has garnered too much curiosity in the last decade. The latest idea here and also one of the most intriguing is known as the molecular computers or “Moletronics” in which single molecules are served as switches quantum wires and a few atoms thick serve as wiring. The hardware is synthesized chemically from the bottom to up. The main central thesis of moletronics is that most of the chemically stabled structure that is not specifically disallowed by the laws of physics can  be built in reality. The possibility of the building things atom by atom was first introduced by Mr Richard Feynman in the year 1959.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18278892/moletronics.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-9139125851380796934?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9139125851380796934'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9139125851380796934'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/moletronics.html' title='MOLETRONICS'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2858673288872082913</id><published>2012-02-05T17:07:00.001-08:00</published><updated>2012-02-05T17:07:36.023-08:00</updated><title type='text'>AI for speech Recognition</title><content type='html'>&lt;div style="text-align: justify;"&gt;When we dial the telephone number of any big company , we are likely to hear the sonorous voice of a cultured lady who responds to our call with great courtesy saying “welcome to company xyz. Please dial the extension number you want to reach” .We pronounce the extension number, our name and the name of the person we want to contact. If the called person accepts the call the connection is given directly and quickly to him. This is artificial intelligence where an automatic call handling system is used without employing any real telephone operator. AI is the study of the abilities of computers for performing tasks which currently are better done by real people. AI has an interdisciplinary field where computer science intersects with philosophy, psychology, engineering and many other fields.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18278979/AIForspeechrecognition.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2858673288872082913?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2858673288872082913'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2858673288872082913'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/ai-for-speech-recognition.html' title='AI for speech Recognition'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4044536971156062807</id><published>2012-02-05T17:06:00.001-08:00</published><updated>2012-02-05T17:06:55.883-08:00</updated><title type='text'>ATM</title><content type='html'>&lt;div style="text-align: justify;"&gt;These days we are mainly surrounded by very strong and powerful computer systems which has some  graphical oriented input and output type functions. These computer system include the entire spectrum of PC through which professional workstations which has super computers. This performance of computers is now increasing a lot. So , the demand for communication between all systems for exchanging data and between the core central serversand  the associated hosting computer system. The replacement of this copper with fiber and the advancement of sin digital communication encoding are at the the heart of several developments that will definately change the communication infrastructure. The former development has also provided us with many huge transmission bandwidth. While the latter has made the transmission possible of all information including voice and video through which a packet switched network is possible.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18285403/Atm.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4044536971156062807?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4044536971156062807'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4044536971156062807'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/atm.html' title='ATM'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2239093002132324585</id><published>2012-02-05T17:05:00.000-08:00</published><updated>2012-02-05T17:06:13.919-08:00</updated><title type='text'>Blue Eyes</title><content type='html'>&lt;div style="text-align: justify;"&gt;Imagine yourself in a place where human beings are interacting with computers. You are sitting next to your personal computer that can listen, talk, &amp;amp; even scream aloud just like a living being. It has the ability to collect data &amp;amp; information about you and interact with you through some special techniques like facial recognition, voice recognition, etc. It can even understand your emotions and facial expressions at the touch of the mouse. It doed verification of your identity, feels your presence and  then start interacting with you .You may ask the computer to dial number of your friend at his office. It realizes that need of the situation through which the mouse starts dialing your friend at his office and then establishes a connection. Human cognition depends primarily on the ability of perceiving, interpreting, and integrating audio visuals and sensoring information. &lt;/div&gt;&lt;div style="text-align: justify;"&gt;download link:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18285504/BlueEyes.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2239093002132324585?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2239093002132324585'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2239093002132324585'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/blue-eyes.html' title='Blue Eyes'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6451023582383121435</id><published>2012-02-05T17:04:00.000-08:00</published><updated>2012-02-05T17:05:34.747-08:00</updated><title type='text'>Brain Computer Interface</title><content type='html'>&lt;div style="text-align: justify;"&gt;The proliferation of using computers in todays network connected society is creating some very complex side effects in the application of the age old greed, jealousy and revenge. Criminals are becoming very much sophisticated in committing any crime. Computers are being used in almost every type of criminal activities. Many  Gangs are using computers to clone mobile numbers and to encode credit cards. Drug dealers also use computers to store their illegal transaction ledgers. Children pornographic distributors use the Internet to trade their wares. Fraud schemes are also  been advertised on the Internet. Counterfeiters &amp;amp; forgers use computers to make passable copies of paper currency or counterfeit cashier checks .Also for creating realistic looking false identification. In addition some information stored in computers have become the target of criminal activities. Information like social security and credit card numbers, intellectual property, proprietary information, contract information, classified documents, etc. have been targeted in recent times.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Link :&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18297239/Braincomputerinterface.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6451023582383121435?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6451023582383121435'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6451023582383121435'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/02/brain-computer-interface.html' title='Brain Computer Interface'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-124165013944357322</id><published>2012-01-09T23:51:00.000-08:00</published><updated>2012-01-09T23:52:31.077-08:00</updated><title type='text'>ARCHITECTURE FOR WIRELESS INTERNET</title><content type='html'>&lt;div style="text-align: justify;"&gt;In this modern world of rapid speed communications it has become very important for a person to stay tuned to internet wherever  possible. To fulfill this type of needs of the people WAP is used. Using WAP any website can be viewed in simple hand-held devices, WAP enabled devices. This is made possible by using various communication methods like GSM, CDMA etc. Recently a new form of Wireless Internet called 1xEV-DO has been adopted which is being billed as the basis for the next generation high speed wireless internet access system. In this article we briefly discuss the working of a typical WAP enabled system and later review as to how the recently adopted 1xEV-DO outperforms the existing architectures. We also study its compatibility with different types of operating systems and its efficient utilization of the bandwidth with minimum usage.Many  people around the globe use the Internet every day for communicating  with other people , following stock market, knowing latest news,weather, shopping, entertaining  themselves . Staying online has become so nenessary that it’s hard to get away from internet connection because we might miss an important e-mail message or any news we need to know.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Link :&lt;/div&gt;&lt;div style="text-align: justify;"&gt; http://www.ziddu.com/download/18129922/architecture-for-wireless-internet.doc.html &lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-124165013944357322?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/124165013944357322'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/124165013944357322'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/01/architecture-for-wireless-internet.html' title='ARCHITECTURE FOR WIRELESS INTERNET'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1183068579559004692</id><published>2012-01-09T23:29:00.000-08:00</published><updated>2012-01-09T23:31:21.057-08:00</updated><title type='text'>FORMULATION OF FUZZY ART MAP ALGORITHM FOR DATA MINING</title><content type='html'>&lt;div style="text-align: justify;"&gt;In this article we have laid emphasis our attention on the impact of Information Technology in the field of medicine .It is known as BIO-INFORMATICS , a computational biology in which biology information technology and mathematics combined to form a single discipline.Bio-informatics which results to the formation of genomic revolution by the creation and proper maintenance of database to store biological information such as nucleotide and amino acid sequences. This article aims at providing effective solutions for the data mining problems which are faced  in the field of bio-informatics. It provides very strong algorithm for data mining FUZZY ARTMAP ALGORITHM which gived satisfactory data handling technique. This algorithm has a good mathematical background and quantitative analysis . Bio-informatics is the application of information technology to the management and use of bio logical data. It is interdisciplinary area of science where mathematics , statistics and computer science are applied together to produde data by experimental work in bio chemistry,cell,biology and genetics. The need for combining biological sciences with the world of IT and computer science has happened due to the huge amount of information being produced from the study of genetic material .&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Link :&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18129952/implementation-of-fuzzy-art-map-algorithm.doc.html &lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1183068579559004692?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1183068579559004692'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1183068579559004692'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/01/formulation-of-fuzzy-art-map-algorithm.html' title='FORMULATION OF FUZZY ART MAP ALGORITHM FOR DATA MINING'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1588518097617392777</id><published>2012-01-09T23:28:00.000-08:00</published><updated>2012-01-09T23:29:33.322-08:00</updated><title type='text'>GAIC ALGORITHM FOR IRIS IMPLEMENTATION &amp; COMPARISON</title><content type='html'>&lt;div style="text-align: justify;"&gt;The main purpose of this topic is to provide an efficient solution module for iris scanning techniques which is employed in major security systems. It provides very powerful algorithm for iris comparison technique and thereby provides a satisfactory detection technique. With a strong mathematical background and quantitative analysis it provides a promising method “GAIC” algorithm, which will definately enable efficient security in the growing trends. The above mewntioned algorithm has been simulated and implemented for the verification of platforms of MATLAB. This algorithm proves more efficient over all the other algorithms which are available. Whole world is crying out for easier access controls to personal authentication systems and it seems that biometrics may be the final answer. Instead of big ring of keys all those access cards or passwordswe carry around with us, our body will be used to uniquely identify us.  Also whenever biometrics measures are applied in combination with other controls such as access cards or passwords the reliability of authentication controls takes a major step forward.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Link :&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18136538/gaicalgorithmfoririscomparisonimplementation.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1588518097617392777?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1588518097617392777'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1588518097617392777'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/01/gaic-algorithm-for-iris-implementation.html' title='GAIC ALGORITHM FOR IRIS IMPLEMENTATION &amp; COMPARISON'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4714490563545455662</id><published>2012-01-09T23:23:00.001-08:00</published><updated>2012-01-09T23:25:57.953-08:00</updated><title type='text'>NANOTECHNOLOGICAL ARTIFICIAL RBC</title><content type='html'>&lt;div style="text-align: justify;"&gt;Molecular manufacturing provides precise control of matter at the atomic &amp;amp; molecular levels allowing the making of micron scale machines comprised of nanometer-scale components. Medical nano machines will be the very first applications. The artificial red blood cell or “respirocyte” discussed here is a bloodborne spherical 1-micron diamondoid 1000 atm pressure vessel with active pumping able to deliver 236 times more oxygen to the tissues per unit volume than natural red cells with  managing carbonic acidity. An onboard nano computer and numerous chemical and pressure sensors allow complex device behaviors remotely reprogrammable by the physician through externally applied acoustic signals. Basic Primary applications will include transfusable blood substitution , partial treatment for anemia, perinatal and all lung disorders, enhancement of cardiovascular or neurovascular procedures, tumor therapies and diagnostics,  prevention of asphyxia , artificial breathing  and varieties of sports, veterinary, battlefield and other types of  uses.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Link :&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/18138099/nanotechnologicalartificialrbc.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4714490563545455662?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4714490563545455662'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4714490563545455662'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/01/nanotechnological-artificial-rbc.html' title='NANOTECHNOLOGICAL ARTIFICIAL RBC'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8928667448290482798</id><published>2012-01-09T23:21:00.000-08:00</published><updated>2012-01-09T23:23:29.989-08:00</updated><title type='text'>NEW DIMENSION OF DATA SECURITY BY NEURAL NETWORKS</title><content type='html'>&lt;div style="text-align: justify;"&gt;Data hiding embeds data into digital media for the use of identification, annotation and copyrighting. Latest possibilities of digital imaging and data hiding open wide future in modern imaging science, content management and secure communication. Our aim is to hide huge volumes of data in the host in a manner that may cause minimal perceptual distortion and is robust to survive benign , harmful malicious attacks and make sure to hide that much information which is possible into the host. In this article we justify the prospects of the hidden information being detected and introduction of  a new approach for hiding any text without any embedding by the process of multiple key functions and Newton Forward Difference Technique so that it passes unnoticed by the any stochastic detection techniques. By this method the size of the data that can be hidden will be more than all the size of existing techniques support. This method derives a polynomial function that generates the bit position in the host where the data bits matches with the host bits. This approach uses the original bits of the host to hide the data. The conventional embedding is not done here so the host does not undergo any type of perceptual degradation thus escapes all the existing stochastic detecting techniques.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Link : http://www.ziddu.com/download/18145340/new-dimension-of-data-security.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8928667448290482798?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8928667448290482798'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8928667448290482798'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2012/01/new-dimension-of-data-security-by.html' title='NEW DIMENSION OF DATA SECURITY BY NEURAL NETWORKS'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1120833622383726648</id><published>2011-10-22T06:16:00.000-07:00</published><updated>2011-10-22T06:25:07.510-07:00</updated><title type='text'>Fuzzy Logic</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract - Ppt : Fuzzy logic is the result of merging the techniques of traditional rule based expert system, set theory and control theory, which is essentially developed on mathematical models of the controlled process. The concept of this paper is to control the illumination of&lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;span&gt; &lt;/span&gt;light sources by utilising the fuzzy logic. Error and error rate are input parameters here and the voltage is the output. Theses are all normalized in the form of intersecting triangular membership functions with seven linguals each. The rules are made by the knowledge. At a time four rules are fired and the maximum of their output is taken. The value is defuzzified by the method named center of the area or center of gravity. The defuzzified voltage is denormalised and made as a pulse to be given to a power control circuit through phase control method. The pulse is produced proportionally to give power to the circuit and&lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;span&gt; &lt;/span&gt;the illumination is again sensed and transferred to the controlling unit.&lt;br /&gt;&lt;a href="http://pptcontent.blogspot.com/2011/10/fuzzy-logic.html"&gt;Download Fuzzy Logic Documentation PPT&lt;/a&gt; : &lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:Verdana,Geneva,Arial,Helvetica,sans-serif;font-size:13px;"  &gt;&lt;b&gt;http://tinyurl.com/3t3rvxz&lt;/b&gt;&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1120833622383726648?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1120833622383726648'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1120833622383726648'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/fuzzy-logic.html' title='Fuzzy Logic'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8731467793386382613</id><published>2011-10-22T06:06:00.000-07:00</published><updated>2011-10-22T06:26:01.495-07:00</updated><title type='text'>Mobile Voting</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract - Ppt : Our voting goes mobile …. Newton did saw apple falling down.. Of what ? For what ? Why ? It is falling… We do imagine the drop of success in the Election System of India… Of what ? For what ? Why ? It is so … Yes it is the patriotistic, socialistic, humanistic, economistic, thinking of us that lead to visualize &amp;amp; analyze the election system (voting process) and project a viable solution of voting through Mobile Phones guarded by Finger print sensors by the new mobile language of SMS. Motion is the main physical charateristics of anything in this technology information era. Time is most precious thing and correct information is the most important thing. Merging all these things together we may look in for easier, cost effective, time managing way of casting my vote through Cell Phone with a finger print sensor. Why looking&lt;span&gt; &lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;/span&gt;for&lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;span&gt; &lt;/span&gt;finger print sensor in the Mobile phone ? Of course it is the security that we add to all the confidential communications which goes natural and highly secured. A finger print guarded cell phone can afford a lot in the forthcoming technocrats like M commerce, M governance, M voting, and M security.&lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:arial,sans-serif;font-size:13px;"  &gt;&lt;p class="MsoNormal" style="margin: 12pt 0in; text-align: justify; line-height: 19px;"&gt;&lt;a href="http://pptcontent.blogspot.com/2011/10/mobile-voting.html"&gt;Download Mobile Voting Documentation PPT&lt;/a&gt; : &lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:Verdana,Geneva,Arial,Helvetica,sans-serif;font-size:13px;"  &gt;&lt;b&gt;http://tinyurl.com/6fqlltp&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8731467793386382613?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8731467793386382613'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8731467793386382613'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/mobile-voting.html' title='Mobile Voting'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4052036411387490761</id><published>2011-10-22T06:03:00.000-07:00</published><updated>2011-10-22T06:29:37.117-07:00</updated><title type='text'>INFORMATION SECURITY USING STEGANOGRAPHY</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract - Ppt : We introduce a latest method for strengthening the security of information through a combination of signal processing, cryptography and steganography. Cryptography provides the safety, security by concealing the contents and steganography provides security by concealing existence of information being communicated. Signal processing adds extra security by compressing and transforming the information. The proposed method , Steganography Based Information Protection Method (SBIPM), consists of scanning, coding, encryption, reshaping, cover processing and various embedding steps. Scanning, coding, encryption processes make the information unintelligible sot hat one cannot extract simple plain&lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;span&gt; &lt;/span&gt;message. Embedding make the message invisible so that one can never detect it. Reshaping spreads the message so that embedded message can be detected from distorted steganos by authorized receivers. Cover processing makes detection of embedded message more difficult since the distortion is either due to noise addition or by message embedding. Simulation and steganlysis results show that the method provides high security and the information is totally safe from various types of attacks.&lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:arial,sans-serif;font-size:13px;"  &gt;&lt;/span&gt;&lt;br /&gt;&lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:arial,sans-serif;font-size:13px;"  &gt;&lt;a href="http://pptcontent.blogspot.com/2011/10/information-security-using.html"&gt;Download INFORMATION SECURITY USING STEGANOGRAPHY Documentation PPT&lt;/a&gt; : &lt;/span&gt;&lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:Verdana,Geneva,Arial,Helvetica,sans-serif;font-size:13px;"  &gt;&lt;b&gt;http://tinyurl.com/69mzknd&lt;/b&gt;&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4052036411387490761?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4052036411387490761'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4052036411387490761'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/information-security-using.html' title='INFORMATION SECURITY USING STEGANOGRAPHY'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-9164844503913426320</id><published>2011-10-22T06:00:00.000-07:00</published><updated>2011-10-22T06:32:09.837-07:00</updated><title type='text'>MODERN IRRIGATION SYSTEMS</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract - Ppt : This paper introduces&lt;span&gt; &lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;/span&gt;new irrigation system using fuzzy logic technique by connecting the knowledge and experience of a traditional farmer. Fuzzy logic control, which is just like the human approach of thinking, has emerged as the most active tool in automatic control. The objective of fuzzy logic controller is to automatically achieve and control some desired state of a system and process by monitoring system variables as well as taking appropriate control action. The main purpose of this work is to develop an intelligent control using fuzzy logic approach for irrigation of agricultural land, which simulates the human being’s intelligence. The status of any agricultural field in terms of evapotranspiration and error may be taken&lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;span&gt; &lt;/span&gt;as input parameters and the decision is made to calculate the amount of water required for the area to be irrigated, well in advance. This leads to the use effective utilization of various resources like water and electricity and thus becomes a cost effective system for the expected yield.&lt;br /&gt;&lt;a href="http://pptcontent.blogspot.com/2011/10/modern-irrigation-systems.html"&gt;Download MODERN IRRIGATION SYSTEMS Documentation Ppt&lt;/a&gt; : &lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:Verdana,Geneva,Arial,Helvetica,sans-serif;font-size:13px;"  &gt;&lt;b&gt;http://tinyurl.com/63fqca7&lt;/b&gt;&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-9164844503913426320?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9164844503913426320'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9164844503913426320'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/modern-irrigation-systems.html' title='MODERN IRRIGATION SYSTEMS'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1937247111526414783</id><published>2011-10-22T05:54:00.000-07:00</published><updated>2011-10-22T06:32:46.634-07:00</updated><title type='text'>Asynchronous Chip</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract - Ppt : Breaking the bounds of the clock on a processor may seem a discouraging work to those brought up through a general engineering program. Without the clock, how do you arrange the chip and know when you have the correct data ? We may have to take this task on very fast. Clock speeds are now according to gigahertz range and there is not much room for speedup before physical realities start to difficult things. With a gigahertz powering a chip, signals barely have enough time to make it across the chip before the next clock tick. At this point, speed up the clock frequency could become harmful. This is when a chip that is not constricted by clock speed could become very valuable. The idea of designing a computer processor without a central controlling clock is not a new process. In fact, this idea was suggested in early&lt;span class="Apple-converted-space"&gt; &lt;/span&gt;&lt;span&gt; &lt;/span&gt;1946, but many engineers felt that this asynchronous design would be very difficult to design with their current, and by today’s standards, complex technology. Nowadays, we have the modern manufacturing devices to make chips extremely perfect. Due of this, it is possible to create prototype processors without a clock. But will these chips catch on? A major problem in the development of clock less chips is the competitiveness of the computer industries. Presently, it is nearly impossible for companies to develop and manufacture a clock less chip while keeping the cost low.&lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:arial,sans-serif;font-size:13px;"  &gt;&lt;/span&gt;&lt;br /&gt;&lt;a href="http://pptcontent.blogspot.com/2011/10/asynchronous-chip.html"&gt;Download Asynchronous Chip Documentation PPT&lt;/a&gt; : &lt;span class="Apple-style-span" style="color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; background-color: rgb(255, 255, 255);font-family:Verdana,Geneva,Arial,Helvetica,sans-serif;font-size:13px;"  &gt;&lt;b&gt;http://tinyurl.com/3wr3gn7&lt;/b&gt;&lt;/span&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1937247111526414783?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1937247111526414783'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1937247111526414783'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/asynchronous-chip.html' title='Asynchronous Chip'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7868608958764431731</id><published>2011-10-02T07:32:00.000-07:00</published><updated>2011-10-02T07:36:38.005-07:00</updated><title type='text'>Gizmag</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract :&lt;br /&gt;Gizmag covering invention, innovation and new technologies in all spheres of human activity - all computers, communications and automation, through social innovation, new ideas, inventions and services to improve life, work and play for people of all ages. Gizmag is free for readers, listeners and viewers. Our income comes from Internet advertising and e-mail, but we do not sell products, ideas or services that we write about, so when you see the enthusiasm and passion, you know, IT is not financially motivated. Similarly, we do not sell or advertorial writing, or allow advertising to affect the tone or direction of our staff. Our commitment is to our readers, not advertisers. We strive for balanced news coverage, and we are completely independent. We are writing to a global audience, and our expectations were not biased towards or against any other country, sex, race or religion. Our goal is to eventually offer content Gizmag in all major formats and languages, and some small as well.&lt;br /&gt;More info about Gizmag :&lt;br /&gt;&lt;b&gt;http://tinyurl.com/ysy5yz&lt;/b&gt;&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7868608958764431731?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7868608958764431731'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7868608958764431731'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/gizmag.html' title='Gizmag'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7722088173400026607</id><published>2011-10-02T07:24:00.000-07:00</published><updated>2011-10-02T07:29:48.878-07:00</updated><title type='text'>Smartphone</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract :&lt;br /&gt;The smartphone is a high-end mobile phone, which combines the functions of personal digital assistants (PDAs) and mobile phones. Current models usually also function as portable media players and camera phones, high-resolution touch screen, web browser, which are able to correctly use and display standard web pages rather than mobile-optimized sites, GPS, Wi-Fi and access to mobile broadband. The smartphone term is generally used to describe the most advanced phones, computing capacity and connections to modern-day on the phone, although the difference may be vague and there is no official definition, what is the difference between them. Definitions change over time, like most phones, feature phones, which are considered today to be the qualities that go beyond mobile phones that had been promoted, such as smart phones in the past. Smartphones run mobile operating systems such as IOS Apple, Google Android, Microsoft Windows 7 Mobile, Symbian, Nokia, RIM BlackBerry OS, and embedded Linux distributions such as Maemo and Meego. These systems can be installed in many different phones, and generally each device can receive multiple OS software updates during their lifetime. Smartphones run third party applications using advanced programming interfaces (API), these applications can allow for better integration with the phone's operating system and hardware that is typically equipped with telephones. In comparison, the phones are most often run on proprietary firmware, with support through third-party software platforms like Java ME or BREW .&lt;br /&gt;More About Smartphone here :&lt;br /&gt;&lt;b&gt;http://tinyurl.com/p5ehb&lt;/b&gt;&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7722088173400026607?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7722088173400026607'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7722088173400026607'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/10/smartphone.html' title='Smartphone'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2672488120152289495</id><published>2011-08-17T07:26:00.000-07:00</published><updated>2011-08-17T07:29:10.373-07:00</updated><title type='text'>Paper Presentation Topics Why ?</title><content type='html'>You need to be able to explain the details in the paper (even the ugly tricky notation)&lt;br /&gt;&lt;br /&gt;You need to be able to provide a critical analysis of the paper&lt;br /&gt;&lt;br /&gt;Check out references in the related work section of the paper.&lt;br /&gt;&lt;br /&gt;(this will help you put the paper in context of a larger body of work and will help you critique the paper's results/contributions)&lt;br /&gt;&lt;br /&gt;More info http://www.cs.swarthmore.edu/~newhall/cs97/s00/PresentationAdvice.html&lt;br /&gt;&lt;br /&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2672488120152289495?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2672488120152289495'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2672488120152289495'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/08/paper-presentation-topics-why.html' title='Paper Presentation Topics Why ?'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3408401982955415705</id><published>2011-06-18T02:33:00.000-07:00</published><updated>2011-06-18T03:04:40.120-07:00</updated><title type='text'>Windows Security Log,</title><content type='html'>&lt;div style="text-align: justify;"&gt;The security log, Microsoft Windows, is a newspaper that contains the records of the business relationship on / off and / or other events related to the security policy specified by the verification system. Auditing allows administrators to configure Windows to record operating system activity in the security log. The safety record is one of the three newspapers visible in the Event Viewer. Local Security Authority Subsystem Service writes events to the log. The safety record is one of the main tools used by administrators to detect and investigate unauthorized activity and successful attempt to solve problems. Microsoft describes it as "the last best defense" The newspaper and audit policies that govern it are also the favorite targets of hackers and system administrators criminals who seek to cover their tracks before and after committing activity unauthorized.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Download Documentation On Windows Security Log Paper Presentation.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.ziddu.com/download/7950773/NTsecurity.doc.html&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3408401982955415705?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3408401982955415705'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3408401982955415705'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/06/windows-security-log.html' title='Windows Security Log,'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4949573037861896797</id><published>2011-03-31T01:35:00.000-07:00</published><updated>2011-03-31T01:36:58.567-07:00</updated><title type='text'>PPT TOPICS ECE EEE CSE</title><content type='html'>Below are the ppt topics for ece,cse,eee :&lt;br /&gt;1)real time image processing&lt;br /&gt;2)wi-fi/WI-MAX&lt;br /&gt;3)storage devices-recent trends&lt;br /&gt;4)fuzzy logic,&lt;br /&gt;5)semantic web,&lt;br /&gt;6)bluetooth&lt;br /&gt;7)Spyware &lt;br /&gt;8)Citation Mgt.&lt;br /&gt;9)online survey &lt;br /&gt;10)remote security &lt;br /&gt;11)online storage&lt;br /&gt;THESE ARE THE FEW TOPICS ON WHICH YOU CAN GIVE THE PPTS.&lt;br /&gt;Semantic web and online storage are the hot topics&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4949573037861896797?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4949573037861896797'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4949573037861896797'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/03/ppt-topics-ece-eee-cse.html' title='PPT TOPICS ECE EEE CSE'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8435140649280025136</id><published>2011-03-31T01:33:00.001-07:00</published><updated>2011-03-31T01:33:47.576-07:00</updated><title type='text'>Artificial Intelligence Science</title><content type='html'>Artificial Intelligence (AI) is the field of computing by focusing on creating machines that can engage on behaviors that humans are intelligent. The ability to create intelligent machines has intrigued humans since ancient times, and now with the advent of the computer and 50 years of research into AI programming techniques, the dream of smart machines become a reality . Scientists create systems that can mimic human thought, understand speech, beat the best chess player of man, and countless other businesses like never before. Discover how the military uses the AI ​​logic to its hi-tech systems, and how in the near future Artificial Intelligence can affect our lives.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8435140649280025136?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8435140649280025136'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8435140649280025136'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/03/artificial-intelligence-science.html' title='Artificial Intelligence Science'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4918280525576846608</id><published>2011-03-31T01:30:00.000-07:00</published><updated>2011-03-31T01:32:19.235-07:00</updated><title type='text'>VLSI Paper Presentation</title><content type='html'>VLSI stands for Very Large Scale Integration. "This is the area that includes the packaging of logic devices in increasingly smaller and smaller areas.Thanks for VLSI circuit which would have taken boardfuls of space which is currently in a small space few millimeters across! This opened a great opportunity to do things that were not possible before. VLSI are everywhere ... your computer, your car, your brand new camera on the state of digital art, mobile phones and what you have. All this involves a great expertise on many fronts in the same area that we examine in the following sections.&lt;br /&gt;VLSI has been around a long time, there is nothing new ... but as a side effect of progress in the world of computers, there has been a dramatic proliferation of tools that can be used for the design of VLSI circuits. Meanwhile, following Moore's law, the capacity of an IC has increased exponentially in recent years in terms of computing power, the use of the available surface performance. The combined effect of these developments is that now people can put these features several years in the IC, the new open borders. Examples include integrated systems, where intelligent devices are put inside everyday objects, and ubiquitous computing, where the proliferation of small computing devices sizes to such an extent that even the shoes that you can use actually do something useful like monitoring your heartbeats! These two fields are somewhat related, and enter its description can easily lead to another article.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4918280525576846608?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4918280525576846608'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4918280525576846608'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/03/vlsi-paper-presentation.html' title='VLSI Paper Presentation'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7677684394647435916</id><published>2011-03-31T01:26:00.000-07:00</published><updated>2011-03-31T01:30:12.053-07:00</updated><title type='text'>Advanced Nanotechnology in Owlstone Nanotech</title><content type='html'>Owlstone is a pioneer in the marketing of chemicals in products. Owlstone detector is a revolutionary dime sensor business, which can be programmed to recognize different chemicals that may be present in very small amounts. Using cutting edge techniques and micro-nano-manufacturing, Owlstone has created a complete chemical sensor, which is much smaller and can be produced more cheaply than the products of modern technology. There are numerous applications - different branches of security and defense, industrial process, air quality control and healthcare - that depend on fast detection and measurement of chemical compounds. Owlstone is the market leader in these areas in combination with the sensor for the next generation chemical sensing products and solutions.&lt;br /&gt;Owlstone technology offers a unique combination of advantages, such as small size, low production cost, minimum consumption, reduced false alarms, and a customizable platform.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7677684394647435916?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7677684394647435916'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7677684394647435916'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/03/advanced-nanotechnology-in-owlstone.html' title='Advanced Nanotechnology in Owlstone Nanotech'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5809556473564684580</id><published>2011-03-21T06:51:00.001-07:00</published><updated>2011-03-21T06:51:48.483-07:00</updated><title type='text'>Paper Presentation on stealth techlogies</title><content type='html'>Stealth Technology, also known as LO technologies (low observable technology) is a sub discipline of military tactics and passive electronic countermeasures, which cover the methods of the staff, on board aircraft, ships, submarines and missiles, with a view to them (ideally, invisible) i.e less visible to radar, infrared, sonar and other methods.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5809556473564684580?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5809556473564684580'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5809556473564684580'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2011/03/paper-presentation-on-stealth.html' title='Paper Presentation on stealth techlogies'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8259446979043436439</id><published>2010-12-07T07:10:00.000-08:00</published><updated>2010-12-07T07:26:25.481-08:00</updated><title type='text'>Latest Paper Presentations</title><content type='html'>&lt;a href="http://pptcontent.blogspot.com/2010/04/nanotechnology.html"&gt;Paper Presentation On Nanotechnology&lt;/a&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-cse.html"&gt;CSE Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-ece.html"&gt;ECE Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-it.html"&gt;IT Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-eee.html"&gt;EEE Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-mba.html"&gt;MBA Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-civil.html"&gt;CIVIL Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for.html"&gt;MECHANICAL Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div&gt;&lt;a href="http://pptcontent.blogspot.com/2010/02/paper-presentation-topics-for-ece.html"&gt;B.TECH Paper Presentations&lt;/a&gt;&lt;/div&gt;&lt;div&gt;&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8259446979043436439?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8259446979043436439'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8259446979043436439'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/12/latest-paper-presentations.html' title='Latest Paper Presentations'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7213348389420413606</id><published>2010-11-25T23:54:00.000-08:00</published><updated>2010-11-26T00:11:40.023-08:00</updated><title type='text'>Technical Paper Presentations</title><content type='html'>&lt;div style="text-align: justify;"&gt;Wiretapping, Surveillance and Countermeasures&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/wiretapping/&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Physical and "Human-Scale" Security&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/safelocks.pdf&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Trust Management&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/trustmgt/kn.html&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Remotely-Keyed Encryption&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/frkes.pdf&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Key Escrow&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/escrowrisks98.pdf&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Network-Layer Security&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/jfk-ccs.pdf&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Cryptographic Applications&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/email.pdf&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Ciphers and Algorithms&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/internet-modes.pdf&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Cryptography Policy, Export Regulations, and Politics&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/mab-feltendecl.txt&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Peer-to-Peer Networking&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.crypto.com/papers/thesis.ps&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7213348389420413606?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7213348389420413606'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7213348389420413606'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/11/technical-paper-presentations.html' title='Technical Paper Presentations'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2346354469335497809</id><published>2010-11-24T06:16:00.000-08:00</published><updated>2010-11-24T06:27:07.994-08:00</updated><title type='text'>Nanotechnology Paper Presentation</title><content type='html'>&lt;div style="text-align: justify;"&gt;There is an unprecedented interdisciplinary convergence of scientists dedicated to the study of such a small world, we can not see it--even with a light microscope. The world is the field of nanotechnology, realm, atoms and nanostructures. Nanotechnology in-s so new, no one is really sure what comes of it even so predictions ranging from the ability to reproduce things like diamonds and food for the world will be eaten by self-replicating nanorobots. Understand the unusual world of nanotechnology, we need to get an idea of the units of measure involved. Centimeters are one hundredth of one metre, one millimeter is one-thousandth of a meter and a micrometres is a millionth of a metre, but all of these are still enormous compared to the nanoscale. A nanometer (nm) is one billionth of a metre, smaller than the wavelength of visible light and a hundred-thousandth the width of a human hair&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2346354469335497809?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2346354469335497809'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2346354469335497809'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/11/nanotechnology-paper-presentation.html' title='Nanotechnology Paper Presentation'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5317839402694923536</id><published>2010-11-14T01:53:00.000-08:00</published><updated>2010-11-14T01:58:31.803-08:00</updated><title type='text'>Advanced Data Mining</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract: (seminar) Data mining (or knowledge discovery in databases, KDD) is the process of large amounts of data for patterns that tools such as classification, Association rule mining, clustering, auto detect neural networks etc.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Data mining is used, analysis and decision-making structures especially in the case of large amounts of data e.g. for social network and shopping basket.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;What is the difference compared to the statistical methodology and Econometrics? Data mining contains many methods from the two other areas and extends it with new algorithms. Data mining generated also completely new methods of data analysis alone cannot by statistical means.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Analyx we are the data mining methods apply to large and complex data sets. In addition, we develop customised models for client problems in decision support in business and politics (see above).&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Our experienced team of data miners and business consultants can advice clients to use data mining methods to new insights and discover new information in existing records.&lt;br /&gt;&lt;a href="http://pptcontent.blogspot.com/2010/11/advanced-data-mining.html"&gt;Download Advanced Data Mining Here&lt;/a&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;http://www.it.yu.edu.jo/qradaideh/CIS667/New%20Lectures.rar&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5317839402694923536?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5317839402694923536'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5317839402694923536'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/11/advanced-data-mining.html' title='Advanced Data Mining'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2399471184573834871</id><published>2010-11-07T20:46:00.000-08:00</published><updated>2010-11-07T20:59:57.764-08:00</updated><title type='text'>BlueTooth</title><content type='html'>&lt;div style="text-align: justify;"&gt;BLUETOOTH Is the well-known wireless electronic protocol that is used to transfer data between the shortest distance of fixed and mobile services. It uses radio waves to transfer create PAN (PERSONAL AREA networks). Actually, it was meant to be a wireless alternative for RS232 port. The most striking feature of Bluetooth it is able to several different devices to solve the problems of the synchronization.&lt;br /&gt;BLUETOOTH is the most commonly used name now a days, because it is now the most inevitable part of mobile phones. The name Bluetooth came from a Swedish word. Bluetooth logo is bind rune with German rune.AS said before that makes use of radio technology. Bluetooth chops the data before you get sent it and convert it to normal data in the correct destination in a clear frequency have reached. It can exchange information between devices such as digital cameras, mobile phones, phones, laptops, PCs, printers, global positioning system receivers etc.Bluetooth license and specifications have been produced by the Bluetooth Special Interest Group (BSIG). Actually Bluetooth primarily designed for low power consumption and low data transfer at distance. Suddenly I made a new boom in the market, because it is very cheap and convenient. But later the distance between the data transfer was varied. Usually they are divided into three different classes depends on the range. Class 1, the exchange of information within a range less than 100 m, the class 2 range is less than 22 m and class 3 ranges up to 6 m. Bluetooth has two versions as well. It is version 1. 2, and version 2. 0 + EDR.Bluetooth will find application in the field of wireless control and communications, wireless networking between PCs, the transfer of files, contact details, for controlling the enormous use of infrared, so wireless bridge between Ethernet networks etc.Bluetooth was developed in 1994 by Jaap Haartsen and Sven Mattisson, representing the employees of SONY ERICCSON Mobile platforms. Bluetooth had come across different modifications and new updations. Bluetooth versions such as Bluetooth, Bluetooth 1 1. 1, Bluetooth 1. 2, Bluetooth 2. 0, Bluetooth 2. 1, 3 and Bluetooth. 0 are the best examples of this change. Each of these is updated in quality and process depending on the needs of people.Now we can not think of electronic equipment without Bluetooth. In short it is a gadget set not quite complete without Bluetooth in it. Let's wait for the new emerging technologies in this area that the gadget market could beat.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2399471184573834871?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2399471184573834871'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2399471184573834871'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/11/bluetooth.html' title='BlueTooth'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7297566599214176130</id><published>2010-10-11T00:54:00.000-07:00</published><updated>2010-10-11T01:34:12.406-07:00</updated><title type='text'>Nanotechnology Entire Info</title><content type='html'>&lt;div style="text-align: justify;"&gt;Introduction to the seminar on nanotechnology &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. Nanotechnology precision is defined as production of atomic or molecular scale devices.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. Equipment with minimum feature size (nm) as products of nanotechnology are less than 100 nanometers.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. A nanometer is one billionth of A meter (10-9 m) and is the unit of length, the for describe the size of individual molecules is generally best.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;4. The first revolutionary applications of nanotechnology are in computer science and medicine.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nanotechnology in the IT sector &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. A branch of computer science that is rapid progress in nanotechnology grant is the simulation of molecular scale events.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. Molecular simulation typically enormous efforts is to be able to offer and predict data about molecular systems would require physically.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. One effectively nanoscale systems can model by organizing virtual atoms in a molecular simulation environment.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;4. Systems nano-scaled simulation and theory infact provided for new characteristics, the new design materials and systems for nanotechnology applications has resulted.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For example, Carbon nanotubes applications in molecular electronics nano-technology in the medical field of molecular medicine, Bioinformatics and Biomolecular nanotechnology are rapidly heal our ability and stay healthy.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Biotechnology: &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. all living organisms consist of molecules, molecular biology has become the primary focus of biotechnology.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. Living systems are able to live because of the huge amount of highly ordered molecular machines from which they are created.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. The central dogma of molecular biology indicating that the information required create a living cell or organism in the DNA is stored.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;4. This information is transferred from DNA to proteins by the processes called transcription and translation.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;5. Molecular Biology is a field where the study of these interactions have been effective to the discovery of many pharmaceuticals led enormously in the disease to cure.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;ROLE OF NANOTECH: &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. most importantly, it shows the capabilities of molecular scale machines. Copy, borrowing and learn tricks from nature is one of the primary techniques of nanotechnology uses and has called Biomimicry.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;(2) Secondly, our ability to design synthetic, semi-synthetic and natural molecular machines is to preserve an enormous potential for the disease to heal and life.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nanotechnology in NANO robot Robotics: &lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nano robot theoretical microscopic devices that are on the scale of nanometers measured.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nanomedicine: are so tiny that you can easily search the human body &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. Nano robot. Scientists report the outer of a Nano robot probably be built, the carbon atoms in a diamondoid structure because the inert properties and strength.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. May be a source of propulsion and the Nano robot have other biochemical or molecular parts glucose or natural body sugar and oxygen depending on its task.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. Nano robot will have at least rudimentary two-way communication; respond to sounds. and will get in the location, power, or even rewrite statements from an external source of sound waves.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;A network might be strategically, place special stationary Nano robot throughout the body, each active Nano robot logging, how to do it, then reporting these results so that an interface to track all devices in the body.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;(5) A doctor could not only a patient's progress monitor but the statements of change Nano robot in vivo to progress to different stages of healing. When the operation completes, the Nano robot from the body would be rinsed.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;RECENT development of molecular nanotechnology (MNT).&lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. Robert A. Freitas Jr., nanomedicine, introduces Nano robot in Nano-factories is an example of a type of medical Nano robot he developed that would act as a red blood cell.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. Full Nano robot the Freitas dubbed a Respirocyte can consists of 18 - billion atoms and keep up to 9 - billion-O2 and CO2 molecules or only 235 times more than a human red blood cells.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. This increased capacity is supported because of the diamond structure possible larger prints than a human cell.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;4. Sensors on the Nano robot would the molecular rotors release gases or earn, depending on the needs of the surrounding tissues cause.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;5. A healthy dose of this nano robot in a patient in solution, Freitas injected explains, would allow someone, easily sit under water near the outlet of the backyard pool for almost four hours or run at full speed for 15 minutes before taking a breath.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Advantage:-&lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. Raw material for the production of nano robot would be almost free of charge, and the process that virtually pollution-free, a Nano robot which extremely affordable and very attractive technology.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. Nano robot in medicine to keep plenty of promise of eradication of the disease on the aging process applied reverse (wrinkles, loss of bone mass and age-related conditions are treatable at the cellular level.)&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. In large swarms could clean to repair the air of carbon dioxide, the hole in the ozone layer, restore scouring water pollutants and our ecosystems.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nanotechnology in electronics &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. as transistors as such as the metal-oxide semiconductor field effect transistor (MOSFET) one of the primary components used in integrated circuits) consists of smaller, change the properties as well as the production costs with the scale.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2.Currently, UV light is used to create the Silicon circuits with a lateral resolution around 200 nm (wavelength UV light).&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. As the circuits must shrink 100 nm new manufacturing methods below be created, which costs.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;4.Furthermore, once the circuit size reaches only a few nanometers, quantum effects begin such as tunneling, more importantly, what changes dramatically the ability for the computers to function normally.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;(5) Thus, novel methods for computer chip production have been and are of the microchip is intensively for manufacturers.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nano level &lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. Aims, aerial image with regard to the important parameters like e.g. normalized picture log slope, contrast and spots/min feature size to come with the most robust method of gray scaled pattern generation with substrate angry to quantify analog modulation of micromirrors.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;Nano springs (belt) aims, aerial image with regard to the important parameters like e.g. normalized picture log slope, contrast and spots/min feature size to come with the most robust method of gray scaled pattern generation with substrate angry to quantify analog modulation of micro mirrors.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;br /&gt;&lt;/div&gt;&lt;div style="text-align: justify;"&gt;1. Nanotubes &amp;amp; Nanobearings this is a computer rendered model of a partially telescoped Nanotube with a Leonardo DaVinci manuscript as a background.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;2. In the manuscript, DaVinci considers the construction of bearings and the frictional forces that could be encountered in bearings and sliding surfaces.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;3. He has a drawing of a constant spring (a mass hanging from a string through a role).&lt;/div&gt;&lt;div style="text-align: justify;"&gt;4. A nanotube camp may be the ultimate realization of some of DaVinci's dreams: here is the same model without the DaVinci manuscript silently NANO MOTOR 1. The small Nanomotor is&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7297566599214176130?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7297566599214176130'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7297566599214176130'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/10/nanotechnology-entire-info.html' title='Nanotechnology Entire Info'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8455981988646185635</id><published>2010-10-02T01:09:00.000-07:00</published><updated>2010-10-02T01:11:39.945-07:00</updated><title type='text'>Digital Light Processing</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar ppt Digital Light Processing (DLP) is a registered trademark of Texas Instruments, which is a technology used in some television and video projectors. It was originally developed in 1987 by Dr. Larry Hornbeck of Texas Instruments. DLP is used in DLP front projectors (small standalone projection units) and DLP rear projection TV. DLP, LCD and LCoS are the current display technologies behind rear-projection television, which has supplanted CRT projectors back. These rear-projection technologies compete against LCD and plasma flat screen in the market for HDTV. Single-chip version of the DLP and 3LCD are the two main technologies used in modern digital projector color, with the two technologies used in more than 95% of projectors sold in 2008. DLP is also one of the technologies used in digital cinema projection. There are two main methods by which DLP projection systems create a color image: those used for single-chip DLP projectors, and those used by the three-chip projectors. A third method, the sequential illumination by three colored LEDs are being developed, and is currently used in televisions manufactured by Samsung. Yet another method, color laser printers, is being used by Mitsubishi LaserVue products&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8455981988646185635?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8455981988646185635'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8455981988646185635'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/10/digital-light-processing.html' title='Digital Light Processing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7736297709794414273</id><published>2010-10-02T01:05:00.000-07:00</published><updated>2010-10-02T01:08:58.293-07:00</updated><title type='text'>Digital Imaging</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar ppt digital image processing and digital imaging is to create digital images, usually a physical attack. The term is often assumed to refer to or include the processing, packaging, storage, printing and displaying such images. A digital image can be created directly from a camera or similar physical attack. Alternatively, you can purchase the second instrument analog image, such as photographs, photographic film or printed on paper with a scanner or similar device. Many technical images, such as acquired tomographic equipment, side-scan sonar, or radio telescopes, the treatment is very complex image data. This digitization of analog data in the real world is known for digitizing, and is one of the sampling (discretization) and quantization. Finally, a digital image can also be calculated from a geometric model or mathematical formula. In this case, the image synthesis is the more appropriate name, and is often referred to as representation. digital authentication image is a [citation needed] new problem for suppliers and producers of high-resolution digital images, such as health care organizations, agencies of law enforcement and insurance companies. There are emerging methods of forensic science to analyze a digital image and determine if it has changed.&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7736297709794414273?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7736297709794414273'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7736297709794414273'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/10/digital-imaging.html' title='Digital Imaging'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6640133166206766263</id><published>2010-10-02T01:00:00.000-07:00</published><updated>2010-10-02T01:05:05.941-07:00</updated><title type='text'>Digital Hubbub</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar ppt With regard to consumer electronics is considered the last talk of the town is on digital noise. His device is used as a hub to connect all the different home units. Together with the hub binding capacity also includes several functions such as registration charge of the game, etc. flow of data from various electronic devices in the house. Electronic devices that include a TV, VCR, camcorder, computer, etc. It consists of software and hardware. The equipment must be in a single CPU. Digital signal processing chips, memory, and interact with the various ports. The software has three layers of the inner layer, intermediate layer and the outer surface. These layers are divided on the basis of the different activities they should do. Several companies are now trying to make the dream possible, because the company that led to the digital consumer confusion. Moxi Digital (Palo Alto, California) has proven to be the so-called media center at the Consumer Electronics Show in January 2002. E &amp;#39;a, PVR DVD / CD player and an innovative user interface of the wireless home network software distribution. In February, Dige Inc. (Kirkland, Washington), start-up is controlled by Microsoft co-founder Paul Allen, has announced plans to build a surprisingly like a central one for Motorola Inc. (Schaumburg, Illinois) and cable company Charter Communications Inc. (St. Louis, Mo.), also controlled by Allen. In March, Moxi and merged and named Dige Dige.&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6640133166206766263?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6640133166206766263'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6640133166206766263'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/10/digital-hubbub.html' title='Digital Hubbub'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8208731232847908420</id><published>2010-10-02T00:54:00.000-07:00</published><updated>2010-10-02T01:00:13.233-07:00</updated><title type='text'>Digit recognition using neural network</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar ppt The aim of this network is to recognize the numbers one-piece 7-digit LED model. To this end, the network has seven inputs and eleven outputs. Correspond to: 1) LED digit segments is on or off and 2) the outcome of this figure is recognized by the network. Try changing the number by clicking on its components, then test it on the network without training. Most likely be recognized as more digits. The default network is created with 9 nodes in the hidden layer, a rate parameter of 0.5, and a noise parameter of 0.05. If you are really interested in what they mean, soon I&amp;#39;ll put a brief discussion of the terms, including a discussion of why the noise is a good thing. (Note - this has been pending for 18 months -. probably will not happen soon) Click on &amp;quot;Create a new network, you can create your own network with the parameters you specify. There are limits on them (noted next to the field) and entry out of bounds will be ignored. These black nodes in the bottom of the input and hidden layer nodes are threshold. They are always at a value of -1 and are used to implement the trigger as a burden on the network . After creating a network by pressing the &amp;quot;Train Network&amp;quot; button, doing this is education and training. And then by the numbers 0 to 9 for the network, test them and compare the actual production of the desired output. The desired output of any number is exactly one node, which corresponds to the value of that number, is on and all the others are off. Any errors that cause the network to provide the weights between the nodes is the number of weight proporational nodes, value, and the derivative of the weight of the production. This continues until all 10 digits, error between actual and expected is very low. At this point the network is trained. Try to give the network a certain income is not a figure and see what has been recorded (if any). This gives an idea of what characteristics of the network must learn to recognize.&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8208731232847908420?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8208731232847908420'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8208731232847908420'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/10/digit-recognition-using-neural-network.html' title='Digit recognition using neural network'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7623629724471420184</id><published>2010-10-02T00:08:00.000-07:00</published><updated>2010-10-02T00:52:53.804-07:00</updated><title type='text'>Dense Wavelength Division Multiplexing</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar : ppt A DWDM terminal multiplexer. The multiplexer device actually contains a transponder wavelength conversion for each wavelength of the signal is. conversion wavelength transponders to receive optical input signal (ie, from a client layer SONET / SDH or other signal), converts this signal into the electrical domain, and retransmit the signal of 1,550 nm laser band. (DWDM systems contained 4 or 8 wavelength transponders convert to mid 1990. In 2000 or so, commercial systems capable of carrying 128 signals available.) Multiplexer terminal also contains an optical multiplexer, which is different from 1550 nm band signals and places them in a single fiber (eg fiber SMF-28). The terminal multiplexer may or may not support a local EDFA for optical signal power amplifier multi-wavelength. A DWDM terminal demultiplexer. The terminal demultiplexer breaks the multi-signal wavelength into individual signals and outputs on the fibers separate systems for client-layer (eg SONET / SDH) to register. Originally, this demultiplexing performed entirely passively, except for telemetry, as most of SONET systems can receive signals from 1550-nm. But to allow the transmission to remote client-layer (and allow the determination of domain digital signal integrity) such demultiplexed signals are usually sent to O / I / O output transponders prior to being sent to their systems customer-base. Often, the functionality of transponder output has been integrated into the input of the transponder so that most commercial systems have transponders that support bi-directional interface on both 1550-nm (inner) side, and external ( ie client-cons).&lt;br /&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7623629724471420184?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7623629724471420184'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7623629724471420184'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/10/dense-wavelength-division-multiplexing.html' title='Dense Wavelength Division Multiplexing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7425461364786904626</id><published>2010-09-18T03:41:00.001-07:00</published><updated>2010-09-18T03:41:16.181-07:00</updated><title type='text'>Wind-diesel hybrid power system</title><content type='html'>Wind-diesel hybrid combines the power of the diesel generators and&lt;br&gt;wind turbines In general, parallel to the ancillary equipment, such as&lt;br&gt;energy storage, power converters, and various parts of the production&lt;br&gt;of electricity. Their aim is to increase capacity and reduce costs and&lt;br&gt;environmental impact of electricity production in remote communities&lt;br&gt;and areas that are not connected to the mains.Wind-diesel hybrid&lt;br&gt;systems in reducing dependence on oil, which creates pollution and is&lt;br&gt;costly to transport.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7425461364786904626?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7425461364786904626'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7425461364786904626'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/wind-diesel-hybrid-power-system.html' title='Wind-diesel hybrid power system'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5168090826182072981</id><published>2010-09-18T02:49:00.005-07:00</published><updated>2010-09-18T03:09:16.313-07:00</updated><title type='text'>Wind excited buildings and the effect of structural eccentricity</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar Wind tunnel model tests aeroelastiset CAARC high building standards related to translational-torsional motion with a degree of three degrees of freedom hinge base aeroelastiset (BHA), the model was adopted. Experimental study of the effects of frequency ratio cross-wind/torsional and the presence of eccentricity between the center of mass and center of rigidity caused by the reaction of the wind characteristics and excitation mechanisms of the wind has been made. The results showed significant effects cross-wind/torsional frequency ratio has been normalized standard deviation along the wind, crosswind and torsional responses. In addition, frequency ratio cross-wind/torsional and eccentricity between the center mass and center of stiffness showed a significant effect on the transfer of vibrational energy between the elements of an answer.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5168090826182072981?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5168090826182072981'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5168090826182072981'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/wind-excited-buildings-and-effect-of.html' title='Wind excited buildings and the effect of structural eccentricity'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6549224048147500919</id><published>2010-09-18T02:49:00.004-07:00</published><updated>2010-09-18T03:04:37.515-07:00</updated><title type='text'>Wind From The Sun-Power Plant</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar Hybrid System: Sun&amp;#39;s Wind is a new technology for wind and solar power. This hybrid system turns sunlight into heat, then use that heat to make the horizontal wind within the large diameter pipes. Wind energy is converted into the pipe through a series of turbines.This no wind at all the same as the solar chimney. There is no chimney and large greenhouse-like glass roof.The Sun Wind power idea is not patented and is freely available to everyone. Are invested in this technology to the public at large, so anyone interested in developing the idea of it can be worked. All interested researchers or experts to carry out tests or to establish small-scale test facility. Anyone interested or companies able to develop a commercial version of technology.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6549224048147500919?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6549224048147500919'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6549224048147500919'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/wind-from-sun-power-plant.html' title='Wind From The Sun-Power Plant'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5954361911665663965</id><published>2010-09-18T02:49:00.003-07:00</published><updated>2010-09-18T03:00:42.831-07:00</updated><title type='text'>Wireless LED</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract:Seminar Billions of LEDs annually produced visible, and the emergence of high-brightness AlGaAs and AlInGaP devices have given rise to many new markets. The surprising increase in activity in relatively old, LED technology has been boosted by the introduction of AlInGaP devices. Newly developed AlGaInN materials have improved the performance of blue-green LED, which culminates with light-emitting much higher than incandescent lamps. Such progress has led to the production of large surfaces in exterior color LED displays with various industrial applications.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5954361911665663965?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5954361911665663965'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5954361911665663965'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/wireless-led.html' title='Wireless LED'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-555674994916772647</id><published>2010-09-18T02:49:00.002-07:00</published><updated>2010-09-18T02:59:24.938-07:00</updated><title type='text'>Wireless Markup Languages(WML)</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract:Seminar Wireless Markup Language is a bit like HTML (HyperText Markup Language), providing navigation support, data entry, links, text and presentation of images and forms. A WML document known as &amp;quot;deck.&amp;quot; The data is structured on the bridge one or more &amp;quot;cards&amp;quot; (pages) - each representing a single user interaction. The introduction of &amp;quot;bridge&amp;quot; and &amp;quot;map&amp;quot; of online communities and mobile phone software is the result of user interface and interaction with wireless services from having to comply with the requirements of the law two or more nations. [Citation needed] WML decks are stored on a Web server to serve ordinary trivially set the MIME type text / html vnd.wap.wml addition and variants. WML cards at the request of a device are accessible via a bridge of WAP gateway&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-555674994916772647?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/555674994916772647'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/555674994916772647'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/wireless-markup-languageswml.html' title='Wireless Markup Languages(WML)'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7824102274156783201</id><published>2010-09-18T02:49:00.001-07:00</published><updated>2010-09-18T02:53:22.840-07:00</updated><title type='text'>MIMO WIRELESS COMMUNICATION SYSTEM</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract:Seminar When the diversity of user stations (Stas) simultaneously communicate with base station (AP) via SDMA (Space Division Multiple Access) channel MIMO wireless communication system, these control Stas transmission of signals, so that each character has a different number of antennas AP. (Note that many of these Stas is equal to or less than the number of antennas to the access point.) This eliminates the need to Perform MIMO AP, according to the AP for Properly receive and demodulate the signals even if they differ from the carrier frequency and timing transmission, which would otherwise lead to degradation or failure of communication.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7824102274156783201?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7824102274156783201'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7824102274156783201'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/mimo-wireless-communication-system.html' title='MIMO WIRELESS COMMUNICATION SYSTEM'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-9154071876211560148</id><published>2010-09-18T02:49:00.000-07:00</published><updated>2010-09-18T02:50:41.755-07:00</updated><title type='text'>Written-Pole® technology</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract:Seminar Written-Pole ® technology is a revolutionary, but fundamentally simple approach to improve the performance of engines and generators. The use of technology-Pole ® written frees engineers from one of the most fundamental limitations for designers of conventional induction and synchronous machines. Unlike traditional models, where magnetic poles are determined by the geometry of the cage rotor and the stator windings, coil written ® machines incorporate a unique concept which allows to optimize the geometry of the rotor magnet for Peak Performance at the speed of operation of the machine varies.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-9154071876211560148?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9154071876211560148'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9154071876211560148'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/written-pole-technology.html' title='Written-Pole® technology'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5947829961284763573</id><published>2010-09-18T02:35:00.003-07:00</published><updated>2010-09-18T02:49:24.427-07:00</updated><title type='text'>MIMO multiple-input and multiple-output</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract:Seminar Radio and multiple-input multiple-output, or MIMO (pronounced my-General, or moh-moh), the use of multiple antennas and the transmitter and receiver to improve communication performance. And &amp;#39;one of the many forms of smart antenna technology. MIMO technology has attracted the attention of wireless communications because it provides significant increases data transmission speed and connection range without additional bandwidth or transmission power. To reach this high level of spectral efficiency (more bits per second per hertz of bandwidth) and link reliability or diversity (reduced fading). Because of these properties, MIMO is an important part of modern wireless communication standards such as IEEE 802.11n (WiFi), 4G, 3GPP Long Term Evolution, WiMAX and HSPA +.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5947829961284763573?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5947829961284763573'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5947829961284763573'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/mimo-multiple-input-and-multiple-output.html' title='MIMO multiple-input and multiple-output'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2365746200905398899</id><published>2010-09-18T02:35:00.002-07:00</published><updated>2010-09-18T02:46:20.891-07:00</updated><title type='text'>XScale</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar The XScale, a microprocessor core, is Intel and Marvell ARMv5 application architecture, and consists of several distinct families: IXP, IXC, IOP, PXA and CE (see below). Intel PXA family sold to Marvell Technology Group in June 2006. [A] The XScale architecture is based on the ISA ARMv5TE no floating point instructions. XScale uses a seven-stage integer and an eight-stage memory superpipelined microarchitecture. It is the successor to the Intel StrongARM line of microprocessors and microcontrollers, including Intel acquired Digital Semiconductor division in December as the side effect of a lawsuit between the two companies. Intel used the StrongARM to replace their line of RISC processors patient success, the i860 and i960.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2365746200905398899?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2365746200905398899'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2365746200905398899'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/xscale.html' title='XScale'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-916903774116241032</id><published>2010-09-18T02:35:00.001-07:00</published><updated>2010-09-18T02:45:00.640-07:00</updated><title type='text'>xMax</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : Seminar Xmax developed by XG Technology, Inc. is a cognitive radio-based mobile VoIP and data system that operates in 900 MHz unlicensed ISM band (928MHz-902). Xmax is built on a protocol from end to end Internet Protocol (IP) system infrastructure, which includes a number of base stations, mobile switching centers (MSC), telephones and modems. VoIP Industry Expert Rich Tehrani test leads Xmax mobile VoIP pilot operated by the company in Fort Lauderdale, FL. His last article, published on TMCnet at (referenced below) concluded: &amp;quot;Xmax worked well and is real. When you know that this company may have found a way to take a frequency struggling with the garbage and wireless transform it into a wireless operating voice and data network as you begin to see how a game could be the change that the wireless industry&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-916903774116241032?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/916903774116241032'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/916903774116241032'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/xmax.html' title='xMax'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5223968675681338377</id><published>2010-09-18T02:35:00.000-07:00</published><updated>2010-09-18T02:43:07.466-07:00</updated><title type='text'>ZigBee Networks</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract : (seminar) ZigBee is a low-cost, low power, wireless mesh network standard. First of all, thanks to low-cost technology can be used widely in wireless control and monitoring applications. Second, low power, allowing the use of a longer life, smaller batteries. Thirdly, the eye network will provide high reliability and more abundant. ZigBee Alliance is an association of companies working together to enable reliable, convenient and low-power wireless network monitoring and control products based on open [global standard 1]. Like its main task, the standard body that defines the ZigBee, and even the public application profiles, which allows several OEMs to create interoperable products. Application profiles for the current or future publication in either ar&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5223968675681338377?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5223968675681338377'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5223968675681338377'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/zigbee-networks.html' title='ZigBee Networks'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5391222284757285209</id><published>2010-09-18T02:34:00.000-07:00</published><updated>2010-09-18T02:41:52.383-07:00</updated><title type='text'>Z-Wave</title><content type='html'>&lt;div style="text-align: justify;"&gt;Abstract: (seminar)  Z-Wave is powered wireless technology has been designed specifically for remote control applications. Unlike Wi-Fi and other wireless LAN based on IEEE 802.11, which was designed primarily for high-bandwidth data transmission, Z-Wave RF system is working part-GHz frequency band and is optimized for commands light, as on-off (such as light switch or appliance), and increased lower-(like volume control or thermostat) with the ability to add meta data communication device. Since the Z-Wave operates in addition to the crowded 2.4 GHz frequency, is little affected by interference from a common family of wireless electronics that operate in this area. Z-Wave is the same area (900), some mobile phones and would be prone to interference from these devices. This freedom is the domestic disturbance enables standardized management of medium to low bandwidth that can be trusted, in parallel with common wireless devices.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5391222284757285209?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5391222284757285209'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5391222284757285209'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/z-wave.html' title='Z-Wave'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-394122625982140113</id><published>2010-09-14T04:31:00.000-07:00</published><updated>2010-09-14T04:50:31.898-07:00</updated><title type='text'>Nanotechnology : Cryonics On Way To Raising The Dead</title><content type='html'>&lt;div style="text-align: justify;"&gt;Today, technology plays a key role in all areas of life. Raise the standards of technology in many areas was a man of high reputation today. But the currently available technology capable of interacting with atoms, particles so minute. This nanotechnology has developed. Cryonics is simply to raise the dead - will make them alive. First, to preserve life, then using the molecular-level machines based on nano technology, we can revive the patient repair damaged cells.In this technical paper we would like to discuss cryonics, cryonics as the process goes and why nanotechnology has been used and description of the molecular machine that can repair damaged cells. Therefore, cryonics is the region where most work takes place in the future.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;&lt;a href="http://www.ziddu.com/download/11665828/NanoTechnology.doc.html"&gt;click here to download nanotechnology paper presentation&lt;/a&gt;&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-394122625982140113?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/394122625982140113'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/394122625982140113'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/nanotechnology-cryonics-on-way-to.html' title='Nanotechnology : Cryonics On Way To Raising The Dead'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1834444553339399571</id><published>2010-09-09T04:47:00.000-07:00</published><updated>2010-09-09T04:48:08.839-07:00</updated><title type='text'>Nanotechnology Reference</title><content type='html'>&lt;div style="text-align: justify;"&gt;Nanotechnology refers to the manipulation of matter at the nanoscale (one billionth of a meter). Nanoscience active in the field of atoms and molecules. Currently, commercial nanotechnology involves materials science (ie, the researchers were able to make materials that are stronger and more durable building ownership changes that occur when substances are reduced to nanoscale dimensions) .. There is a critical need to assess the social implications of all nanotechnologies in the meantime, the ETC Group believes that the suspension should be placed on research with molecular self-assembly and self-replication.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1834444553339399571?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1834444553339399571'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1834444553339399571'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/nanotechnology-reference.html' title='Nanotechnology Reference'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1137478099723994634</id><published>2010-09-09T04:06:00.000-07:00</published><updated>2010-09-09T04:07:31.885-07:00</updated><title type='text'>static and dynamic addressing</title><content type='html'>&lt;div style="text-align: justify;"&gt;Static IP addressing occurs when an ISP permanently assigns one or more IP addresses for each user. These addresses do not change over time. However, if a static IP address is assigned but not used will be lost. Since ISPs have a limited number of addresses of these agencies sometimes have to make more efficient use of their IP address addresses.Dynamic allows ISPs to effectively utilize their address space. Using dynamic IP addressing, the IP addresses of the computers of individual users can change over time. If a dynamic address is not used, can be automatically transferred to another computer if necessary.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1137478099723994634?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1137478099723994634'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1137478099723994634'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/static-and-dynamic-addressing.html' title='static and dynamic addressing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1226561515301713224</id><published>2010-09-09T04:04:00.000-07:00</published><updated>2010-09-09T04:05:02.619-07:00</updated><title type='text'>Network Security Network Address Translation</title><content type='html'>&lt;div style="text-align: justify;"&gt;Network Address Translation (NAT) is a way to hide the IP addresses of private network, Internet, leaving the computer accessing the Internet. NAT can be used in different ways, but a method frequently used by home users is called mask. &amp;quot;Pretend that one or more NAT devices on the LAN can be viewed by an outside Internet IP address. This allows multiple computers on your home network using a single cable modem or DSL without the Internet to provide more than one IP address . Using this method, IP address, ISP-assigned static or dynamic. Most firewalls support NAT masquerading.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1226561515301713224?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1226561515301713224'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1226561515301713224'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/network-security-network-address.html' title='Network Security Network Address Translation'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2259974510574853323</id><published>2010-09-09T04:01:00.000-07:00</published><updated>2010-09-09T04:03:26.298-07:00</updated><title type='text'>Antivirus For My Network Security</title><content type='html'>&lt;div style="text-align: justify;"&gt;Several antivirus programs, which operate in different ways, depending on how the seller has decided to implement the software. What they have in common, however, is that they are looking for models for all files on a memory card or computer, indicate the possible presence of a known virus. Antivirus packages know what to look for ways of virus profiles  which vendor.New viruses are discovered every day. The effectiveness of antivirus software depends on having the latest virus profiles installed on your computer to look for recently discovered viruses. It is important to keep updated profiles.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2259974510574853323?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2259974510574853323'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2259974510574853323'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/antivirus-for-my-network-security.html' title='Antivirus For My Network Security'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4591338343835907216</id><published>2010-09-09T03:58:00.000-07:00</published><updated>2010-09-09T04:00:50.487-07:00</updated><title type='text'>Overtaking My Computer With Computer Security</title><content type='html'>&lt;div style="text-align: justify;"&gt;Unfortunately, intruders are always looking for new vulnerabilities to use the software. But it is easy to use, obtain and install patches, or correctly identify the software to work more safely. Most incident reports of computer break-ins received CERT / CC could have been prevented if system administrators and users kept their computers with security patches and updates when fixes.Also some programs have default settings that allow users to access the computer if you change settings, it is safer. Examples include chat programs that allow execution of commands on a computer or web browsers that could allow anyone could be harmful programs running on your computer where you clicked.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4591338343835907216?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4591338343835907216'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4591338343835907216'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/overtaking-my-computer-with-computer.html' title='Overtaking My Computer With Computer Security'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-9029640094609358157</id><published>2010-09-09T03:56:00.000-07:00</published><updated>2010-09-09T03:57:49.519-07:00</updated><title type='text'>Computer Security Should Be Known</title><content type='html'>&lt;div style="text-align: justify;"&gt;Computer security is the process of preventing and detecting unauthorized use of your computer. Prevention measures help prevent unauthorized users (also known as &amp;quot;intruders&amp;quot;) from accessing any part of your computer system. Detection helps you determine if someone tried to break into your system, if they succeeded, and what done.We can use computers for everything from banking and investing to shopping and communicating with others via email or programs chat. Although you can not consider your communications &amp;quot;top secret&amp;quot;, you will not want strangers reading your email, using your computer to attack other systems, sending false e-mail from your computer, or examining personal data stored on your computer (eg financial statements)&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-9029640094609358157?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9029640094609358157'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9029640094609358157'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/computer-security-should-be-known.html' title='Computer Security Should Be Known'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1149339062206290693</id><published>2010-09-09T03:48:00.000-07:00</published><updated>2010-09-09T03:50:04.611-07:00</updated><title type='text'>Secure Network Security</title><content type='html'>&lt;div style="text-align: justify;"&gt;Security is a very difficult subject. Everyone has a different perception of what and levels of risk are acceptable. The key to building a secure network is to define what it means to your organization&amp;#39;s security. When set, everything that goes on the network can be assessed under this policy. Projects and systems can then be decomposed into their constituents, and it is much easier to determine if what is proposed will conflict with your security policy and practices. It is important to get their feedback to understand what can be improved, and it is important to let them know why what has been done has been done, the nature of risks that are considered unacceptable and what is done to reduce its exposure to them.Security is everyone business and only with the cooperation of all, an intelligent policy and practice, it would be possible to achieve.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1149339062206290693?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1149339062206290693'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1149339062206290693'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/09/secure-network-security.html' title='Secure Network Security'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8570790038949965120</id><published>2010-08-25T06:21:00.000-07:00</published><updated>2010-08-25T06:22:21.917-07:00</updated><title type='text'>pervasive computing</title><content type='html'>&lt;div style="text-align: justify;"&gt;Pervasive computing is the trend of increasingly ubiquitous (another name for the movement is ubiquitous computing), computer equipment connected to the environment, a trend that is caused by a convergence of advanced electronic - and particularly the wireless technologies - and the Internet. computing devices are not intrusive of personal computers as we tend to think of them, but very tiny - even invisible - mobile devices or embedded in almost any subject imaginable, including cars, tools, equipment, clothing and various consumer goods - full statement through increasingly interconnected networks. According to Dan Russell, director of science and user experience of IBM Almaden Research Center Group 2010, computers have become so naturalized in the environment that people do not realize that using computers.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8570790038949965120?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8570790038949965120'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8570790038949965120'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/pervasive-computing_25.html' title='pervasive computing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6957547928773017977</id><published>2010-08-25T06:19:00.000-07:00</published><updated>2010-08-25T06:20:42.728-07:00</updated><title type='text'>pervasive computing</title><content type='html'>&lt;div style="text-align: justify;"&gt;The idea that technology is moving beyond the personal computer, everyday devices Embedded Technology and connectivity, such as computer equipment gradually smaller and more powerful. Also known as ubiquitous computing, information technology is the result of an explosion of information technology are moving at speed - a trend all human beings and certain natural products with hardware and software. Exceeds the realm of computers is an idea that almost all devices, equipment, tools, clothes and cars in the homes of the human body is a cup of coffee, can become chip to connect the device to an infinite network of other devices.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6957547928773017977?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6957547928773017977'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6957547928773017977'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/pervasive-computing.html' title='pervasive computing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5029672367764357830</id><published>2010-08-25T06:18:00.000-07:00</published><updated>2010-08-25T06:19:28.231-07:00</updated><title type='text'>Pervasive and Mobile Computing</title><content type='html'>&lt;div style="text-align: justify;"&gt;pervasive computing, often known as a synonym for ubiquitous computing is a new area of research that brings revolutionary paradigms for computing models in the 21 century. massive development of these technologies as wireless communications and networks, mobile computing and handheld devices, embedded systems, laptops, sensors, RFID tags, smart spaces, middleware, software agents and others, which led to development of pervasive computing platforms as natural successor to mobile computing systems. The goal of ubiquitous computing is to create ambient intelligence where network devices embedded in the environment provides discreet support and services of all time, which will improve people's experience and quality of life without explicit attention to communication and technology base.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5029672367764357830?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5029672367764357830'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5029672367764357830'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/pervasive-and-mobile-computing.html' title='Pervasive and Mobile Computing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4900789621416009007</id><published>2010-08-25T06:04:00.000-07:00</published><updated>2010-08-25T06:18:14.910-07:00</updated><title type='text'>Centre for Pervasive Computing</title><content type='html'>IT is the next generation of computing environments, information and communication technologies throughout the world for all, all times.Information and communication should be part of environments: from toys, milk cartons and desktops Car, factories and whole city areas - integrated processors, sensors and actuators connected via high speed networks and combined with new display devices ranging from projections directly into the eye to view large screens. It goes beyond the ubiquitous computing user interfaces implosion traditional, first in small appliances and equipment and the blast in a large-scale walls, buildings and furniture. Activities at the center are based on the experience of a wide range of research areas relevant to ubiquitous computing.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4900789621416009007?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4900789621416009007'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4900789621416009007'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/centre-for-pervasive-computing.html' title='Centre for Pervasive Computing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4651989943996739947</id><published>2010-08-25T05:54:00.000-07:00</published><updated>2010-08-25T06:03:52.449-07:00</updated><title type='text'>Latest Paper Presentation Topics</title><content type='html'>LATEST PAPER PRESENTATION TOPICS :&lt;br /&gt;The below list shows you the latest paper presentation topics, where many college institutions are preferring for their students.&lt;br /&gt;Ad hoc &amp; Wi-Fi Networks&lt;br /&gt;Artificial Intelligence &amp; Machine learning&lt;br /&gt;Cloud Computing&lt;br /&gt;Data Warehousing &amp; Data Mining&lt;br /&gt;Distributed Systems&lt;br /&gt;Image Processing &amp; Bio Metrics&lt;br /&gt;Nano Computing&lt;br /&gt;Parallel &amp; Grid Computing&lt;br /&gt;Pervasive Computing&lt;br /&gt;Recent Trends in Network Security&lt;br /&gt;Knowledge Management&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4651989943996739947?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4651989943996739947'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4651989943996739947'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/latest-paper-presentation-topics.html' title='Latest Paper Presentation Topics'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2800592825486289569</id><published>2010-08-24T00:40:00.001-07:00</published><updated>2010-08-24T00:41:04.180-07:00</updated><title type='text'>What is Ad-Hoc Mode in Wireless Networking?</title><content type='html'>&lt;div style="text-align: justify;"&gt;On computer networks wireless ad hoc mode, a method for wireless devices to communicate directly with each other. On the operating ad-hoc mode allows all wireless devices within range of each other to discover and communicate how peer-to-peer without involving central access points (including integrated broadband wireless routers wire). To create a network ad-hoc wireless, each adapter configured for wireless ad hoc mode counter mode of replacing infrastructure. In addition, all wireless adapters for ad hoc networks use the same SSID and same channel number.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2800592825486289569?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2800592825486289569'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2800592825486289569'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/what-is-ad-hoc-mode-in-wireless_24.html' title='What is Ad-Hoc Mode in Wireless Networking?'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2363407494037101833</id><published>2010-08-24T00:40:00.000-07:00</published><updated>2010-08-24T00:41:02.401-07:00</updated><title type='text'>What is Ad-Hoc Mode in Wireless Networking?</title><content type='html'>&lt;div style="text-align: justify;"&gt;On computer networks wireless ad hoc mode, a method for wireless devices to communicate directly with each other. On the operating ad-hoc mode allows all wireless devices within range of each other to discover and communicate how peer-to-peer without involving central access points (including integrated broadband wireless routers wire). To create a network ad-hoc wireless, each adapter configured for wireless ad hoc mode counter mode of replacing infrastructure. In addition, all wireless adapters for ad hoc networks use the same SSID and same channel number.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2363407494037101833?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2363407494037101833'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2363407494037101833'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/what-is-ad-hoc-mode-in-wireless.html' title='What is Ad-Hoc Mode in Wireless Networking?'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1518153768046609804</id><published>2010-08-24T00:38:00.000-07:00</published><updated>2010-08-24T00:39:47.383-07:00</updated><title type='text'>Connect to Wi-Fi ad-hoc networks automatically with Windows Vista</title><content type='html'>&lt;div style="text-align: justify;"&gt;I recently moved into a new house, and I lost my clutch I used a small network connecting my two laptops and my EEE PC together. All these devices are WiFi adapter so I thought it would only establish an Ad-Hoc WiFi network instead of using even cables.This&amp;#39; d mean that I can share the Internet connection from my main work laptop and I want to stay out Sub-notebook in my garden and new job air.I hit very annoying very early stage of this. So, Windows Vista does not automatically link ad-hoc WiFi network, it is seen as a security risk, this meant that every time I started a Vista machine I had to manually connect to the network, very annoying at times if the &amp;#39; I forgot. So I decided to solve this problem and found a way to use the Windows Task Scheduler.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1518153768046609804?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1518153768046609804'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1518153768046609804'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/connect-to-wi-fi-ad-hoc-networks.html' title='Connect to Wi-Fi ad-hoc networks automatically with Windows Vista'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-9077120923761836672</id><published>2010-08-24T00:36:00.000-07:00</published><updated>2010-08-24T00:38:25.757-07:00</updated><title type='text'>How To Set Up an Ad Hoc (Peer) WiFi Network</title><content type='html'>&lt;div style="text-align: justify;"&gt;Follow the step by step to create an ad hoc WiFi network. Wi-Fi ad hoc (or peer) feature enables two or more devices communicate with each other directly rather than through a central wireless router or access point.For each computer (the device), if the device has WiFi capability.Purchase and install a WiFi network hardware no WiFi capability.Configure any WiFi network card to work mode.Test ad hoc network settings for each device.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-9077120923761836672?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9077120923761836672'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/9077120923761836672'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/how-to-set-up-ad-hoc-peer-wifi-network.html' title='How To Set Up an Ad Hoc (Peer) WiFi Network'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5530085753162292393</id><published>2010-08-24T00:35:00.000-07:00</published><updated>2010-08-24T00:36:32.316-07:00</updated><title type='text'>Wireless mesh network</title><content type='html'>&lt;div style="text-align: justify;"&gt;A wireless mesh network (WMN) is a communications network made up of radio nodes organized in a mesh topology. Wireless mesh networks are often composed of mesh clients, mesh routers and gateways [1]. Customers are often portable cell phones and other wireless devices, while the mesh routers forward traffic to and from gateways that can but need not connect to the Internet. The coverage of radio nodes working as a single network is sometimes called a mesh cloud. Access to this mesh cloud is dependent on the radio nodes working in harmony with each other to create a wireless network.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5530085753162292393?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5530085753162292393'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5530085753162292393'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/wireless-mesh-network.html' title='Wireless mesh network'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4322728359810929550</id><published>2010-08-24T00:33:00.000-07:00</published><updated>2010-08-24T00:35:06.709-07:00</updated><title type='text'>Set up an ad hoc WiFi network</title><content type='html'>&lt;div style="text-align: justify;"&gt;What if I wanted to share a single Internet connection, but you want to share files, use the printer on another computer, send and receive instant messages, in other words - in short, do pretty much everything you can do online - but it is a router? You could create an ad hoc network, and can be connected to a basic peer-to-peer computers and PDA Mutch. You do not need any additional software, capacity has been built correctly, you must XP.All WiFi-equipped PC. To establish an ad hoc network first PC is the basic approach and then the rest of the PC connection that an ad hoc network&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4322728359810929550?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4322728359810929550'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4322728359810929550'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/set-up-ad-hoc-wifi-network.html' title='Set up an ad hoc WiFi network'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-1922310211530276803</id><published>2010-08-24T00:31:00.000-07:00</published><updated>2010-08-24T00:33:14.110-07:00</updated><title type='text'>How to Create an Ad Hoc Wi-Fi Network  Read more: How to Create an Ad Hoc Wi-Fi Network | eHow.com http://www.ehow.com/how_5167281_create-ad-hoc-wifi-</title><content type='html'>&lt;div style="text-align: justify;"&gt;Wireless ad hoc network can share a wireless Internet connection, files and equipment between two or more computers. Instead, you use the wireless network router to a central computer. Other computers on the network with a wireless card can be connected to the main computer. Ad hoc networks are safe. You can create a secure password, so that only certain users can access the network. Windows, you can create ad hoc wireless network quickly and easily.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-1922310211530276803?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1922310211530276803'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/1922310211530276803'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/how-to-create-ad-hoc-wi-fi-network-read.html' title='How to Create an Ad Hoc Wi-Fi Network  Read more: How to Create an Ad Hoc Wi-Fi Network | eHow.com http://www.ehow.com/how_5167281_create-ad-hoc-wifi-'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7623893854721050496</id><published>2010-08-24T00:30:00.000-07:00</published><updated>2010-08-24T00:31:39.397-07:00</updated><title type='text'>Ad hoc applications provide truly wireless solutions</title><content type='html'>&lt;div style="text-align: justify;"&gt;Ad-hoc mode, users can spontaneously form a wireless local area network. For example, a group of people, with 802.11-equipped computers to collect and business meetings in their home. In order to share these documents and the presentation of charts and tables, can easily change the network card is a small ad hoc wireless local area network for a meeting room. Another example is when you and your employees are waiting in the airport, and you want to share a relatively large PDF files. Via ad hoc mode, you can move the file to another One Laptop. Each of these applications do not need to install the base station and drive cables.The ad hoc form of communication is particularly useful to public safety and search and rescue applications. medical groups requires a fast and efficient communications when they rush to treat disaster victims.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7623893854721050496?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7623893854721050496'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7623893854721050496'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/ad-hoc-applications-provide-truly.html' title='Ad hoc applications provide truly wireless solutions'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5731200663958657802</id><published>2010-08-24T00:28:00.000-07:00</published><updated>2010-08-24T00:30:02.042-07:00</updated><title type='text'>Understanding Ad Hoc Mode</title><content type='html'>&lt;div style="text-align: justify;"&gt;Most installed wireless LANs today utilize &amp;quot;infrastructure&amp;quot; mode that requires the use of one or more access points. With this configuration, the access point provides an interface to a distribution system (eg Ethernet), which allows wireless users to use the Internet and corporate servers applications.As an option, however, the standard 802 11 specifies &amp;quot;ad hoc&amp;quot; mode, which allows the card to interface the radio network (RNC) to operate in what the standard refers to an Independent Basic Service Set (IBSS) network configuration. With an IBSS, there is no access points. Facilities subscriber to communicate directly with each other in a basket of equals&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5731200663958657802?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5731200663958657802'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5731200663958657802'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/understanding-ad-hoc-mode.html' title='Understanding Ad Hoc Mode'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3490434871604756577</id><published>2010-08-24T00:27:00.000-07:00</published><updated>2010-08-24T00:28:32.781-07:00</updated><title type='text'>IP configuration</title><content type='html'>&lt;div style="text-align: justify;"&gt;The previous phase allows you to connect multiple computers. However, being able to take full advantage of the network you must configure IP addressing for network equipment and set up for specific services (web server, file sharing, Internet sharing, etc.). This type of network, you must use the private IP address. It &amp;#39;s the range of addresses reserved for this, in this case 192.168.0.1 and 192.168.0.255 is enough (or 192.168.1.1 and 192.168.1.255 if you have already addressed the previous LAN). If any of the computers, ad hoc network has internet access who wants to share with other computers on the network, usually refers to 192.168.0.1 (or 192.168.1.1), but this is just a convention. Since the addresses of other machines of the same address range: 192.168.0.2, etc.To determine the machine, simply right click on the corresponding wireless network connection, select &amp;quot;Properties&amp;quot;:&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3490434871604756577?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3490434871604756577'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3490434871604756577'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/ip-configuration.html' title='IP configuration'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6706039475491756453</id><published>2010-08-24T00:25:00.000-07:00</published><updated>2010-08-24T00:27:06.450-07:00</updated><title type='text'>Configuring the ad hoc network</title><content type='html'>&lt;div style="text-align: justify;"&gt;Properties dialog box, and connect to wireless network (wireless card network configuration) has the network to detect the wireless adapter and you can configure them.To create an ad hoc network, you must add a new network is identified by a unique name, SSID. To do this, click the Add button. A new dialog box: You can create ad-hoc network, all future computer network, simply enter the check box for the same SSID &amp;quot;This network from computer to computer.&amp;quot; Other options are used to enhance security. First, leave the network wide open (and alternatives to the screenshot above), not to reproduce the settings, which could prevent the networking. At this first stage machinery, the ad hoc network should be able to connect to a another.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6706039475491756453?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6706039475491756453'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6706039475491756453'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/configuring-ad-hoc-network.html' title='Configuring the ad hoc network'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-768224009830990501</id><published>2010-08-24T00:16:00.000-07:00</published><updated>2010-08-24T00:25:22.499-07:00</updated><title type='text'>Ad hoc &amp; Wi-Fi Networks</title><content type='html'>&lt;div style="text-align: justify;"&gt;If you have two or more computers with wireless adapters (WiFi cards), you can easily connect to the network by creating a so-called &amp;quot;ad hoc network, or network from computer to computer without a base station. If any computer ad hoc network is an Internet connection, you can share it with other computers on the network, for example the case of the traditional network.First, it is necessary to equip all the machines that will be in the future ad hoc network with a wireless adapter and install the drivers. A new icon in the taskbar, indicating the presence of an active wireless adapter on your computer: By default, Windows XP has a utility that lets you configure wireless networks. The Microsoft Windows XP wireless network configuration utility for setting disables the tool manufacturer. To disable the Windows XP tool, simply click on Start / Settings / Network Connections, then right on to the wireless network icon and select Properties. In the configuration tab of your wireless network, using Windows or disable checking to configure my wireless network.&lt;/div&gt;&lt;div style="text-align: justify;"&gt;For Download Link of PPT, Mail Us To "rvch63@gmail.com".We will send you link shortly.&lt;/div&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-768224009830990501?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/768224009830990501'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/768224009830990501'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/08/ad-hoc-wi-fi-networks.html' title='Ad hoc &amp; Wi-Fi Networks'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4781713164596693611</id><published>2010-06-20T01:23:00.004-07:00</published><updated>2010-06-20T01:27:37.891-07:00</updated><title type='text'>Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion</title><content type='html'>Abstract:-&lt;br /&gt; Networks employ link protection to achieve fast recovery from link failures. While the first link failure can be protected using link protection, there are several alternatives for protecting against the second failure. This paper formally classifies the approaches to dual-link failure resiliency. One of the strategies to recover from dual-link failures is to employ link protection for the two failed links independently, which requires that two links may not use each other in their backup paths if they may fail simultaneously. Such a requirement is referred to as Backup Link Mutual Exclusion (BLME) constraint and the problem of identifying a backup path for every link that satisfies the above requirement is referred to as the BLME problem. This paper develops the necessary theory to establish the sufficient conditions for existence of a solution to the BLME problem. Solution methodologies for the BLME problem is developed using two approaches by: (1) formulating the backup path selection as an integer linear program; and (2) developing a   polynomial time heuristic based on minimum cost path routing. The ILP formulation and heuristic are applied to six networks and their performance is compared to approaches that assume precise knowledge of dual-link failure. It is observed that a solution exists for all the six networks considered. The heuristic approach is shown to obtain feasible solutions that are resilient to most dual-link failures, although the backup path lengths may be significantly higher than optimal. In addition, the paper illustrates the significance of the knowledge of failure location by illustrating that network with higher connectivity may require lesser capacity than one with a lower connectivity to recover from dual-link failures.&lt;br /&gt;&lt;br /&gt;Hardware Interface&lt;br /&gt;• Hard disk                :   40 GB&lt;br /&gt;• RAM                         :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4781713164596693611?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4781713164596693611'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4781713164596693611'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/dual-link-failure-resiliency-through.html' title='Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6241071138305239755</id><published>2010-06-20T01:23:00.003-07:00</published><updated>2010-06-20T01:26:37.850-07:00</updated><title type='text'>Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest</title><content type='html'>Abstract:-&lt;br /&gt; Peer-to-peer (P2P) networks establish loosely coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with a large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users’ common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self organizing the P2P network into a small world. Both theoretical and experimental analyses are conducted and demonstrated the effectiveness and efficiency of our approach.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:&lt;br /&gt;Network system classified into two categories. They are structured and unstructured. Unstructured P2P networks can be constructed very efficiently.&lt;br /&gt;The applications share the resources and data in this system is a challenging task. This challenge overcome by random search strategy. &lt;br /&gt;&lt;br /&gt;Problem Definition&lt;br /&gt;&lt;br /&gt;Random search strategy satisfies the problem of sharing data and resources in unstructured networks. It works properly for small networks. When we were going large networks, this system performance is very poor.&lt;br /&gt;&lt;br /&gt;Proposed System:&lt;br /&gt;We seek to enhance the search performance in unstructured P2P networks. The statistical patterns over locally shared resources of a peer can be explored to guide the distributed resource discovery process and therefore enhance the overall resource discovery performance in unstructured P2P networks. The following steps are used for this process.&lt;br /&gt;&lt;br /&gt;I. Store the nodes in order to save peers from their blindness.&lt;br /&gt;II. Users’ common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). &lt;br /&gt;III. We are able to estimate the probability of any peer sharing a certain resource through UIM.&lt;br /&gt;IV. When a peer receives a query for a certain file that is not available locally, it will forward the query to one of its neighbors that has the highest probability of actually sharing that file.&lt;br /&gt;V. Updating the routing table protocol to support our search protocol through self organizing the whole P2P network.&lt;br /&gt;&lt;br /&gt;S/W Specifications&lt;br /&gt;Operating System : Windows XP&lt;br /&gt;Front end   : JAVA&lt;br /&gt;Back end   :  SQLITE&lt;br /&gt;&lt;br /&gt;H/W Specification&lt;br /&gt;System Processor  :  Pentium IV&lt;br /&gt;Processor Speed  : 2.80GHz&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6241071138305239755?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6241071138305239755'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6241071138305239755'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/enhancing-search-performance-in.html' title='Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-728496967662003936</id><published>2010-06-20T01:23:00.002-07:00</published><updated>2010-06-20T01:26:06.353-07:00</updated><title type='text'>Using the Conceptual Cohesion of Classes for Fault Prediction in Object-Oriented Systems</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt; High cohesion is a desirable property of software as it positively impacts understanding, reuse, and maintenance. Currently proposed measures for cohesion in Object-Oriented (OO) software reflect particular interpretations of cohesion and capture different aspects of it. Existing approaches are largely based on using the structural information from the source code, such as attribute references, in methods to measure cohesion. This paper proposes a new measure for the cohesion of classes in OO software systems based on the analysis of the unstructured information embedded in the source code, such as comments and identifiers. The measure, named the Conceptual Cohesion of Classes (C3), is inspired by the mechanisms used to measure textual coherence in cognitive psychology and computational linguistics. This paper presents the principles and the technology that stand behind the C3 measure. A large case study on three open source software systems is presented which compares the new measure with an extensive set of existing metrics and uses them to construct models that predict software faults. The case study shows that the novel measure captures different aspects of class cohesion compared to any of the existing cohesion measures. In addition, combining C3 with existing structural cohesion metrics proves to be a better predictor of faulty classes when compared to different combinations of structural cohesion metrics.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;•  This depends on reasonable naming conventions.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Conceptual Cohesion of Classes which captures the conceptual aspects of class cohesion, as it measures how strongly the methods of a class relate to each other conceptually.&lt;br /&gt;&lt;br /&gt;Hardware Interface&lt;br /&gt;• Hard disk                :   40 GB&lt;br /&gt;• RAM                         :  512 MB&lt;br /&gt;• Processor Speed    :  3.00GHz&lt;br /&gt;• Processor                :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-728496967662003936?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/728496967662003936'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/728496967662003936'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/using-conceptual-cohesion-of-classes.html' title='Using the Conceptual Cohesion of Classes for Fault Prediction in Object-Oriented Systems'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6235958323910174543</id><published>2010-06-20T01:23:00.001-07:00</published><updated>2010-06-20T01:25:14.829-07:00</updated><title type='text'>Two Techniques for Fast Computation of Constrained Shortest Paths</title><content type='html'>Abstract:-&lt;br /&gt; Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, MPLS path selection, ATM circuit routing, and traffic engineering. The problem is to find the cheapest path that satisfies certain constraints. In particular, finding the cheapest delay-constrained path is critical for real-time data flows such as voice/video calls. Because it is NP-complete, much research has been designing heuristic algorithms that solve the -approximation of the problem with an adjustable accuracy. A common approach is to discretize (i.e., scale and round) the link delay or link cost, which transforms the original problem to a simpler one solvable in polynomial time. The efficiency of the algorithms directly relates to the magnitude of the errors introduced during discretization. In this paper, we propose two techniques that reduce the discretization errors, which allow faster algorithms to be designed. Reducing the overhead of computing constrained shortest paths is practically important for the successful design of a high-throughput QoS router, which is limited at both processing power and memory space. Our simulations show that the new algorithms reduce the execution time by an order of magnitude on power-law topologies with 1000 nodes. The reduction in memory space is similar.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• The first scheme is to implement them as on-line algorithms that Process the routing requests as they arrive.In practice, on-line algorithms are not always desired. When the request arrival rate is high (major gateways may receive thousands or tens of thousands of requests every second), even the time complexity of Dijkstra’s algorithm will overwhelm the router if it is executed on a per-request basis.1 To solve this problem, the second scheme is to extend a link-state protocol (e.g., OSPF) and periodically pre-compute the cheapest delay-constrained paths for all destinations.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Two techniques are used to randomize discretization and path delay discretization, to design fast algorithms for computing constrained shortest paths.&lt;br /&gt;&lt;br /&gt;• The algorithms based on these techniques run much faster than the best existing algorithm that solves the -approximation of DCLC.&lt;br /&gt;&lt;br /&gt;Hardware Specification:&lt;br /&gt;&lt;br /&gt;• Processor        :  Pentium Iv 2.6 GHz&lt;br /&gt;• Ram           :  512 Mb Dd Ram&lt;br /&gt;• Monitor          :  15” Color&lt;br /&gt;• Hard Disk          :  20 Gb&lt;br /&gt;&lt;br /&gt;Software Specification:&lt;br /&gt;&lt;br /&gt;• Front End               :  Java, Swing&lt;br /&gt;• Tools Used              :  JBuilder&lt;br /&gt;• Operating System  :  WindowsXP&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6235958323910174543?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6235958323910174543'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6235958323910174543'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/two-techniques-for-fast-computation-of.html' title='Two Techniques for Fast Computation of Constrained Shortest Paths'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3480714369170987051</id><published>2010-06-20T01:23:00.000-07:00</published><updated>2010-06-20T01:24:27.773-07:00</updated><title type='text'>The Server Reassignment Problem for Load Balancing in Structured P2P Systems</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt; Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, load balancing among the peers is critical. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of ðlogNÞ in the zone sizes. This paper makes two contributions. First, we propose addressing the virtual-server-based load balancing problem systematically using an optimization-based approach and derive an effective algorithm to rearrange loads among the peers. We demonstrate the superior performance of our proposal in general and its advantages over previous strategies in particular. We also explore other important issues vital to the performance in the virtual server framework, such as the effect of the number of directories employed in the system and the performance ramification of user registration strategies. Second, and perhaps more significantly, we systematically characterize the effect of heterogeneity on load balancing algorithm performance and the conditions in which heterogeneity may be easy or hard to deal with based on an extensive study of a wide spectrum of load and capacity scenarios.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• Some peers may be large servers with plenty of computing power and large storage access through a reliable and high-speed network, whereas other peers may be handheld devices with wireless connections that have limited storage, computing power, and unreliable connections. Although there are approaches that are effective in partitioning the ID space according to node capacities  these approaches cannot adapt to dynamic workload changes in real networking conditions.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Here we performed in-depth analysis of the effect of capacity and workload heterogeneity on algorithm performance in both static and dynamic environments and the qualitative relationship between static and dynamic environments.&lt;br /&gt;&lt;br /&gt;Hardware Specification:&lt;br /&gt;&lt;br /&gt;• Processor        :  Pentium Iv 2.6 Ghz&lt;br /&gt;• Ram           :  512 Mb Dd Ram&lt;br /&gt;• Monitor          :  15” Color&lt;br /&gt;• Hard Disk          :  20 Gb&lt;br /&gt;&lt;br /&gt;Software Specification:&lt;br /&gt;&lt;br /&gt;• Front End               :  Java, Swing&lt;br /&gt;• Tools Used              :  JBuilder&lt;br /&gt;• Operating System  :  WindowsXP&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3480714369170987051?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3480714369170987051'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3480714369170987051'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/server-reassignment-problem-for-load.html' title='The Server Reassignment Problem for Load Balancing in Structured P2P Systems'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7916995184494042532</id><published>2010-06-20T01:20:00.005-07:00</published><updated>2010-06-20T01:22:52.931-07:00</updated><title type='text'>Strategy proof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems</title><content type='html'>Abstract:-&lt;br /&gt; The scheduling of arbitrarily divisible loads on a distributed system is studied by Divisible Load Theory (DLT). DLT has the underlying assumption that the processors will not cheat. In the real world, this assumption is unrealistic as the processors are owned and operated by autonomous rational organizations that have no a priori motivation for cooperation. Consequently, they will manipulate the algorithms if it benefits them to do so. In this work, we propose strategy proof mechanisms for scheduling divisible loads on three types of bus-connected distributed systems. These mechanisms provide incentives to the processors to obey the prescribed algorithms and to truthfully report their parameters, leading to an efficient load allocation and execution.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• Several algorithms are used in Distributed Load Theory (DLT) for scheduling but this leads to poor performance and inefficiency.&lt;br /&gt;&lt;br /&gt;• There are no mechanisms that provide incentives to the processors to participate and to report their true processing capacities to the scheduler.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• The control processor’s role is to strictly distribute load to the load-executing processors as it does not have any load executing capabilities.&lt;br /&gt;&lt;br /&gt;• A protocol is designed by using digital signatures that helps to identify cheating &lt;br /&gt;&lt;br /&gt;Hardware Specification:&lt;br /&gt;&lt;br /&gt;• Processor        :  Pentium Iv 2.6 Ghz&lt;br /&gt;• Ram           :  512 Mb Dd Ram&lt;br /&gt;• Monitor          :  15” Color&lt;br /&gt;• Hard Disk          :  20 Gb&lt;br /&gt;&lt;br /&gt;Software Specification:&lt;br /&gt;&lt;br /&gt;• Front End               :  Java, Swing&lt;br /&gt;• Tools Used              :  JBuilder&lt;br /&gt;• Operating System  :  WindowsXP&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7916995184494042532?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7916995184494042532'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7916995184494042532'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/strategy-proof-mechanisms-for.html' title='Strategy proof Mechanisms for Scheduling Divisible Loads in Bus-Networked Distributed Systems'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3558553689742192315</id><published>2010-06-20T01:20:00.004-07:00</published><updated>2010-06-20T01:22:31.994-07:00</updated><title type='text'>Securing User-Controlled Routing Infrastructures</title><content type='html'>Abstract:-&lt;br /&gt; Designing infrastructures that give untrusted third parties (such as end-hosts) control over routing is a promising research direction for achieving flexible and efficient communication. However, serious concerns remain over the deployment of such infrastructures, particularly the new security vulnerabilities they introduce. The flexible control plane of these infrastructures can be exploited to launch many types of powerful attacks with little effort. In this paper, we make several contributions towards studying security issues in forwarding infrastructures (FIs). We present a general model for an FI, analyze potential security vulnerabilities, and present techniques to address these vulnerabilities. The main technique that we introduce in this paper is the use of simple lightweight cryptographic constraints on forwarding entries. We show that it is possible to prevent a large class of attacks on end-hosts and bound the flooding attacks that can be launched on the infrastructure nodes to a small constant value. Our mechanisms are general and apply to a variety of earlier proposals such as , Data Router, and Network Pointers.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;• Cryptographic constraints are not that much strong to avoid the vulnerability to alleviate attacks.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Lightweight cryptographic constraints on forwarding entries, allows the construction of only acyclic topologies thus preventing malicious hosts from using packet replication of the infrastructure to multiply flooding attacks.&lt;br /&gt;&lt;br /&gt;Hardware Specification:&lt;br /&gt;&lt;br /&gt;• Processor        :  Pentium Iv 2.6 Ghz&lt;br /&gt;• Ram           :  512 Mb Dd Ram&lt;br /&gt;• Monitor          :  15” Color&lt;br /&gt;• Hard Disk          :  20 Gb&lt;br /&gt;&lt;br /&gt;Software Specification:&lt;br /&gt;&lt;br /&gt;• Front End               :  Java, Swing&lt;br /&gt;• Tools Used              :  JBuilder&lt;br /&gt;• Operating System  :  WindowsXP&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3558553689742192315?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3558553689742192315'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3558553689742192315'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/securing-user-controlled-routing.html' title='Securing User-Controlled Routing Infrastructures'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6354477816281034337</id><published>2010-06-20T01:20:00.003-07:00</published><updated>2010-06-20T01:22:15.322-07:00</updated><title type='text'>Ranked Reverse nearest Neighbor Search</title><content type='html'>Abstract:&lt;br /&gt;&lt;br /&gt;      Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors (NNs) are q. Reverse k-NN ðRkNNÞ query (where k _ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have an influence on all those answer data points. The degree of q’s influence on a data point p ð2 PÞ is denoted by _p, where q is the _pth NN of p. We introduce a new variant of RNN query, namely, Ranked RNN (RRNN) query, that retrieves t data points most influenced by q, i.e., the t data points having the smallest _s with respect to q. To answer this RRNN query efficiently, we propose two novel algorithms, _-Counting and _-Browsing that are applicable to both monochromatic and bichromatic scenarios and are able to deliver results progressively. Through an extensive performance evaluation, we validate that the two proposed RRNN algorithms are superior to solutions derived from algorithms designed for RkNN query.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;  RkNN is not very informative about the influences of a query point on answer data points. It is hard to differentiate one answer data point from another upon influence received from the query point. Therefore, it is useful to determine an influence rank, a predetermined number of influenced data points (with their _s provided) ordered by their _s. This search has a wide application base. For example, a company has some limited quantity of product samples to send to potential customers for promotion. Assume that the promoted product, other competitors’ products, and customers’ preferences are all captured as data points in a multidimensional feature space. Supposethat customers are more likely to purchase a product if it is closer to their preferences in the feature space. Given the number of available samples t, kNN query with k ¼ t finds customers whose preferences match well with the product, but the product may not receive high ranks to those customers due to the existence of other products. RkNN can be adopted to find potential customers. Independent of t, it cannot find exact t potential customers to send the samples. Besides, both kNN and RkNN cannot tell which potential customers are the most (or least) suitable targets. This necessitates a new query that searches the t most influenced data points ranked based on the degree of influence.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt; We propose the Ranked RNN (RRNN) query, formally defined in Definition 3, to retrieve from P the t data points most influenced by a query point q, where t is a query parameter. When t is set to 1, RRNN query returns a data point p that q has the most influence on. Notice that _p may not necessarily be 1. When t ¼ jPj (i.e., the cardinality of the data set), RRNN renders a sorted list of all data points according to their degrees of influence. Since _s are not necessarily unique, the distance between the data points and the query point is used as the tiebreaker. Revisit our previous example. An RRNN query with t set to the number of available samples, say 100, one hundred customers best matched with the promoted product are retrieved&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Hardware Requirements:&lt;br /&gt;&lt;br /&gt;• Processor  : Pentium Iv 2.6 Ghz&lt;br /&gt;• Ram   :512 Mb Dd Ram&lt;br /&gt;• Monitor  :15” Color&lt;br /&gt;• Hard Disk  :20 Gb&lt;br /&gt;&lt;br /&gt;Software Requirements:&lt;br /&gt;&lt;br /&gt;• Front End                   :  Java, Swing&lt;br /&gt;• Operating System       :  Window’s Xp&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6354477816281034337?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6354477816281034337'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6354477816281034337'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/ranked-reverse-nearest-neighbor-search.html' title='Ranked Reverse nearest Neighbor Search'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2187796091460200845</id><published>2010-06-20T01:20:00.002-07:00</published><updated>2010-06-20T01:21:54.522-07:00</updated><title type='text'>Problem Oriented Software Engineering: Solving the Package Router Control Problem</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt; Problem orientation is gaining interest as a way of approaching the development of software intensive systems, and yet, a significant example that explores its use is missing from the literature. In this paper, we present the basic elements of Problem Oriented Software Engineering (POSE), which aims at bringing both non formal and formal aspects of software development together in a single framework. We provide an example of a detailed and systematic POSE development of a software problem: that of designing the controller for a package router. The problem is drawn from the literature, but the analysis presented here is new. The aim of the example is twofold: to illustrate the main aspects of POSE and how it supports software engineering design and to demonstrate how a nontrivial problem can be dealt with by the approach&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;:&lt;br /&gt;• There are two fundamental difficulties involved in dealing with non formal domains (also known as the real world): &lt;br /&gt;&lt;br /&gt;1. The properties that they enjoy are not necessarily expressible in any single linguistic system.&lt;br /&gt;&lt;br /&gt;2. The notion of mathematical (logical) proof does not apply to them.” These difficulties, which are well known in the established branches of engineering, have sometimes led to a harmful dichotomy in approaches to software development Some approaches address only the formal concern&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Problem Oriented Software Engineering (POSE) aims at bringing both non formal and formal aspects of software development together in a single framework. POSE is intended to provide a structure within which the results of different development activities can be combined and reconciled.&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2187796091460200845?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2187796091460200845'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2187796091460200845'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/problem-oriented-software-engineering.html' title='Problem Oriented Software Engineering: Solving the Package Router Control Problem'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-5378541283070828367</id><published>2010-06-20T01:20:00.001-07:00</published><updated>2010-06-20T01:21:35.062-07:00</updated><title type='text'>Probabilistic Group nearest Neighbor Queries in Uncertain Databases</title><content type='html'>Abstract:-&lt;br /&gt; &lt;br /&gt; The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous works have studied many query types such as nearest neighbor query, range query, top-k query, skyline query, and similarity join. In this paper, we focus on another important query, namely, probabilistic group nearest neighbor (PGNN) query, in the uncertain database, which also has many applications. Specifically, given a set, Q, of&lt;br /&gt;query points, a PGNN query retrieves data objects that minimize the aggregate distance (e.g., sum, min, and max) to query set Q. Due to the inherent uncertainty of data objects, previous techniques to answer group nearest neighbor (GNN) query cannot be directly applied to our PGNN problem. Motivated by this, we propose effective pruning methods, namely, spatial pruning and probabilistic pruning, to reduce the PGNN search space, which can be seamlessly integrated into our PGNN query procedure. Extensive experiments have demonstrated the efficiency and effectiveness of our proposed approach, in terms of the wall clock time and the speed-up ratio against linear scan.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• While many proposed techniques for answering queries (e.g., nearest neighbor (NN) query and range query) assume that data objects are precise, they cannot be directly applied to handle uncertain data (otherwise, inaccuracy or even errors may be introduced.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Here we are using GNN Query and two pruning techniques are used like &lt;br /&gt;• Spatial Pruning.&lt;br /&gt;• Probabilistic Pruning.&lt;br /&gt;&lt;br /&gt;To query the data in uncertain database.&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-5378541283070828367?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5378541283070828367'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/5378541283070828367'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/probabilistic-group-nearest-neighbor.html' title='Probabilistic Group nearest Neighbor Queries in Uncertain Databases'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2645976443794770516</id><published>2010-06-20T01:20:00.000-07:00</published><updated>2010-06-20T01:21:11.507-07:00</updated><title type='text'>Optimal State Allocation for Multicast Communications with Explicit Multicast Forwarding</title><content type='html'>Abstract:-&lt;br /&gt; In this paper, we propose a scalable and adaptive multicast forwarding mechanism based on Explicit Multicast (Xcast). This mechanism optimizes the allocation of forwarding states in routers and can be used to improve the scalability of traditional IP multicast and Source-Specific Multicast. Compared with previous work, our mechanism needs fewer routers in a multicast tree to store forwarding states and therefore leads to a more balanced distribution of forwarding states among routers. We focus on two problems and formulate each of them as an optimization problem. The first problem, referred to as MINSTATE, minimizes the total number of routers that store forwarding states in a multicast tree. The second problem, referred to as BALANCESTATE, minimizes the maximum number of forwarding states stored in a router for all multicast groups, which is proved to be an NP-hard problem. We design a distributed algorithm that obtains the optimal solution to the first problem and propose an approximation algorithm for the second problem. We also prove that the approach adopted by most existing works to allocate forwarding states in the branching routers of a multicast tree is a special case of our mechanism. The simulation results show that the forwarding state allocation provided by previous work is concentrated on the backbone routers in the Internet, which may cause the scalability problem. In contrast, our mechanism can balance forwarding states stored among routers and reduce the number of routers that store the forwarding states for a multicast tree&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• This system is not scalable in terms of both the number of members in a multicast group and the number of multicast groups in the network.&lt;br /&gt;&lt;br /&gt;• This system is unable the answer the questions like &lt;br /&gt;&lt;br /&gt; MINSTATE.&lt;br /&gt; BALANCESTATE.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Multicast forward mechanisms are used to achieve scalability in both the number of members in a multicast group and the number of multicast groups in the network.&lt;br /&gt;• Here we used distribution algorithm to achieve&lt;br /&gt; MINSTATE.&lt;br /&gt; BALANCESTATE.&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2645976443794770516?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2645976443794770516'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2645976443794770516'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/optimal-state-allocation-for-multicast.html' title='Optimal State Allocation for Multicast Communications with Explicit Multicast Forwarding'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6403763473790891671</id><published>2010-06-20T01:18:00.006-07:00</published><updated>2010-06-20T01:20:32.476-07:00</updated><title type='text'>On the Performance Benefits of Multihoming Route Control</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt; Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks today can employ a variety of route control products to optimize their Internet access performance and reliability. However, little is known about the tangible benefits that such products can offer the mechanisms they employ and their trade-offs. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our analysis shows that  multihoming to three or more ISPs and cleverly scheduling traffic across the ISPs can improve Internet RTTs and throughputs by up to 25% and 20%, respectively. However, a careful selection of ISPs is important to realize the performance improvements. Second, focusing on large enterprises, we propose and evaluate a wide-range of route control mechanisms and evaluate their design trade-offs. We implement the proposed schemes on a Linux-based Web proxy and perform a trace-based evaluation of their performance. We show that both passive and active measurement-based techniques are equally effective and could improve the Web response times of enterprise networks by up to 25% on average, compared to using a single ISP. We also outline several “best common practices” for the design of route control products.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• Previous work on multihoming route control doesn’t concentrate on achieving performance balance load over multiple broadband-class links.&lt;br /&gt;&lt;br /&gt;• Previous work achieves high performance with single higher-bandwidth link.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• We study mechanisms for improving Internet performance of enterprise networks via route control.&lt;br /&gt;&lt;br /&gt;• Here we achieved balance load over multiple broadband-class links using multihoming route control.&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6403763473790891671?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6403763473790891671'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6403763473790891671'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/on-performance-benefits-of-multihoming.html' title='On the Performance Benefits of Multihoming Route Control'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3526415165859340453</id><published>2010-06-20T01:18:00.005-07:00</published><updated>2010-06-20T01:20:08.795-07:00</updated><title type='text'>Multicast Routing with Delay and Delay- Variation Constraints for Collaborative Applications on Overlay Networks</title><content type='html'>Abstract:-&lt;br /&gt; Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting sub network, using which messages should arrive at the destinations within a specified delay bound. These applications also require that destinations receive the message from the source at approximately the same time. The problem of finding a multicasting sub network with delay and delay-variation bound has been proved to be an NP Complete problem in the literature and heuristics have been proposed for this problem. In this paper, we provide an efficient heuristic to obtain a multicast sub network on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is &lt;br /&gt;O (|E|+ nk log (|E|/n) +m2k), where n and |E| are the number of nodes and edges in the network, respectively, k is the number of shortest paths determined, and m is the number of destinations. We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Our extensive empirical studies indicate that our heuristic uses significantly less runtime in comparison with the best-known heuristics while achieving the tightest delay variation for a given end-to end delay bound. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;            Multicast Routing with Delay and Delay Variation Constraints &lt;br /&gt;                  For Collaborative Applications on Overlay Networks&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;INTRODUCTION:&lt;br /&gt;     The Internet has made a tremendous impact on human civilization by providing global connectivity to a vast number of end users who are geographically dispersed&lt;br /&gt;From  each  other.&lt;br /&gt;&lt;br /&gt;     It supports Multicasting is an efficient communication mechanism, where a source host sends the same message to a group of destination hosts, called the Multicasting group. &lt;br /&gt;&lt;br /&gt;     The primary advantage of using the multicast is that it conserves network bandwidth. Collaborative applications such as video conferencing, online games, interactive simulations, and distributed database replications require that messages should arrive at the destinations within a specified delay bound.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:&lt;br /&gt;               In this system, we have considered the problem of determining a multicasting sub network with end-to-end delay bound and delay variation bounded for collaborative applications on overlay network &lt;br /&gt;          &lt;br /&gt;               The problem of this system is one of finding a sub network given a source and a set of destinations that satisfies the QoS (Quality of Service) requirements on the maximum Delay from the source to any of the destinations and on the Maximum interdestination delay variance.  This system problem along with its performance evaluation. In this system delay variation between the source and destination is more.&lt;br /&gt;&lt;br /&gt;Proposed System:&lt;br /&gt;         In this new System, we provide an efficient heuristic to obtain a multicast sub network on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations The time-complexity of our algorithm is O (|E|+ nk log (|E|/n) +m2k), We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Performance analysis demonstrated that the proposed method performs very well. In this we try to construct a delay-constrained minimum cost tree &lt;br /&gt;&lt;br /&gt; &lt;br /&gt;S/W Specifications&lt;br /&gt;&lt;br /&gt;Operating System : Windows XP&lt;br /&gt;Front end   : JAVA&lt;br /&gt;Back end   :  SQLITE&lt;br /&gt;&lt;br /&gt; H/W Specification&lt;br /&gt;&lt;br /&gt;System Processor  :  Pentium IV&lt;br /&gt;Processor Speed  : 2.80GHz&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3526415165859340453?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3526415165859340453'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3526415165859340453'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/multicast-routing-with-delay-and-delay.html' title='Multicast Routing with Delay and Delay- Variation Constraints for Collaborative Applications on Overlay Networks'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3336415053791016316</id><published>2010-06-20T01:18:00.004-07:00</published><updated>2010-06-20T01:19:47.400-07:00</updated><title type='text'>Measurement-Based Admission Control At Edge Routers</title><content type='html'>Abstract:-&lt;br /&gt; It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality of service (QoS). In this paper, we develop a scalable architecture and an algorithm for admission control of real-time flows. Since individual management of each traffic flow on each transit router can cause a fundamental scalability problem in both data and control planes, we consider that each flow is classified at the ingress router and data traffic is aggregated according to the class inside the core network as in a DiffServ framework. In our approach, admission decision is made for each flow at the edge (ingress) routers, but it is scalable because per-flow states are not maintained and the admission algorithm is simple. In the proposed admission control scheme, an admissible bandwidth, which is defined as the maximum rate of a flow that can be accommodated additionally while satisfying the delay performance requirements for both existing and new flows, is calculated based on the available bandwidth measured by edge routers. The admissible bandwidth is a threshold for admission control, and thus, it is very important to accurately estimate the admissible bandwidth. The performance of the proposed algorithm is evaluated by taking a set of simulation experiments using bursty traffic flows.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• This mechanism doesn’t guarantee the quality of service (QOS) and managing and allocation of the resources with real-time performance.&lt;br /&gt;&lt;br /&gt;• Here we have used reactive and preventive approaches to achieve quality of service In the reactive approaches, QOS is supported by adaptively changing the source traffic load based on the network status but this reactive approach may not be directly applicable to the applications which do not change the traffic rate adaptively.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Here we have used new algorithm named admission control to achieve&lt;br /&gt;Following &lt;br /&gt;&lt;br /&gt; The first one is to guarantee the contracted QoS for real-time flows.&lt;br /&gt;&lt;br /&gt; Another to achieve high network utilization.&lt;br /&gt;&lt;br /&gt;• The admissible bandwidth is calculated in advance and the admission decision is done by simple comparison, our scheme can perform admission control even for the requests arriving at the rate of up to the link rate&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3336415053791016316?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3336415053791016316'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3336415053791016316'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/measurement-based-admission-control-at.html' title='Measurement-Based Admission Control At Edge Routers'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-4222113922359227727</id><published>2010-06-20T01:18:00.003-07:00</published><updated>2010-06-20T01:19:24.172-07:00</updated><title type='text'>Incremental Learning of Chunk Data for Online Pattern Classification Systems</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt; This paper presents a pattern classification system in which feature extraction and classifier learning are simultaneously carried out not only online but also in one pass where training samples are presented only once. For this purpose, we have extended incremental principal component analysis (IPCA) and some classifier models were effectively combined with it. However, there was a drawback in this approach that training samples must be learned one by one due to the limitation of IPCA. To overcome this problem, we propose another extension of IPCA called chunk IPCA in which a chunk of training samples is processed at a time. In the experiments, we evaluate the classification performance for several large-scale data sets to discuss the scalability of chunk IPCA under one-pass incremental learning environments. The experimental results suggest that chunk IPCA can reduce the training time effectively as compared with IPCA unless the number of input attributes is too large. We study the influence of the size of initial training data and the size of given chunk data on classification accuracy and learning time. We also show that chunk IPCA can obtain major eigenvectors with fairly good approximation&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-4222113922359227727?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4222113922359227727'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/4222113922359227727'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/incremental-learning-of-chunk-data-for.html' title='Incremental Learning of Chunk Data for Online Pattern Classification Systems'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8102049163659816519</id><published>2010-06-20T01:18:00.002-07:00</published><updated>2010-06-20T01:19:07.064-07:00</updated><title type='text'>Image Restoration Using Space-Variant Gaussian Scale Mixtures in over complete Pyramids</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt; In recent years, Bayes least squares-Gaussian scale mixtures (BLS-GSM) have emerged as one of the most powerful methods for image restoration. Its strength relies on providing a simple and, yet, very effective local statistical description of oriented pyramid coefficient neighborhoods via a GSM vector. This can be viewed as a fine adaptation of the model to the signal variance at each scale, orientation, and spatial location. Here, we present an enhancement of the model by introducing a coarser adaptation level, where a larger neighborhood is used to estimate the local signal covariance within every subband. We formulate our model as a BLS estimator using space-variant GSM. The model can be also applied to image deconvolution, by first performing global blur compensation, and then doing local adaptive enoising. We demonstrate through simulations that the proposed method, besides being model-based and non iterative, it is also robust and efficient. Its performance measured visually and in L2-norm terms, is significantly higher than the original BLS-GSM method, both for denoising and deconvolution.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• Wiener filtering is one of the simplest model-based restoration methods, and yet it provides optimal results when dealing with Gaussian signals and noise.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Here we proposed an adaptive scalar Wiener method in the pixel domain, based on estimating the local variance at every spatial location of the image.&lt;br /&gt;&lt;br /&gt;Software Specifications:-&lt;br /&gt;Operating System : Windows XP&lt;br /&gt;Front end   : JAVA&lt;br /&gt;&lt;br /&gt;Hardware Specifications:-&lt;br /&gt;System Processor  :  Pentium IV&lt;br /&gt;Processor Speed  : 2.80GHz&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8102049163659816519?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8102049163659816519'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8102049163659816519'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/image-restoration-using-space-variant.html' title='Image Restoration Using Space-Variant Gaussian Scale Mixtures in over complete Pyramids'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-7109718390224805376</id><published>2010-06-20T01:18:00.001-07:00</published><updated>2010-06-20T01:18:42.543-07:00</updated><title type='text'>Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case</title><content type='html'>Abstract:-&lt;br /&gt;&lt;br /&gt;Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real networks that follow this model, for example, wildlife tracking sensor networks, military networks, vehicular ad hoc networks, etc. In this context, conventional routing schemes fail, because they try to establish complete end-to-end paths, before any data is sent. To deal with such networks researchers have suggested using flooding-based routing schemes. While flooding-based schemes have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance. Furthermore, proposed efforts to reduce the overhead of flooding-based schemes have often been plagued by large delays. With this in mind, we introduce a new family of routing schemes that “spray” a few message copies into the network, and then route each copy independently towards the destination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message, But also has lower average delivery delays than existing schemes; furthermore, it is highly scalable and retains good performance under a large range of scenarios. Finally, we use our theoretical framework proposed in our 2004 paper to analyze the performance of spray routing. We also use this theory to show how to choose the number of copies to be sprayed and how to optimally distribute these copies to relays&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• It uses conventional routing scheme to send the data from end – end.&lt;br /&gt;&lt;br /&gt;• It also uses Flooding-based schemes  have a high probability of delivery, they waste a lot of energy and suffer from severe contention which can significantly degrade their performance.&lt;br /&gt;&lt;br /&gt;• By using this schemes the delievery delay will be more.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• We use Spray  scheme to delievery the data from end- end points.&lt;br /&gt;&lt;br /&gt;• This scheme copy the data and send the data one after the other without any delievery delay.&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-7109718390224805376?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7109718390224805376'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/7109718390224805376'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/efficient-routing-in-intermittently.html' title='Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6786806783760517835</id><published>2010-06-20T01:15:00.007-07:00</published><updated>2010-06-20T01:17:39.388-07:00</updated><title type='text'>Efficient Resource Allocation for Wireless Multicast</title><content type='html'>Abstract:&lt;br /&gt;&lt;br /&gt;       In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group. Our mechanism enables more mobile hosts to cluster together and leads to the use of fewer cells to save the scarce wireless bandwidth. Besides, the paths in the multicast tree connecting to the selected cells share more common links to save the wireline bandwidth. Our mechanism supports the dynamic group membership and offers mobility of group members.&lt;br /&gt;&lt;br /&gt;              Moreover, our mechanism requires no modification to the current IP multicast routing protocols. We formulate the selection of the cell and the wireless technology for each mobile host in the heterogeneous wireless networks as an optimization problem. We use Integer Linear Programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on Lagrange a relaxation and a network protocol based on the algorithm. The simulation results show that our mechanism can effectively save the wireless and wireline bandwidth as compared to the traditional IP multicast.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• This mechanism will use huge bandwidth and overall cost of the system will be more.&lt;br /&gt;&lt;br /&gt;• This mechanism doesn’t select cell and wireless technology adaptively.&lt;br /&gt;&lt;br /&gt;•  This mechanism will use static group membership in mobility   the members &lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• This Mechanism reduces the total bandwidth cost of the IP multicast tree by adaptively selecting the cell and the wireless technology for each mobile host.&lt;br /&gt;&lt;br /&gt;• Protocol supports the dynamic group membership and mobility of members.&lt;br /&gt;&lt;br /&gt;Hardware Interface&lt;br /&gt;&lt;br /&gt;• Hard disk                :   40 GB&lt;br /&gt;• RAM                         :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                 :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface&lt;br /&gt;&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6786806783760517835?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6786806783760517835'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6786806783760517835'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/efficient-resource-allocation-for.html' title='Efficient Resource Allocation for Wireless Multicast'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2551607488358596557</id><published>2010-06-20T01:15:00.006-07:00</published><updated>2010-06-20T01:17:03.227-07:00</updated><title type='text'>Efficient Approximate Query Processing in Peer-to-Peer Networks</title><content type='html'>Abstract:&lt;br /&gt;&lt;br /&gt;      Peer-to-peer (P2P) databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large-scale ad hoc analysis queries, for example, aggregation queries, on these databases poses unique challenges. Exact solutions can be time consuming and difficult to implement, given the distributed and dynamic nature of P2P databases. In this paper, we present novel sampling-based techniques for approximate answering of ad hoc aggregation queries in such databases. Computing a high-quality random sample of the database efficiently in the P2P environment is complicated due to several factors: the data is distributed (usually in uneven quantities) across many peers, within each peer, the data is often highly correlated, and, moreover, even collecting a random sample of the peers is difficult to accomplish. To counter these problems, we have developed an adaptive two-phase sampling approach based on random walks of the P2P graph, as well as block-level sampling techniques. We present extensive experimental evaluations to demonstrate the feasibility of our proposed solution.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2551607488358596557?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2551607488358596557'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2551607488358596557'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/efficient-approximate-query-processing.html' title='Efficient Approximate Query Processing in Peer-to-Peer Networks'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6154720999205724054</id><published>2010-06-20T01:15:00.005-07:00</published><updated>2010-06-20T01:16:43.972-07:00</updated><title type='text'>A Lossless Compression Scheme for Bayer Color Filter Array Images</title><content type='html'>Abstract:&lt;br /&gt;&lt;br /&gt;      In most digital cameras, Bayer color filter array (CFA) images are captured and demosaicing is generally carried out before compression. Recently, it was found that compression- first schemes outperform the conventional demosaicing-first schemes in terms of output image quality. An efficient prediction-based lossless compression scheme for Bayer CFA images is proposed in this paper. It exploits a context matching technique to rank the neighboring pixels when predicting a pixel, an adaptive color difference estimation scheme to remove the color spectral redundancy when handling red and blue samples, and an adaptive codeword generation technique to adjust the divisor of Rice code for encoding the prediction residues. Simulation results show that the proposed compression scheme can achieve a better compression performance than conventional lossless CFA image coding schemes.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• Difficult to identify the neighboring pixels for predicting the existing samples value of the pixel.&lt;br /&gt;&lt;br /&gt;• No encoding techniques are used to encode the samples of the images. &lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Context matching technique is used to rank the neighbor pixels for predicting the existing samples value of the pixel.&lt;br /&gt;• Rice code encoding technique is used to encode the samples of the images.&lt;br /&gt;&lt;br /&gt;• This will provide best compression ratio.&lt;br /&gt;&lt;br /&gt; Hardware Interface:-&lt;br /&gt; [&lt;br /&gt;• Hard disk               :   40 GB&lt;br /&gt;• RAM                      :  512 MB&lt;br /&gt;• Processor Speed      :  3.00GHz&lt;br /&gt;• Processor               :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt; Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;br /&gt;• MS-SQL Server&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6154720999205724054?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6154720999205724054'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6154720999205724054'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/lossless-compression-scheme-for-bayer.html' title='A Lossless Compression Scheme for Bayer Color Filter Array Images'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-8416415656278451543</id><published>2010-06-20T01:15:00.004-07:00</published><updated>2010-06-20T01:16:19.625-07:00</updated><title type='text'>SAR Image Regularization With Fast Approximate Discrete Minimization</title><content type='html'>Abstract:&lt;br /&gt;&lt;br /&gt;Synthetic aperture radar (SAR) images, like other coherent imaging modalities, suffer from speckle noise. The presence of this noise makes the automatic interpretation of images a challenging task and noise reduction is often a prerequisite for successful use of classical image processing algorithms. Numerous approaches have been proposed to filter speckle noise. Markov random field (MRF) modelization provides a convenient way to express both data fidelity constraints and desirable properties of the filtered image. In this context, total variation minimization has been extensively used to constrain the oscillations in the regularized image while preserving its edges. Speckle noise follows heavy-tailed distributions, and the MRF formulation leads to a minimization problem involving nonconvex log-likelihood terms. Such a minimization can be performed efficiently by computing minimum cuts on weighted graphs. Due to memory constraints, exact minimization, although theoretically possible, is not achievable on large images required by remote sensing applications. The computational burden of the state-of-the-art algorithm for approximate minimization (namely the -expansion) is too heavy specially when considering joint regularization of several images. We show that a satisfying solution can be reached, in few iterations, by performing a graph-cut-based combinatorial exploration of large trial moves. This algorithm is applied to joint regularization of the amplitude and interferometric phase in urban area SAR images.&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• SAR images are difficult to interpret not only with automatic image processing tools but also by human interpreters. This is mainly due to two specificities of the SAR system: first, SAR is coherent imagery and, therefore, subject to the speckle phenomenon; secondly, due to the microwave propagation, images are distance sampled leading to strong geometrical distortions.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• The regularized images obtained both on synthetic and real data were satisfying. The algorithm is faster than existing graphcut- based techniques. We have shown that joint regularization can be performed with little computation overload. It helps preventing loss of small objects (over-regularization) by merging all information.&lt;br /&gt;&lt;br /&gt;Hardware Requirements:&lt;br /&gt;• Processor   :   Pentium Iv 2.6 Ghz&lt;br /&gt;• Ram    :   512 Mb Dd Ram&lt;br /&gt;• Monitor   :   15” Color&lt;br /&gt;• Hard Disk   :   20 Gb&lt;br /&gt;&lt;br /&gt;Software Requirements:&lt;br /&gt;• Front End                   :  Java, Swing&lt;br /&gt;• Operating System    :  Window’s&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-8416415656278451543?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8416415656278451543'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/8416415656278451543'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/sar-image-regularization-with-fast.html' title='SAR Image Regularization With Fast Approximate Discrete Minimization'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-245230537261995956</id><published>2010-06-20T01:15:00.003-07:00</published><updated>2010-06-20T01:15:54.525-07:00</updated><title type='text'>Progressive Parametric Query Optimization</title><content type='html'>Abstract&lt;br /&gt;&lt;br /&gt;           Commercial applications usually rely on precompiled parameterized procedures to interact with a database.Unfortunately, executing a procedure with a set of parameters different from those used at compilation time may be arbitrarily suboptimal. Parametric query optimization (PQO) attempts to solve this problem by exhaustively determining the optimal plans at each point of the parameter space at compile time. However, PQO is likely not cost-effective if the query is executed infrequently or if it is executed with values only within a subset of the parameter space. In this paper, we propose instead to progressively explore the parameter space and build a parametric plan during several executions of the same query. We introduce algorithms that, as parametric plans are populated, are able to frequently bypass the optimizer but still execute optimal or near-optimal plans.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• We have used different optimization techniques &lt;br /&gt;&lt;br /&gt; Optimize-Always.&lt;br /&gt; Optimize-Once.&lt;br /&gt;&lt;br /&gt;• Optimize-Always, is to call the optimizer and generate a new execution plan every time a new instance of the query is invoked.&lt;br /&gt;• Optimize-Once, is to optimize the query just once, with some set of parameter values, and reuse the resulting physical plan for any subsequent set of parameters.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• Parametric Query Optimization (PQO). At optimization time, PQO determines a set of plans such that for each point in the parameter space, there is at least one plan in the set that it is optimal.&lt;br /&gt;&lt;br /&gt;• No additional optimization call is required to execute each of the query instances.&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-245230537261995956?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/245230537261995956'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/245230537261995956'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/progressive-parametric-query.html' title='Progressive Parametric Query Optimization'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-3440690289043335546</id><published>2010-06-20T01:15:00.001-07:00</published><updated>2010-06-20T01:15:35.825-07:00</updated><title type='text'>pDCS: Security and Privacy Support for Data-Centric Sensor Networks</title><content type='html'>Abstract &lt;br /&gt;&lt;br /&gt;The demand for efficient data dissemination/access techniques to find relevant data from within a sensor network has led to the development of Data-Centric Sensor (DCS) networks, where the sensor data instead of sensor nodes are named based on attributes such as event type or geographic location. However, saving data inside a network also creates security problems due to the lack of tamper resistance of the sensor nodes and the unattended nature of the sensor network. For example, an attacker may simply locate and compromise the node storing the event of his interest. To address these security problems, we present pDCS, a privacy enhanced DCS network which offers different levels of data privacy based on different cryptographic keys. pDCS also includes an efficient key management scheme to facilitate the management of multiple types of keys used in the system. In addition, we propose several query optimization techniques based on Euclidean Steiner Tree and keyed Bloom Filter (KBF) to minimize the query overhead while preserving query privacy. Finally, detailed analysis and simulations show that the KBF scheme can significantly reduce the message overhead with the same level of query delay and maintain a very high level of query privacy.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• We have used external based storage data dissemination approach where an external base station (BS) is used for collecting and storing the sensing data.&lt;br /&gt;&lt;br /&gt;• If many queries are issued from nodes within the network external storage-based scheme is very inefficient since data must be sent back and forth between the sensors and the BS, thus causing the nodes close to the BS to die rapidly due to energy depletion.&lt;br /&gt;&lt;br /&gt;• All data of the same event type are stored at the same node so one can easily determine the locations of the sensors storing different types of data&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• pDCS is the first one to provide security and privacy to DCS networks.&lt;br /&gt;&lt;br /&gt;• It provides following features like&lt;br /&gt; Even if an attacker can compromise a sensor node and obtain all its keys, he cannot decrypt the data stored in the compromised node&lt;br /&gt; After an attacker has compromised a sensor node, he cannot know where this compromised node stored its event data generated in the previous time intervals.&lt;br /&gt;&lt;br /&gt; pDCS includes very efficient key management schemes for revoking a compromised node once its compromise has been detected.&lt;br /&gt;&lt;br /&gt; pDCS provides a novel query optimization scheme to significantly reduce the message overhead without losing any query privacy&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Hardware Interface:-&lt;br /&gt;• Hard disk                  :   40 GB&lt;br /&gt;• RAM                           :  512 MB&lt;br /&gt;• Processor Speed    :  2.20GHz&lt;br /&gt;• Processor                   :  Pentium  IV Processor&lt;br /&gt;&lt;br /&gt;Software Interface:-&lt;br /&gt;• JDK 1.5&lt;br /&gt;• Swing Builder&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-3440690289043335546?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3440690289043335546'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/3440690289043335546'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/pdcs-security-and-privacy-support-for.html' title='pDCS: Security and Privacy Support for Data-Centric Sensor Networks'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-2060618847678469658</id><published>2010-06-20T01:11:00.005-07:00</published><updated>2010-06-20T01:14:38.006-07:00</updated><title type='text'>GLIP: A Concurrency Control Protocol for Clipping Indexing</title><content type='html'>Abstract &lt;br /&gt;&lt;br /&gt;Multidimensional databases are beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast access to multidimensional data, for which the R+-tree exhibits outstanding search performance. In order to support efficient concurrent access in multiuser environments, concurrency control mechanisms for multidimensional indexing have been proposed. However, these mechanisms cannot be directly applied to the R+-tree because an object in the R+-tree may be indexed in multiple leaves. This paper proposes a concurrency control protocol for R-tree variants with object clipping, namely, Granular Locking for clIPping indexing (GLIP). GLIP is the first concurrency control approach specifically designed for the R+-tree and its variants, and it supports efficient concurrent operations with serializable isolation, consistency, and deadlock-free. Experimental tests on both real and synthetic data sets validated the effectiveness and efficiency of the proposed concurrent access framework.&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• As we are using multidimensional database to access the multi dimensional data we used multidimensional indexing trees the overlapping of nodes will tend to degrade query performance.&lt;br /&gt;• One single point query may need to traverse multiple branches of the tree if the query point is in an overlapped area the data will not be fetched from the database.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• We used concurrency control protocol with object clipping and also we have used Granular Locking for clipping indexing (GLIP), to provide phantom update protection for the R+-tree and its variants.&lt;br /&gt;&lt;br /&gt;• Granular Locking for clipping indexing provides a better indexing structure.&lt;br /&gt;&lt;br /&gt;Software Specifications:-&lt;br /&gt;Operating System : Windows XP&lt;br /&gt;Front end   : JAVA&lt;br /&gt;&lt;br /&gt;Hardware Specifications:-&lt;br /&gt;System Processor  :  Pentium IV&lt;br /&gt;Processor Speed  : 2.80GHz&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-2060618847678469658?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2060618847678469658'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/2060618847678469658'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/glip-concurrency-control-protocol-for.html' title='GLIP: A Concurrency Control Protocol for Clipping Indexing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry><entry><id>tag:blogger.com,1999:blog-9054341064925295351.post-6106507000726468581</id><published>2010-06-20T01:11:00.004-07:00</published><updated>2010-06-20T01:14:13.362-07:00</updated><title type='text'>Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing</title><content type='html'>Abstract:&lt;br /&gt;&lt;br /&gt;Large applications executing on Grid or cluster architectures consisting of hundreds or thousands of computational nodes create problems with respect to reliability. The source of the problems is node failures and the need for dynamic configuration over extensive runtime. This paper presents two fault-tolerance mechanisms called Theft-Induced Check pointing and Systematic Event Logging. These are transparent protocols capable of overcoming problems associated with both benign faults, i.e., crash faults, and node or subnet volatility. Specifically, the protocols base the state of the execution on a dataflow graph, allowing for efficient recovery in dynamic heterogeneous systems as well as multithreaded applications. By allowing recovery even under different numbers of processors, the approaches are especially suitable for applications with a need for adaptive or reactionary configuration control. The low-cost protocols offer the capability of controlling or bounding the overhead. A formal cost model is presented, followed by an experimental evaluation. It is shown that the overhead of the protocol is very small, and the maximum work lost by a crashed process is small and bounded.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;Existing System:-&lt;br /&gt;&lt;br /&gt;• Grid and cluster architectures consisting of hundreds or thousands of computational nodes create problems with respect to reliability.&lt;br /&gt;&lt;br /&gt;• Dynamic configure of fault is not achieved in this system.&lt;br /&gt;&lt;br /&gt;Proposed System:-&lt;br /&gt;&lt;br /&gt;• This system uses two mechanism to overcome the fault-tolerence&lt;br /&gt;&lt;br /&gt;They are:-&lt;br /&gt;&lt;br /&gt; Theft-Induced Checkpointing.&lt;br /&gt; Systematic Event Logging.&lt;br /&gt;&lt;br /&gt;• We can achieve dynamic configure of the fault.&lt;br /&gt;&lt;br /&gt;S/W Specifications:-&lt;br /&gt;Operating System : Windows XP&lt;br /&gt;Front end   : JAVA&lt;br /&gt;&lt;br /&gt;H/W Specification:-&lt;br /&gt;System Processor  :  Pentium IV&lt;br /&gt;Processor Speed  : 2.80GHz&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/9054341064925295351-6106507000726468581?l=pptcontent.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6106507000726468581'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/9054341064925295351/posts/default/6106507000726468581'/><link rel='alternate' type='text/html' href='http://pptcontent.blogspot.com/2010/06/flexible-rollback-recovery-in-dynamic.html' title='Flexible Rollback Recovery in Dynamic Heterogeneous Grid Computing'/><author><name>RaviChaitanya</name><uri>http://www.blogger.com/profile/11749740748121002957</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='16' height='16' src='http://img2.blogblog.com/img/b16-rounded.gif'/></author></entry></feed>
