Amfas Tech | Technology, Blogging & Internet Marketing: Java Projects

Intranet Chatting Java Mini Project | Abstract & Source Code Download

Purpose of the project

This Project Entitled as „INTRANET CHATTING‟ is used basically for chatting purpose with the remote clients or users on Internet or local networks. Here in this project a java client / server combination is used to chat with remote users. When a Client wants to chat with a user on a remote host, he sends a request to the Server with a identification name like chat-id, the server responds to the request by identifying the client-id which is already registered in the server domain and when matched his request is granted and the client can begin to chat with the remote users present on the internet or local network.

The power of Internet is such that it integrates together LANs located across diverse software and hardware forms into a single large communication network that spans the globe. The client needs to have a client software such as Netscape Navigator or Internet Explorer to retrieve information as well as chat on the www. WWW is referred to as Netsurfing. And it supports chatting, text, video and audio.

The benefit of using “INTRANET CHATTING” over other chatting tools is that, with the help of java, the programmer can create applet applications which can be use the internet as a server. Applets are machine independent and so java programs can run on any computer on the internet.

The term client/server is used in the context of networking, what it actually means. It is important to understand the terms client/server because the INTRANET CHATTTING project is supported completely by client/server model. A server is anything that has some resource that can be shared. There are compute servers, which provide computing power, web servers, which store web pages. A client is simply any other entity that wants to gain access to a particular server. The interaction between client\server is like an interaction between an electrical socket and a lamp. The server is a permanently available resource while client is free to “unplug” after it has been served. The program's premier feature is its whiteboard drawing utility. You can draw freehand, do circles, squares, lines, text, or paste image files to the canvas. This is ideal when users want to "sketch" concepts for one another. Users can interact publicly with everyone else on the server, or they can chat/draw privately using java Chat's "whisper mode". Users can create and manage chat rooms, which can be either "public" or "private". The server will also store and manage answering machine-style messages for users who aren't online, and instant messages can be sent to those who are. Additionally, users who aren't watching their screens can be paged with sound.

Continue Reading

An IEEE Project on Secure Computing: Detecting Anomalous Insiders in Collaborative Information Systems


Collaborative information systems (CISs) are deployed within a diverse array of environments that manage sensitive information. Current security mechanisms detect insider threats, but they are ill-suited to monitor systems in which users function in dynamic teams. In this paper, we introduce the community anomaly detection system (CADS), an unsupervised learning framework to detect insider threats based on the access logs of collaborative environments. The framework is based on the observation that typical CIS users tend to form community structures based on the subjects accessed CADS consists of two components: relational pattern extraction, which derives community structures and anomaly prediction, which leverages a statistical model to determine when users have sufficiently deviated from communities.

To empirically evaluate the framework, we perform an assessment with three months of access logs from a real electronic health record (EHR) system in a large medical center. The results illustrate our models exhibit significant performance gains over state-of-the-art competitors. When the number of illicit users is low, Meta CADS is the best model, but as the number grows, commonly accessed semantics lead to hiding in a crowd, such that CADS is more prudent.


In the existing experiment, the performance of the supervised classification models is significantly worse than the unsupervised models. The supervised models consistently have a lower true positive rate at all operating points. In the existing model is not correctly characterizing the intruders which access a larger number of records. Third, with respect to AUC, we observe the same trend as earlier regarding the dominance of the unsupervised models as a function of the mix rate.


In this project, we introduce a framework to detect anomalous insiders from the access logs of a CIS by leveraging the relational nature of system users as well as the meta information of the subjects accessed. The framework is called the community anomaly detection system, or CADS, and builds upon the work. To detect anomalous insiders in a CIS, we proposed CADS, a community anomaly detection system that utilizes a relational framework. To predict which users are anomalous, CADS calculates the deviation of users based on their nearest neighbor networks.

Our model is based on the observation that “normal” users tend to form communities, unlike illicit insiders. To evaluate the performance of our model, we conducted a series of experiments that compared our framework with the state-of-the-art anomaly detection methods for CIS systems. In the experiments, we mixed simulated users with the real users of a real electronic health record system. Our results illustrated that the community-based models exhibited better performance at detecting simulated insider threats.

