Sheet1 - PADMASRI DR.B.V.RAJU INSTITUTE OF COMPUTER

Document Sample
Sheet1 - PADMASRI DR.B.V.RAJU INSTITUTE OF COMPUTER Powered By Docstoc
					R. No.      Name




 50930001   G Adi Seshu
 50930002   Adinarayana Rao
 50930003   A Ammajeswari
 50930004   D Anil Kumar
 50930005   K Anjaneyulu




 50930006 B Anusha
 50930007 J Anusha
 50930008 S Bala Krishna Murthy
 50930009 P. Ashok




 50930010 P. Aswan Kumar
 50930011 S Bhagya Lakshmi
 50930012 S. Chandrakala


 50930013 Chinthaguntla Lakshmaiah
50930014 Dwara Vinod




50930015 Daara Damodar




50930016 Allam Dhanababu

50930017 Mantena Divya




50930018 Geddada Divya Teja




50930019 Nukarapu Durga Bhavani
50930020 Kagitha Ephrayem
50930021 Gandikota Eswarudu




50930022 Ganta Ramesh




50930023 Ghantasala Nireekshana Rao




50930024 Koneru Gireesh kumar
50930025           K. Gowri Naidu




50930026 G. SriLalitha

50930027 G. Ankama Rao


50930028 Ch. Jaya Lakshmi

50930029 M. Jaya Vardhini
50930030 P. Jyothi


50930031 K.V. Sujitha




50930032 K. Srinivasa Rao
50930033 K.Y.V. Ramana

50930034 P. kanthisri




50930035 G. Koteswara Rao




50930036 J. Krishnam Raju



50930037 mounica gottumukkala
50930038

50930039 A.Lakshmi tulasi
50930040 lutukurthi sravani




50930041 M RAMA KISHORE KAVALA




50930042 K MADHUSUDHANA RAO




50930043 G.Nagalakshmi Madhuri
50930044 maheshbabu kalisipudi




50930045 mahesh manne




50930046 M.M.kusuma




50930047 mohan krishna




50930048 manikyam krishna
50930049 pavan kumar.N




50930050 Bhimavarapu Naresh
50930051




50930052 Shaiek Nashiruddin




50930053 Pandu Ranga Raju




50930054
50930055 V P Adithya




50930056 Padmaja Rani Reddy



50930057 Prasad Basvani




50930058 M. Prasannanjaneyulu




50930059 Jupudi Rajesh


50930060 Rajani ( Guid IRK)


50930061 rajitha
50930062 JRajya Lakshmi




50930063 NRajyalakshmi




50930064 S. RAmPrasad

50930065 SRamanjaneyulu
50930066




50930067 P.Ramesh



50930068 KRamya




50930069 R Ranga Rao
50930070 BRatnaVidya




50930071 RAVISEKHAR G


50930072 P.S. Narayana Varma


50930073 SNagamani


50930074 CH.Santosh


50930075 T.Satish


50930076 D. Satya Lakshmi


50930077 S.Prudhvi

50930078 k.satyanarayana


50930079 G. Sekhar


50930080 G .Siva Kumar
50930081 T.Siva Kumar


50930082 P.Siva Nagababu



50930084 Ch. Sri Lakshmi


50930085 Gandikota Srinivasa Rao

50930086 Ravi Subba Ramaish

50930087




50930088 S.Satya vanitha




50930089 G.Sudhakar
50930090 P.Sudhakar




50930091 I.Suneetha
50930092




50930093 kadagala suresh




50930094 B.SureshKumar


50930095 K.Sureshkumar
50930096 S.Sureshkumar


50930097 I.M.SureshRaju




50930098 V.SureshKumar
50930099
50930100
50930101
50930102
50930103



50930104
50930105
50930106



50930107
50930108

50930109




50930110 Veera Swamy




50930111 y.venkata Lakshmi
50930112 Nagendra




50930113 Subba Rao
50930114 venkatesulu




50930115 Krishnam Raju




50930116 Rama Krishna




50930117 Vineela
50930118 Ch.V.V.Kimara Swamy




50930119 Yugandhar
Title




SigFree: A Signature-Free Buffer Overflow Attack Blocker

Quiver: Consistent Object Sharing for Edge Services
Computation-Efficient Multicast Key Distribution

Sales Auditing Tool
SMS Given on 19/1/11




                 Modeling and Automated Containment of Worms


SMS Given on 19/1/11
Hardware enhanced association rule mining with Hashing and Pipelining << almost
finalized -Nagendra Kumar>>

Mobility Management Approaches for Mobile IP Networks




P2P Reputation Management Using Distributed Identities and Decentralized
Recommendation Chains

Two Techniques for Fast Computation of Constrained Shortest Paths

Managing Multidimensional Aggregate data in Unstructured P2P Networks




Virtual Class Room System
A Distributed Protocol to Serve Dynamic Groups for Peer-to-Peer Streaming




MIGRATING PERFORMANCE DEGRADATION IN CONGESTED SENSOR
NETWORK




Novel Defense Mechanism against Data Flooding Attacks in Wireless Ad Hoc
Networks



Tender Management in Office




WASP: Protecting Web Applications Using Positive Tainting and Syntax-Aware
Evaluation




Redistricting and Election management solution
Enhanced Security for Online Exams Using Group Cryptography
In selection process




Improving Security of Real-Time Wireless Networks Through Packet
Scheduling




A Secure Mobile Healthcare System using Trust-Based Multicast Scheme




Detecting Malicious Packet Losses
             SUB ONTOLOGY-BASED RESOURCE MANAGEMENT
                     FOR WEB-BASED E-LEARNING




Personal Identity Management


Distributed Account Management for Mobile Service



Flexible Rollback Recovery In Dynamic Heterogenous Grid
Computing

Cryptographic Versus Trust Based Method for MANET Routin Security (IEEE
Paper)
Client Server Based Live Meeting




Efficient Resource Allocation for Wireless Multicast




DESIGN OF A ROBUST AND SECURE DIGITAL SIGNATURE SCHEME
FOR IMAGE AUTHENTICATION OVER WIRELESS CHANNELS
RESEQUENCING ANALYSIS OF STOP-AND WAIT ARQ FOR PARALLEL
MULTICHANNEL COMMUNICATIONS



Enterprise Standards Evaluation and Certification




Dynamic & Decision Oriented Card-Based Insurer
Solution




Concurrency Control On Spatial Database




Stately Sojourn
             No student

                   Employee Loan Management
                 W3 Status Analyser




         ADHOC NETWORK USING LAR PROTOCOL




City Portal on Route Maps




Construction PLUS
ON-LINE LIBRARY MANAGEMENT SYSTEM




Feature-rich Automated Resume Builder with Customizable Templates




                       Bank Master Application




