International Conference on Mathematical Applications

(ICMATAP-20)

Delhi, India
22nd March, 2020

Institute for Scientific and Engineering Research

www.iser.org.in
Publisher: ISER Explore

© Copyright 2020, ISER-International Conference, Delhi, India

No part of this book can be reproduced in any form or by any means without prior written

Permission of the publisher.

This edition can be exported from India only by publisher

ISER-Explore
Editorial:

We cordially invite you to attend the International Conference on Mathematical Applications

(ICMATAP-20), which will be held in Delhi, India on March 22nd, 2020. The main objective of
ICMATAP-20 is to provide a platform for researchers, students, academicians as well as industrial
professionals from all over the world to present their research results and development activities in
Mathematical Applications. This conference provides opportunities for the delegates to exchange
new ideas and experience face to face, to establish business or research relations and to find global
partners for future collaboration.

These proceedings collect the up-to-date, comprehensive and worldwide state-of-art knowledge on
Mathematical Applications. All accepted papers were subjected to strict peer-reviewing by 2-4 expert
referees. The papers have been selected for these proceedings because of their quality and the
relevance to the conference. We hope these proceedings will not only provide the readers a broad
overview of the latest research results on Mathematical, Computational Sciences and Management
but also provide the readers a valuable summary and reference in these fields.

The conference is supported by many universities and research institutes. Many professors plaid an
important role in the successful holding of the conference, so we would like to take this opportunity
to express our sincere gratitude and highest respects to them. They have worked very hard in
reviewing papers and making valuable suggestions for the authors to improve their work. We also
would like to express our gratitude to the external reviewers, for providing extra help in the review
process, and to the authors for contributing their research result to the conference.

Since January 2020, the Organizing Committees have received more than 40 manuscript papers,
and the papers cover all the aspects in Mathematical Applications. Finally, after review, about 11
papers were included to the proceedings of ICMATAP-2020.

We would like to extend our appreciation to all participants in the conference for their great
contribution to the success of International Conference 2020. We would like to thank the keynote
and individual speakers and all participating authors for their hard work and time. We also sincerely
appreciate the work by the technical program committee and all reviewers, whose contributions
make this conference possible. We would like to extend our thanks to all the referees for their
constructive comments on all papers; especially, we would like to thank to organizing committee for
their hard work.
Acknowledgement

ISER is hosting the International Conference on Mathematical Applications this year in month of March.
International Conference on Mathematical Applications will provide a forum for students, professional
engineers, academician, and scientist engaged in research and development to convene and present their latest
scholarly work and application in the industry. The primary goal of the conference is to promote research and
developmental activities in Mathematical Applications and to promote scientific information interchange
between researchers, developers, engineers, students, and practitioners working in and around the world. The
aim of the Conference is to provide a platform to the researchers and practitioners from both academia as well
as industry to meet the share cutting-edge development in the field.

I express my hearty gratitude to all my Colleagues, Staffs, Professors, Reviewers and Members of organizing
committee for their hearty and dedicated support to make this conference successful. I am also thankful to all
our delegates for their pain staking effort to travel such a long distance to attain this conference.

Dr. Chi-Yuang San

Director
Institute for Scientific and Engineering Research (ISER)
 CONTENTS
S.NO TITLES AND AUTHORS PAGE NO

1. The Hurdle of Program Outcomes Attainment and the Aid of Mathematical 1– 4

Approach”
 Sapana P. Dubey

2. On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute 5–12

Mappings in Fuzzy Topological spaces
 Satyamurthy V Parvatkar
 Sadanand N Patil

3. Coupled Fixed Point Results for a Contractive Condition in Ordered Partial 13 – 17

Metric Spaces
 Virendra Singh Chouhan
 Richa Sharma

4. A Theoretical Study of Magnetic Impurity Effect on Superconducting Properties 18 – 21

of Manganese doped MgB2
 Gargee Sharma
 Smita Sharma

5. Role of Information Communication Technology (ICT) in the Development of 22– 26

Smart City.
 Mr. Avinash P. Ingle
 Mrs. Pallavi M. Chaudhari
 Mrs.Archana V. Potanurwar

6. Captcha as a Graphical Password Authentication System (CARP) 27 – 30

 ArchiGaikwad
 Bijal Parekh
 Medha Kona
 ShwetaBramhane

7. A Paper on Weather Forecasting 31 – 34

 Akshat Shrivastava
 Md Arman Ansari
 Laxmi Kanta Kar
 Mukul Kumar

8. Sentiment Analysis on Unstructured Data 35 – 40

 Apurva Joshi
 KalyaniBirgade
 PallaviPetkar
 MrunaliSathone

9. Extending the functionality of Android Clipboard Manager 41 – 45

 Amol D. Gaikwad
 Pratik R. Tambekar
 Pankaj R. Hatwar
 Swapnil R. Ramtekkar

10. A Survey on Travel Based Application Using Social Media 46 – 49

 ShankerShalini
 Dr.M.SheerinBanu
 CONTENTS
S.NO TITLES AND AUTHORS PAGE NO

11. Monotonic behaviour of Generalized Parametric Measure of Intuitionistic Fuzzy 50-54

Entropy
 Taruna
 H D Arora
 The Hurdle of Program Outcomes Attainment and
the Aid of Mathematical Approach
Sapana P. Dubey
Department of Applied Mathematics, Priyadarshini Institute of Engineering Technology, Nagpur, India

Abstract:--Outcome based education system is the need of higher engineering education. It specifies learning objective for the
students. To get the accreditation of a program through NBA, it is required to analyze the attainment of outcomes. Course
Outcome, Program Outcome and Program Specific Outcome are three main outcomes through which we can measure the success
of any program run for the engineering students.
This paper describes the process to quantify the program outcomes using course outcomes. The mathematical approach will be
applied in this process. The performance of the student is the key element of the evaluation of attainment of any program outcome.

Index Terms—Assesment methods, Attainment value,Course outcomes, Program outcome .

contains mathematical formulae. Concluding remark is

I. INTRODUCTION included in section –V.

William G. Spady, is one of the developer of Outcome II. BASICS OF OUTCOMES

Based Education. According to Spady (1994) [1],
“OutcomeBased Education means clearly focusing and
organizing everything in an educational system around
what is essential for all students to be able to do
successfully at the end of their learning experiences. This
means starting with a clear picture of what is important for
students to be able to do, then organizing the curriculum,
instruction, and assessment to make sure this learning
ultimately happens”.
Measure the attainment of the outcomes is the focus of
OBE. Previously, I.Z. Abidin et al [2] work in this field.
The authors developed a method to find CO attainment and
implemented on a computerized system using MS-Excel.
In the same line S. Rawar and S. Karkare [3] work to find
CO% of assessment method.
There are three types of outcomes discussed for
accreditation through NBA.
Course Outcomes
Course outcomes(CO) are connected with each
course (or Subject) included in the program. These are
simple statements which describe expected knowledge and
ability to be developed in the students after completing the
course.
These expectation may be related to some skill,
social behaviour, leadership quality etc. that students
acquire through the course. Example of course outcome is
shown in table-1.

Chethan& Naidu [4] presented a case study on Obeject

Based Education (OBE). They described each and every
aspects of OBE towards the academic excellence.
In [5], authors provided a comparison of traditional
technique and OBE techniques and shows that OBE is an
effective teaching learning process.

The authors of [6] and [7] mentioned the rubrics as the Table 1: Example of CO
measurement tool for the attainment of the program Program outcomes
outcomes.In this paper we present a mathematical Program outcomes (PO) are statements which define the
approach to find attainment of CO, PO and PSO. The paper qualities to be develop in the student after completing the
is divided into five sections. Section-II includes various program. The program outcome defined by NBA[8] are as
outcomes describe in NBA. In section- III, we will discuss follows :
about the tools involve for the attainment. Section-IV 1. Engineering Knowledge
2. Problem Analysis

ISER International Conference Delhi 1

 The Hurdle of Program Outcomes Attainment and the Aid of Mathematical Approach

3. Design/Development of solutions Delivery Mehtod

4. Conduct investigations of complex problems
5. Modern tool usage
6. The engineer and society
7. Environment and sustainability
8. Ethics
9. Individual and team work
10. Communication
11. Project management and finance
12. Life-long learning
Program Specific outcomes
Program outcomes (PO) define general outcomes can be
acquire by the students after completing graduation where
as Program Specific Outcomes (PSO) define the qualities
which are expected to be acquired by the students through
specific graduation program. (i.e. specific branch of
graduation program like Mechanical, Computer Science
and Engineering etc)
Interrelationship between different outcomes
Every course included in the graduation program have their
own course outcomes. These course fullfil the requirement
of the program. That means the course outcomes are
connected with program outcomes as well as program
specific outcomes. The relationship of CO & and PO
represented by the matrix known as CO-PO matrix. In this
matrix each CO is mapped with some PO. Similarly each
CO is also mapped with some PSO.
Chethan& Naidu [4] have described different modes of
course delivery. These modes are
1. Lectures using chalkboard or presentations
interspersed with discussions.
2. Tutorials
3. Demonstrations in laboratory
4. Practical exercises
5. Projects
6. Industrial Training
7. Seminars
There may be some other mode of delivery like group
discussion, group task and organizing the event etc.
Assessment Tools
Assessment method can be divided into two categories
Direct Assessment Method and Indirect Assessment
Method.
These two major categories include following methods
1. Direct Assessment Method
a. Continuous Internal Evaluation Tests (CIET)
b. Semester end Internal Examination (SIE)
c. Semester end University Examination (SUE)
d. Assignments
e. Quizzes
f. Practical Test (Internal & External)
g. Project
h. Seminar
2. In paper [4], Indirect Assessment Methods
includes
a. Employer Survey (Industry Survey)
b. Alumni Survey
c. Parents Survey
d. Student Feedback Survey

III.MATHEMATICAL APPROACH TO
MEASURE ATTAINMENT
IV.
As we have discussed in section III program
outcomes attainment can be measure through CO
attainment.

CO Attainment
The mathematical approach presented in this
paper includes following steps to calculate CO Attainment.
Fig.1 : Relation of CO-PO-PSO 1. Define CO in such a way that every unit can
mapped with a CO. That means, if we have six
Tools towards attainment of outcomes units in the certain course then we must have six
CO related with each unit.
According to [2], after specifying course outcome it is
necessary to design the delivery method and assessment 2. Collect the existing data from various assessment
methods in such a way all stated CO can be attained. tools like marks of various test, assignment,
Delivery method includes all those methods using which seminars etc.
students will able to acquire knowledge. Assessment
method used to ensure the attainment of CO.

ISER International Conference Delhi 2

 The Hurdle of Program Outcomes Attainment and the Aid of Mathematical Approach
3. Correlate marks distribution of each assessment
tool with units of course which will directly
connect the question with COs.
4. Define the % weightage of each CO of a course
corresponding to each assessment tool.
5. Generate Assessment Method-CO matrix (as
described in [2] & [3] ) to show weightage
distribution of the percentage of marks distribution
for each CO. The calculation provide better results
if at least three assessment method include a CO in
their assessment process. Following table 2 shows
the Assessment Method – CO matrix for Applied
Mathematics-I
Table 2: Assessment Method –CO matrix
Each row of the table is describes the distribution of marks
in a particular assessment method. This process is
described in the table below:
Table 3: Marks distribution-CO % distribution
6. Generate the table related to overall percentage
distribution of marks according to the marking
scheme of university. For example according to
RTMNU, Nagpur marks distribution is shown in
table 4.
Table 4: Percentage distribution of marking scheme
We consider that 80% of semester end university
examination plays an important role to find CO%
attainment. As such we subdivide this 80% into two parts –
70% and 10%, considering the fact that university result is
not only dependent on the efforts or methods adopted by
the faculty members of the institute to attained the CO's but
ISER International Conference Delhi
also it depends upon the understanding of the subject by an
individual student and difficulty level of question paper.
7. Both the tables generated in step 5 and 6 are to be
considered for calculation of assessment of COs.
In order to calculate CO's, first of all we calculate
percentage of successful students of each assessment
method and then we apply following formulae for each
CO.
Formulae:
i. CO 1= (16.25% x SUE x 70%) + (SUE x 10%) +
(50% x CIET-1 x 3%) + (20% x seminar x 2%) +
(16.25% x SIE x 4%)
ii. CO 2= (17.50% x SUE x 70%) + (SUE x 10%) +
(50% x CIET-1 x 3%) + (40% x Seminar x 2%) +
(17.5% x SIE x 4%)
iii. CO 3= (16.25% x SUE x 70%) + (SUE x 10%) +
(40% x Seminar x 2%) + (60% x CIET-2 x 3%) +
(15% x SIE x 4%)
iv. CO 4= (16.25% x SUE x 70%) + (SUE x 10%) +
(40% x CIET-2 x 3%) + (40% x Assignment-1 x
4%) + (16.25% x SIE x 4%)
v. CO 5= (17.50% x SUE x 70%) + (SUE x 10%) +
(40% x Assignment -1 x 4%) + (50% x
Assignment -2 x 4%) + (17.5% x SIE x 4%)
vi. CO 6= (16.25% x SUE x 70%) + (SUE x 10%) +
(20% x Assignment-1 x 4%)+(50%x Assignment-
2 x 4%)+ (16.25% x SIE x 4%)
Evaluation of CO is based on CO % from assessment
method and overall percentage distribution of marks. Since
the target of attainment level is set on the basis of pass %
for example “70% students scored more than 40% marks”,
therefore calculation of CO is also related with pass% of
each assessment method.
As per the scheme CO can be 3 (substantially), 2
(Moderately) and 1 (slightly). In our calculation this values
can be obtained in following ranges
CO% (calculated) Attainment values
70 and above 3
Between 70 & 65 2
Between 65 & 50 1
Below 50 0
Table –5: CO ATTAINMENT VALUES
3
 The Hurdle of Program Outcomes Attainment and the Aid of Mathematical Approach
Finally we can find CO attainment for the particular course
using average of the attainment values of CO 1 to CO n.
Attainment of PO and PSO
Each CO will be mapped with one or more PO and PSO.
As discussed in section II relation between CO and PO
represented by CO-PO matrix. We called it Expected PO
Attainment of the course (shown in table- 6) and similar
matrix can be prepared for CO and PSO.
Table – 6 : Expected PO Attainment Corresponding To
Each CO
Actual PO attainment can calculate using CO attainment of
the course. For example if average of CO of a course is
2.83 according to this average PO attainment will be
shown in the table below (highlighted with grey colour)
Table – 7: Expected and Actual PO Attainment
Corresponding To each CO
IV. CONCLUSION
In this paper we have calculated PO and PSO
attainment using CO attainment. The CO attainment is
measured in a structured way through some mathematical
formulae which largely depends on the performance of
students in various assessment methods. This
quantification of CO and PO attainment provide the
academic progress of any program run by an institute, also
it helps to take corrective measure in the direction to
achieve desired outcomes.
REFERENCES
[1] W. G. Spady, “Outcome-based education: Critical
issues and answers”. American Association of School
Administrators, Arlington,VA.ISBN-0-87652-183-
9,p.p 12, 1994.
ISER International Conference Delhi
[2] I.Z. Abidin, A. Anuar,N. H. Shuaib, “Assessing the
attainment of course outcomes (CO) for an engineering
course”, Preceedings of the 2nd International
Conference of Teaching and Learning (ICTI-2009),
INTI University College, Malaysia.
[3] S. Rawat, S. Karkare, “An empirical study on
assessment of CO attainment for a diploma course”,
International Journal of Electronics and
Communication Engineering &Technololgy(IJECET),
ISSN 0976-6464 (print), ISSN 0976-6472 (online), Vol
6, Issue 2, Feb 2015, PP. 06-12
[4] Chethan K.C.S., N V R Naidu, “ Achieving Academic
Excellence through Outcome based education- A case
study”, Journal of Educational Research & Medical
Teacher, 2013, PP 40-47
[5] Shreenivas B.,Archana H. R. , C. Gururaj, Ambika K, “
Leveraging the assesment methods for outcome based
education”, Journal of Engineering Transformations,
Special Issue : Jan 2015, eISSN 2394-1707.
[6] D. Dandge, Dr. S. Desai, “ Rubrics: An effective
assessment tool for outcome-based accreditation”, The
Journal of Engineering Education, July 2013.
[7] T. Y. Mahesh, Y Thomas, K. L. Shunmuganathan, “
Analysis of program outcomes attainment for
engineering graduates for NBA accreditaion”, Journal
of Information Technology and Sciences,Vol-1, No. 2,
2015.
[8] National Board of Accreditation, Self Assessment
Report (SAR) Format, Undergraduate Engineering
Programs (TIER-II), www.nbaind.org, June 2015
4
 On Fuzzy weakly g**-Continuous Maps and Fuzzy
weakly g**-Irresolute Mappings in Fuzzy
Topological spaces
[1]
Satyamurthy V Parvatkar, [2]Sadanand N Patil
[1]
Assistant Professor, Department of Mathematics
KLE Institute of Technology, Hubballi, Karnataka (India)
[2]
Research Supervisor, VTU RRC, Belagavi, Karnataka (India)

Abstract:—The aim of this paper is to introduce new class of Fuzzy sets, namely wg**-closed fuzzy set for Fuzzy topological
spaces.This new class is properly lies between the class of closed Fuzzy set and the class of wg-closed fuzzy set, we also introduce
application of wg**-closed fuzzy sets, the concept of fuzzy wg**-continuous, fuzzy wg**-irresolute mapping, fuzzy wg**-closed
maps, fuzzy wg**-open maps and fuzzy wg**-homeomorphism in Fuzzy topological spaces are also introduced, studied and some
of their properties are obtained.

Classification: 2000 Math Subject classification 54A40

Keywords:—fwg**-closed fuzzy sets, fwg**-continuous, fwg**-irresolute, fwg**-open, fwg**-closed mapping and fwg**-
homeomorphism.

I. INTRODUCTION The class of wg**- closed fuzzy sets is placed

Prof. L.A. Zadeh’s [19] in 1965 introduced of the
concept of ‘fuzzy subset’, in the year 1968, C L. Chang
[4] introduced the structure of fuzzy topology as an
application of fuzzy sets to general topology.
Subsequently many researchers like, C.K. Wong[18],
R.H. Warren [17],R. Lowen[7], A.S. Mashhour[11], K.K.
Azad[1], M. N. Mukherjee[12],G. Balasubramanian&P.
Sundaram [2] and many others have contributed to the
development of fuzzy topological spaces. The image and
the inverse image of fuzzy subsets under Zadeh’s
functions and their properties proved by C.L.Chang [4]
and R.H.Warren [17] are included.
properly between the class of closed fuzzy sets and the
class of wg- closed fuzzy sets. The class of wg**- closed
fuzzy sets is properly placed between the class of closed
fuzzy sets and the class of wg- closed fuzzy sets.
II. PRELIMINARIES
Throughout this paper (X, T), (Y,σ) & (Z,ƞ)or
(simply X, Y & Z) represents non-empty fuzzy
topological spaces on which no separation axiom is
assumed unless explicitly stated. For a subset A of a
space (X, T).cl (A) , int(A) & C(A) denotes the closure,
interior and the compliment of A respectively.

Fuzzy topological spaces and some basic concepts
and results on fuzzy topological spaces from the works of
C.L.Chang [4], R.H.Warren [17], and C.K.Wong [18] are
presented. And some basic preliminaries are included.
N.Levine [7] introduced generalized closed sets (g-closed
sets) in general topology as a generalization of closed
sets. Many researchers have worked on this and related
problems both in general and fuzzy topology. Dr.
SadanandPatil [14, 15 &16] in the year 2009 and R. Devi
and M. MuthtamilSelvan[5] in the year 2004, are
introduced and studied g-continuous maps.
Definition 2.01:A fuzzy set A of afts (X, T) is called:
1) a semi-open fuzzy set, if A ≤ cl(int(A)) and a semi-
closed fuzzy set, if int(cl(A)) ≤ 0 [13]
2) a pre-open fuzzy set, if A ≤ int(cl(A)) and a pre-
closed fuzzy set, if cl(int(A)) ≤ A [13]
3) a α-open fuzzy set, if A ≤ int(cl(int(A))) and a α-
closed fuzzy set, if cl(int(cl(A))) ≤ A [14]
The semi closure (respectively pre-closure, α-closure)
of a fuzzy set A in a fts (X, T) is the intersection of all
semi closed (respectively pre closed fuzzy set, α-closed
fuzzy set) fuzzy sets containing A and is denoted by
scl(A) (respectively pcl(A) , αcl(A)).

ISER International Conference Delhi 5

 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces
Definition 2.02:A fuzzy set A of afts (X, T) is called:
1) a generalized closed (g-closed) fuzzy set, if cl(A) ≤ U
,whenever A ≤ U and U is open fuzzy Set in (X, T). [2]
2) a weakly-generalized-closed (wg-closed) fuzzy
Set, if cl(A) ≤ U , whenever A ≤ U and U is open fuzzy
set in (X, T).[14]
3) a weakly-generalized* closed (wg*-closed) fuzzy set,
if cl(A) ≤ U, whenever A ≤ U and U is open fuzzy set in
(X,T). [14 ,15&16]
Complement of g-closed fuzzy (respectively wg-
closed fuzzy set and wg*-closed fuzzy set) sets are called
g-open (respectively wg-open fuzzy set and wg*-open
fuzzy set) sets.
Definition 2.03: Let X, Y be two fuzzy topological
spaces. A function f: X→Y is called
1) Fuzzy continuous (f-continuous) [14 ,15&16] if f-
1
(B) is open fuzzy set in X , for every open fuzzy set
B of Y
2) Fuzzy generalized- continuous (fg-continuous)
function [14 ,15&16] if f-1(A) is g-closed fuzzy set in
X , for every closed fuzzy set A of Y
3) Fuzzy g*-continuous (fg*-continuous) function[14
,15&16] if f-1(A) is g*-closed fuzzy set in X , for
every closed fuzzy set A of Y
Definition 2.04: Let X, Y be two fuzzy topological
spaces. A function f: X→Y is called
1) Fuzzy -open (f-open) [14, 15&16] iff f (V) is open
fuzzy set in Y, for every open fuzzy set in X.
2) Fuzzy g-open (fg-open) [14, 15&16] iff f (V) is g-
open- fuzzy set in Y, for every open fuzzy set in X.
3) Fuzzy g*-open (fg*-open) [14, 15&16] ifff(V) is g-
open- fuzzy set in Y, for every open fuzzy set in X.
III. WEAKLY g** CLOSED FUZZY SETS
Definitions 3.01: A fuzzy set A of fuzzy topological
space in (X, T) is called weakly g** closed fuzzy sets if
cl(int(A)) ≤ U whenever A ≤ U and U is g*- open fuzzy
set in (X,T).
Theorem 3.02: Every closed fuzzy set is weakly g**
closed fuzzy set.
Proof: Omitted.
The converse of the above theorem need not be true as
seen from the following example.
Example 3.03: Let X={a, b, c} and the fuzzy sets A and
B be defined as follows A={(a,0.4),(b,0.5),(c,0.7)},
B={(a,1),(b,0.9),(c,0.8)}. Let T= {0, 1, A}.Then (X, T) is
ISER International Conference Delhi
afts. Note that the fuzzy subset B is weakly g** closed
fuzzy set in (X, T) but not a closed fuzzy set in (X, T).
Theorem 3.04: Every g** - closed fuzzy set is weakly
g** - closed fuzzy set in (X, T).
Proof: Omitted.
The converse of the above theorem need not be true as
seen from the following example.
Example 3.05: Let X={a,b,c} fuzzy sets A and B be
defined as follows A={(a,0.2),(b,0.5),(c,0.3)} and
B={(a,0.5),(b,0.2),(c,0.3)}. Consider
T= {0, 1, A}.Then (X, T) is fts. The fuzzy set B is wg*-
closed but not g*closed fuzzy set in X.
Theorem 3.06: Every weakly g** closed fuzzy set is
weakly g-closed fuzzy set in fts X.
Proof: Omitted.
The converse of the above theorem need not be true as
seen from the following example.
Example 3.07: In the example 3.05, The fuzzy set B is
wg-closed but not wg**-closed fuzzy set.
Theorem 3.08: Every weakly g** closed fuzzy set is
weakly g*-closed fuzzy set in fts X.
Proof: Omitted.
The converse of the above theorem need not be true as
seen from the following example.
Example 3.09: In the 3.05,The fuzzy set B is wg*-closed
but not wg**-closed fuzzy set.
Theorem 3.10: If a fuzzy set A of afts X is both open
and wg**-closed fuzzy set then it is a closed fuzzy set.
Proof: Suppose a fuzzy set A of fts X is both open and
wg**-closed. Now A ≤ A, A is open and so g*-open.
Then we have cl(int A) ≤ A which implies cl(A) ≤ A
Since A is open. Since A ≤ cl(A), we have cl(A) = A.
Thus A is closed fuzzy set.
Theorem 3.11: If a fuzzy set A is both open and wg**-
closed then it is both regular open and regular closed
fuzzy set.
Proof: Omitted.
Theorem 3.12: If a fuzzy set A of fts X is open and
wg**-closed then A is g*-closed.
Proof: Omitted.
Theorem 3.13: If a fuzzy set A of fts X is open and wg-
closed then A is wg* closed.
6
 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces
Proof: Suppose A is open and wg-closed. Let A ≤ U
where U is g-open. Since A is wg-closed we have
A ≤ A, A is open implies cl(int A) ≤ A ≤ U. That is cl(int
A) ≤ U and hence A is wg*-closed.
Theorem 3.14: If A is wg**-closed fuzzy set and cl(int
A) ∧ (1 cl(int A))=0 then cl(int A) ∧ (1-A) has no non
zero g-closed fuzzy set.
Proof: Suppose F is any g-closed fuzzy set such that F ≤
cl(int A) ∧ (1 A). Now F ≤ 1 A, which implies that A ≤
1 F, 1 F is g-open. Since A is wg*-closed, cl(int A) ≤ 1
F, hich implies F ≤ 1 cl(int A).Thus F ≤ cl(int A) and
F ≤ 1 cl(int A).Therefore
F ≤ cl(int A) ∧ (1-cl(int A)) = 0. Which implies that F =
0. Hence the result follows.
Theorem 3.15: If a fuzzy set A is weakly g** closed
fuzzy set in X such that A ≤ B ≤ cl(int A), then B is also
a weakly g** closed fuzzy set in X.
Proof: Let U be a g-open fuzzy set in X, such that
B ≤ U, then A ≤ U. Since A is weakly g* closed fuzzy
set, then by definitions cl(int(A)) ≤ U. Now int B ≤ B ≤
cl(int(A)),which implies cl(int(B)) ≤ cl(cl(int A) = cl(int
A) ≤ U. That is cl(int(B)) ≤ U. Hence B is a weakly g**
closed fuzzy set.
Theorem 3.16: Let A ≤ Y ≤ X and suppose that A is
wg**- closed in fts X. Then A is wg**-closed relative to
Y.
Proof: Given that A ≤ Y ≤ X and A is wg**- closed
fuzzy set .To prove that A is wg**-closed relative to Y.
Let A ≤ Y ∧ G. Then A ≤ G where G is g*-open in X
Since A is wg** -closed in X. cl(int A) ≤ G. which
implies that cl(int A) ≤ Y ∧ cl(int A) and therefore cl(int
A) ≤ Y ∧ G. Hence A is wg**-closed relative to Y.
We introduce weakly g** open fuzzy set
Definition 3.17: A fuzzy set A of the fts (X,T) is called
weakly g** open fuzzy set if its complement 1 A is
weakly g** closed fuzzy set.
Theorem 3.18: A fuzzy set A of a fts X is weakly g**
open fuzzy set iff F ≤ int(cl A)
Whenever F is g*-closed fuzzy set and F ≤ A
Proof: Omitted.
Theorem 3.19: Every open fuzzy set is a weakly g**
open fuzzy set.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
ISER International Conference Delhi
Example 3.20: Let X= {a,b,c}. Define the fuzzy sets A
and B as follows. A={(a,0.4),(b,0.5),(c,0.7)},
B={(a,0),(b,0.1),(c,0.2)}. Then (X, T) is afts with the
fuzzy topology T= {0, 1, A}. Here the fuzzy set B is
weakly g** open fuzzy set but not a open fuzzy set in X.
Theorem 3.21: If afts every wg**-open fuzzy set is wg-
open.
Proof: Omitted.
The converse of the above theorem need not be
true as shown from the following example.
Example 3.22: In the example 3.20, Here the fuzzy set B
is weakly g closed fuzzy set but not a wg* closed fuzzy
set in X.
Theorem 3.23: If int (cl (A)) ≤ B ≤ A and if A is weakly
g** open fuzzy set, B is weakly g** open fuzzy set in
afts X.
Proof: e have int(cl (A)) ≤ B ≤ A .Then (1 A) ≤ (1
B) ≤ cl(int(1 A)) and since (1 A) is weakly g** closed
fuzzy set and by theorem 2.19 .we have (1 B) is weakly
g** closed fuzzy set in X. Hence B is weakly g** open
fuzzy set is fts X.
Theorem 3.24: Every g*-open fuzzy set is wg**-open.
Proof: Omitted.
The converse of the above theorem need not be
true as shown from the following example.
Example 3.25: In the example 3.20, the fuzzy set
1 B is wg**-open but not g*-open in X.
Theorem 3.26: A Finite union of weakly g** closed
fuzzy set is a weakly g** closed fuzzy set.
Proof: Omitted.
Remark 3.27: The intersection of two wg**-open fuzzy
sets need not be wg** -open.
Fuzzy wg*-closure (wg* cl) and fuzzy wg*-
interior (wg* int) of a fuzzy set are defined as follows.
Definition 3.28: If A is any fuzzy set in afts, then
wg** cl(A)= ˄{U:U is wg**-closed fuzzy set and
A ≤ U}
wg**int(A)= ˅{V:V is wg**-open fuzzy set and
A ≥ V}
Theorem 3.29: Let A be any fuzzy set in a fts (X, T)
Then
wg** cl(A)=wg**cl(1 A)=1 wg**cl(1 A)=1-
wg**int(A) and wg** int(1 A)=1 wg**cl(A)
Proof: Omitted.
7
 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces

Theorem 3.30: In a fts (X, T), a fuzzy set A is weakly
g**-closed iff A= wg** -cl(A).
Proof: Let A be a weakly g** -closed fuzzy set in fts (X,
T).since A ≤ A and A is weakly g** -closed fuzzy set, A
∈ {f:f is weakly g** -closed fuzzy set and A ≤ f} and A ≤
f implies that
A= ˄ {f:f is weakly g** -closed fuzzy set and A ≤ f} that
is A = wg**-cl(A)
Conversely, Suppose that A= wg**-cl(A), that
is A = ˄ { f:f is weakly g** -closed fuzzy set and A ≤ f}.
This implies that A ∈ {f:f is weakly
g** -closed fuzzy set and A ≤ f}. Hence A is weakly
g**-closed fuzzy set.
Example 3.35: In the e ample 3.20, the fuzzy subset 1
B={(a,0.4),(b,0.4),(c,0.5)} is wg -open fuzzy set but not
weakly g** open fuzzy set in X.
Theorem 3.36: In afts X, every weakly g** open fuzzy
set is wg*-open fuzzy set.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Example 3.37: In the e ample 3.20, the fuzzy subset 1
B={(a,0.4),(b,0.4),(c,0.5)} is wg*-open fuzzy set but not
weakly g** open fuzzy set in X.

Theorem 3.31: In fts X be the following results hold for Theorem 3.38: If A ≤ B ≤ X where A is weakly g**
fuzzy weakly g**-closer open fuzzy relative to B and B is weakly g** open fuzzy
1) weakly g**-cl(0)=0 relative to X, Then A is weakly g** open fuzzy relative
2) weakly g**-cl(A) is weakly g**-closed fuzzy to fts X.
set in X Proof: Omitted.
3) weakly g**-cl(A) ≤ weakly g**-cl(B) if
A≤B Remarks 3.39: The following diagram shows the
4) weakly g**-cl(weakly g**-cl(A)) =. weakly relationships of weakly g** closed fuzzy sets with some
g**-cl(A) other fuzzy sets.
5) weakly g**-cl(A ˅ B) ≥ weakly g**-cl(A) ˅
weakly g**-cl(B)
6) weakly g**-cl(A ˄ B) ≤ weakly g**-cl(A) ˄
weakly g**-cl(B)
Proof: The easy verification is omitted.

Theorem 3.32: In a fts X, a fuzzy set A is weakly g**-

open fuzzy set iff A=wg**-int(A).
Proof: Omitted.

Theorem 3.33: In fts X be the following results hold for

fuzzy weakly g**-interior Where
1) weakly g**-int((0)=0 Represents A implies B but not conversely. (A and B are
independent).
2) weakly g**-int(A) is weakly g**-open fuzzy set
in X
3) weakly g**-int(A) ≤ weakly g**-int(B) if IV. FUZZY WEAKLY g** -CONTINUOUS
A≤B MAPPING
4) weakly g**-int(weakly g**-int(A)) = weakly
g**-int(A) In this section the concept of fuzzy wg**-
continuous, fuzzy wg**-irresolute functions and fuzzy
5) weakly g**-int(A˅B) ≥ weakly g**-int(A) ˅
wg**-homeomorphism, fuzzy wg**-open and fuzzy
weakly g**-int(B)
wg**-closed mapping in fuzzy topological spaces have
6) weakly g**-int(A˄B) ≤ weakly g**-int(A) ˄
weakly g**-int(B) been introduced and studied.
Proof: The easy verification is omitted.
Definition 4.01: Let X and Y be two fts. A function f:
X→Y is said to be fuzzy wg**-continuous (briefly
Theorem 3.34: In afts X every weakly g** open fuzzy
fwg**-continuous) if the inverse image of every open
set is wg-open fuzzy set.
Proof: Omitted. fuzzy set in Y is wg**-open fuzzy set in X.
The converse of the above theorem need not be
true as seen from the following example.

ISER International Conference Delhi 8

 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces

Theorem 4.02: A function f: X→Y is fwg**-continuous Theorem 4.09: If f: X→Y is f wg**-continuous and g: Y
iff the inverse image of every closed fuzzy set in Y is → Z is f-continuous, then gof:X→ Z is fwg**-
wg**-closed fuzzy set in X. continuous.
Proof: Omitted. Proof: Omitted.

Theorem 4.03: Every f-continuous function is
fwg**-continuous.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Remark 4.10: The following diagram shows the
relationship of fwg**-continuous maps with some other
fuzzy maps.

Example 4.04: Let X=Y= {a,b,c} and the fuzzy sets A,B
and C be defined as follows. A={(a,0),(b,0.1),(c,0.2)},
B={(a,0.4),(b,0.5),(c,0.7)}, C={(a,1),(b,0.9),(c,0.8)}.
Consider T= {0, 1, B} and
σ = {0, 1, A}. Then (X, T) and (Y,σ) are fts. Define f:
X→Y by f (a) =a, f (b) =b and f(c) =c. Then f is
fwg**-continuous but not f-continuous as the fuzzy set C
is closed fuzzy set in Y and f-1(C) =C is not closed fuzzy
set in X but wg**-closed fuzzy set in X. Hence f is
Where represents A
fwg**-continuous
implies B but not conversely. (A and B are independent).
Theorem 4.05: Every fwg**-continuous function is fwg-
Theorem 4.11: Let X1 and X2 be fts and
continuous.
Pi: X1x X2→Xi (i=1, 2) be the projection mappings. If f:
Proof: Omitted.
X→X1 xX2 is fwg**-continuous then the Piof:X→Xi
The converse of the above theorem need not be
(i=1,2) is fwg**-continuous.
true as seen from the following example.
Proof: Omitted.
Example 4.06: Let X=Y= {a,b,c} and the fuzzy sets
Theorem 4.12: Every f -strongly continuous function is
A,B,C and D be defined as follows.
fwg**-continuous.
A={(a,0.2),(b,0.5),(c,0.3)},
Proof: Omitted.
B={(a,0.8),(b,0.5),(c,0.7)},
The converse of the above theorem need not be
C={(a,0.5),(b,0.2),(c,0.3)}and
true as seen from the following example.
D={(a,0.5),(b,0.8),(c,0.7)}. Consider T={0,1,A} and σ
={0,1,A,B}. Then (X, T) and (Y,σ) are fts. Define f:
Example 4.13:In the example 3.05, the function f is
X→Y by f (a) =b, f (b) =a and f(c) =c. Then f is fwg-
fwg**-continuous but not f -strongly continuous, for the
continuous but not fwg**-continuous as the inverse
fuzzy set C in Y, f-1(C) =C is not both open and closed
image of closed fuzzy set A in Y is f-1(A) =C which is
fuzzy set in X
not wg**-closed fuzzy set in X. Hence f is fwg-
continuous.
Theorem 4.14: Every f -perfectly continuous function is
fwg**-continuous.
Theorem 4.07: Every fwg**-continuous function is
Proof: Omitted.
fwg*- continuous.
The converse of the above theorem need not be
Proof: Omitted.
true as seen from the following example.
The converse of the above theorem need not be
true as seen from the following example.
Example 4.15: In the example 3.05, the function f is
fwg**-continuous but not f-perfectly continuous as the
Example 4.08: In the example 4.06, Then f is fwg*-
fuzzy set A is open in Y and f-1(A) = A is not both open
continuous but not fwg**-continuous as the inverse
and closed fuzzy set in X
image of closed fuzzy set A in Y is f-1(A) =C which is
not wg**-closed fuzzy set in X. Hence f is fwg*-
Theorem 4.16: Every f -completely continuous function
continuous
is fwg**-continuous.

ISER International Conference Delhi 9

 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Example 4.17: In the example 3.05, the function f is
fg**-continuous but not f -completely continuous as the
fuzzy set A is open in Y and f-1(A) =A is not regular-
open fuzzy set in X
We introduce the following.
Definition 4.18: A function f: X→Y is said to be fuzzy
wg**-irresolute (briefly fwg**-irresolute) if the inverse
image of every wg**-closed fuzzy set in Y is wg**-
closed fuzzy set in X.
Theorem 4.19: A function f: X→Y is fwg**-irresolute
iff the inverse image of every wg**-open fuzzy set in Y
is wg**-open fuzzy set in X.
Proof: Omitted.
Theorem 4.20: Every fwg**-irresolute function is
fwg**-continuous.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Example 4.21: Let X = Y = {a,b,c} and the fuzzy sets
A,B,C,D and E be defined as follows.
A= { (a,1),(b,0),(c,0)} , B = {(a,0),(b,1),(c,0)}
C= {(a,1),(b,1),(c,0)}, D = {(a,1),(b,0),(c,1)},
E = {(a, 0),(b,1),(c,1)}. Consider
T = {0,1,A,B,C,D}and σ = {0,1,C }. Then (X, T) and
(Y,σ ) are fts. Define f: X→Y by f(a)=b, f(b) = c and f(c)
= a. Then f is fwg**-continuous but not fwg**-irresolute
as the fuzzy set in E is wg**-closed fuzzy set in Y, but f-
1
(E) = C is not wg**-closed fuzzy set in X. Hence f is
fwg**-continuous.
Theorem 4.22: If f: X→Y is fwg**-continuous, and g:
Y→Z is f-continuous then gof: X→Z is f wg**-
continuous.
Proof: Omitted.
Theorem 4.23: Let f: X→Y, g: Y→Z be two functions.
If f and g are fwg**-irresolute functions then gof: X→Z
is fwg**-irresolute functions.
Proof: Omitted.
Theorem 4.24: Let f: X→Y, g: Y→Z be two functions.
If f is fwg**-irresolute and g is fwg**-continuous then
gof: X→Z is fwg**-continuous.
Proof: Omitted.
ISER International Conference Delhi
Definition 4.25: A function f: X→Y is said to be fuzzy
gc-irresolute (briefly fgc-irresolute) function if the
inverse image of every g-closed fuzzy set in Y is g-
closed fuzzy set in X.
Theorem 4.26: f: X→Y be afgc-irresolute and a f-closed
map. Then f (A) is a wg**-closed fuzzy set of Y, for
every wg**-closed fuzzy set A of X.
Proof: Omitted.
We introduce the following.
Definition 4.27: A function f: X→Y is said to be fuzzy
wg**-open (briefly fwg**-open) if the image of every
open fuzzy set in X is wg**-open fuzzy set in Y.
Definition 4.28: A function f: X→Y is said to be fuzzy
wg**-closed (briefly fwg**-closed) if the image of every
closed fuzzy set in X is wg**-closed fuzzy set in Y.
Theorem 4.29: Every f-open map is fwg**-open map.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Example 4.30: Let X = Y = {a,b,c} and the fuzzy sets
A,B, and C be defined as follows.
A= {(a,0),(b,0.1),(c,0.2)} , B={(a,0.4),(b,0.5),(c,0.7)}
C= {(a,1),(b,0.9),(c,0.8)}. Consider
T = {0,1,A}and σ = {0,1,B }. Then (X, T) and (Y,σ ) are
fts. Define f: X→Y by f(a)=a, f(b) = b and f(c) = c. Then
f is fwg**-open map but not f-open map as the fuzzy set
A open fuzzy set in X, its image f(A) = A is not open
fuzzy set in Y which is wg**-open fuzzy set in Y.
Theorem 4.31: Every fwg**-open map is fwg-open.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Example 4.32: Let X = Y = {a,b,c} and the fuzzy sets
A,B, and C be defined as follows.
A= {(a,0.2),(b,0.5),(c,0.3)},
B = {(a,0.8),(b,0.5),(c,0.7)},
C= {(a,0.5),(b,0.2),(c,0.3)}. Consider
T = {0,1,A}and σ = {0,1,A,B }. Then (X, T) and (Y,σ )
are fts. Define f: X→Y by f(a)=b, f(b) = a and f(c) = c.
Then the function f is fgs-open map but not fwg**-open
map as the image of open fuzzy set A in X is f(A) = C
open fuzzy set in Y but not wg**-open fuzzy set in Y .
Theorem 4.33: Every f-closed map is fwg**-closed map.
Proof: Omitted.
10
 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces
The converse of the above theorem need not be
true as seen from the following example.
Example 4.34: Let X = Y = {a,b,c} and the fuzzy sets
A,B, and C be defined as follows.
A = {(a,0),(b,0.1),(c,0.2)},
B = {(a,0.4),(b,0.5),(c,0.7)},
C = {(a,1),(b,0.9),(c,0.8)}. Consider
T = {0,1,A}and σ = {0,1,B }. Then (X, T) and (Y,σ ) are
fts. Define f: X→Y by f(a)=a, f(b) = b and f(c) = c. Then
f is fwg**-closed map but not f-closed map as the fuzzy
set C is closed fuzzy set in X, and its image f(C) = C is
wg**-closed fuzzy set in Y but not closed fuzzy set in Y.
Theorem 4.35: A map f:X→Y is fwg**-closed iff for
each fuzzy set S of Y and for each open fuzzy set U such
that f-1(S) ≤ U, there is a wg**-open fuzzy set V of Y
such that S ≤ V and f-1(V) ≤ U.
Proof: Omitted.
Theorem 4.36: If a map f: X→Y is fgc-irresolute and
fwg**- closed and A is wg**- closed fuzzy set of X, then
f(A) is wg**- closed fuzzy set in Y.
Proof: Omitted.
Theorem 4.37: If f: X→Y is f-closed map and
h: Y→Z is fwg**- closed maps, then hof: X→Z is
fwg**- closed map.
Proof: Omitted.
Theorem 4.38: Let f: X→Y be an f -continuous, open
and fwg**- closed surjection. If X is regular fts then Y is
regular.
Proof: Omitted.
Theorem 4.39: If f: X→Y and h: Y→Z be two maps
such that hof: X→Z isfwg**- closed map.
i) If f is f-continuous and surjective, then h is
fwg**- closed map.
ii) If h is fwg**- irresolute and injective, then f is
fwg**- closed map.
Proof: Omitted.
Definition 4.40: Let X and Y be two fts. A bijective map
f: X→Y is called fuzzy-homeomorphism (briefly f-
homeomorphism) if f and f-1 are fuzzy-continuous.
We introduced the following.
Definition 4.41: A function f: X→Y is called
fuzzywg**- homeomorphism (briefly wg**-
homeomorphism) if f and f-1 are wg**- continuous.
ISER International Conference Delhi
Theorem 4.42: Every f-homeomorphism is fwg**-
homeomorphism.
Proof: Omitted.
The converse of the above theorem need not be
true as seen from the following example.
Example 4.43: Let X=Y= {a,b,c} and the fuzzy sets A, B
and C be defined as follows. A={(a,1),(b,0),(c,0)},
B={(a,1),(b,1),(c,0)}, C={(a,1),(b,0),(c,1)}. Consider T=
{0,1,A} and σ={0,1,B}. Then (X, T) and (Y,σ) are fts.
Define
f: X→Y by f(a)=a, f(b)=c and f(c)=b. Then f is
fwg**- homeomorphism but not f-homeomorphism as A
is open fuzzy set in X and its image of f(A)=A is not
open fuzzy set in Y. f-1:Y→X is not
f-continuous.
Theorem 4.44: Let f: X→Y be a bijective function. Then
the following are equivalent:
a) f is fwg**- homeomorphism.
b) f is fwg**- continuous and fwg**- open maps.
c) f is fwg**- continuous and fwg**- closed maps.
Proof: Omitted.
Definition 4.45: Let X and Y be two fts. A bijective map
f: X→Y is called fuzzy fwg**- c-homeomorphism
(briefly fwg**- c-homeomorphism) if f and f-1 are fuzzy
wg**- irresolute.
Theorem 4.46: Let X, Y, Z be fuzzy topological spaces
and f: X→Y, g: Y→Z be fwg**- c-homeomorphisms
then their composition gof: X→Z is fwg**- c-
homeomorphism.
Proof: Omitted.
Theorem 4.47: Every fwg**- c-homeomorphism is
fwg**- homeomorphism.
Proof: Omitted.
REFERENCE
[1] K. K. Azad, On fuzzy semi-continuity, fuzzy
almost continuity & fuzzy weakly continuity, J
Math Anal Appl 82, 14-32 (1981).
[2] G. Balasubramanian & P. sundaram, “On some
generalization of fuzzy continuous function, fuzzy
sets & system, 86, 93-100(1997) .
[3] A.S.Bin shahna, On fuzzy strong continuity &
fuzzy pre continuity, fuzzy sets &
system,44,(1991),303-308
[4] C. L. Chang, Fuzzy topological spaces, J Math
Anal Appl 24,182-190 (1968).
11
 On Fuzzy weakly g**-Continuous Maps and Fuzzy weakly g**-Irresolute Mappings in Fuzzy Topological
spaces

[5] R.Devi and M.Muthtamil Selvan, On fuzzy

generalized* extremally disconnectedness, Bulletin
of Pure and Applied Science, Vol.23E (No.1) 2004,
P.19-26.
[6] T.Fukutake, R.K.Saraf, M.Caldas & S. Mishra,
Mapping via Fgp-Closed sets. Bull of Fuku.Univ of
Edu.Vol 52, PartIII (2003) 11-20.
[7] N.Levine, Generalized closed sets in topology,
Rend circ, Math Palermw, 19(2)(1970),89-96.
[8] R. Lowen, Fuzzy topological spaces & fuzzy
compactness, J Math Anal Appl 56,621- 633
(1976).
[9] H.Maki, R.Devi & K.Balachandran, Generalized α-
closed sets in topology, Bulletin of Fakuoka Univ
of Edu. Part III 42: 13-21, 1993.
[10] H.Maki, R.Devi & K.Balachandran, Associated
topologies of generalized α-closed sets and α-
generalized closed set.
Mem.Fac.Sci.KochiUniv.Ser Math,15(1994),51-63.
[11] A.S.Mashhour, I.A.Hasanein and S.N.EI-Deeb,α-
continuous and α-open mappings, Acta Math.
Hung. 41(3-4)1983, 213-218.
[12] M.N.Mukherjee and S.P.Sinha, Irresolute and
almost open function between fuzzy topological
spaces, Fuzzy sets and systems 29(1989), 381-388.
[13] Mukundam.C and Nagaveni.N, A weaker form of a
generalized closed set, IJContemparary
Mathematical Science, vol.6 (20), (2011).
[14] Sadanand.N.Patil, On g#- closed fuzzy set & fuzzy
g#-continuous maps in fuzzy Topological spaces,
proc of the KMANational seminar on Fuzzy Math
& Appl, Kothamangalam (53-79).
[15] Sadanand.N.Patil, On g#-semi closed fuzzy sets
and g#-semi contours maps in Fuzzy topological
spaces. IMS conference Roorkey (UP) (26-30)
Dec2005.
[16] Sadanand.N.Patil, On some Recent Advances in
Topology. Ph.D Theses, Karnataka University,
Dharwad 2008.
[17] M.K.R.S.Veerakumar, g#-semi closed sets in
topology Acta ciencia, Indica. Vol xxix, m No.
1,081(2002).
[18] Pauline Mary Helen M et.al, g**-closed sets in
topological spaces, IJMA-3(5), 2012, 2005-2019.
[19] R.H.Warren, Continuity of Mapping on fuzzy
topological spaces, Notices. Amer. Math. Soc.
21(1974) A-451.
[20] C.K.Wong, covering properties of fuzzy set,
Indiana Univ. Math. JI Vol.26 No. 2(1977) 191-
197. L.A.Zadeh, Fuzzy sets, Information and
control, 8(1965)338-353.

ISER International Conference Delhi 12

 Coupled Fixed Point Results for a Contractive
Condition in Ordered Partial Metric Spaces
[1]
Virendra Singh Chouhan, [2] Richa Sharma
[1]
Department of Mathematics and Statistics, Manipal University, Jaipur, India,
[2]
Research Scholar, Lovely Professional University, Jalandhar, India

Abstract: —In the present paper, we establish some coupled fixed point theorems for a mapping having mixed monotone property
satisfying a contractive condition in partially metric spaces. An example is given to show that our results are proper generalizations
of the existing ones.

Keywords: -- Coupled Fixed Point, Partial Ordered, Complete Metric Space.

I. INTRODUCTION II. PRELIMINARIES

In this section, we give some definitions,

The banach fixed point theorem is probably the
lemma which is useful for main result in this
most well-known fixed point theorem and has been
generalized in several directions by many paper.Definition 2.1: [3], [5]An element
mathematicians. In 1994 Matthews introduced a new is said to be coupled fixed point of the
notion of generalized metric space called partial metric mapping if .
space [7] In which the distance of appoint from itself
may not fixed point from itself may not be zero. The Definition 2.2:[3] Let be a partially ordered set
first result on existence of fixed points in partially and . We say that F has the mixed
ordered sets was given by ran and Reurings [11] who monotone property if is monotone non-
presented their applications to a matrix equation. Many decreasing in and is monotone non-increasing in ,
authors obtained important results on partial metric that is, for any ,
spaces. x_1,
Recently, Bhaskar and Lakshmikantham [3] and
introduced the concept of coupled fixed point and the
mixed monotone property. Furthermore, they proved
some coupled fixed point theorems for mappings which Definition 2.3: [7], [9], [10] Let be a non-empty set.
satisfy the mixed monotone property and gave some A partial metric on is a function such
applications in the existence and uniqueness of a that for all :
solution for periodic boundary value problem. Ciric and (P1) iff ,
Lakshmikantham [5] Later on investigated some more (P2) ,
cupled fixed point theorems in partially ordered sets. (P3)
Many results on coupled fixed points theorems have (P4) .
been extended to partial ordered metric spaces, EG, A partial metric space is a pair such that is a
In[1], [2], [4], [6], [8], [9], [10]. non- empty set and is a partial metric on .
If is a partial metric on , then the function
In this paper, we establish some coupled fixed given by
point theorems in partially metric spaces. We study the
necessary condition for the uniqueness of coupled fixed is a metric on .
point of the given mapping in partially ordered metric
space. We also give example to illustrate our main Definition2.4: [7], [9], [10]Let be a partial
theorem. metric space. Then:
(a) A sequence { } in partial metric space
converges to a point if and only if

ISER International Conference Delhi 13

 Coupled Fixed Point Results for a Contractive Condition in Ordered Partial Metric Spaces