Continue Reading

An IEEE Java Project: FADE- Secure Overlay Cloud Storage with File Assured Deletion


We address the problem of resource management for a large-scale cloud environment that hosts sites. Our contribution centers around outlining a distributed middleware architecture and presenting one of its key elements, a gossip protocol that meets our design goals: fairness of resource allocation with respect to hosted sites, efficient adaptation to load changes and scalability in terms of both the number of machines and sites. We formalize the resource allocation problem as that of dynamically maximizing the cloud utility under CPU and memory constraints. While we can show that an optimal solution without considering memory constraints is straightforward (but not useful), we provide an efficient heuristic solution for the complete problem instead. We evaluate the protocol through simulation and find its performance to be well aligned with our design goals.


In Existing system the outsource data backup to third-party cloud storage services will cost more for data management and security concerns arise in terms of ensuring the privacy and integrity of outsourced data.


Divide the data key into many key shares.


Time based no fine-grained control.


In proposed system we present FADE, a secure overlay cloud storage system that ensures file assured deletion and works seamlessly atop today’s cloud storage services. FADE decouples the management of encrypted data and encryption keys, such that encrypted data remains on third-party (untrusted) cloud storage providers, while encryption keys are independently maintained by a key manager service, whose trustworthiness can be enforced using a quorum scheme. FADE generalizes time-based file assured deletion (i.e., files are assuredly deleted upon time expiration) into a more fine-grained approach called policy based file assured deletion, in which files are associated with more flexible file access policies (e.g., time expiration, read/write permissions of authorized users) and are assuredly deleted when the associated file access policies are revoked and become obsolete.

Design Of Fade:

1.Work atop todays cloud as an overlay.
2.Achieve protection from cloud clients perspective,no changes on the cloud provider

Security Of Fade:

1.Fine-grained file assured deletion:Files are permanently inaccessible based on

Continue Reading

Java Project on ATM Machine Working with Source Code

This project will demonstrate you how an ATM machine works actually. We will upload base paper and abstract soon.

Continue Reading

15 Java Engineering Projects with Source Code & Documentations | Part 3

Continuation of 15[4-7] Java Engineering Projects with Source Code & Documentations | Part 2
8. Online Exam Project
  • This is an online examination project in which students can take the exam of any one of the listed subjects.
  • During the exam, any activity of violating rules is being checked question to question and time to time.
  • After the completion of the exam, all the answers would be corrected comparing the correct answers in the database.
  • The results will be declared and reported separately to each who take the exam.

9. Online Library System
  • Add, remove or view members
  • Add, remove or view books
  • Can lend books
  • Calculation of returning time
  • Generate reports
  • Authenticated users only can access

10. Online Shopping
  • Registration required
  • Login to see available products
  • Can add/remove products into cart
  • Cart is updated when anything new added
  • Can view list of products in cart
  • Checkout safely

11. Mobile Information System

Sorry about this project. We could only find PPT about this project. Hope it will help you!

Continue to 15[12-15] Java Engineering Projects with Source Code & Documentations | Part 4
Continue Reading

15 Java Engineering Projects with Source Code & Documentations | Part 2

Continuation of 15[1-3] Java Engineering Projects with Source Code & Documentations | Part 1

4. Project
Appointment form
Doctor's Registration Form

5. Project on Internet Banking

Project on Internet Banking

6. Java Mail Filter Project

  • Header Mail Filter
  • Mail Filter
  • MessageID Mail Filter
  • Null Mail Filter
  • Recipient Mail Filter
  • Sender Mail Filter
  • Size Mail Filter
  • Subject Mail Filter

7. Online Courses

  • Student/Professors registration
  • Search
  • Guestbook
  • Chat
  • Counter
  • Courses
  • Creation of lessons
  • Forum

Continue to 15[8-11] Java Engineering Projects with Source Code & Documentations | Part 3
Continue Reading