Signaling for Multimedia Conferencing in Stand-Alone Mobile Ad Hoc
                             Networks




Distributional Features for Text Categorization
   Authentication of Secret Information in Image Steganography




Minimizing the File download in peer to peer Networks




Water Mark Design Pattern in Electronic Commerce Applications




Local Language Mobile Services




IRM-Integrated File Replication & Consistency in P2P Systems
Axa Life Insurance




Mining the E-Commerce Data




A Framework for Clustering
Concept-Drifting Categorical Data




Online Passport System




Multiple Routing Configurations for Fast IP Network Recovery



             A lossless comprssion scheme for bayer color filter array images
        Evaluating the Vulnerability of Network Traffic Using Joint Security and
                                                               Routing Analysis




Provably Secure Nested One-Time Secret Mechanisms for Fast Mutual
Authentication and Exchange in Mobile Communications




SI MPS Using Sociology for Personal Mobility

      Image Restoration using Space-Variant Gaussian Scale Mixtures in
                           Overcomplete Pyramids




Interactive Correction and Recommendation for computer language learning




                        Storing and Indexing Spatial Data in P2P Systems




                Robust Load Delegation in Service Grid Environments
Incremental Learning of Chunk Data for Online Pattern
Classification Systems




Variability and Reproducibility in Software Engineering: A
Study of Four Companies that Developed the Same System




                Robust Spanning Data Dissemination
Video Semantic Event/Concept Detection Using a
Subspace-Based Multimedia Data Mining Framework




 Decentralized QoS-Aware Checkpointing Arrangement in Mobile Grid Computing




 Mining Weighted Association Rules without Pre-assigned Weights




Dynamic Routing with Security Considerations



Demonstration of lightpath sharing for video streaming and data collection in
lambda grid net



               Aspect-Oriented Race Detection in Java

 A Three-Tier Framework for Intruder Information Sharing in Sensor
                            Networks

         Measuring Capacity Bandwidth of Targeted Path
         Segments
        Computation-Efficient Multicast Key Distribution


  A Puzzle-Based Defense Strategy Against Flooding Attacks Using
                          Game Theory



Ensuring Data Store Security in
Cloud Computing


Enhanced Delegation-Based Authentication Protocol for PCSs


DATA HIDDING In Image File USING STEGNOGRAPHY




Efficient Node Admission and Certificate less Secure Communication in Short-
Lived MANETs




On_Line Ration Card
Credit card Fraud detection and using hidden markov model




                  Remote client authentication




        CommonDatabase browser and Datamanipulation tool




Privacy-Aware Collaborative Spam Filtering




Grime Dissolution Scheme


village communication bureau



Digital Placard




ON-LINE National Polling
                      Hospice Dossier Control




Automated Jail Mgt and Report Information System
TCP Performance in Flow-Based Mix Networks: Modeling and
                        Analysis




                    Bureaucrat Defended Entity




Histograms and Wavelets on Probabilistic Data(IEEE)




C-TREND Temporal Cluster Graphs for--data engg.doc(IEEE Paper)
A Perceptually Relevant Approachto Ringing Region Detection(IEEE)




 CRYPTANALYSIS OF SOME MULTIMEDIA ENCRYPTION SCHEMES
Enhanced Security for Online ExamsUsing Group Cryptography(IEEE)




                   Municipal Administration System




Data Leakage(IEEE Paper)




Data mining for secure software
engineering(IEEEPaper)
        Optimal Lot Sizing Policies for Sequential Online Auctions




Spatio temporal n/w anomaly detection by accessing deviations of emphirical
mesures(IEEE)
Project Abstract
We propose SigFree, an online signature-free out-of-the-box application-layer method for blocking code-injection buffer
overflow attack messages targeting at various Internet services such as web service. Motivated by the observation that
buffer overflow attacks typically contain executables whereas legitimate client requests never contain executables in most
Internet services, SigFree blocks attacks by detecting the presence of code. Unlike the previous code detection algorithms,
SigFree uses a new data-flow analysis technique called code abstraction that is generic, fast, and hard for exploit code to
evade. SigFree is signature free, thus it can block new and unknown buffer overflow attacks; SigFree is also immunized
from most attack-side code obfuscation methods. Since SigFree is a transparent deployment to the servers being
protected, it is good for economical Internet-wide deployment with very low deployment and maintenance cost. We
implemented and tested SigFree; our experimental study shows that the derror classification and correction component




Self-propagating codes, called worms, such as Code Red, Nimda, and Slammer, have drawn significant attention due to their
enormously adverse impact on the Internet. Thus, there is great interest in the research community in modeling the spread of
worms and in providing adequate defense mechanisms against them. In this paper, we present a (stochastic) branching process
model for characterizing the propagation of Internet worms. The model is developed for uniform scanning worms and then
extended to preference scanning worms. This model leads to the development of an automatic worm containment strategy that
prevents the spread of a worm beyond its early stage. Specifically, for uniform scanning worms, we are able to determine whether
the worm spread will eventually stop. We then extend our results to contain uniform scanning worms. Our automatic worm
containment schemes effectively contain both uniform scanning worms and local preference scanning worms, and it is validated
Dear Ashok Finalize proejct as soon as possible. IEEE is preferred, but check how you can give demo of project-
Nagendra Kumar
In this paper, we propose a Hash-based and Pipelined (abbreviated as HAPPI) architecture for hardware enhanced association
rule mining. Therefore, we can effectively reduce the frequency of loading the database into the hardware.

Under Process
Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities
of secure network traffic that remain undetected when security and routing protocols are
analyzed independently. We formulate a class of continuous metrics to evaluate the
vulnerability of network traffic as a function of security and routing protocols used in
wireless networks. We develop two complementary vulnerability definitions using set
theoretic and circuit theoretic interpretations of the security of network traffic, allowing a
network analyst or an adversary to determine weaknesses in the secure network. We
formalize node capture attacks using the vulnerability metric as a nonlinear integer
programming minimization problem and propose the GNAVE algorithm, a Greedy Node
capture Approximation using Vulnerability Evaluation. We discuss the availability of
security parameters to the adversary and show that unknown parameters can be
estimated using probabilistic analysis. We demonstrate vulnerability evaluation uw
projects etc. promising in terms of both reliability and computational efficiency. Thus the



