CHOOSE YOUR BEST OPPORTUNITY

Job For Freshers As - Field Application Engineer Job Description: We are looking for Technical Field Application Engineer / Technical marketing executive to Market & Support VLSI, EMBEDDED PRODUCTS in south India. Salary:                      INR 1,00,000 - 2,00,000 P.A. Along with Salary - FAE will get Attractive     Incentives, Conveyance, Traveling Ta/da Industry:                  Industrial Products / Heavy Machinery Functional Area:     Sales, Retail, Business Development Role Category:       Other Role:                        Trainee Keyskills:                 VLSI, EMBEDDED, MARKETING, FAE, TECHNICAL SUPPORT, BANGALORE, MBA, BE Desired Candidate Profile: Education:UG - Any Graduate - Any Specialization, Graduation Not Required, B.Tech/B.E. - Any Specialization, Electrical, Electronics/Telecommunication, Instrumentation PG - Any Postgraduate - Any Specialization, Post Graduation Not Required, MBA/PGDM Any Specialization, Marketing Smart, Dynamic, Presentation skills, Hunger to grow, Quick learner, convincing, Target achiever. BE in Electronics, Electrical, instrumentation with MBA Marketing will be preferable. Driving license is must. Company Profile: Silicon Micro Systems https://www.simsindia.net We are Manufacturers of VLSI, EMBEDDED, COMMUNICATION and PLC related products, we are distributors for some of the Global related design companies in India since 1997. Contact Details: Recruiter Name:       RAMYA ARADHYA Contact Company:    Silicon world Telephone:                 08026609313 Reference Id:             SIMS-FAE For Apply : Click here

Jobs as Operator-cum Mechanic Applicants need to go to the venue mentioned or call on the number provided below Job Description: Cost to Company (CTC): Rs. 3.53 Lakhs per annum (approximately) including Pay and Dearness Allowance, Conveyance Allowance, Company Accommodation / House Rent Allowance, Free Medical Facility, LTA, CPF, Gratuity etc. Vacancies:                          21 (UR- 10 OBC- 7 SC – 3 ST - 1) Scale of Pay and Grade:    Rs. 9160 - 3% -13150/- (S-3) Qualification:                      SSC/Matric with ITI or Diploma in Engineering from a recognized Board/Institute with valid Heavy Motor Vehicle Driving License. Ex-Servicemen with equivalent qualification may also apply. Candidates must produce latest Driving License Extract Copy issued by the Regional Transport Authority of the concerned State Govt. at the time of job test.                 Experience:                         Should have post-qualification experience of 3 (Three) years for UR/OBC candidates and 2'/2 (Two & half) years for SC/ST candidates in operating Earth Moving / Material Handling Equipments after obtaining Heavy Vehicle Driving License. Mode of Selection:               Selection will be through written test, job test and interview to be held at Visakhapatnam. Apply online : http://www.vizagsteel.com Last date for apply online : 10.01.2013 For more details : http://www.vizagsteel.com/code/tenders/jobdocs/14631OCM%20New%20Advt.pdf Last Apply Date:         10 Jan 2013 Salary:                           Rs. 9160 - 3% -13150/- (S-3) Industry:                        Iron and Steel Functional Area:           Production, Manufacturing, Maintenance Desired Candidate Profile Company Profile  Visit  Visakhapatnam Steel Plant  website . Contact Details Reference Id:http://www.vizagsteel.com *****Applicants need to go to the venue mentioned or call on the number provided below*****