(b) A sequence { } in partial metric space where :[0, [ is a continuous and non-
converges to a point if and only decreasing function such that it is positive in ,
if and ;
; if and only if (i) is continuous or
; (ii) has the following properties :
(c) A sequence { } in partial metric space (a) if a non-decreasing sequence
is called a cauchy sequence if there with then , for all
exists(and is finite) ;
(d) A partial metric space is said to be (b) if a non-increasing sequence
complete if every cauchy sequence { } in with then , for all
converges to a point that is
. (iii) Such that and
.
Lemma 2.5: [7], [9] Let be partial metric space; Then has a coupled fixed point .
(a) { } is Cauchy sequence in if and only Proof: Since (say);
if it is Cauchy sequence in the metric space (say).
; Letting and ;
(b) A partial metric space is complete if and
We denote ( )
only if the metric space is complete;
furthermore,
iff Similarly, ( )
. .
With this notation, we have,
Theorem 2.6: [2]Let be a partially ordered set ,
and let be a partial metric on such that is .
complete. Let be a non-decreasing map with Further for ; we get
respectto . Suppose that the following conditions hold ( ),
for , we have ( ).
We can easily verify that
( )
,
where [ [ is a continuous and non-
decreasing function such that it is positive in , .
and ; We have,
ii) such that , ( )
iii) is continuous in , or
iv) if a non-decreasing sequence converges to ( )
,then for all . and similarly,
Then has fixed point .Moreover ( )
.
( )
III. RESULTS AND DISCUSSION Therefore, by letting:

Theorem 3.1:Let be a partially ordered set and By adding, we have

let be a partial metric on such that is
complete. Suppose the mapping satisfies If there exist ( ) ,
the following condition for all , we have
( ) , then
,
( ) ( )
and is fixed point of and
the proof is finished. In other case ;
for all . Then by using
assumption on , we have,

ISER International Conference Delhi 14

 Coupled Fixed Point Results for a Contractive Condition in Ordered Partial Metric Spaces

.
is a non - negative By condition and equation, we get
sequence and hence possess a limit . Taking limit .
when , we get, It follows that
,
and consequently . By our assumption on , Similarly
we conclude , ie. . .
, We now prove that , . We
. shall distinguish the cases (i), ii(a) and ii(b) of the
Theorem 3.1.
We shall show that { }, { } are Cauchy sequences in
Since is a complete metric space, there exist
and there exist . Suppose that at least one
such that , . We now
{ } or { } be not a cauchy sequence. Then there
show that if the assumption (i) holds, then is
exist and two subsequence of integers with
, such that coupled fixed point of .
As, we have
( ) ( )
Further, corresponding to , we can choose ( )
in such a way that it is smallest integer with
satisfying (7), we have and
( ) ( ) .
Using (7) and (8) and triangle inequality, we get ( ) .
( ) ( ) Therefore, is coupled fixed point of .Suppose
( ) ( ) ( ) now that the condition ii (a) and ii (b) of the theorem
( ) holds.
( ) ( ) ( ) The sequence , .
( )
( )
.
Letting and using (6), we have ( )
.
Letting , we have
Now, we get
( ) ( ) This implies that , similarly, we can
( ) ( ) show that . This completes the theorem.
( ) ( ( ))
Theorem 3.2: Let the hypotheses of Theorem 3.1 hold.
Similarly,
We obtain the uniqueness of the coupled fixed point of
( ) ( ) .
( ) ( ) Proof: Suppose and are coupled fixed
( ) ( ( )) points of , that is, ,
Using (10) and (11), we get and . We shall prove
that .
taking on both sides of By assumption there exist
equation (12) comparable with both of them.
. We define sequences , as follows
, , and
Which is a contraction. Therefore { } and . Since is comparable with ,
{ }areCauchy sequences. we may assume that
By lemma (2.5), { } and { }are Cauchy sequence in .
. Since is complete, hence is By using the mathematical induction, it is easy to prove
also complete, so there exist such that, that

By lemma, we get From (1) and (13), we have

;

ISER International Conference Delhi 15

 Coupled Fixed Point Results for a Contractive Condition in Ordered Partial Metric Spaces

( ) ( )
Similarly, we also have
( )
and RHS of
( )
Adding (14) and (15), we get Thus holds.
Case 3- If
. Then LHS of
This implies ( ) ( )
and RHS of
( )
That is, the sequence is decreasing. Therefore there Thus holds.
exist . Such that Case 4- If
Then LHS of
We shall show that . Suppose to contrary, that ( ) ( )
. Taking the limit as in equation (17), we
get ( )
and RHS of
a contradiction. Thus , that is, ( )
Thus holds.
It implies Case5- If
Then LHS of
Similarly we can show that ( ) ( )
( )
From (20) and (21), we have, , .
and RHS of
Example 3.3: Let [ endowed with the usual ( )
partial metric defined by [ with Thus holds.
. The partial metric space is Thus all the conditions of theorem 3.1 are satisfied.
complete because is complete for any , Therefore F has a coupled fixed point in X.

REFERENCES
Thus is Euclidean metric space which is
complete. 1. H. Aydi, “Some coupled fixed point results on
Consider the mapping defined by partial metric spaces”, lnternational Journal of
. Let us take [ [ Mathematical Sciences, Artical ID 647091,
such that 2011..
Clearly is continuous and has the mixed monotone 2. H. Aydi, “Some fixed point results in ordered
property. Also there are in such partial metric spaces”,
that and arXiv:1103.3680v1(math.GN), 2011.
.
Then it is obvious that is the coupled fixed point 3. T.G. Bhaskar and V. Lakshmikantham, “Fixed
of . point theorems in partially ordered metric spaces
Now, we have following possibilities for values of and applications”, Nonlinear Analysis: Theory,
and such that , . Methods and Apllications, 65(7), 1379-1393,
Case 1- If 2006.
Then clearly ( )
Thus holds. 4. L.Ciric and V. Lakshmikantham, “Coupled
Case 2- If random fixed point theorems for nonlinear
Then LHS of contractions in partially ordered metric spaces”,

ISER International Conference Delhi 16

 Coupled Fixed Point Results for a Contractive Condition in Ordered Partial Metric Spaces

Stochastic and Applications, 27, 1246-1259,

2009.

5. L.Ciric and V. Lakshmikantham,“Coupled fixed

point theorems for nonlinear contractions in
partially ordered metric spaces”, Nonlinear
Analysis: Theory, Methods and Applications 70
(12) , 4341-4349, 2009.

6. L.Ciric, M.O. Olatinwo, D. Gopal, G. Akinbo,

“Coupled fixed point theorems for mappings
satisfing a contractions of rational type on a
partially ordered metric space”, Advances in
Fixed Point Theory, 2 (1), 1-8, 2012.

7. S.G. Matthews, “Partial metric topology, in: Proc

8th summer conference on general topology and
application”, in Annals of the New York
Academy of Sciences, 728, 183-197, 1994.

8. J. G. Mehta and M.L.Joshi, “On coupled fixed

point theorem in partially ordered complete
metric space”, lnt. J. Pure Appl. Sci.
Technol.,1(2), 87-92, 2010.

9. S. J. O'Neill, “Two topologies are better than

one”, Tech. Rep., University of warwick,
Coventry, UK 1995.

10. S. J. O'Neill, “Partial metrics, valuations and

domain theory, in: Proc 11th summer conference
on general topology and application”, in Annals
of the New York Academy of Sciences, 806,
304-315, 1996.

11. A. C. M. Ran, M. C. B. Reurings, “A fixed point

theorem in partially ordered sets and some
applications to matrix equations”, Proc. Amer.
Math. Soc. 132, 1435-1443, 2004.

ISER International Conference Delhi 17

A Theoretical Study of Magnetic Impurity Effect on
Superconducting Properties of Manganese doped
MgB2
[1]
Gargee Sharma, [2] Smita Sharma
[1][2]
Government Dungar College, Bikaner, India

Abstract:-In the present study we investigated the theoretical calculation of Superconducting state parameter (SSP) by doping of
MN on MgB2 superconductor for concentration (x=0.006, 0.007, 0.014, 0.016, 0.020). We use Ashcroft's pseudo potential in
conjunction Random phase approximation (RPA) dielectric screening function with methodology based on BCS- Elias berg
Mc.Millan framework in which material properties like electron-phonon coupling strength (λ) and Coulomb pseudo potential (µ*)
are obtained from the knowledge of electron-ion pseudo potential. The super-conducting state properties like transition
temperature (TC), isotope effect exponent (α) and interaction strength (N0V) are then obtained by using the values of λ, µ* and
<ω2> relevant to the superconductor .It is also observed that addition of Manganese to superconductor MgB2 causes the
parameters λ, µ*, α, N0V, TC decreases with increasing in Manganese concentration. Present calculation also observed that TC for
alloys Mg1-xMnxB2 is excellent agreement with the experimental results. It is observed that the increase in doping concentration of
MN causes all the superconducting parameters to decrease. This suggests decrease in superconducting behavior of MgB2 due to
effect of magnetic impurity MN.

Index Terms—Electron-phonon coupling strength, Isotope effect, Pseudo potential, Transition temperature

parameters of Mg1-xMnxB2system which takes care of

exchange and correlation effects of the electron gas.
I. INTRODUCTION
II. THEORY
There has been a considerable amount of research
undertaken in order to understand the influence of dopants We follow Mc.Millian [6] in a defining electron-
to enhance the super conducting properties of the MgB2 [1]. phonon coupling strength by:
However, it is observed that most of the research work
undertaken has been experimental and only few researches λ ∫ [α (ω) (ω) ω] (1)
have been done theoretically [2],[3].Therefore, we need to
study this compound with various substitutions Where α2 (ω) F (ω) is the spectral function, which when
theoretically, which may lead to electron or hole doping,
appropriately evaluated in the plane – wave approximation
isovalent and magnetic ion substitution. We use the well-
for scattering on the Fermi surface, yield [7].
established pseudo potential methodology based on BCS-
Elias berg- McMillan formulation, in which material
properties like electron-phonon coupling strength (λ) and λ ∫ | ( )| (2)
ω
Coulomb pseudo potential (µ*)are obtained from the
knowledge of electron-ion pseudo potential, dielectric Where q is change in the electron wave vector k in
screening and phonon spectrum which is generally replaced scattering on the Fermi surface, m* is the effective mass of
by the use of a most representative phonon 19. % less likely electron M is the ionic mass, N is the ion number density, k F
to suffer cataracts frequency or an average phonon is the Fermi radius, and
frequency <ω2>. The super-conducting state properties like
transition temperature (Tc), isotope effect exponent (α) and ( )
| |
(3)
interaction strength (N0V) are then obtained by using the ( )
values of λ , µ*, average square phonon frequency <ω2> and
isotopic mass M relevant to the superconductor. We have Represent the screened atomic form factors, where
employed Ashcroft’s empty core model pseudo potential [4] <k+q|V|k>is the matrix element for the electron scattering
and RPA form of dielectric screening due to Gellman and from state |k> to state |k+q|>on the Fermi surface (or bare
Bruckner [5] for determination of superconducting ion potential) and (q) is the dielectric screening function.

ISER International Conference Delhi 18

 A Theoretical Study of Magnetic Impurity Effect on Superconducting Properties of Manganese doped MgB2

On using x= q/2kF and experimental property of the superconductor.

III. RESULTS AND DISCUSSIONS

We obtain electron-phonon coupling strength (λ) [8]:
λ ∫ | ( )|
ω
Where 0 is atomic volume and z* is the effective
valence of ions, m* is the component of effective mass of
electron.
The repulsive interaction between electron in a
superconductor is given by the coulomb pseudopotential
(µ*), which on representing band mass by mb=m*and Debye
temperature by θD is given [9] by
The input parameters relevant to the components of
Mg1-xMnxB2system have been assembled in Table I. We
have used mb=m* for the sake of uniformity.The values of
m*, <ω2>, z*, M for the Mg1-xMnxB2system under
(4) investigation are obtained from the relevant values for the
component by using Vegard’s rule [12], viz.
, (12)
The value of θD for the Mg1-xMnxB2system is computed
from the relevant values by using Grimvall’s formula [13]:
, (13)

Table I.Input Parameters.[1],[14]-[18]

∫ ( )
µ (5) Data Component metals
[ ( )∫ ]
θ ( ) Mg B Mn
m* 1.01 1.394 0.84
The relevant expression for the transition temperature Tc M(au)×104 4.4345 1.8440 10.0820
[10] and isotope effect exponent (α) have been obtained by kF(au) 0.7242 1.2177 0.90
Mc.Millian [6] from the solution of the Eliashberg equation. 0(au) 156.819 51.824 81.9
z* 2 3 1
θ ( λ)
{ ( )} (6) <ω2>×10- 0.76389 7.4598 0.8026
λ ( λ) 6
(au)
θ λ
θD(K) 400 1250 410
α [ (µ ) ] (7)
( λ)
And the relevant expression for effective interaction Table II .Superconducting parameter of Mg1-xMnxB2
strength (N0V) [11] has been obtained in the following form
SSP’s Concentration x
0.006 0.007 0.014 0.016 0.020
(8) λ 1.1279 1.0975 0.8841 0.7777 0.5008
For obtaining screened pseudo potential Vs(x) , empty
µ* 0.1722 0.1721 0.1720 0.1720 0.1720
core model pseudo potential Vb(x) due to Ashcroft [4] and
(x) obtained in Random phase approximation (RPA) [5] Tc(K) 30.93 29.37 18.25 12.67 1.5
screening for Mg1-xMnxB2 system used in the present Cal.
investigation are as given (in a.u.) below : Exp(K) 30.9 29.3 18.6 12.6 0.00
[19]
α 0.4201 0.4169 0.3867 0.3516 0.1009
(9)
where N0 V 0.4719 0.4632 0.4016 0.3548 0.2259

(10) Table II. Shows the computed values of Superconducting

parameter of
, (11)
Mg1-xMnxB2 system by using Ashcroft's potential
with Random phase approximation screeningIt is observed
Here rc is the potential parameter, which represents
there is gradual decrease in all superconducting state
effective atomic core radius .The value of rc for a
properties of MgB2 as doping of Manganese is increased.
superconductor is obtained by fitting it to some

ISER International Conference Delhi 19

 A Theoretical Study of Magnetic Impurity Effect on Superconducting Properties of Manganese doped MgB2
We note that the electron-phonon interaction strength (λ)
goes on decreasing from the value 1.1279 to 0.5008 as the
concentration of Mn is increased from 0.006 to 0.020. The
decrease in the value of electron-phonon interaction strength
(λ) with increasing concentration of Mn shows decrease in
strong coupling behavior to weak coupling behaviour of
MgB2. This may be attributed to Mn that occupies Mg sites
thus decreasing the electron-phonon coupling between Mg
and B. “Fig.”.1 shows the behavior of electron-phonon
interaction strength (λ) for different concentrations of Mn
.Coulomb pseudo potential (µ*) show almost constant
behavior with increase in Mn doping.
The transition temperature (Tc) also show a sharp
decline from 30.93K to 1.5K with increase in Mn
concentration, which suggests that the superconductivity is
suppressed as doping of magnetic impurity in MgB 2
increases. It is observed that Tc decrease up to 1.5K which
approximately equals 0K which superconductivity almost
vanishes for doping concentration 0.020 of Mn .The T c
values obtained theoretically are in agreement with the
experimental results [19]. The variation of T c with the
concentration of Mn in Mg1-xMnxB2system has been shown
in “Fig.”. 2 along with experimental data.
Fig. 1: Variation of λ with Mn- Concentration (at. %) in
Mg1-xMnxB2 alloys.
Fig. 2: Variation of Tc with Mn- Concentration (at. %) in
Mg1-xMnxB2 alloys.
Decrease in values of isotope effect exponent (α)
from 0.4201to 0.1009 and effective interaction strength
(N0V) from 0.4719 to 0.2259also indicate change of strong
superconducting behavior to weak superconducting
behavior with the increase of magnetic doping (Mn).
ISER International Conference Delhi
IV. CONCLUSION
The present investigations show that all the
superconducting parameters go on decreasing with the
increase in magnetic and isovalent impurity. The magnitude
of electron - phonon interaction strength (λ) and transition
temperature (Tc) indicates that Mg1-xMnxB2 system is strong
to weak coupling superconductor. Present computations
yield results which are in agreement with the experimental
data.
REFERENCES
[1] K.S.Sharma, N.Bhargava, R. Jain, V. Goyal, R. Sharma
and S. Sharma, Ind. J. Pure & Appl.Phys.48- 59 (2010).
[2] P.Parisiades, E.Liarokapis, N.D.Zhigadlo, S.Katrych,
“Raman Investigations of C-, Li- and Mn-Doped
MgB2” J. Supercond 22,pp:169–172,(2009).
[3] L. Shi, S.Zhang, H.Zhang, “ Effects of Co and Mn
doping on the structure and superconductivity of
MgB2”, Solid State Communications 147 ,pp: 27–30,
(2008).
[4] N.W. Ashcroft: Phys. Lett. 23, 48 (1966).
[5] M. Gellmann and K.A.Brueckner: Phys.Rev. 106,364
(1958).
[6] W. L. Mc Millan :Phys.Rev. 167 ,331(1968).
[7] S.Sharma, K.S. Sharma and H.Khan :Supercond
.Sci.Technol. 17, 474 (2004).
[8] H. Ehrenreich, F.Seitz and D.Turnbull in: Solid State
Physics (New York: Academic Press) Vol 24, (1970).
[9] P.Morel and P.W .Anderson:Phys.Rev.125, 1263
(1962).
[10] P. B. Allen and R.C. Dynes: Phys. Rev.B12, 905
(1975).
[11] J. S Rajput and A. K .Gupta: Phys.Rev. 181, 743
(1969).
[12] H.Khan,V.Singh and K.S.Sharma, Indian J.Pure &
Appl.Phys. 31 628, (1993).
[13] Grimvall, Thermodynamic properties of Materials, pp,
49 (Amsterdam, North Holland, 1986).
[14] K.Hirata, Y.Waseda, A.Jain, R. Srivastava
J.Phys.F:Metal Phys.Vol.7 No:3,1977, “Resistivity of
20
 A Theoretical Study of Magnetic Impurity Effect on Superconducting Properties of Manganese doped MgB2

liquid transition Metals &their alloys using the t–

matrix”, Printed in Great Britian, 1977

[15] J.S.Ononiwu; Phys.stat.Sol. (b) Calculation of

Electrical Resistivity of Liquid Transition Metals,
177,413 (1993).

[16] A.O.EAnimalu; Phys.ReviewB, Volume8, 15.Oct.1973.

[17] J. Emsley, The Elements, 3rd Edition (Oxford Univ.

Press, Oxford, 1998).

[18] C. Kittel, Introduction to Solid State Physics 7th

Edition (Wiley, NewYork, 1996).

[19] K.Oganisian, Unconventional Superconductivity in

MgB2, Phd Thesis (Polish Academy of Science,
Wroclaw, Poland 2012).

ISER International Conference Delhi 21

 Role of Information Communication Technology
(ICT) in the Development of Smart City
[1]
Mr. Avinash P. Ingle, [2] Mrs. Pallavi M. Chaudhari, [3] Mrs.Archana V. Potanurwar
[1][2][3]
Assistant Professor, Department of Information Technology, Priyadarshini Institute of Engineering and
Technology, Nagpur, India

Abstract -By 2030, the world's population is projected to be 8.5 billion and increase to 9.7 billion by 2050 and 11.2 billion by 2100.
Half of humanity today lives in cities. Many cities are experiencing exponential growth as people move from rural areas in search of
better jobs and education. Consequently, cities' services and infrastructures are being stretched to their limits in terms of
scalability, environment, and security as they adapt to support this population growth. Visionaries and planners are thus seeking a
sustainable, post-carbon economy to improve energy efficiency and minimize carbon-emission levels. Along with cities' growth,
innovative solutions are crucial for improving productivity (increasing operational efficiencies) and reducing.

Optimized management of energy resources.This

I. INTRODUCTION
A smart city is an ultra-modern urban area that
addresses the needs of businesses, institutions, and
especially citizens. Here we should differentiate between a
smart city and smart urbanism. The objective of these
concepts is the same—the life of citizens. The architects of
ancient cities did not take into consideration long-term
scalability—housing accessibility, sustainable
development, transport systems, and growth—and there is
no scalable resource management that may be applied from
one decade to another. Unfortunately, smart urbanism is
not well represented in smart cities' development. Smart
urbanism must also be considered as an aspect of a smart
city, including information-communication technologies.
In recent years, a significant increase in global energy
consumption and the number of connected devices and
other objects has led government and industrial institutions
to deploy the smart city concept. Cities' demographic,
economic, social, and environmental conditions are the
major reasons for the dramatic increase in pollution,
congestion, noise, crime, terrorist attacks, energy
production, traffic accidents, and climate change. Cities
today are the major contributors to the climate problem.
They cover less than 2% of the Earth's surface yet consume
78% of the world's energy, producing more than 60% of all
CO2 emissions.
II. OBJECTIVES:
Innovative solutions are imperative to address
cities' social, economic, and environmental effects. Those
solutions involve three key objectives:
objective could be realized through the Internet of Energy
(IoE), or smart grid technology. The IoEa, connects energy
grids to the Internet, dispatching units of energy as needed,
representing a set of distributed renewable electricity
generators linked and managed through the Internet. The
IoE enables accurate, realtime monitoring and optimization
of power flows;
Decentralized energy production.TheIoE concept
allows consumers to be energy producers themselves,
using renewable energy sources and combined heat and
power units; decentralization enables smarter demand-
response management of consumers' energy use.
Integrated business models and economic models.
These models describe how organizations should deliver
and reap benefits from their services (such as transport,
energy consumption, and charging tolls); such models must
be designed to support city development.
Safety and security. This includes surveillance
cameras, enhanced emergency-response services, and
automated messages for alerting citizens; realtime
information about a city should be available
Environment and transportation. This entails
controlled pollution levels, smart street lights, congestion
rules, and new public-transport solutions to reduce car use;
Home energy management. Options include timely energy
billing, optimal energy management, saving, perhaps,
30%–40% on electricity bills; the European Commission
estimates approximately 72% of European electricity
consumers will have smart meters by 2020;

ISER International Conference Delhi 22

 Role of Information Communication Technology (ICT) in the Development of Smart City.
Educational facilities. More investment is needed
to improve educational opportunities for all, lifelong
learning, education through remote learning, and smart
devices in classrooms;
Tourism. Preserving a city's natural resources
promotes the growth of tourism; additionally, smart
devices offer direct and localized access to information;
Citizens' health. Using new technologies could improve
people's health; citizens need full access to high-quality,
affordable healthcare, and wireless body-area network
technology—including sensors attached to the body or
clothes and implanted under the skin—can acquire health
information (such as heartbeat, blood sugar, and blood
pressure) and transmit it in real time or offline through a
smartphone to remote servers accessible by healthcare
professionals for monitoring or treatment.
III. IMPLEMENTATION AND DEPLOYMENT
Designing and deploying smart cities needs
experts from multiple fields, including economics,
sociology, engineering, ICT, and policy and regulation.
Various frameworks describing the architecture of smart
cities have been proposed by both industry and academic
sources. One of the most widely adapted and adopted
models is the reference model proposed by the U.S.
National Institute of Standards and Technology. Smart
cities are complex systems, often called "systems of
systems," including people, infrastructure, and process
components. Most smart cities models consist of six
components: government, economy, mobility,
environment, living, and people. The European Parliament
Policy Department said in 2014 that 34% of smart cities in
Europe have only one such component.
Multiple approaches and methods have been
proposed to evaluate smart cities from multiple
perspectives, including an urban Internet of Things (IoT)
system for smart cities, sustainability, global city
performance, future urban environments, urban
competitiveness, and resilience. But several fundamental
architectural components must be in place to make a city
smart.
ISER International Conference Delhi
3.1 Essential components.The basic underpinnings of a
smart city include five components:
Fig 1: Smart City: Internet of Things
Broadband infrastructure.This infrastructure is
pivotal, offering connectivity to citizens, institutions, and
organizations. However, today's Internet lacks the
robustness needed to support smart cities' services and data
volume. It includes both wired and wireless networks.
Wireless broadband is important for smart cities, especially
with the explosive growth of mobile applications and
popularity and the connectivity of smart devices;
E-services. The concept of "electronic services"
involves using ICT in the provision of services, including
sales, customer service, and delivery. The Internet is today
the most important way to provide them (such as for
tourism, city environment, energy, transport, security,
education, and health). A European Union research
initiative (called the innovation framework H2020) focuses
on developing such e-services; and
Open government data. Open government data
(OGD) means data can be used freely, reused, and
redistributed by anyone. A multinational initiative to
promote worldwide adoption of OGD was launched in
2012 with input from the Microsoft Open Data initiative,
Organization for Economic Cooperation and Development,
and U.S. Open Data Initiative.
Sustainable infrastructures.The International
Electrotechnical Commission (IEC) says cities aiming to
develop into smart cities should start with three pillars of
sustainability: economic, social, and environmental. One of
the first steps in addressing sustainability is to increase
resource efficiency in all domains (such as energy,
23
 Role of Information Communication Technology (ICT) in the Development of Smart City.
transport, and ICT). An efficient and sustainable ICT
infrastructure is essential for managing urban systems
development. Adepetuet al.1 explained how an ICT model
works and can be used in sustainable city planning. For a
sustainable ICT infrastructure, they defined various green
performance indicators for ICT resource use, application
lifecycle, energy impact, and organizing impact.
E-governance. This component focuses on a
government's performance through the electronic medium
to facilitate an efficient, speedy, transparent process for
disseminating information to the public and also for
performing administration activities. An e-government
system consists of three components: government-to-
citizen, government-to-business, and government-to-
government. E-government allows citizens to fulfill their
civic and social responsibilities through a Web portal. A
growing number of governments around the world are
deploying Web 2.0 technologies, an architecture referred to
as "e-government 2.0," linking citizens, businesses, and
government institutions in a seamless network of
resources, capabilities, and information exchange.
IV. FUNDAMENTAL TECHNOLOGIES.
The design and implementation of smart cities also
involves a number of technologies:
4.1 Ubiquitous computing.Ubiquitous devices include
heterogeneous ones that communicate directly through
heterogeneous networks. To support a smart and
ubiquitous environment, telecommunication
infrastructures, Lee said, should be enhanced to provide a
better understanding of networks, services, users, and
users' devices with various access connections. Lee also
identified six capabilities and functions of smart ubiquitous
networks including context awareness, content awareness,
programmability, smart resource management, autonomic
network management, and ubiquity.
4.2 Big data. Traditional database management tools and
data processing applications cannot process such a huge
amount of information. Data from multiple sources (such
as email messages, video, and text) are distributed in
different systems. Copying all of it from each system to a
centralized location for processing is impractical for
performance reasons. In addition, the data is unstructured.
Deploying thousands of sensors and devices in a city poses
significant challenges in managing, processing, and
interpreting the big data they generate. Big data,reflecting
such properties as volume, variety, and velocity, is a broad
term for complex quantitative data that requires advanced
tools and techniques for analyzing and extracting relevant
information. Several challenges must be addressed,
including capture, storage, search, processing, analysis,
and visualization.
ISER International Conference Delhi
4.3 Networking. Networking technologies enable devices
and people to have reliable communications with one
another. Several wireless networking technologies,
including radio frequency identification (RFID), ZigBee,
and Bluetooth, have been deployed, although they are
limited by the number of devices they can support, along
with their throughput and transmission range. New
wireless technologies (such as WiMAX and Long-Term
Evolution) are unsuitable due to their high energy
consumption. Novel Wi-Fi technology (such as by the
IEEE 802.11ah Task Group) could be an efficient solution
for smart city services.
4.4 Cloud computing. Cloud computing enables network
access to shared, configurable, reliable computing
resources. The cloud is considered a resource environment
that is dynamically configured to bring together testbeds,
applets, and services in specific instances where people's
social interaction would call for such services;
4.5 Service-oriented architectures (SOAs). AnSoA is a
principle for software structuring based on service. A smart
city's development should focus on SOA-based design
architectures to address its challenges. A smart city thus
requires a new IT infrastructure, from both a technical and
an organizational perspective.
4.6 Cybersecurity architectures. Smart cities pose
challenges to the security and privacy of citizens and
government alike. The security issues associated with the
information produced in a smart city extend to
relationships among those citizens, as well as their
personal safety. Some smart cities are already confronted
by identity spoofing, data tampering, eavesdropping,
malicious code, and lack of e-services availability. Other
related challenges include scalability, mobility,
deployment, interoperability (of multiple technologies),
legal, resources, and latency.
V .CHALLENGES AND RESEARCH
OPPORTUNITIES
Here, we highlight some of the challenges faced
by smart cities while exploring research opportunities that
need more attention to assist smart city development and
adoption.
5.1 Challenges.
The following are the most noteworthy challenges
to be addressed. Lack of investment. The concept of smart
cities reflects strong potential for investment and business
opportunities. On the one hand, investment in related
projects has grown in recent years, financed by both
governments (including municipalities and public research
agencies) and private entities (companies and citizens).
Navigant Research says investment in smart cities is
divided into smart government, smart building, smart
24
 Role of Information Communication Technology (ICT) in the Development of Smart City.
transport, and smart utilities. By 2020, $13 billion in
funding is expected to establish smart cities all over the
world . Yet according to a 2014 research report on
financing models for smart cities, Navigant Research said
this infrastructure faces major financial hurdles, including
the perceived high risk of investing in innovative solutions,
uncertainty of energy price policies, major investment
required, long-term delays before reaping profits, and
limited capacity for public funding.
Cost. Many cities are committing large budgets to
get smarter. In India, the national government's annual
budget for development of 100 smart citiesh is $1.27
billion, adding 11.5 million homes annually. In the
European Union, smart city market projections are
expected to exceed $1 trillion by the end of 2016. China's
future smart cities allocations exceed $322 billion for more
than 600 cities nationwide. All these projects demonstrate
how substantial is the rate of investment in smart cities.
However, if some of the challenges (such as cybersecurity)
are not addressed early, the ultimate cost of smart cities
will only increase.
High energy consumption. The U.S. Energy
Information Administration estimates approximately 21%
of the world's electricity generation was from renewable
energy in 2011, with a projected increase to nearly 25% by
2040. The absence of natural resources in the estimation of
energy consumption for the rest of the 21st century plays a
negative role in smart cities investments (see Figure 3).
The future of energy cost and access is uncertain due
primarily to their dependence on projected geopolitical,
socioeconomic, and demographic scenarios.
Smart citizens. Social dimensions must also be
taken into consideration. A city's "smartness" greatly
depends on citizens' participation in smart city projects,
through multiple communication tools (such as a
municipality's Web portal, social networks, and
smartphone applications). Smart cities need citizens to be
continuously connected—in public places, in public
transportation, and at home—in order to share their
knowledge and experience. The objective is effective
management of natural resources and a higher quality of
life for citizens; for example, they can compare their
household use of electricity, gas, and water through their
smartphones.
Privacy. Privacy will play a pivotal role in any
smart city strategy. Citizens interact with smart city
services through their smartphones and computers
connected through heterogeneous networks and systems. It
is thus imperative smart cities, founded on the use of ICT,
be adept at handling important privacy issues (such as
eavesdropping and confidentiality).
ISER International Conference Delhi
Cyberattacks.As with any infrastructure, smart
cities are prone to cyberattack, and the current attack
surface for cities is wide open. In 2015 identified several
challenges, including vulnerabilities in the transfer of data,
physical consequences for cyberattacks, collection and
storage of large amounts of data in the cloud, and
exploitation of city data by attackers. Detecting behavioral
anomalies in daily human life is very important for
developing smart systems.
5.2 Research opportunities.
IoT management. The IoT needs an efficient,
secure architecture that enhances urban data harvesting. As
others have noted, ubiquitous and collaborative urban
sensing integrated with smart objects can provide an
intelligent environment. Otherwise, packet latencies and
packet loss are inevitably not controllable. One such
proposal is the Mobile Ad hoc Networks (MANET)
coordination protocol to opportunistically exploit MANET
nodes as mobile relays for the fast collection of urgent data
from wireless sensor networks without sacrificing battery
lifetime. Simulation results show that their cluster
formation protocol is reliable and always delivers over
98% of packets in street and square scenarios. Other issues,
including the convergence of IoT and intelligent
transportation systems require further investigation.
Data management. Data plays a key role in a
smart city. A huge quantity of data will be generated by
smart cities; understanding, handling, and treating it will be
a challenge. However, mobile phone data can help achieve
several smart city objectives. Smartphone data can be used
to develop a variety of urban applications. For example,
transportation analysis through mobile phone data can be
applied for estimating road traffic volume and transport
demands. Real-time information from mobile-phone data
about the origins of visitors combined with taxis' Global
Positioning System data could help manage transportation
resources, as in, say, the public's future demand for taxis.
VANET security. In smart cities, efficient security
support is an important requirement of VANETs. One
consideration is how to secure them by designing solutions
that reduce the likelihood of network attacks or even how
to diminish the effect a successful attack could have on
them.Several security challenges persist in the realm of
authentication and driver-behavior analysis. A smart city
needs lightweight, scalable authentication frameworks that
protect drivers from internal and external attackers.
VI. CONCLUSION
The strong interest by municipal and local
governments worldwide in smart cities stems from their
ability to improve their citizens' quality of life. Here, we
described some of the basic concepts of smart cities,
25
 Role of Information Communication Technology (ICT) in the Development of Smart City.
identifying challenges and future research opportunities to
enable large-scale deployment of smart cities. Developers,
architects, and designers should now focus on aspects of
IoT management, data management, smart city assessment,
VANET security, and renewable technologies (such as
solar power). We underscore when designing smart cities,
security and privacy remain considerable challenges that
demand proactive solutions.
REFERENCES
1. Adepetu, A., Arnautovic, E., Svetinovic, D., and de
Weck, L. Complex urban systems ICT infrastructure
modeling: A sustainable city case study. IEEE
Transactions on Systems, Man, and Cybernetics:
Systems 44, 3 (Mar. 2014), 363–374.
2. Akselrod, G., Argyropoulos, C., Hoang, T., Ciracì, C.,
Fang, C., and Huang, J. Probing the mechanisms of
large Purcell enhancement in plasmonicnanoantennas.
Nature Photonics 8 (2014), 835–840.
3. Amaba, B. Industrial and business systems for smart
cities. In Proceedings of the First International
Workshop on Emerging Multimedia Applications and
Services for Smart Cities. ACM Press, New York,
2014, 21–22.
4. Angelidou, M. Smart cities: A conjuncture of four
forces. Cities 47 (Sept. 2015), 95–106.
5. Debnath, A., Chin, H., Haque, M., and Yue, B.A
methodological framework for benchmarking smart
transport cities. Cities 37 (Apr. 2014), 47–56.
6. Desouza, K. and Flanery, T. Designing, planning, and
managing resilient cities: A conceptual framework.
Cities 35 (Dec. 2013), 89–99.
7. Domingo-Ferrer, J. A three-dimensional conceptual
framework for database privacy. Chapter in Secure
Data Management, W. Jonker and M. Petkovic, Eds.
Springer, Berlin, Heidelberg, Germany, 2007, 193–202.
8. Ferreira, D. AWARE: A Mobile Context
Instrumentation Middleware to Collaboratively
Understand Human Behavior. Ph.D. dissertation,
Faculty of Technology, University of Oulu, Oulu,
Finland, 2013
9. Huang, L., Chen, X., Mühlenbernd, H., Zhang, H.,
Chen, S., Bai, B., Tan, Q., Jin, G., Cheah, K., Qiu, C.,
Li, J., Zentgraf, T., and Zhang, S. Three-dimensional
optical holography using a
plasmonicmetasurface.Nature Communications 4, 2808
(Nov. 2013).
10. Jagadish, H.V., Gehrke, J., Labrinidis, A.,
Papakonstantinou, Y., Patel, J., Ramakrishnan, R., and
Shahabi, C. Big data and its technical challenges.
Commun. ACM 57, 7 (July 2014), 86–94.
11. Khorov, E., Lyakhov, A., Krotov, A., and Guschin, A.
A survey on IEEE 802.11ah: An enabling networking
technology for smart cities. Computer Communications
58, 1 (Mar. 2015), 53–69.
ISER International Conference Delhi
12. Lausch, A., Schmidt, A., and Tischendorf, L. Data
mining and linked open data—New perspectives for
data analysis in environmental research. Ecological
Modelling 295, 10 (Jan. 2015), 5–17.
13. Lee, C., Gyu, M., and Woo, S. Standardization and
challenges of smart ubiquitous networks. IEEE
Communications Magazine 51, 10 (Oct. 2013), 102–
110.
14. Lee, J., Gong, M., and Mei-Chih Hu, H. Towards an
effective framework for building smart cities: Lessons
from Seoul and San Francisco. Technological
Forecasting and Social Change 89 (Nov. 2014), 80–99.
15. Ma, Y., Wu, H., Wang, L., Huang, B., Ranjan, R.,
Zomaya, A., and Jie, W. Remote sensing big data
computing: Challenges and opportunities. Future
Generation Computer Systems 51 (Oct. 2015), 47–60.
16. Martinez-Balleste, A., Perez-Martinez, P., and Solanas,
A. The pursuit of citizens' privacy: A privacy-aware
smart city is possible. IEEE Communications Magazine
51, 6 (June 2013), 136–141.
17. Mitchell, R. and Chen, I. Behavior-rule-based intrusion
detection systems for safety-critical smart grid
applications. IEEE Transactions on Smart Grid 4, 3
(Sept. 2013), 1254–1263.
18. Perttunen, M., Riekki, J., Kostakos, V., and Ojala, T.
Spatio-temporal patterns link your digital identities.
Computers, Environment and Urban Systems 47 (Sept.
2014), 58–67.
19. Pires, S., Fidélis, T., and Ramos, T. Measuring and
comparing local sustainable development through
common indicators: Constraints and achievements in
practice. Cities 39 (Aug. 2014), 1–9.
20. Rifkin, J. The Zero Marginal Cost Society: The Internet
of Things, The Collaborative Commons, and The
Eclipse of Capitalism. St. Martin's Press, St. Martin's
Griffin, New York, 2015.
21. Sheldon, M., Van de Groep, J., Brown, A., Polman, A.,
and Atwater, H. Plasmoelectric potentials in metal
nanostructures. Science 346, 828 (Nov. 2014), 828–
831.
26
 Captcha as a Graphical Password Authentication
System (CARP)
[1]
ArchiGaikwad, [2]Bijal Parekh, [3]Medha Kona[4]ShwetaBramhane
[1][2][3]
Department of Information Technology
YeshwantraoChavan College of Engineering

Abstract -We face many security breaching issues for our desktop applications and online services. Many internet applications
commonly use text based passwords for authentication. Text based passwords are prone to many attacks such as online guessing
attacks , relay attacks ,shoulder surfing and are usually hard to remember. Graphical password proves to be a much better
alternative to overcome these attacks. This paper introduces the use of Captcha as Graphical Password- CaRP to enhance the
security at the time of login. CaRP is the combination of both graphical password and captcha technology. This system allows the
user to select different visual login schemes. CaRP is one of the reasonable solutions that provide added security.

Keywords:---Captcha, CaRP , hotspot, dictionary attack, Graphical password password guessing attack, security primitive.

I. INTRODUCTION

To keep the computers secure and to authenticate

users, text based passwords are generally used. Long and
random passwords provide added security but since they
are difficult to remember, users tend to use passwords
which are short and common which makes the system
vulnerable to various attacks. The most common attacks
include online guessing attack, relay attack, shoulder
surfing, dictionary attack, etc. The two major goals of any
password authentication system must include the use of
strong passwords while maintaining the remembrance of
the password.
1.1 What is CAPTCHA ?
Captcha is defined as completely automated
public turing tests to tell computer and human apart. The
distorted image that can be recognized by a human is
generated by captcha. Since extraction of the text from a
distorted image is difficult for a computer, captcha is used
which is easily understood by a human user.
1.2 Captcha as Graphical Password (CaRP)
The combination of two technologies namely,
graphical passwords and captcha technology gives us
CaRP system. The generation of CaRP makes use of
alphanumeric characters. The password in a CaRP image is
created by clicking the points on that image. The CaRP
system generates new image for attempt made to log into
the system. The sequence of the click points chosen by the
user is of utmost importance.
Figure 1: Detailed Scheme of CaRP[3]
II. CAPTCHA SCHEMES
The various captcha schemes used in this paper are defined
as follows:
2.1. Scheme 1- Click Text
This is a detection based scheme with CaRP
property. This scheme involves randomly arranged
characters in CaRP challenge image. Basic thumb rule is
that challenge image should not contain any visual
complicated characters like as “0” and “O” alphabet. Basic
CaRP challenge image for ClickText is shown in Figure 3.
Following are steps for this scheme:
Step 1: User registers on system by giving details along
with username and password. This password is sequence of
alphabets. e.g. P = “KBDAY”.
Step 2: When user needs to login to the system with Click
Text Scheme, then user has to provide username. User will
get CaRP challenge image form by captcha engine to
provide click-based password. This challenge image is
nothing but randomly arranged alphabets.
Step 3: User click on alphabets occur in CaRP challenge
image. Here to provide proper login password, user has to
click on alphabets refers to password string i.e. P =
“KBDAY”. Here click sequence is essential.

ISER International Conference Delhi 27

 Captchaas a Graphical Password Authentication System (CaRP)
Step 4: While creating CaRP challenge image synchronize
of each alphabet is recorded. When user click on alphabets
these provided co-ordinates is send to the server. Server
then gets letters from co-ordinates. String from these letters
is formed and matched with authentic string of password.
Step 5: If username and password matched then user will
redirect to next page else user will redirect to login page
again
Figure 2: Flow chart of CaRPauthentication[2]
Figure 3 : Click Text CaRP[2]
2.2. Scheme 2 - Text Points
This is a detection-recall based scheme. In this
scheme, to insert a key, a user must trace the click points in
a CaRP challenged image, and click the uniform points
matching the password. In this case uniform point means a
ISER International Conference Delhi
point in particular alphabet that has a stable relative
position in different fonts. User has to provide arrangement
of such uniform points by choosing particular alphabet at
time of registration. When user wants to login then he will
get CaRP challenge image consist of registered alphabet.
User has to trace and click approximate positions in
alphabet which he used at time of registration. Following
are steps for Text Points:
Step 1: At time of registration user select alphabet and
select string of uniform points as a password shown in
Figure. 4 (in red color). Authentication server stores user
details along with password hash value containing alphabet
and respective uniform point co-ordinates as original
details.
Step 2: When user try to login then he has to give
username along with he has to copy uniform points which
is password sequence shown in Figure. 4
Step3: Authentication server matches these point sequence
with original credentials. If these point string is as expected
then user will be authenticated else user will switch to
login page again. Figure. 4 Text Points CaRP challenge
image. Here following are some precautions to be taken
while performing image processing and generation of
CaRP challenge image. x While generating this CaRP
challenge image, clickable points are kept independent and
care is taken that they should not overlay. The resistance
region should not be overlay. At time of authentication
user clicks represents grid-cells. If clicks are within
resistance then it is true. This grid-cell sequence
accomplish by user clicks is matched with genuine
password i.e. genuine grid-cell sequence given at time of
registration.
Figure 4 : Text Points[3]
2.3. Scheme 3 - Click Animal
This is a recognition based scheme. In this
scheme, to enter a password, a user must trace the
sequence points in a CaRP challenged image, and click the
invariant points matching the password. In this case
invariant point means a point on particular animal that has
a fixed relative position in different fonts. User has to
provide sequence of such invariant points by selecting
particular alphabet at time of registration. When user wants
28
 Captchaas a Graphical Password Authentication System (CaRP)

to login then he will get CaRP challenge image containing

registered animal. User has to trace and click relative
positions in alphabet which he used at time of registration.

Following are steps for Click Animal:

Step 1: At time of registration user select an animal and
select sequence of invariant points . Authentication server
stores user details along with password hash value
containing animal and respective invariant point co-
ordinates as authentic details.
Step 2: When user try to login then he has to provide
username along with he has to imitate invariant points
4. Password Generated
which is password sequence . In ClickText, the user need to select the alphabets as
Step 3: Authentication server matches these point sequence password upto 5 character length. Then, the password will
with authentic details. If these point sequence is as be generated and stored in the database.
expected then user will be authenticated else user will
redirect to login page again.

III. IMPLEMENTATION

1.Home Screen
The home screen comprises of Registration form
for new user and login window for registered user. And
selection procedure of different schemes.

5. Click Animal
In click animal, user needs to select an animal from the
grid of animals. And then user need to select invariant
points on that particular image ,and image and points of
that particular username will be stored in database.

2. Registration Form
A new user needs to fill a simple registration form
in order to access the system. The registration form
comprises of simple fields that need to be filled by the user
and then click on signup button.

6. Password Recovery using email

In case an unauthorized user tries to open ones account ,
then the account will get locked , if the image and point
selection is wrong. Then the authorized user can recover
the account using three different techniques i.e, recovery of
password by email, security question and mobile number.

3. Scheme 1: Click Text

The user need to select the scheme that one wants to access
or through which one would like to enter into the system.
The first scheme is ClickText , user need to click on
checkbox placed before ClickText caption.
7. Password Recovery using Security Question
In this recovery option , authorized user need to select the
security question that he choose at the time of registration

ISER International Conference Delhi 29

 Captchaas a Graphical Password Authentication System (CaRP)

phase and need to specify the correct answer that he/she [3] Click and session based - Captcha as Graphical
provided at the registration time. Then account will be Password Authentication Scheme for smart phone and
recovered. web, 2015 International Conference on Information
Processing (ICIP) Dec 16-19, 2015.

[4] R.Biddle, S. Chiasson, and P. C. van Oorschot,

“Graphical passwords:Learning from the first twelve
years,” ACM Computer Surveys, vol. 44, no. 4, 2014.

[5]B. B. Zhu et al., “Attacks and design of image

recognition CAPTCHAs,” in Proc. ACM CCS, 2010.

8. Password Recovery using Mobile Number [6]Design and Implementation of Password-based Identity
The authorized user need to provide their mobile number Authentication System-2010 International Conference
,then recovery code will be provided on their mobile on Computer Application and System Modeling
number to unlock the account. (ICCASM 2010).

[7] P. C. van Oorschot, A. Salehi-Abari, and J. Thorpe,

“Purely automated attacks on pass points-style
graphical passwords,” IEEE Trans. Inf. Forensics
Security, vol. 5, no. 3, Sep. 2010.

[8] S. Chiasson, P. C. van Oorschot, and R. Biddle,

“Graphical password authentication using cued click
points,” in Proc. ESORICS, 2007.
IV. CONCLUSION

In this paper, security schemes are stated. CaRP, a new

security system which provides solutions for various
online attacks. This is nothing but a new graphical
password technique which combines with new approach
called Captcha. This technique is used while every login
attempt to make sure system is independent of online
guessing attacks. This password technique is very difficult
to hack passwords generated by CaRP. CaRP is found
probabilistically. It also helps to resort many other attacks
like Captcha relay attacks, shoulder-surfing attacks. In this,
the schemes introduces are Text Point, Click Text, Click
Animal. These techniques are easier to use than any other
techniques. This scheme has better remembrance than
traditional password schemes. CaRP has good potential for
making quality password system.

REFERENCES

[1] Captcha as Graphical Passwords—A New Security

Primitive Based on Hard AI Problems IEEE
TRANSACTIONS ON INFORMATION FORENSICS
AND SECURITY, VOL. 9, NO. 6, JUNE 2014.

[2] The Graphical Security System by using CaRP. 2015

International Conference on Energy Systems and
Applications (ICESA 2015) Dr. D. Y. Patil Institute of
Engineering and Technology, Pune, India 30 Oct - 01
Nov, 2015.

ISER International Conference Delhi 30

 A Paper on Weather Forecasting
[1]
AkshatShrivastava, [2]MdArman Ansari, [3]LaxmiKantaKar[4]Mukul Kumar

Abstract -Weather Forecasting is a scientific estimation of fore-casting the weather. Weather is observing the state of atmosphere at
the given period of time. To predict the weather is one of the most challenging task to all the researchers and scientist. Parame-ters
that are considered for predicting weather are temperature, rainfall, humidity and wind. The weather android app shows the
weather conditions of the surrounding. The app is designed to be simple and intuitive as possible. This app will use the
OpenWeatherMap as a data channel and the weather updates will be tiny so that you would not use up any significant internet
bandwidth. The app will support geo-positioning to retrieve the weather conditions for your current location. Manual location input
will also be supported. The app will include a weather map to show rain, wind speed and temperature and detailed 5 day forecast
graphs. The app will have intuitive, seamless user interface and simple design.

Keywords:---Weather Forecasting, OpenWeatherMap, Graphs, An-droid, Temperature.

2). Weather by Storm Radar Apps. This provides Real-Time

I. INTRODUCTION
Weather forecasting is the application which
combines sci-ence and technology to predict the state of
atmosphere for future time at a given location. Weather
forecast is very important because it can be used to protect
life and property. Weather forecasts are based on
temperature; wind speed and relative humidity are very
important attributes in agriculture sector as well as many
industries which largely depend on the weather condition.
Therefore identifying these parameters has become a
challenging task. Many researchers have highlighted that
most of the changes in the climatic conditions are mostly
due to the global weather changes. Therefore if these
weather changes are identified, effective prediction
techniques can be planned. WeaKits is an app which uses
OpenWeatherMap API to fetch the data from the server.
This API contains all the informations about all the weather
parameters so we can use JSON object to extract the
information from the API. This app not only forecast the
weather but its also shows the graphical comparison on
weather parameters (Temperature, Rain, etc.). This system
is designed to improve the working of existing system. It is
user-friendly app, lightweight and free of cost unlike other
premium apps.
The Existing Apps on weather forecast are:
1). Weather by Quark Ltd. This app provides the weather
information to user and forecast the weather details for next
12 days. But this app didn’t implement the weather graph
and weather map module. The weather graph is used to
graphically differentiate the variation in weather over the
time which is helpful to normal peoples. The main
drawback of this app that it force the user to give 5 star
rating for full functionality of the app.
weather information to user and 24 hours forecast instantly
no matter where you are. But you have to pay to have a
widget which is main drawback of this app.
There are also various apps available for weather
forecasting.
All Apps have their advantages and disadvantages also.
Our app is simple in design and user friendly. Our app
implements total 3 modules:
a). Weather Forecast
b). Weather Map
c). Weather Graph
Weather Map and Weather Graph is used for better
understand-ing of weather variations over the time. Our app
use those modules for graphical representation of weather
information. Our app also support widget which is also free
of cost so the user can access all the features of app. As our
data is fetched from the OpenWeatherMap server so the data
is stored securely on the cloud. To access the cloud
OpenWeatherMap generates a unique API key for users. So
only authorized user can access the weather infromation
from the cloud.
II. LITERATURE SURVEY
In this section we discuss the different methodologies
review or literature review and motivation outcomes from it.
A. A Review of Weather Forecasting Models-Based on
Data Mining and Artificial Neural Networks
A large amount of the world population relies mostly on the
monsoons. These monsoons have a great impact on the
livelihood of the Indian families where cultivation is a major
source of livelihood. Many models have been developed and

