Report 1

SAVITRIBAI PHULE PUNE UNIVERSITY
A PRELIMINARY PROJECT REPORT ON
Smart Hospitalization and Patient Review Analysis
SUBMITTED TOWARDS THE

PARTIAL FULFILLMENT OF THE REQUIREMENTS OF
BACHELOR OF ENGINEERING (Computer Engineering)

BY
Datre Gayatri N.
Exam No: B120294216
Deore Yograj D.
Exam No: B120294218
Jadhav Aakash V.
Exam No: B120294223
Marathe Kunal R.
Exam No: B120294243
Under The Guidance of

Prof. R. R. Tajanpure
DEPARTMENT OF COMPUTER ENGINEERING

NASHIK DISTRICT MARATHA VIDYA PRASARAK SAMAJS
KARMAVEER ADV. BABURAO GANPATRAO THAKARE
COLLEGE OF ENGINEERING
NASHIK - 422013
ACADEMIC YEAR: 2015-2016
KARMAVEER ADV. BABURAO GANPATRAO THAKARE

COLLEGE OF ENGINEERING
DEPARTMENT OF COMPUTER ENGINEERING
CERTIFICATE
This is to certify that the Project Entitled
SMART HOSPITALIZATION AND PATIENT REVIEW ANALYSIS
Datre Gayatri N.
Exam No: B120294216
Deore Yograj D.
Exam No: B120294218
Jadhav Aakash V.
Exam No: B120294223
Marathe Kunal R.
Exam No: B120294243
is a bonafide work carried out by Students under the supervision of Prof. R. R.

Tajanpure and it is submitted towards the partial fulfillment of the requirement of
Bachelor of Computer Engineering Project.
Prof. R. R. Tajanpure
Internal Guide
Dept. of Computer Engg.
Prof. ....................
Signature of Examiner
Prof. B. S. Tarle
H.O.D
Dept. of Computer Engg.
Prof. Dr. Jayant T. Pattiwar

Principal
Abstract
For the health and care we always need an hospital but in real life it is complicated
to go to the doctor and carry all records of our previous treatment. In case of emergency, If a patients doesnt have his own record with him, it will be troublesome for
him. Think, all these becoming easy we do not need to carry our records in hard
copy format using smart hospitalization technique. With so many hospitals and no.
of doctors it is difficult to find one who is best for a particular treatment. So it could
be easy to find one doctor based upon the patients review. In this project we are implementing the smart hospitalization in which patient can login using unique id and
can see all previous history of his own diseases, which can be useful for the doctor,
patient, pathologist as well as chemist. In case of emergency user can find ambulance which is near by user. We find nearest ambulance using reverse geocoding
algorithm and KNN algorithm, we can obtain user location using reverse geocoding
which convert geographic point into human readable address. It will be accessible
either by an administrator, only they can add data into the database. The interface
is going to be user-friendly. This will help to reduce the paper work at a greater
extent. Based on doctors treatment patient can give his feedback on the website or
using their smart phone. On the basis of patients feedback doctors can be rated as per
their treatment and charges. This could help others to find good doctors based upon
the patients rating. We will be analysing patients comment using sentiment analysis
Algorithm, which referred to as opinion mining, although the emphasis in this case
is on extraction using keywords like, dislike/like, good/bad this sentiment analysis
algorithm can be used for the priority wise listing of the doctor.
Keywords: Sentiment Analysis, Opinion mining, Patient Review, Reverse geocoding,
KNN algorithm
KBTCOE, Department of Computer Engineering 2015
Acknowledgments
It gives us great pleasure in presenting the preliminary project report on Smart

Hospitalization and Patient Review Analysis.
We would like to take this opportunity to thank my internal guide Prof. R. R. Tajanpure for giving us all the help and guidance we needed. We are really grateful to
them for her kind support. Their valuable suggestions were very helpful.
We are also grateful to Prof. Balasaheb S. Tarle, Head of Computer Engineering

Department, KBTCOE for his indispensable support, suggestions.
With deep sense of gratitude we thank to our Principal Prof. Dr. Jayant T. Pattiwar
and Management of the NDMVPS KBTCOE for providing all necessary facilities
and their constant encouragement and support.
We are ending this acknowledgement with deep indebtedness to our friends who have
helped us.
Datre Gayatri N.
Deore Yograj D.
Jadhav Aakash V.
Marathe Kunal R.
(B.E. Computer Engg.)
II
INDEX
1
Synopsis
1.1
Project Title . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.2
Project Option . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.3
Internal Guide . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.4
Sponsorship and External Guide . . . . . . . . . . . . . . . . . . .
1.5
Technical Keywords (As per ACM Keywords) . . . . . . . . . . . .
1.6
Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . .
1.7
Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1.8
Goals and Objectives . . . . . . . . . . . . . . . . . . . . . . . . .
1.9
Relevant mathematics associated with the Project . . . . . . . . . .
1.10 Names of Conferences / Journals where papers can be published . .
1.11 Review of Conference/Journal Papers supporting Project idea . . . .
1.12 Plan of Project Execution . . . . . . . . . . . . . . . . . . . . . . .
Technical Keywords
2.1
Area of Project . . . . . . . . . . . . . . . . . . . . . . . . . . . .
2.2
Technical Keywords . . . . . . . . . . . . . . . . . . . . . . . . . .
Introduction
10
3.1
Project Idea . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
11
3.2
Motivation of the Project . . . . . . . . . . . . . . . . . . . . . . .
11
3.3
Literature Survey . . . . . . . . . . . . . . . . . . . . . . . . . . .
11
Problem Definition and scope
15
4.1
16
Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . .
4.1.1
Goals and objectives . . . . . . . . . . . . . . . . . . . . .
16
4.1.2
Statement of scope . . . . . . . . . . . . . . . . . . . . . .
17
4.2
Major Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . .
17
4.3
Methodologies of Problem solving and efficiency issues . . . . . . .
18
4.4
Outcome . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
18
4.5
Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
18
4.6
Hardware Resources Required . . . . . . . . . . . . . . . . . . . .
18
4.7
Software Resources Required . . . . . . . . . . . . . . . . . . . . .
19
Project Plan
20
5.1
Project Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . .
21
5.1.1
Reconciled Estimates . . . . . . . . . . . . . . . . . . . . .
21
5.1.2
Project Resources . . . . . . . . . . . . . . . . . . . . . . .
22
Risk Management w.r.t. NP complete analysis . . . . . . . . . . . .
22
5.2.1
Risk Identification . . . . . . . . . . . . . . . . . . . . . .
22
5.2.2
Risk Analysis . . . . . . . . . . . . . . . . . . . . . . . . .
22
5.2.3
Overview of Risk Mitigation, Monitoring, Management . .
22
Project Schedule . . . . . . . . . . . . . . . . . . . . . . . . . . .
22
5.3.1
Project task set . . . . . . . . . . . . . . . . . . . . . . . .
22
5.3.2
Task network . . . . . . . . . . . . . . . . . . . . . . . . .
24
5.3.3
Timeline Chart . . . . . . . . . . . . . . . . . . . . . . . .
25
Team Organization . . . . . . . . . . . . . . . . . . . . . . . . . .
26
5.4.1
Team structure . . . . . . . . . . . . . . . . . . . . . . . .
26
5.4.2
Management reporting and communication . . . . . . . . .
26
5.2
5.3
5.4
Software requirement specification
27
6.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
28
6.1.1
Purpose and Scope of Document . . . . . . . . . . . . . . .
28
6.1.2
Overview of responsibilities of Developer . . . . . . . . . .
28
Usage Scenario . . . . . . . . . . . . . . . . . . . . . . . . . . . .
28
6.2.1
User profiles . . . . . . . . . . . . . . . . . . . . . . . . .
28
6.2.2
Use-cases . . . . . . . . . . . . . . . . . . . . . . . . . . .
29
6.2
IV
6.2.3
6.3
6.4
Use Case View . . . . . . . . . . . . . . . . . . . . . . . .
30
DATA MODEL AND DESCRIPTION . . . . . . . . . . . . . . .
31
6.3.1
Data Description . . . . . . . . . . . . . . . . . . . . . . .
31
6.3.2
Data objects and Relationships . . . . . . . . . . . . . . . .
31
FUNCTIONAL MODEL AND DESCRIPTION . . . . . . . . . . .
31
6.4.1
Data Flow Diagram . . . . . . . . . . . . . . . . . . . . .
31
6.4.2
Activity Diagram: . . . . . . . . . . . . . . . . . . . . . .
32
6.4.3
Non Functional Requirements: . . . . . . . . . . . . . . . .
33
6.4.4
State Diagram: . . . . . . . . . . . . . . . . . . . . . . . .
34
6.4.5
Design Constraints . . . . . . . . . . . . . . . . . . . . . .
34
6.4.6
Software Interface Description . . . . . . . . . . . . . . . .
34
Detailed Design Document using Appendix A and B
36
7.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
37
7.2
Architectural Design . . . . . . . . . . . . . . . . . . . . . . . . .
37
7.3
Sentiment Analysis . . . . . . . . . . . . . . . . . . . . . . . . . .
38
7.3.1
Sentiment Algorithm . . . . . . . . . . . . . . . . . . . . .
39
7.3.2
Working of Sentiment Algorithm . . . . . . . . . . . . . .
40
Reverse geocoding . . . . . . . . . . . . . . . . . . . . . . . . . .
42
7.4
7.4.1
Geocoding (Latitude/Longitude Lookup) Required parameters in a geocoding request . . . . . . . . . . . . . . . . . .
7.5
7.6
K Nearest Neighbours
42
. . . . . . . . . . . . . . . . . . . . . . . .
42
7.5.1
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . .
43
7.5.2
How can distance can be calculated . . . . . . . . . . . . .
46
Google Map Direction Api . . . . . . . . . . . . . . . . . . . . . .
48
7.6.1
48
Implementation: . . . . . . . . . . . . . . . . . . . . . . .
Project Implementation
51
8.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
52
8.2
Tools and Technologies Used . . . . . . . . . . . . . . . . . . . . .
52
8.3
Methodologies/Algorithm Details . . . . . . . . . . . . . . . . . .
52
8.3.1
52
Sentiment analysis Pseudo Code . . . . . . . . . . . . . . .
8.3.2
8.4
9
KNN Algorithm Pseudo Code . . . . . . . . . . . . . . . .
53
Verication and Validation for Acceptance . . . . . . . . . . . . . .
53
Software Testing
54
9.1
Type of Testing Used . . . . . . . . . . . . . . . . . . . . . . . . .
55
9.1.1
Unit Testing . . . . . . . . . . . . . . . . . . . . . . . . . .
55
9.1.2
Integration Testing . . . . . . . . . . . . . . . . . . . . . .
55
9.1.3
System Testing . . . . . . . . . . . . . . . . . . . . . . . .
56
Test Cases and Test Results . . . . . . . . . . . . . . . . . . . . . .
57
9.2.1
Unit Testing . . . . . . . . . . . . . . . . . . . . . . . . . .
57
9.2.2
Integration Testing . . . . . . . . . . . . . . . . . . . . . .
58
9.2.3
System Testing . . . . . . . . . . . . . . . . . . . . . . . .
58
9.2
10 Results
59
10.1 Screen shots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
60
10.1.1 Login page . . . . . . . . . . . . . . . . . . . . . . . . . .
60
10.1.2 Registration . . . . . . . . . . . . . . . . . . . . . . . . . .
61
10.1.3 Validation . . . . . . . . . . . . . . . . . . . . . . . . . . .
62
10.2 Outputs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
63
11 Deployment and Maintenance
65
11.1 Installation and un-installation . . . . . . . . . . . . . . . . . . . .
66
11.1.1 User Side . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
11.1.2 Admin Side . . . . . . . . . . . . . . . . . . . . . . . . . .
66
11.2 User help . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
11.2.1 Home: . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
11.2.2 About Us: . . . . . . . . . . . . . . . . . . . . . . . . . . .
66
11.2.3 Contact Us: . . . . . . . . . . . . . . . . . . . . . . . . . .
67
12 Summary and Conclusion
68
BIBLIOGRAPHY
69
13 References
70
VI
Annexure A Laboratory assignments on Project Analysis of Algorithmic