IEEE Java Project - Detecting and Resolving Firewall Policy Anomalies Detecting and Resolving Firewall Policy Anomalies ABSTRACT: The advent of emerging computing technologies such as service-oriented architecture and cloud computing has enabled us to perform business services more efficiently and effectively. However, we still suffer from unintended security leakages by unauthorized actions in business services. Firewalls are the most widely deployed security mechanism to ensure the security of private networks in most businesses and institutions. The effectiveness of security protection provided by a firewall mainly depends on the quality of policy configured in the firewall. Unfortunately, designing and managing firewall policies are often error prone due to the complex nature of firewall configurations as well as the lack of systematic analysis mechanisms and tools. In this paper, we represent an innovative policy anomaly management framework for firewalls, adopting a rule-based segmentation technique to identify policy anomalies and derive effective anomaly resolutions. In particular, we articulate a grid-based representation technique, providing an intuitive cognitive sense about policy anomaly. We also discuss a proof-of-concept implementation of a visualization-based firewall policy analysis tool called Firewall Anomaly Management Environment (FAME). In addition, we demonstrate how efficiently our approach can discover and resolve anomalies in firewall policies through rigorous experiments. EXISTING SYSTEM: Firewall policy management is a challenging task due to the complexity and interdependency of policy rules. This is further exacerbated by the continuous evolution of network and system environments. The process of configuring a firewall is tedious and error prone. Therefore, effective mechanisms and tools for policy management are crucial to the success of firewalls. Existing policy analysis tools, such as Firewall Policy Advisor and FIREMAN, with the goal of detecting policy anomalies have been introduced. Firewall Policy Advisor only has the capability of detecting pair wise anomalies in firewall rules. FIREMAN can detect anomalies among multiple rules by analyzing the relationships between one rule and the collections of packet spaces derived from all preceding rules. However, FIREMAN also has limitations in detecting anomalies. For each firewall rule, FIREMAN only examines all preceding rules but ignores all subsequent rules when performing anomaly analysis. In addition, each analysis result from FIREMAN can only show that there is a misconfiguration between one rule and its preceding rules, but cannot accurately indicate all rules involved in an anomaly. PROPOSED SYSTEM: In this paper, we represent a novel anomaly management framework for firewalls based on a rule-based segmentation technique to facilitate not only more accurate anomaly detection but also effective anomaly resolution. Based on this technique, a network packet space defined by a firewall policy can be divided into a set of disjoint packet space segments. Each segment associated with a unique set of firewall rules accurately indicates an overlap relation (either conflicting or redundant) among those rules. We also introduce a flexible conflict resolution method to enable a fine-grained conflict resolution with the help of several effective resolution strategies with respect to the risk assessment of protected networks and the intention of policy definition. System Configuration:- H/W System Configuration:-  ü Processor             -Pentium –III ü Speed                             -    1.1 Ghz ü RAM                    -    256 MB(min) ü Hard Disk            -   20 GB ü Floppy Drive       -    1.44 MB ü Key Board            -    Standard Windows Keyboard ü Mouse                  -    Two or Three Button Mouse ü Monitor                -    SVGA  S/W System Configuration:- v   Operating System          : Windows95/98/2000/XP v   Front End                      : Java REFERENCE: Hongxin Hu, Student Member, IEEE, Gail-Joon Ahn, Senior Member, IEEE, and Ketan Kulkarni,” Detecting and Resolving Firewall Policy Anomalies”, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012.

IEEE Java Project - Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs

Walk IN Interview for Freshers - 2013 By ( Bajaj Capital Limited) Posted: 28 Dec 2012 12:49 PM PST           Walkin Interview from 29th December to 31st December from 11 AM *******Applicants need to go to the venue mentioned or call on the number provided below******* Job Description: Financial Planning Executives 1. Getting regular business from existing set of clients. 2. Acquiring new clients through referrals. 3. Establishing relationships with new clients by regular presentations or discussions. 4. Consistent achievement of monthly targets. 5. Penetration of all products in all clients" portfolios Salary:                  INR 1,00,000 - 6,00,000 P.A Industry:               Banking / Financial Services / Broking Functional Area:  Sales, Retail, Business Development Role Category:    Retail Sales Role:                     Sales/Business Development Manager Keyskills:             freshers sales financial planning mutual funds Relationship managers Desired Candidate Profile Education:(UG - Any Graduate - Any Specialization, Graduation Not Required) AND (PG - Any Postgraduate - Any Specialization, Post Graduation Not Required) AND ( Doctorate - Any Doctorate - Any Specialization, Doctorate Not Required) Company Profile: Bajaj Capital Limited http://www.bajajcapital.com The Bajaj Capital Group is one of India"s premier Investment Advisory and Financial Planning companies. We are also SEBI-approved Category I Merchant Bankers. We offer personalised Investment Advisory and Financial Planning services to individual investors, corporate houses, institutional investors, Non-Resident Indians (NRIs) and High Networth Clients, among others. As one of India s largest distributors of financial products, we offer a wide range of investment products such as mutual funds, life and general insurance, bonds, post office schemes, etc. offered by reputed public and private and government organisations. Contact Details: Recruiter Name:        Amrita Pandya Gupta Contact Company:     Bajaj Capital Limited Address:                      97,bajaj House,5th Floor, Nehru Place NEW DELHI,Delhi,India Telephone:                 91-11-4400044 Walkin Interview from 29th December to 31st December from 11 AM DATE AND VENUE OF INTERVIEW:    From - 28th,29th and 31st December    BAJAJ CAPITAL LTD.    97 Bajaj house    5th floor , Nehru Place   11am - 5pm

