Category: Java Based Projects

Download All Java Projects (J2EE, JDBC, Servlets, JavaScript, JSP), Java Presentations and PPT’s,Final year Java projects,CSE Java Projects. Information technology third year and final year students can download Java Based Projects for final year students, Java Based Projects topics and list of projects with source code and reports for free download.

Posted on

Stock Maintenance and Billing System of Stationary Shoppe

ACKNOWLEDGEMENT:

It is always difficult task to acknowledge all those who have been tremendous help in academic project of this nature. Never the less we have made on an attempt through this report to express our deepest gratitude to all those who have contributed to making of this project either directly or indirectly.

We would like to express our gratitude to all who have contributed to the successful accomplishment of our project. At the outset we take the opportunity to express our heartiest gratitude and thanks to our Head of the Department and our project guide  who has extended technical guidance on every stage of the project and helped us to keep the work on right track.

We also thanks for making the lab available whenever needed and valuable suggestions and tips insight towards this direction. Also thanks to Mr. Ramesh for giving the information about their shop and computerized system.

Stock Maintanance And Billing System

Problems in the existing system:

  • There is no proper maintenance of records of every transaction and there details.
  • The system is every time consuming.
  • Manual system needs manpower to keep the record needed for the system.
  • It has more prone to failure than computerized due to on error.
  • There is high risk of data inaccuracy and error due to manual handling of the system.
  • To analyze the reports manually is very tedious task.

Solution through proposed system:

It is concluded that our project helps to solve the most of the problems in the existing system.

  • It reduces the manual work partially.
  • Save time and money used for whole process.
  • The project is user friendly so it can be handled by user by giving them some proper training.
  • It is feasible for transactions by all means.
  • No proper work required.
  • Easy for report analysis because the generated reports are updated and helpful in making decision making strategy.

Stock Maintanance And Billing System ER Diagram

 

Technical   Feasibility:

  • Proposed system is to be developed using java an window XP operating system, window-98 is also preferable.
  • Front end – Java
  • Back end – MS-Access for development of system.

Operational Feasibility:

  • Operational performed by system is user friendly.
  • By giving small demo or training to employee can handle it efficiently

Economical  Feasibility:

  • Developing cost of proposed system is less.
  • System requires computer system with specified minimum requirement.
  • System have benefits are high & cost is less.

HARDWARE REQUIREMENT:

  • RAM 128MB & above
  • Hard disk -20 GB & above

SOFTWARE REQUIREMENT:

  • Developing software:   Java Developer 1.6  environment, MS-Access.
  • Operating system:  Windows 98 / 2000 / XP and above.
Posted on

Payroll Management System Java Project

Importance of payroll:-

Employee’s moral is affected by payroll administration and employee is the main resource of any organization.

Employees should be paid sufficiently to motivate employees.

Scope 

The payroll system has the following scope.

1) Defining the salary structure of an employee.

2) Acceptance of attendance of employees.

3) Defining the leave structure of an employee.

4) Identify employee type & designation.

5) Calculating Gross income, deductions & finally Net Income of an employee.

6] Providing salary details to employees.

7) Generation of reports.

Existing System 

Working of an existing manual payroll system is as follows:

  1. Salary structure and leave structure are obtained by the payroll department from the HR department.
  2. Attendance record in form of musters is also obtained from the attendance monitoring system.
  3. All the employees are identified manually, and records from musters are checked to identify employee types. After identifying the employee type depending on his/her designation Net salary and gross salary are calculated. if any deductions are there then those are also deducted. Payslip is generated by considering their payable days depending on the records obtained from the attendance monitoring system, salary structure, and leave structure.
  4. Reports are generated, reports like the total amount given in form of salaries.
  5. Monthly reports and yearly reports are also generated. These reports are then transferred to Management.
  6. All these calculations are done manually by the payroll department staff.

Payroll Management System Home Page

Limitation of the existing system:

1)   For identifying the employee type Existing manual method takes time as it uses musters to check the records.

2)   Net income, gross income, and all the necessary deductions are done manually in the existing system, which may cause errors in calculations.

3)   All the employee details are maintained in Musters, which involves a lot of redundancy and also it takes a lot of time in order to back up the whole employee details, which physically is not much feasible.

4)   Generation of pay slips is done manually by pay role employees. Which is a time-consuming process.

5)   All the reports, are also developed by payroll employees manually.

All these tasks are time-consuming and can involve errors due to a lot of human interface.

User Environment:

The development environment of the system is client-server.

  1. Client-side requirements.
  1. Server-side requirements 

Client-side requirements:- 

minimum Hardware requirements:- 

  • It requires a minimum of 512 MB ram.
  • 10 GB of memory to store the data of customers.
  • It requires a monitor i.e L.C.D or desktop.
  • It supports to the keyboard of 120  keys(only English)
  • It requires an optical mouse.

software requirements:- 

  • Front end:- it requires JVM (Java Virtual Machine).
  • It supports Microsoft related operating
  • Related drivers as specified in the hardware

Software requirements:-

  • It requires jdk1.6.0
  • MYSQL to maintain the database.

Network connectivity requirement:-

Star topology:- it requires a hub. fiber optic cable in order to connect clients to the server.

Payroll Management System in jsp

Test Case for Payroll Management System:

Test Case ID Input Description Expected Result Actualresult
 1 User name=e1000

Enter the user name with the help of the i/p interface1)Enter the username

2)Enter a valid password

3)Press Login

 The system should accept the behavior. The system will display the Home page.  
 2 User name=”

Enter user name with the help of  i/p interface1)Enter a valid password

2)Press Login

 The system will display an error message.  
 3 User name=employee

Enter user name with the help of  i/p interface1)Enter the username

2)Enter a valid password

3)Press Login

 The system should accept the behavior. The system will display the Home page.  
 4 Password=” invalid”

Enter user name with the help of  i/p interface1)Enter the username

2)Press Login

 The system will display an error message.  
 5 User name=#$kiran

Enter user name1)Enter a user name

2)Password

3)Press Login

 The system will display an error messages will be navigated to same page  
      6 Enter Employee Id=e1000

Enter Employee Id with the help of i/p interface1)Enter Employee Id

2)Press Submit

 The system should generate a new password & send to valid employee’s mobile no  
7       Enter Employee Id=*&kiran%

Enter Employee Id with the help of i/p interface1)Enter Employee Id

2)Press Submit

 The system should not generate a new password& display an Invalid employee id message  
8 Enter Employee Id=e1000 If the user selected forgot password link  & entered the Employee ID  The system should send the existing user password to the user via mobile  
     9 Click on Paygrade Button If the manager clicks on paygrade button the system should display available paygrade in the system  
    10 Click on Edit Button If the manager click on the paygrade tabs Edit button the system should allow the manager to edit fields in the paygrade table  
   11 Click on Save Button If the manager click on the paygrade tabs Save button the system should save details changed by the manager  
   12 Click on Earning Button If the manager click on Earning button the system should display available Earning in the system  
    13 Click on Edit Button If the manager click on the paygrade tabs Edit button the system should allow the manager to edit fields in the paygrade table  
    14 Click on Save Button If the manager click on the paygrade tabs Save button the system should save details changed by the manager  
    15 Click on Deduction Button If the manager clicks on Deduction Button the system should display available Deductions in the system  
    16 Click on the Leave structure Button If manager click on Leave structure  Button the system should display available Leave structures in system  
    17 Click on Employee Details Button If the manager click on Employee Details Button system should display available Employee Details  in the system  
    18 Click on Reports Button If the manager click Reports Button the system should display Reports  to the manager  
     19 Click on Generate payslip Button If the Payroll Accountant clicks Generate payslip Button the system should  display the search employee form to payroll Accountant  
    20 Click on Submit Button If the Payroll Accountant click Generate payslip’s Submit  Button the system should  display employee details of the corresponding employee id  
    21 Click on Generate Button If Payroll Accountant click Generate payslip generate  Button the system should  display the employee salary slip of that employee  

 

Test Plan of Payroll Management System

General Information:

Summary:

We are testing the software of a Payroll Management System which maintains the information on the salary of every employee of the whole organization & generates payslips of employees.

Environment and Pre-Test Background:

This software is being tested in the Sibar-Mca Computer lab by Mca 2nd year.

No prior testing has been done on this project.

Test Objective:

Authentication & Authorization.

View Employee Details.

Employee Performance Appraisal

Generates Payslips

Report Generation.

Modify Leave & salary structure

Plan

Software Description:

Sr no: Process Input Output
1 Change Paygrade Details Click on the Edit Button of Paygrade Updates DatabasePrompt message to a user for completion
2 Change Leave Structure Details Click on the Edit Button of Leave Structure Updates DatabasePrompt message to a user for completion
3 Change Earnings Details Click on the Edit Button of Earnings Updates DatabasePrompt message to a user for completion
4 Change Deductions Details Click on the Edit Button of Deductions Updates DatabasePrompt message to a user for completion
5 Payslip Generation  Employee Id Printed payslip

Test Team:

The test team will have the following members:

Tester:

The tester will perform the actual testing.

Business Expert:

Business Experts are those people who have knowledge about the business domain.

Test-Team Manager:

Test-Team Manager will be monitoring the whole testing process.

User:

The user is the End user who will be actually dealing with the software.

Requirement:

Computer with Eclipse any version  Apache tomcat  Java 1.6.0 and MYSQL Software installed on it.

We will require a Software requirement Specification document as well as Vision Document.

Specifications & Evaluations: 

Salary Structure Details:

This will help the Organization to keep information on the salary structures of each employee and will provide facilities to access it.

Leave Structure Details:

This will help the Organization to keep information on the Leave structures of each employee and will provide facilities to access it…

Report Generation 