Design
72
A.1 Assignment No.: 1 . . . . . . . . . . . . . . . . . . . . . . . . . .
73
A.2 Assignment No.: 2 . . . . . . . . . . . . . . . . . . . . . . . . . .
74
Annexure B Laboratory assignments on Project Quality and Reliability

Testing of Project Design
79
B.1 Assignment No.: 3 . . . . . . . . . . . . . . . . . . . . . . . . . .
80
B.2 Assignment No.: 4 . . . . . . . . . . . . . . . . . . . . . . . . . .
82
B.3 UML Diagrams: . . . . . . . . . . . . . . . . . . . . . . . . . . . .
82
B.3.1
Use Case Diagram . . . . . . . . . . . . . . . . . . . . . .
82
B.3.2
Class Diagrams . . . . . . . . . . . . . . . . . . . . . . . .
83
B.3.3
Package Diagram . . . . . . . . . . . . . . . . . . . . . . .
84
B.3.4
Activity Diagram
. . . . . . . . . . . . . . . . . . . . . .
85
B.3.5
Sequence Diagram . . . . . . . . . . . . . . . . . . . . . .
89
B.3.6
Component Diagram . . . . . . . . . . . . . . . . . . . . .
90
B.4 Assignment No.5 . . . . . . . . . . . . . . . . . . . . . . . . . . .
91
Annexure C Project Planner
92
Annexure D Reviewers Comments of Paper Submitted
94
Annexure E Plagiarism Report
96
VII
List of Figures
1.1
Functional Diagram . . . . . . . . . . . . . . . . . . . . . . . . . .
6.1
Use case diagram . . . . . . . . . . . . . . . . . . . . . . . . . . .
30
6.2
Level 0 Data Flow Diagram . . . . . . . . . . . . . . . . . . . . . .
31
6.3
Level 1 Data Flow Diagram . . . . . . . . . . . . . . . . . . . . . .
31
6.4
Activity Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . .
32
6.5
State Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
34
7.1
System Architecture for smart Hospital . . . . . . . . . . . . . . .
37
7.2
System Architecture for Ambulance . . . . . . . . . . . . . . . . .
38
7.3
Distance function . . . . . . . . . . . . . . . . . . . . . . . . . . .
43
7.4
Hamming distance . . . . . . . . . . . . . . . . . . . . . . . . . .
44
7.5
Find out nearest neighbours . . . . . . . . . . . . . . . . . . . . . .
44
7.6
Flow chart for Ambulance . . . . . . . . . . . . . . . . . . . . . .
47
10.1 Login Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . .
60
10.2 Registration Diagram . . . . . . . . . . . . . . . . . . . . . . . . .
61
10.3 Validation Diagram . . . . . . . . . . . . . . . . . . . . . . . . . .
62
10.4 Output 1 2 3 4 Diagram . . . . . . . . . . . . . . . . . . . . . . . .
63
10.5 Output 5 6 7 8 Diagram . . . . . . . . . . . . . . . . . . . . . . . .
64
B.1 Functional Diagram . . . . . . . . . . . . . . . . . . . . . . . . . .
81
B.2 Usecase Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . .
82
B.3 Class Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
83
B.4 Package Diagram . . . . . . . . . . . . . . . . . . . . . . . . . . .
84
B.5 Activity Diagram for patient . . . . . . . . . . . . . . . . . . . . .
85
B.6 Activity Diagram for Doctor . . . . . . . . . . . . . . . . . . . . .
86
B.7 Activity Diagram for Chemist . . . . . . . . . . . . . . . . . . . .
87
B.8 Activity Diagram for pathologist . . . . . . . . . . . . . . . . . . .
88
B.9 Sequence Diagram . . . . . . . . . . . . . . . . . . . . . . . . . .
89
B.10 Component Diagram . . . . . . . . . . . . . . . . . . . . . . . . .
90
E.1 Plagarism reprt . . . . . . . . . . . . . . . . . . . . . . . . . . . .
97
IX
List of Tables
1.1
Project Planner . . . . . . . . . . . . . . . . . . . . . . . . . . . .
4.1
Hardware Requirements . . . . . . . . . . . . . . . . . . . . . . .
18
5.1
Time Estimates . . . . . . . . . . . . . . . . . . . . . . . . . . . .
22
5.2
Risk Table . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
23
5.3
Risk Probability definitions . . . . . . . . . . . . . . . . . . . . . .
23
5.4
Risk Impact definitions . . . . . . . . . . . . . . . . . . . . . . . .
23
5.5
Risk 1 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
24
5.6
Risk 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
24
5.7
Dependency for generating the optimal path . . . . . . . . . . . . .
25
5.8
System Implementation Plan: . . . . . . . . . . . . . . . . . . . . .
25
6.1
Use Cases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
29
7.1
Euclidean Distance . . . . . . . . . . . . . . . . . . . . . . . . . .
45
7.2
Standarized Distance . . . . . . . . . . . . . . . . . . . . . . . . .
46
9.1
Unit Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
57
9.2
Integration Testing . . . . . . . . . . . . . . . . . . . . . . . . . .
58
9.3
System Testing . . . . . . . . . . . . . . . . . . . . . . . . . . . .
58
A.1 Idea Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
73
B.1 Test case . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
91
C.1 Project Planner . . . . . . . . . . . . . . . . . . . . . . . . . . . .
93
CHAPTER 1
SYNOPSIS
1.1
PROJECT TITLE
Smart Hospitalization and Patient Review Analysis

1.2
PROJECT OPTION
Internal project
1.3
INTERNAL GUIDE
Prof.R. R. Tajanpure
1.4
SPONSORSHIP AND EXTERNAL GUIDE
No sponsorship
1.5
TECHNICAL KEYWORDS (AS PER ACM KEYWORDS)

Sentiment Analysis:- The sentiment analysis shows the all the description
about the patient comments and analysis of the comment or review system
can recommended doctor.
Reverse Geocoding:- Reverse geocoding is the process of converting geographic coordinates into a human readable address.
Patient Review:- In this patient can comment and review according to the doctor treatement.
KNN algorithm:-By using this algorithm we can find nearest ambulance form
the user.
1.6
PROBLEM STATEMENT
Now a days every person needs a doctor so we need to carry our records in hard
copy format which is complicated. Whenever we go to the doctor we always need
to carry our records in paper format. In any emergency if our records are not with
us then it will be troublesome for patient as well as doctor. Doctor also need to give
his treatment and write the medicines records in paper format of patient. Sometimes
files are missed by patient. So doctor can not able to give a particular treatment to the
patient. This is so much time consuming .In this whole process patients time as well
as doctors time can be waste and also increase paper work. So too much work has
to be done. Patient also cannot be able to give his information to the doctor in any
emergency. Doctor give his medicines to the patient in paper format and then patient
have to go to the chemist and buy the medicines. Sometimes that receipt may lost
and patient cant buy his particular medicines for a particular disease. Sometimes
doctor tells to the patient to perform particular tests and the result of his previous
treatment can be missed by a patient. So it will be also troublesome for patient as
well as pathologist. Difficult to find ambulance which is near by its location from
patient.
1.7
ABSTRACT
For the health and care we always need an hospital but in real life it is complicated to go to the doctor and carry all records of our previous treatment. In
case of emergency, If a patients doesnt have his own record with him, it will
be troublesome for him. Think, all these becoming easy we do not need to
carry our records in hard copy format using smart hospitalization technique.
With so many hospitals and no. of doctors it is difficult to find one who is best
for a particular treatment. So it could be easy to find one doctor based upon the
patients review. In this project we are implementing the smart hospitalization
in which patient can login using unique id and can see all previous history of
his own diseases, which can be useful for the doctor, patient, pathologist as
well as chemist. In case of emergency user can find ambulance which is near
by user. We find nearest ambulance using reverse geocoding algorithm and
KNN algorithm,we can obtain user location using reverse geocoding which
convert geographic point into human readable address. It will be accessible
either by an administrator, only they can add data into the database. The interface is going to be user-friendly. This will help to reduce the paper work
at a greater extent. Based on doctors treatment patient can give his feedback
on the website or using their smart phone. On the basis of patients feedback
doctors can be rated as per their treatment and charges. Which could help
others to find good doctors based upon the patients rating. We will be analyzing patients comment using sentiment analysis Algorithm, which referred to
as opinion mining, although the emphasis in this case is on extraction using
keywords like, dislike/like, good/bad this sentiment analysis algorithm can be
used for the priority wise listing of the doctor.
Keywords: Sentiment Analysis, Opinion mining, Patient Review, Reverse geocoding, KNN algorithm
1.8
GOALS AND OBJECTIVES