Software Trainee Internship for Final Year of B.tech(cs/it)/ MCA 2013 Posted: 28 Dec 2012 12:31 PM PST                                                      MK  Nano Technologies Job Description: candidate specifications Candidates can be in their final year of B.Tech(CS/IT)/ MCA or pass out and should be available from JAN to JUN for such industrial training During this period of training candidate will be provided extensive training on IT solution/ Products covering entire Software Development Cycle Performance will be evaluated continuously and qualified candidate will be offered jobs in development or support latest from 1st July 2013 or earlier. During this period, we will not make any stipend to the candidate but will provide infrastructure facilities at our office at Gurgaon. All Candidates are required to bring their own laptop. We prefer candidates with prior knowledge on Microsoft Shop (Visual Studio & .Net 3.5 or above, HTML, JQuery & CSS) We will not charge anything from candidate in lieu of above training. We will provide requisite Certificate to the candidates on successful training. Salary:                       No Stipend Industry:                    IT-Software / Software Services Functional Area:       IT Software - Application Programming, Maintenance Role Category:         Other Role:                          Trainee Keyskills:                  Software Engineer / Software Programmer/ Software Trainee / Software Developer, software development, senior software engineer Desired Candidate Profile: Education:(UG - B.Tech/B.E. - Computers) OR (PG - MCA - Computers) AND ( Doctorate - Doctorate Not Required) Please refer to the Job description above Company Profile: MK Nano Technologies Pvt Ltd. We are a software company & our team is specialized in designing & creating tools that can improve productivity of individual or Team and works on all platforms (Mobile, Web & Desktop). We can Develop, Migrate & Monitor applications on conventional servers as well as on Cloud. We guarantee superior service & zero downtime to all our clients Contact Details; Recruiter Name:        Neha Sharma Contact Company:     MK Nano Technologies Pvt Ltd Reference Id:             MKN/12/12/1001 For Apply : click here

IEEE Java Project - Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs Posted: 27 Dec 2012 10:36 PM PST Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs ABSTRACT:              The multihop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks, and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism. EXISTING SYSTEM:                         In the existing system, the multihop routing of WSNs often becomes the target of malicious attacks. An attacker may tamper nodes physically, create traffic collision with seemingly valid transmission, drop or misdirect messages in routes, or jam the communication channel by creating radio interference. PROPOSED SYSTEM:                  In the proposed system , to secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS: •         System                 : Pentium IV 2.4 GHz. •         Hard Disk            : 40 GB. •         Floppy Drive       : 1.44 Mb. •         Monitor                : 15 VGA Colour. •         Mouse                  : Logitech. •         Ram                     : 512 Mb. SOFTWARE REQUIREMENTS: •         Operating system           : - Windows XP •         Coding Language           :-  JAVA REFERENCE:                      Guoxing Zhan, Weisong Shi, and Julia Deng, “Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs”, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 2, MARCH/APRIL 2012.