This will generate various reports demanded by the organization to keep an eye on growth of their organization, working of staff etc

Structural Functions:

Give Specifications:

User will have to register for that Application form will be provided.

After Registration, the User will have a Password. 

Employee Information:

Depending upon the pay grade employee will be classified as either a payroll employee or payroll manager. If the user is a payroll manager of the Organization then we will provide him with facilities to Add, Edit as well as Delete payroll Details.

Payroll employees will be provided with a search option to search particular employees for the generation of his/her payslip.

Report Generation:

The user will be provided with a list of Reports using which he can generate reports by clicking on that options

The user will be provided an interface where he needs to give dates of which report has to be generated.

According to the Report, the user will need to give details on basis of that detail report will be generated.

 Functional Requirements:

Sr no Functions Tests
1 Give Specification

UsabilityCorrectness

Reliability

Security

Performance

Maintainability

Visibility
2 Report Generation

SecurityReliability

Correctness

Understandability

Visibility

Methods & Constraints:

Methodology:

We will be using White box testing for testing the project of payroll management. 

Evaluation:

Sr no Objective Priorities Completeness Criteria
1 Adding Data High The system should Add data to the database. It should also prompt acknowledgment to the user.
2 Updating data High

The system should update the old data with newly updated data. The system should check the authentication of the user and then make changes to the database.

It should prompt a message to the user about updating.
3 Deleting data High

The system should Remove the data demanded by the user from the database. It should check the authentication of the user before deleting the record.

It should also confirm that a message is prompted to the user about deletion confirmation.
4 Searching data High The system should retrieve data from the database when the search option has been clicked. If data is not found relevant to user demand, a message should be displayed to the user about data not present.
5 Report Generation High After selecting a particular report, Data related to that report should be properly retrieved from the database in a proper format.

Download Payroll Management System Java Project.

Posted on

B.Tech 2014-2015 Java & .Net Projects in Bulk

B.Tech JAVA Projects -2014-2015 (Selected Projects)

  1. Key – Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage
  2. Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds
  3. A Hybrid Cloud Approach for Secure Authorized Deduplication
  4. Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud
  5. Accuracy Constrained Privacy-Preserving Access Control Mechanism for Relational Data
  6. Supporting Privacy Protection in Personalized Web Search
  7. Security Evaluation of Pattern Classifiers under Attack
  8. Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks
  9. Efficient Authentication for Mobile and Pervasive Computing
  10. Friend book: A Semantic-based Friend Recommendation System for Social Networks
  11. Secure and Efficient Data Transmission for Cluster-based Wireless Sensor Networks
  12. Secure Continuous Aggregation in Wireless Sensor Networks
  13. Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks
  14. Cost-Effective Resource Allocation of Overlay Routing Relay Nodes
  15. Securing Broker Less Publish Subscribe Systems Using Identity-Based Encryption
  16. Automatic Test Packet Generation
  17. A System for Denial-of-Ser vice Attack Detection Based on Multivar iate Correlation Analysis
  18. Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
  19. Trajectory Improves Data Delivery in Urban Vehicular Networks
  20. Click Prediction for Web Image Reranking Using Multimodal Sparse Coding
  21. Captcha as Graphical Passwords-A New Security Primitive Based on Hard AI Problems
  22. Privacy-Enhanced Web Service Composition
  23. Secure Data Aggregation in Wireless Sensor Networks Filtering out the Attacker’s Impact
  24. Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
  25. CLOUDQUAL A Quality Model for Cloud Services
  26. Multi-Core Embedded Wireless Sensor Networks Architecture and Applications
  27. Cross-Layer Approach for Minimizing Routing Disruption in IP Networks
  28. Multicast Capacity in MANET with Infrastructure Support
  29. Efficient Data Collection for Large-Scale Mobile Monitoring Applications
  30. Hop-by-Hop Message Authenticationand Source Privacy in WirelessSensor Networks
  31. Joint Topology-Transparent Scheduling and QoS Routing in Ad Hoc Networks
  32. Quality of Service Provision in Cloud-based Storage System for Multimedia Delivery
  33. Distributed Mobile Sink Routing for Wireless Sensor Networks A Survey
  34. The Design and Evaluation of An Information Sharing System for Human Networks
  35. Web Service Recommendation via Exploiting Location and QoS Information
  36. Congestion Aware Routing in Nonlinear Elastic Optical Networks
  37. Leveraging Social Networks for P2P Content based File Sharing in Disconnected MANETs
  38. Scalable Distributed Service Integrity Attestation for Software-as-a-Service Clouds
  39. Energy Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks
  40. Building Confidential And Efficient Query Services In The Cloud With RASP Data
  41. An Empirical Performance Evaluation of Relational Keyword Search Systems
  42. ITA Innocuous Topology Awareness
  43. Cloning, Resource Exchange, and Relation Adaptation: An Integrative Self-Organization Mechanism in a Distributed Agent Network.

.NET Projects- 2014-15 ( Selected Projects)

  1. Optimized multicast routing algorithm based on tree structure in MANETs
  2. Security Analysis of Handover Key Management in 4G LTESAE Networks
  3. Fast and Secure Multihop Broadcast Solutions for Intervehicular Communication
  4. Key Aggregate Cryptosystem For Scalable Data Sharing In Cloud Storage
  5. An Empirical Performance Evaluation of Relational Keyword Search Systems
  6. Supporting Privacy Protection in Personalized Web Search
  7. Building Confidential And Efficient Query Services In The Cloud With RASP Data

 

DATA MINING – JAVA

  1. Facilitating Document Annotation Using Content and Querying Value
  2. An Empirical Performance Evaluation of Relational Keyword Search Techniques
  3. Set Predicates in SQL: Enabling Set-Level Comparisons for Dynamically Formed Groups
  4. Keyword Query Routing
  5. Supporting Privacy Protection in Personalized Web Search
  6. Product Aspect Ranking and Its Applications
  7. Interpreting the Public Sentiment Variations on Twitter
  8. Infrequent Weighted Itemset Mining Using Frequent Pattern Growth
  9. An Efficient Certificate less Encryption for Secure Data Sharing in Public Clouds

Data Mining – .NET

  1. A Group Incremental Approach to Feature Selection Applying Rough Set Technique
  2. Rough Sets, Kernel Set, and Spatiotemporal Outlier Detection
  3. Consensus-Based Ranking of Multivalued Objects: A Generalized Borda Count  Approach
  4. Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation
  5. Fast nearest Neighbor Search with Keywords
  6. Efficient Prediction of Difficult Keyword Queries over Databases
  7. Web Service Recommendation via Exploiting Location and QoS Information (Data Mining with Networking)
  8. Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data (Data Mining with Network Security)

NETWORKING – JAVA

  1. Enabling Trustworthy Service Evaluation in Service-Oriented Mobile Social Networks
  2. A Tag Encoding Scheme against Pollution Attack to Linear Network Coding
  3. Exploiting Service Similarity for Privacy in Location-Based Search Queries
  4. Network Coding Aware Cooperative MAC Protocol for Wireless Ad Hoc Networks
  5. A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks
  6. A System for Denial-of-Service Attack Detection Based on Multivariate Correlation Analysis
  7. Behavioral Malware Detection in Delay Tolerant Networks
  8. PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System
  9. Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks

NETWORKING – .NET

  1. LocaWard: A Security and Privacy Aware Location-Based Rewarding System
  2. Power Cost Reduction in Distributed Data Centers: A Two-Time-Scale Approach for Delay Tolerant Workloads
  3. Secure and Efficient Data Transmission for Cluster-Based Wireless Sensor Networks (Networking)
  4. Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption

CLOUD COMPUTING – JAVA

  1. Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds
  2. Modeling of Distributed File Systems for Practical Performance Analysis
  3. A Scalable Two-Phase Top-Down Specialization Approach for Data Anonymization Using MapReduce on Cloud
  4. A Hybrid Cloud Approach for Secure Authorized Deduplication
  5. Balancing Performance, Accuracy, and Precision for Secure Cloud Transactions
  6. Secure Deduplication with Efficient and Reliable Convergent Key Management
  7. Transformation-Based Monetary Cost Optimizations for Workflows in the Cloud
  8. Privacy Preserving Back-Propagation Neural Network Learning Made Practical with Cloud Computing
  9. Application-Aware Local-Global Source Deduplication for Cloud Backup Services of Personal Storage (Cloud Java)

Cloud Computing – .NET

  1. A Novel Economic Sharing Model in a Federation of Selfish Cloud Providers
  2. A UCONABC Resilient Authorization Evaluation for Cloud Computing
  3. Distributed, Concurrent, and Independent Access to Encrypted Cloud Databases
  4. Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage
  5. Scalable Distributed Service Integrity Attestation for Software-as-a-Service Clouds
  6. Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud
  7. Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud Storage
  8. Shared Authority Based Privacy-preserving Authentication Protocol in Cloud Computing

Mobile Computing – JAVA

  1. Preserving Location Privacy in Geosocial Applications
  2. A QoS-Oriented Distributed Routing Protocol for Hybrid Wireless Networks
  3. Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks
  4. Cooperative Spectrum Sharing: A Contract-Based Approach