Data Mining Project
Developing a virtual classroom system to promote a greater count of students to splurge into the field
of Education. It integrates the benefits of a physical classroom with the convenience of a „no-physical-
bar‟ virtual learning environment, minus the commuting hazards and expenses. It will usher in the
immense flexibility and sophistication in the existing learning platform structures, with the perfect
blend of synchronous and asynchronous interaction. It provides a means of collaborative learning for
Peer-to-peer (P2P) streaming has been widely deployed over the Internet. A streaming system usually has multiple
channels, and peers may form multiple groups for content distribution. In this paper, we propose a distributed
overlay framework (called SMesh) for dynamic groups where users may frequently hop from one group to another
while the total pool of users remain stable. SMesh first builds a relatively stable mesh consisting of all hosts for
control messaging. The mesh supports dynamic host
joining and leaving, and will guide the construction of delivery trees. Using the Delaunay Triangulation (DT) protocol
as an example, we show how to construct an efficient mesh with low maintenance cost. We further study various
tree construction mechanisms based on the mesh, including embedded, bypass, and intermediate trees. Through
simulations on Internet-likesensor networksshow not all be alike: somelow delay andmorelink stress than others and
Data generated in wireless topologies, we may that SMesh achieves data may be low important
hence may have different delivery requirements. In this paper, we address differentiated data delivery in the
presence of congestion in wireless sensor networks. We propose a class of algorithms that enforce differentiated
routing based on the congested areas of a network and data priority. The basic protocol, called Congestion-Aware
Routing (CAR), discovers the congested zone of the network that exists between high-priority data sources and the
data sink and, using simple forwarding rules, dedicates this portion of the network to forwarding primarily high-
priority traffic. Since CAR requires some overhead for establishing the high-priority routing zone, it is unsuitable for
highly mobile data sources. To accommodate these, we define MAC-Enhanced CAR (MCAR), which includes
MAC-layer enhancements and a protocol for forming high-priority paths on the fly for each burst of data. MCAR
effectively handles the mobility of high-priority data sources, at the expense of degrading the performance of low-
priority traffic. We present extensive simulation results for CAR and MCAR, and an implementation of MCAR on a 48-
node testbed
Mobile users like to use their own consumer electronic devices anywhere and at anytime to access
multimedia data. Hence, we expect that wireless ad hoc networks will be widely used in the near future since these
networks form the topology with low cost on the fly. However, consumer electronic devices generally operate on
limited battery power and therefore are vulnerable to security threats like data flooding attacks. The data flooding
attack causes Denial of Service (DoS) attacks by flooding many data
packets. However, there are a few existing defense systems against data flooding attacks. Moreover, the existing
schemes may not guarantee the Quality of Service (QoS) of burst traffic since multimedia data are usually burst.
Therefore, we propose a novel defense mechanism against data flooding attacks with the aim of enhancing the
throughput. The simulation results show that the proposed scheme enhances
the throughput of burst traffic1.
The objective of the project is to develop a system that enables proper management of tenders
and associated processing. The system allows users to view and download details of tenders and
then perform their bidding.
a new highly automated approach for dynamic detection and prevention of SQLIAs.
Intuitively, our approach works by identifying “trusted” strings in an application and
allowing only these trusted strings to be used to create the semantically relevant
parts of a SQL query such as keywords or operators. The general mechanism that we
use to implement this approach is based on dynamic tainting, which marks and tracks
certain data in a program at runtime. The kind of dynamic tainting that we use gives
our approach several important advantages over techniques based on other
This allows the Electoral Commission to share a common mission; conduct a deliver
free, fair and credible elections for all citizens. At the core of any democratic nation,
election is choosing a right through eligible voter registration or roll. The accuracy and
currency of this data is the foundation of ensuring voters are included, receive
communications, enabled to vote, and their identity/vote is protected. The cost of
creating the register is enormous and this investment can and must be protected.
While development of the Internet has contributed to the spread of online education, online exams have not been
widely adopted. An online exam is defined here as one that takes place over the insecure Internet, and where no
proctor is in the same location as the examinees. This paper proposes an enhanced secure online exam management
environment mediated by group cryptography using remote monitoring and control of ports and input. The target
domain of this paper is that of online exams for math or English contests in middle or high school, as well as exams in
online university courses with students in remote locations.
While development of the Internet has contributed to the spread of online education, online exams have not been
widely adopted. An online exam is defined here as one that takes place over the insecure Internet, and where no
proctor is in the same location as the examinees. This paper proposes an enhanced secure online exam management
environment mediated by group cryptography using remote monitoring and control of ports and input. The target
domain of this paper is that of online exams for math or English contests in middle or high school, as well as exams in
online university courses with students in remote locations.



Modern real-time wireless networks require high security level to assure confidentiality of information stored in
packages delivered through wireless links. However, most existing algorithms for scheduling independent packets in
real-time wireless networks ignore various security requirements of the packets.
Therefore, in this paper we remedy this problem by proposing a novel dynamic security-aware packet-scheduling
algorithm, which is capable of achieving high quality of security for realtime packets while making the best effort to
guarantee realtime requirements (e.g., deadlines) of those packets. We onduct
extensive simulation experiments to evaluate the performance of our algorithm. Experimental results how that
compared with two baseline algorithms, the proposed algorithm can substantially improve both quality of security
Telecommunication technologies under a wide range of workload progress of wireless and portable networks
and real-time packet guarantee ratioin telemedicine services is the characteristics.
has wide application of mobile electronic healthcare systems. Security is a fundamental system necessity
because many patients have isolation concerns when their individual information is shared over the open
wireless channels. This project determines the characteristics and security problem with wireless and
persistent information interactions for a mobile healthcare system. Mobile health care system consists of a
number of mobile devices and sensors attached to a patient. These devices form a mobile adhoc sensor
network and assemble data that are sent to a hospital or healthcare center for monitoring. In this system a
protected multicast strategy is engaged to evaluate the activities of each node, so that only truthful nodes are
permitted to involve in interactions. A new trust evaluation model can efficiently estimate the
trustworthiness paper, we consider the devices and effectively handle medical nodees
Abstract—In this of movable healthcareproblem of detecting whether a compromised router is maliciously
manipulating its stream of packets. In particular, we are oncerned ith a simple yet effective attack in which a router
selectively drops packets destined for some
victim. Unfortunately, it is quite challenging to attribute a missing packet to a malicious action because normal
network congestion can
produce the same effect. Modern networks routinely drop packets when the load temporarily exceeds their
buffering capacities.
Previous detection protocols have tried to address this problem with a user-defined threshold: too many dropped
packets imply
malicious intent. However, this heuristic is fundamentally unsound; setting this threshold is, at best, an art and will
certainly create
unnecessary false positives or mask highly focused attacks. We have designed, developed, and implemented a
compromised router
detection protocol that dynamically infers, based on measured traffic rates and buffer sizes, the number of
congestive packet losses
that will occur. Once the ambiguity from congestion is removed, subsequent packet losses can be attributed to
malicious actions. We
have tested our protocol in Emulab and have studied its effectiveness in differentiating attacks from legitimate
The project has been developed to fulfill the requirements of the Employment Exchanges. The current
product is a part of overall web-based employment portal. The product will take care of job seeker,
employer and employment exchange perspective for submission activity. Subsequently, the following
points were identified as the broad features required in the software to be developed for Employment
Exchange Computerization at National Level with a facility to meet the Recent advances in Web and
information technologies have resulted in many e-learning resources. There is an emerging
requirement to manage and reuse relevant resources together to achieve on-demand e-learning in the
Web. Ontologies have become a key technology for enabling semantic-driven resource management.
We argue that to meet the requirements of semantic-based resource management for Web-based e-
learning, one should go beyond using domain ontologies statically. In this paper, we provide a
semantic mapping mechanism to integrate e-learning databases by using ontology semantics.
Heterogeneous e-learning databases
can be integrated under a mediated ontology. Taking into account the locality of resource reuse, we
propose to represent contextspecific portions from the whole ontology as subontologies. We present a
Personal Identity Management’ provides the information about the citizen in any country. A Citizen has unique Id to
find out the personal information in each and every department or service wherever a citizen goes. If any citizen
wants to utilize the services or utilities by the Government or Private organizations, he has to go to each and every
department with different Id for that particular department.
In Personal Identity Management the citizen will perform the all transactions basing on id. He/she perform the
transactions like banking, Electricity, Banking, Insurance, Tax, Provident Fund, Telephone, Gas, Movies, Municipality,
Credit rating etc. Credit rating tells the behavior of the person whether citizen’s character is good or bad.
The sources of the problems are node failures and the need for dynamic configuration over extensive
runtime. The fault-tolerance mechanisms also have to be capable of dealing with the specific
characteristics of a heterogeneous and dynamic environment. Even if individual clusters are
homogeneous, heterogeneity in a Grid is mostly unavoidable, since different participating clusters
often use diverse hardware or software architectures.
 Mobile Ad-hoc Networks (MANETs) allow wireless nodes to form a network without requiring a
