All the III MCA students are asked to submit the following documents for the first review. One page description for the following
1.company name
2.project title
3.software description
4.confirmation letter
5.Attendance certificate
6.DFD
---------------------------Company Name----------- Topic------------ Software description
A8711001 Amala devi.------ -T Cegon Software
A8711002 Dhana Lakshmi.P- Cegon Software
A8711003 Madhubala.S----- -Roots Tech Serve
A8711004 Padmini.A--------- HCL India
A8711005 Rajalakshmi.S------Pandiyan System
A8711006 Selva Anitha.M-----Iware Soft
A8711007 Sengamala barani.S- Cegon Software
A8711008 Sivagami.N----------Blue Chip
A8711009 Yoga Nandhini.S---- Cegon Software
A8711010 Anand babu
A8711011 Arun Kumar.P.V-----ADF India
A8711012 Guru Barakumar.M
A8711013 B.Karthick----------- Roots Tech Serve
A8711014 Karthikeyan.M------- Roots Tech Serve
A8711015 Mani Muthu.M------- Roots Tech Serve
A8711016 Mariappan.L---------- Code and Fix
A8711017 Nagarethina Kumar.B Roots Tech Serve
A8711018 Rakeshjeyavendhan.K Roots Tech Serve
A8711019 Surendran.B----------Roots Tech Serve
Subscribe to:
Post Comments (Atom)
Respected sir
ReplyDeleteI am going to do my project in Roots Tech Serve.
Project Title: Continuous Monitoring of Spatial
Queries in Wireless Broadcast
Environments.
Language : JAVA
by
S.Madhu Bala(A8711003)
MCA Final Year
This comment has been removed by the author.
ReplyDeleteRespected sir
ReplyDeleteI am going to do my project in Roots Tech Serve.
Project Title: A GEN2-BASED RFID AUTHENTICATION PROTOCOL FOR SECURITY AND PRIVACY
Language : C#
by
K.Rakesh Jayavendhan
MCA Final Year
Respected sir
ReplyDeleteI am going to do my project in Roots Tech Serve.
Project Title: BIASED RANDOM WALKS IN UNIFORM WIRELESS NETWORKS.
Language : C#
by
M.Karthikeyan
MCA Final Year
Respected sir,
ReplyDeleteI am doing my project in Code and Fix Information Technologies.
Project Title:
IP FAST REROUTE
Language:
JAVA
by
L.Mariappan
III MCA
Respected sir,
ReplyDeletei m going to do my project in EGATE Solution, chennai.
My title is:
IMAGE PROCESSING WITH FUSION AND STEGANOGRAPHY
Intensity algorithm:
It does not contain any coding
Intensity algorithms act on individual pixels within an image. A small portion of the full intensity range of an image is selected and then remapped to the full intensity range of the display device. This process allows selection of specific intensity values of interest. For example, intensity values that represent abnormal tissue and dense but normal tissue are selected to allow exaggeration of small differences in intensity values between the two objects, thus potentially increasing the conspicuity of any abnormal regions. The three versions of intensity windowing demonstrated in this article are MIW, HIW, and MMIW. These algorithms differ in how intensity values of interest are selected.
Respected sir
ReplyDeleteI am going to do my project in Roots Tech Serve.
Project title : Dynamic Routing with Security Considerations
Language : c#
by
P. V. Arunkumar
M. C. A final year
Respected sir
ReplyDeleteDrawbacks for Snapshot Techniques:
1. In this we can't do continuous queries.
2. Here, we can't do energy consumption while
achieving low access latency.
by
S.Madhu Bala
M.C.A Final Year
Respected sir,
ReplyDeletepruning technique:
Proper pruning enhances the beauty of almost any landscape tree and shrub, while improper pruning can ruin or greatly reduce its landscape potential. In most cases, it is better not to prune than to do it incorrectly. In nature, plants go years with little or no pruning, but man can ruin what nature has created. By using improper pruning methods healthy plants are often weakened or deformed.
Pruning, like any other skill, requires knowing what you are doing to achieve success. The old idea that anyone with a chain saw or a pruning saw can be a landscape pruner is far from the truth.
Reasons for Pruning
to train the plant
to maintain plant health
to improve the quality of flowers, fruit, foliage or stems
to restrict growth
When to Prune
Pruning can actually be done at any time of the year; however, recommended times vary with different plants. Contrary to popular belief, pruning at the wrong time of the year does not kill plants, but continual improper pruning results in damaged or weakened plants
Pruning Techniques
Specific types of pruning may be necessary to maintain a mature tree in a healthy, safe, and attractive condition.
Cleaning is the removal of dead, dying, diseased, crowded, weakly attached, and low-vigor branches from the crown of a tree.
Thinning is the selective removal of branches to increase light penetration and air movement through the crown. Thinning opens the foliage of a tree, reduces weight on heavy limbs, and helps retain the tree’s natural shape.
Raising removes the lower branches from a tree in order to provide clearance for buildings, vehicles, pedestrians, and vistas.
Reduction reduces the size of a tree, often for clear- ance for utility lines. Reducing the height or spread of a tree is best accomplished by pruning back the leaders and branch terminals to lateral branches that are large enough to assume the terminal roles (at least one-third the diameter of the cut stem). Compared to topping, reduction helps maintain the form and structural integrity
Respected sir,
ReplyDeletei m sengamala barani.
My project title is:Multi-million dollar maintanence using wls service.
WLS:(White labeling system)
A product or service, especially common in the in the financial sector, where the provider of the service purchases a fully supported product from another source, then applies its own brand and identity to it, and sells it as its own product. The purchaser assumes the seller is selling its own product.
White Label Service
VertexFX Customers who purchased a full trading platform can benefit from the White Label service by implementing it to their Brokers or Introducing Brokers (IB) that is optionally shipped with our trading platform. The IB clients will see their direct IB name and not the Market Maker, which gives privacy to this IB. White Label can be implemented in one of the following two implementation levels, the market maker can decide what level he needs and do it from his side and both types are part of the Market Maker System and inside his server, which means that he can see all the clients under the White Labeled IB:
White Label
Both Client and Backoffice packages are delivered to Broker/IB so that he can add the client’s package to his own website to show his own name and contact information instead of his Market Maker’s dealing room information
Through the WL package, Brokers’ clients will trade directly with him, he will be able to create accounts, deposits, withdraw money, accept/reject quotes and perform all administrative operations that Market Maker does, except the following ones:
WL cannot control Market in terms of opening or closing Market separately from his Market Maker. However, this option is on the system level which can be controlled by the full system owner
Symbol filtering is controlled also from the full system owner, and WL cannot control it as well
Security system is controlled on the system owner level as well. However, if WL requires certain dealers with specific privileges he can arrange with his Market Maker (WL provider) and can create for him such dealers.
Respected sir,
ReplyDeleteAPI:
An Application Programming Interface (API) is a particular set of rules and specifications that a software program can follow to access and make use of the services and resources provided by another particular software program that implements that API.
API in object-oriented languages
In object oriented languages, an API usually includes a description of a set of class definitions, with a set of behaviours associated with those classes. A behaviour is the set of rules for how an object, derived from that class, will act in a given circumstance. This abstract concept is associated with the real functionalities exposed, or made available, by the classes that are implemented in terms of class methods.
SOAP, originally defined as Simple Object Access Protocol, is a protocol specification for exchanging structured information in the implementation of Web Services in computer networks. It relies on Extensible Markup Language (XML) for its message format, and usually relies on other Application Layer protocols, most notably Remote Procedure Call (RPC) and Hypertext Transfer Protocol (HTTP), for message negotiation and transmission. SOAP can form the foundation layer of a web services protocol stack, providing a basic messaging framework upon which web services can be built. This XML based protocol consists of three parts: an envelope, which defines what is in the message and how to process it, a set of encoding rules for expressing instances of application-defined datatypes, and a convention for representing procedure calls and responses.
The SOAP specification
The SOAP specification defines the messaging framework which consists of:
The SOAP processing model defining the rules for processing a SOAP message
The SOAP extensibility model defining the concepts of SOAP features and SOAP modules
The SOAP underlying protocol binding framework describing the rules for defining a binding to an underlying protocol that can be used for exchanging SOAP messages between SOAP nodes
The SOAP message construct defining the structure of a SOAP message
[edit]SOAP processing model
The SOAP processing model describes a distributed processing model, its participants, the SOAP nodes and how a SOAP receiver processes a SOAP message. The following SOAP nodes are defined:
SOAP sender
A SOAP node that transmits a SOAP message.
SOAP receiver
A SOAP node that accepts a SOAP message.
SOAP message path
The set of SOAP nodes through which a single SOAP message passes.
Initial SOAP sender (Originator)
The SOAP sender that originates a SOAP message at the starting point of a SOAP message path.
SOAP intermediary
A SOAP intermediary is both a SOAP receiver and a SOAP sender and is targetable from within a SOAP message. It processes the SOAP header blocks targeted at it and acts to forward a SOAP message towards an ultimate SOAP receiver.
Ultimate SOAP receiver
The SOAP receiver that is a final destination of a SOAP message. It is responsible for processing the contents of the SOAP body and any SOAP header blocks targeted at it. In some circumstances, a SOAP message might not reach an ultimate SOAP receiver, for example because of a problem at a SOAP intermediary. An ultimate SOAP receiver cannot also be a SOAP intermediary for the same SOAP message.
Respected sir,
ReplyDeletePROJECT TITLE: IP FAST REROUTE
LANGUAGE : JAVA
That project i have used to rMRC Method(Relaxed Multiple Routing configuration). rMRC is a lowest path gathered then trasfer data one system to another system.
First MRC is used to IP FAST REROUTE.
But MRC is a gathered original path but is not work directly is taken the alternative path to transfer the data. it time waste. but rMRC is search the lowest path. it time save.
so, My project is taken the Relaxed Multiple Routing Configuration.
Respected sir,
ReplyDeleteiam rakesh
Candidate set finding algorithm:
INTRODUCTION
RADIO Frequency Identification (RFID) tags for the function of next-generation electronic product code (EPC) will become one of the most widely used devices in the near future [1]. An RFID application contains three basic roles:
tag
reader
back-end database
Each tag contains a unique identification, often called the tag identification (TID). The reader is used to query the tag’s TID and forward it to the back-end database. Once the tag is found valid, the back-end database will look up its product information for further processing. RFID tags are classified into three types: active, semipassive, and passive. Active tags contain batteries so that they can actively communicate with the reader. Semipassive tags also contain batteries but they wait for the reader’s query. As for passive tags, the power comes from the reader. The class of a tag represents the effective reading range. The reading range of a class-0 tag is 5-10 cm, and that of a class-1 tag is up to several meters. EPCglobal class-1 generation-2 (Gen2 in brief) [2] was approved as ISO18000-6C in July 2006. It is widely believed
that Gen2 tags will be the mainstream when developing RFID applications because the effective reading range is larger. However, the Gen2 specification has the vulnerability that the TID is transmitted without any guard. Thus, in this paper, we focus on the protection of class-1 passive
tags from being accessed by malicious readers.
Security Threats
Eavesdropping: An adversary listens to all the communications
through Radio Frequency (RF) and dumps them for later cracking.
Hotlisting: This attack, similar to eavesdropping, focuses on matching specific values with his chosen keywords to understand one’s personal interests, like his favorite books or his reading behavior.
Replay attack: An attacker repeats the same messages logged from eavesdropping to spoof a reader or tag.
Cloning: Since RFID tags are usually placed in open environments such as hospitals, schools, and offices, they may be exposed under all kinds of malicious tools. An adversary can read the tag and then clone the tag by writing all the obtained data into a blank tag.
Tag tracing: Readers and tags have different abilities of sending data. Attackers can either identify the same tag from passively logged messages or interactactively with the tag to understand its location.
Invading privacy: Customers may not want eavesdroppers to know what items they have bought from the store, which may indicate their interests.
Data forging: Once RFID technology becomes the mainstream of retailing, a tag may store extra data such as date, price, and the place of production for
convenience. However, this also attracts attackers to modify the price and cause great loss.
Denial of service: It is an effective attack against some RFID systems, which utilize locking or killing approach as their protection. Even though this is the weakest test when designing secure protocols, there exist many other simpler ways toward denial of service.
This comment has been removed by the author.
ReplyDeleteRespected sir,
ReplyDeleteDistance-vector based algorithm for Dynamic Routing:
A distance-vector-based algorithm for dynamic routing to improve the
security of data transmission. We propose to rely on existing distance information exchanged among neighboring nodes (referred to as routers as well in this paper) for the seeking of routing paths. In many distance-vector-based implementations, e.g., those based on RIP, each node Ni maintains a routing table in which each entry is associated with a tuple and Next hop denote some unique destination node, an estimated minimal cost to send a packet to t, and the next node along the minimal-cost path to the destination node, respectively.
First, for the elements that do not exist in the routing table, new entries for the corresponding destination nodes will be inserted (lines 1 and 2). Otherwise, (wNi,Nj + WNj,t is compared with WNi,t saved in the routing table of Ni, and the following four cases are considered:
1. (wNi,Nj + WNj,t)< WNj,t t (lines 3-11). The corresponding minimal cost is updated in the routing table, and Nj is marked as the minimal-cost nexthop. Any neighboring node Nk which has an estimated packet delivery cost from Nk to t no more than (wNi,Nj + WNj,t )joins the candidate set CNi t . It is to aggressively include more candidates for the next hop to t with reasonable packet delivery cost (i.e., WNk,t WNi ,t, and Nj is in the set CNi,t of next hop candidates (lines 13-25). Based on whether Nj is marked as the minimal-cost nexthop in the routing table of Ni, the following two cases are further considered. Nj was marked as the minimal-cost next hop For all neighboring nodes of Ni, the minimal cost to the destination node t is recomputed according to the distance vectors received from the neighboring nodes. Also, the nexthop candidates for the destination node t are reselected, and the selection policy is the same as lines 7-9 for Case 1..Nj was not marked as the minimal-cost nexthop If WNj,t >WNi,t, Nj is removed from CNi t .
3. (wNi,Nj + WNj,t)>WNi,t, and Nj is not in the set CNi t of nexthop candidates . If wNi,Nj + WNj,t, Nj is inserted into CNi t .
4. Otherwise, nothing is done. When a node Ni receives a distance vector from a neighboring node, Procedure 2 is used to maintain the nexthop candidates for each entry in the routing table of Ni. The time complexity of Procedure 2 maintaining the next hop candidates is O|N|. Furthermore, in the routing table of Ni, there are |N| entries in the worst case. Hence, the time complexity of maintaining the routing table is O(|N|2).Based on Procedures 1 and 2, our security-enhanced dynamic routing can be achieved without modifying the existing distance-vector-based routing protocols such as RIP and DSDV.
by,
P.V.Arunkumar,
M.C.A final year.
Respected Sir,
ReplyDeleteIam Surendiran ,
My Project Title is : Single Link Failure Detection in All-OPtical Networks Using Monitoring Cycles and Monitoring Paths.
Algorithm: Monitoring Cycles and Paths(MCs&MPs).
ALGORITHM
INTRODUCTION :
OPTICAL networks have gained tremendous importance due to their ability to support very high data rates using the dense wavelength division multiplexing technology. With such high data rates, a brief service disruption in the operation of the network can result in the loss of a large amount of data. Commonly observed service disruptions are caused by fiber cuts, equipment failure, excessive bit errors, and human error. It is desired that these faults be uniquely identified and corrected at the physical layer before they are even noticed at higher layers. Therefore, it is critical for optical networks to employ fast and effective methods for identifying and locating network failures. In an adaptive technique for fault diagnosis using “probes” was presented in which probes are established sequentially.While the sequential probing helps achieve adaptive ness, it also increases the fault localization time. In a non-adaptive fault diagnosis through a set of probes (light paths) was developed where all the probes are employed in advance. The techniques presented in non-adaptive and sequentially assume that a probe can originate from and terminate at any location. Such techniques can localize multiple-link failures, but they involve a high setup cost(a monitor is needed at each location) and incur high protocol overhead (for exchanging messages between locations).
By reducing the number of monitoring locations, the monitoring overhead and the detection delay can be significantly reduced because fewer messages are exchanged between monitoring locations.
DESCRIPTION :
We develop a mechanism for locating single-link failures using monitoring cycles (MCs) only or a combination of MCs and monitoring paths (MPs). The MCs pass through one or more monitoring locations, and are selected such that the failure of any given link would result in the failure of a unique combination of MCs. We show that when one monitoring location is employed, finding a set of MCs that is sufficient to identify any single-link failure requires the network to be three-edge connected.The problem of constructing MCs in a three-edge-connected network is formulated as an ILP, and a heuristic approach is presented to solve it.The effectiveness of employing multiple monitoring locations is compared with that of a single monitoring location. We then turn our attention to failure detection in an arbitrary topology (i.e., not necessarily three-edge connected). In this case, both MCs and MPs with multiple monitoring locations are needed to localize any single-link failure.An algorithm is presented for calculating the minimum number of required monitoring locations for a network with links. Simulations are conducted to study the effectiveness of the monitoring technique. The rest of the paper is organized as follows.
We consider single-link fault-localization using MCs only and with one monitoring location. We show that three-edge connectivity of the network graph is a necessary and sufficient condition for the existence of a solution. We also provide theoretical bounds on the number of required MCs. In the same section, we present the ILP and heuristic solutions for the MC-based fault localization problem in a three-edge-connected network.
We study the problem of identifying appropriate MCs when multiple monitoring locations are used, and propose a heuristic approach for solving it.
We study the problem of identifying single-link failures in an arbitrary network and provide necessary and sufficient conditions on the number of monitoring locations.
We present the simulation results.
by,
B.Surendiran,
M.C.A final year.
Respected sir,
ReplyDeleteI am Manimuthu
Information Content Transmission Power Algorithm:
The ICTP scheme is embodied in the power adjustment logic module in which a node consults the mutual information list index of the sensor node and the preset power adjustment pattern, and subsequently, decides on the transmission power for communicating its information state and information matrix denominations to the network.
INFORMATION-CONTROLLED TRANSMISSION POWER ADJUSTMENT
In this section, we introduce the ICTP adjustment scheme as the energy-saving strategy, in addition to the MISS algorithm. The block diagram representation of the sensor node whose task is distributed target tracking with MISS and ICTP is shown in Fig. 4. Sensory observation is transferred to the information extractor module to retrieve the information state and the information matrix denomination values from the received observation
Which are then passed to the local information filter module where local target tracking takes place according to the operations in (6). The target state belief obtained from the local information filter is handed over to the collaboration logic and the network information filter modules. Using the mutual information measure in (12), the collaboration logic decides if the sensor node is going to share the current target observation with the network or not. The collaboration logic works as described in Section 3. The network information filter is the place where the information state and the information matrix denominations received from the neighboring sensor nodes are incorporated to the current target state estimate of the sensor node according to (11). The resulting collaborated target state estimate is passed to the target next state predictor module which functions as described by (8). The ICTP scheme is embodied in the power adjustment logic module in which a node consults the mutual information list index of the sensor node and the preset power adjustment pattern, and subsequently, decides on the transmission power for communicating its information state and information matrix denominations to the network.
Respected sir,
ReplyDeleteiam karthikeyan
Random walk algorithm:
A summary of the main symbols while the definitions of the key terms are now given.
Definition 1.
Bias level. A random walk has bias level _ with respect to a given target, and it is called _-biased random walk, if after a step the walker gets closer to the target with probability _.
Definition 2.
Unbiased random walk. A random walk with bias level _ ¼ 0:5 is said to be unbiased.
Definition 3.
Hitting time. The hitting timeh_ði; jÞ of a _-biased random walk is the expected number of steps before node j is visited for the first time starting from node i.
Definition 4.
Gain. The gain g_ði; jÞ of a _-biased random walk is the percentage reduction of the hitting time of j starting from i with respect to the same hitting time for the unbiased random walk, namely, g_ði; jÞ ¼ h0:5ði;jÞ_h_ði;jÞ h0:5ði;jÞ .
Definition 5.
Return time. The return time is the expected number of steps in a random walk starting at a given node, before the same node is reached again.
Respected sir,
ReplyDeletee-fraud prevention based on self_authentication of e-documents
Quantization, involved in image processing, is a lossy compression technique achieved
by compressing a range of values to a single quantum value. When the number of
discrete symbols in a given stream is reduced, the stream becomes more compressible.
For example, reducing the number of colors required to represent a digital image makes
it possible to reduce its file size. Specific applications include DCT data quantization
in JPEG and DWT data quantization in JPEG 2000.
In cryptography, encryption is
to as plaintext) using an algorithm (called cipher) to make it unreadable to anyone
except those possessing special knowledge, usually referred to as a key. The result
of the process is encrypted information (in cryptography, referred to as cipher text).
In many contexts, the word encryption also implicitly refers to the reverse process,
decryption (e.g. “software for encryption” can typically also perform decryption), to
make the encrypted information readable again (i.e. to make it unencrypted).
the
process
of
transforming information (referred
Steganography is the art and science of writing hidden messages in such a way
that no one, apart from the sender and intended recipient, suspects the existence
of the message, a form of security through obscurity
by
padmini
III MCA
Respected sir,
ReplyDeleteCell Breathing Techniques for Load Balancing in Wireless LANs:
We consider min-max load balancing approach that not only minimizes the network congestion load but also balances the load of the non congested APs. As mentioned earlier, the proposed approach can be used for obtaining various max-min fairness objectives by associating each user with appropriate load contributions. Unfortunately, min-max load balancing is NP-hard problem and it is hard to find even an approximated solution. In this paper, we solve a variant of the min-max problem, termed min-max priority-load balancing problem, whose optimal solution can be found in polynomial time. We present our algorithm for this problem in the limited knowledge case. Obviously, it can be used for the complete knowledge case as well.
Min-Max Algorithm:
We now present our min-max algorithm for the limited knowledge model. The algorithm iteratively finds a minmax priority-load-balanced state that yields the optimal load vector ~Y . At any iteration m, m 2 ½1::jAj , we call a routine to calculate a network state that minimizes the priority load of the mth coordinate of the load vector. The routine needs to satisfy two requirements:
• Requirement 1: The initial state of each iteration, m, must dominate the optimal state.
• Requirement 2: The calculated network state at the mth iteration should not affect (increase) the load of the APs that their load have already been determined by the previous iterations.
To meet Requirement 1, the algorithm starts with the maximal power state in the first iteration and we need to ensure that each iteration ends with dominating state of the optimal solution. Moreover, to meet Requirement 2, we define a set of fixed APs, F, whose load have already been determined by previous iterations. Initially, the set F is empty and at each iteration, a new AP is added to it, until F contains all the APs. We refine the definition of the congestion load Y as the maximal load on any nonfixed AP. From Property 1, it follows that at any given time, there
by
B.Nagarathinakumar,
MCA final year