ISER International Conference Delhi 31

 A Paper on Weather Forecasting
utilized for prediction, forecasting of the weather data based
on techniques such as data mining, time series analysis,
neural networks. In this paper a brief review of the works
carried out in this area in the recent past are presented. The
main drawbacks of the system are require more data and
computer time for training and there are no structured
methods to identify what network structure can best
approximate the function.
B. A machine-learning approach for climate prediction
using network measures
We present the toolbox ClimateLearn to tackle problems in
climate prediction using machine learning techniques and
climate network analysis. The package allows basic
operations of data mining, i.e. reading, merging, and
cleaning data, and running machine learning algorithms
such as multilayer artificial neural networks and symbolic
regression with ge-netic programming. Because spatial-
temporal information on climate variability 5 can be
efficiently represented by complex network measures, such
data are considered here as input to the machine-learning
algorithms. As an example, the toolbox is applied to the
prediction of the occurrence and the development
of El Nino in the equatorial Pacific, first concentrating on
the occurrence of El Nino events one year ahead and second
on the evolution of sea surface temperature anomalies with a
lead time of three months. The drawbacks of this system are
can generate large trees that require pruning,Harder to
classify is greater than 2 classes and Can be affected by
noise.
C. A Review of Weather Forecasting Using Data Mining
Techniques
The vast dramatically changes occurs day by day in certain
fields due to the development of advanced technology and
nature one such among them is rainfall. The rainfall is the
fragment of the agriculture and unable to understand the
monsoon condition, predicating the crop yield and the soil
fertility. Data mining is the techniques used to extract the
knowledge from the set of data.This paper provides a survey
of different data mining techniques being used in weather
prediction or forecasting which helps the farmer for yield
worthy productive and nourish the soil fertility such as
artificial feed-forward neural networks (ANNs), fuzzy
inference system, decision tree method, time series analysis,
learning vector Quantization (LVQ) and biclustering
technique. The drawback of this system is no guarantee for
finding optimal solutions in a finite amount of time.
D. A Review Computational Intelligence in Weather
Forecast- ing
Since 1990s, computational intelligence models have been
widely used in several applications of weather forecasting.
Thanks to their ability to have powerful pattern
classification and pattern recognition capabilities. This
ISER International Conference Delhi
paper presents an overview of using the various
computational intelligence tools in weather forecasting,
describing the main contributions on this field and providing
taxonomy of the existing proposals according to the type of
tools used. the drawback of this system are accurate weather
prediction is a difficult task due to dynamic change of
atmosphere, It is susceptible for predict weather in large
areas at a time.
E. Security SLA based Monitoring in Clouds
Nowadays, Cloud providers revise the terms of their Service
Level Agreements (SLAs) to include security provisions due
to their criticality for their customers. In order to speed up
their adoption by service providers and consumers and to
make them more actionable, security SLAs monitoring
should be described in a machine-processable, agile and
extensible way. Several tools for SLA management are
available on the market but most deal with performance
metrics and do not refer to security properties. There are
other tools for monitoring cloud security, in a non-SLA
way. However, they are not associated with SLA
management systems. We propose an extension to an SLA
language (i.e., rSLA) to enable the description of security
requirements in an SLA document. We also extend the
rSLA framework by a security methodology that makes use
of known tools and that enables continuously checking that
the security requirements are respected during runtime
according to the SLA document.
F. A survey on weather forecasting to predict rainfall
using big data analytic
Big data is defined as a large amount of data which requires
new technologies to make possible to extract value from it
by capturing and analysis process.0T Analytics often
involves studying past historical data to research potential
trends. Weather prediction has been one of the most in-
teresting and fascinating domain and it plays a significant
role in meteorology. Weather prediction is to estimate of
future weather conditions. Weather condition is the state of
atmosphere at a given time in terms of weather variables
like rainfall, thunderstorm, cloud conditions, temperature,
pressure, wind direction etc.Predicting the weather is
essential to help preparing for the best and the worst of the
climate. This paper presents the review of big data analytics
for Weather Prediction and studies the benefit of using it.
The drawback of this system are it cannot predict the
weather short term efficiently, they used only small limited
areas for weather forecasting.
III. SYSTEM OVERVIEW
The user use this app to fetch the weather parameters details
form the OpenWeatherMap server. To fetch the information
OpenWeatherMap generates a unique API key from which
we can extract the information by using JSON Object in
32
 A Paper on Weather Forecasting