IEEE Java Project - Cut Detection in Wireless Sensor Networks Posted: 27 Dec 2012 10:25 PM PST   ABSTRACT                  A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut”. In this article we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious “electrical potential” of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network.  EXISTING SYSTEM                                       Wireless Multimedia Sensor Networks (WMSNs) has many challenges such as nature of wireless media and multimedia information transmission. Consequently traditional mechanisms for network layers are no longer acceptable or applicable for these networks. Wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut”. Existing cut detection system deployed only for wired networks. Disadvantages 1. Unsuitable for dynamic network reconfiguration. 2. Single path routing approach.  PROPOSED SYSTEM             Wireless sensor networks (WSNs) are a promising technology for monitoring large regions at high spatial and temporal resolution .Failure of a set of nodes will reduce the number of multi-hop paths in the network. Such failures can cause a subset of nodes – that have not failed – to become disconnected from the rest, resulting in a “cut”. Two nodes are said to be disconnected if there is no path between them. We consider the problem of detecting cuts by the nodes of a wireless network. We assume that there is a specially designated node in the network, which we call the source nodeSince a cut may or may not separate a node from the source node, we distinguish between two distinct outcomes of a cut for a particular node. When a node u is disconnected from the source, we say that a DOS (Disconnected from Source) event has occurred for u. When a cut occurs in the network that does not separate a node u from the source node, we say that CCOS (Connected, but a Cut Occurred Somewhere) event has occurred for u. By cut detection we mean (i) detection by each node of a DOS event when it occurs, and (ii) detection of CCOS events by the nodes close to a cut, and the approximate location of the cut. In this article we propose a distributed algorithm to detect cuts, named the Distributed Cut Detection (DCD) algorithm. The algorithm allows each node to detect DOS events and a subset of nodes to detect CCOS events. The algorithm we propose is distributed and asynchronous: it involves only local communication between neighboring nodes, and is robust to temporary communication failure between node pairs The convergence rate of the computation is independent of the size and structure of the network. MODULE DESCRIPTION: DISTRIBUTED CUT DETECTION:                           The algorithm allows each node to detect DOS events and a subset of nodes to detect CCOS events. The algorithm we propose is distributed and asynchronous: it involves only local communication between neighboring nodes, and is robust to temporary communication failure between node pairs. A key component of the DCD algorithm is a distributed iterative computational step through which the nodes compute their (fictitious) electrical potentials. The convergence rate of the computation is independent of the size and structure of the network. CUT:                      Wireless sensor networks (WSNs) are a promising technology for  monitoring large regions at high spatial and temporal resolution. In fact, node failure is expected to be quite common due to the typically limited energy budget of the nodes that are powered by small batteries. Failure of a set of nodes will reduce the number of multi-hop paths in the network. Such failures can cause a subset of nodes – that have not failed – to become disconnected from the rest, resulting in a “cut”. Two nodes are said to be disconnected if there is no path between them.    SOURCE NODE:                      We consider the problem of detecting cuts by the nodes of a wireless network. We assume that there is a specially designated node in the network, which we call the source node. The source node may be a base station that serves as an interface between the network and its users.Since a cut may or may not separate a node from the source node, we distinguish between two distinct outcomes of a cut for a particular node. CCOS   AND   DOS:                     When a node u is disconnected from the source, we say that a DOS (Disconnected frOm Source) event has occurred for u. When a cut occurs in the network that does not separate a node u from the source node, we say that CCOS (Connected, but a Cut Occurred Somewhere) event has occurred for u. By cut detection we mean (i) detection by each node of a DOS event when it occurs, and (ii) detection of CCOS events by the nodes close to a cut, and the approximate location of the cut. NETWORK SEPARATION:                   Failure of a set of nodes will reduce the number of multi-hop paths in the network. Such failures can cause a subset of nodes – that have not failed – to become disconnected from the rest, resulting in a “cut”. Because of cut, some nodes may separated from the network, that results the separated nodes can’t receive the data from the source node.  System Configuration:- H/W System Configuration:-       Processor                    -    Pentium –III Speed                                  -    1.1 Ghz RAM                                    -    256  MB(min) Hard Disk                           -   20 GB Floppy Drive                      -    1.44 MB Key Board                           -    Standard Windows Keyboard Mouse                                 -    Two or Three Button Mouse Monitor                              -    SVGA    S/W System Configuration:- Operating System            :Windows XP Front End                          :   JAVA,RMI, SWING CONCLUSION                                                                                 The DCD algorithm we propose here enables every node of a wireless sensor network to detect DOS (Disconnected frOm Source) events if they occur. Second, it enables a subset of nodes that experience CCOS (Connected, but Cut Occurred Somewhere) events to detect them and estimate the approximate location of the cut in the form of a list of active nodes that lie at the boundary of the cut/hole. The DOS and CCOS events are defined with respect to a specially designated source node. The algorithm is based on ideas from electrical network theory and parallel iterative solution of linear equations. Numerical simulations, as well as experimental evaluation on a real WSN system consisting of micaZ motes, show that the algorithm works effectively with a large classes of graphs of varying size and structure, without requiring changes in the parameters. For certain scenarios, the algorithm is assured to detect connection and disconnection to the source node without error. A key strength of the DCD algorithm is that the convergence rate of the underlying iterative scheme is quite fast and independent of the size and structure of the network, which makes detection using this algorithm quite fast. Application of the DCD algorithm to detect node separation and re-connection to the source in mobile networks is a topic of ongoing research.

Walk IN Interview for Freshers - 2013 By ( Bajaj Capital Limited) Posted: 28 Dec 2012 12:49 PM PST           Walkin Interview from 29th December to 31st December from 11 AM *******Applicants need to go to the venue mentioned or call on the number provided below******* Job Description: Financial Planning Executives 1. Getting regular business from existing set of clients. 2. Acquiring new clients through referrals. 3. Establishing relationships with new clients by regular presentations or discussions. 4. Consistent achievement of monthly targets. 5. Penetration of all products in all clients" portfolios Salary:                  INR 1,00,000 - 6,00,000 P.A Industry:               Banking / Financial Services / Broking Functional Area:  Sales, Retail, Business Development Role Category:    Retail Sales Role:                     Sales/Business Development Manager Keyskills:             freshers sales financial planning mutual funds Relationship managers Desired Candidate Profile Education:(UG - Any Graduate - Any Specialization, Graduation Not Required) AND (PG - Any Postgraduate - Any Specialization, Post Graduation Not Required) AND ( Doctorate - Any Doctorate - Any Specialization, Doctorate Not Required) Company Profile: Bajaj Capital Limited http://www.bajajcapital.com The Bajaj Capital Group is one of India"s premier Investment Advisory and Financial Planning companies. We are also SEBI-approved Category I Merchant Bankers. We offer personalised Investment Advisory and Financial Planning services to individual investors, corporate houses, institutional investors, Non-Resident Indians (NRIs) and High Networth Clients, among others. As one of India s largest distributors of financial products, we offer a wide range of investment products such as mutual funds, life and general insurance, bonds, post office schemes, etc. offered by reputed public and private and government organisations. Contact Details: Recruiter Name:        Amrita Pandya Gupta Contact Company:     Bajaj Capital Limited Address:                      97,bajaj House,5th Floor, Nehru Place NEW DELHI,Delhi,India Telephone:                 91-11-4400044 Walkin Interview from 29th December to 31st December from 11 AM DATE AND VENUE OF INTERVIEW:    From - 28th,29th and 31st December    BAJAJ CAPITAL LTD.    97 Bajaj house    5th floor , Nehru Place   11am - 5pm