xedinfrastructure. Early routing protocols for MANETs failed to take security issues into account.
Subsequent proposals used strong cryptographic methods to secure the routing information.

In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We
reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by adaptively selecting the cell and the wireless
technology for each mobile host to join the multicast group. Our mechanism enables more mobile hosts to cluster
together and leads to the use of fewer cells to save the scarce wireless bandwidth.
The introduction of 3G wireless communication systems, together with the invasive distribution of digital images and
the growing concern on their originality triggers an emergent need of authenticating images received by unreliable
channels, such as public Internet and wireless networks. To meet this need, a content-based image authentication
scheme that is suitable for an insecure network and robust to transmission errors is proposed. The proposed scheme
exploits the scalability of a structural digital signature in order to achieve a good tradeoff between security and
image transfer for networked image applications. In this scheme, multi-scale features are used to make digital
signatures robust to image degradations and key dependent parametric wavelet filters are employed to improve the
security against forgery attacks. This scheme is also able to distinguish tampering areas in the attacked image.
Experimental results show the robustness and validity of the proposed scheme.
In this paper, we consider a multichannel data communication system in which the stop-and-wait automatic-repeat
request protocol for parallel channels with an in-sequence delivery guarantee (MSW-ARQ-inS) is used for error
control. We evaluate the re-sequencing delay and the resequencing buffer occupancy, respectively. Under the
assumption that all channels have the same transmission rate but possibly different time-invariant error rates, we
derive the probability generating function of the resequencing buffer occupancy and the probability mass function of
the resequencing delay. Then, by assuming the Gilbert–Elliott model for each channel, we extend our analysis to time-
varying channels.
Through examples, we compute the probability mass functions of the resequencing buffer occupancy and the
resequencing delay for time-invariant channels. From numerical and simulation results, we analyze trends in the
mean resequencing buffer occupancy and the mean resequencing delay as functions of system parameters. We
expect that the modeling technique and analytical approach used in this paper can be applied to the performance
evaluation of other ARQ protocols (e.g., the selective-repeat ARQ) over multiple time-varying channels.



ESEC is a project designed to automate the work process in a ISO 9000 certificate issuing agency. The certificate
issuing agency must be able to manage clients information through enquiry, quotation, audits and certificates issued
and ESEC managersmust also be able to maintain other supporting data.

Smart is an electronic card, which is providing the
 facilities to customers for their health problems.
 Dynamic & Decision Oriented Card-Based Insurer Solution
 is a web-based application, which is used to automate the
 management of smart card issue, providing facilities,
benefits and insurance to customers. This smart card will
be issue at district head quarter and major cities. To take
 this smart card the customer must paid some initial amount.
 This smart card available in 3 types namely Gold, Silver,
and Platinum at 5000, 4000, 3000 rupees respectively.
Multidimensional databases are beginning to be used in a wide
 range of applications. To meet this fast-growing demand,the
 R-tree family is being applied to support fast access to
 multidimensional data, for which the R+-tree exhibits
outstanding search performance.
 In order to support efficient concurrent access in multiuser
environments, concurrency control mechanisms for
 multidimensional indexing have been proposed.



The objective of the project is to develop a system that automates the processes and activities of a
travel and tourism agency. The purpose is to design a system using which one can perform all
operations related to traveling and sight-seeing.




This project is aimed to develop web application automate in managing the employee profile and
their loans in an organization.
The W3Analyser includes three components namely web tracker, hit counter and real-time detailed
web statistics. Just by inserting a simple piece of code on a web page it will be possible to analyze and
monitor all the visitors to the website in real-time.When someone visits the website, the small piece of
code is executed and the visitor's public details (ip address, browser, operating system, referrer, page
title and url etc) are analyzed and stored for reporting to the website owner later. The website owner
has control on which pages he/she wants to track just by placing the code in required pages.




An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located
in such a manner that the interconnections between nodes are capable of changing on a continual
basis. The primary goal of such an ad-hoc network routing protocol is correct and efficient route
establishment between a pair of nodes so that messages may be delivered in a timely manner. LAR is
an on-demand protocol who is based on the DSR(Dynamic Source Routing). The Location Aided
Routing protocol uses location information to reduce routing overhead of the ad-hoc network!
Normally the LAR protocol uses the GPS(Gloal Positioning System) to get these location informations.
With the availability of GPS, the mobile hosts knows there physical location.




The project implements a web portal, which will put together all possible services and
builds a web application that, will guide the user providing relevant information that is
related to a particular city (specifically Hyderabad) through usage of route maps. The like
banking, emergency, transportation, tourists information, etc.,. It’s easy to imagine
extending this application to do many more things