Currently for health and care we need to carry our records in hard copy format,
which is so complicated and doctor also need to give his treatment and write
medicines in the paper format. So in this project we are going to assign a
unique ID for each patient and all his records will stored in his database. We
also display location of ambulance near by patient in that patient family can
call ambulance which is near by our location.
Usefulness of the project is that patient can be recommended for the best doctor which is best for a particular treatment from the patients comment analysis
and also this project reduces paper work and time.
User can trace the ambulance which is near by its location.
1.9
RELEVANT MATHEMATICS ASSOCIATED WITH THE PROJECT
Mathematical Model:
Let S be a system
Such that S=I,F,O
where,
I represents the set of inputs;
I=I1,I2,I3,I4,I5,I6
I1=Enter the user name and password
I2=LogIn the user
I3=Add review by patient
I4=add medicine by doctor
I5=Add lab report by labrotarian
I6=patient Location
I7=Ambulance Location
I8=Logout the user
F is the set of functions;

F=F1,F2,F3,F4,F5
F1=Login into the system( )
F2= Add medicine( )
F3= Add lab report( )
F4= Recommended doctor( )
F5= Calculate the distance from patient location and ambulance
F6= Select the minimum distance and visit it.
F7= Logout to the system( )
O is the set of outputs;

O=O1,O2,O3
O1=Display user database
O2=Display recommended doctor
O3= Optimal path for the patient from ambulance location.
O4= logout from the system
Figure 1.1: Functional Diagram

1.10
NAMES OF CONFERENCES / JOURNALS WHERE PAPERS CAN

BE PUBLISHED
International Journal for Scientific Research and Development.

1.11
REVIEW OF CONFERENCE/JOURNAL PAPERS SUPPORTING PROJECT