Software Trainee Internship for Final Year of B.tech(cs/it)/ MCA 2013 Posted: 28 Dec 2012 12:31 PM PST                                                      MK  Nano Technologies Job Description: candidate specifications Candidates can be in their final year of B.Tech(CS/IT)/ MCA or pass out and should be available from JAN to JUN for such industrial training During this period of training candidate will be provided extensive training on IT solution/ Products covering entire Software Development Cycle Performance will be evaluated continuously and qualified candidate will be offered jobs in development or support latest from 1st July 2013 or earlier. During this period, we will not make any stipend to the candidate but will provide infrastructure facilities at our office at Gurgaon. All Candidates are required to bring their own laptop. We prefer candidates with prior knowledge on Microsoft Shop (Visual Studio & .Net 3.5 or above, HTML, JQuery & CSS) We will not charge anything from candidate in lieu of above training. We will provide requisite Certificate to the candidates on successful training. Salary:                       No Stipend Industry:                    IT-Software / Software Services Functional Area:       IT Software - Application Programming, Maintenance Role Category:         Other Role:                          Trainee Keyskills:                  Software Engineer / Software Programmer/ Software Trainee / Software Developer, software development, senior software engineer Desired Candidate Profile: Education:(UG - B.Tech/B.E. - Computers) OR (PG - MCA - Computers) AND ( Doctorate - Doctorate Not Required) Please refer to the Job description above Company Profile: MK Nano Technologies Pvt Ltd. We are a software company & our team is specialized in designing & creating tools that can improve productivity of individual or Team and works on all platforms (Mobile, Web & Desktop). We can Develop, Migrate & Monitor applications on conventional servers as well as on Cloud. We guarantee superior service & zero downtime to all our clients Contact Details; Recruiter Name:        Neha Sharma Contact Company:     MK Nano Technologies Pvt Ltd Reference Id:             MKN/12/12/1001 For Apply : click here

IEEE Java Project - Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs Posted: 27 Dec 2012 10:36 PM PST Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs ABSTRACT:              The multihop routing in wireless sensor networks (WSNs) offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks, and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TARF provides trustworthy and energy-efficient route. Most importantly, TARF proves effective against those harmful attacks developed out of identity deception; the resilience of TARF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TARF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TARF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism. EXISTING SYSTEM:                         In the existing system, the multihop routing of WSNs often becomes the target of malicious attacks. An attacker may tamper nodes physically, create traffic collision with seemingly valid transmission, drop or misdirect messages in routes, or jam the communication channel by creating radio interference. PROPOSED SYSTEM:                  In the proposed system , to secure the WSNs against adversaries misdirecting the multihop routing, we have designed and implemented TARF, a robust trust-aware routing framework for dynamic WSNs. SYSTEM REQUIREMENTS: HARDWARE REQUIREMENTS: •         System                 : Pentium IV 2.4 GHz. •         Hard Disk            : 40 GB. •         Floppy Drive       : 1.44 Mb. •         Monitor                : 15 VGA Colour. •         Mouse                  : Logitech. •         Ram                     : 512 Mb. SOFTWARE REQUIREMENTS: •         Operating system           : - Windows XP •         Coding Language           :-  JAVA REFERENCE:                      Guoxing Zhan, Weisong Shi, and Julia Deng, “Design and Implementation of TARF: A Trust-Aware Routing Framework for WSNs”, IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 2, MARCH/APRIL 2012.