„Construction PLUS‟ is a website; we used J2EE as frontend and MYSQL as backend. In which we can
get online help of the designers, engineers and Vaasthu experts for the construction of our new
houses or buildings etc... In this site we will get the list of contractors, engineers and hardware
dealers in our locality.
This project is an Intranet based application that can be accessed throughout the campus. This system
can be used to search for books/magazines, reserve books, find out who is having a particular book,
put in requests to buy a new book etc. This is one integrated system that contains both the user
component and the librarian component




Develop an Intranet Application for Winner Technologies Ltd. for automating the process of Resume
Writing. This would be facilitating the employees to make and print their resumes in a proper format.
In addition, it will be facilitating the higher management to search the employees depending upon
their skills sets and other attributes.




It is an complete solution for Banking Operations with user friendly
Environment screens for data Manipulation and Retrieving purpose.Designing the Database tables using
Normalization Process representing the Banking Operations. Creating the Tables with appropriate
Constraints and developing Sub programs and Triggers according to the requirement Using ORACLE .




Environment screens for data Manipulation and Retrieving purpose.



 Text categorization is the task of assigning predefined categories to natural language text. With the widely
used “bag-of-word” representation, previous researches usually assign a word with values that express
whether this word appears in the document concerned or how frequently this word appears. These features
are not enough for fully capturing the information contained in a document. Although these values are
useful for text categorization, they have not fully articulated the abundant information contained in the
document.
We propose an image Steganography that can verify the reliability of the information being
transmitted to the receiver. The method can verify whether the attacker has tried to edit, delete or
forge the secret information in the stego-image. The technique embeds the hidden information in the
spatial domain of the cover image and uses two special AC coefficients of the Discrete Wavelet
Transform domain to verify the veracity (integrity) of the secret information from the stego image.
The analysis shows that the BER and PSNR is improved in the case of DWT than DCT.
In this paper, we first characterize the relationship between the heterogeneity in service capacity and the average
download time for each user, and show that the degree of diversity in service capacities has negative impact on the
average download time. After we formally define the download time over a stochastic capacity process, we prove
that the correlations in the capacity make the average download time much larger than the commonly accepted
value , where is the average capacity of the source peer.a simple and distributed algorithm that limits the amount of
time each peer spends on a bad source peer, can minimize the average download time for each user almost in all
cases as we will show in our paper.


This project is used to to model the characteristic of digital watermark in electronic commerce applications. A
watermark design pattern preserves the properties of a digital watermark in binary tree representation.
watermark design patterns for four media data - video, image, audio, and text are derived and expressed as
WDPvideo, WDPimage, WDPaudio and WDPtext respectively. Our results show that watermarks for video and audio
data have to be invisible and robust, and watermarks for text data has to be invisible and fragile, while watermark for
image has to be either visible and fragile, or invisible and robust for electronic commerce applications. This
facilitates electronic commerce application developers to select adequate digital watermarking techniques and off-
the-shelf systems for their development.
Translated user interface in a particular language
2. Ability to view basic information from arbitrary services on public transport movement (real-time), traffic
conditions, retail food prices, health tips for a fixed period, online newspapers, electoral booth congestion, etc.
3. Pick a single service and design its delivery from provider to consumer with a provision for interactivity between
them.
4. Display information with local language
5. Registration required to authenticate user

In peer-to-peer file sharing systems, file replication and consistency maintenance are widely used techniques for high
system performance. Despite significant interdependencies between them, these two issues are typically addressed
separately. Most file replication methods rigidly specify replica nodes, leading to low replica utilization, unnecessary
replicas and hence extra consistency maintenance overhead. Most consistency maintenance methods propagate
update messages based on message spreading or a structure without considering file replication dynamism, leading
to inefficient file update and hence high possibility of outdated file response. This paper presents an Integrated file
Replication and consistency Maintenance mechanism (IRM) that integrates the two techniques in a systematic and
harmonized manner. It achieves high efficiency in file replication and consistency maintenance at a significantly low
cost. Instead of passively accepting replicas and updates, each node determines file replication and update polling by
dynamically adapting to time-varying file query and update rates, which avoids unnecessary file replications and
updates. Simulation results demonstrate the effectiveness of IRM in comparison with other approaches. It
The Project aims to build a data mart to meet the critical reporting needs of users across different business
streams.The existence reporting platform is a historical data store. Most of the scheduled reports fetch previous
day’s data or more.Some adhoc reports are deployed on the web server which the user can run by giving the
necessary inputs as prompts.This necessitates the need for data mart. Different Modules in CDM

• Source Module: In this module we are getting all the transaction data from client.
• Stage Module: In this module we are getting data from source module i.e. using Informatica tool we are extracting
data from source module to stage module.
• Star Module: Here we are populating the client’s important data for business analysis. We are extracting the all
business data from stage module by using Informatica tool and finally we are loading into Star module.

This research used the principles of data mining to cluster customer segments by using K-Means algorithm and data
from web log of various e-commerce websites. .Sensors monitor some surrounding environmental phenomenon,
process the sensed data and forward it towards a “close” base station (i.e. a sink). This latter collects the data from
the different sensor nodes and transmits this data to some remote control station where the data will be exploited at
the application level.
Data clustering is an important technique for exploratory data analysis and has been the focus of substantial
research in several domains for decades among which Sampling has been recognized as an important technique to
improve the efficiency of clustering. However, with sampling applied, those points that are not sampled will not have
their labels after the normal process. Although there is a straightforward approach in the numerical domain, the
problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the
categorical domain. In this paper, a mechanism named Maximal Resemblance Data Labeling (abbreviated as MARDL)
is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel
categorical clustering representative, namely, N-Node set Importance Representative(abbreviated as NNIR), which
represents clusters by the importance of the combinations of attribute values. MARDL has two advantages:
 1) MARDL exhibits high execution efficiency.
 2) MARDL can achieve high intra cluster similarity and low inter cluster similarity