IDEA
Atleast 10 papers + White papers or web references Brief literature survey [

Description containing important description of at least 10 papers
1.12
PLAN OF PROJECT EXECUTION

Month
July
Schedule
1st week
3rd week
August
1st week
2nd week
3rd week
September
1st week
2nd week
3rd week
4th week
October
1st week
2nd week
3rd week
December
1st week
3rd week
4th week
January
February
1st week
3rd week
4th week
1st week
2nd week
3rd week
4th week
Project Task
Idea about Project Selection
/Project Topic
Guide Allocation and
Abstract submitted
To Display list of project
groups with guide name
Study of the selected
project topic
First Presentation with Guide
about idea of Projects. Requirement
Analysis (SRS document)
Preparation And Submission
Use case diagram on paper
and Five UML diagrams in software
Literature survey and synopsis submitted to guide
Prepare PPT and finalized with guide
Project assignments P/NP
complete, mathematical model
Demo given with PPT
And Submission Prelim Report of
the Project
Prepare synopsis and finalize
with guide
Prepare report in latex and
finalize with guide
Start working on first module of our
project i.e. sentiment analysis
Check the first module with guide
Start working on second module of our project
i.e. Reverse geocoding
Start working on databases for review analysis
Check the second module with guide
Show the database designed to guide
Start working on nearest location trace
Working on review analysis using sentiment analysis
Discuss with guide the work done and if
required changes to be done.
Table 1.1: Project Planner
CHAPTER 2
TECHNICAL KEYWORDS
2.1
AREA OF PROJECT
Android and Web Devlopment

2.2
TECHNICAL KEYWORDS
Sentiment Analysis:- The sentiment analysis shows the all the description
about the patient comments and analysis of the comment or review system
can recommended doctor.
Reverse Geocoding:- Reverse geocoding is the process of converting geographic coordinates into a human readable address.
Patient Review:- In this patient can comment and review according to the doctor treatement.
KNN algorithm:-By using this algorithm we can find nearest ambulance form
the user.
CHAPTER 3
INTRODUCTION
3.1
PROJECT IDEA
This application is aimed to automate the Smart Hospitalization. This project
is mainly to develop mainly for patient, doctor, chemist and pathologist. The
purpose of the project entitled as SMART HOSPITALIZATION AND PATIENT REVIEW ANALYSIS is to develop an application which is user friendly,
simple, fast and effective. Its deals with the collection of patients information,
doctors information, chemist information, pathologist information, medicine
detail, lab detail and with the help of patient review we recommended the doctor who is best for particular disease in particular area. Traditionally, it was
done manually. In this patient can find ambulance location. The main function
of the system is to register and store patient details, doctor details, chemist
detail and pathologist detail and retrieve these details as and when required.
Now a days we always need a hospital for health and care we need to carry our
old records with us but in this project whole paper work can be reduced and
we dont need it to carry with us. Patient can login using unique ID and can
get all previous history of our diseases. We can find best doctor for particular
treatment using the sentiment analysis.
3.2
MOTIVATION OF THE PROJECT

Motivation of the Project came for changing the old system to online system.
Its a smart approach towards building a Smart application for patient, chemist,
doctor, pathologist. Application provides a large scope of more entrepreneurs
coming out for smart hospital.
3.3
LITERATURE SURVEY
Existing System:
Now a day every person needs a doctor. So we need to carry our records in hard
copy format which is complicated. Whenever we go to the doctor we always
need to carry our records in paper format. In any emergency if our records
are not with us then it will be troublesome for patient and doctor. Doctor also
11
needs to give his treatment and write the medicines and patients records in
paper format. Sometimes files are missed by patient so doctor cannot able to
give a particular treatment to the patient. This is so much time consuming.
In this whole process patients time as well as doctors time can be waste
and also increase paper work so too much work has to be done. Patient also
cannot be able to give his information to the doctor in any emergency. Doctor
gives his medicines to the patient in paper format and then patient have to go
to the chemist and buy the medicines. Sometimes that receipt may lost and
patient cant buy his particular medicines for a particular disease. Sometimes
doctor tells to the patient to perform particular tests and the result of his previous treatment can be missed by a patient. So it will be also troublesome for
patient as well as pathologist. So in this existing system there are number of
a problem which is suffered by patient, doctor, chemist and pathologist. If Patient go somewhere like in any city and he suffers from a illness then it will be
also too much difficult task to and a particular doctor for a particular disease.
He need to ask anyone or any another person that where should I go? And
the decision given by another person may not be correct and patient can be
suffered a lot due to his wrong decision. In existing system to and ambulance
nearby patient is difficult task ambulances are having necessary equipment for
life support as provided by Government India, the provider would man these
ambulances with trained persons. On receipt of instructions from call centre, ambulance corms the location of the incident and starts immediately, after
reaching the location, the ambulance persons should be ensure scene safety
before reaching the victim. After attending the patient, the emergency medical
technician would assess the need for ambulance transport. In case no emergency exists, or inter facility request, would inform the call centre for further
instructions, and proceed according to instructions of call centre. It is a time
consuming process.
In the advancing process of hospital informatization, the popularity and
partial using of HIS (hospital information system) has made the hospital achieve
certain degree of informatization. Nevertheless, it also has some deficiencies,
12
such as manual input of medical Information, fixed information point, fixed

networking mode, single function, relatively independent between each department [1] and so on, which seriously restrict the construction of hospital
informatization.
For solving the problems rapid rise of internet of things has provided a
new idea. Internet of things (IOT), the fourth time industry technological revolution of world information, following technological revolution of computer,
internet and mobile communication network, is a network connecting any
items with internet to implement information exchange and communication,
furthermore to implement intelligent recognition, positioning, tracking, monitoring and management, by means of radio frequency identification (RFID),
infrared Sensors, GPS, laser scanners and other information sensing equipment, according to conventional protocol [2]. It uses internet technology RFID
technology. It is having an application framework Application framework is
the embodiment of architecture. On the whole, it follows smart hospitals architecture with three general layers, composed of perception layer, network
layer and application layer, but it should be specific and detailed according to
hospital actual scene, as shown in figure 3, consisting of 7 layers, from below
in sequence of goods on first layer, connection with objects and perception of
information on second layer , network fusion on third layer, data fusion on
fourth layer, integration of service on fifth layer, unified portal and identity
authentication on sixth layer , and user of seventh layer. The first layer and
seventh layer are added in order to ensure the integrity of the frame, needing
no introduction, second layer is corresponding to perception layer in general
architecture , third layer is corresponding to network layer in general architecture , and fourth, fifth and sixth layer is corresponding to application layer
architecture in general architecture . Next, emphatically introduces network
fusion layer, data fusion layer, service layer and user layer.
Propose system:
In our proposed system, to overcome all this problem smart hospitalization
can be done, we can store all information about patient in digital format on
13
centralized database and user can see that information at any time form anywhere. Doctor, Chemist, Pathologist can also see required data on his screen.
In this project when doctor login to his account, can see all previous history
of medicinal records, disease and can give prescription to the patient. These
prescriptions are received by chemist after his login. Chemist also can see any
allergic drugs for the patient. Pathologist can update all test reports which is
received by doctor and patient.
There is an admin panel which manages doctor, chemist, pathologist, patients login account and ambulance record. This is database administrator for
handling over all databases.
Our project covers this entire problem related to patients health. Which
provide improved a secure health care quality and doctor can be recommended
as per his feedback given by a patient using sentiment analysis [1] .We take
all the words and phrases that imply positive or negative sentiment, and apply
rules that consider how context might affect the tone of the content. Carefully crafted rules help our application. With the help of user feedback we
can and the best doctor for particular treatment using opining mining [3]. In
our proposed system user can see ambulance location near by user. In case of
emergency user can and ambulance which is near by patient. We and nearest
ambulance using reverse geocoding [4] and KNN algorithm [8], which convert
geographic point into human readable address and by using Euclidean distance formula we can calculate the distance form user location to ambulance.
There are some limitations for using KNN algorithm which can be overcome
by Google API. Path from ambulance driver to the person can be recognized
using Google API maps, which gives the correct direction to the ambulance
driver to pick up the patient in emergency. Online hotel services such as food
panda[6], Uses the customers review to rate a particular restaurant. Similar
rating method would be adopted in rating Doctors in our implemented system.
For ambulance services the concept of OLA Cabs[7] would be implemented.
14
CHAPTER 4
PROBLEM DEFINITION AND SCOPE
4.1
PROBLEM STATEMENT
Now a days every person needs a doctor so we need to carry our records in hard
copy format which is complicated. Whenever we go to the doctor we always need
to carry our records in paper format. In any emergency if our records are not with
us then it will be troublesome for patient as well as doctor. Doctor also need to give
his treatment and write the medicines records in paper format of patient. Sometimes
les are missed by patient. So doctor can not able to give a particular treatment to the
patient. This is so much time consuming .In this whole process patients time as well
as doctors time can be waste and also increase paper work. So too much work has
to be done. Patient also cannot be able to give his information to the doctor in any
emergency. Doctor give his medicines to the patient in paper format and then patient
have to go to the chemist and buy the medicines. Sometimes that receipt may lost
and patient cant buy his particular medicines for a particular disease. Sometimes
doctor tells to the patient to perform particular tests and the result of his previous
treatment can be missed by a patient. So it will be also troublesome for patient as
well as pathologist. It is also difficult to find best doctor for particular treatment. by
accepting patient review and with the help of sentiment analysis we find best doctor
for that treatment. Here also difficult to nd ambulance which is near by its location
from patient, so by using reverse geocoding we obtain the user location and using
KNN algorithm we can find nearest ambulance form the patient.
4.1.1
Goals and objectives
Goal and Objectives:

The importance of making correct decisions based on obtaining the right information at the right time is absolutely critical in healthcare services for patients
and providers.
Timely information on where and when patient received services.
To get ambulance for patient which is near by patient location.
Timely cost management.
16
Paper less and space less.

Patient safety.
4.1.2
Statement of scope
The final product gives us the effective comparison based on the system and
the present system used for the hospital management system.
The scope of comparison is limited because of using less comparison operators but the proposed system gives the extra features. This overcomes the all
problems which are in existing system.
The sentiment analysis shows the all the description about the patient comments.
Reverse geocoding is the process of converting geographic coordinates into a
human-readable address.
In addition, system gives the recommendation of doctor to the patient based
on his comments and get ambulance for patient which is near by location of
patient.
4.2
MAJOR CONSTRAINTS
Data base management is the most important task.
For the user can enter the information and also can update it time to time.
Using Google API system can be design.
Using smart phone patient can comment or patient comment on the website.
Analysis of the comment can be done daily. For giving the best performance
to the user.
The major constraint that will affect the performance system is that if the location of patient and ambulance is not traced properly.
17
4.3
METHODOLOGIES OF PROBLEM SOLVING AND EFFICIENCY ISSUES

The single problem can be solved by different solutions. Different review
analysis algorithms can be used like Subjective lexicon, using N-Gram modeling which are based on Sentiment Analysis. Different shortest path algorithm
used like dijisktra algorithm, distance measurement, using reverse geocoding
we can trace location of user.
4.4
OUTCOME
Display his own record of user.
Patient can find best doctor for particular disease.
User can trace ambulance.
4.5
APPLICATION
Hospital
4.6
HARDWARE RESOURCES REQUIRED

Sr. No.
Parameter
Minimum Requirement
Processor
Intel Dual Core and above
RAM
4GB DDR
Device
Android OS
Table 4.1: Hardware Requirements
18
4.7
SOFTWARE RESOURCES REQUIRED
Platform :
1. Operating System: Windows/ Linux
2. IDE: Eclipse IDE/ Android Studio/ Adobe dream viewer
3. Programming Language: JAVA/ XML/ PHP
4. Database: MySQL
19
CHAPTER 5
PROJECT PLAN
5.1
PROJECT ESTIMATES
Project phases for software development using the Waterfall Model
Analysis
The product development team analyzes the requirements, and fully understands the problems. This is a research phase that includes no building. The
team attempts to ask all the questions and secure all the answers they need to
build the product requirement.
Design
The software developers design a technical solution to the problems set out by
the product requirements, including scenarios, layouts and data models. This
phase is usually accompanied by documentation for each requirement, which
enables other members of the team to review it for validation.
Implementation
Once the design is approved, technical implementation begins. This is often
the shortest phase because research and design have been done in advance.
Testing
Upon completion of full implementation, testing needs to occur before the
product can be released to customers. The software testing team will use the
design documents, personas and user case scenarios delivered by the product
manager in order to create their test cases.
5.1.1
5.1.1.1
Reconciled Estimates
Cost Estimate
Database = 5000/
21
5.1.1.2
Time Estimates
Steps
Estimate(days)
Requirement
20
Design
30
Implementation
25
Verification
15
Maintainance
15
Table 5.1: Time Estimates
5.1.2
Project Resources
Project resources [People, Hardware, Software, Tools and other resources] based on
Memory Sharing, IPC, and Concurrency derived using appendices to be referred.
5.2
RISK MANAGEMENT W.R.T. NP COMPLETE ANALYSIS
This section discusses Project risks and the approach to managing them.
5.2.1
Risk Identification
Full-filling the realistic expectation of end users.

5.2.2
Risk Analysis
The risks for the Project can be analyzed within the constraints of time and quality
5.2.3
Overview of Risk Mitigation, Monitoring, Management
Following are the details for each risk.

5.3
5.3.1
PROJECT SCHEDULE
Project task set
Major Tasks in the Project stages are:
22
ID
Risk Description
Impact
Probability
Schedule
Quality
Overall
Medium
High
High
High
GPS not available in the device
Slow Internet connectivity
Low
Medium
High
High
Current location not entered

correctly by user
Low
Medium
Medium
Medium
Table 5.2: Risk Table

Probability
Value
Description
High
Probability of occurrence is
> 75%
Medium
26 75%
Low
< 25%
Table 5.3: Risk Probability definitions

Impact
Value
Description
Very high
> 10%
Schedule impact or Unacceptable quality
High
5 10%
Schedule impact or Some parts of the project have low

quality
Medium
< 5%
Schedule impact or Barely noticeable degradation in quality Low Impact on schedule or Quality can be incorporated
Table 5.4: Risk Impact definitions
Task 1: Locating the current location of the patient so that he can loacate the
ambulance.
Task 2: Implementing the Reverse geocoding algorithm for nding the optimal
Path.
Task 3: : Generating the optimal path using the GPS.
Task 4: Maintaining database.
23
Risk ID
Risk Description
Slow internet connectivity
Category
Application environment
Source
Software Design Specification documentation review
Probability
Medium
Impact
High
Response
Mitigate
Strategy
Internet connectivity can be improved
Risk Status
Occured
Table 5.5: Risk 1
Risk ID
Risk Description
GPS not available in the device
Category
Application environment
Source
Software Design Specification documentation review
Probability
Medium
Impact
High
Response
Mitigate
Strategy
Phones enabled with GPS must be used
Risk Status
Identified
Table 5.6: Risk 2
5.3.2
Task network
F1= Location Identication

F2= Checking for the nearest location
F3= Visiting that location and calculating the distance of next location
F4= Repeating the third function.
F5= Generating the optimal path
24
F1
F1
F2
F3
F4
F5
F2
YES
YES
F3
F4
YES
YES
F5
YES
YES
YES
YES
YES
Table 5.7: Dependency for generating the optimal path

5.3.3
Timeline Chart
Table 5.8: System Implementation Plan:
Task
Information Gain
Abstract Formation
Literature Survey
Synopsis
Requirement Gathering
Provider information Collection
Analysing the target audience
Building the android application
Figuring out the algorithm
Collaborating the application with the algorithm
Testing the application
Duration/Period(Days)
18
5
13
7
16
9
5
32
13
10
5
25
5.4
5.4.1
TEAM ORGANIZATION
Team structure
Datre Gayatri: UI Design, Abstract Formation

Deore Yograj: Android Backend, Literature survey
Jadhav Aakash: Server Database, Provider information collection
Marathe Kunal :Database Structure , Information Gain,
5.4.2
Management reporting and communication

Our intra communication is fluent. Each member voiced her problems and
they were solved with the help of each member. We distributed the tasks among
us equally so that our co-ordination is efficient. Our team work is evident from the
rapport we share.
Our communication with our guide Prof R. R. Tajanpure and Project
coordinator Prof. V. S. Tidke is good. We report to them from time to time to show
our project progress. We consult them when in doubt. They guide us very well.
26
CHAPTER 6
SOFTWARE REQUIREMENT
SPECIFICATION
6.1
INTRODUCTION
6.1.1
Purpose and Scope of Document
A software requirements specification (SRS) is a comprehensive description of the

intended purpose and environment for software under development. The SRS fully
describes what the software will do and how it will be expected to perform. An SRS
minimizes the time and effort required by developers to achieve desired goals and
also minimizes the development cost. A good SRS defines how an application will
interact with system hardware, other programs and human users in a wide variety
of real-world situations. Parameters such as operating speed, response time, availability, portability, maintainability, footprint, security and speed of recovery from
adverse events are evaluated.
6.1.2
Overview of responsibilities of Developer
The developer will do the following activities:

Understanding and giving a solution to the Patient safety.
6.2
USAGE SCENARIO
This section provides various usage scenarios for the system to be developed.
6.2.1
User profiles
Patient: The new patient registers from the system and then login system
shows is Own information, previous history, lab detail review the doctor and
get recommended doctor using sentiment analysis. Patient can traced ambulance which is near by location.
Doctor: When doctor login to the system its show own information. Doctor
can See patient information, add medicine and see lab detail of the patient
using patient UID.
28
Chemist: When chemist login to the system its show own information. Chemist
can See patient information and medicine of patient of the patient using patient
UID.
Pathologist: When Liberation login to the system its show own information.
Liberation can see patient information; add lab detail of the patient using patient UID.
6.2.2
Use-cases
All use-cases for the software are presented. Description of all main Use cases using
use case template is to be provided.
Sr No.
Use Case
Description
Use Case 1
Login into the system
Use Case 2
Find the ambulance
Actors
user, system
user
Table 6.1: Use Cases
29
6.2.3
Use Case View
Use Case Diagram.
Figure 6.1: Use case diagram
30
6.3
DATA MODEL AND DESCRIPTION
6.3.1
Data Description
6.3.2
Data objects and Relationships
6.4
FUNCTIONAL MODEL AND DESCRIPTION
6.4.1
6.4.1.1
Data Flow Diagram

Level 0 Data Flow Diagram
Figure 6.2: Level 0 Data Flow Diagram
6.4.1.2
Level 1 Data Flow Diagram
Figure 6.3: Level 1 Data Flow Diagram
31
6.4.2
Activity Diagram:
The Activity diagram represents the steps taken.
Figure 6.4: Activity Diagram
32
6.4.3
Non Functional Requirements:
Database Requirements: For smart hospitalization and patient review analysis

we have to manage large amount of database which can be implemented using
database management software specifically the Structured Query Language,
MySQL .
Security Requirement: The registration of client is needed for security purpose
and only authenticated user can access the system, like patient can see only his
own record.
Software quality attributes
Reliability: The reliability that the system gives the right result on a
search.
Availability: The availability of the system when it is used. The average
system availability (not considering network failing). There should be
the continuous Connectivity to the system.
Maintainability: The application should be easy to extend. The code
should be written in a way that it favors implementation of new functions.
Portability: The application should be portable with various Andriod version.
33
6.4.4
State Diagram:
Figure 6.5: State Diagram
6.4.5
Design Constraints
The system should be able to access the GPS location of the mobile phone and
internet connectivity is required so as to access data.
6.4.6
Software Interface Description
External Interface Requirement:

User Interfaces The system must be user friendly and very interactive. The
functionality provided by the system should adapt itself easily.
34
1] Patient: The patient registers the new registration when he comes first time
in the hospital and it maintains daily registration data of each user. He can also
be recommended by the system for a particular treatment.
2] Doctor: The patient creates profile when he visit first time on system. He
uses the system. Doctor also can be register to the system and can see patients
data useful for the doctor.
3] Chemist: The chemist registers the new registration when patient comes
first time in the medical and it maintains daily registration data of each user.
4] Pathologist: The pathologist registers to the system for new registration. He
can see patients patients previous test records.
Hardware Interface: GPS (Global Positioning System) is a very important part
of android Smartphone it fetches the geographical co-ordinates of the location
where it is present. It is helpful in location the patient and nding the ambulance
route. As well proper Connectivity is required for this to work over internet.
Software Interfaces:
MySQL: For managing large number of database we are using MySQL
database .we can stored our records in table format. Using Structured
Query Language (sql).
Dream viewer: The process of the development of smart hospitalization
for his homepage for the front page was done by adopting the php with
Dream viewer as the editor and compiler.
Android studio: The process of the development of smart hospitalization
and patient review analysis for the implementation of android app which
will done by android operating system using Android studio.
35
CHAPTER 7
DETAILED DESIGN DOCUMENT USING
APPENDIX A AND B
7.1
INTRODUCTION
This application is aimed to automate the Smart Hospitalization. This project
is mainly to develop mainly for patient, doctor, chemist and pathologist. The purpose of the project entitled as smart hospitalization and patient review analysis is to
develop an application which is user friendly, simple, fast and effective. Its deals
with the collection of patients information, doctors information, chemist information, pathologist information, medicine detail, lab detail and with the help of patient
review we recommended the doctor who is best for particular disease in particular
area and patient can traced ambulance location.
7.2
ARCHITECTURAL DESIGN
The system architecture describes about system architecture of Smart Hospitalization. User will login using the ID and password then he/she will get the the own
information, previous medicine, lab file, patient review, recommended doctor, can
trace ambulance location and can get ambulance.
Figure 7.1: System Architecture for smart Hospital
37
Figure 7.2: System Architecture for Ambulance
7.3
SENTIMENT ANALYSIS
This project proposes an algorithm for identifying the polarity of remarks. In the
existing work polarity of remarks word by word in a sentence was not considered.
The proposed work has been explained with help of a case study. A case has been
considered where in a set of patient give their remarks about a particular doctor.
The algorithm is applied on every remark to identify the polarity of each remark.
The algorithm generates a numeric value for the opinion. If the opinion value are
high the opinion are considered positive. Lower opinion value represents negative
remarks. The algorithm analyses the remarks word by word [1]. Sentiment words are
identified and a combined value is given to each sentence. A database is maintained
to identify the sentiment words. The database along with the sentiment word saves
an associated value for the opinion word. The value assigned to each sentiment word
is based on how much strong or weak sentiment is being used. The value ranges from
zero to ten. If a sentiment word emotes strongly positive opinion higher is its value
in the database. A sentiment word that represents strong negative opinion lower is its
38
value in the database. When a sentence is analysed, for each sentiment word found
in the sentence, its opinion value is fetched from the database. Then the collaborated
opinion value of that sentence is estimated. If there is negation in a sentence the value
of opinion score is decreased/ increased by a certain amount [3]. The following is
the algorithm that is being used.
7.3.1
Sentiment Algorithm
1. For each word.