Android. This app used for agricultural purposes to know

the conditions of weather in their area and plan their work
according to it.

Fig. 1. System Architecture

IV. ANALYSIS
The android users can easily install the WeaKits Weather
App to get the weather information like rain, temperature
humidity, pressure etc. of their area. The app will ask the
user to enter the location manually if the location is not
fetched automatically. The user will get all the required
information mentioned above with a simple user interface.
The data will also be available in the graphical form for
better analysis.
A. Roles of User in the System:
1). Admin- The mobile user should have the permission to
install the application and working internet allowance to use
the app properly. The mobile user will get the permission to
use the feature of the app.
2). User- The user will use this app to show all weather
parameters information from the OpenWeatherMap server.
The user simply search the city or detect his location to see
the weather detail’s.
V. PROPOSED SYSTEM
Thousands of apps are released everyday, stable as well as
with bugs. This weather app has features and new
implementations as follows:

ISER International Conference Delhi 33

 A Paper on Weather Forecasting

i). Light weighted [5] Nesrine Kaaniche, Mohamed Mohamed, Maryline

ii). Support multiple units Laurent, Heiko Lud-wig, ”Security SLA based
iii). Support for widget Monitoring in Clouds”, Issue, 2017.
iv). Simple design and user interface v). Detailed graphical
representation [6] Muthulakshmi A, ME (SE), Dr.S.Baghavathi Priya ”A
Our App is totally based upon the OpenWeatherMap Server. survey on weather forecasting to predict rainfall using
The data is provided by the OpenWeatherMap to users by big data analytics”, Issue, 2015.
the means of API key. The API key is used to provide the
security to cloud as only authorized user can access the
weather information from the cloud. To extract the
information from the API key we use JSON(JavaScript
Object Notation) Object Android concept.JSON object
holds key/value pair. Each key is represented as a string in
JSON and value can be of any type. The cloud is updated
continuously over the time which is more accurate as
compared to previous approaches.

VI. CONCLUSION

Thus hereby we conclude that the proposed system removes

all the drawback of the existing system and enhanced with
the graphical maps, widget support and light weight. The
proposed system gives the improved version pre-existing
system with better user interface and other features. It
provides the detailed solution to the existing system.

VII. ACKNOWLEDGMENT

We want to thank our guide Mr. Balika J.Chelliah for his

continue support and also for his encouraging and also
fruitful advises in accomplishing this task.

REFERENCES

[1] G.Vamsi Krishna, ”A Review of Weather Forecasting

Models-Based on Data Mining and Artificial Neural
Networks”, Issue, 2015.

[2] Qing Yi Feng, Ruggero Vasile, Marc Segond, Avi

Gozolchi-ani, Yang Wang, Markus Abel, Shilomo
Havlin, Armin Bunde,

and Henk A. Dijkstra, ”A machine-learning approach for

climate pre-diction using network measures ”, Issue,
2016.

[3] Ms.P.Shivaranjani, Dr.K.Karthikeyan, ”A Review of

Weather Forecasting Using Data Mining Techniques”,
Issue, 2016.

[4] Nazim Osman Bushara and Ajith Abraham, ”A

Review of Computational Intelligence in Weather
Forecasting ”, Issue, 2013.

ISER International Conference Delhi 34

 Sentiment Analysis on Unstructured Data
[1]
Apurva Joshi, [2]KalyaniBirgade, [3]PallaviPetkar[4]MrunaliSathone
[1][2][3][4]
Assistant Professor
Department of Information Technology,
YeshwantraoChavan College of Engineering Nagpur (MS), India

Abstract -An enormous growth of the WWW has been instrumental in spreading social networks. Due to many-fold increase in
internet users taking to online reviews and opinions, the communication, sharing and collaboration through social networks have
gained importance. The rapid growth in web-based activities has led to generation of huge amount of unstructured data which
accounts for over 80% of the information. Exploiting big data alternatives in storing, processing, archiving and analyzing this data
becomes increasingly necessary. Unstructured data refers to information that either does not have predefined data model or is not
organized in a predefined manner. Unstructured data is being constantly generated via call center logs, emails, documents on the
web, blogs, tweets, customer comments, customer reviews and so on. While the amount of data is increasing rapidly, the ability to
summarize, understand and make sense of such data for making better decision remain challenging. So thus there is a need of
sentiment analysis on unstructured data. In this paper we are describing what is sentiment analysis and methodology of analyzing
on unstructured data .We have done analysis on various data sets from twitter , blogs and movielen.com site using r statistical
language and output are visualized in the form of word cloud and histogram.We have created GUI’s for analysis of this datasets by
which users can easily analyze the data.

Index Terms:—R, sentiment analysis,word cloud;

data. It is used to track attitudes and feelings on the web

I. INTRODUCTION
Social network have changed the way in which
people communicate. The use of social networks allows for
the sharing of content between people in an easier ,faster
way. People express themselves through text ,music and
videos on various sites such as Twitter, Facebook, Blogs
etc .Information available from social network is used for
analysis of peoples opinion for example looking at a
response of people for particular product we can decide
whether to buy it or not. But as this data is growing fastly
and is overloaded, it is tedious task to analyzemanually .
Unstructured data is a data which does not reside
in column row format. Unstructured textual data is being
constantly generated via call center logs, emails,
documents on the web, blogs, tweets, customer comments,
customer reviews, and so on. While the amount of textual
data is increasing rapidly, ability to summarize,
understand, and make sense of such data for making better
decisions remain challenging. This paper takes a quick
look at how to organize and analyze textual data from a
large collection of documents and for using such
information to improve performance.
Sentiment analysis is all about opinion mining
implies extracting opinions ,emotions and sentiment from
specially for measuring performance of product, services
,and brands. Sentiment analysis is the process of
identifying whether a piece of writing is positive, negative
, neutral .It is known as opinion mining because it derives
opinion or attitude of a speaker. Sentiment analysis is a
new area which deals with extracting user opinion
automatically.
Consider an example of positive sentiment is
“Asus Zenfone2 is a good model.” Alternatively a negative
sentiment is “Asus Zenfone2 is not working properly.” So
accordingly we can analyze the views of people. So in this
paper we are gathering the data of particular entity, person
from different data sources i.e.twitter,blogs,movie data set
and analyzing it and producing a output which shows
negative and positive sentiment of that entity, person or a
word cloud which describes the data.
II. LITERATURE SURVEY
There are actually many sources
of unstructured data, which accounts for much of the data
growth that we've seen in the enterprise, academics and
social media. Experts estimate that 80 to 90 percent of the
data in any organization is unstructured. And the amount of
unstructured data in enterprises is growing significantly.

ISER International Conference Delhi 35

 Sentiment Analysis on Unstructured Data

1. Sentiment Analysis and Feedback
EvaluationFeedback Evaluation is a necessary part of
any institute to maintain and monitor the academic
quality of thesystem. Traditionally, a questionnaire
based system is used to evaluate the performance of
teachers of an institute. Here, they propose an
automatic evaluation system based on sentiment
analysis, which shall be more versatile and meaningful
than existing system. In their proposed system,
feedback is collected in the form of running text and
sentiment analysis is performed to identify important
aspects along with the orientations using supervised
and unsupervised machine learningAbove paper is
analyzing the feedback and according a teacher graded
in school.
the misunderstanding by conveying the internal state
of the users. They divide the framework into two
modules, namely Training Module and Emotion
Extraction Module. They utilize the concept of
Exploratory Data Warehouse (DW) technology to train
system. Therefore, DW relies not only on internal data
but also on external (Web) data. The DW is used by
the Emotion Extraction Module to detect the emotion
of a given text.
III. METHODOLOGY
We have extracted data from three different
sources i.e.twitter, blogs,movielenwebsite.So first dataset
is twitter.

2. Sentiment Analysis of Movie Reviews and Blog Posts 1. Twitter Data Set: Flowchart of analyzing tweets
This paper presents their experimental work on of Twitter:
performance evaluation of the SentiWordNet approach
for document-level sentiment classification of Movie
reviews and Blog posts. They have implemented
SentiWordNet approach with different variations of
linguistic features,scoring schemes and aggregation
thresholds. They have used two pre-existing large
datasets of Movie Reviews and two Blog post
datasets on revolutionary changes in Libya
andTunisia. We have computed sentiment polarity and
also its strength for both movie reviews and blog
posts. The paper also presents an evaluative account of
performance of the SentiWordNet approach with two
popular machine learning approaches: Naïve Bayes
and SVM for sentiment classification.

3. Extracting New Product Ideas from Consumer

BlogsThispaper introduces a web mining approach for
automatically identifying and extracting new product
ideas frominternet blogs. There are a large amount of
web logs for nearly each topic, where consumers
present their needs for new products. These new
product ideas are valuable to producers, researchers
and developers because they can lead to a new
product development process, a well-known task in Figure 1: Flowchart of analyzing tweets of Twitter
marketing. However, the current approach towards
extraction of these new product ideas involves 1: Gather Tweets
employed analysts to process these blogs manually Collecting tweets on a particular entity or person to
and extract the new product ideas. Here, presented is analyze .
an automated approach towards the extraction of new
product ideas through knowledge extraction and using 2: Clean Tweets
scripting languages, which not only eliminates human White spaces, special symbols, numbers are
error, but also speeds up the entire process of new removed.
product idea extraction.
3: Characterize Tweets
4. An Intelligent Framework for Text-to-Emotion Characterize the sentiments in positive, negative and
AnalyzerThispaper proposes an intelligent framework neutral
to detect the emotion of a text. Automatic derivation
of the emotion from text is a challenge as it minimizes

ISER International Conference Delhi 36

 Sentiment Analysis on Unstructured Data

4: Analyze Tweets
Calculate the score of positive ,negative and neutral 4.Analyze Tweets
sentiment To analyze tweets function is used
analysis<score.sentiment(tweets_txt,pos.words,neg.words)
5: Output
In any desirable format like histogram, pie diagram, 5.Output
word cloud format, frequency distribution, mean ,median To display the results:
etc. hist(analysis$score)

Firstly to access tweets from twitter we have to 2.Blogs Dataset

do handshake authorization with twitter using our own
twitter account using following code : Flowchart of analyzing blogs:

consumer_key<-‘xyz’
consumer_secret<-'abc’
access_token<-‘asd’
access_secret<-‘fdg’
setup_twitter_oauth (consumer_key,
consumer_secret,access_token,access_secret)the consumer
key ,consumer secret ,access token ,access secret are
private account keys.

Following are the R commands to execute above process:

1.Gather Tweets:
To gather tweets from twitter first we install
following packages Figure 2: Flowchart of analyzing blogs
install.packages(twitteR)
install.packages(RCurl) 1.Gather Blogs:
we can search required tweets using following command Blogs are extracted from the site blogger.com in the
tweets<- searchTwitter("corruption",n=10,lang="en") .csv format.

2.Clean Tweets: 2.Clean Blogs:

To clean tweets Plyr and StringR package are White spaces, special symbols, numbers ,unwanted
required. words are removed.
All the spaces,punctuation marks ,special symbols are
removed. 3.Word Cloud:
install.package(plyr) Output of the analysis is visualized in form of word
install.package(stringR) cloud.
then code for removing unwanted things is Following are the R commands to execute above process:
sentence<- gsub('[[:punct:]]', "", sentence)
sentence<- gsub('[[:cntrl:]]', "", sentence)  This are packages required to extract, clean,
sentence<- gsub('\\d+', "", sentence) analyze and create a word cloud:
sentence<- tolower(sentence) require("tm")
word.list<- str_split(sentence, '\\s+') require("SnowballC")
words<- unlist(word.list) require("wordcloud")
require("RColorBrewer")
 To clean the data following commands are
required:
3.Characterize Tweets: jeopCorpus<-Corpus(VectorSource(jeopQ$genres))
To characterize positive and negative words are tdm = TermDocumentMatrix(jeopCorpus,
separated and stored and matched with dictionary of control = list(remove
positive and negative words. Punctuation = TRUE,
pos.matches<- match(words, pos.words) stopwords = c("the","this", stopwords("english")),
neg.matches<- match(words, neg.words) removeNumbers = TRUE,
pos.matches<- !is.na(pos.matches) tolower = TRUE))
neg.matches<- !is.na(neg.matches)

ISER International Conference Delhi 37

 Sentiment Analysis on Unstructured Data

IV. RESULTS
 Word cloud is created by : 1.Twitter Dataset:
wordcloud(jeopCorpus, min.freq = 1, The output for twitter analysis is
max.words=200,random.order=FALSE, rot.per=0.35,
colors=brewer.pal(8, "Dark2"))

3.Movie Dataset

Flowchart of analyzing movie dataset:

Figure 4: In tabular format

Figure 3: Flowchart of analyzing movie dataset

1.Extract data
Extract the data from movielen.com website in
.csvformat.The dataset contains three .csv files i.e. Figure 5: Histogam
movies.csv which contains name and the respective genres
of movie. Above is the output for the code in which the
tweets are scored and according to that histogram is drawn.
2.Connect to Database
Connection to sqlite database. 2.Blogs Dataset
The outputs for blog analysis are:
3.Analysis
Analysis is done according to the classification of
genres of movies or according to year in which this
releases,etc.

4.Output
Output is visualized in the form of wordcloud and
histogram.Commands require by this analysis is same as
blog analysis.Also the GUI is prepared for twitter, blog and
movie analysis through which user can easily analyze the
data for their use.This is created in R using the package
called “shiny”.Inshiny,two files need to be created ui.r and
server.r. Both files are connected ui file shows the display
and server file computes the analysis.

Figure 6:Word Cloud

ISER International Conference Delhi 38

 Sentiment Analysis on Unstructured Data

Figure 9: Word cloud for genres of movie

Figure 7:Histogram for blogs

Figure 10:Histogram for movie dataset

Figure 8: Freqeuncies in table format

Figure 11: Frequencies for the same

4.GUI’s

3.Movielen Dataset
The outputs for movie dataset analysis are:

Figure 12: GUI for twitter analysis

ISER International Conference Delhi 39

 Sentiment Analysis on Unstructured Data

software Engineering, Volume 3, Issue 12, December

2013 pp no (91-97)

2. Agarwal, A., Xie, B., Vovsha, I., Rambow, O.,

Passonneau, R.: Sentiment analysis of twitter data. In:
Proc. ACL 2011 Workshop on Languages in Social
Media. pp. 30–38 (2011)

3. Barbosa, L., Feng, J.: Robust sentiment detection on

twitter from biased and noisy data. In:Proceedings of
COLING. pp. 36–44 (2010)

4. Davidov, D.; Tsur, O.; and Rappoport, A. 2010.

Figure 13: GUI for blog analysis
Enhanced sentiment learning using twitter hashtags
and smileys. In Proceedings of Coling.

5. V. K. Singh, M. Mukherjee and G. K. Mehta,

“Combining Collaborative Filtering and Sentiment
Analysis for Improved Movie Recommendations”, In
C. Sombattheeraet. al. (Eds.):

6. Multi-disciplinary Trends in Artificial Intelligence,

LNAI 7080,Springer-Verlag, Berlin-Heidelberg, pp.
38-50, 2011.

7. V. K. Singh, M. Mukherjee and G. K. Mehta,

Figure 14: GUI for movie dataset analysis
V ACKNOWLEDGMENT
8. N. Godbole, M. Srinivasaiah, S. Skiena. Large-Scale
For the successful completion of this project we
would like to thank Prof. RupaFadnavis mam .Thanks are
also extended to Prof. K.HAJARI sir for his support during
the project.
“Sentiment andMood Analysis of Weblogs using
POS Tagging based Approach”,In S. Aluru et al.
(Eds.): IC3 2011, CCIS 168, pp. 313-324,Springer-
Verlag, Berlin Heidelberg, 2011.
Sentiment Analysis for News and Blogs. In
proceedings of ICWSM 2007, pages 219.

VI CONCLUSION
In this era of huge burst of data, it is essential to
make use of that data in efficient manner. This can be
done by analyzing the data coming from different sources,
so as to take good decisions in different feilds. In this paper
,we have discussed about what is sentiment ,what is
unstructured data and the methodologies of analysis on
unstructured data using R language.We have data from
three different sources i.e twitter ,blogs, movie dataset. We
have created the GUI’s where this datasets can be
analyzed and the desired outputs can be seen. This will
help the users to use the big data in efficient manner.

REFERENCES

1. Jalaj S. Modha, Prof. and Head Gayatri S. Pandi,

Sandip J. Modha, ―Automatic Sentiment Analysis
for Unstructured Data‖, International Journal of
Advanced Research in Computer Science and

ISER International Conference Delhi 40

 Extending the functionality of Android Clipboard
Manager
[1]
Amol D. Gaikwad, [2] Pratik R. Tambekar,[3] Pankaj R. Hatwar, [4] Swapnil R. Ramtekkar
[1][2][3][4]
Assistant Professor, Dept. ITYeshwantraoChavan College of Engineering Nagpur (MS), India

Abstract - Clipboard is a software facility used for short-term data storage and/or data transfer between documents or applications,
via Copy and Paste operations. The standard built in clipboard of android operating system store only one item at a time so that it
provide speedy access to such content normally android clipboard has disadvantages firstly it store only one item at a time and
secondly when you turn off system it clears memory. My goal is to eradicate the problems of standard clipboard of Android OS to
developed such App that it contains buffer which is located on System Memory and it is permanent storage need not worry about
loss of data. Whatever user copy data that copied is maintained or stored in their respective buffer. When I am going to perform
paste operation it will populate all respective copied buffer data you have to just select the desired data that you want to paste it
save user time and increase the efficiency.

Index Terms:—Copy-Cut-Paste, Clipboard Manager,Logs, Clips, Clipboard, Android