The ideal structure of online passport registration provides security to the passports to be registered
where in we can fill all the details in an efficient and easy manner. A passport is a document , issued
by a national Government. Which certifies , for the purpose of international travel, The identity and
nationality of it‟s holder. The Elements of identity are name, date of birth, sex and place of birth most
often, most often nationality and citizenship are congruent. A passport does not of itself entitle the
passport holder entry into another country , nor to consular protection while abroad or any other
privileges it does. However normally entitle the passport holder to return to his country that issued
the passport. Rights to consular protection arise from international agreements, and the right to
return arises from the laws of issuing country. An individual can register for a passport irrespective of
his/her age. The registration of passport is a major step for issuing of a passport. it is system orct that
the modeling technique and analytical approach used in failure scenarios, using a single mechanism to
Our proposed scheme guarantees Recovery in all single this paper can be applied to the performance
handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly
connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on eeping
additional routing information in the routers, and allows packet forwarding to continue on an
alternative output link immediately after the detection of a failure
In most digital cameras, Bayer color filter array (CFA) images are captured and demosaicing is
generally carried out before compression. Recently, it was found that compression-first schemes
outperform the conventional demosaicing-first schemes in terms of output image quality. An efficient
prediction-based lossless compression scheme for Bayer CFA images is proposed.
Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure
network traffic that remain undetected when security and routing protocols are analyzed
independently. We formulate a class of continuous metrics to evaluate the vulnerability of network
traffic as a function of security and routing protocols used in wireless networks. We develop two
complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the
security of network traffic, allowing a network analyst or an adversary to determine weaknesses in the
Many security mechanisms for mobile communications have been introduced in the literature. Among these
mechanisms, authentication plays a quite important role in the entire mobile network system and acts as the first
defense against attackers since it ensures the correctness of the identities of distributed communication entities
before they engage in any other communication activity. Therefore, in order to guarantee the quality of this
advanced service, an efficient (especially user-efficient) and secure authentication scheme is urgently desired. In this
paper, we come up with a novel authentication mechanism, called the nested one-time secret mechanism, tailored
for mobile communication environments
Assessing mobility in a thorough fashion is a crucial step toward more efficient mobile network design. Recent
research on mobility has focused on two main points: analyzing models and studying their impact on data transport.
These works investigate the consequences of mobility. In this paper, instead, we focus on the causes of
mobility.Starting from established research in sociology, we propose SIMPS, a mobility model of human crowds with
pedestrian motion. This model defines a process called sociostation, rendered by two complimentary behaviors,
namely socialize and isolate, that regulate an individual with regard to her/his own sociability level. SIMPS leads to
results that agree with scaling laws observed both in small-scale and large-scale human motion. Although our model
defines only two simple individual behaviors, we observe many
emerging collective behaviors (group formation/splitting, path formation, and evolution).

Image restoration is typically formulated as the estimation of an image given a linearly filtered version of the original corrupted
by additive noise. This is a difficult, ill-posed, inverse problem. A more tractable problem arises when we only consider additive
noise in the degradation model (denoising problem). The possibility of using image denoising techniques within more generic

In this project we present an automated learning and skills training system for a database programming environment
that promotes procedural knowledge acquisition and skills training. We introduce the underlying data structures
andanalysis techniques for correction and personalized recommendation. Our primaryobjective is to investigate an
integrated approach to correction, domain-specific feedback, and personalized guidance features. A pattern-based
error classification and correction component analyzes student input in order to provide immediate
feedback. Active learning and training is a particularly effective form of education.In various domains, skills are
equally important to knowledge. The system provides meaningful knowledge-level feedback such as correction of
student solutions and personalized guidance through recommendations. Specifically, we address automated
synchronous feedback and recommendations based on personalized performance assessment. At the core of the
tutoring system is a pattern-based error classification and correction component that analyzes student input in order
to provide immediate feedback and in order to diagnose student weaknesses and suggest further study material. A
syntax-driven approach based on grammars and syntax trees provides the solution for a semantic analysis technique.

Our goal is to create from scratch a technique that is inherently distributed and also maintains the
multidimensionality of data. Our focus is on structured P2P systems that share spatial information. We
present SPATIALP2P, a totally decentralized indexing and searching framework that is suitable for
spatial data. SPATIALP2P supports P2P applications in which spatial information of various sizes can be
dynamically inserted or deleted, and peers can join or leave. The proposed technique preserves well
locality and address the problem space.
In this paper, wedirectionality of of finding well-performing workload exchange policies for decentralized Computational Grids using an
Evolutionary Fuzzy System. To this end, we establish a noninvasive collaboration model on the Grid layer which requires minimal information
about the participating High Performance and High Throughput Computing (HPC/HTC) centers and which leaves the local resource managers
completely untouched. In this environment of fully autonomous sites, independent users are assumed to submit their jobs to the Grid middleware
layer of their local site, which in turn decides on the delegation and execution either on the local system or on remote sites in a situation-
dependent, adaptive way. We find for different scenarios that the exchange policies show good performance characteristics not only with respect
to traditional metrics such as average weighted response time and utilization, but also in terms of robustness and stability in changing
environments.
In many real-world applications such as pattern recognition, data mining, and time-series prediction, we often confront difficult situations where a complete set of
training samples is not given when constructing a system. In face recognition, for example, since human faces have large variations due to expressions, lighting
conditions, makeup, hairstyles, and so forth, it is hard to consider all variations of face in advance. In many cases, training samples are provided only when a system
misclassifies objects. On the other hand, in many practical applications of data mining and time-series predictions, the data are generally provided little by little and
In property of data reproducibility in software engineering (SE) is investigated thoroughly. This project reports a
the this project,source could be changed as time passes

