Paper Presentations and Seminar Topics

PAPER PRESENTATION ON ROBOTICS

2010-02-17T13:04:00.001-08:00

ABSTRACT

In this world of science and technology robotics is one of the boom to the world. Recently, there has been increasing interest in the emerging field of robotics. Today’s robots are mechanical arms controlled by computers that are programmed to perform a range of handling activities. They are establishing themselves in manufacturing automation systems to produce a range of goods with great precision. The emerging era of robots calls for different types of skills. Entering non-industrial areas, the first fledgling robots for domestic use are coming off the production lines. Robots are being used in hazardous places, such as outer space or under the sea. Technical advances are gradually endowing robots with properties that actually increase their similarity to humans
In this paper we are going to present an idea of robotics and its applications in various fields that we come across. With their computational and agile skills robots perform tasks that are difficult or hazardous to humans. One area where robots are beginning to excel in, and which causes less controversial debate on their usefulness, is as explorers. The exploration of Mars has long been considered as a major goal in the exploration of the Solar System. This exploration is performed by using robots known as Mars Exploration Rovers. We are going to present a view of the rover and its operation.

APPLICATION OF DATA MINING IN NETWORK INTRUSION DETECTION

2010-02-17T13:02:00.000-08:00

ABSTRACT

Networks, especially those connected to the Internet, are rapidly increasing. As the seamless connectivity increases, the threat to the information resources on these networks increases. Security mechanisms using various algorithms have already been made and are commercially available. However the intrusion to the networks mutate at a rapid rate which have resulted in the quest for intelligent Intrusion detection Systems. This paper brings out the concepts of data mining and its applications in developing Intelligent Real time- Network Intrusion Detection Systems.

POSTER PRESENTATION BIOSENSORS: BIOLOGICAL ELEMENTS IN ANALYTICAL PROCESS

2010-02-17T13:01:00.000-08:00

ABSTRACT:-

Biosensors are devices or probes that employ a biological element for measuring the concentration of desired substance. These integrated systems with high degree of sensitivity, stability and specificity. Enzyme electrode, electrochemical, optical, thermal ion channel, immobilized cell biosensors are all the various types. Biosensors converts biochemical signal into electrical signal to detect analyte. Biosensors are one of the emerging areas in biotechnology with reaction independent, specific, tiny and biocompatible. These are widely used in pharmaceutical analysis. This presentation explains principle, types, working and application of Biosensors in analysis.

Security and Privacy in Wireless LAN

2010-02-17T13:00:00.001-08:00

ABSTRACT
Wireless local area networks (wireless LANs, or WLANs) are metamorphosing the landscape of computer networking. The use of mobile computing devices, such as laptops and personal digital assistants, coupled with the demand for continual network connections without having to "plug in," are driving the adoption of enterprise WLANs. Network managers are using WLANs to facilitate network moves, add-ons and changes. In addition, the inherent flexibility of WLANs overcomes limitations created by older buildings, leased spaces, or temporary work areas.
This topic is not only the most fundamental Internet Privacy and Security topic , but also arguably the most technical and complex one. When we think about computer security, networking security will surely be at the top of our list of considerations, as so many threats to our privacy and security are network borne.. So Ours is a little effort in laying out an advice for the future technocrats in making sure of their ideas and to give them the information which they can use it in a right way.

This paper not only furnishes the details about Wireless LANs but also bestows an abundant number of methods in which the security of these WLANs can be breached. It also contributes a myriad number of ways in which one can thwart the potential assault on the WLANs network.
KEYWORDS:
Wireless LAN
Security
Hacking
Access points.

EMBEDDED SYSTEMS AND VLSI An Architectural Approach To Reduce Leakage Energy In Memory

2010-02-17T12:57:00.000-08:00

The advance in the semiconductor technology has paved way for increasing the density of transistors per chip. The amount of information storable on a given amount of silicon has roughly doubled every year since the technology was invented. Thus the performance of the processor improved and the chips’ energy dissipation increased in each processor generation. This created awareness for designing low power circuits. Low power is important in portable devices because the weight and size of the device is determined by the amount of battery needed which in turn depends on the amount of power dissipated in the circuit. The cost involved in providing power and associated cooling, reliability issues, expensive packaging made low power a concern in nonportable applications like desktops and servers too. Even though most power dissipation in CMOS CPUs is dynamic power dissipation (which is a function of frequency of operation of the device and the switching capacitance), leakage power (function of number of on-chip transistors) is also becoming increasingly significant as leakage current flows in every transistor that is on, irrespective of signal transition. Most of the leakage energy comes from memories, since cache occupies much of CPU chip’s area and has more number of transistors, reducing leakage in cache will result in a significant reduction in overall leakage energy of the processor. This paper suggests an architectural approach for reducing leakage energy in caches.
Various approaches have been suggested both in architecture and circuit level to reduce leakage energy. One approach is to count the total number of misses in a cache and upsize/ downsize the cache depending on whether the miss count is greater or lesser than a preset value. The cache dynamically resizes to the application’s required size and the unused sections of the cache are shut off. Another method called cache decay turns off the cache lines when they hold data not likely to be reused. The cache lines are shut off during their dead time that is during the time after the last access and before the eviction. After a specific number of cycles have elapsed and still if the data is unused then that cache line is shut off. Another approach was to disable portion of the cache ways called selective cache ways. This method, which is application sensitive, enables all the cache ways (a way is one of the n sections in an n-way set associative cache) when high performance is required and enables only a subset of the ways when cache demands are not high.
This paper is organized as follows, section 1 narrates the work done related to this problem, section 2 describes our approach, which uses a time based decay policy in a partitioned architecture of level – 2 cache and finally section 3 presents the conclusion.

IMAGE COMPRESSION AND DENOISING BASED ON TREE ADOPTED WAVELET SHRINKAGE

2010-02-17T12:56:00.000-08:00

ABSTRACT:
An algorithm is described for simultaneously compressing and denoising images. The algorithm is called tree-adapted wavelet shrinkage and compression (TAWS-Comp). TAWS-Comp is a synthesis of an image compression algorithm, adaptively scanned wavelet difference reduction (ASWDR), and a denoising algorithm, tree-adapted wavelet shrink age (TAWS). As a Compression procedure, TAWS-Comp inherits all of the advantages of ASWDR: its ability to achieve a precise bit-rate assigned before compressing, its scalability of decompression, and its capability for enhancing regions-of interest. Such a full range of features has not been available with previous compressor plus denoiser algorithms. As a denoising procedure, TAWS-Comp is nearly as effective as TAWS alone. TAWS has been shown to have good performance, comparable to state of the art denoisers. In many cases, TAWS-Comp matches the performance of TAWS while simultaneously performing compression. TAWS-Comp is compared with other combined compressor/denoisers, in terms of error reduction and compressed bit-rates. Simultaneous compression and denoising is needed when images are acquired from a noisy source and storage or transmission capacity is severely limited (as in some video coding applications). An application is described where the features of TAWS-Comp as both compressor and denoiser are exploited.
Keywords: image compression; image denoising; signal processing; video coding.

THREE STEP DIAMOND SEARCH ALGORITHM FOR BLOCK-MATCHING

2010-02-17T12:55:00.000-08:00

Abstract:

