Technical Seminar for CSE on Rapid IO Switch

Introduction to Technical Seminar for CSE on Rapid IO Switch:

It is a packet interconnection that uses low pin count and packet switched system level. Its performance is very high. It is used in networking environment and computing platforms.  It is an interconnecting microprocessor that has memory.

It is an application in network equipment. It has central processor which is connected to three control path. These control paths are connected to Input output card that contains traffic manager network processor. They are also connected to fabric switch. All the devices interconnected to each other.

Rapid I/O allows many devices to be interconnected. It has certain principles that have to be followed. Devices which are interconnected should be focused within the box. Silicon foot prints are limited. Hardware errors should be managed. Impact of software should be limited.

They are specified in three layers hierarchy:

–          Logical specification: information required for the end point

–          Transport specification: information transfer from end to end point.

–          Physical specification:  require to move packet from one device to other device.

Globally shared memory: request is made by user, then it is transferred to home memory then participants and then they give response to the user.

Flow control:  the main work for the device is to complete the transaction from one device to other device without getting blocked. There are three types of flow mechanism: retry, throttle and credits.

Maintenance and error managements: it provides rich management systems error handling. These are: maintenance, system discovery, and error coverage and error recovery. They use packet structures and source routing technique that gives the high performance broadcast routing and source routing.

Conclusion: it is robust packet switching system. It provides high performance in systems by maintaining the implementation cost. It gives error free management that includes the multi-bit ability errors and single bit errors.

 Download Technical Seminar for CSE on Rapid IO Switch .

Technical Seminar Presentation on Radio Propagation Models for Mobile Communication

Introduction to Technical Seminar Presentation on Radio Propagation Models for Mobile Communication:

We need to design such system that will catch transmitted signal transmitted from the transmitter and in the way it is distorted due to dispersion effect on the channel, that will be decoded back to transmitted signal. Dispersion can also be though indoor walls, when electromagnetic radiations fall on the wall the power of the radiation get less.

Ray tracing technique: it is generally based on the geometrical optics. According to the law ray follow shortest path between source and destination. When high frequency ray fall on the surface they produce reflection, refraction and diffraction. There are two types of ray-tracing methods, Image method and brute-force methods.

Image method: this technique generates the image of the source. They can be only used to handle simple environments.  Rooftop rays are neglected.  This image serves as secondary sources for point of reflection.

Brute force methods: they are used group of rays that may reach receiver or may not reach.  In these methods rays are transmitted in different direction but with same vector angle. The original ray gets decomposed as an object penetrated rays. 

FDTD model: this technique is accurate and but it consumes large computer memory.  They are used transmitter and receivers are close to structures with complex material.

Moment method model: they are used when the building size is small and the precision required is higher.

Artificial neural network:  it is used for fast evaluation as it is based on parallelism.

Ray tracing model: they have the capability to incorporate antenna radiations pattern.

VPR model: they use some virtual reflection points (VRF), that may be located at the intersection point of the land at the streets and the buildings walls. They do not consider the effects of traffic and movement of human.

 Download Technical Seminar Presentation on Radio Propagation Models for Mobile Communication .

Technical Seminar on Meta Search

Introduction to Technical Seminar on Meta Search:

It is a search engine that support links to multiple search engine. It doesn’t need to maintain own index on its own pages. It is a0 very effectively tool that allows us to reach portion of web quickly and easily. They are used for simple queries and good for testing with few keywords. If u is in hurry then it can be used for search. It can also be used complex search.

It identifies what other search engine do that contain useful query.  This method determines which page is need to selected from different search engines.

Database selector: it is used to take the query of user to the proper search engine for processing. Database selection can be done in three categories: rough representative, statistical, and learning based approaches.

Rough representative approach:  they contain only few keywords and they provide only general review of the data.

Statistical representative approach: they are used for any detail information about any document. This allows more accurate estimation of the query.

Learning based approach: it gives the knowledge which databases are regarding to be likely return and what type of query is used from past retrievals.