I. INTRODUCTION

Android was developed by Google in 2008 and

officially took over as the mobile market leader in the
fourth quarter of 2010 [23]. One reason for its rapid growth
is the availability of a wide range of feature-rich
applications (known as apps). Different from Apple,
Google does not impose a thorough scrutinizing process on
applications submitting to the official Android market
(known as Google Play). Moreover, Google allows the
existence of numerous alternative 3rd-party app Stores.
While this strategy has been proven to be successful and
resulted in Today’s dominance of Android platform, it also
puts some system components,I.e. focused on Extending
Clipboard functionality of Android OS in this paper.
Fig. 1: Working Mechanism of Clipboard
Android provides a powerful clipboard-based
framework for copying and pasting. It supports both simple As we know that the standard Android Built in
and complex data types, including text strings, complex Clipboard has very obvious limitations firstly it store one
data structures, text and binary stream data, and even item at a time on clipboard memory if you had copy
application assets. Simple text data is stored directly in the another item it overwritten on previous item and secondly
clipboard, while complex data is stored as a reference that if you turn off or restart the mobile it clears memory every
the pasting application resolves with a content provider. time if in case you want previous copied contents you will
Copying and pasting works both within an application and be miss that contents. Suppose the employee working in
between applications that implement the framework. the organization and the particular information he want to
be use it throughout his working day now he/she go to
respective location copy that dataand paste it into their
respective file but it is ok for only single data you copied
then what about if you copy Multiple items at that time it
gives you latest copied data for paste operation so to avoid
this problem my utility is going to maintain a buffer for

ISER International Conference Delhi 41

 Extending the functionality of Android Clipboard Manager

copying data whatever user copy data that copied data is

stored in their respective buffer memory and the buffer is
created on hard disk so that the information you copied is
permanent and when user go to for paste operation that
time my utility populate all copied data that is stored inside
the respective buffer suppose you use to paste the text data
in word file that time my utility shows you all copied text
buffer data now our job is to select respective data that we
want to paste in the file so it save user time need not copy
the same data again and again and increase the efficiency
now my job is to extend the functionality of the Clipboard.
Our findings- To understand the current clipboard manager
situation of Android, we have conducted the first
systematic study of the clipboard usage in Benign apps but Fig. 2. Worldwide Smartphone market share forecast for
problem is that if user copied multiple data then it will get 2010-2015 based on data from Gartner [17].
latest copied data. Our purpose is to develop new clipboard
manager for Android system which is used to maintain all In conclusion, Google Android should be
copied data in a segregated manner suppose user copied considered the biggest platform worldwide for the next
image file it will be store inside image buffer same for several years. In addition, mobile phones that use Android
video, text, audio, URL etc. when user going to paste data are less expensive than those usingiOS, which contributes
it will populate all buffer you have to just select respective to that operating system’scontinuous growth. Thus, this
file from that buffer. The benign sample consists of the top study focused on apps for Google Android smart phones.
15 free apps in each category in Google, and they were Data were obtained from the Google Play website from the
collected in Jan 2016. selected apps [17].
Our analysis result shows that 1180 benign apps provide
the functionality to put data on the clipboard, but there no
application for Android system that will maintain
unlimited copied data with no data loss.
Roadmap- The rest of this paper is organized as follows:
Section I gives a Introduction on Android Clipboard.
Section II gives history about the Android clipboard. While
Section III discusses An overview of new android
clipboard manager, Finally, Section IV describes the
related work and Section 10 concludes.

II. LITERATURE SURVEY

In the Introduction five operating systems were
mentioned-Google Android, Windows Phone, Apple iOS,
BlackBerry, and Nokia Symbian. Surveys using the latest
statistics predict that Apple iOS will remain the second
biggest platform worldwide, after Google Android (Figure
2 and 3 shows this data until 2015, when Windows Phone
will surpass it [17].
In January 2013, the number of Google Android
apps overtook those of Apple iOS-800,000 apps arenow
available on Google Play. In October 2012, Google
announced that the total number of apps in its store
numbered 700,000. According to a recent press release,
775,000 apps are available in Apple’s
App Store. Currently, the Windows Phone Store offers
150,000 apps [17].
Fig. 3. Worldwide Smartphone market share forecast for
2015 based on data from IDC [17].
The term "cut and paste" comes from the
traditional practice in manuscript-editing’s whereby people
would literally cut paragraphs from a page with scissors
and physically paste them onto another page. This practice
remained standard into the 1980s. [1].
The act of copying/transferring text from one part
of a computer-based document ("buffer") to a different
location within the same or different computer-based
document was a part of the earliest on-line computer
editors. As soon as computer data entry moved from
punch-cards to online files (inthe mid/late 1960s) there
were "commands" for accomplishing this operation. This
mechanism was often used to transfer frequently-used

ISER International Conference Delhi 42

 Extending the functionality of Android Clipboard Manager

commands or text snippets from additional buffers into the IV. IMPLEMENTATION
document, as was the case with the QED editor [1].
Often this was done by the provision of a 'move' command, A. Main Window
but some text editors required that the text be first put into This is the main window of my project from
some temporary location for later retrieval/placement. In which you can access all functionality of my project like
1983, the Apple Lisa became the first text editing system home, view logs, copy logs, Settings, Refresh, Exit, view
to call that temporary location "the clipboard" [1]. different buffers etc.

Fig. 4.Percentages of apps that utilized different

resources [17].

As I studied ample of free Clipboard software

utilities for Android &iOS each one have different
functionality some utility store path of copied data some
may store copied data but will not shown you copied data
at the time you are going to perform paste operation some
utility maintain the history of Clipboard.

III. AN OVERVIEW OF NEW CLIPBOARD

MANAGER

The term Clipboard Manager is essential for many

users to perform various operations. Clipboard Manager
Enhance the basic functions of Cut, Copy and Paste
operation of default Clipboard with one or more following Fig. 5: Main Window of AndroClip Manager.
additional features.
(a) Maintain all copy data into their respective buffer B. Video Buffer Window
(b) Maintain the logs of copied data the log contains such The video buffer which contains all videos copied
as date, time, name of application, path of application, data whatever user copy data that copied data is stored
Login user name. inside the video buffer with copied data log. The log
(c) Session Id creation for each user. contains date & time, Application name, Path and Login
(d) Logs are segregated according to application names. User Name of copied data. Same Buffer I am going to
Created Hives like windows registry type structure. maintain for Images, Audio, text, Folders, URL etc.
(e) Permanent storage for all copy data the buffers created
for respective data is located on hard disk so need worry
about lost of data when you might be turn off system data
is still present inside the buffer.
(f) Searching saved data when user perform paste operation
my utility is going to show all copieddata from respective
buffer your job is only to search the data that you are going
to paste from that copied data.
(g) Buffer Maintenance facility for proper maintenance of
buffer space.

ISER International Conference Delhi 43

 Extending the functionality of Android Clipboard Manager
Fig. 6: Video Buffer Window
C. Maintaining all copied data into USB drive by
attaching OTG USB Drive to mobile.
I have featured a few ways to hide your data in
plain sight by attaching OTG USB drive to mobile purpose
of this above implementation is that whatever user copy
data that copied data is stored inside the respective buffer
of my project which is located on hard disk at the same
time the copied data is also stored in the USB drive which
is attached to mobile using OTG cable. When you attached
USB drive whatever data you have copied will store inside
USB drive at the same time AndroClip manager also
maintained that data. Once you copied data into USB drive
then you can carry anywhere and attach to any mobile.
Advantage is that no need to copy data one by one at one
attempt you copy all data that going to maintained in buffer
as well as in USB drive.
ISER International Conference Delhi
Fig. 6: USB Drive attach to the Mobile for maintaining
all copied data at one attempt.
V. CONCLUSION
In conclusion, Google Android should be
considered the biggest platform worldwide for the next
several years. In addition, mobile phones that use Android
are less expensive than those using iOS, which contributes
to that operating system’s continuous growth. As detailed
in the previous Section, We know very well that Android
Clipboard has limitations that firstly it store only one item
at a time an secondly when mobile turn off it clears
memory every time. So my Utility is going to eradicate
that limitations for that we are going to extends the
functionality of Android clipboard manager so that it
provide better and consistent user interface that save user
time and enhance the efficiency.
REFERENCES
[1]http://www.ijsr.net/archive/v3i12/U1VCMTQ1Nzk=.pd
f
[2] http://msdn.microsoft.com/en-
us/library/windows/desktop/aa365574(v=vs.85).aspx#b
ase.using _the_clipboard_for_ipc
[3]http://www.webopedia.com/TERM/C/clipboard.html
[Accessed on dated 14 jul. 2014], at hrs. 18:06.
[4]http://windows.microsoft.com/enin/windows-
vista/what-is-clipboard[Accessed on dated 14 jul.
2014], at hrs. 19:02.
[5]https://thecustomizewindows.com/2014/04/view-
clipboard-history-mac-os-x/
[6]http://www.techsupportalert.com/best free-clipboard-
replacement utility.htm
[7] http://en.wikipedia.org/wiki/Cut, copy and
paste#Cut_and_paste
[8]http://www.inyavic.com/definitions/view.php?dnid=811
[9]http://sanjaal.com/java/224/java-utilities/how-to-set-
and-get-system-clipboard-contents-in-java/
[10]http://medlibrary.org/medwiki/Cut_and_paste
[11] http://msdn.microsoft.com/en-
us/library/windows/desktop/ms649014%28v=vs.85%
44
 Extending the functionality of Android Clipboard Manager

29.aspx#_win32_Cut_and_Copy_Operations [Accessed
on dated 11 jul. 2014], at hrs 12:20.
[12] Mark Apperley, Dale Fletcher, Bill Rogers, “Breaking
the Copy/Paste Cycle: The Stretchable Selection Tool”,
Computer Science Department, Waikato University
Hamilton, New Zealand, pp. 1, 2.
[13] K.T.Stolee, S. Elbaum, and G. Rothermel, "Revealing
the Copy and Paste Habits of End Users", Symposium
on Visual Languages and Human-Centric Computing
(VL/HCC) IEEE 2009, pp. 1.
[14] Shaobo Li, ShulinLv, XiaohuiJia, Zhisheng Shao,
“Application of Clipboard Monitoring Technology in
Graphic and Document Information Security Protection
System”, Key Laboratory of Advanced Manufacturing
Technology, Guizhou University Guiyang, 550003,
China.
[15] http://msdn.microsoft.com/en-
us/library/windows/desktop/ms649014%28v=vs.85%
29.aspx [Accessed on dated 11 jul. 2014], at hrs. 12:45.
[16]
http://en.wikipedia.org/wiki/Clipboard_%28computing
%29
[17] http://mhealth.jmir.org/2013/2/e24/

ISER International Conference Delhi 45

A Survey on Travel Based Application Using Social
Media
[1]
ShankerShalini, [2] Dr.M.SheerinBanu
[1]
PG student, [2] Professor
[1][2]
Department Of Computer Science and Engineering, RMD Engineering College, Chennai, India
Abstract—Big data provides analysis of large amount of dataset and accurate result can be obtained using thisdataset analysis.
When considering travel application many users opt for static travel planning without any nowfeature that incorporates in the
application. Blindly they agree any travel plan that’s been listed in the application.In this paper various analysis is done and survey
is been done to make user friendly travel application so that usercan specify their Point Of Interest (POI) and as such planning is
done dynamically based on users location withthe help of geo-tagging and collaborative filtering. We find here what are all
recommendation system that cansuitable to incur in the travel application with the help of geo-tagging and location based filtering.
Thus to finduser friendly travel based application this survey is done.

Keywords: geo-tagging, collaborative filtering, Point Of Interest

I. INTRODUCTION In contrast to existing location based collaborative

filtering methods, we learn users’ travel preferences from
Social Media recommendation is the mostwell- the text descriptions associated with their shared photos on
known approach, and is widely utilized inproducts, services social media, instead of from GPS trajectories or check-in
and travel recommendationsLocation based collaborative records. In addition, users’ similarities are measured with
filtering travelrecommendation methods first mine POIs in a author topic model instead of location co-
citywhich has been visited by social users using geo-tags occurrence.[2]Places are classified based on the geotag
or GPS trajectories. Then similar users are detectedby information, Number of Persons on the photo and can be
calculating the location co-occurrences fromusers’ travel later used with POI recommendation.[3]. In personalized
history and past experience. Thensimilar users are detected travel recommendation system, we utilize users’ topic
by calculating the locationco-occurrences from users’ travel preferences as the law for collaborative filtering instead of
history. Finally, tosimilarusers’ visiting history. location co- occurrences. Dynamic travel plans are
recommended to the user based on
Social Media recommendation approaches are POI.Theadvantages of this format is to provide dynamic
effective and efficient, but suffer from the well- known travel plans with sequence route, time complexity, travel
“time complexity problem and cost satisfaction”[1] in route navigation.The technique that is used are location
recommendation systems, due to travel data being very based collaborative filtering, geo tag extraction, query based
sparse. In this circumstance, it makes accurate similar user technique.
identification very difficult if the user has only visited a
small number of POIs. II.ORGANISATION

The category topics are usually determined by the
naive category information from recommended systems in
Topic Model Method(TM). From the predetermined
categories, itis convenient to calculate user preferences.
Unfortunately, for rich photo sharing networks likeFlickr,
there is no such defined category information. Thus the
naive topic-based recommendation approach cannot be
utilized directly in travel recommendations.The problems
are Static Travel Plans,Not supports personalized POI
Recommendations, Category Information is undefined
,Static Datasets for POI[2].
The remainder of this survey is organized as
follows. The section III demonstrates the literature survey of
various Travel based applications using social media with
Big Data with the methodologies used and its disadvantages,
and the procedures to overcome the limitations. Section IV
demonstrates the future enhancement of the paper. Lastly
we draw a conclusion in section V.

ISER International Conference Delhi 46

 A Survey on Travel Based Applicationusing Social Media