In video coding, block-based motion estimation plays a vital role for video compression. There are few block matching algorithms existing for motion estimation and motion compensation. In this paper a three step diamond search algorithm is proposed. The performance of this algorithm is compared with other algorithms by means of error metrics and number of search points. This algorithm achieves close performance with that of TSS. It uses less number of search points than TSS. When compared with original DS algorithm, this algorithm requires less computation time and gives an improved performance.

Key words-
Block based motion estimation, Block matching algorithm, search pattern, Diamond search.

DIGITAL SIGNAL PROCESSING “SPEECH RECOGNITION”

2010-02-17T12:53:00.000-08:00

ABSTRACT:

This paper deals with the process of automatically recognizing who is speaking on the basis of individual information included in speech waves. Speaker recognition methods can be divided into text-independent and text-dependent methods. In a text-independent system, speaker models capture characteristics of somebody's speech, which show up irrespective of what one is saying. In a text-dependent system, on the other hand, the recognition of the speaker's identity is based on his or her speaking one or more specific phrases, like passwords, card numbers, PIN codes, etc. This

paper is based on text independent speaker recognition system and makes use of mel frequencepstrum coefficients to process the input signal and vector quantization approach to identify the speaker. The above task is implemented using MATLAB. This technique is used in application areas such as control access to services like voice dialing, banking by telephone, database access services, voice mail, security control for confidential information areas, and remote access to computers.

Tracking the Source of Spoofed IP Packets (Network security)

2010-02-17T12:51:00.000-08:00

ABSTRACT

This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back toward their source. This work is motivated by the increased frequency and sophistication of denial-of-service attacks and by the difficulty in tracing packets with incorrect, or “spoofed,” source addresses. In this paper, we describe a general purpose trace back mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic without requiring interactive operational support from Internet Service Providers (ISPs). Moreover, this traceback can be performed “post mortem”—after an
attack has completed. We present an implementation of this technology that is incrementally deployable, (mostly) backward compatible, and can be efficiently implemented using conventional technology.

Denial-Of-Service(DOS) attacks consume the resources of a remote host or network, thereby denying or degrading service to legitimate users. Such attacks are among the hardest security problems to address because they are simple to implement, difficult to prevent, and very difficult to trace.our paper mainly emphasizes on this area and focusses on this aspect.

BLUETOOTH

2010-02-17T12:50:00.000-08:00

One of the things that may cause conflicts for Bluetooth is that it uses the same frequency as the Wavelan standard. Another problem for Bluetooth is when there are a number of mobile devices in the same room, and possibly attempting the same operation. Since Bluetooth is omni-directional, it encounters problems in discovering the intended recipient device. Bluetooth devices must perform a discovery operation that will likely find many other devices in the same room. At this point, the user must choose the proposed recipient, which will require special information. Furthermore, Bluetooth has so many security mechanisms that it would have to carry out in order to prevent eavesdropping.

BLUETOOTH

2010-02-17T12:44:00.000-08:00

ABSTRACT:-

“Bluetooth is a high-speed, low-power microwave wireless link technology, designed to connect phones, laptops and other portable equipment together with little or no work by the user.” Bluetooth networking transmits data via low-power radio waves. It communicates on a frequency of 2.45 gigahertz (actually between 2.402 GHz and 2.480 GHz, to be exact). This frequency band has been set aside by international agreement for the use of industrial, scientific and medical devices (ISM). It can connect upto 8 devices. It supports multipoint,not just just point to point and works in a small confined area(10-15mts) apart.It is able to support speeds of 1-2 Mbps today but will offer high speeds in future.
Bluetooth uses a technique called spread-spectrum frequency hopping that makes it rare for more than 1 device to be transmitting on the same frequency at the same time.
A master Bluetooth device can communicate with upto 7 devices.This network group of upto 8 devices is called a Piconet.It allows connecting 2 or more Piconets and is called as Scatternet.
Bluetooth offers several security modes to overcome the problems of ‘Bluejacking’ and ‘Bluebugging’. Most prevalent applications of Bluetooth are as wireless control of communication between a mobile phone and a hands-free handset, between PC input and

output devices,wireless networking in between PC’s in a confined space and where little bandwidth is required. When we compare between Wi-Fi and Bluetooth then we can say that latter is used for lesser distances and former is for greater distances(wireless Ethernet).To use this technology benefits computer requires Bluetooth USB dongle or Bluetooth card or Bluetooth adapters . Apple,Microsoft,Linux operating systems supports this technology.Bluetooth specifications were formalized by the Bluetooth Special Interest Group(SIG) organized by Mohd syarifuddin and today it has over 7000 companies worldwide(Ericsson,IBM,Intel,Toshiba,Nokia,….) .In Bluetooth technology different versions has been developed day by day and at present the latest version was 3.0 ,it has included ultra-wideband radio technology .This will allow Bluetooth use over UWB radio enables very fast data transfers of up to 480 Mbits.

NETWORK SECURITY AND CRYPTOGRAPHY

2010-02-17T12:41:00.000-08:00

ABSTRACT

For the first few decades of the existence of the computer networks, they were primarily used for email and for sharing printers. Under these conditions, security did not get a lot of attention. But now, as millions of ordinary citizens are using networks for banking, business dealings, military etc.., network security is looming on the horizon as a potentially massive problem. Most security problems are intentionally caused by malicious people trying to gain some benefit or harm someone.

Many methods like firewalls, VPN, authentication, encryption and cryptography have been devised to provide proper security strategy. Among all these methods, the most secured method is cryptography. Cryptography is the process of converting the message into coded language (encryption). The breaking of the coded message is called decryption. Cryptography covers the areas of authentication and encryption.
Cryptography includes methods like code and code books, steganography and ciphers. Ciphers play the key role in cryptography. Symmetric cipher consists of a key called secret key used for both encryption and decryption. Asymmetric cipher consists of keys called public key (non-secret key) and private key (secret key). Substitution and transposition are the two methods of encryption. Substitution is the method of replacing the original letter with the duplicate. Transposition is the rearrangement of the given plain-text.
Encrypting the message deals with many algorithms like DES, AES, RSA, MD5, SHA-1,etc...
DES is a secret key algorithm. RSA is a public key algorithm. Algorithms like DES, RSA cannot shorten the long length messages. The solution is to digest the messages using a hash function. The two most common hash functions are called MD5 and SHA-1. MD5 is ideal for authentication purposes. MD5 algorithm produces 128-bit message digest output. It is slightly faster than SHA-1. Thus without proper network security, whatever may be the developments in the networks, we cannot efficiently utilize the benefits.

REMOTE ELECTRICITY METERING AND POWER THEFT DETECTION THROUGH POWER LINE COMMUNICATION

2010-02-17T12:39:00.000-08:00

Abstract - India has the reputation of having the highest transmission and distribution losses in the world with a massive 38 percent loss. Independent studies show that much of these losses are due power theft and unaccounted electricity. No wonder the Supreme Court of India directed the setting up of seven special courts to deal with cases of power theft. This paper suggests a cost effective model for remote metering of electricity and prevention of illegal electricity usage through Power line communication (PLC). PLC is a technology that sends data through existing electric cables, is set to turn the electricity distribution grid, the largest existing network in the world, into a data transmission network. The power line being a harsh environment for data transmission, this paper proposes suitable modulation techniques and medium access control methods. FSK modulation enables cheap implementation and suits the low data rate requirement, ALOHA and Polling techniques are suggested for medium access control. The Remote Electricity Metering (REM) gets rid of the expenses involved in manual metering, which is also prone to human errors and illegal accounting. The Power Theft Detector (PTD) module enables to detect where electricity is illegally tapped and instantaneously alerts the Central Power Station requesting for suitable action like tripping of power supply to that particular point. By the combination of these two proposed systems, tremendous savings could be realized in the power sector.