15 Java Engineering Projects with Source Code & Documentations | Part 1

Here are the 15 engineering projects on Java found in FaaDoO Engineers site. As these projects are simple and small, you can consider them doing in mini projects.

1. Airline Booking System
  • The theme of this project is that passengers can book the flights online according to their available dates and timings.
  • The reservation dates can be modified, canceled with the dismissal of some amount.
  • Registered passengers can login and check their status.
  • Online payment for the ticket booking is available for various types of payments.
  • Invoice can be generated after registration is successful.

2. Bug Tracking System


3. College Management System
Create different database tables for different data of the college.

How to create tables?
The following are the syntaxes to create tables for different databases of a college.

User Registration table:
create table userregistration(uname varchar(20),pwd varchar(20),repwd varchar(20),address varchar(30),dob date,contact number(15));

Faculty table:
create table faculty(facultyname varchar(30),branch varchar(30),year number(3),semester number(
2),experience number(2),subject varchar(30));
To insert data into the Faculty table,

insert into faculty values('swetha','cse',1,1,3,'c and ds');
insert into faculty values('vidya rani','cse',2,1,3,'computer organisation');
insert into faculty values('murali','cse',2,2,3,'dbms');
insert into faculty values('ramesh chandra','cse',3,1,3,'distributed systems');
insert into faculty values('ravi kumar','cse',3,2,3,'computer graphics');
insert into faculty values('dinakar','cse',4,1,3,'computer networks');
insert into faculty values('ekambaram naidu','cse',4,2,3,'software engineering');
insert into faculty values('murali','ece',1,1,3,'c and ds');
insert into faculty values('bhargavi','ece',1,1,3,'micro processors');
insert into faculty values('bhargav ram','eee',1,1,3,'network theory');
insert into faculty values('sundari','mech',1,1,3,'maths');
Results table:
create table results(hallticketno number primary key,subject varchar(25),internalmarks number(2
),externalmarks number(3));
To insert data in to the results table,
insert into results values(101,'maths',20,70);
insert into results values(102,'stld',18,70);
insert into results values(103,'ldic',17,70);
insert into results values(104,'co',16,70);
insert into results values(105,'java',19,70);
insert into results values(106,'daa',18,70);
insert into results values(107,'mp',17,70);
insert into results values(108,'edc',16,70);
insert into results values(109,'se',20,70);
Subjects table:
create table subject(subname varchar(30),branch varchar(30),year number(3),semester number(2),p
racticals varchar(20));
To insert data into Subjects table,
insert into subject values('maths','cse',1,1,'c lab');
insert into subject values('java','cse',2,1,'oops lab');
insert into subject values('dbms','cse',2,2,'sql lab');
insert into subject values('uml','cse',3,1,'uml lab');
insert into subject values('cn','cse',3,2,'cn lab');
insert into subject values('multi media','cse',4,1,'mmwd lab');
insert into subject values('cn','ece',3,2,'cn lab');
insert into subject values('cn','eee',3,2,'cn lab');

Library table:
create table library(hallticketno number(12),bookid number(5),bookname varchar(25),bookauthor
varchar(30),duedate date);
Inserting data into the Library table,
insert into library values(101,400,'complete reference java','herbert schild',15-mar-2007);
insert into library values(102,401,'c and data structures','balaguruswamy',10-mar-2007);
insert into library values(103,402,'computer organisation','william stallings',5-feb-2007);
insert into library values(104,403,'operating systems','william stallings',1-mar-2007);

Exam table:
create table examination(subject varchar(30),branch varchar(25),year number(2),semester number(
2),examdate date);
Inserting data into Exam table,
insert into examination values('se','cse',4,1,15-mar-2007);

Continue to 15[4-7] Java Engineering Projects with Source Code & Documentations | Part 2
Continue Reading

Online Shopping System Java Project With Source Code

Firstly I would like to inform you that we don’t have any abstract and base paper fro this project. Instead, we have only source code with us. The following are the some of the output screenshots of the code.