Collection fusion: they determine how the webpages are searched to relevant query and how the multiple search engines merge them into single result list. They work on two modules:

–          Document selection module

–          Result merge module

Document selector is used to retrieve the document from search engine. And result merger combines all the result into single list according to their rank.

In this system query can be used in multiple search engines and user only require to know about the interface of the meta search engine.  But it only receives top result from the different search engines.

 Download Technical Seminar on Meta Search .

Image Processing And Its Applications PPT

Introduction to Image Processing And Its Applications PPT:

They work on two principles: improvement of pictorial information and processing of scene data. Image is a replica of an object. Images are of different types like gray tone images, line copy images and half tone images.  There are various steps in image processing like preprocessing, segmentation, representation, recognition, interpretation, and knowledge base.

Image enhancement:  this technique is used to increase the level of noise to noise signals. It is used to process the image so that the image obtained is more suitable the original image. Process of image may lead to image degradation. They generally use two categories for image processing.

Spatial domain method: they directly manipulate image pixels to obtain the new enhanced image.

Frequency domain method: they use Fourier transformation for the image processing before any modification.

For error free compression three types of coding methods are employed. Huffman coding, arithmetic coding and bit plane coding. For image segmentation two techniques are used fixed threshold and istogram-derived thresholds

There are also different techniques available for filtering the image like:  spatial filter, which is further classified in 3 techniques,: mean filter, median filter and smoothing filter. Filtering can also be done in frequency domain. It is can be done by 4 ways like low pass filter, ideal low pass filter, butter worth low pass filter and homomorphic filter. They are used in x-rays to obtain clear image. It reduces the blur effect of the image.

Image compression models: they consist of source encoder which is responsible coding, inter-pixel and psycho visual processing in the input image.

Image restoration: this technique is just for improve the image. This method is applied towards modeling the degradation and then applied in reverse in order to obtain original image again.

 Download Image Processing And Its Applications PPT .

Paper Presentation for it on Dealing Data From Sensors Network

Dealing Data From Sensors Network:

Continuous communication and collection of data string from data bases. They are for monitoring purpose such as climate, earthquakes, building structure. They are used to gather data using primitive networks. Cleaning of data techniques like noisy data, and handling of incomplete data due to missing values.

It has limited battery life and processing capabilities for special data handling and architectures for sensors data streams that may incorporate resource constraints.  They are capable of contracting and maintaining the locally view its neighborhood.

Sensor stream only works on sample of population means only selected persons while traditional streaming works on entire population. Sensors are imprecise and very noisy while traditional streaming are exact and error free. Sensors have moderate size while they have huge size. Sensors used are very expensive whereas they are cost free. Sensors are for continuous domain while they use for frequent items and they are distinct.

Routing: it is an ability to respond the query of user to every node. It provides one or more routes to the every node and it uses tree based routing where one node is the root. TAG reduces the communication and increases the magnitude or reduction which in turn reduces the cost very much.

There are three approaches used to storing the data in sensor networks, external, local, and data centric storage. DCS stores the data by name and thus cost of communication from original data to new data is stored. This in turn reduces the cost of query in this method is reduced very much as the queries are stored. System has three types of queries streams like historical, snapshot and long running queries.

These sensors are used to build the decision making models. They are directly used in real time systems.

 Download Paper Presentation for it on Dealing Data From Sensors Network .

Paper Presentation for CSE on Routing and Remote Access Services for Windows NT Server

Introduction to Routing and Remote Access Services for Windows NT Server:

Windows and remote access services provides lot of opportunity to software industries, hardware industries,  system integrators, value added resellers and network managers to participate in new interconnected network especially for their infrastructure, branch office and edge-to-edge deployments. Windows NT basically provides two services: Remote Access Service (RAS) and multiprotocol.

Windows NT is basically means for networking. It provides full functional internetworking products in its platform. Now hardware manufacturers can avail the feature of network access solutions by RRAS and Windows NT server. It provide some features like RIP, OSPF, DHCP, static routing and compatibility with industry standard LAN and WAN.