Keywords - PLC, Remote electricity metering, Power theft prevention.

BRA: A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks

2010-01-29T22:28:00.000-08:00

Abstract:

Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon’s. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. This paper first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to routing protocols. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: improved connectivity by taking advantage of the unidirectional links, reverse route forwarding of control packets to enable off-the-shelf routing protocols, and detection packet loss on unidirectional links. Extensive simulations of AODV layered on BRA show that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV, which only routes on bidirectional links. Index Terms—Ad hoc network, asymmetry, routing, unidirectional

Existing System:-

• Unidirectional links have short (one to three hop) paths connecting them in the reverse direction.

• Unidirectional links with short reverse paths significantly increases the stability of the routes and leads to better connectivity overall, without significant overhead.

Proposed System:-

• BRA takes the approach of discovering and maintaining reverse paths for unidirectional links.

• It improves connectivity between nodes by finding new or better routes through unidirectional links.

• Provides reverse-route forwarding for unidirectional links, which makes them appear as bidirectional links.

Hardware Specification:

PROCESSOR : PENTIUM IV 2.6 GHz,RAM : 512 MB DD RAM,MONITOR : 15” COLOR,HARD DISK : 20 GB

Software Specification:

Front End : Java, Swing, Tools Used : JFrameBuilder,Operating System : WindowsXP

An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis

2010-01-29T22:23:00.000-08:00

Abstract:

There is significant interest in the data mining and network management communities about the need to improve existing techniques for clustering multivariate network traffic flow records so that we can quickly infer underlying traffic patterns. In this paper, we investigate the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner. We develop a framework to deal with mixed type attributes including numerical, categorical, and hierarchical attributes for a one-pass hierarchical clustering algorithm. We demonstrate the improved accuracy and efficiency of our approach in comparison to previous work on clustering network traffic.

Modules:

1 Cluster Formation in Echidna

2 Radius Calculations

3 Determining Parameters

4 Testing

Problem Domain:

Investigation of the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner.

Existing System:-

• No efficient clustering scheme used in generating reports about the network traffic.

• There is no proper key distribution technique was used.

Proposed System:-

• Clustering scheme called Echidna for generating summary reports of significant traffic flows in network traces.

• The key contributions of our scheme are the introduction of a new distance measure for hierarchically structured attributes such as IP addresses and a set of heuristics to summarize and compress reports of significant traffic clusters from a hierarchical clustering algorithm.

Hardware requirements:

Windows XP,2000,Hard disk:40GB,Processor Pentium4,1.33MHZ,RAM 512MB,LAN

Software requirements:

JDK1.6.0 ,Java run time environment

Database Tuning

2010-01-29T22:05:00.000-08:00

Tuning goals:

To make applications run faster,To lower the response time of queries/transactions,To improve the overall throughput of transactions,But why do we even need it? Do databases suddenly start running slowly?

DBMS statistics Storage statistics:

Data about allocation of storage into table-spaces, index-spaces, and buffer pools

I/O and device performance statistics:

Total read/write activity (paging) on disk extents and disk hot spots.

Query/transaction processing statistics:

Execution times of queries and transactions, optimization times during query optimization.

Locking/logging related statistics:

Rates of issuing different types of locks, transaction throughput rates, and log records activity

Index statistics:

Number of levels in an index, number of non-contiguous leaf pages, etc.

Tuning the Database Design

The entire database design has to be driven by the processing requirements as much as by data requirements.

If the processing requirements are dynamically changing, the design needs to respond by making changes to the conceptual schema if necessary and to reflect those changes into the logical schema and physical schema.

Existing tables may be merged (de-normalized) because certain attributes from two or more tables are frequently needed together: This reduces the normalization level from 4NF or BCNF to 3NF or even to 2NF - but it will go faster (cost of maintaining consistency Vs cost of join etc)!

Summary

Inefficiency of a query may be corrected by some several corrective actions such as using specific indexes, avoiding certain types of constructs, or avoiding use of views.

The problems and the remedies will depend upon the dynamics of the execution environment and workings of the query optimizer within an RDBMS

Detailed recommendations are typically provided in database tuning guideline manuals for database administration by the individual RDBMS vendors.

Web Databases Seminar

2010-01-29T20:48:00.000-08:00

What are web databases?

easy access to information,dynamic content,efficient data collection and modification,conduits to legacy systems

Types of Tools

Extensions to existing database tools,HTML editors with database capabilities,Web database application servers,Programmatic tools or components for web database construction

Why Use Web Databases?

the web is a great medium for delivering information,databases are the perfect medium for managing information

Web Advantages

relatively easy to create pages,wide dissemination of material,cost is not an entry barrier

Web Disadvantages

static,primitive page layout,labor-intensive for large sites,incompatibilities (browser, server, languages),technology moves quickly

Database Advantages

well-established class of application,relatively easy to repurpose data,standard query language (SQL),efficient data storage

Database Disadvantages

tough to design,difficult to administer,limited access

Web Database Advantages

easy access to data,content can be repurposed,dynamic web content

Web Database Disadvantages

learning curve,can be expensive,security and copyright concerns,not indexed by search engines

Popularity of Web Databases

Web sites are hard to manage and maintain,The Web is chaotic (by definition!),Businesses are embracing the Web,corporations are run by databases

Continuous Monitoring of Spatial Queries in Wireless Broadcast Environments.

2010-01-29T20:06:00.001-08:00

EXISTING SYSTEM:

 Previous wireless broadcast system has only considered snapshot queries over static data .

 Broadcasting is done in such a way that ,whole processing occurs at server.

Disadvantages:

 It doesn’t work for moving objects.

 Heavy load at the server degrades the performance.

 More power consumption(more tuning time) and access latency .

PROPOSED SYSTEM:

 Server broadcasts the index of objects after updation(if any) so that client tunes into broadcast channel and process the queries locally.

 It uses BGI(Broadcast Grid Index) ,which extends to the case that the data are also dynamic.

 Server uses air indexing to broadcast the data.

Advantages:

 Air indexing helps in terms of energy consumption and access latency.

 Load at the server is reduced.

 Works efficiently for moving objects also.

Voice over Internet Protocol : Abstract

2010-01-22T03:17:00.000-08:00

Abstract:
Whenever there is a new need of communication, it has parallel effect on communication technologies. From symbolic and sign language to the current Internet, the role of communication technologies drastically changed their face. Today, we are provided with various kinds of communication technologies, which are shaped up according to the user needs. Whether it is a simple Fax or a telephonic conversation or an E-mail, each one is intended to satisfy a specific need of user.
Though each mean of communication has its own advantages & significance, apparently voice communication is more popular and predominant in our society. The unique advantage of real time experience of telephonic conversation made it more popular among all other means of communication. Though it is popular, providing such communication at reasonable costs is still remains a challenge. Considering the fact that cost reduction is not possible in the current telephonic system the only option left to us is to develop alternative voice communication technologies which can provide services at low cost.
The development of Internet has opened the doors to explore the alternative means of voice communications. The Internet telephony is not just a mere alternate of voice communication, but it is a revolutionary concept, since it is the most effective way of reducing the costs of voice communication. The Internet telephony communication is done by using VOIP and is an acronym for Voice over Internet Protocol, or in more common terms phone service over the Internet. To establish this communication we have to develop VOIP Client & VOIP Server.