Dependable and Secure Computing  (Network Security) – JAVA

  1. Secure Two-Party Differentially Private Data Release for Vertically Partitioned Data
  2. Bandwidth Distributed Denial of Service: Attacks and Defenses (Dependable and secure computing
  3. k-Zero Day Safety: A Network Security Metric for Measuring the Risk of Unknown Vulnerabilities
  4. On the Security of Trustee-Based Social Authentications
  5. Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices

Image Processing – JAVA

  1. Vector-Valued Image Processing by Parallel Level Sets
  2. Accelerated Learning-Based Interactive Image Segmentation Using Pairwise Constraints
  3. Large Discriminative Structured Set Prediction Modeling With Max-Margin Markov Network for Lossless Image Coding
  4. Image Reconstruction from Double Random Projection
  5. Saliency-Aware Video Compression
  6. Translation Invariant Directional Framelet Transform Combined With Gabor Filters for Image Denoising

S. No

All Project Titles

 Year
Cloud Computing  
1 Oruta: Privacy-Preserving Public Auditing for Shared Data in the Cloud 2014
2 NCCloud: A Network Coding Based Storage System in a Cloud-of-Clouds 2014
3 Enabling Data Integrity Protection in Regenerating-Coding-Based Cloud Storage: Theory and Implementation 2014
4 Key-Aggregate Cryptosystem for Scalable Data Sharing in Cloud Storage 2014
5 Privacy Preserving Multi keyword Ranked Search over Encrypted Cloud Data 2014
6 Decentralized Access Control with Anonymous Authentication of Data Stored in Clouds 2014
7 Building Confidential and Efficient Query Services in the Cloud with RASP Data Perturbation 2014
8 Panda: Public Auditing for Shared Data with Efficient User Revocation in the Cloud. 2014
9 Innovative Schemes for Resource Allocation in the Cloud for Media Streaming Applications 2014
10 Cloud Assisted Mobile Access of Health Data With Privacy and Audit ability 2014
11 Shared Authority Based Privacy-preserving Authentication Protocol in Cloud Computing 2014
12 Optimal Power Allocation and Load Distribution for Multiple Heterogeneous Multi core Server Processors across Clouds and Data Centers 2014
13 PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System 2014
14 A Stochastic Model to Investigate Data Center Performance and QoS in IaaS Cloud Computing Systems 2014
15 Towards Differential Query Services in Cost Efficient Clouds 2014
16 An Efficient and Trustworthy Resource Sharing Platform for Collaborative Cloud Computing 2014
17 A Hybrid Cloud Approach for Secure Authorized De duplication 2014
18 Distributed, Concurrent, and Independent Access to Encrypted Cloud Databases 2014
19 On the Knowledge Soundness of a Cooperative Provable Data Possession Scheme in Multi cloud Storage 2014
20 Identity Based Distributed Provable Data Possession in Multi-Cloud Storage 2014
21 Consistency as a Service Auditing :Cloud Consistency 2014
22 A Social Compute Cloud: Allocating and Sharing Infrastructure Resources via Social Networks 2014
23 Scalable Distributed Service Integrity Attestation for Software-as-a-Service Clouds. 2014
24 Expressive, Efficient, and Revocable Data Access Control for Multi-Authority Cloud Storage 2014
25 Secure kNN Query Processing in Un trusted Cloud Environments 2014
26 A Mechanism Design Approach to Resource Procurement in Cloud Computing 2014
27 A Secure Client Side De duplication Scheme in Cloud Storage Environments 2014
28 Balancing Performance Accuracy and Precision for Secure Cloud Transactions 2014
29 Performance and cost evaluation of an adaptive encryption architecture for cloud databases 2014
30 Securing the cloud storage audit service: defending against frame and collude attacks of third party auditor 2014
   
  Network Security  
     
1  Behavioral Malware Detection in Delay Tolerant Networks 2014
2 A System for Denial-of-Service Attack Detection Based on Multivariate Correlation Analysis 2014
3 Secure Deduplication with Efficient and Reliable Convergent Key Management 2014
4 Building a Scalable System for Stealthy P2P-Botnet Detection 2014
5 An Error Minimizing Framework for Localizing Jammers in Wireless Networks 2014
6 Securing Broker Less Publish Subscribe Systems Using Identity-Based Encryption 2014
7 Bandwidth Distributed Denial of Service: Attacks and Defenses 2014
8 E-MACs: Toward More Secure and More Efficient Constructions of Secure Channels. 2014
9 Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks 2014
10 Captcha as Graphical Passwords—A New Security Primitive Based on Hard AI Problems 2014
11 Efficient and Privacy-Aware Data Aggregation in Mobile Sensing 2014
12 PROFILR: Toward Preserving Privacy and Functionality in Geo Social Networks Nodes 2014
13 Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices 2014
   
  Ad hoc Networks & VANET & MANET
   
1 Optimal Multicast Capacity and Delay Tradeoffs in MANETs 2014
2 STARS: A Statistical Traffic Pattern Discovery System for MANETs 2014
3 Trajectory Improves Data Delivery in Urban Vehicular Networks 2014
4 Energy Efficient Reliable Routing Considering Residual Energy in Wireless Ad Hoc Networks 2014
5 VSPN: VANET-Based Secure and Privacy-Preserving Navigation 2014
6 Efficient Data Query in Intermittently-Connected Mobile Ad Hoc Social Networks 2014
7 Multicast Capacity in MANET with Infrastructure Support 2014
8 Leveraging Social Networks for P2P Content-Based File Sharing in Disconnected MANETs 2014
9 AASR: An Authenticated Anonymous Secure Routing Protocol for MANETs in Adversarial Environment 2014
10 PSR: A Lightweight Proactive Source Routing Protocol For Mobile Ad Hoc Networks 2014
11 Defending Against Collaborative Attacks by Malicious Nodes in MANETs: A Cooperative Bait Detection Approach 2014
12 Message Authentication Using Proxy Vehicles in Vehicular Ad Hoc Networks 2014
13 Optimized Multicast Routing Algorithm Based on Tree Structure in MANETs 2014
 
  Mobile Computing
 
1 Efficient and Privacy-Aware Data Aggregation in Mobile Sensing 2014
2 Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks 2014
3 A QoS-Oriented Distributed Routing Protocol for Hybrid Wireless Networks 2014
4 Efficient Authentication for Mobile and Pervasive Computing 2014
5 Friend book: A Semantic-based Friend Recommendation System for Social Networks 2014
6 Preserving Location Privacy in Geo Social Applications 2014
7 Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices 2014
8 Video Dissemination over Hybrid Cellular and Ad Hoc Networks 2014
 
  Wireless Sensor Networks
   
1 Secure and Efficient Data Transmission for Cluster-based Wireless Sensor Networks 2014
2 An Error Minimizing Framework for Localizing Jammers in Wireless Networks 2014
3 A Survey of Intrusion Detection Systems in Wireless Sensor Networks 2014
4 QoS Aware Geographic Opportunistic Routing in Wireless Sensor Networks 2014
5 Link Quality Aware Code Dissemination in Wireless Sensor Networks 2014
6 Hop-by-Hop Message Authentication and Source Privacy in Wireless Sensor Networks 2014
7 ALBAR Load-Balancing Geographic Routing Around Connectivity Holes in Wireless Sensor Networks 2014
8 Secure Continuous Aggregation in Wireless Sensor Networks 2014
9 Snapshot and Continuous Data Collection in Probabilistic Wireless Sensor Networks. 2014
10 Top-k Query Result Completeness Verification in Tiered Sensor Networks 2014
11 Transmission-Efficient Clustering Method for Wireless Sensor Networks Using Compressive Sensing 2014
12 Data Density Correlation Degree Clustering Method for Data Aggregation in WSN 2014
13 An Energy-Balanced Routing Method Based on Forward-Aware Factor for Wireless Sensor Networks 2014
14 Constructing Load-Balanced Data Aggregation Trees in Probabilistic Wireless Sensor Networks 2014
15  Secure Data Aggregation in Wireless Sensor Networks: Filtering out the Attacker’s Impact 2014
     
  Android Projects  
     
1 Friend book: A Semantic-based Friend Recommendation System for Social Networks 2014
2 Innovative Schemes for Resource Allocation in the Cloud for Media Streaming Applications 2014
3 Privacy-Preserving Optimal Meeting Location Determination on Mobile Devices 2014
4 Efficient Authentication for Mobile and Pervasive Computing 2014
5 Smart DC Mobility Prediction-based Adaptive Duty Cycling for Everyday Location Monitoring 2014
6 LocaWard A Security and Privacy Aware Location-Based Rewarding System 2014
7 Enabling Trustworthy Service Evaluation in Service-Oriented Mobile Social Networks 2014
8 Discovering Emerging Topics in Social Streams via Link-Anomaly 2014
9 Cooperative Positioning and Tracking in Disruption Tolerant Networks 2014
10 MOSES: Supporting and Enforcing Security Profiles on Smart phones 2014
11 Certificateless Remote Anonymous Authentication Schemes for Wireless Body Area Networks 2014
12 SOS A Distributed Mobile Q&A System Based on Social Networks 2014
13 A Real-Time Adaptive Algorithm for Video Streaming over Multiple Wireless Access Networks 2014
14 Improving Fairness, Efficiency, and Stability in HTTP-Based Adaptive Video Streaming With Festive 2014
16 Android College Campus 2014
 
  Data Mining  
     
1 Fast Nearest Neighbor Search with Keywords 2014
2 An Empirical Performance Evaluation of Relational Keyword Search Systems 2014
3 Facilitating Document Annotation using Content and Querying Value 2014
4 Supporting Privacy Protection in Personalized Web Search 2014
5 Secure Mining of Association Rules in Horizontally Distributed Databases 2014
6 Efficient Ranking on Entity Graphs with Personalized Relationships 2014
7 SOS: A Distributed Mobile Q&A System Based on Social Networks 2014
8 Privacy-Preserving and Content-Protecting Location Based Queries 2014
9 Discovering Emerging Topics in Social Streams via Link-Anomaly 2014
10 Security Evaluation of Pattern Classifiers under Attack 2014
11 LARS An Efficient and Scalable Location-Aware Recommender System 2014
12 Privacy-Preserving Authenticated Key-Exchange Over Internet. 2014
13 Accuracy Constrained Privacy-Preserving Access Control Mechanism for Relational Data 2014
14 Efficient Instant-Fuzzy Search with Proximity Ranking 2014
15 Efficient Prediction of Difficult Keyword Queries over Databases 2014
16 Temporal Workload-Aware Replicated Partitioning for Social Networks 2014
17 Best Peer++: A Peer-to-Peer Based Large-Scale Data Processing Platform 2014
18 Trusted DB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality 2014
19 Distributed Web Systems Performance Forecasting Using Turning Bands Method 2014
20 Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks 2014
   
  Networking and Wireless Communication  
1 A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks 2014
2 Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks 2014
3 Cooperation Versus Multiplexing: Multicast Scheduling Algorithms for OFDMA Relay Networks 2014
4 Traffic Pattern Based Content Leakage Detection for Trusted Content Delivery Networks 2014
5 Cost-Effective Resource Allocation of Overlay Routing Relay Nodes 2014
6 Automatic Test Packet Generation 2014
7 HALO: Hop-by-Hop Adaptive Link-State Optimal Routing 2014
8 A Two stage Deanonymization Attack Against Anonymized Social Networks 2014
9 Cross-Layer Design of Congestion Control and Power Control in Fast-Fading Wireless Networks 2014
   
  Image Processing and Multimedia  
     
1 Web Image Re-Ranking Using Query-Specific Semantic Signatures 2014
2 Click Prediction for Web Image Re ranking Using Multimodal Sparse Coding 2014
3 Captcha as Graphical Passwords—A New Security Primitive Based on Hard AI Problems 2014
4 Learning and Recognition of On-Premise Signs from Weakly Labeled Street View Images 2014
5 Personalized Geo-Specific Tag Recommendation for Photos on Social Websites 2014
6 Multi sensor Fusion-Based Concurrent Environment Mapping and Moving Object Detection for Intelligent Service Robotics (Dot Net) 2014
7 Sharing Visual Secrets in Single Image Random Dot Stereograms (Dot Net) 2014
8 Feature Match: A General ANNF Estimation Technique and its Applications (Dot Net) 2014
   
  J2ME Mobile Based Projects
   
1 Adaptation of a virtual campus for mobile learning devices 2014
2 Bluetooth Mobile Based College Campus 2014
3 ECops via Handheld Mobile Devices 2014
4 Privacy-Conscious Location-Based Queries in Mobile Environments 2014
5 Ranking Model Adaptation for Domain-Specific Search 2014
6 SPOC A Secure and Privacy-preserving Opportunistic Computing Framework For Mobile-Healthcare Emergency 2014
7 The Word in a nut shell : CONCISE RANGE QUERIES 2014
  Parallel and Distributed System
 
1 Enabling Trustworthy Service Evaluation in Service-Oriented Mobile Social Networks 2014
2 Exploiting Service Similarity for Privacy in Location-Based Search Queries 2014
3 LocaWard: A Security and Privacy Aware Location-Based Rewarding System 2014
4 On False Data-Injection Attacks against Power System State Estimation: Modeling and Countermeasures 2014
5 Traffic Pattern-Based Content Leakage Detection for Trusted Content Delivery Networks 2014
6 Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks 2014
7 SOS: A Distributed Mobile Q&A System Based on Social Networks 2014
8 Certificateless Remote Anonymous Authentication Schemes for Wireless Body Area Networks 2014
9 Secure and Efficient Data Transmission for Cluster-based Wireless Sensor Networks 2014
10 Secure Deduplication with Efficient and Reliable Convergent Key Management 2014
 

 

 

Posted on

Web Spam Detection and Analysis Java Project

In this information age, it is a deplorable state that despite the overload of information, we regularly fail to locate relevant information in a timely manner. This is mainly because of the misinterpretation of the context of the information, there may be some spam sites which contains irrelevant information the seeker will waste time in reading those sites.

The subject of this thesis is the design and implementation of a search service – Web Spam Detection, targeted at researchers to help them perform search tasks effectively for better results. The system contains major approaches like the   browser with search engine, which helps in detecting spam sites.

Spam Detection Project Screen

In the browser which we have developed, it does the same function as the real time browser and as soon as when the url is entered in the address bar of the browser, it will direct to our web service and checks whether it is spam or non-spam site. If spam website is identified by the url, then the user has been given a message that he/she  have accessed an invalid url otherwise it loads the page normally.

So he/she does not need to read those irrelevant information. It checks the spam sites according to its characteristics. For the keyword entered in the search engine it uses KLD Classifier algorithm, to identify the spammy websites. KLD classifier looks for the term dependency between the query and linked page.

In this information age, online information resources are abundantly available and widely used. Particularly, in the field of academia, several Terabytes of academic content is uploaded on the Internet every week, and the demand for such resources is always on the rise.

Tragically, access to this information using a generic search engine is not satisfactory in terms of the relevance of links and the overtime on bad links.

This can be attributed to several factors, the most important being the absence of identification of context of the search which leads to spammy websites and lack of customization based on user’s profiles.

In an attempt to alleviate these issues, we present a search engine service surfing for any information available in the web. The motivation for this endeavor lies in the following assumptions and inferences.

URL Validation                                               

Users can enter the url in the developed browser which can be identified that the entered url is valid or not. For the url entered by the user, the browser helps in displaying the web page and the entire source code have been crawled for detecting whether it is executing within the same requested server or not.

Search Engine Development

User can enter any keyword to search in the developed browser and the links can be displayed after crawling the source code. KLD classifier can be applied for the links which are irrelevant when the user clicks on those links suggesting us not to go to those spammy websites.

 Relevancy and efficiency enhancement

Efficiency can be enhanced by displaying a message to the user before that spam page requested by the user is loaded. Using KLD classifier, our search engine reduces the overtime on bad links and improves relevancy. If the user’s action can be identified by any warning message, then the identification of the context of search can be highly accurate.

SCOPE OF THE PROJECT

  • Provides an exclusive search service for general information from the web.
  • Helps users by avoiding them in going to spammy websites.
  • Makes the searching process easier by understanding the context of the search qiven as query.
  • Helps in detecting the spam websites using the KLD Classifier by proceeding with a message to the user.
  • Reduces the overtime on bad links.

OVERALL CONCLUSION

Web search engines provide a window to the ever expanding world of online academic content. In our web service we are preventing the user before getting into the spam sites. The search engine does this work internally that when the url or keyword entered it will extract the information and then it will display the relevant pages according to that particular one.

It will take a little amount of time to load the page but it is more convenient than the time spend in reading the spam sites. Although relevancy can be improved by precise calculation in the KLD classifier. The WSDA system that we propose attempts to achieve non-spam sites alone by identifying the spa sites and giving an alert to the user. Using this system, relevancy is considerably improved and the overtime on bad links reduced.

FUTURE WORK AND EXTENTIONS

In order to amplify the perceived quality and usefulness of the collaborative results, we have identified the following future directions to the system.

  • While modeling the web service, if it is a non-spam sites it will give an alert after the user clicks on it but we have to enhance this before the page gets loaded.
  • In terms of response time Java can be optimized for quicker querying  and other faster options can be used for information extraction.

RESULTS AND DISCUSSIONS

RESULTS

              When the user types a keyword in the search engine it will display the links and information according to that keyword and if the url entered on the browser it will display the results according to that as web page. When the user clicks on the particular link it will load the page if it is not a spam after it undergoes our system services.

Precision values for both the approaches(Yahoo and WSDA) can be plotted in the graph below

Precision values for Approach 1 and Approach 2

Recall values for both the approaches(Yahoo and WSDA) can be plotted in the graph below

Recall values for Approach 1 and Approach 2

Now we plot the Precision-Recall graphs. The Precision-Recall graph for Approach 1 and 2 is shown in Figure 5.3

Precision-Recall curve for Approach 1 and 2

ANALYSIS

When the user clicks before loading the page it will check whether the given one is spam or non spam through the spam characteristics. Not only checks for the spam page it will check whether it belongs to the same domain or server, or not.

PROBLEMS AND ISSUES

              Our system will extract the page source content and it will checks whether it is spam or not by doing KLD calculation. We also try to extract surrounding text for comparison.

Posted on

Satellite Coverage Problem Java Project

Design and Analysis of Algorithms

Problem Statement

We are provided with a group of Satellites each covering a set of locations on the Globe. But to cover the globe even when satellite fails, each data point or location is to be covered with more than one satellite, there may be some common locations covered in between Satellites. From this setup, we need to find the minimum number of satellites needed to cover all the locations on the Globe at least twice. This at least twice constraint is added because if at any time a satellite failure occur then the remaining satellites should be able to cover all the locations .So we need to find the minimum number of satellites covering entire Globe such that each and every location is covered at least twice.

Algorithm

The approach used in solving the problem is the Greedy Method. Select the satellite which cover maximum points first then the next maximum and then continue this process and find the minimum number of satellites needed to cover the Globe once.

Now to find the second cover, We first find the points that are covered at least twice in the first cover then from that we get the uncommon points  of the satellites covered in first round and now try to find the satellite  among the remaining satellites which will cover the maximum points of the remaining set. Algorithm is iteratively processed until we are left with a Null set to give the final result.

Pseudo code

  1. Let D be the list of data points  , S be satellite array
  2. while(dataset D != NULL)

{

  1. Now choose the satellite covering the maximum points in the dataset and add to the result.
  2. Find the remaining set as difference (dataset, locations covered by chosen satellite) and
  3. Add it to form a new dataset
  4. Remove the   chosen satellite from the  satellite list

}

Now we have result set of satellites covering the entire dataset once.

To cover the dataset at-least twice, we use following logic

  1. Find the set S= all the common locations covered by satellites chosen in above algorithm .
  2. Now do difference (dataset,S)   and store the result in fresh_dataset.
  3. while (fresh_dataset ! = NULL)

{

  1. For all the remaining satellites find the satellites which has the most common locations with that of the fresh_dataset and select the maximum among them as the next satellite.
  2. Add this to the result.
  3. Update fresh_dataset = difference (fresh_dataset, locations covered by chosen satellite)
  4. Remove the chosen satellite from satellite list.

}

  1. Algorithmends giving by adding minimum satellites covering entire locations at least twice.

Source Code :

For single Cover :

[java]

while(remainingset.isEmpty()==false)

{

count++;

Set<Integer>tempset = newHashSet<Integer>();

for(i=0;i<as.size();i++)

{

if(as.get(i).getValue()!=0)

{

tempset=obj[as.get(i).getKey()].cover;

tempset=<em>difference</em>(remainingset,tempset);

if(tempset.isEmpty()==true)

setdiff.put(as.get(i).getKey(), 0);

else

setdiff.put(as.get(i).getKeytempset.size());

}

}

[/java]

Continuing in Other function recursively for Second Cover of the Globe. 

[java]

if(duplicate_dataset.isEmpty())

{

System.out.println(resultant);return;

}

resultant.add(as.get(0).getKey());

for(int count1=1;count1<as.size();count1++)

{

if((difference(duplicate_dataset,obj[as.get(count1).getKey()].cover )).isEmpty())

{

resultant.add(as.get(count1).getKey());

duplicate_dataset=difference(duplicate_dataset, obj[as.get(count1).getKey()].cover);

System.out.println(resultant);return;

}

}

System.out.println("New Resultant is:"+resultant);

sc_length.put(as.get(0).getKey(), 0);

System.out.println(sc_length);

satlltFailureManagement();           //Recursive Call

}

<strong>
[/java]

Sample Input and Output

Input Contain Two Files

  1. Datapoints.txt:    This file will contain the location points of globe indicated by numbers separated by space.

                             1 2 4 5 6 3 7 8 9 10          {All space separated}

  1. Satellite_Info.txt : This file contain the Satellite name and locations covered by each satellite

1 2 3 5 8 9:S0

10 4 6 5 1 9 2 7:S1

7 2 6 8 4 3:S2

1 2 4 5 6 7 9 8 10 3:S3

In above input the Satellite name is the part that is present after: and all the numbers indicate the locations covered by the satellite

Output:

Shows the Minimum Number of Satellites needed to cover the Globe twice  , along with the name of the Satellites.

Minimum Number of the Satellites needed for covering twice is: 3

S3 S1  S0

Algorithm also finds optimal solution in the Counter Example given by TA.

Proof of Correctness

We can view the Satellite Covering problem as set covering problem, where all the locations of the globe are considered as the elements in the Set S . And the satellite covering points as the subsets of the Set S.If we can prove that Greedy algorithm finds optimal fro set cover then it implies that Greedy Algorithm can find optimal in Satellite Covering as well.

Set Covering is an NP Complete Problem.We this algorithm tries finding the optimal solution using Greedy approach in 2 ways.

  1. Use the Satellite which covers maximum points. (Used to cover at least one time)
  2. Use the Satellite which cover the maximum points which are not repeated by the satellites selected in the step 1. (Used to cover at least two times)

Thus using above proof, covering the globe (all points once) using greedy approach solves the problem. But to cover the globe even when satellite fails, each datapoint or location is to be covered with more than one satellite. To do that , we find the less common elements that are present in the remaining Fresh_Set and the satellite is accordingly added making globe covered at-least twice.

Thus using the statements above, the proof for correctness is established.

Time Complexity Analysis

  1. For covering globe entirely at-least one time , we tried to find the MAXIMUM locations covered by each satellite and added that to Result until the globe is covered. So finding MAX  n times is done with a time Complexity of O(nlogn)
  2. For covering globe locations second time , we tried to find the satellite covering MAXIMUM locations uncovered by previous satellites. This also needed sorting of satellites remaining based on the number of differences between the dataset and satellite cover, which needed Complexity of O (nlogn)
  3. Thus the total Complexity for Covering the Globe atleast twice with minimum satellites need O(nlogn).

Download the attached project code.

Posted on

Virtual Desktop Project in Java Abstract

This is the Virtual Desktop Project in Java which facilitates learning electronically. This virtual Desktop Environment project is developed with aim to provide learning electronically. This Project is developed for the electronic learning for Training Institutions. This project makes use of cheap communication media Internet. The one of the advantage of using this project is it makes use of Internet. This product can use for On-line Trainings and On-line Seminars. It makes the institutions to provide quality of education to the door steps. It avoids unnecessary infrastructure and unnecessary time. It makes Trainers available 24/7 if required. This incorporates the global people under one umbrella; they can share the knowledge by sitting at their desktops. 

Features of Virtual Desktop Environment: 

The Virtual Desktop Environment is a virtual e-learning environment. The software is positioned as a full-featured, web collaboration and training environment that has the capability to be used in training .The service is available worldwide.

Video capability of VDE allows you to show live views of instructor (if they have web cams). You can turn the video on and off as desired. You can have up to two video cameras showing in a single interaction. 

Main Modules of virtual desktop project:

Client (Student) Module:  In this application client is student who can access trainer by online using this module. Student can hear trainer voice and view desktop screen. 

Admin Module: Admin will act as mediator between student and trainer. Student and trainer registration details can be accessed by admini. 

Trainer Module:  Using this module trainer can communicate with student and share desktop screen and have voice communication.

Posted on

Admin Logistics Project Abstract

Web based intranet Admin logistics project is a service oriented application where employees inside organization can share information. This project is for house keeping department to check after cabs booking, room and conference room bookings..etc.

Admin Logistics Project Modules:

Work-Flow Module: 

This module helps in configuring of the workflow in the levels of escalation e.g., if complaint is not handled with in 24 hours will be escalated to their supervisor. 

Booking Module: 

This module facilitates the user to manage the bookings of the cab, guest house and conference rooms. 

Complaints Module: 

This module allows the employees to log the complaints and these complaints will be mailed to the concerned departments and an excellent tracking and escalation system need to be developed. 

Administration Module: 

This module allows the Admin to manage the users and also provides with the fair backup and recovery system. 

Reports: 

Various  customized MIS reports will be provided for the employees to manage the system effectively. 

Security Module:

This Module relates to the Security  Department which dealt with the advance appointment  schedules.

Posted on

A-R image Portal Project in Java

A-R image portal is a web based application which allows the user to login or register itself. After login, user will be able to collect and save pictures in folders according to his wish. He will also be able to manipulate pictures (gray scale, image rotation, cropping) and save them back in the folder.

System summary:
1 System configuration:
A-R image portal operates on any computer which will support internet explorer. Application requires registration to save data (images and folder) in database. After installation of the internet explorer you can get access to this application.

 2 User access level:
Only registered users are able to get access to this application and can save data to database.
Contingencies:
In case of power outage data are not saved in database of the client side and any changes in the photo would be lost.

3 Getting started:
Getting Started section explains how to design your own application using jsp pages and java classes.
Software installation:
• Install netbeans IDE 7.3.1 to design web pages and java classes.
• Install oracle 10g for database.
External dependencies:
This app requires ojdbc to connect with oracle.

Modules Overview:

This section provides a detailed description of system functions

 Login or registration:

Any registered user can login to use the image portal. Any unregistered user can be registered by filling the registration form.

  Create folder:

User can create new folders by specifying an appropriate name. Multiple folders with same name can’t be exist. In newly created folders user can add pictures and can process them. User could also be able to manipulate the existing folders. Folders will save in database.

  Delete folder:

User can delete folder by specifying its name. If user enters invalid name then app will send an error message otherwise it will send success message. User could either delete an empty folder or a folder with multiple photos.

  Add photos:

By clicking on any folder, it will be opened and user will be able to add new photos in the respective folder by using the browsing button. Image will be displayed in folder and will also save in database.

Delete photos:

By specifying the photo id user can delete any photo from folder and also from database. if user enters invalid id then app will send an error message otherwise it will send success message.

Zoom photo viewer:

On clicking the photo, it will be displayed in large size and will also provide the option of rotate image crop image and convert it in grayscale.

   Logout:

After using this app, user will logout after clicking the logout button.

Posted on

Java Available Projects (IEEE)

Welcome to Available 2007, 2008, 2009, 2010, 2011,2012 and 2013 Java based projects.

Contact us for buying single / bulk java projects.

  1. A Clustering Algorithm For Data Mining Based On Swarm Intelligence
  2. A Competitive Study of Cryptography Techniques over Block Cipher
  3. A Competitive Study of Cryptography Techniques
  4. A Decentralized Service Discovery
  5. A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
  6. A Distributed Control Law for Load Balancing in Content Delivery Networks
  7. A Distributed Explicit Rate Schemes in Multi-Input-Multi-Output Network Systems
  8. A Dual Framework and Algorithms for Targeted Online Data Delivery
  9. A Dynamic En-route Filtering Scheme for Data Reporting in Wireless Sensor Networks
  10. A Fast Cluster ing-Based Feature Subset Selection Algor ithm for High Dimensional Data
  11. A Framework for an Adaptive Intrusion Detection System
  12. A Fuzzy Self-Constructing Feature Clustering Algorithm for Text Classification
  13. A Gaussian Derivative Based Version Of Jpeg For Image Compression and Decompression
  14. A Generic multilevel architecture for time series prediction
  15. A Genetic Programing Approach to Record Duplicaton
  16. A Geometric Approach To Improving Active Packet Loss Measurement
  17. A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks
  18. A Load Balancing Model Based on Cloud Partitioning for the Public Cloud
  19. A machine learning approach for identifying disease-treatment relations in short texts
  20. A Memory Learning Framework for Effective Image Retrieval
  21. A Model-Based Approach to Evaluation of the Efficacy of FEC Coding in Combating Network Packet Los
  22. A Network Coding Equivalent Content Distribution Scheme for Efficient Peer-to-Peer Interactive VoD Streaming
  23. A New Algorithm for Inferring User Search Goals with Feedback Sessions
  24. A New Approach for FEC Decoding Based on the BP Algorithm in LTE and WiMAX Systems
  25. A New Operational Transformation Framework for Real-Time Group Editors
  26. A Novel Association Rule Mining Mechanism in Wireless Sensor Networks
  27. A Novel Secure Communication Protocol for Ad Hoc networks [SCP]
  28. A Permutation Based Algorithm to Optimally Reschedule Trains in a Railway Traffic Network
  29. A Policy Enforcing Mechanism for Trusted Ad Hoc Networks
  30. A Precise Termination Condition Of The Probabiistic Packet Marking Algorithm
  31. A Price- and-Time-Slot-Negotiation Mechanism for Cloud Service Reservations
  32. A Privacy-Preserving Location Monitoring System for Wireless Sensor Networks
  33. A Review of the Applications of Agent Technology In Traffic and Transportation Systems-Project
  34. A Routing-Driven Elliptic Curve Cryptography Based Key Management Scheme for Heterogeneous Sensor Networks
  35. A Scalable Server Architecture for Mobile Presence Services in Social Network Applications
  36. A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding
  37. A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation
  38. A Semantically Enriched Clinical Guideline
  39. A Signature based indexing Method for Efficient Content-Based Retrieval of Relative Temporal Patterns
  40. A Stochastic Approach To Image Retrieval Using Relevance Feedback And Particle Swarm Optimization
  41. A Stochastic Model to Investigate Data
  42. A Survey of Payment Card Industry Data Security Standard
  43. A System to Filter Unwanted Messages from OSN User Walls
  44. A Trigger Identification Service For Defending Reactive Jammers In Wireless Sensor Network
  45. Access Policy Consolidation For Event Processing Systems
  46. Achieving Network Level Privacy in Wireless Sensor Networks
  47. Active Source Routing Protocol For Mobile Networks
  48. Adaptive Opportunistic Routing for Wireless Ad Hoc Networks
  49. Adaptive QoS for Mobile Web Services Through Cross Layer Communication
  50. Agent Based Efficient Anomaly Intrusion Detection System in Adhoc networks
  51. Always Acyclic Distributed Path Computation
  52. AMES-Cloud A Framework of Adaptive Mobile Video Streaming and Efficient Social Video Sharing in the Clouds
  53. An Adaptive Programming Model for Fault-Tolerant Distributed Computing
  54. An Agent Based Intrusion Detection, Response and Blocking using signature method in Active Net
  55. An Efficient and secure self organized key mamnagement
  56. An Efficient Association Rule Mining Algorithm In Distributed Databases
  57. An Efficient Caching Scheme and Consistency Maintenance in Hybrid P2P System
  58. An Efficient Paging Scheme for Terminal Mobility Using Personal Mobility Management Information in Interworked Fixed and Mobile Networks
  59. An Efficient Self-Organized Authentication and Key Management Scheme for Distributed Multihop Relay- Based IEEE 802.16 Networks
  60. An SSL Back-End Forwarding Scheme in Cluster-Based Web Servers
  61. Analysis on Credit Card Fraud Detection Methods
  62. ANEW Aalgorithm
  63. Application of BPCS steganography to wavelet compressed video
  64. Architecting a Secure Enterprise Data Sharing Environment to the Edge
  65. Attribute-Based Encryption With Verifiable
  66. Audio Cryptography System
  67. Authorization Recycling In Distributed Systems through Discovery Service
  68. Automatic Database Schema Generation
  69. Automatic Discovery of Association Orders between Name and Aliases from the Web using Anchor Texts-based Co-occurrences
  70. Automatic Discovery of Association
  71. Autonomy-Oriented, Self-Equilibrium Routing Model in Traffic Networks
  72. Back End Communication Management System in Distributed Network
  73. Bandwidth Estimation for IEEE 802.11-Based Ad Hoc Networks
  74. Bandwidth Recycling in IEEE 802.16 Networks
  75. BINRANK Scaling Dynamic Authority-Based Search Using Materialized Sub Graphs
  76. Buffer Sizing for 802.11 Based Networks
  77. Caching Strategies Based on Information Density Estimation in Wireless Ad Hoc Networks
  78. Call-Stack Coverage for GUI Test Suite Reduction
  79. CAM Cloud-Assisted Privacy Preserving Mobile Health Monitoring
  80. Capturing Router Congestion and Delay
  81. Carving and Replaying Differential Unit Test Cases from System Test Cases
  82. Catching Packet Droppers and Modifiers in Wireless Sensor Networks
  83. CCD A Distributed Publish OR Subscribe Framework for Rich Content Formats
  84. Client Side Load Balancer using Cloud
  85. CLOSENESS A New Privacy Measure for Data Publishing
  86. Cloud Computing for agent Based Urban Transportation systems
  87. Cloud Data Protection for the Masses
  88. CloudMoV Cloud-based Mobile Social TV
  89. Cloud Computing Security
  90. Clustering and Sequential Pattern Mining of Online Collaborative Learning Data
  91. Clustering with Multi-Viewpoint based Similarity Measure
  92. Super Resolution based Inpainting
  93. Collaboration in Multicloud
  94. collaborative filtering using dual information sources
  95. College Attendance System
  96. Colleges and Students Information System
  97. Comparable Entity Mining from Comparative Questions
  98. Computation-efficient Multicast Key Distribution
  99. Conditional Shortest Path Routing In Delay Tolerant Networks
  100. Confucius A Tool Supporting Collaborative Scientific Workflow Composition
  101. Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates
  102. Continuous Data Protection using struts frame work
  103. Continuous Monitoring of Spatial Queries in Wireless Broadcast
  104. Cooperative Caching in Wireless P2PNetworks Design, Implementation, And Evaluation
  105. Cooperative Provable Data Possession for Integrity Veri fication in Multi-Cloud Storage
  106. Costing of Cloud Computing Services A Total Cost of Ownership Approach
  107. Coupling-Based Structural Metrics for Measuring the Quality of Software
  108. Cross-Layer Design for Wireless Networks
  109. Crowd sourcing Predictors of Behavioral Outcomes
  110. Cryptographic Versus Trust-Based Method For Manet Routing Security
  111. Cut Detection in Wireless Sensor Networks
  112. Data Leakage Detection
  113. DECOR A Method for the Specification and Detection of Code and Design Smells
  114. Delay Analysis and Optimality of Scheduling Policies for Multi-Hop Wireless Networks
  115. Delay Analysis and Optimality of Scheduling
  116. Delay-Based Network Utility Maximization
  117. Demonstration of Secure Socket Layer
  118. Design a Guard System for Sybil Attack
  119. Design and Implementation of TARF  A Trust-Aware Routing Framework for WSNs
  120. Design and Performance Analysis of Mobility Management Schemes based on Pointer Forwarding for Wireless Mesh Networks
  121. Designing Less-Structured P2P Systems
  122. Detecting Malicious Packet Losses
  123. Detecting Spam Zombies
  124. Detection of Routing Misbehavior in MANETs
  125. Detection of Selfish Nodes in Networks Using CoopMAC Protocol with ARQ
  126. Discovering Conditional Functional Dependencies
  127. Distributed Cache Updating for Dynamic Source Routing(DSR) Protocol
  128. Distributed Collaborative Key Agreement And Authentication Protocols For Dynamic Peer Groups
  129. Distributed Cooperative Caching In Social Wireless Networks
  130. Distributed E-Health Care System Using SOA Service-Oriented Distributed Data Mining
  131. Distributed Packet Buffers for High-Bandwidth Switches and Routers
  132. Distributed Processing of Probabilistic Top-k Queries in Wireless Sensor Networks
  133. Diverse firewall design
  134. Domain name service system with secured manner
  135. Double Guard Detecting Intrusions in Multitier Web Applications
  136. Dual-Link Failure Resiliency Through Backup Link Mutual Exclusion
  137. Dynamic Channel Allocation for Wireless Zone-Based Multicast and Broadcast Service
  138. Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries
  139. Dynamic Load Balancing in Distributed Systems in the Presence of Delays A Regeneration-Theory Approach
  140. Dynamic MallWare Spread in Decentralized P2P System
  141. Dynamic Resource Allocation using Virtual Machines for Cloud Computing Environment
  142. Dynamic Routing with Security Considerations
  143. Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
  144. Dynamics of Malware Spread in Decentralized Peer-to-Peer Networks
  145. E-fraud Prevention Based N The Self-authentication Of E-documents
  146. Effective Navigation of Query Results Based on Concept Hierarchies
  147. Effective Navigation
  148. Effective Pattern Discovery for Text Mining
  149. Effective Software Merging in the Presence of Object-Oriented Refactorings
  150. Efficient and Dynamic Routing Topology Inference From End-to-End Measurements
  151. Efficient and Secure Content Processing and Distribution by Cooperative Intermediaries
  152. Efficient Approximate Query Processing In Peer-to-Peer Networks
  153. Efficient Broadcasting in Mobile Ad Hoc Networks
  154. Efficient Computation of Range Aggregates against Uncertain Location Based Queries
  155. Efficient Error Estimating Coding Feasibility and Applications
  156. Efficient Fuzzy Type-Ahead Search in XML Data
  157. Efficient key Agreement for Large and Dynamic Multicast Groups
  158. Efficient Key Management For Threshold-Multi Signature In Distributed System
  159. Efficient Multi-dimensional Fuzzy Search for Personal Information Management Systems
  160. Efficient Multi-Dimensional Suppression for K-Anonymity
  161. Efficient Processing of Metric Skyline Queries
  162. Embedded Extended Visual Cryptography Schemes
  163. Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
  164. Encrypted Marking Based Detection And Filtering (EMDAF)
  165. Energy Efficient Cooperative Video
  166. Energy Efficient System
  167. Energy-Efficient Cooperative Video distribution with Statistical QOS provisions over Wireless Networks
  168. Energy-Efficient SINR-Based Routing for Multihop Wireless Networks
  169. EnergyMaps For Mobile Wireless networks coherence Time Versues Spreding Period
  170. Engineering Privacy
  171. Enhanced Ant Algorithm Based Load Balanced Task Scheduling In Grid Computing
  172. Enhancing Search Performance in Unstructured P2P Networks Based on Users Common Interest
  173. Ensuring Data Storage Security in Cloud Computing
  174. Ensuring Distributed Accountability for Data Sharing in the Cloud
  175. Enterprise Collaboration Tool Project
  176. Error Control System In Network Environment
  177. Error-Tolerant Resource Allocation and Payment Minimization for Cloud System
  178. Estimation of Defects Based on Defect Decay Model ED3M
  179. Evaluating the Efficacy of Forward Error Correction Coding
  180. Evaluating the Vulnerability of Network Traffic Using Joint Security and Routing Analysis
  181. Evaluation of Accuracy in design pattern occurence detection
  182. Evaluation of User Behavior trust in cloud computing
  183. Extended Boolean Retrieval
  184. Extended XML Tree Pattern Matching Theories and Algorithms
  185. Extracting Actionable Knowledge From Decission Trees
  186. Extracting Spread-Spectrum Hidden Data from Digital Media
  187. Face Recognition For Smart Recognitions
  188. Face Recognition Using Laplacianfaces
  189. Facial Expression Recognition Using Facial Movement Features
  190. Facilitating Effective User Navigation through Website Structure Improvement
  191. FADE Secure Overlay Cloud Storage with File Assured Deletion
  192. Fast Data Collection in Tree-Based Wireless Sensor Networks
  193. Fast Rendering Algorithm of Underwater Optical Effect
  194. Fast Transmission to Remote Cooperative Groups
  195. Fault Tolerant Scheduling for Hard Real Time Tasks in Uniprocessor System
  196. FEBA A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks
  197. Filtering Unwanted Packets On Atm Network
  198. Fingerprint Authentication System
  199. Flexible Rollback Recovery In Dynamic Heterogeneous Grid Computing
  200. FoCUS Learning to Crawl Web Forums
  201. Fog Computing Mitigating Insider Data Theft Attacks in the Cloud
  202. Footprint Detecting Sybil Attacks in Urban Vehicular Networks
  203. Fully Anonymous Profile Matching In Mobile Social Networks
  204. Fuzzy Keyword Search over Encrypted Data in Cloud Computing
  205. Game-Theoretic Pricing for Video Streaming in Mobile Networks
  206. Genetic Algorithm Based Train Simulation using Concurrent Engneering
  207. Geo-Community-Based Broadcasting for Data Dissemination in Mobile Social Networks
  208. Geographical Routing With Location Service in Intermittently Connected MANETs
  209. GHIC A Hierarchical Pattern-Based Clustering Algorithm for Grouping Web Transactions
  210. GLIP A Concurrency Control Protocol for Clipping Indexing
  211. Going Back and Forth Efficient Multideployment and Multisnapshotting on Clouds
  212. Grid Scheduling based on Collaborative Random Early Detection Strategies
  213. Handling Selfishness in Replica Allocation
  214. Handwritten Chinese Text Recognition by Integrating Multiple Contexts
  215. Harnessing the Cloud for Securely Outsourcing
  216. HASBE A Hierarchical Attribute-Based Solution for Flexible and Scalable Access Control by Separate Encryption Decryption in Cloud Computing
  217. HASBE Access Control in Cloud Computing
  218. Hiding Data Distribution in outsourced Archival Databases
  219. HIDS Intrusion Detection System Over Abnormal Internet Sequence
  220. Homogenous Network Control and Implementation
  221. Horizontal aggregation in SQL to prepare data sets for data mining analysis
  222. Host-to-Host Congestion Control for TCP
  223. How Software Developers Use Tagging to Support Reminding and Refinding
  224. Hybrid Intrusion Detection with Weighted Signature Generation over Anomalous Internet Episodes (HID)
  225. Hybrid Scheduling Of Dynamic Task Graphs With Selective Duplication For Multiprocessors Under Memory And Time Constraints
  226. Identification of Humans Using Gait
  227. Identity-Based Secure Distributed Data Storage
  228. Image Authentication Over Wireless Channels
  229. IMine Mining Association Rules with Item Constraints
  230. Implementing Multicast Distribution through Recursive Unicast Trees
  231. Implementing security across the networks with Quantum key distribution protocol
  232. Improving Utilization of Infrastructure Clouds
  233. Incentive Compatible Privacy-Preserving Data Analysis
  234. Increasing efficiency in wireless networks using bandwidth routing protocol
  235. Intrusion detection An Energy efficient approach in Heterogeneous WSN
  236. Intrusion Detection in Homogeneous and Heterogeneous Wireless Sensor Networks
  237. Intrusion Detection System Over Abnormal Internet Sequence
  238. IP Fast Reroute Framework
  239. ITP An Image Transport Protocol for the Internet
  240. Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection
  241. Java Grid Done Using Grid Computing
  242. Java Program Invention With User Integrated Developed Environment
  243. Robust video data hiding using forbidden data hiding
  244. Knowledge-Based Interactive Postmining of Association Rules Using Ontologies
  245. KTR an Efficient Key Management Scheme for Secure Data Access Control in Wireless Broadcast Services
  246. Large Connectivity for Dynamic Random Geometric Graphs
  247. Latency Equalization as a New Network Service
  248. Layered Approach Using Conditional Random Fields for Intrusion Detection
  249. Learn to Personalized Image Search from the Photo Sharing Websites
  250. Live Streaming with Receiver-based Peer-division Multiplexing
  251. Load Rebalancing for Distributed File Systems in Clouds
  252. Load-Balancing Multipath. Switching System with Flow Slice
  253. Location Aided Routing In Mobile Adhoc Networks
  254. Location Based Routing For Distance Nodes
  255. Location Based Spatial Query Processing In Wireless Broadcast Environments
  256. Low Latency And Energy Efficient Routing Protocols For Wireless Sensor Networks
  257. M-Privacy for Collaborative Data Publishing
  258. Managing Multidimensional Historical Aggregate Data in Unstructured P2P Networks
  259. Maximizing The Number Of Broadcast Operations In Random Geometric Adhoc Wireless Networks
  260. Measuring Capacity Bandwidth of Targeted Path Segments
  261. Message Authentication In Computationally Constrained Environments
  262. Minimizing Delay and Maximizing Lifetime for Wireless sensor Networks with Anycast
  263. Minimizing File Download Time in Stochastic Peer-to-Peer Networks
  264. Mining Contract S For Business Event And Temporal Constraints In Service Engagement
  265. Mitigating Denial-of-Service Attacks on the Chord Overlay Network A Location Hiding Approach
  266. Mitigating Performance Degradation in congested sensor networks
  267. Mitigating selective forwarding attacks with a channel-aware approach in WMNS
  268. Mitigation of Control Channel Jamming under Node Capture Attacks
  269. Mobile Agents In_a_Distributed Multimedia Dabase System
  270. Mobile Relay Configuration in Data-intensive Wireless Sensor Networks
  271. Mobile Sampling of Sensor Field Data Using Controlled Broadcast
  272. Mobility Management Approaches for Mobile IP Networks Performance Comparison and Use Recommendations
  273. Modeling & Automated Containment of Worms
  274. Modeling and Detection of Camouflaging Worm
  275. Monitoring Online tests thru data visualisation
  276. Monitoring patients via a secure and mobile healthcare system
  277. Monitoring The Aplication Layer DDOS Attacks
  278. Monitoring the Application-Layer DDoS Attacks for Popular Websites
  279. Multicast Multi-path Power Efficient Routing in Mobile ADHOC networks
  280. Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks
  281. Multiparty Access Control For Online Social Networks Model And Mechanisms
  282. Multipath Dissemination in Regular Mesh Topologies
  283. Multiple Routing Configurations for Fast IP Network Recovery
  284. Network Component for Xml Migration
  285. Network Load Balancing
  286. Network Border Patrol Preventing Congestion Collapse
  287. NICE Network Intrusion Detection and Countermeasure
  288. Noise Reduction by Fuzzy Image Filtering
  289. Nymble Blocking Misbehaving Users in Anonymizing Networks
  290. OCGR A New Scheduling Algorithm for Differentiated Services Networks
  291. ODAM An Optimized Distributed Association Rule Mining Algorithm
  292. On Event-Based Middle ware for Location-Aware Mobile Applications
  293. On Modeling Analysis and Optimization of Packet Aggregation Systems
  294. On Optimizing Overlay Topologies for Search in Unstructured Peer-to-Peer Networks
  295. On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System
  296. On the Impact of Security Protocols on the Performance of SNMP
  297. On the Information Flow Required for Tracking Control in Networks of Mobile Sensing Agents
  298. On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
  299. Online Index Recommendations for High-Dimensional Databases Using Query Workloads
  300. Online Intrusion Alert Aggregation For Data Streaming Modeling Final Source Code
  301. Online Modeling of Proactive Moderation System for Auction Fraud Detection
  302. Open Smart Classroom Extensible and Salable Learning System in Smart Space Using Web Service Technology
  303. Optical Character Recognition on a Grid Infrastructure
  304. Optimal Bandwidth Assignment for Multiple-Description-Coded Video
  305. Optimal Client-Server Assignment for Internet
  306. Optimal Jamming Attack Strategies and Network Defense Policies in Wireless Sensor Networks
  307. Optimal Power Allocation in Multi-Relay
  308. Optimal service pricing for a cloud cache
  309. Optimized Resource Allocation for Software Release Planning
  310. Optimizing Cloud Resources For Delivering Iptv Services Through Virtualization
  311. Organizing User Search Histories
  312. P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains
  313. Packet Loss Control Using Tokens at the Network Edge
  314. Packet-Hiding Methods for Preventing Selective Jamming Attacks
  315. PAM An Efficient and Privacy-Aware Monitoring Framework for Continuously Moving Objects
  316. PCA-Based Spatially Adaptive Denoising of CFA Images for Single-Sensor Digital Cameras
  317. Performance of a Speculative Transmission Scheme for Scheduling-Latency Reduction
  318. Personal Authentication Using 3-D Finger Geometry
  319. Pharmacy Management System
  320. Learn to Personalized Image Search from the Photo Sharing Websites
  321. PMSE A Personalized Mobile Search Engine
  322. Policy-by-Example for Online Social Networks
  323. POPI A User-level Tool for Inferring Router Packet Forwarding Priority
  324. Portable Cloud Services Using TOSCA (2012)
  325. Predictive Job Scheduling in a Connection Limited System using Parallel Genetic Algorithm
  326. Preventing Private Information Inference Attacks
  327. Price Differentiation for Communication Networks
  328. Privacy Preserving Data Sharing With Anonymous ID Assignment
  329. Privacy Preserving Delegated Access Control
  330. Privacy-Preserving Distributed Profile Matching In Proximity-Based Mobile Social Networks
  331. Privacy-Preserving Public Auditing for Secure Cloud Storage
  332. ProgME Towards Programmable Network Measurement
  333. Progressive Parametric Query Optimization
  334. QUIVER Consistent object Sharing for Edge Services
  335. Random Access Transport Capacity
  336. Randomized Protocols for Duplicate Elimination in Peer-to Peer Storage Systems
  337. Ranked Reverse nearest Neighbor Search
  338. Ranking Model Adaptation for Domain-Specific Search
  339. Ranking Spatial Data by Quality Preferences
  340. Re-Ordering Of Packets Using Retransmission Timer
  341. Reliable And Energy-Efficient Multipath Communications In Underwater Sensor Networks
  342. Reliable Re-encryption in Unreliable Clouds
  343. Remote Approach for Effective Task Execution and Data Accessing Tool
  344. Remote System Access By Using VN
  345. Research on Ontology-based Representation and Retrieval of Components
  346. Residual-Based Estimation of Peer and Link Lifetimes in P2P Networks
  347. Resource Management Using Dynamical Load Prediction and Multiprocessor Cooperation
  348. Retrieving Files Using Content Based Searching and Presenting It in Carousel View
  349. Revisiting Defenses against Large-Scale Online Password Guessing Attacks
  350. RIHT A Novel Hybrid IP Traceback Scheme
  351. Risk-Aware Mitigation for MANET Routing Attacks
  352. Robust Face-Name Graph Matching for Movie
  353. Robust Module Based Data Management
  354. Robust Video Data Hiding Using Forbidden Zone Data Hiding and Selective Embedding
  355. Route Reservation in Ad Hoc Wireless Networks
  356. SaaAS
  357. SAT- Solving Approaches to Context-Aware Enterprise Network Security Management
  358. SATA Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks
  359. Scalable and Cost-Effective Interconnection of Data-Center Servers Using Dual Server Ports
  360. Scalable and Secure Sharing of Personal Health Records
  361. Secure and Practical Outsourcing of Linear
  362. secure communication for next generation internet
  363. Secure Communications Over Wireless Broadcast Networks Stability and Utility Maximization
  364. Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes
  365. Secure Encryption System
  366. Secure Socket Layer Protocol Simulation
  367. Secureand Practical Outsourcing of Linear Programming in Cloud Computing
  368. Secured Architecture for Remote Virtual Desktops
  369. Secured Distributed Key Management for Threshold-Multisignature using Cryptography-
  370. Securing User-Controlled Routing Infrastructures
  371. Security Analysis of a Single Sign-On Mechanism
  372. Security Analysis of the SASI Protocol
  373. Security in large Mediator Protocols
  374. Security in Large Networks Using Mediator Protocols
  375. Security of web forms
  376. Security System for DNS using Cryptography
  377. Self Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks
  378. Self Adaptive Contention Aware Routing
  379. Selfish Overlay Network Creation and Maintenance
  380. Sensitive Label Privacy Protection on Social Network Data
  381. SigFree A Signature-free Buffer Overflow Attack Blocker
  382. SIMPS Using Sociology for Personal Mobility
  383. Simulation of Handoff Techniques in Mobile Cellular Networks
  384. Sketch4Match – Content-based Image Retrieval System Using Sketches
  385. Sleep Scheduling for Critical Event Monitoring in Wireless Sensor Networks(2012)
  386. Slicing A New Approach to Privacy Preserving Data Publishing
  387. Social Cloud Computing A Vision for Socially Motivated Resource Sharing
  388. Software as A Agent Service
  389. Spam Collection and Detection System
  390. SparkClouds Visualizing Trends in Tag Clouds
  391. Spatial Approximate String Search
  392. Spatio-Temporal Network Anomaly Detection by Assessing Deviations of Empirical Measures
  393. Speculative Transmission for Latency Reduction
  394. SPOC A Secure and Privacy-preserving Opportunistic Computing Framework for Mobile-Healthcare Emergency
  395. Spread Node Relocation by effective tolerant Process
  396. Stateless Multicasting In MANETs
  397. Statistical Entity Extraction from Web
  398. Structure and Texture Filling-In of Missing Image Blocks in Wireless Transmission and Compress
  399. Subspace-Based Striping Noise Reduction in Hyperspectral Images
  400. Supporting Efficient and Scalable Multicasting over Mobile Ad Hoc Networks1
  401. Techniques For A Selective Encryption Of Uncompressed And Compressed Images
  402. Temporal Data Clustering via Weighted Clustering Ensemble with Different Representations
  403. Temporal Partitioning of Communication Resources in an Integrated Architecture
  404. The CoQUOS Approach to Continuous Queries
  405. The District Medical Data Center Based on Cloud
  406. The Security Of Cloud Computing System Enabled By Trusted Computing Technology
  407. Three Party Authentication For Key Distributed Protocol Using Classical And Quantum Cryptography
  408. Throughput Optimization in Mobile Backbone Networks
  409. Toward publicly auditable secure cloud data storage services
  410. Toward Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
  411. Toward Secure and Dependable Storage Services in Cloud Computing
  412. Towards A Statistical Framework For Source Anonymity In Sensor Networks
  413. Towards Reliable Data Delivery for Highly Dynamic Mobile Ad Hoc Networks
  414. Towards Secure And Dependable
  415. Towards Superhuman Speech Recognition
  416. Trust modeling in social tagging of multimedia content
  417. Truth Discovery with Multiple Conflicting Information Providers on the Web
  418. Two tales of privacy in online social networks
  419. Two Techniques for Fast Computation of Constrained Shortest Paths
  420. Understanding Node Localizability of Wireless Ad Hoc and Sensor Networks
  421. Using Fuzzy Logic Control to Provide
  422. Using the Conceptual Cohesion of Classes for Fault Prediction in Object-Oriented Systems
  423. Utility-Privacy Tradeoff in Databases An Information-theoretic Approach
  424. Vampire attacks Draining life from wireless ad-hoc sensor networks
  425. Vehicle Detection in Aerial Surveillance Using Dynamic Bayesian Networks
  426. Verification and Trade-Off Analysis of Security Properties in UML System Models
  427. Wardrop Routing in wireless networks
  428. Winds of Change from Vendor Lock-In to the Meta Cloud
  429. Wireless Sensor Networks A Study on Congestion
  430. XTC A Practical Topology Control Algorithm for Ad-Hoc Networks
  431. Zero knowledge protocol for WSN’s
Posted on

Session Tracker Project in Java

The Objective of Session Tracker Project in Java is to give a sample project to work on real life projects. This application program helps us to build a larger more on robust application.

Session Tracker Project in Java

   The objective is to provide a real life scenario and help us to create applications using the software and hardware tools. 

The objective of Session Tracker is to develop a System, which maintains all the information related to various Records. Session Tracker automates all the process and the activity of the Student related to their Knowledge. This can help in reducing the time taken for performing various activities related to data flow from one department to another.  

PROJECT CATEGORY  :- 

Session Tracker is a Relational Database Management System

(RDBMS) project. In this project all the data is stored by using SQL SERVER 2005 as  backend, and Jdk 0.6 technology as front end, for designing user interfaces.

The system should be able to keep information related to:- 

  1. Student’s Details. 

2. Teacher’s Details. 

3. Searching the student record by Student Id. 

4. Searching the Teacher record by Teacher Id. 

5. Update Details of student and Teacher. 

6. Deleting the records. 

7. Admitting date. 

8. Exam. 

9. Result. 

10. Price Details. 

11. Payment Details.

Customer Requirements 

The customer wants the application to include the following tasks:- 

1. The application is to hold the Student /Teacher information who take admission. 

2.The Search should be on id Base. 

3. The details should include the Contact details, Personal details, and as well History details of Student. 

4. Administrator can see the all details like Student/Teacher details,Payment Details,price details,result also. 

5.There should be separate login for the user. 

6.Administrator should be Print the Payment Receipt.