2. Check whether it is negation or sentiment word.
3. Every sentiment word is given a value (in the database). A value less than 5 represents negative opinion (e.g. bad). A value greater than 5 represents positive opinion.
How much low or how much high value may be decided using thesaurus.
4. If negation is present before sentiment is increased or decreased by 2 depending
upon whether the sentiment value is high or low respectively.
5. Now an average is calculated for all the opinion scores calculated for each remark
given by teachers. The range of value is 0 to 10. The collaborated opinion score is
evaluated as shown:
If value less than 2
Very low
If value greater than 2 but less than 4.5
Low
If value greater than4.5 but less than 5.5
Moderate
If value greater than 5.5 but less than 8
High
If value greater than 8
Very high
39
7.3.2
Working of Sentiment Algorithm
If total cost is less than 2

half star
If value greater than 2 but less than 4.5
2 star
If value greater than4.5 but less than 5.5
2.5 star
If value greater than 5.5 but less than 8
3.5 star
If value greater than 8
4.5 star
Example
Sentiment word
good
very good
best
awesome
fabulous
fanstatic
satisfied
Nentiment Word
Negation word
Negation Word
bad
worst
not
pathetic
third class
none
-2
-4
-2
-5
-4
-2
Review for Dr. Madhavi Datar
1. Dr. Madhavi Datar is best at Treating the Migraine , I was reliefed from the
pain within 4 days. But the Expenditure was More than Estimated.
sentiment word= best
pcost=4
40
2. Bad Treatment ,Not Satisfied result from Dr. Madhavi . Even after a long week
of treatment did not have satisfactory effect on me.
sentiment word=
negation word =bad,not,not
ncost=(-2)+(-2)+(-2)
ncost= -6
3. Awesome Experience From Dr.Madhavi Datar. Liked the treatment. Fully Satisfied
sentiment word= Awesome, satisfied
pcost=4+3
pcost=7
4. Doctor Madhavi Datar is good for the treatment of Migraine. Earlier have Consulted two Doctors but didnt workout for me. But thanks to Madhavi Datar .Helped
me in recovering within a week.
sentiment word=good
pcost=2
5. Best Doctor For Migraine and Headache Related Problems. Her treatment is
effective and Results are very good.
sentiment word= best, very good
pcost=4+4
pcost=8
Total cost = ( pcost + ncost )/5

= 21 + (-6)/5
= 15/5
=3
41
here total cost is 3 so system gives rating as 2 star
7.4
REVERSE GEOCODING
It is the process of converting geographic coordinates into a human-readable address.

The Google Maps Geocoding APIs reverse geocoding[2] service also lets you find
the address for a given place ID. The Google Maps Geocoding API provides a direct
way to access these services via an HTTP request.
7.4.1
Geocoding (Latitude/Longitude Lookup) Required parameters in a geocoding request
address: The street address that you want to geocode, in the format used by the
national postal service of the country concerned. Additional address elements
such as business names and unit, suite or floor numbers should be avoided.
components: A component filter for which you wish to obtain a geocode. The
components filter will also be accepted as an optional parameter if an address
is provided.
key: Your applications API key. This key identifies your application for purposes of quota management. All Google Maps Geocoding API applications
require authentication using an API key. Including a key in your request allows you to monitor your applications API usage in the Google Developers
Console; enables per-key instead of per-IP-address quota limits; and ensures
that Google can contact you about your application if necessary.
7.5
K NEAREST NEIGHBOURS
K nearest neighbours is a simple algorithm that stores all available cases and classifies new cases based on a similarity measure (e.g., distance functions). KNN has
42
been used in statistical estimation and pattern recognition already in the beginning
of 1970s as a non-parametric technique.
7.5.1
Algorithm
A case is classified by a majority vote of its neighbours, with the case being assigned to the class most common amongst its K nearest neighbours measured by a
distance function. If K = 1, then the case is simply assigned to the class of its nearest
neighbours.
Figure 7.3: Distance function
It should also be noted that all three distance measures are only valid for continuous variables. In the instance of categorical variables the Hamming distance
must be used. It also brings up the issue of standardization of the numerical variables between 0 and 1 when there is a mixture of numerical and categorical variables
in the dataset.
Choosing the optimal value for K is best done by first inspecting the data. In
general, a large K value is more precise as it reduces the overall noise but there is
no guarantee. Cross-validation is another way to retrospectively determine a good K
value by using an independent dataset to validate the K value. Historically, the optimal K for most datasets has been between 3-10. That produces much better results
than 1NN.
43
Figure 7.4: Hamming distance
Example
Consider the following data concerning credit default. Age and Loan are two numerical variables (predictors) and Default is the target.
Figure 7.5: Find out nearest neighbours
We can now use the training set to classify an unknown case Age=48 and
Loan=142,000 using Euclidean distance. If K=1 then the nearest neighbor is the last
case in the training set with Default=Y.
44
Table 7.1: Euclidean Distance
With K=3, there are two Default=Y and one Default=N out of three closest neighbours. The prediction for the unknown case is again Default=Y.
Standardized Distance:One major drawback in calculating distance measures directly from the training set
is in the case where variables have different measurement scales or there is a mixture
of numerical and categorical variables. For example, if one variable is based on annual income in dollars, and the other is based on age in years then income will have
a much higher influence on the distance calculated. One solution is to standardize
the training set as shown below.
Using the standardized distance on the same training set, the unknown case
returned a different neighbor which is not a good sign of robustness.
45
Table 7.2: Standarized Distance