IEEE Java Project - Cut Detection in Wireless Sensor Networks Posted: 27 Dec 2012 10:25 PM PST   ABSTRACT                  A wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut”. In this article we consider the problem of detecting cuts by the remaining nodes of a wireless sensor network. We propose an algorithm that allows (i) every node to detect when the connectivity to a specially designated node has been lost, and (ii) one or more nodes (that are connected to the special node after the cut) to detect the occurrence of the cut. The algorithm is distributed and asynchronous: every node needs to communicate with only those nodes that are within its communication range. The algorithm is based on the iterative computation of a fictitious “electrical potential” of the nodes. The convergence rate of the underlying iterative scheme is independent of the size and structure of the network.  EXISTING SYSTEM                                       Wireless Multimedia Sensor Networks (WMSNs) has many challenges such as nature of wireless media and multimedia information transmission. Consequently traditional mechanisms for network layers are no longer acceptable or applicable for these networks. Wireless sensor network can get separated into multiple connected components due to the failure of some of its nodes, which is called a “cut”. Existing cut detection system deployed only for wired networks. Disadvantages 1. Unsuitable for dynamic network reconfiguration. 2. Single path routing approach.  PROPOSED SYSTEM             Wireless sensor networks (WSNs) are a promising technology for monitoring large regions at high spatial and temporal resolution .Failure of a set of nodes will reduce the number of multi-hop paths in the network. Such failures can cause a subset of nodes – that have not failed – to become disconnected from the rest, resulting in a “cut”. Two nodes are said to be disconnected if there is no path between them. We consider the problem of detecting cuts by the nodes of a wireless network. We assume that there is a specially designated node in the network, which we call the source nodeSince a cut may or may not separate a node from the source node, we distinguish between two distinct outcomes of a cut for a particular node. When a node u is disconnected from the source, we say that a DOS (Disconnected from Source) event has occurred for u. When a cut occurs in the network that does not separate a node u from the source node, we say that CCOS (Connected, but a Cut Occurred Somewhere) event has occurred for

Union Public Service Commission NDA And NA (II) Exam Result Released On: 29-12-2012

Tamil Nadu Public Service Commission CSSE-II Written Exam Results Released On: 29-12-2012

Calcutta High Court Stenographer/PA Shorthand Test Result Released On: 29-12-2012

Vijaya Bank Probationary Clerks Result Released On: 29-12-2012

Trylogic Soft Solutions Pvt Ltd Android Developer; Posted Date: 29-12-2012

WebHugh Technologies LLP Business Developer Trainee; Posted Date: 29-12-2012

Accenture Services Pvt Ltd Accounts Executive; Posted Date: 29-12-2012

Punjab Urban Planning and development Authority Clerk cum Data Entry Operator-60; Senior Assistant-34; Others-19; Last Date: 18-01-2013

Indian Oil Corporation Limited Junior Engineering Asst-70; Last Date: 04-02-2013

Rajasthan University of Health Sciences Medical Officers-1000; Last Date: 28-01-2013

National Rural Health Mission District Programme Manager-23; District Community Mobilizer-15; Others-62; Last Date: 19-01-2

Dept of Animal Husbandry Dairying and Fisheries Consultant-08; Last Date: 26-01-2013

APPSC Jr Asst Provisional Selected Under PH Category Vaidya Vidhana Parishad Result Released On: 28-12-2012

APPSC Lecturers in Govt Degree Colleges CES Result Released On: 28-12-2012

Rajasthan Public Service Commission Asst Professor Orthopedics Result Released On: 28-12-2012

RRB Ajmer Asst Locopilot Aptitude Test Results Released On: 28-12-2012

Sashastra Seema Bal CT Washermen Technical Trade Test Result Released On: 28-12-2012

Chhattisgarh Public Service Commission District Sub-Collector-33; Deputy Chief Police-15; Others-162; Last Date: 09-02-2013

Central Agricultural Research Institute Programme Assistant-16; Subject Matter Specialist-08; Last Date: 26-01-2013

Khadi and Village Industries Commission Economic Investigators-19; Last Date: 26-01-2013

Chhattisgarh Public Service Commission Asst Director Agriculture-78; Last Date: 29-01-2013

Central Employment Exchange Laboratory Asst-01; Computer Assistant-01; Others-07; Last Date: 31-12-2012

Malabar Cancer Centre Junior Nurse; Radiographer; Lab Technician; Nursing Assistant; Last Date: 05-01-2013

Stratus Info Technologies Web Designer; Posted Date: 28-12-2012

Laraine Solutions RF Engineer; Posted Date: 28-12-2012

Arcus Infotech Mainframe Lab-co ordinator; Posted Date: 28-12-2012

Celebron Solutions tele Callers(Only For Females); Posted Date: 28-12-2012

VES Edutech Software Engineer; Posted Date: 28-12-2012

Prathama Bank Office Assistant-40; Officer Scale-10; Others-40; Last Date: 07-01-2013

Translational Health Science and Technology Institute Senior Program Officer-04; Junior Analyst-03; Others-02; Last Date: 18-02-2013

Doon University Professors-04; Assistant Professor-04 ; Others-09; Last Date: 31-01-2013

A Novel Data Embedding Method Using Adaptive Pixel Pair Matching

ABSTRACT:

