About
A challenging position in an organization where I can put my best efforts with Enhancement of my skill and strengths to achieve the predetermined goals of the organization.
Skills & Expertise
Java
C
C++
HTML
DHTML
XML
JavaScript
PHP
J2SE
J2EE
JDBC
Servlets
JSP
Oracle8i
Oracle9i
MySQL
AWT
Swings
Applet
Research Interests
Prospecting
Cold Calling
Networking
Relationship Building
Meeting Planning
Proposal Development
Pricing
Negotiation
Persuasion
Client Relationship Management
Problem Solving
Communication
Presentation
Teamwork
Project Management
Teaching
Online Teaching
Coding
Connect With Me
Experience
Business Development Manager
Prospect for potential new clients and turn this into increased business. Cold call as appropriate within your market or geographic area to ensure a robust pipeline of opportunities. * Meet potential clients by growing, maintaining, and leveraging your network. Identify potential clients, and the decision makers within the client organization. Research and build relationships with new clients. Set up meetings between client decision makers and companys practice leaders/Principals. Plan approaches and pitches. * Work with team to develop proposals that speaks to the clients needs, concerns, and objectives. Participate in pricing the solution/service. Handle objections by clarifying, emphasizing agreements and working through differences to a positive conclusion. * Use a variety of styles to persuade or negotiate appropriately. Present an image that mirrors that of the client.
Education
Jaipur National University (JNU)
MITS School of Distance education
Aurora Research and Technological Institute
BHARAT INST. OF ENG &TEC
C.K.M College
Projects
Spatial Approximate String Search
This work deals with the approximate string search in large spatial databases. Specically, we investigate range queries augmented with a string similarity search predicate in both Euclidean space and road networks. We dub this query the spatial approximate string (SAS) query. In Euclidean space, we propose an approximate solution, the MHR-tree, which embeds min-wise signatures into an R-tree. The min-wise signature for an index node u keeps a concise representation of the union of q-grams from strings under the sub-tree of u. We analyze the pruning functionality of such signatures based on the set resemblance between the query string and the q-grams from the sub-trees of index nodes. We also discuss how to estimate the selectivity of a SAS query in Euclidean space, for which we present a novel adaptive algorithm to nd balanced partitions using both the spatial and string information stored in the tree. For queries on road networks, we propose a novel exact method, RSASSOL, which signicantly outperforms the baseline algorithm in practice. The RSASSOL combines the q- gram based inverted lists and the reference nodes based pruning. Extensive experiments on large real data sets demonstrate the efficiency and effectiveness of our approaches. Technologies Used : HTML, Java, Jsp, JavaScript, Mysql 5.0
Authentication of secret information in image Steganography
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. Technologies Used : Awt, Swings and Applet ,oracle.
Certificates & Licenses (2)
District Level Camp Certification
B-certification
dd