7.5.2
How can distance can be calculated
First calculate total no. of ambulance available near to the user.

calculate distance of each ambulance from the user.
Sort the ambulance in ascending order according to their calculated distances.
Display the list of ambulance in ascending order.
Drawback
By using KNN algorithm user have only one choice to choose the ambulance
and in case of any technical error for the ambulance, the patient would not
have no further choice. To overcome the problem we are implemented Google
API so the patient would be having a list of ambulance to choose from his near
by location.
46
Figure 7.6: Flow chart for Ambulance
47
7.6
GOOGLE MAP DIRECTION API
The Google Maps Directions API is a service that calculates directions between
locations using an HTTP request. You can search for directions for several modes of
transportation, including transit, driving, walking or cycling. Directions may specify
origins, destinations and waypoints either as text strings (e.g. Nashik or Mumbai,
India) or as latitude/longitude coordinates. The Directions API can return multipart directions using a series of waypoints. This service is generally designed for
calculating directions for static (known in advance) addresses for placement of application content on a map; this service is not designed to respond in real time to
user input, for example. For dynamic directions calculations (for example, within a
user interface element), consult the documentation for the Google Maps JavaScript
API Directions Service. Calculating directions is a time and resource intensive task.
Whenever possible, calculate known addresses ahead of time (using the service described here) and store your results in a temporary cache of your own design.
7.6.1
Implementation:
1. Directions Requests:
A Google Maps Directions API request takes the following form:
https://maps.googleapis.com/maps/api/directions/output?parameters
where output may be either of the following values:
Json (recommended) indicates output in JavaScript Object Notation (JSON)
Xml indicates output as XML
To access the Google Maps Directions API over HTTP, use:
http://maps.googleapis.com/maps/api/directions/output?parameters
HTTPS is recommended for applications that include sensitive user data, such as
a users location, in requests. Google Maps Directions API URLs are restricted to
approximately 2000 characters, after URL Encoding. As some Google Maps Directions API URLs may involve many locations along a path, be aware of this limit
48
when constructing your URLs.
2. Request Parameters:
Certain parameters are required while others are optional. As is standard in URLs,
all parameters are separated using the ampersand character. The list of parameters
and their possible values are enumerated below.
3. Required parameters:
Orign: The address, textual latitude/longitude value, or place ID from which you
wish to calculate directions.
If you pass an address, the Directions service will geocode the string and convert
it to a latitude/longitude coordinate to calculate directions. This coordinate may be
different from that returned by the Google Maps Geocoding API [9], for example a
building entrance rather than its center.
If you pass coordinates, they will be used unchanged to calculate directions. Ensure
that no space exists between the latitude and longitude values.
Place ID must be prefixed with place id:. The place ID may only be specified if the
request includes an API key or a Google Maps APIs Premium Plan client ID. You
can retrieve place IDs from the Google Maps Geocoding API and the Google Places
API (including Place Autocomplete). For an example using place IDs from Place
Autocomplete, see Place Autocomplete and Directions. For more about place IDs,
see the place ID overview.
4. Directions Response: Directions responses are returned in the format indicated

by the output flag within the URL requests path.
Directions Response Elements
Directions responses contain the following root elements:
1. Status contains metadata on the request..
2. Geocode waypoints contains an array with details about the geocoding of origin,
destination and waypoints.
textbf3. Routescontains an array of routes from the origin to the destination.
49
5. Transit Details
Transit directions return additional information that is not relevant for other modes
of transportation. These additional properties are exposed through the transit details
object, returned as a field of an element in thesteps[] array. From the TransitDetails
object you can access additional information about the transit stop, transit line and
transit agency.
A transit details object may contain the following fields:
Arrival stop and departure stop contains information about the stop/station for this
part of the trip. Stop details can include:name the name of the transit station/stop.
eg. Union Square. location the location of the transit station/stop, represented as a
lat and lng field.
Arrival time and departure time contain the arrival or departure times for this leg
of the journey, specified as the following three properties:
Text the time specified as a string. The time is displayed in the time zone of the
transit stop.
Value the time specified as Unix time, or seconds since midnight, January 1, 1970
UTC.
Time zone contains the time zone of this station. The value is the name of the time
zone as defined in the IANA Time Zone Database, e.g. America/NewYork.
50
CHAPTER 8
PROJECT IMPLEMENTATION
8.1
INTRODUCTION
The Software is implemented on scripted platform and the algorithms have to be

extremely efficient in order to perform at their best. The variation in processor types,
processor capacities and hardware capabilities is going to be vast hence the single
most important goal for the code is going to be efficiency. We are using php scripts
for the same. And MySQL is being used to storing the database.
8.2
TOOLS AND TECHNOLOGIES USED
Runtime Requirements :
Operating system
Windows XP and above
IDE
Android studio, Adobe Dream Viewer
Database
MySQL
Server
Apache Tomcat
Programming Language
Java, PHP,XML
8.3
8.3.1
METHODOLOGIES/ALGORITHM DETAILS
Sentiment analysis Pseudo Code
Initially fetch all Doctor list in array (DocArray)

fetch all word (Positive and Negative) in another array (WordArray)
initially set score=0
store total number of comments in totalNumComments variable
after that fetch single comment and check whether it is present in WordArray or not
if present then update Value of Score variable
final score can be calculated as follow
score= score/totalNumComments
52
8.3.2
KNN Algorithm Pseudo Code
The algorithm on how to compute the K-nearest neighbours is as follows:

1. Determine the parameter K = number of nearest neighbours beforehand. This
value is all up to you.
2. Calculate the distance between the query-instance and all the training samples.
You can use any distance algorithm.
3. Sort the distances for all the training samples and determine the nearest neighbour
based on the K-th minimum distance.
4. You get minimum distance neighbour as a result
5. place that neighbour on to the map
8.4
VERICATION AND VALIDATION FOR ACCEPTANCE
53
CHAPTER 9
SOFTWARE TESTING
Testing is one of the most important activity which is included in the project life
cycle. Without actual testing the software, it should be not deployed to the customer.
In testing, we test the website and android application with the specification already
mentioned. Whether it is doing its intended function or not.
9.1
TYPE OF TESTING USED
9.1.1
Unit Testing
This type of testing is performed by developers before the setup is handed over
to the testing team to formally execute the test cases. Unit testing is performed by
the respective developers on the individual units of source code assigned areas. The
developers use test data that is different from the test data of the quality assurance
team. The goal of unit testing is to isolate each part of the program and show that
individual parts are correct in terms of requirements and functionality.
Limitations of Unit Testing
Testing cannot catch each and every bug in an application. It is impossible to
evaluate every execution path in every software application. The same is the case
with unit testing. There is a limit to the number of scenarios and test data that a
developer can use to verify a source code. After having exhausted all the options,
there is no choice but to stop unit testing and merge the code segment with other
units.
9.1.2
Integration Testing
Integration testing is defined as the testing of combined parts of an application to

determine if they function correctly. Integration testing can be done in two ways:
Bottom-up integration testing and Top-down integration testing.
Bottom-up integration
This testing begins with unit testing, followed by tests of progressively higherlevel combinations of units called modules or builds.
55
Top-down integration
In this testing, the highest-level modules are tested first and progressively,
lower-level modules are tested thereafter.
In a comprehensive software development environment, bottom-up testing is
usually done first, followed by top-down testing. The process concludes with multiple tests of the complete application, preferably in scenarios designed to mimic
actual situations.
9.1.3
System Testing
System testing tests the system as a whole. Once all the components are integrated, the application as a whole is tested rigorously to see that it meets the specified
Quality Standards. This type of testing is performed by a specialized testing team.
System testing is important because of the following reasons:
System testing is the first step in the Software Development Life Cycle, where
the application is tested as a whole.
The application is tested thoroughly to verify that it meets the functional and
technical specifications.
The application is tested in an environment that is very close to the production
environment where the application will be deployed.
System testing enables us to test, verify, and validate both the business requirements as well as the application architecture.
56
9.2
9.2.1
TEST CASES AND TEST RESULTS

Unit Testing
Table 9.1: Unit Testing
Test
case ID
1
Test Data
Expected Results
Actual Results
Go to UID field and without

entering data in that fieldpress
Enter key.
Go to login screen enter
UID and without entering password try to click on
OK button.
Go to login screen enter
UID and enter wrong password try to click on OK
button.
Go to Login screen enter all
required data and press OK
button then software window
will open. In that window
clickon Back button.
Check the Username, password with Lower case and
upper case.
prompt message
Please enter
UID
prompt message
Please enter
UID
prompt message
Please
enter
Password
prompt message
Please
enter
Password
prompt message
Please enter
Proper UID and
Password
go back to Login screen and
that screen should
not show UID
and Password
prompt message
Please enter
Proper UID and
Password
that screen should
not show UID
and Password
Password should
be case sensitive.
Password is case
insensitive.
57
9.2.2
Integration Testing
Table 9.2: Integration Testing
Test
case ID
Check whether control is