Data Clustering using Particle Swarm Optimization : Abstract

2010-01-22T03:16:00.000-08:00

Abstract:
This paper proposes two new approaches to using PSO to cluster data. It is shown how PSO can he used to find the centroids of a user specified number of clusters. The algorithm is then extended to use K-means clustering to seed the initial swarm. This second alga. rithm basically uses PSO to refine the clusters formed by K-means. The new PSO Algorithms are evaluated on six data sets, and compared to the performance of K-means clustering. Results show that both PSO clustering techniques have much potential.

Software Requirements
· Operating System : Windows 2000/xp
· Language: Java

Hardware Requirements
· Pentium III processor
· 128 bit RAM
· Hard disk according to the required storage

A Practical Method for Watermarking Java Programs : Abstract

2010-01-22T03:14:00.000-08:00

Abstract:
Java programs distributed through Internet are now suffering from program theft. It is because Java programs can be easily decomposed into reusable class files and even decompiled into source code by program users. In this paper we propose a practical method that discourages program theft by embedding Java programs with a digital watermark. Embedding a program developer’s copyright notation as a watermark in Java class files will ensure the legal ownership of class files. Our embedding method is indiscernible by program users, yet enables us to identify an illegal program that contains stolen class files. The result of the experiment to evaluate our method showed most of the watermarks (20 out of 23) embedded in class files survived two kinds of attacks that attempt to erase watermarks: an obfuscactor attack, and a decompile-recompile attack.

Software Requirements
· Operating System : Windows 2000/xp
· Language: Java

Hardware Requirements

· Pentium III processor
· 128 bit RAM
· Hard disk according to the required storage

ROOK: Multi-Session based Network Security Event Detector : Abstract

2010-01-22T03:11:00.000-08:00

Abstract:
We have implemented Multi-Session based Network Security Event Detector: ROOK to detect botnet activity and P2P file sharing traffic and our results show that our method is less false positives than existing network security event detectors (e.g. IDS). We proposed a network security event detection method by analyzing correlation among multiple sessions. Our method can recognize hosts behaviors by rules that describe multi-session correlations: a rule includes the order of starting sessions and information exchange between sessions. By this method, ROOK detected DNS and IRC activities of bots in the experiment.

Existing System
Existing SED’s methods mostly use features of a single session and a single packet as detection triggers.
Method 1: The first method is disguising malware traffic as innocent traffic.
Method 2: Using Encryption.
The software encrypts not only the contents but also the protocol headers to avoid detection. However the methods have problems distinguishing between malwares and P2P file sharing programs.

Proposed System
They proposed a network security event detection method by analyzing correlation among multiple sessions. Our method can recognize hosts behaviors by rules that describe multi-session correlations:

Hardware requirements:
Windows XP,2000
Hard disk:40GB
Processor Pentium4,1.33MHZ
RAM 512MB
LAN

Software requirements:
JDK1.6.0
Java run time environment

Route Reservation in Ad Hoc Wireless Networks : Abstract

2010-01-22T03:09:00.000-08:00

Abstract:
This paper investigates whether and when route reservation-based (RB) communication can yield better delay performance than non-reservation-based (NRB) communication in ad hoc wireless networks. In addition to posing this fundamental question, the requirements (in terms of route discovery, medium access control (MAC) protocol, and pipelining, etc.) for making RB switching superior to NRB switching are also identified. A novel analytical framework is developed and the network performance under both RB and NRB schemes is quantified. It is shown that if the aforementioned requirements are met, then RB schemes can indeed yield better delay performance than NRB schemes. This advantage, however, comes at the expense of lower throughput and goodput compared to NRB schemes.

Hardware Interface
· Hard disk : 40 GB
· RAM : 512 MB
· Processor Speed : 3.00GHz
· Processor : Pentium IV Processor

Software Interface
· JDK 1.5
· Swing Builder
· MS-SQL Server

Visual Similarity Based Image Retrieval : Abstract

2010-01-22T03:06:00.000-08:00

Abstract:
Image database management and retrieval has been an active research area since the 1970s. With the rapid increase in computer speed and decrease in memory cost, image databases containing thousands or even millions of images are used in many application areas such as medicine, satellite imaging, and biometric databases, where it is important to maintain a high degree of precision. With the growth in the number of images, manual annotation becomes infeasible both time and cost-wise.
Content-based image retrieval (CBIR) is a powerful tool since it searches the image database by utilizing visual cues alone. CBIR systems extract features from the raw images themselves and calculate an association measure (similarity or dissimilarity) between a query image and database images based on these features. CBIR is becoming very popular because of the high demand for searching image databases of ever-growing size. Since speed and precision are important, we need to develop a system for retrieving images that is both efficient and effective.
Recent approaches to represent images require the image to be segmented into a number of regions (a group of connected pixels which share some common properties). This is done with the aim of extracting the objects in the image. However, there is no unsupervised segmentation algorithm that is always capable of partitioning an image into its constituent objects, especially when considering a database containing a collection of heterogeneous images. Therefore, an inaccurate segmentation may result in an inaccurate representation and hence in poor retrieval performance.
Contour-based CBIR technique uses a new approach to describe the shape of a region, inspired by an idea related to the color descriptor in. This new shape descriptor, called Directional Fragment Histogram (DFH), is computed using the outline of the region. One way of improving its efficiency would be to reduce the number of image comparisons done at query time. This can be achieved by using a metric access structure or a filtering technique.

EXISTING CBIR SYSTEMS
IBM’s QBIC system is the first commercial CBIR system and probably the best known of all CBIR systems. QBIC supports users to retrieval images by color, shape and texture. QBIC provides several query methods: Simple, Multi-feature and Multi-pass. In the simple method, a query is processed using only one feature. A Multi-feature query involves more than one feature and all features have equal weights during the search. A Multi-pass query uses the output of a previous query as the basis for further refinements. Users can draw and specify color and texture color and texture patterns in desired images. In QBIC, the color similarity is computed by quadratic metric using k-element color histograms and the average colors are used as filters to improve query efficiency. Its shape function retrieves images by shape area, circularity, eccentricity and major axis orientation. Its texture function retrieves images by global coarseness, contrast and directionality features.

PRACTICAL APPLICATIONS OF CBIR
A wide range of possible applications for CBIR technology are
1. Crime prevention: Law enforcement agencies typically maintain large archives of visual evidence including past suspects facial photographs, fingerprints and shoe prints. Whenever a serious crime is committed, they can compare evidence from the scene of the crime for its similarity to records in their archives.
2. Military: Recognition of enemy aircraft from radar screens, identification of targets from satellite photographs, and provision of guidance systems for cruise missiles are some of the examples in military field.
3. Intellectual property: Trademark image registration, where a new mark is compared with existing marks to ensure that there is no risk of confusion, has long been recognized as a prime application area for CBIR. Copyright protection is also a potentially important application area.
4. Architecture and engineering design: Architectural and engineering design share a number of common features- the use of stylized 2-D and 3-D models to represent design objects, the need to visualize designs for the benefit of non-technical clients and the need to work within externally-imposed constraints, often financial. Such constraints mean that the designer needs to be aware of previous designer needs to aware of previous designs, particularly if these can be adapted to the problem at hand.