This paper proposes a new data-hiding method based on pixel pair matching (PPM). The basic idea of PPM is to use the values of pixel pair as a reference coordinate, and search a coordinate in the neighborhood set of this pixel pair according to a given message digit. The pixel pair is then replaced by the searched coordinate to conceal the digit. Exploiting modification direction (EMD) and diamond encoding (DE) are two data-hiding methods proposed recently based on PPM. The maximum capacity of EMD is 1.161 bpp and DE extends the payload of EMD by embedding digits in a larger notational system. The proposed method offers lower distortion than DE by providing more compact neighborhood sets and allowing embedded digits in any notational system. Compared with the optimal pixel adjustment process (OPAP) method, the proposed method always has lower distortion for various payloads. Experimental results reveal that the proposed method not only provides better performance than those of OPAP and DE, but also is secure under the detection of some well-known steganalysis techniques.

SYSTEM ACHITECTURE:

EXISTING SYSTEM:

The least significant bit substitution method, referred to as LSB in this paper, is a well-known data-hiding method. This method is easy to implement with low CPU cost, and has become one of the popular embedding techniques. However, in LSB embedding, the pixels with even values will be increased by one or kept unmodified. The pixels with odd values will be decreased by one or kept unmodified. Therefore, the imbalanced embedding distortion emerges and is vulnerable to steganalysis.

Optimal pixel adjustment process (OPAP) method to reduce the distortion caused by LSB replacement. In their method, if message bits are embedded into the right-most LSBs of an -bit pixel, other bits are adjusted by a simple evaluation. Namely, if the adjusted result offers a smaller distortion, these bits are either replaced by the adjusted result or otherwise kept unmodified.

Exploiting modification direction (EMD) and diamond encoding (DE) are two data-hiding methods proposed recently based on PPM

DISADVANTAGES OF EXISTING SYSTEM:

·        Imbalanced embedding distortion emerges and is vulnerable to steganalysis.

·        The existing technique can be easily cracked.

PROPOSED SYSTEM:

The basic idea of PPM is to use the values of pixel pair as a reference coordinate, and search a coordinate in the neighborhood set of this pixel pair according to a given message digit. The pixel pair is then replaced by the searched coordinate to conceal the digit.

This paper proposes a new data embedding method to reduce the embedding impact by providing a simple extraction function and a more compact neighborhood set. The proposed method embeds more messages per modification and thus increases the embedding efficiency. The image quality obtained by the proposed method not only performs better than those obtained by OPAP and DE, but also brings higher payload with less detect ability. Moreover, the best notational system for data concealing can be determined and employed in this new method according to the given payload so that a lower image distortion can be achieved.

ADVANTAGES OF PROPOSED SYSTEM:

The proposed method offers lower distortion than DE by providing more compact neighborhood sets and allowing embedded digits in any notational system. Compared with the optimal pixel adjustment process (OPAP) method, the proposed method always has lower distortion for various payloads. Experimental results reveal that the proposed method not only provides better performance than those of OPAP and DE, but also is secure under the detection of some well-known steganalysis techniques.

MODULES:

·        Extraction Function and Neighborhood Set

·        Embedding Procedure

·        Extraction Procedure

·        Statistical Analysis of the Histogram Differences

MODULES DESCRIPTION:

Extraction Function and Neighborhood Set

In this module we perform the action of extraction function and neighborhood set. Where the system does a new data embedding method to reduce the embedding impact by providing a simple extraction function and a more compact neighborhood set. The proposed method embeds more messages per modification and thus increases the embedding efficiency. The image quality obtained by the proposed method not only performs better than those obtained by OPAP and DE, but also brings higher payload with less detectability. Moreover, the best notational system for data concealing can be determined and employed in this new method according to the given payload so that a lower image distortion can be achieved.

Embedding Procedure

Input: Cover image of size , secret bit stream, and key .

Output: Stego image , , , and .

1. Find the minimum satisfying, and convert into a list of digits with a -ary notational system.

2. Solve the discrete optimization problem to find and.

3. In the region defined by, record the coordinate such that , .

4. Construct a no repeat random embedding sequence using a key .

5. To embed a message digit, two pixels in the cover image are selected according to the embedding sequence, and calculate the modulus distance between and , then replace with .

6. Repeat Step 5 until all the message digits are embedded.

Extraction Procedure

To extract the embedded message digits, pixel pairs are scanned in the same order as in the embedding procedure. The embedded message digits are the values of extraction function of the scanned pixel pairs.

Input: Stego image, , , and .

Output: Secret bit stream.

1. Construct the embedding sequence using the key.

2. Select two pixels according to the embedding sequence.

3. Calculate, the result is the embedded digit.

4. Repeat Steps 2 and 3 until all the message digits are extracted.

5. Finally, the message bits can be obtained by converting the extracted message digits into a binary bit stream.

Statistical Analysis of the Histogram Differences