Enhanced remote access: they give features like extensible authentication protocol, bandwidth allocation protocol and RRAS. By which user can access these features. In includes:

  • Automatic dialing
  • Demand for dial routing
  • Security feature by using CHAP and MS-CHAP
  • Extensible authentication protocol.
  • RAS profiles for different users
  • Encryption of data
  • Point to point data tunnel from client-to-server
  • Point to point data tunnel from server-to-server
  • File copy operation restart able
  • PPP multi-link, and
  • BAP (bandwidth allocation protocol

For managing routing we should have graphical user interface so as to interact with system, or command line user interface to pass necessary instruction, wizard that demand for dial routing setup and remote server manageability.

Securing network communication:security of the network is the important feature for any communication. RRAS provides following features for network security like IP address filtering and IPX packet filtering.

Multi protocol LABE switching: it is used to provide the separation between customers. It is an internet engineering task force protocol standard pioneered by cisco systems. They deliver private network using 3 layers infrastructure.

 Download Paper Presentation for CSE on Routing and Remote Access Services for Windows NT Server .

Dynamic Routing with Stegnography MS Project Introduction

Secure routing protocol is to improve the data security by specifying various routes dynamically i.e., specifying multiple paths. These paths are then identified by an online manner and also the extra controlled messaging is required.

Many a developers tried to a maximum extent of developing the routing security mechanisms like randomized routing means ,online manner on message flooding, traffic spreading  scheme to reduce the likelihood of  eavesdropping etc..

In this present Dynamic Routing with Stegnography project presentation are going to introduce dynamic routing algorithm for enhancing the security of the data with no use of any extra messages for controlling.

Here we also point out how various paths are specified for random transmission of the data which is in the form of small packets, also   we propose a distance based algorithm for dynamic routing algorithm for achieving efficient results.

The main aim of this MS Project Introduction is to provide stochastic paths for the transmission of the data; the routing algorithm used is the distance vector based algorithm.

    Every node in the network has a routing table and a link table. In this project we use different topologies which are the backbone of the networks used like AT&T US topology, DANTE Europe topology. The back bone networks are applied to the commercial/enterprise networks.

Even though it yields many better results it has some draw backs like limitation of the number of the nodes, intra domain system and mainly the topology is inflexible and fully linked.

Here in this we present Distributed dynamic routing algorithm which has two parts: the delivery paths and maintenance of the extended routing table randomly and dynamically.

          In randomization process, firstly we will use hash in the next hop for the preceding packet delivery of the source node and then the process randomly picks up the neighboring node for the transmission of the packet .

Proposing Task:

          In this present dissertation project we briefly present the different routing algorithms used and provides a literature review on the data communication and also to provide a comparative study of them.

          Literature review provides us with the information on different routing methods, various routing paths and the data disintegration. Here in this MS Project am going to present a high end security on data by the in different paths by the use of stegnography methods.

Implementation tasks:

          In this Dynamic Routing project we implement dynamic routing algorithm for the data transmission in multiple routes by the disintegration of the data.

Proposing Research work:

My main concentration is on the security aspects while de fragmenting the data over the networks

My contribution: 

  Here am just concentrated on providing the better security, so I am making use of the stegnography methods applied on data disintegration.

This Project Report is written & submitted by Chandu.

Seminar on Digital Watermarking and Tamper Proofing Tools Report

Introduction to Digital Water Marking Seminar:

 Dynamic Watermarking Techniques

Dynamic watermarks are constructed at runtime and stored in the dynamic state of the program and were only introduced recently.

There are three kinds of dynamic watermarks. In each case, the mark is given by running the program with a predetermined input sequence. There are three dynamic watermarking techniques:

Easter egg Watermarks: when the special input sequence is entered, it performs action that is requested by the user

Execution Trace Water: The watermark is embedded within the trace with no special output.

Data Structure Watermarks: The watermark is embedded within the state of the program with the special input I and doesn’t provide any output. 

TAMPER-PROOFING

There are many situations where we want to stop a one from executing our program if it has been altered in any way. For e.g., a program P should not be allowed to run if

1) P is watermarked and the code that builds the mark has been altered, 2) A virus has been attached to P, or 3) P is an e-commerce application and the security-sensitive part of its code has been modified. To prevent such tampering attacks we can add tamper-proofing code to our program. This code should