5. Fashion and interior design: Similarities can be observed in the design process in other fields, including fashion and interior design. Here again the designer has to work within externally imposed constraints, such as choice of materials. The ability to search a collection of fabrics to find a particular combination of color or texture is increasingly being recognized as a useful aid to the design process.
6. Journalism and advertising: Both newspapers and stock shot agencies maintain archives of still photographs to illustrate articles or advertising copy. These archives can often be extremely large (running into millions of images), and dauntingly expensive to maintain if detailed keyword indexing is provided. Hence CBIR techniques are very useful here.
7. Medical diagnosis: The increasing reliance of modern medicine on diagnostic techniques such as radiology, histopathology, and computerized tomography has resulted in am explosion in the number and importance of medical images now stored by most hospitals. While the prime requirement for medical imaging systems is to be able to display images relating to a named patient, there is increasing interest in the use of CBIR techniques to aid diagnosis by identifying similar past cases.
8. Geographical information and remote sensing systems: Agriculturalists and physical geographers use images (searching by spatial attribute) extensively, both in research and for more practical purposes, such as identifying areas where crops are diseased or lacking in nutrients- or alerting governments to farmers growing crops on land they have paid to leave lying fallow.
9. Education and training: The availability of searchable collections of video clips providing examples of avalanches for a lecture on mountain safety, or traffic congestion for a course on urban planning, could reduce preparation time and lead to improve teaching quality. In some cases such videos might even replace a human tutor.
10. Home entertainment: Much home entertainment is image or video-based, including holiday snapshots, home videos and scenes from favorite TV programmers or films. Possible applications could include management of family photo albums.

Operating Environment
· This model is intended to be used in a software organization or a research environment
· The software will be running on an average personal desktop computer that has a Win95/98/00/NT OS

Hardware Interfaces:
The software will be built using the java application. Hence, the back-end interfacing with the OS (Win family) will not be a concern for the software

Controlling IP Spoofing through Inter domain Packet Filters : Abstract

2010-01-22T02:58:00.000-08:00

Abstract:-
The Distributed Denial-of-Service (DDoS) attack is a serious threat to the legitimate use of the Internet. Prevention mechanisms are thwarted by the ability of attackers to forge or spoof the source addresses in IP packets. By employing IP spoofing, attackers can evade detection and put a substantial burden on the destination network for policing attack packets. In this paper, we propose an interdomain packet filter (IDPF) architecture that can mitigate the level of IP spoofing on the Internet. A key feature of our scheme is that it does not require global routing information. IDPFs are constructed from the information implicit in Border Gateway Protocol (BGP) route updates and are deployed in network border routers. We establish the conditions under which the IDPF framework correctly works in that it does not discard packets with valid source addresses. Based on extensive simulation studies, we show that, even with partial deployment on the Internet, IDPFs can proactively limit the spoofing capability of attackers. In addition, they can help localize the origin of an attack packet to a small number of candidate networks.

Existing System:-
· IP Spoofing has been used to filter the packets but there is a possibility of missing the packets while spoofing.

Proposed System:-
· Inter domain packet filters has been used to filter the packets.
· IDPF (Inter Domain Packet Filter) rely on BGP update messages exchanged on the Internet to infer the validity of source address of a packet forwarded by a neighbor.
· IDPF framework can correctly work without discarding any valid packets.

Hardware Specification:
Processor : Pentium Iv 2.6 Ghz
Ram : 512 Mb Dd Ram
Monitor : 15" Color
Hard Disk : 20 Gb

Software Specification:
Front End : Java, Swing
Tools Used : JFrameBuilder
Operating System: WindowsXP

Computation-Efficient Multicast Key Distribution :Abstract

2010-01-22T02:56:00.000-08:00

Abstract:
Efficient key distribution is an important problem for secure group communications. The communication and storage complexity of multicast key distribution problem has been studied extensively. In this paper, we propose a new multicast key distribution scheme whose computation complexity is significantly reduced. Instead of using conventional encryption algorithms, the scheme employs MDS codes, a class of error control codes, to distribute multicast key dynamically. This scheme drastically reduces the computation load of each group member compared to existing schemes employing traditional encryption algorithms. Such a scheme is desirable for many wireless applications where portable devices or sensors need to reduce their computation as much as possible due to battery power limitations. Easily combined with any key-tree-based schemes, this scheme provides much lower computation complexity while maintaining low and balanced communication complexity and storage complexity for secure dynamic multicast key distribution.

Existing System:-
· Here Encryption and decryption techniques are used for distributed group keys.
· This scheme works only for predefined static groups.

Proposed System:-
· Session keys are encoded using error control codes to achieve lower computation complexity than existing encryption and decryption algorithms.
· Scheme allows dynamic group membership changes with very low storage complexity.

Hardware Specification:
Processor : Pentium Iv 2.6 Ghz
Ram : 512 Mb Dd Ram
Monitor : 15" Color
Hard Disk : 20 Gb

Software Specification:
Front End : Java, Swing
Tools Used : JBuilder
Operating System : WindowsXP

BRA: A Bidirectional Routing Abstraction for Asymmetric Mobile Ad Hoc Networks : Abstract

2010-01-22T02:53:00.000-08:00

Abstract:
Wireless links are often asymmetric due to heterogeneity in the transmission power of devices, non-uniform environmental noise, and other signal propagation phenomenon’s. Unfortunately, routing protocols for mobile ad hoc networks typically work well only in bidirectional networks. This paper first presents a simulation study quantifying the impact of asymmetric links on network connectivity and routing performance. It then presents a framework called BRA that provides a bidirectional abstraction of the asymmetric network to routing protocols. BRA works by maintaining multi-hop reverse routes for unidirectional links and provides three new abilities: improved connectivity by taking advantage of the unidirectional links, reverse route forwarding of control packets to enable off-the-shelf routing protocols, and detection packet loss on unidirectional links. Extensive simulations of AODV layered on BRA show that packet delivery increases substantially (two-fold in some instances) in asymmetric networks compared to regular AODV, which only routes on bidirectional links. Index Terms—Ad hoc network, asymmetry, routing, unidirectional

Existing System:-
· Unidirectional links have short (one to three hop) paths connecting them in the reverse direction.
· Unidirectional links with short reverse paths significantly increases the stability of the routes and leads to better connectivity overall, without significant overhead.

Proposed System:-
· BRA takes the approach of discovering and maintaining reverse paths for unidirectional links.
· It improves connectivity between nodes by finding new or better routes through unidirectional links.
· Provides reverse-route forwarding for unidirectional links, which makes them appear as bidirectional links.

Hardware Specification:
PROCESSOR : PENTIUM IV 2.6 GHz
RAM : 512 MB DD RAM
MONITOR : 15" COLOR
HARD DISK : 20 GB

Software Specification:
Front End : Java, Swing
Tools Used : JFrameBuilder
Operating System : WindowsXP

An Efficient Clustering Scheme to Exploit Hierarchical Data in Network Traffic Analysis : Abstract

2010-01-22T02:50:00.000-08:00

Abstract:
There is significant interest in the data mining and network management communities about the need to improve existing techniques for clustering multivariate network traffic flow records so that we can quickly infer underlying traffic patterns. In this paper, we investigate the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner. We develop a framework to deal with mixed type attributes including numerical, categorical, and hierarchical attributes for a one-pass hierarchical clustering algorithm. We demonstrate the improved accuracy and efficiency of our approach in comparison to previous work on clustering network traffic.