longitudinal multiple-case study of variations and reproducibility in software development from bidding to
deployment based on the same requirement specification. In a call for tender to various companies, some of them
are responded. In that four of them had developed the system independently. The four development projects were
assessed according to costs, lead time, and schedule overrun. To assemble the detailed information on the software
production, we collected and analyzed management information and software development documents and
conducted extensive interviews with developers and project managers. A significant effort was put into the
conceptual definition and operationalization of fundamental SE terms. Factors that are known to affect software
productivity and quality, including team size, developer skills, development technology, and interaction with the
customer were controlled. The variability for predictable reasons is also included in the concept of reproducibility.
Thus the variations in both firm price and variations in schedule and planned development process are used to
predict project and product outcomes.
Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions
are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this
work, we describe and evaluate a robust topology for applications that operate on a spanning tree overlay network. Unlike
previous work that is adaptive or reactive in nature, we take a proactive approach to robustness. The topology itself is able to
simultaneously withstand disturbances and exhibit good performance.
With the proliferation of video data and growing requests for video applications, there is an increasing need of advanced technologies for
indexing, filtering, searching, and mining the vast amount of videos such as event detection and concept extraction. Here, video events are
normally defined as the interesting events which capture users’ attentions (i.e., goal events, traffic accidents, etc.); whereas the concepts refer to
high-level semantic features, like “commercials,” “sports,” etc.
Deals with decentralized, QoS-aware middleware for checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is
more crucial in MoG systems than in their conventional wired counterparts due to host mobility, dynamicity, less reliable wireless links, frequent
disconnections and variations in mobile systems. We’ve determined the globally optimal checkpoint arrangement to be NP-complete and so
consider Reliability Driven (ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior checkpointing arrangements
efficiently.

Association rule mining is a key issue in data mining. However, the classical models ignore the difference between the
transactions, and the weighted association rule mining does not work on databases with only binary attributes. In this
paper, we introduce a new measure w-support, which does not require pre-assigned weights. It takes the quality of
transactions into consideration using link-based models.
Security has become one of the major issues for data communication over wired and wireless
networks. Different from the past work on the designs of cryptography algorithms and system
infrastructures, An analytic study on the proposed algorithm is presented, and experiments are
conducted to verify the analytic results and to show the capability of the proposed algorithm.
A load-balancing-based on-demand lightpath sharing solution for heterogeneous resources is experimentally
demonstrated in a GMPLS-enabled lambda grid testbed. Experimental results show that the end-to-end lightpath
can be simultaneously employed by the video streaming application and the data collection application. Moreover,
the load centralisation effect caused by lightpath sharing is successfully avoided with the introduction of a load-
balancing mechanism. have developed specialized programs to aid programmers in detecting concurrent programming
In the past, researchers
errors such as deadlocks, live locks, starvation, and data races. In this work, we propose a language extension to the
aspect-oriented programming language Aspect, in the form of three new point cuts, lock (), unlock (), and maybe
Shared ()
In sensor networks, an intruder (i.e., compromised node) identified and isolated in one place can be
relocated and/or duplicated to other places to continue attacks; hence, detection and isolation of the
same intruder or its clones may have to be conducted repeatedly, wasting scarce network resources.
In this project we are going to measure the bandwidth capacity between specified path segments in a distributed network Accurate measurement
of network bandwidth is important factor for network management applications as in intranet applications and protocols which are actively
manage and dynamically adapt to varying consumption of network resources. The existing work is focused on two approaches to measuring
bandwidth capacity of the network are: calculating It by hop-by-hop, and measuring it end-to-end along a specified path of a distributed network
Efficient key distribution is an important problem for secure group communications. In many applications,
multicast is an efficient means of distributing data in terms of resources usage. The privacy of a multicast
communication session is usually ensured using symmetric encryption. All the designated receivers or members in
a multicast group share a session encryption key
In recent years, a number of puzzle-based defense mechanisms have been proposed against flooding denial-of-service (DoS)
attacks in networks. DoS attacks are aimed at the loss of or the reduction in availability, which is one of the most important
general security requirements in computer networks. Nonetheless, these mechanisms have not been designed through formal
approaches and thereby some important design issues such as effectiveness and optimality have remained unresolved
Cloud computing has been envisioned as the next-generation architecture of IT enterprise. In contrast to traditional solutions,
where the IT services are under proper physical, logical and personnel controls, cloud computing moves the application software
and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique
attribute, however, poses many new security challenges which have not been well understood. In this article, we focus on cloud
data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in
the cloud, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors.
Lee and Yeh recently presented a delegation-based authentication protocol for portable communication systems (PCSs),
which is claimed to provide non-repudiation in on-line authentication. This investigation indicates that their protocol has
a weakness in that a malicious visited location register can forge the authentication messages in off-line authentication
Steganography is mobile and from obtaining non-repudiation in such processes
processes, preventingthe art users science of writing hidden messages in such a way that no-one apart
from the sender and intended recipient even realizes there is a hidden message. By contrast,
cryptography obscures the meaning of a message, but it does not conceal the fact that there is a
message.




MOBILE ad hoc networks (MANETs) have many well known applications in military, law enforcement, emergency
rescue, and humanitarian aid environments. However, lack of stable infrastructure and absence of centralized
control exacerbate security problems in MANETs thus requiring very specialized security services. Decentralized node
admission is an essential and fundamental security service in mobile ad hoc networks. It is needed to securely cope
with dynamic membership and topology as well as to bootstrap other important security primitives and services
without the assistance of any centralized trusted authority. An ideal admission technique must involve minimal
interaction among MANET nodes, since connectivity can be unstable. Also, since MANETs are often composed of
weak or resource-limited devices, admission must be efficient in terms of computation and communication. Most
previously proposed admission protocols are prohibitively expensive and require heavy interaction among MANET
nodes. In this paper, we focus on a common type of MANET that is formed on a temporary basis, and present a
secure, efficient, and a fully non interactive admission technique geared for this type of a network. Our admission
protocol is based on secret sharing techniques using bivariate polynomials. We also present a new scheme that
allows any pair of MANET nodes to efficiently establish an on-the-fly secure communication channel.


The main aim of this project is to reduce the corruption in Ration System.In the web based Ration system the admin
will give the username and password to customer.By using this password and username the customer
          select the items then the system will give the universal identification
          number and display the total amount.The customer will give the universal identification number to the
shopkeeper.Then the Shopkeeper checks the what are the items
          selected by the customer that items are given to him by paying system.
          All reports are observed by the government in report modules.
           password to customer. By using this password and username the customer
         select the items then the system will give the universal identification




          number and display the total amount



In this project we fully deal about the concept of enormous spam e-mails directed at large numbers of
recipients, designing effective collaborative anti-spam systems raises several important research challenges.
Since e-mails may contain confidential information, any collaborative anti-spam approach has to guarantee
strong privacy protection to the participating entities. Second, the continuously evolving nature of spam
demands the collaborative techniques to be resilient to various kinds of camouflage attacks. Third, the
collaboration has to be lightweight, efficient, and scalable. Toward addressing these challenges, to achieve
all the above statements we create a frame work called as privacy-aware framework for collaborative spam
filtering) through which we control the spam attacks. In designing the ALPACAS framework, we make two
unique contributions. The first is a feature-preserving message transformation technique that is highly
resilient against the latest kinds of spam attacks. The second is a privacy-cus on a common type of MANET
that is formed on a temporary basis, and present a secure, eff
Grime Dissolution Scheme is a web based application which is used to automate the management of
soil sample collection entry, lab testing reports, recommendations to farmers, master data(district,
mandal, village) . Whenever the farmers brought soil samples it allows user will enter the details
about sample and from where it was collected. Then the user can forward the samples to the

To provide facilities to the village
The objective of this application is to design and build a Classifieds website. The website must
provide information to the users about various fields such as education, rental, real estate,
We live in a democracy and voting
vacancies, cinema, matrimonial etc. is one of our fundamental duties as responsible citizens
of the country, but nowhere around the country a 100% people come to vote during the
elections in their territory (country). There have been many reasons for that some of them
are:In the rural areas the influential people keep their men at the polling booths to threaten
the common man to vote for them
F




The objective of this application is to maintain the details of prisoners and other information related to prisons. This
enables law enforcement people to access necessary information quickly and effectively. This project is aimed at
developing a prison management system for the effective management of prisons




There is a growing realization that uncertain information is a first-class citizen in modern database management. As
such, we need techniques to correctly and efficiently process uncertain data in database systems. In particular, data
reduction techniques that can produce concise, accurate synopses of large probabilistic relations are crucial In this
paper, we introduce definitions and algorithms for building histogram- and Haar wavelet-based synopses on
probabilistic data. The core problem is to choose a set of histogram bucket boundaries or wavelet coefficients to
optimize the accuracy of the approximate representation of a collection of probabilistic tuples under a given error
metric