a) Detect if the program has been altered and b) Cause the program to fail when tampering is done.

There are three principal ways to detect tampering:

1. We can compare the executable program itself is identical to the original one. To speed up the test, a message-digest algorithm can be used.

2. We can examine the intermediate results produced by the program. This technique is known as program (or result) checking.

3. We can encrypt the executable, thereby preventing anyone from modifying it unless they are able to decrypt it.

Tamper-proofing of type-safe distribution formats such as Java byte code is more difficult than tamper-proofing assembly code.

    3.1 Tamper-Proofing Viruses

A virus writer uses many techniques to protect a virus from detection and tamper-proofing-like techniques so that it cannot be easily removed from the infected host program. Armored viruses add extra code to a virus to make it difficult to analyze.

 Download Seminar on Digital Watermarking and Tamper Proofing Tools Report .

Image Water Marking Seminar Report

Image  Watermarking embeds a secret message into a cover message which discourages intellectual property theft and allows us to prove ownership in case of theft. Embedding a structure W (the watermark) into a program P such that: The embedding has a high data rate, cheap i.e. it does not adversely affect the performance of P and stealthy (does not change any statistical properties of P)

Two possible interpretations of stealth are static stealth and dynamic stealth. A watermark is statically stealthy if there are no statistical differences between the original and the watermarked program. Similarly, the watermark is dynamically stealthy if an execution trace of the program doesn’t differ. 

Static Watermarking Techniques

Software watermarks are of two types, static and dynamic. Static watermarks are stored in the application executable itself. And have been around for a long time. Moskowitz and Cooperman and Davidson and Myhrvold are two techniques of static watermarks. According to Markowitz and Cooperman a static watermark is embedded in an image using one of the many media watermarking algorithms. This image is then stored in the static data section of the program. Whereas according to Davidson and Markowitz static code watermark a fingerprint is encoded in the basic block sequence of a program’s control flow graphs.

To detect the watermark of Venkatesan et al. The extractor needs to reconstruct the control flow graph of the watermarked program, identify which nodes of graph belong to watermark graph and reconstruct watermark graph itself.

 Download Image Water Marking Seminar Report .

Latest CSE Seminar Topic on Water Marking and Tamper Proofing Tools for Software Protection

Introduction to Water Marking and Tamper Proofing Tools for Software Protection Seminar Topic:

A defense against software piracy is watermarking, a process that helps to determine the origin of software. A defense against tampering is tamper-proofing, so that unauthorized modifications to software will result in nonfunctional code.

WATER MARKING GOALS:

– verify the owner of a digital image.

– detect forgeries of an original image.

– identify illegal copies of the image.

– Prevent unauthorized distribution. 

 BACKGROUND–MALICIOUS CLIENTS VS. MALICIOUS HOSTS 

MALICIOUS CLIENTS

Computer security research was more concerned of protecting the benign host and its data from attacks of malicious client programs where job of security expert is to design and administer computer systems that will fulfill certain security requirements most of the time.

 To defend itself and its data against a malicious client, a host will typically restrict the actions that the client is allowed to perform.

MALICIOUS HOSTS

A benign client code may contain trade secrets or copyrighted material being threatened by the host on which it has been downloaded or installed. A malicious host attack typically takes the form of intellectual property violations. If the integrity of the client is violated, may lead financial losses to the owner of the client. Three types of attacks include software piracy, malicious reverse engineering, and tampering.

Software Piracy: It includes buying the software application making copies and selling illegally to unsuspecting customers.

Malicious Reverse Engineering: Decompilation and reusing of copies in his own application.

Tampering: With the digital container media content can be extracted. In the latter case, he can continue to enjoy the content for free or even resell it to a third party.

 Download Latest CSE Seminar Topic on Water Marking and Tamper Proofing Tools for Software Protection .