Modules:
1 Cluster Formation in Echidna
2 Radius Calculations
3 Determining Parameters
4 Testing
Man power of project: one

Problem Domain:
Investigation of the use of clustering techniques to identify interesting traffic patterns from network traffic data in an efficient manner.

Existing System:-
· No efficient clustering scheme used in generating reports about the network traffic.
· There is no proper key distribution technique was used.

Proposed System:-
· Clustering scheme called Echidna for generating summary reports of significant traffic flows in network traces.
· The key contributions of our scheme are the introduction of a new distance measure for hierarchically structured attributes such as IP addresses and a set of heuristics to summarize and compress reports of significant traffic clusters from a hierarchical clustering algorithm.

Hardware requirements:
Windows XP,2000
Hard disk:40GB
Processor Pentium4,1.33MHZ
RAM 512MB
LAN

Software requirements:
JDK1.6.0
Java run time environment

The Server Reassignment Problem for Load Balancing in Structured P2P Systems : Abstract

2010-01-22T02:47:00.000-08:00

Abstract:-
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.

Existing System:-
· 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.

Proposed System:-
· 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.

Hardware Specification:
· Processor : Pentium Iv 2.6 Ghz
· Ram : 512 Mb Dd Ram
· Monitor : 15" Color
· Hard Disk : 20 Gb

Software Specification:
· Front End : Java, Swing
· Tools Used : JBuilder
· Operating System : WindowsXP

Two Techniques for Fast Computation ofConstrained Shortest Paths :Abstract

2010-01-22T02:43:00.000-08:00

Abstract:-
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.

Existing System:-
· 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.

Proposed System:-
· Two techniques are used to randomize discretization and path delay discretization, to design fast algorithms for computing constrained shortest paths.
· The algorithms based on these techniques run much faster than the best existing algorithm that solves the -approximation of DCLC.

Hardware Specification:
· Processor : Pentium Iv 2.6 GHz
· Ram : 512 Mb Dd Ram
· Monitor : 15” Color
· Hard Disk : 20 Gb

Software Specification:
· Front End : Java, Swing
· Tools Used : JBuilder
· Operating System : WindowsXP

Using the Conceptual Cohesion of Classes for Fault Prediction in Object-Oriented Systems : Abstract

2010-01-22T02:39:00.000-08:00

Abstract :
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.

Existing System:-
This depends on reasonable naming conventions.

Proposed System:-
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.

Hardware Interface
· Hard disk : 40 GB
· RAM : 512 MB
· Processor Speed : 3.00GHz
· Processor : Pentium IV Processor

Software Interface
· JDK 1.5
· Swing Builder

Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest : Abstract

2010-01-22T02:35:00.000-08:00

Abstract :

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.

Existing System:
Network system classified into two categories. They are structured and unstructured. Unstructured P2P networks can be constructed very efficiently.
The applications share the resources and data in this system is a challenging task. This challenge overcome by random search strategy.

Problem Definition
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.

Proposed System:
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.
I. Store the nodes in order to save peers from their blindness.
II. Users’ common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM).
III. We are able to estimate the probability of any peer sharing a certain resource through UIM.
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.
V. Updating the routing table protocol to support our search protocol through self organizing the whole P2P network.

S/W Specifications
Operating System : Windows XP
Front end : JAVA
Back end : SQLITE

H/W Specification
System Processor : Pentium IV
Processor Speed : 2.80GHz

Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion : Abstract

2010-01-22T02:21:00.000-08:00

Abstract :
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.

Hardware Interface
· Hard disk : 40 GB
· RAM : 512 MB
· Processor Speed : 2.20GHz
· Processor : Pentium IV Processor

Software Interface
· JDK 1.5
· Swing Builder

Common Gateway Interface (CGI) : Abstract

2010-01-19T07:05:00.000-08:00

Common Gateway Interface (CGI) Introduction :

*CGI is a standard mechanism for:

-Associating URLs with programs that can be run by a web server.

-A protocol (of sorts) for how the request is passed to the external program.

-How the external program sends the response to the client.

Common Gateway Interface (CGI) URLs :

*There is some mapping between URLs and CGI programs provided by a web sever.

*The exact mapping is not standardized (web server admin can set it up).

*Typically:

-requests that start with /CGI-BIN/ , /cgi-bin/ or /cgi/, etc. refer to CGI programs (not to static documents).

Common Gateway Interface (CGI) Request to CGI Program :

*The web server sets some environment variables with information about the request.

*The web server fork()s and the child process exec()s the CGI program.

*The CGI program gets information about the request from environment variables.

DO YOU KNOW :

What are Student Online Credit Cards ?

Student Credit Cards are just like normal Student Credit Cards but help students as many are poor as it helps in case of emergencies even to learn their responsibility to deal in real world.

Active Server Pages (ASP) : Abstract

2010-01-19T05:34:00.000-08:00

Active Server Pages (ASP) Introduction :

*Dynamically creates Web pages

-Use client information, server information and information from the Internet

*Active Server Pages (ASP)

-Microsoft Server-side technology

-Dynamically build documents in response to client requests

-Deliver dynamic Web content

Working Process of Active Server Pages (ASP) :

*Active Server Pages

-Processed by scripting engine

-Server-side ActiveX control

*.asp file extension

*Can contain XHTML tags

*Scripting written with VBScript

-JavaScript also used

-Others (Independent Software Vendors)

*Communication with Server

-Client HTTP request to server

-Active server page processes request and returns results

*ASP document is loaded into memory

-asp.dll scripting engine on server

-Parses (top to bottom)

*Web Server

-Need to run Web server to use Active Server Pages

-IIS 5.0 (Internet Information Services) or higher

-Create a virtual directory

-Copy files to c:\InetPub\Wwwroot

DO YOU KNOW :

What are University Degrees Online ?

University Degrees Online is a program where you have to attend classes online as if you are studying in gulf countries like USA and writing your exam online and getting the University Degrees certificate online.

Ad Hoc Networks : Abstract

2010-01-19T04:24:00.000-08:00

Ad Hoc Networks Introduction :

*Wireless networks with all nodes wireless

*Do not need a static infrastructure

*Self Organizing: must configure themselves

*Multi-hop wireless: nodes route packets for others

*Mobility causes dynamic topology

Challenges of Ad Hoc Networks :

*Limited wireless transmission range

*Broadcast nature of the wireless medium

*Packet losses due to transmission errors

*Mobility-induced route changes

*Mobility-induced packet losses

*Battery constraints

*Potentially frequent network partitions

Approaches to Ad Hoc Networks :

*Table-driven routing (proactive)

-Try to maintain up-to-date info for all nodes

-Periodic route-update messages propagate to all nodes

+ Advantage: route to a destination is always available

+Disadvantage: high overhead; slow to converge

*On-demand routing (reactive)

-Source discovers a path to destination only when needed

-Path maintained until it breaks or is no longer necessary

+Advantage: less overhead due to “route-messages”

+Disadvantage: source must wait until route is discovered

DO YOU KNOW :

What are Home Equity Loans ?

Home Equity Loans are the loans that we get from government or private organisation for running our own bussiness,keeping your home as equity surity majorly found in USA.

Wireless LAN : Abstract

2010-01-19T03:31:00.000-08:00