In this module, we perform the goal of system analysis by using histogram technique. The goal of steganography is to evade statistical detection. It is apparent that MSE is not a good measure of security against the detection of steganalysis. Histograms are used to plot density of data, and often for density estimation: estimating the probability density function of the underlying variable. The total area of a histogram used for probability density is always normalized to 1. If the lengths of the intervals on the x-axis are all 1, then a histogram is identical to a relative frequency plot.

 

HARDWARE REQUIREMENTS

•                     SYSTEM             : Pentium IV 2.4 GHz

•                     HARD DISK        : 40 GB

•                     MONITOR           : 15 VGA colour

•                     MOUSE               : Logitech.

•                     RAM                    : 256 MB

•                     KEYBOARD       : 110 keys enhanced.

SOFTWARE REQUIREMENTS

•                     Operating system           :         Windows XP Professional

•                     Front End             :         JAVA

•                     Tool                    :         NETBEANS IDE

REFERENCE:

Wien Hong and Tung-Shou Chen, “A Novel Data Embedding Method Using Adaptive Pixel Pair Matching” , IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, VOL. 7, NO. 1, FEBRUARY 2012.

JNTUK : Revaluation / Recounting Results for B.Tech (NR,OR,RR) Supple Exams June-2012 JNTU-KAKINADA : Revaluation / Recounting Results for B.Tech (NR,OR,RR) Supple Exams June-2012  Download: Click Here View : Click Here This posting includes an audio/video/photo media file: Download Now

Jobs as Human Resource Executive - MBA Freshers Ajax Management Consultants (P) Ltd hiring for hr15@ajaxmanagements.com in Bengaluru/Bangalore, Chennai, Erode, Hosur, Tuticorin, Thanjavur, Vellore, Trichy, Mangalor Job Description Taking Care of Joining formalities of the Employees , Co-ordination with the new jonnies of the internal employee ,Issuing the Offer Letter and explain the salary details , Employee Relationship , Handling Exit Interview ,PMS System Salary:INR 1,00,000 - 2,25,000 P.A. Best In Industry Industry:Fresher / Trainee / Entry Level Functional Area:HR, Recruitment, Administration, IR Role Category:HR/ Recruitment / IR Role:HR Executive Keyskills:HR executive/ Payroll / HR Manager / HR Recruiter / HR Generalist / Recruitment Executive / Sr. HR Executive/ Assistant HR Manager/ HR Head / ER/ Admin Executive / Compensation & Benefits / MBA Fresher / IR / Recruitment Mgr / Training /Personnel Desired Candidate Profile Education:(UG - Graduation Not Required) AND (PG - MBA/PGDM - Any Specialization, Systems, International Business, Finance, HR/Industrial Relations) AND ( Doctorate - Doctorate Not Required)                          Email your resume to              hr15@ajaxmanagements.com Company Profile   Ajax Management Consultants (P) Ltd http://www.ajaxmanagements.com In top leading MNC Contact Details Recruiter Name:Dinesh(hr15@ajaxmanagements.com) Contact Company:Ajax Management Consultants (P) Ltd Telephone:8123520593 For apply : click here

Jobs for C++ Fresher/ Trainee  I-Next Placements in Bengaluru/Bangalore, Chennai, Hyderabad / Secunderabad, Pune, Mumbai, Delhi/NCR Job Description: 1. Required B.E ,B.Tech ,Diploma Engineers from Computer Science & IT, Electronics, Instrumentation, Electrical, Mechanical, Civil, Chemical. 2. Salary best in the industry. (No Consultancy Fees) For Details Visit:-                               www.inextplacements.com Salary:INR 1,00,000 - 6,00,000 P.A. Its negotiable for the right candidate. Industry:Fresher / Trainee / Entry Level Functional Area:IT Software - Telecom Software Role Category:Other Role:Fresher Keyskills:fresher, trainee, engineers, programmer, software programmer developer, IT, Mechanical, Electrical, Chemical, Civil, Electronics, Instrumentation, B.Tech, B.E, Diploma Desired Candidate Profile Education:(UG - Any Graduate - Any Specialization, Graduation Not Required) AND (PG - Any Postgraduate - Any Specialization, Post Graduation Not Required) AND ( Doctorate - Any Doctorate - Any Specialization, Doctorate Not Required) 1. Freshers needs to apply immediately. 2. Candidates who are pursuing their courses can also apply. 3. Posting- Bangalore, Chennai, Noida, New Delhi, Mumbai, Gurgaon, Hyderabad, Kolkata. Company Profile I-Next Placements http://www.inextplacements.com I- Next Placements is an India Based Recruitment Firm Dedicated in providing employment solutions throughout India & Abroad. (No Consultancy Fees, No Hidden Charges) Contact Details Recruiter Name:Swati Singh Contact Company:I-Next Placements For apply: click here

IEEE Java Project - A Novel Data Embedding Method Using Adaptive Pixel Pair Matching