There exists a lot more screenshots for this project which we are not showing them all. You can download the source code from below link and check them out.


Download Source Code

Continue Reading

Doctor Availability Java Project with Source Code


Presently, our system for a patient to contact a doctor and take an appointment is possible only if patient goes to that particular doctors clinic or hospital. Even the people can’t get the correct information about doctors, their details and different hospitals available in a particular city. The only way to get all these are through directly contacting particular persons personally and it’s a very big problem for a person new to that city. Those who want to have some information in the medical field or wants to get appointment to particular doctor from his own place are not possible.


Hence it’s a very big problem for those who don’t have any idea of the medical field. A person suffering with some problem cannot get correct and immediate prescription or treatment until he meets the right doctor. This may cause or severe problems too. Nowadays in order to get correct information and right treatment for a patient has to go by him wherever needed. This is a lengthy process, which takes a lot of time to design manually, and also costs more and even limited to certain extent. It’s not possible to get all the information or details as well as we can’t satisfy the user through this process.



The new system or website consists of service availability on the Internet. It provides easiest way for all the doctors, patients and others to get all the information needed as quick as possible that too from anywhere in the world. The persons new to particular city can get all the information regarding all the different hospitals, doctors in any hospital data, their available timings data can be accessed in minutes.


Download Source Code

Continue Reading

Clustering with Multiviewpoint-Based Similarity Measure


All clustering methods have to assume some cluster relationship among the data objects that they are applied on. Similarity between a pair of objects can be defined either explicitly or implicitly. In this paper, we introduce a novel multiviewpoint-based similarity measure and two related clustering methods. The major difference between a traditional dissimilarity/similarity measure and ours is that the former uses only a single viewpoint, which is the origin, while the latter utilizes many different viewpoints, which are objects assumed to not be in the same cluster with the two objects being measured. Using multiple viewpoints, more informative assessment of similarity could be achieved. Theoretical analysis and empirical study are conducted to support this claim. Two criterion functions for document clustering are proposed based on this new measure. We compare them with several well-known clustering algorithms that use other popular similarity measures on various document collections to verify the advantages of our proposal.


Download Abstract

Download Basepaper

Continue Reading

Fast Data Collection in Tree-Based Wireless Sensor Networks


We investigate the following fundamental question - how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evaluate a number of different techniques using realistic simulation models under the many-to-one communication paradigm known as converge cast. We first consider time scheduling on a single frequency channel with the aim of minimizing the number of time slots required (schedule length) to complete a converge cast. Next, we combine scheduling with transmission power control to mitigate the effects of interference, and show that while power control helps in reducing the schedule length under a single frequency, scheduling transmissions using multiple frequencies is more efficient. We give lower bounds on the schedule length when interference is completely eliminated, and propose algorithms that achieve these bounds. We also evaluate the performance of various channel assignment methods and find empirically that for moderate size networks of about 100 nodes, the use of multi-frequency scheduling can suffice to eliminate most of the interference. Then, the data collection rate no longer remains limited by interference but by the topology of the routing tree. To this end, we construct degree-constrained spanning trees and capacitated minimal spanning trees, and show significant improvement in scheduling performance over different deployment densities. Lastly, we evaluate the impact of different interference and channel models on the schedule length.

Continue Reading

Footprint: Detecting Sybil Attacks in Urban Vehicular Networks


In urban vehicular networks, where privacy, especially the location privacy of anonymous vehicles is highly concerned, anonymous verification of vehicles is indispensable. Consequently, an attacker who succeeds in forging multiple hostile identifies can easily launch a Sybil attack, gaining a disproportionately large influence. In this paper, we propose a novel Sybil attack detection mechanism, Footprint, using the trajectories of vehicles for identification while still preserving their location privacy. More specifically, when a vehicle approaches a road-side unit (RSU), it actively demands an authorized message from the RSU as the proof of the appearance time at this RSU. We design a location-hidden authorized message generation scheme for two objectives: first, RSU signatures on messages are signer ambiguous so that the RSU location information is concealed from the resulted authorized message; second, two authorized messages signed by the same RSU within the same given period of time (temporarily linkable) are recognizable so that they can be used for identification. With the temporal limitation on the likability of two authorized messages, authorized messages used for long-term identification are prohibited. With this scheme, vehicles can generate a location-hidden trajectory for location-privacy-preserved identification by collecting a consecutive series of authorized messages. Utilizing social relationship among trajectories according to the similarity definition of two trajectories, Footprint can recognize and therefore dismiss “communities” of Sybil trajectories. Rigorous security analysis and extensive trace-driven simulations demonstrate the efficacy of Footprint.