Wireless Internet System Architecture :

*Generic Internet Network Architecture

*Layering means encapsulation

*IEEE 802.11 - Seamless integration into the Internet

*Wireless LAN IEEE 802.11 basic architecture

Fundamentals of Wireless LANs :

*Differences between wireless and wired transmission

*Address is not equivalent to physical location

*Dynamic topology and restricted connectivity

*Medium boundaries are not well-defined

*Error-prone medium

*Use of WLANs

*Users can access the Internet on the move.

*WLANs are handy in areas affected by earthquakes or other disasters.

*WLANs are good solutions in places where wiring may not be permitted.

Design Goals of Wireless LANs :

*Operational simplicity

*Power-efficient operations

*License-free operationTolerance to interference

*Global usability

*Security

*Safety requirement

*Quality of service requirements

*Compatibility with other technologies and applications

DO YOU KNOW :

What is Search Engine Optimization SEO ?

Search Engine Optimization SEO plays important role for your website to enhance/optimize it in the search engine query results to get your website listed in first page of Google Search Engine as a query result.

Bluetooth : Abstract

2010-01-19T02:53:00.000-08:00

Bluetooth Idea :

*The need to interconnect computer and peripherals, handheld devices, PDAs, cell phones – replacement of IrDA led to the emergence of personal area networks (PANs)

*Universal radio interface for ad-hoc wireless connectivity

*Embedded in other devices, goal: $5/device (2005: $40 bluetooth headset)

*Short range (10 m), low power consumption, license-free 2.45 GHz ISM

*Voice and data transmission, approx. 1 Mbit/s gross data rate

Bluetooth Overview :

*Short range (10 m)

*Low power consumption

*2.4 GHz (Unlicensed ISM Band)

*Advantage: worldwide availability

*Disadvantage:

-interfere with IEEE 802.11b products
-Voice and data transmission, totally 1 Mbps
-Low cost
-less than US$5 for a Bluetooth chip
-Universal short-range wireless capability
-Available globally for unlicensed users
-Devices within 10 m can share up to 720 kbps of capacity
-Supports open-ended list of applications
-Data, audio, graphics, video

Bluetooth Application Areas :

*Data and voice access points

*Real-time voice and data transmissions

*Cable replacement

*Eliminates need for numerous cable attachments for connection

*Ad hoc networking

*Device with Bluetooth radio can establish connection with another when in range

DO YOU KNOW :

What is Asbestos Lung Cancer ?

Asbestos Lung Cancer relates to medical word that starts in the region of trachea, or bronchioles or bronchi or even in alveoli.

List of Topics : EEE

2010-01-06T02:33:00.000-08:00

Wireless Transmission of Electricity-Development and Possibility

Power Quality Innovation in Harmonic Filtering

A DSP Based Online USP

A High Performance Induction Motor Drive Using Fuzzy Logic Controller

A Noval Power Filter for Harmonic Suppression

A Solution to Remote Detection of Illegal Electricity Usage via Power Line Communications

Adaptive Neuro-Fuzzy Inference Based HVDC Control

Application of Artificial Neural Network Technique for the Measurement of Voltage Stability Using FACTS Controllers

A DC Motor Speed Control-A Fuzzy Approach

Fuzzy Logic in Electrical Systems

Fuzzy Model Based Fuzzy Controller and Fuzzy Observer for a Nonlinear System

Lunar Solar Power

Non Conventional Energy Sources Waste to Electrical Energy

Piezoelectric Transformer for Integrated MOSFET and IGBT Gate Driver

Plant Condition Monitoring By Using Infrared Thermography

Power Quality In Energy Conversion Systems

Power Transmission With HVDC at Voltages Above 600V

Real Time Power System Security Assesment Using Artificial Neural Networks

Real Time Monitoring And Assessment of Circuit Breaker Operations For Diagnostics And Control Applications

Simultaneous AC-DC Power TRansmission

Special Purpose Machines

Tapping Into The Non-Conventional Resources of The Earth

Wireless Power Transmission

List of Topics : CSE

2010-01-06T02:32:00.001-08:00

Video Impainting Under Constrained Camera Motion

Blue Ray Disk

Brain Finger Printing Technology

Brain Controlled Car for Disabled Using Artificial Intelligence

Quantum Cryptography-Making Code Unbreakable

Visualizing Internet Routing Changes

Network Security Using Quantum Cryptography

Image Compression and Denoising Based on Tree Adoptated Wavelet Shrinking

List of Topics : ECE

2010-01-06T02:32:00.000-08:00

Image Compression Using Wavelet Shrinkage

Embedded Image Coding Using Zerotrees

Automatic Speach Recognition System

Microwaves

Morphological Image Processing

Image Processing

Bullet Proof Vests

Nano Technology-Cancer Treatment

Nano Robos

Nano Robos in Textiles

Speech Recognition

Ingenious Governance of Battle Tanks

Diamond Search

An Architectural Approach for Reducing Leakage Energy in Caches

Image Processing and Pattern Recognition

An Application of Morphological Image Processing in Forensics

Speech Processing Using Multirate DSP

WIMAX

Halo Network

A Fast Simulation Approach for Inductive Effects of VLSI Interconnects

A Real Time Face Recognition System Using VLSI Hardware

FPGA Implementation of Adaptive Median Filter For Impulse Noise Suppression

Tool forSupporting and Automating the Development

VLSI for Neural Networks And Other Aplications

Wavelet Based Embedded Color Image Coding Technique Using Block-Tree Approach

Advanced Communication Through Flesh Redtaction

Mobile Number Portability

Automatic Identification and Data Capturing Using RFID

Remote Controlling A Short Range Application In Wireless

Role of Wireless Communication in Patirnt Response Time

Ultra-Wideband Technology for Short or Medium-Range Wireless Communications

Please Select Your Branch

2010-01-06T02:27:00.000-08:00

Electronics and Communications Engineering

Computer Science and Engineering

Electrical and Electronics Engineering

A DSP based On-Line UPS

2009-11-06T01:23:00.000-08:00

EEE

Abstract

Many facilities such as patient health care centers, data processing systems, critical telecommunication links, LAN servers, offices etc rely on uninterruptible power supplies (UPS) to maintain a continuous supply of power in case of line outage. In addition to requiring continuous power, many critical nonlinear loads are sensitive to the incoming line transients and input harmonic voltage distortion. Conventional UPS systems operate to protect against such disturbances using complex filtering schemes, often employing large passive components. Among the various UPS systems online UPS provides maximum protection to such loads against any power problems. Because of multiple power conversion stages, online UPSs have been the most complex and expensive type of systems. Today’s low cost, high performance Digital Signal Processors(DSPs) provide an improved and cost- effective solution for online UPS design, making them software controllable, adding some facilities like remote configuration and monitoring and other network management facilities.
This paper presents the basic design and merits of using real time digital signal processing (DSP) control of UPS systems.

Click Here to Download

A Fast Simulation Approach for Inductive Effects of VLSI Interconnects

2009-11-02T09:28:00.000-08:00

ECE

ABSTRACT

An Architectural Approach for Reducing Leakage Energy in Caches

2009-11-02T09:25:00.000-08:00

Abstract