passed between two pages or
not
Check whether the iteration
are giving proper results or
not
1
2
9.2.3
Test Data
Expected Results
Actual Results
Control passed
successfully
Control passed
successfully
The optimal result is given
Result is right
System Testing
Table 9.3: System Testing
Test
case ID
1
2
Test Data
Expected Results
Actual Results
Go to Doctors login update

prescription
Go to Chemist login, received
prescription
Updated successfully
Received
successfully
Request send successfully
Request successfully rejected
Updated successfully
Received
successfully
Request send successfully
Request successfully rejected
Request for ambulance
If ambulance busy
58
CHAPTER 10
RESULTS
10.1
10.1.1
SCREEN SHOTS
Login page
Figure 10.1: Login Diagram
60
10.1.2
Registration
Figure 10.2: Registration Diagram
61
10.1.3
Validation
Figure 10.3: Validation Diagram
62
10.2
OUTPUTS
Figure 10.4: Output 1 2 3 4 Diagram
63
Figure 10.5: Output 5 6 7 8 Diagram
64
CHAPTER 11
DEPLOYMENT AND MAINTENANCE
11.1
INSTALLATION AND UN-INSTALLATION
11.1.1
User Side
Project functionalities are made available to user via website and Android App.
Hence user can directly access the service on the internet using any browser
and android app.
Thus installation is involved regarding the project on client side for Android
user.
11.1.2
Admin Side
Run the site on server side

11.2
USER HELP
11.2.1
Home:
The home page is the main page of the websites. It provides following function:
Login: Valid user who have already registered for this site can enter their
username and password and submit it. Then they will be granted the main
service provided by the websites like Product Access and Analyze.
Register: New user who have not yet registered for this site can register themselves and then use the provided login id and password to login to the website
later. The user must fill in all the required information correctly for successful
registration.
11.2.2
About Us:
In this you can find out details about the team that built this system. This would
understand developers of the system and their point of view.
66
11.2.3
Contact Us:
In this, all the detail required to contact the administrator of the website are provided.
If you have any doubts,suggestion or queries, you may contact us given contact information.
67
CHAPTER 12
SUMMARY AND CONCLUSION
Summary
Thus we can overcome the problems in existing system. We proposed new service
in medical field that is Ambulance finder, using this user can search the ambulance
from any location. We also introduce the concept of finding best doctor, in that we
accept comments from the patients and according to that we can suggest best doctor
for that treatment. So by considering all these feature our application make most
user friendly, and also efficient and easy to use.
Conclusion
By implementing this project there would be improved efficiency and reduce the
waste in the process of medical services. The importance of making correct decisions based on obtaining the right information at the right time is absolutely critical
in healthcare services for user. In our system we develop facility for the user in
which user can find best doctor to particular treatment, for that purpose we used
sentiment analysis. Using that we can obtain user reviews and according to that we
can categorized the doctor. It would be beneficial to the patients and would help in
saving preciously life, by providing timely ambulance driving emergency. It would
ease the process for finding appropriate doctor for particular treatment. This would
help in serving people with better medical facilities in timely manner.
69
CHAPTER 13
REFERENCES
[1] Min Wang; Hanxiao Shi, Research on sentiment analysis technology and polarity computation of sentiment words, in Progress in Informatics and Computing (PIC), 2010 IEEE International Conference on , vol.1, no., pp.331-334,
10-12 Dec. 2010 doi: 10.1109/PIC.2010.5687438
[2] T.; Prapakornpilai, J.; Phithakkitnukoon, S.; Witayangkurn, A.; Shibasaki, R.,
Space Profile-Based Reverse Geocoding Service Using Cloud Platform, in
Services Computing (SCC), 2014 IEEE International Conference on , vol., no.,
pp.842-843, June 27 2014-July 2 2014 doi: 10.1109/SCC.2014.116
[3] Bo Pang and Lillian Lee, Opinion Mining and Sentiment Analysis, Foundations
and TrendsR in Information Retrieval Vol. 2, Nos. 12 (2008) 1135
[4] Lun-Wei Ku, Yu-Ting Liang and Hsin-Hsi Chen, Opinion Extraction, Summarization and Tracking in News and Blog Corpora, 2006 American Association
for Artificial Intelligence
[5] Brownstein, J. S., Cassa, C. A., Kohane, I. S., and Mandl, K. D. (2006) An
unsupervised classification method for inferring original case locations from
low-resolution disease maps Int J Health Geogr, 5, 56
[6] www.foodpanda.in
[7] www.olacab.com
[8] Sajama and Orlitsky, A. Estimating and computing density based distance metrics. In International Conference on Machine learning (ICML), 2005.
71
ANNEXURE A
LABORATORY ASSIGNMENTS ON
PROJECT ANALYSIS OF ALGORITHMIC
DESIGN
A.1
ASSIGNMENT NO.: 1
To develop the problem under consideration and justify feasibilty using concepts of knowledge canvas and IDEA Matrix.
Sentiment analysis
Yixiong Pan, Peipei Shen and et al.
Reverse geocoding
KNN
Brownstein, J. S., Cassa, C. A., Kohane, I. S.
Sajama and Orlitsky
Table A.1: Idea Matrix
73
A.2
ASSIGNMENT NO.: 2
Project problem statement feasibility assessment using NP-Hard, NP-Complete

or satisfy ability issues using modern algebra and/or relevant mathematical
models.
P and NP Definitions :
P denotes the class of all deterministic polynomial language problems
and NP denotes the class of all non-deterministic polynomial language problems.
Hence, P-NP.
The question of whether or not P=NP holds, is the most famous outstanding problem in the computer science.
Problems which are known to lie in P are often called as tractable.
Problems which lie outside of P are often termed as intractable. Thus, the question
of whether P=NP or PNP is the same as that of asking whether there exist problems
in NP which are intractable or not.
NP- Hard:
NP-hard (non-deterministic polynomial-time hard), in com-
putational complexity theory, is a class of problems that are, informally, at least as

hard as the hardest problems in NP. More precisely, a problem H is NP-hard when
every problem L in NP can be reduced in polynomial time to H. As a consequence,
finding a polynomial algorithm to solve any NP-hard problem would give polynomial algorithms for all the problems in NP, which is unlikely as many of them are
considered hard.
A common mistake is thinking that the NP in NP-hard stands for

non-polynomial. Although it is widely suspected that there are no polynomialtime algorithms for NP-hard problems, this has never been proven. Moreover, the
class NP also contains all problems which can be solved in polynomial time.
Consequences:
If P NP, then NP-hard problems cannot be solved in polynomial time.
74
If an optimization problem H has an NP-complete decision version L, then H

is NP-hard
Examples:
An example of an NP-hard problem is the decision subset sum problem, which is this: given a set of integers, does any non-empty subset of them add
up to zero? That is a decision problem, and happens to be NP-complete. Another
example of an NP-hard problem is the optimization problem of finding the least-cost
cyclic route through all nodes of a weighted graph. This is commonly known as the
traveling salesman problem.
There are decision problems that are NP-hard but not NP-complete,
for example the halting problem. This is the problem which asks given a program
and its input, will it run forever? That is a yes/no question, so this is a decision problem. It is easy to prove that the halting problem is NP-hard but not NP-complete. For
example, the Boolean satisfiability problem can be reduced to the halting problem
by transforming it to the description of a Turing machine that tries all truth value
assignments and when it finds one that satisfies the formula it halts and otherwise it
goes into an infinite loop. It is also easy to see that the halting problem is not in NP
since all problems in NP are decidable in a finite number of operations, while the
halting problem, in general, is un-decidable. There are also NP-hard problems that
are neither NP-complete nor un-decidable. For instance, the language of True quantified Boolean formulas is decidable in polynomial space, but not non-deterministic
polynomial time (unless NP = PSPACE).
NP- Complete:
In computational complexity theory, a decision prob-
lem is NP-complete when it is both in NP and NP-hard. The set of NP-complete

problems is often denoted by NP-C or NPC. The abbreviation NP refers to nondeterministic polynomial time.
Although any given solution to an NP-complete problem can be verified quickly (in polynomial time), there is no known efficient way to locate a solution
in the first place; indeed, the most notable characteristic of NP-complete problems
is that no fast solution to them is known. That is, the time required to solve the
problem using any currently known algorithm increases very quickly as the size of
75
the problem grows. As a consequence, determining whether or not it is possible to

solve these problems quickly, called the P versus NP problem, is one of the principal
unsolved problems in computer science today.
While a method for computing the solutions to NP-complete problems
using a reasonable amount of time remains undiscovered, computer scientists and
programmers still frequently encounter NP-complete problems. NP-complete problems are often addressed by using heuristic methods and approximation algorithms.
Formal definition of NP-completeness:
A decision problem C is NP-complete if:
C is in NP, and
Every problem in NP is reducible to C in polynomial time.
C can be shown to be in NP by demonstrating that a candidate solution
to C can be verified in polynomial time. Note that a problem satisfying condition 2
is said to be NP-hard, whether or not it satisfies condition 1.
A consequence of this definition is that if we had a polynomial time

algorithm (on a UTM, or any other Turing-equivalent abstract machine) for C, could
be solve all problems in NP in polynomial time.
NP- Complete Problems:
Boolean satisfiability problem (SAT)
Knapsack problem
Hamiltonian path problem
Knapsack problem
Travelling salesman problem (decision version)
Sub graph isomorphism problem
Subset sum problem
Clique problem
76
Vertex cover problem

Independent set problem
Dominating set problem
Graph coloring problem
Solving NP-complete problems:
At present, all known algorithms for
NP-complete problems require time that is super polynomial in the input size, and it
is unknown whether there are any faster algorithms. The following techniques can
be applied to solve computational problems in general, and they often give rise to
substantially faster algorithms:
Approximation: Instead of searching for an optimal solution, search for an