The objective of the project is to develop a system that deals with the restaurant activities. The system
provides knowledge and practical perspectives of all aspects of viewing the restaurants, order the food in
the restaurant which will prove invaluable to managing a information services cost effectively, while
meeting the needs of its users.
             An efficient approach toward a no-reference ringing metric intrinsically exists of two steps: first detecting regions in an image where
ringing might occur, and second quantifying the ringing annoyance in these regions. This paper presents a novel approach toward the first step:
the automatic detection of regions visually impaired by ringing artifacts in compressed images. It is a no-reference approach, taking into account
the specific physical structure of ringing artifacts combined with properties of the human visual system (HVS). To maintain low complexity for
real-time applications, the proposed approach adopts a perceptually relevant edge detector to capture regions in the image susceptible to ringing,
and a simple yet efficient model of visual masking to determine ringing visibility. The approach is validated with the results of a psychovisual
experiment, and its performance is compared to existing alternatives in literature for ringing region detection. Experimental results show thacus
on a common type of MANET that is formed on a temporary basis, and present a sec




Encryption is one of the fundamental technologies that is used in digital rights management. Unlike ordinary computer
applications, multimedia applications generate large amounts of data that has to be processed in real time. So, a number
of encryption schemes for multimedia applications have been proposed in recent years.We analyze the following
proposed methods for multimedia encryption: key-based multiple Huffman tables (MHT), arithmetic coding with key-
based interval splitting (KSAC), and randomized arithmetic coding (RAC). Our analysis shows that MHT and KSAC
are vulnerable to low complexity known- and/or chosen-plaintext attacks. Although we do not provide any attacks on
RAC, we point out some disadvantages of RAC over the classical compress-then-encrypt approach.
 Online exam is field that is very popular and made many security assurances. Then also it fails to control
cheating. Online exams have not been widely adopted well, but online education is adopted and using
allover the world without any security issues. An online exam is defined in this project as one that takes
place over the insecure Internet, and where no proctor is in the same location as the examinees.
This project proposes an enhanced secure filled online exam management environment mediated by using
remote monitoring and control of ports and input. The target domain of this project is that of online exams
for any subject’s contests in any level of study, as well as exams in online university courses with students
in various remote locations.




Local bodies are classified into Municipal Corporations, Municipalities of different grades and Nagara Panchayats
depending upon the population and income of the Urban Local Body. These Urban Local Bodies have been onstituted
with the objective of discharging certain functions likeSupply of drinking water,public street lighting,Maintaining
sanitation and hygiene of public places,Maintenance of public parks and gardens,Ensuring systematic/planned urban
growth,Regulation of building construction,Licensing of Trade activitie,Maintenance of Birth and Death records.




A data distributor has given sensitive data to a set of supposedly trusted agents (third parties). Some of the
data is leaked and found in an unauthorized place (e.g., on the web or somebody’s laptop). The distributor
must assess the likelihood that the leaked data came from one or more agents, as opposed to having been
independently gathered by other means. We propose data allocation strategies (across the agents) that
improve the probability of identifying leakages. These methods do not rely on alterations of the released
data (e.g., watermarks). In some cases we can also inject “realistic but fake” data records to further improve
our chances of detecting leakage and identifying the guilty party.



Data Mining for Software Engineering: To improve software productivity and quality, software engineers are increasingly applying data mining
algorithms to various software engineering tasks. However mining software engineering data poses several challenges, requiring various
algorithms to effectively mine sequences,graphs and text from such data. Software engineering data includes code bases, execution traces,
historical code changes, mailing lists and bug data bases. They contains a wealth of information about a projects-status, progress and evolution.
Using well established data mining techniques, practitioners and researchers can explore the potential of this valuable data in order to better
manage their projects and do produce higher-quality software systems that are delivered on time and with in budget. Data mining can be used in
gathering and extracting latent security requirements, extracting algorithms and business rules from code, mining legacy applications for
requirements and business rules for new projects etc.
The project proposes methods to find the suitable and appropriate way for sequential online auctions. This
is a common approach in business. There are lots of confusions in the world of auctions. Nowadays
cheating is the synonym of auction. This image should change to utilize maximum in the area of business by
auctions. Auctions are headache for both auctioneer and the customer. We are studied on every part of this
and proposing a new concept for this. The efficiency of auctions can increase and can make a tension free
business. In the project, presents a goal programming approach for estimating the bid distribution for the
bidder population from the observed bids, readily available in these procedures. Develop models to compute
optimal lot sizes for both stationary and non-stationary bid distributions.




we introduce an internet trafficanamoly detection mechanismbased on latge deviations results for results
for empirical measures Using past traffic traces we characterize network traffic during various time-of-day
intervals, assuming that it is anomaly-free. We present two different approaches to characterize traffic
phone No   Mail Id
8143256401




9491894341
9492229381
9290272261




8008253233 mgmouni56@gmail.com




9291543032 lakshmi.tulasi21@gmail.com
9618386498 sravanilutukurthi@gmail.com




           manohar.kavala@gmail.com




8958013105 madhu.k1388@gmail.com




9493991658 madhundd@gmail.com
9618488023 kalisipudimaheshbabu@gmail.com




9490736473 mahesh.manne2008@gmail.com




9491953295 sumas.sasi@gmail.com




           mohan116kittu@gmail.com




9705933466 murali.manik@gmail.com
9550403929 pavankumarnekkanti@gmail.com
9966094864 Ch_srilakshmi@ymail.com




9652330929 vanitha_sudha23@yahoo.co.in




9866782648 sudhaappl1@yahoo.co.in
9490223607 sudhakarpenki@gmail.com




9985047875 suneetha_009@yahoo.co.in




9849961070 kadagala_suresh@yahoo.co.in




9052233968 sureshgmks@gmail.com



9030116223 suresh9052266747@gmail.com
9000836350 suresh9000836350@gmail.com



9912860009 msraju.144@gmail.com




9603317686 vimalsuresh.suresh@gmail.com
9866532486 veeraswamypepeti@gmail.com




9989360620 lakshmiy27@gmail.com
9676668389 nagronaldo07@gmail.com




9014382710 gvsubbumca@gamil.com
   9618374816 rapaka.venkatesulu@gmail.com




   9951418989 kittuvetukuri@gmail.com




   9491440828 v.r.krishna.ch@gmail.com




8985058933 vinny.munny@gmail.com
9912392949 ch.venkatkumar7@gmail.com




           yugandhar119@gmail.com

				
DOCUMENT INFO
Shared By:
Categories:
Tags:
Stats:
views:23
posted:12/3/2011
language:English
pages:68
liamei12345 liamei12345 http://
About