III LITERATURE SURVEY
1.Graph-based point-of-interest recommendation with
geographical and temporal influences 2014:
User check-in data availability are available in
large Volume from location based social networks . Point-
of-interest(POI) recommendation is one of such services,
which is to recommend POIs that users have not visited
before. [1]It has been observed that: (i) user will visit near-
by places (ii) users tend tovisit different places indifferent
timeslots,and in thesame times lot,users tend to periodically
visit thesame place. Collaborative filtering has been widely
used for recommendation system.Thus point of interest is
used via graph based process is used to retrieve the users
interest
2.Trip mining and recommendation from geo- tagged 2012
Trip planning is very hard task were there are many
criteria that need to be satisfied before planning the trip.[2In
this paper geo tagged photo which are in the social media
are retrieved and depending upon the user text file the
comparison is made and finally the recommendation for
thru the trip is given.substantial number of travel paths
are minded from the crawled geo-tagged photos. After that,
a search system is built to index and search the paths, and
the Sparse Chamfer Distance is proposed to measure the
similarity of two paths. [10]The search system supports
various types of queries, including (1) a destination name,
(2) a user-specified region on themap, (3) some user-
preferred locations. Based on the search system, users can
interact with the system by specifying a region or several
interest points on the map to find paths.
3.POI recommendation through cross region collaborative
filtering 2016
Point of interest that can be recommended
according to users current location and past check- in. Here
the issue is users POI cannot be predicted if she checks- in
to new places which they have not visited previously..Thus
the collaborative filtering to detect the places that is nearest
to visit according to their check in details [3]. To address
this issue, we distinguish the user preferences on the content
of POIs from the user preferences on the POIs themselves.
The former is long term and is independent of where POIs
are located, and the latter is short term and is constrained by
the proximity of the location of the POI and the user’s
current location. This distinction motivates a location-
independent modeling of user’s content preferences of POIs,
and a location-aware modeling of user’s location
preferences of POIs.[11]
4.Schedule a rich sentimental travel via sentimental POI
miningand recommendation 2016
Mining the point of interest which can be used to
maintain two things. The one is users interest can be deeply
ISER International Conference Delhi
understood. The other one is to deeply mine the user travel
process. Here they focus on sentimental attributes of
location and propose a POI (Point-Of-Interest) Mining
method[4]. Firstly, we use SPM (Sentiment-based POI
Mining) algorithm to mine the POIs (Points-Of-Interest)
with obvious sentimental attributes, and then recommend
the POIs to users by using SPR (Sentiment-based POI
Recommendation) algorithm. We conduct a series of
experiments in SinaWeibodatasets .[15]
5.Landmark summarization with diverse viewpoints 2015
This paper tells us about the land mark retrieval
which gives comprehensive description about the landmark
of users. So the approach for giving a accurate collection of
landmark image. [5]Then grouping of images and retrieving
it in diverse point with the help of the text
DescriptionSecond, wemodel the relative viewpoint of each
image within the VA based on the spatial layout of
distinctive descriptors of a landmark. Third, we express the
relative viewpoint of an image with a 4-D viewpoint vector,
including horizontal, vertical, scale, and rotation.At last
concluding on landmark inpoints of view point.[13]
6.Using multi-criteria decision making for personalized
point of interest recommendation 2014
Location-based business review (LBBR) sites (e.g.,
Yelp) provide us a possibility to recommend new points of
interest (POIs) for users. To this end, we propose a new
personalized POI recommendation framework using Multi-
Criteria Decision Making (MCDM). [6]Firstly, preference
models are built for the user’s geographical, category, and
attribute preferences. Then, an MCDM-based
recommendation framework is designed to iteratively
combine the user’s preferences on the three criteria and
select the top-N POIs as a recommendation list.
Experimental results show that our framework not only
outperforms the state-of- theart POI recommendation
techniques, but alsoprovides a better trade-off mechanism
for MCDMthan the weighted sum approach[9].
7. Image location estimation by salientregion matching
2015
In this paper the image that we take and the image
locations are widely used in many application scenario for
geo-tagged images. [7]So the images which are already geo
tagged we estimate their locations then we use spatial
informationwords to improve image location estimation. To
improve the retrieval performance, spatial constraint is
utilized to code the relative position of visual words[10]. We
proposed to generate a position descriptor for each visual
word and build fast indexing structure for visual word
groups.
47
 A Survey on Travel Based Applicationusing Social Media
8.Generating location overviews with images and tags by
mining user-generated travelogues 2009
Automatically generating location overviews in the
form of both visual and textual descriptions is highly desired
for online services such as travel planning, to provide
attractive and comprehensive outlines of travel
destinations[8]. Actually, user-generatedcontent (e.g.,
travelogues) on the Web provides abundant information to
various aspects (e.g., landmarks, styles, activities) of most
locations in the world. To leverage the experience shared by
Web users, in this paper we propose a location overview
generation approach, which first mines location-
representative tags from travelogues and then uses such tags
to retrieve web images[15]. The learnt tags and retrieved
images are finally presented via a novel user interface which
provides an informative overview for a given location.
Experimental results based on 23,756 travelogues and
evaluation over 20 locations show promising results on both
travelogue mining an location overview generation.
IV FUTURE ENCHANCEMENT
Here we enhance the survey by developing a
dynamic travel plan with images that develops aa feature
were the travel plans can be made dynamically provided the
process is been submitting the social media images applying
geo-tagging on it . The other enhancement is to make
dataset more dynamic and that can be analysed very easily
which helps to make big predications and decisions.
V CONCLUSION
As compared with various we can develop
application of travel based that can retrieve geo- tagging
from social media.Thus the personalized travel plans are
generated for the user based on POI travel recommendations
of the user using personalized travel sequence
Recommendation on Multi-Source Big Social Media.
REFERENCES
[1]Yuan, G. Cong, and A. Sun, “Graph-based point- of-
interest recommendation with geographical and temporal
influences,” in Proc. 23rd ACM Int. Conf.
Inform.Knowl.Manage., 2014, pp. 659–668
[2] H. Yin, C. Wang, N. Yu, and L. Zhang, “Trip mining
and recommendation from geo-tagged photos,” in Proc.
IEEE Int. Conf. Multimedia Expo Workshops, 2012, pp.
540–545..
[3] .Zhang and K. Wang, “POI recommendation through
crossregion collaborative filtering,” Knowl. Inform.
Syst., vol. 46, no. 2, pp. 369–387, 2016.
ISER International Conference Delhi
[4] P. Lou, G. Zhao, X. Qian, H. Wang, and X. Hou,
“Schedule a rich sentimental travel via sentimental POI
mining and recommendation,” in Proc. 20th ACM Int.
Conf. Multimedia Big Data, 2016, pp. 33–
[5]X.Qian,Y.Xue,X.Yang,Y.Y.Tang,X.Hou,andT.
Mei,“Landmark summarization with diverse
viewpoints,” IEEE Trans. Circuits Syst.
VideoTechnol.,vol.25,no.11,pp.1857– 1869,Nov.2015.
[6] Y. Lyu, C.-Y. Chow, R. Wang, and V. C. Lee, “Using
multi-criteria decision making for personalized point-of-
interest recommendations,” in Proc. 22nd ACM
SIGSPATIAL Int. Conf. Adv. Geographic Inf. Syst.,
2014, pp. 461–464.
[7] X. Qian, Y. Zhao, and J. Han, “Image location
estimation by salient region matching,” IEEE Trans.
Image Process., vol. 24, no. 11, pp. 4348–4358, Nov.
2015.
[8] Q. Hao, R. Cai, X. Wang, J. Yang, Y. Pang, and L.
Zhang, “Generating location overviews with images and
tags by mining user-generated travelogues,” in Proc.
17th ACM Int. Conf. Multimedia, 2009, pp. 801–804.
[9] . Liu, T. Mei, J. Luo, H. Li, and S. Li, “Finding perfect
rendezvous on the go: Accurate mobile visual
localization anditsapplications
torouting,”inProc.20thACMInt.Conf.
Multimedia,2012,pp.9–18
[10] J. Li, X. Qian, Y. Y. Tang, L. Yang, and T. Mei, “GPS
estimation for places of interest from social users’
uploaded photos,” IEEE Trans. Multimedia, vol. 15, no.
8, pp. 2058–2071, Dec. 2013
.
[11] S. Jiang, X. Qian, J. Shen, Y. Fu, and T. Mei, “Author
topic model based collaborative filtering for personalized
POI recommendation,”IEEETrans.Multimedia,vol.17,n
o.6,pp.907–918,Jun.2015.
[12] J. Sang, T. Mei, T. J. Sun, S. Li, and C. Xu,
“Probabilistic sequential POIs recommendation via
check-in data,” in Proc. ACM SIGSPATIAL Int. Conf.
Adv. Geographic Inform. Syst., 2012, pp. 402–
405individual location history,” ACM Trans. Web, vol.
5, no. 1, p. 5, 2011.
[14] H. Gao, J. Tang, X. Hu, and H. Liu, “Content- aware
point of interest recommendation on location- based
social networks,” in Proc. 29th Int. Conf. AAAI, 2015,
pp. 1721–1727.
[15] Gao, J. Tang, R. Hong, Q. Dai, T. Chua, and R. Jain,
48
 A Survey on Travel Based Applicationusing Social Media

“W2go: A travel guidance system by automatic

landmark ranking,” in Proc. Int. Conf. Multimedia, 2010,
pp. 123–132.

[13] Y. Zheng, L. Zhang, Z. Ma, X. Xie, and W.

Ma,“Recommending friends and locations based
onindividual location history,” ACM Trans. Web, vol. 5,
no. 1, p. 5, 2011.

[14] H. Gao, J. Tang, X. Hu, and H. Liu, “Content- aware

point of interest recommendation on location- based
social networks,” in Proc. 29th Int. Conf. AAAI, 2015,
pp. 1721–1727.

[15] Gao, J. Tang, R. Hong, Q. Dai, T. Chua, and R. Jain,

“W2go: A travel guidance system by automatic
landmark ranking,” in Proc. Int. Conf. Multimedia, 2010,
pp. 123–132.

ISER International Conference Delhi 49

 Monotonic behaviour of Generalized Parametric
Measure of Intuitionistic Fuzzy Entropy
[1]
Taruna, [2] H D Arora
[1][2]
Department of Mathematics, Amity Institute of Applied Mathematics, Amity University, Noida, India

Abstract— Atanasov (1986) acquaint with the concept of Intuitionistic Fuzzy Set (IFS), as an overview of fuzzy sets, which proved
to be more useful in seizing indefinite, incomplete, or ambiguous information, including a degree of hesitation in various fields of
study. Using the notion of Sharma and Mittal (1975) entropy, Intuitionistic fuzzy entropy of order and degree is proposed. This
measure is a generalized version of the ambiguity of the order and degree and extension of intuitionistic fuzzy entropy defined
by Vlachos and Sergiadis (2007). This paper clearly demonstrates the validity of the measure as intuitionistic fuzzy entropy.

and the intuitionism is dominated by the hesitation degree.

I. INTRODUCTION
Entropy measure is basically known as the measure of
information of a revolutionary discovery named as
’Information Theory’ in communication system, originated
from the fundamental paper “The Mathematical Theory of
Communication” by Shannon (1948). It is important to
investigate the fuzzy entropy, which is used to describe the
degree of uncertainty of fuzzy sets and is determined by the
absolute deviation of membership and non-membership
degree of fuzzy sets. As the expansion of fuzzy sets, the
degree of uncertainty of intuitionistic fuzzy sets includes not
only the fuzziness of known information but also the
intuition of unknown information. The ambiguity of known
information is determined by the absolute deviation of
membership degree and non-membership degree, and the
intuition of unknown information is determined by the
degree of hesitation. The degree of uncertainty of
intuitionistic fuzzy sets is described by intuitionistic fuzzy
entropy. Atanassov (1986) extended the fuzzy set theory
given by Zadeh (1965) to the intuitionistic fuzzy set theory.
Vague sets and interval-valued fuzzy sets are the other two
generalizations of fuzzy sets which were proved to be
equivalent to the intuitionistic fuzzy sets theoretically by
Bustince and Burillo (1996), Atanassov and Gargov (1989),
Cornelis et al. (2003) and Deschrijver and Kerre (2003)
respectively. At present, the intuitionistic fuzzy set theory is
widely used in many fields, such as decision making, image,
and medicine etc.
Vlochos and Sergiadis (2007) exposed sensitive and
mathematical association among the information measures
for FSs and IFSs in terms of fuzziness and intuitionism. It
has been noticed that information measures for FSs is
certainly a measure of fuzziness, while for IFSs, information
measures can measure both fuzziness and intuitionism. It is
known that the fuzziness is occupied by the difference
between membership degree and non membership degree,
Hence, it is very interesting to construct entropy formulae
measuring both fuzziness and intuitionism. Szmidt and
Kacprzyk (2001) extended the axioms of Deluca and
Termini (1971) to the IFS environment. Zhang and Jiang
(2008) presented a measure of intuitionistic fuzzy entropy
based on a generalization of measure of Deluca and Termini
(1971). Verma and Sharma (2011) proposed fuzzy
information measure of order α. Similarity measure for
intuitionistic fuzzy sets and trigonometric information
measures for intuitionistic fuzzy sets are introduced by
Mishra (2016) improved intuitionistic fuzzy entropy formula
is constructed according to the entropy axiomatic definition
and its properties are studied by Jiang and Wang (2018).
Verma and Sharma (2011) proposed generalized measure of
Intuitionistic Fuzzy Entropy of order and discussed few
properties to validate their measure. Generalized measure of
fuzzy entropy and their properties were proposed by
Deshmukh et al. (2011). Measure proposed by Munde
(2018) discussed fuzzy information measure with multiple
parameters and their necessary properties. Prakash and
Gandhi (2011) introduced and investigated two new
generalized measure of entropy and studied their essential
and desirable properties.
The paper is organized as follows. In Section 2, some basic
definitions related to fuzzy set theory and intuitionistic
fuzzy set theory are briefly given. In Section 3, a new
entropy measure called “Generalized parametric measure of
intuitionistic fuzzy entropy” is proposed, and its axiomatic
justification is established. Some mathematical properties of
the proposed measure are also studied in this section. In
addition to this, monotonic behaviour of the proposed model
is given to demonstrate the effectiveness of the proposed
measure of intuitionistic fuzzy entropy with existing
intuitionistic fuzzy entropies. Brief conclusion is presented
in Section 4.

ISER International Conference Delhi 50

 Monotonic behaviour of Generalized Parametric Measure of Intuitionistic Fuzzy Entropy

II. PRELIMINARIES (i) B if and only if ( )

A ( ) and ( )
( ) ;
In the following, some needed basic concepts and
(ii) A=B if and only if A and B ;
definitions related to fuzzy sets and intuitionistic fuzzy sets
(iii) [〈 ( ) ( )〉 ]
are introduced.
(iv) {〈 ( ) ( ) ( )
( )〉 }
Definition 1(Fuzzy Set ) : A Fuzzy set ̃ in a finite Universe
(v) {〈 ( ) ( ) ( )
of discourse X = {x1,x2,………xn} is given by
̃ = {〈 ( )〉 }
̃ ( )〉 } (2.1)
Szmidt and Kacprazyk (2001) extended the axioms of
where ̃ : X [ ] membership function of ̃ .The
Deluca and Termini (1971) for proposing the entropy
number
measure in the setting of IFSs.
̃( )
̃
Definition 4 : An entropy on IFS(X) is a real valued
Deluca and Termini (1971) defined fuzzy entropy for a functional E : IFS(X) [0,1], satisfying the following four
fuzzy set ̃ ( ) Axioms
as (P1) E(A) =0 if and only if A is a crisp set ,that is ,
H( ̃ ) = ∑ [ ̃ ( ) ( ̃ ( )) ( ( ) ( ) ( ) ( )
̃ ( )) ( ̃ ( ))] (2.2)
Later, Bhandari and Pal (1993) made a survey of (P2) E(A)=1 if and only if ( ) ( )
information measures on fuzzy sets and proposed some new
measures of fuzzy entropy. Corresponding to Renyi (P3) E(A) E(B) if and only A B,that is , if ( )
(1961)entropy , they defined the following measure: ( ) and
∑ ( ) ( ) ( )
̃( ) ( ̃ ( ))
( ) ( ) ( ) ( )
(2.3) (P4) E(A) = E( )
Atanassov (1986), as mentioned earlier, generalized Zadeh
(1965) (idea of fuzzy sets, by what is called intuitionistic III. GENERALIZED PARAMETRIC MEASURE OF
fuzzy sets, defined as follows : INTUITIONISTIC FUZZY ENTROPY
In this section, we have proposed a generalized information
Definition 2 (Intuitionistic fuzzy set): An intuitionistic measure for intuitionistic fuzzy entropy and discussed their
fuzzy set A in a finite universe of discourse X = {x1, x2, essential and desirable properties
x3,…….xn } is given by
( )
A = {⟨ , ( ), ( )⟩ | X} (2.4)
( )
∑ [( ( ) ( )) ( ( )
Where, ( )
( ))
( ): X [ ], ( ):X [ ]
( ( )] )
(2.5)
In this definition, the numbers ( ) and ( ) (3.1)
respectively, denote the degree of membership and non where log is to the base 2, [ ] ( )
membership of x to the set A . ( ) ,
For each IFS A in X, if ( ) ( ) − ( ),
, then ( ) represents the degree of hesitance of Theorem 3.1: A generalized parametric intuitionistic fuzzy
x to the set A . ( ) is also called intuitionistic index. entropy measure ( ) is defined in (3.1) for IFSs is valid
Obviously, when ( ) =0 that is ( ) = 1− ( ) for measure i.e. it satisfies following properties :
every in X, then IFS set A becomes fuzzy set. Thus fuzzy P1 : ( ) if and only if A is a crisp set i.e. if
sets are the special cases of IFSs. ( ) ( ) ( ) ( )
Definition 3 (Set Operations on Intuitionistic Fuzzy Sets) : P2 : ( ) if and only if A is fuzzy most set i.e.
Let IFS(X) denote the family of all IFSs in the universe X , ( ) ( ) for all
and let A,B ( ) given by P3 : ( ) ( ) for all A IFSs
A = {〈 ( ) ( )〉 } P4 : If A that is if ( ) ( ) ( )
B = {〈 ( ) ( )〉 } ( ) for any , then ( ) ( )
Then usual set relations and operations are defined as Proof
follows: P1 : To show ( ) if and only if A is a crisp set i.e. if
( ) ( ) ( ) ( )

ISER International Conference Delhi 51

 Monotonic behaviour of Generalized Parametric Measure of Intuitionistic Fuzzy Entropy

Consider First that ( ) i.e. ( )

∑ [( ( ) ( )) ( ( ) ( ))
( )
∑ [( ( ) ( )) ( ( )
( ) ( ) ( ) ( )
( )) ( )] = 0 ( )]
( )
( ( ) ( )) ( ( ) ( )) ( ) ( )
∑ ( ( ) ( )) [ ( )
( ) ( ( ) ( ))
( )
( ( ) ( )) ] (3.2)
( ) ( )[ ( )
]
( ( ) ( )) Thus (3.2) will hold if either ( ) ( ) implies
( ) ( ) or
( ) ( ) ( ( ) ( ))
(3.3)
Since so above equation will
( ) ( ) ( ) ( ) Now Consider the function ( ) where [ ]
hold only
implies ( ) ( )( ) and ( )
Conversely if ( ) ( ) ( ) ( )( )
( ) i.e. As , thus either ( ) ( )
If ( ) ( ) ( ) ,
IFS A is a crisp set then from (3.1) , we get ( ) .
we can say that ( ) is convex.
Hence ( ) if and only if A is crisp set i.e. ( ) On the other hand, if ( ) ( )
( ) ( ) ( ) and hence ( ) or we can say that ( ) is concave.
P2: To show ( ) if and only if A is Fuzzy most set So, by well known inequalities of convex and concave
i.e. ( ) ( ) functions for any two points in [ 0,1] ,we have
Assume firstly that ( ) ( ) then (3.1) becomes ( ) ( )
( ) ( )
( ) ( )
( ) ∑ [( ( ) ( ) ( )
( )

( )
With equality holding only for .Therefore equation
( )) ( ( )) (3) holds only if ( ) ( )
( ) ( )] Hence Property (P2) is proved for ( ).
( ) P3 : As AC = { ( ) ( ) } then from
( )
∑ [( ( )) definition of Entropy function given in equation(1) , we get
( ) ( )] ( ) ( )
( ) P4 : Monotonic Behaviour of proposed Measure
= ( ) ( ) Here we have to prove our entropy function is
( ) monotonically increasing monotonically decreasing with
Next assume that ( ) i.e. respect to ( )and ( ) respectively
For convenience, let ( ) and ( ) then it is
∑ [( ( ) ( )) ( ( )
( ) sufficient to prove that the entropy function:
( ) ( )
( )) ( )] = 1 ( ) [(
( )
or ∑ [( ( ) ( )) ( ( ) )( ) ( ) ( )
]
( )
( )) ( ) ( )] where [ ] is an increasing function with respect to
( ) x and decreasing with respect to y .
Taking partial derivatives of f with respect to x and y
respectively ,we get

( ) ( )
( )( ( ))( ) ( ) ( )
( )
[ ( ) ( )
]
( )( )

( ) ( )
( )( ( ))( ) ( ) ( )
( )
[ ( ) ( )
]
( )( )

ISER International Conference Delhi 52

 Monotonic behaviour of Generalized Parametric Measure of Intuitionistic Fuzzy Entropy

For the extreme point of f, we have = 0 and and respect to x, when x such that [ ] and
get Then from the monotonicity of the function ( ), we can
Also i.e. ( )is increasing with respect to x, when have
i.e. ( ) is decreasing with respect to ( ) ( )
x , when x such that [ ] and Hence ( ) is a valid measure of Intuitionistic fuzzy
Similarly i.e. ( ) is increasing with respect to x, entropy of order and degree :

when x and i.e. ( )is decreasing with

( ) ( )
={ ( )
∑ [( ( ) ( )) ( ( ) ( )) ( )]
( ) ( )
( )
∑ [( ( ) ( )) ( ( ) ( )) ( )]} +
( ) ( )
={ ( )
∑ [( ( ) ( )) ( ( ) ( )) ( )]
( ) ( )
( )
∑ [( ( ) ( )) ( ( ) ( )) ( )]}
( ) ( )
= ( )
∑ [( ( ) ( )) ( ( ) ( )) ( )] +
( ) ( )
= ( )
∑ [( ( ) ( )) ( ( ) ( )) ( )]
= ( ) ( )
Thus ( ) ( ) ( ) ( )

Corollary : For any set A ( )and AC the complement Particular and Limiting Cases
of intuitionistic fuzzy set A , (1) When ,then measure (3.1) reduces to measure
( ) ( ) ( ) ( ) given by Verma and Sharma (2014b).
( ) attains the maximum value when the set is most (2) It may be noticed that if an intuitionistic fuzzy set is
an ordinary fuzzy set, i.e. , ( )
intuitionistic fuzzy set and minimum value when the set is
( ) , then the intuitionistic fuzzy entropy of
crisp set. Moreover, maximum and minimum values are
independent of . order reduces to fuzzy Entropy of order given
by Sharma and Mittal (1975).
It has already been proved that ( ) is maximum if and
only if A is most Intuitionistic fuzzy set, i.e. ( ) IV. CONCLUSIONS
( ) and minimum when A is crisp set . So Entropy measure plays a pivotal role in decision making
,it is sufficient to prove that maximum and minimum values process. The entropy of Intuitionistic Fuzzy set is used to
are independent of describe the degree of uncertainty of the Intuitionistic Fuzzy
Let A be the most Intuitionistic fuzzy set, i.e. ( ) set. This paper analysis the existing Intuitionistic entropy,
( ) formulas and extends to derive new intuitionistic fuzzy
Then entropy which is generalisations of previously derived
measures. This work introduces a new entropy measure of
( ) ( )
∑ [( ( ) order and degree . Moreover some desirable properties
( )
corresponding to this measure has also been discussed.
( )) ( ( ) ( )) Monotonic behaviour of proposed measure is also analysed.
( ) ( )]
Conflict of interest
= ( ) ∑ [ ( )
] The authors declare that there is no conflict of interest
= 1 which is independent of regarding the publications of this paper.
On the other hand, if A is a crisp set , i.e. ( )
( ) ( ) ( ) , REFERENCES
then ( ) for any value of . [1] Attanassov, K. T. (1986). Intuitionistic fuzzy sets.
Fuzzy Sets and Systems, 20(1): 87–96.

ISER International Conference Delhi 53

 Monotonic behaviour of Generalized Parametric Measure of Intuitionistic Fuzzy Entropy

[2] Atanassov, K. T. and Gargov, G. (1989). Interval valued [17] Verma, R., Sharma, B.D. (2011). On generalized
intuitionistic fuzzy sets. Fuzzy Sets and Systems, 31(3): exponential fuzzy entropy. World Academy of Science,
343–349. Engineering and Technology, 5: 956-959.
[3] Bhadari, D. and Pal, N. (1993). Some new information [18] Vlachos, I. K. and Sergiadis, G. D. (2007).
measures for fuzzy sets. Information Sciences, 63:209- Intuitionistic fuzzy information-application to pattern
228. recognition, Pattern Recognition Letters, 28: 197-206.
[4] Bustince, H. and Burillo, P. (1996). Vague sets are [19] Zadeh,L.A,(1965). Fuzzy sets. Information and
intuitionistic fuzzy sets. Fuzzy Sets and Systems, 79(3): Computation, 8: 338–353
403–405. [20] Zhang, Q. S. and Jiang, S. Y. (2008). A note on
[5] Cornelis, C., Atanassov, K. T. and Kerre, E. E. (2003). information entropy measure for vague sets.
Intuitionistic fuzzy sets and interval-valued fuzzy sets: a Information Science, 178: 4184 – 4191.
critical comparison. Proceedings of the Conference of
the European Society for Fuzzy Logic and Technology,
159–163, DBLP, Zittau, Germany.
[6] Deluca, A. and Termini, S. (1971). A definition of non-
probabilistic entropy in setting of fuzzy set theory.
Information and Control, 20: 301 – 312.
[7] Deschrijver, G. and Kerre, E. E. (2003). On the
relationship between some extensions of fuzzy set
theory. Fuzzy Sets and Systems, 133(2): 227–235.
[8] Deshmukh, K.C., Khot P.G. and Nikhil (2011)
.Generalized Measures of Fuzzy Entropy and their
properties. International Journal of Mathematical and
Computational Sciences, 5 (8):1176-1180.
[9] Jiang ,D. and Wang Y.(2018). A new entropy and its
properties based on the improved axiomatic definition
of Intuitionistic Fuzzy Entropy. Mathematical Problems
in Engineering, 2018 :1-6.
[10] Mishra, A.R. (2016).Intuitionistic Fuzzy Information
measures with Application in rating of township
development. Iranian Journal of Fuzzy Systems,
13(03):49-70.
[11] Munde, A. (2018 ). Fuzzy Information measures with
multiple parameters. Fuzzy logic based in optimisation
methods and control systems and its applications,
2018:7-23.
[12] Prakash,O. and Gandhi, C. P.(2011) .New generalized
measures of Fuzzy Entropy and their properties. Journal
of Informatics and Mathematical Sciences, 3:1-9.
[13] A. Rényi, “On measures of entropy and information,” in
Proceedings of the 4th Berkeley Symposium on
Mathematical Statistics and Probability, pp. 547–561,
University of California Press, Berkeley, Calif, USA,
1961
[14] Shanon, C. E. (1948), A mathematical theory of
communication.The Bell System Technical Journal,
27(3): 379 – 423.
[15] Sharma, B.D. and Mittal, D.P. (1975). New non-
additive measure of entropy for discrete probability
distributions. J. Math. Sci., 10: 28-40.
[16] Szmidt, E. and Kacprzyk, J. (2001): Entropy for
intuitionistic fuzzy sets, Fuzzy Sets and Systems 118(3),
467 – 477.

ISER International Conference Delhi 54