Continue Reading

Catching Packet Droppers and Modifiers in Wireless Sensor Networks


Packet dropping and modification are common attacks that can be launched by an adversary to disrupt communication in wireless multi hop sensor networks. Many schemes have been proposed to mitigate or tolerate such attacks, but very few can effectively and efficiently identify the intruders. To address this problem, we propose a simple yet effective scheme, which can identify misbehaving forwarders that drop or modify packets. Extensive analysis and simulations have been conducted to verify the effectiveness and efficiency of the scheme.



Download Full Base paper

Download Full Abstract

Continue Reading

A Project Report On Computerized School Administration


In 1800 s where in Agricultural societies are  dominated by farmers . by 1900 s we had moved into an industrial society dominated by labour and management .by the 1950 s we had moved into a service oriented society where service based occupations offered greatest employment .today we clearly moved and highly skilled individuals ,who use brain power instead of physical effort.


Today our information based society allows human kind to this brain power through computers and communications .in an information society ,value is increased by knowledge as well as in this speed at which that knowledge moves.


Computer based information retrievel system offer more convenient flexible and comprehensive retrivel than manual information storage and retrivel system.


Now –a- days the use of computers have been study the increasing in science and technology .most of the advanced companies of the world have much advance in dis-respect ,but India has just made a start, of especially in industry and business and there is wittenessing stiff oppositions from the employees and there trade unions because of the fear of retrenchment.computers recent consequent in railways , libraries , shops , colleges etc.,

Download Full Project Report & Source Code

Continue Reading

A Project On ‘Adaptive Opportunistic Routing for Wireless Ad Hoc Networks’


A distributed adaptive opportunistic routing scheme for multi-hop wireless ad hoc networks is proposed. The proposed scheme utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an expected average per-packet reward criterion. The proposed routing scheme jointly addresses the issues of learning and routing in an opportunistic context, where the network structure is characterized by the transmission success probabilities. In particular, this learning framework leads to a stochastic routing scheme that optimally “explores” and “exploits” the opportunities in the network.

Download Full Abstract

Download Base Paper

Continue Reading

Shopping Mall Management System - JAVA Project with SRS & Report

Project Description:
In this project, we will be designing a simple shopping mall using object oriented technology. The mall will provide a soothing shopping experience for customers, while at the same time allowing us to explore design patterns and other features object oriented technology.
The requirements:
The system will allow more than one shop owner to set up different shops, to sell various products under one roof i.e. mall. The concept, at its very basic, provides for an environment that allows the following:
• Shop Owner:
o Any person wishing to setup shop in the mall can send a proposal to the mall owner.
o The mall owner approves the proposal and confirms the deal.
o Shop owners can then setup and maintain their own shop(s) in the Mall.
• Customers
o Customers when enter the mall have to authenticate themselves on a central server.
o After authentication, the customer is allocated a shopping cart and can enter a particular shop of his/her choice for shopping.
o After entering a shop, customer can brows through the products available in the shop, can select some of them and put into the shopping cart.
o Customer can anytime change the items in the cart either by adding new items or by removing existing items. Customer proceeds towards the payment counter. Finalize product list of items he finally wish to buy and make the final payment.
o He/She then leaves the shop and can either enter another shop or leave the mall.
• The prototype presented allows customers to purchase products from all the shops in the Mall.
Continue Reading

6 Awesome Java Mini Projects for CSE,IT,CSIT || Free Download

Continue Reading