almost optimal one.
Randomization: Use randomness to get a faster average running time, and allow the algorithm to fail with some small probability. Note: The Monte Carlo
method is not an example of an efficient algorithm, although evolutionary approaches like Genetic algorithms may be.
Restriction: By restricting the structure of the input (e.g., to planar graphs),
faster algorithms are usually possible.
Parameterization: Often there are fast algorithms if certain parameters of the
input are fixed.
Heuristic: An algorithm that works reasonably well in many cases, but for
which there is no proof that it is both always fast and always produces a good
result. Meta-heuristic approaches are often used.
One example of a heuristic algorithm is a suboptimal O(n logn) greedy
coloring algorithm used for graph coloring during the register allocation phase
of some compilers, a technique called graph-coloring global register allocation. Each vertex is a variable, edges are drawn between variables which are
77
being used at the same time, and colors indicate the register assigned to each
variable.
Difference between NP-Hard and NP-Complete problems: The problems

that can be solved in polynomial time are called P-class problems.
Binary Search:-In searching an element using binary search method, the list is
simply divided at the mid and either left or right sub list is searched for key
element. This process is carried out in O (log n).
Evaluation of polynomial:-In a polynomial evaluation we make out the summation of each term of polynomial. The evaluated result is simply an integer.
This process is carried out in O (n) time.
Sorting a list:-The elements in the list can be arranged either in ascending or
descending order. This procedure is carried out in O (nlogn) time
As we have seen all the classes of problems. Our topic is Smart Hospitalization And Patient Review Analysis.
Our problem can be solved in non-deterministic polynomial time.
It is an NP hard problem.
Hence, this smart hospitalization problem can be defined as NP-Complete.
78
ANNEXURE B
LABORATORY ASSIGNMENTS ON
PROJECT QUALITY AND RELIABILITY
TESTING OF PROJECT DESIGN
B.1
ASSIGNMENT NO.: 3
Use of divide and conquer strategies to exploit distributed/parallel/concurrent processing to identify objects, functional relations and any other dependencies using
relevant mathematical models.
Mathematical Model:
Let S be a system
Such that S=I,F,O
where,
I represents the set of inputs;
I=I1,I2,I3,I4,I5,I6
I1=Enter the user name and password
I2=LogIn the user
I3=Add review by patient
I4=add medicine by doctor
I5=Add lab report by labrotarian
I6=patient Location
I7=Ambulance Location
I8=Logout the user
F is the set of functions;

F=F1,F2,F3,F4,F5
F1=Login into the system( )
F2= Add medicine( )
F3= Add lab report( )
F4= Recommended doctor( )
F5= Calculate the distance from patient location and ambulance
F6= Select the minimum distance and visit it.
F7= Logout to the system( )
O is the set of outputs;
80
O=O1,O2,O3
O1=Display user database
O2=Display recommended doctor
O3= Optimal path for the patient from ambulance location.
O4= logout from the system
Figure B.1: Functional Diagram
81
B.2
ASSIGNMENT NO.: 4
Title: Relevant UML diagrams using appropriate tools.

B.3
B.3.1
UML DIAGRAMS:
Use Case Diagram
Figure B.2: Usecase Diagram
82
B.3.2
Class Diagrams
Figure B.3: Class Diagram
83
B.3.3
Package Diagram
Figure B.4: Package Diagram
84
B.3.4
Activity Diagram
Figure B.5: Activity Diagram for patient
85
Figure B.6: Activity Diagram for Doctor
86
Figure B.7: Activity Diagram for Chemist
87
Figure B.8: Activity Diagram for pathologist
88
B.3.5
Sequence Diagram
Figure B.9: Sequence Diagram
89
B.3.6
Component Diagram
Figure B.10: Component Diagram
90
B.4
ASSIGNMENT NO.5
Title: Testing of project problem statement using generated test data.

Test
case ID
1
Test Data
Go to UID field
and without entering data in that
fieldpress Enter
key.
Go
to
login
screen
enter
UID and without
entering
password try to
click on OK
button.
Go
to
login
screen
enter
UID and enter
wrong password
try to click on
OK button.
Go to Login
screen enter all
required
data
and press OK
button then software
window
will open. In that
window clickon
Back button.
Check the Username, password
with Lower case
and upper case.
In How many
times
login
window
will
appear
Expected Results
Actual Results
prompt message
Please enter
UID
prompt message
Please enter
UID
prompt message
Please
enter
Password
prompt message
Please
enter
Password
prompt message
Please enter
Proper UID and
Password
prompt message
Please enter
Proper UID and
Password

that screen should
not show UID
and Password

that screen should
not show UID
and Password
Password should
be case sensitive.
Password is case
insensitive.
Maximum
times
Maximum
times
Status
Table B.1: Test case
91
ANNEXURE C
PROJECT PLANNER
Month
July
Schedule
1st week
3rd week
August
1st week
2nd week
3rd week
September
1st week
2nd week
3rd week
4th week
October
1st week
2nd week
3rd week
December
1st week
3rd week
4th week
January
February
1st week
3rd week
4th week
1st week
2nd week
3rd week
4th week
Project Task
Idea about Project Selection
/Project Topic
Guide Allocation and
Abstract submitted
To Display list of project
groups with guide name
Study of the selected
project topic
First Presentation with Guide
about idea of Projects. Requirement
Analysis (SRS document)
Preparation And Submission
Use case diagram on paper
and Five UML diagrams in software
Literature survey and synopsis submitted to guide
Prepare PPT and finalized with guide
Project assignments P/NP
complete, mathematical model
Demo given with PPT
And Submission Prelim Report of
the Project
Prepare synopsis and finalize
with guide
Prepare report in latex and
finalize with guide
Start working on first module of our
project i.e. sentiment analysis
Check the first module with guide
Start working on second module of our project
i.e. Reverse geocoding
Check the second module with guide
Show the database designed to guide
Start working on nearest location trace
Working on review analysis using sentiment analysis
Discuss with guide the work done and if
required changes to be done.
Table C.1: Project Planner
93
ANNEXURE D
REVIEWERS COMMENTS OF PAPER
SUBMITTED
1. Paper Title: Smart Hospitalization And Patient Review Analysis.
95
ANNEXURE E
PLAGIARISM REPORT
Plagiarism report
The report has 94 percent unique data
Figure E.1: Plagarism reprt
97

Report 1

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Report 1

Загружено:

Авторское право:

Доступные форматы

SAVITRIBAI PHULE PUNE UNIVERSITY

A PRELIMINARY PROJECT REPORT ON

Smart Hospitalization and Patient Review Analysis

SUBMITTED TOWARDS THE

BACHELOR OF ENGINEERING (Computer Engineering)

Exam No: B120294216

Exam No: B120294218

Exam No: B120294223

Exam No: B120294243

Under The Guidance of

DEPARTMENT OF COMPUTER ENGINEERING

KARMAVEER ADV. BABURAO GANPATRAO THAKARE

DEPARTMENT OF COMPUTER ENGINEERING

SMART HOSPITALIZATION AND PATIENT REVIEW ANALYSIS

Exam No: B120294216

Exam No: B120294218

Exam No: B120294223

Exam No: B120294243

is a bonafide work carried out by Students under the supervision of Prof. R. R.

Prof. Dr. Jayant T. Pattiwar

KBTCOE, Department of Computer Engineering 2015

It gives us great pleasure in presenting the preliminary project report on Smart

We are also grateful to Prof. Balasaheb S. Tarle, Head of Computer Engineering

KBTCOE, Department of Computer Engineering 2015

Sponsorship and External Guide . . . . . . . . . . . . . . . . . . .

Technical Keywords (As per ACM Keywords) . . . . . . . . . . . .

Goals and Objectives . . . . . . . . . . . . . . . . . . . . . . . . .

Relevant mathematics associated with the Project . . . . . . . . . .

1.10 Names of Conferences / Journals where papers can be published . .

1.11 Review of Conference/Journal Papers supporting Project idea . . . .

1.12 Plan of Project Execution . . . . . . . . . . . . . . . . . . . . . . .

Motivation of the Project . . . . . . . . . . . . . . . . . . . . . . .

Problem Definition and scope

Goals and objectives . . . . . . . . . . . . . . . . . . . . .

Methodologies of Problem solving and efficiency issues . . . . . . .

Hardware Resources Required . . . . . . . . . . . . . . . . . . . .

Software Resources Required . . . . . . . . . . . . . . . . . . . . .

Risk Management w.r.t. NP complete analysis . . . . . . . . . . . .

Overview of Risk Mitigation, Monitoring, Management . .

Project task set . . . . . . . . . . . . . . . . . . . . . . . .

Management reporting and communication . . . . . . . . .

Software requirement specification

Purpose and Scope of Document . . . . . . . . . . . . . . .

Overview of responsibilities of Developer . . . . . . . . . .

KBTCOE, Department of Computer Engineering 2015

Use Case View . . . . . . . . . . . . . . . . . . . . . . . .

DATA MODEL AND DESCRIPTION . . . . . . . . . . . . . . .

Data objects and Relationships . . . . . . . . . . . . . . . .

FUNCTIONAL MODEL AND DESCRIPTION . . . . . . . . . . .

Data Flow Diagram . . . . . . . . . . . . . . . . . . . . .

Non Functional Requirements: . . . . . . . . . . . . . . . .

Software Interface Description . . . . . . . . . . . . . . . .

Detailed Design Document using Appendix A and B

Working of Sentiment Algorithm . . . . . . . . . . . . . .

Geocoding (Latitude/Longitude Lookup) Required parameters in a geocoding request . . . . . . . . . . . . . . . . . .

How can distance can be calculated . . . . . . . . . . . . .

Google Map Direction Api . . . . . . . . . . . . . . . . . . . . . .

Tools and Technologies Used . . . . . . . . . . . . . . . . . . . . .

Sentiment analysis Pseudo Code . . . . . . . . . . . . . . .

KBTCOE, Department of Computer Engineering 2015

KNN Algorithm Pseudo Code . . . . . . . . . . . . . . . .

Verication and Validation for Acceptance . . . . . . . . . . . . . .

Type of Testing Used . . . . . . . . . . . . . . . . . . . . . . . . .