Secure communication without Eavesdropping is a major issue. Though initially Internet and other networks were built for universities , its applications have reached fields like business and e-commerce where sharing of private and critical details like credit card numbers should not exposed to attack of Eavesdropping . In recent times many schemes have been published and implemented like systems involving RSA algorithm for public key encryption which are based on unproven computational difficulty of certain mathematical functions. These schemes have been shown to break progressively over the years , leading to an increase in the complexity of the schemes used to establish a secure communication. The complexity has nowadays reached its limits ,thus hampering communications with regard to the speed . We wish to present quantum cryptography which is seen as uncrackable and a thing of not-so-far future . It relies on the cutting edge laws of physics like quantum properties of some matter (sub atomic particles ,photons) to establish a secure way to share a public key. It is still in the infant stages of development with constraints regarding duplicate channel , photon generation and recognition equipment . So there is lot of scope for study in the field encryption systems with new algorithms to break the existing ones in record time and thus

Click Here to Download

Brain Controlled Car For Disabled Using Artificial Intelligence

2009-11-01T07:20:00.000-08:00

ABSTRACT

This paper considers the development of a brain driven car, which would be of great help to the physically disabled people. Since these cars will rely only on what the individual is thinking they will hence not require any physical movement on the part of the individual. The car integrates signals from a variety of sensors like video, weather monitor, anti-collision etc. it also has an automatic navigation system in case of emergency. The car works on the asynchronous mechanism of artificial intelligence. It’s a great advance of technology which will make the disabled, abled.

Clik Here To Download

Video Impainting Under Constrianed Camera Motion

2009-11-01T07:12:00.000-08:00

CSE

Abstract

A framework for inpainting missing parts of a video sequence recorded with a moving or stationary camera is presented in this paper. The region to be inpainted is general: It may be still or moving, in the background or in the foreground, it may occlude one object and be occluded by some other object. The algorithm consists of a simple preprocessing stage and two steps of video inpainting. In the preprocessing stage, each frame is segment into foreground and background. Segmentation is used to build three image mosaics that help to produce time consistent results and also improve the performance of the algorithm by re-ducing the search space. In the ﬁrst video inpainting step, moving objects reconstruct in the foreground that are “occluded” by the region to be inpainted. To this end,gap ﬁlled as much as possible by copying information from the moving foreground in other frames, using a priority-based scheme. In the second step, inpaint the remaining hole with the background. To accomplish this, ﬁrst frames are aligned and directly copy when possible. The remaining pixels are ﬁlled in by extending spatial texture synthesis techniques to the spatiotemporal domain. The proposed framework has several advantages over state-of-the-art algorithms that deal with similar types of data and constraints. It permits some camera motion, is simple to implement, fast, does not require statistical models of background nor foreground, works well in the presence of rich and cluttered backgrounds, and the results show that there is no visible blurring or motion artifacts. A number of real examples are shown supporting these ﬁndings.

Click Here to Download

Brain Finger Printing Technology

2009-11-01T06:11:00.000-08:00

CSE

ABSTRACT

Brain Fingerprinting is a new computer-based technology to identify the perpetrator of a crime accurately and scientifically by measuring brain-wave responses to crime-relevant words or pictures presented on a computer screen. Brain Fingerprinting has proven 100% accurate in over 120 tests, including tests on FBI agents, tests for a US intelligence agency and for the US Navy, and tests on real-life situations including felony crimes.
Why Brain Fingerprinting???
Brain Fingerprinting is based on the principle that the brain is central to all human acts. In a criminal act, there may or may not be many kinds of peripheral evidence, but the brain is always there, planning, executing, and recording the crime. The fundamental difference between a perpetrator and a falsely accused, innocent person is that the perpetrator, having committed the crime, has the details of the crime stored in his brain, and the innocent suspect does not. This is what Brain Fingerprinting detects scientifically.

Click Here to Download

Blue Ray Disk

2009-11-01T05:50:00.000-08:00

CSE

Abstract

This paper will present you one of the latest entangling technological achievements in the high definition disc technology, “Blu-Ray” which is in a wave to reinstate the existing DVD technology.
Blu-ray Disc (BD) is the next generation optical disc format, currently being standardized by a large consortium of leading CE, PC, authoring companies and major movie studios. Blue-Ray disc supports seamless integration of Internet content with disc content, allowing synchronized presentation of updated content from the Internet with disc content. With this combination of features, highest quality HD video, enhanced interactivity and Internet connectivity, BD offers consumers a compelling experience.
We present an overview of the features that will be supported by the BD application format such as the working, recording format, protection from errors, modes of operation, file system supported by the blu-ray discs and their latest technological applications. We also provide you with the technical solutions used to realize these features.

Click Here to Download

Image Compression And Denoising Based On Tree Adopted Wavelet Shrinkage

2009-11-01T05:09:00.000-08:00

ECE

ABSTRACT

An algorithm is described for simultaneously compressing and denoising images. The algorithm is called tree-adapted wavelet shrinkage and compression (TAWS-Comp). TAWS-Comp is a synthesis of an image compression algorithm, adaptively scanned wavelet difference reduction (ASWDR), and a denoising algorithm, tree-adapted wavelet shrink age (TAWS). As a Compression procedure, TAWS-Comp inherits all of the advantages of ASWDR: its ability to achieve a precise bit-rate assigned before compressing, its scalability of decompression, and its capability for enhancing regions-of interest. Such a full range of features has not been available with previous compressor plus denoiser algorithms. As a denoising procedure, TAWS-Comp is nearly as effective as TAWS alone. TAWS has been shown to have good performance, comparable to state of the art denoisers. In many cases, TAWS-Comp matches the performance of TAWS while simultaneously performing compression. TAWS-Comp is compared with other combined compressor/denoisers, in terms of error reduction and compressed bit-rates. Simultaneous compression and denoising is needed when images are acquired from a noisy source and storage or transmission capacity is severely limited (as in some video coding applications). An application is described where the features of TAWS-Comp as both compressor and denoiser are exploited.
Keywords: image compression; image denoising; signal processing; video coding.

Click here to Download

Embedded Image Coding Using Zerotrees Of Wavelet Coefficients

2009-11-01T04:43:00.000-08:00

ECE

Abstract

The embedded zerotree wavelet algorithm (EZW) is a simple, yet remarkably effective, image compression algorithm, having the property that the bits in the bit stream are generated in order of importance, yielding a fully embedded code. The embedded code represents a sequence of binary decisions that distinguish an image from the “null” image. Using an embedded coding algorithm, an encoder can terminate the encoding at any point thereby allowing a target rate or target distortion metric to be met exactly.Also, given a bit stream, the decoder can cease decoding at any point in the bit stream and still produce exactly the same image that would have been encoded at the bit rate corresponding to the truncated bit stream. In addition to producing a fully embedded bit stream, EZW consistently produces compression results that are competitive with virtually all known compression algorithms on standard test images. Yet this performance is achieved with a technique that requires absolutely no training, no prestored tables or codebooks, and requires no prior knowledge of the image source.
The EZW algorithm is based on four key concepts:
1) A discrete wavelet transform or hierarchical subband Decomposition,
2) Prediction of the absence of significant information across scales by
Exploiting the self-similarity inherent in images,
3) entropy-coded successive-approximation quantization,
4) Universal lossless data compression which is achieved via adaptive arithmetic coding.
EZW encoding does not really compress anything; it only reorders wavelet coefficients in such a way that they can be compressed very efficiently. An EZW encoder should therefore always be followed by a symbol encoder, for instance an arithmetic encoder.
Click Here to Download