Applications of Computing and

Communication Technologies: First

International Conference, ICACCT 2018,
Delhi, India, March 9, 2018, Revised
Selected Papers Ganesh Chandra Deka
Visit to download the full and correct content document:
https://textbookfull.com/product/applications-of-computing-and-communication-techno
logies-first-international-conference-icacct-2018-delhi-india-march-9-2018-revised-sel
ected-papers-ganesh-chandra-deka/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Applications of Computing and Communication

Technologies: First International Conference, ICACCT
2018, Delhi, India, March 9, 2018, Revised Selected
Papers Ganesh Chandra Deka
https://textbookfull.com/product/applications-of-computing-and-
communication-technologies-first-international-conference-
icacct-2018-delhi-india-march-9-2018-revised-selected-papers-
ganesh-chandra-deka/

Communication, Networks and Computing: First

International Conference, CNC 2018, Gwalior, India,
March 22-24, 2018, Revised Selected Papers Shekhar
Verma
https://textbookfull.com/product/communication-networks-and-
computing-first-international-conference-cnc-2018-gwalior-india-
march-22-24-2018-revised-selected-papers-shekhar-verma/

Futuristic Trends in Network and Communication

Technologies: First International Conference, FTNCT
2018, Solan, India, February 9–10, 2018, Revised
Selected Papers Pradeep Kumar Singh
https://textbookfull.com/product/futuristic-trends-in-network-
and-communication-technologies-first-international-conference-
ftnct-2018-solan-india-february-9-10-2018-revised-selected-
papers-pradeep-kumar-singh/

Information Communication and Computing Technology 5th

International Conference ICICCT 2020 New Delhi India
May 9 2020 Revised Selected Papers Costin Badica

https://textbookfull.com/product/information-communication-and-
computing-technology-5th-international-conference-
icicct-2020-new-delhi-india-may-9-2020-revised-selected-papers-
Soft Computing Systems Second International Conference
ICSCS 2018 Kollam India April 19 20 2018 Revised
Selected Papers Ivan Zelinka

https://textbookfull.com/product/soft-computing-systems-second-
international-conference-icscs-2018-kollam-india-
april-19-20-2018-revised-selected-papers-ivan-zelinka/

Intelligent Technologies and Applications First

International Conference INTAP 2018 Bahawalpur Pakistan
October 23 25 2018 Revised Selected Papers Imran Sarwar
Bajwa
https://textbookfull.com/product/intelligent-technologies-and-
applications-first-international-conference-
intap-2018-bahawalpur-pakistan-october-23-25-2018-revised-
selected-papers-imran-sarwar-bajwa/

Information and Communication Technologies for Ageing

Well and e-Health: 4th International Conference,
ICT4AWE 2018, Funchal, Madeira, Portugal, March 22–23,
2018, Revised Selected Papers Panagiotis D. Bamidis
https://textbookfull.com/product/information-and-communication-
technologies-for-ageing-well-and-e-health-4th-international-
conference-ict4awe-2018-funchal-madeira-portugal-
march-22-23-2018-revised-selected-papers-pana/

Information Communication and Computing Technology 4th

International Conference ICICCT 2019 New Delhi India
May 11 2019 Revised Selected Papers Abdullah Bin Gani

https://textbookfull.com/product/information-communication-and-
computing-technology-4th-international-conference-
icicct-2019-new-delhi-india-may-11-2019-revised-selected-papers-
abdullah-bin-gani/

Information and Communication Technologies in

Education, Research, and Industrial Applications: 14th
International Conference, ICTERI 2018, Kyiv, Ukraine,
May 14-17, 2018, Revised Selected Papers Vadim
Ermolayev
https://textbookfull.com/product/information-and-communication-
technologies-in-education-research-and-industrial-
applications-14th-international-conference-icteri-2018-kyiv-
Ganesh Chandra Deka
Omprakash Kaiwartya
Pooja Vashisth
Priyanka Rathee (Eds.)

Communications in Computer and Information Science 899

Applications of Computing
and Communication
Technologies
First International Conference, ICACCT 2018
Delhi, India, March 9, 2018
Revised Selected Papers

123
Communications
in Computer and Information Science 899
Commenced Publication in 2007
Founding and Former Series Editors:
Phoebe Chen, Alfredo Cuzzocrea, Xiaoyong Du, Orhun Kara, Ting Liu,
Dominik Ślęzak, and Xiaokang Yang

Editorial Board
Simone Diniz Junqueira Barbosa
Pontifical Catholic University of Rio de Janeiro (PUC-Rio),
Rio de Janeiro, Brazil
Joaquim Filipe
Polytechnic Institute of Setúbal, Setúbal, Portugal
Igor Kotenko
St. Petersburg Institute for Informatics and Automation of the Russian
Academy of Sciences, St. Petersburg, Russia
Krishna M. Sivalingam
Indian Institute of Technology Madras, Chennai, India
Takashi Washio
Osaka University, Osaka, Japan
Junsong Yuan
University at Buffalo, The State University of New York, Buffalo, USA
Lizhu Zhou
Tsinghua University, Beijing, China
More information about this series at http://www.springer.com/series/7899
Ganesh Chandra Deka Omprakash Kaiwartya
•

Pooja Vashisth Priyanka Rathee (Eds.)

•

Applications of Computing
and Communication
Technologies
First International Conference, ICACCT 2018
Delhi, India, March 9, 2018
Revised Selected Papers

123
Editors
Ganesh Chandra Deka Pooja Vashisth
Ministry of Skill Development Department of Computer Science,
Delhi Shyama Prasad Mukherji College
India University of Delhi
Delhi
Omprakash Kaiwartya India
School of Science and Technology
Nottingham Trent University Priyanka Rathee
Nottingham Department of Computer Science,
UK North Campus
University of Delhi
Delhi
India

ISSN 1865-0929 ISSN 1865-0937 (electronic)

Communications in Computer and Information Science
ISBN 978-981-13-2034-7 ISBN 978-981-13-2035-4 (eBook)
https://doi.org/10.1007/978-981-13-2035-4

Library of Congress Control Number: 2018951240

© Springer Nature Singapore Pte Ltd. 2018

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.

This Springer imprint is published by the registered company Springer Nature Singapore Pte Ltd.
The registered company address is: 152 Beach Road, #21-01/04 Gateway East, Singapore 189721,
Singapore
 Preface

People across globe have understood the immense potential of IT with respect to its
contribution in terms of economic growth, efficient governance, and improving quality
of life in general. The main objective of the International Conference on Applications
of Computing and Communication Technologies 2018 (ICACCT-2018) held at
Shyama Prasad Mukherji College, University of Delhi, on March 9, 2018, was a
humble beginning toward the empowerment of our society through technology to
create a better tomorrow.
The University of Delhi is a premier university in India with a venerable legacy and
international acclaim for the highest academic standards, diverse educational programs,
distinguished faculty, illustrious alumni, varied co-curricular activities, and modern
infrastructure. Over the many years of its existence, the university has sustained the
highest global standards and best practices in higher education. Its long-term
commitment to nation building and unflinching adherence to universal human values
are reflected in its motto: “Nishtha Dhriti Satyam” (Dedication,
Steadfastness, and Truth). Established in 1922 as a unitary, teaching, and residential
university by the Act of the then Central Legislative Assembly, a strong commitment to
excellence in teaching, research, and social outreach has made the university a role
model and trend-setter for other universities. The President of India is the Visitor, the
Vice-President is the Chancellor, and the Chief Justice of the Supreme Court of India is
the Pro-Chancellor of the University. Beginning with three colleges and 750 students, it
has grown as one of the largest universities in India with 16 faculties, over 80 academic
departments, an equal number of colleges, and over seven lakh students.
SPM College is a well-known women’s college of the University of Delhi. It was
established in 1969 in the memory of distinguished academician and statesman Shyama
Prasad Mukherji. It has no affiliation with any sect, religion, political group, or
thinking. The college motto “tejasvi naa vadhi mastu” in Sanskrit has a profound
meaning. It is derived from the Taittiriya Upanisad. It means, “Let our efforts at
learning be luminous (Tejasvi) and filled with joy, and endowed with the force of
purpose (Vadhi Mastu).”
This conference was successful in facilitating academics, researchers, and industry
professionals to deliberate upon the latest issues and advancement in ICT and its
applications. In total, 109 papers were submitted in three tracks. After a thorough
review process, 30 papers were selected for oral presentation during the conference.
After the oral presentation of the papers at the conference, the papers were further
refined to enhance their quality.
VI Preface

This conference proceedings will prove beneficial for academics, researchers, and
practitioners as it contains a wealth of valuable information on the recent developments
in ICT.

July 2018 Ganesh Chandra Deka

Omprakash Kaiwartya
Pooja Vashisth
Priyanka Rathee
 Organization

General Chairs
Jaime Lloret Polytechnic University of Valencia, Spain
Punam Bedi University of Delhi, India
Pooja Vashisth University of Delhi, India
Omprakash Kaiwartya Nottingham Trent University, UK
Priyanka Rathee University of Delhi, India

Technical Program Committee

Ganesh Chandra Deka Ministry of Skill Development and Entrepreneurship,
(Chair) Government of India, India
Robin Singh Bhadoria IIIT Nagpur, India
(Co-chair)
Abdul Hanan Abdullah Universiti Teknologi Malaysia (UTM), Malaysia
Shiv Prakash Indian Institute of Information Technology (IIIT),
Kottayam, India
Sushil Kumar Jawaharlal Nehru University (JNU), New Delhi, India
Akshansh Gupta Jawaharlal Nehru University (JNU), New Delhi, India
Virendra Ranga National Institute of Technology, Kurukshetra, India
Yue Cao Northumbria University, Newcastle, UK
A. K. Verma Thapar University, India
Somayajulu D. V. L. N. National Institute of Technology, Warangal,
Telangana, India
Sudhakar Tripathi National Institute of Technology, Patna, India
Sujata Pal IIT Ropar, India
R. K. Aggrawal Jawaharlal Nehru University, Delhi, India
R. K. Sharma Thapar University, India
Rajiv Ratn Shah Singapore Multimedia University, Singapore
Sangram Ray National Institute of Technology, Sikkim, India
S. B. Bhattacharya Indian Association for Medical Informatics, India
Bhaskar Mandal National Institute of Technology, Jamshedpur, India
Kashif Naseer Bahria University, Islamabad, Pakistan
Koushlendra Kumar Singh Jamia Millia Islamia, India
M. Nizamuddin National Institute of Technology, Jamshedpur,
Jharkhand, India
Manoranjan Mohanty New York University Abu Dhabi, UAE
Meenakshi Tripathi Malviya National Institute of Technology, Jaipur, India
Navjot Singh National Institute of Technology, Uttrakhand, India
Neeraj Kumar Thapar University, India
VIII Organization

Neetesh Kumar Indian Institute of Information Technology (IIIT),

Gwalior, India
Nitin Kumar National Institute of Technology, Uttrakhand, India
Pinaki Mitra National Institute of Technology, Guwahati, India
Pradeep Singh National Institute of Technology, Raipur, India
Deepak Garg Bennett University School of Engineering and Applied
Sciences, India
Dilip Singh Sisodia National Institute of Technology, Raipur, India
Ditipriya Sinha National Institute of Technology, Patna, India
Geetali Banerji IITM, Delhi, India
Anjali Thukral University of Delhi, India
Gyanendra Verma National Institute of Technology, Kurukshetra, India
Harmeet Kaur University of Delhi, India
Bhawna University of Delhi, India
Biri Arun National Institute of Technology, Sikkim, India
Biplav Srivastava IBM
Brij Gupta National Institute of Technology, Kurukshetra, India
Chandresh Kumar Maurya IBM Research Center, Bangalore, India
Daya Gupta Indira Gandhi Delhi Technical University, India
Deepa Anand CMR Institute of Technology, Bangalore, India
Deepak Gupta NIT Arunachal Pradesh, Yupia, India
Harsha Ratnani Jagannath International Management School, Delhi,
India
Hema Banati University of Delhi, India
Mohd Ansari Jamia Millia Islamia, India
Mohammad Yahya H. King Khalid University, Abha, Saudi Arabia
Al-Shamri
Monica Arora Apeejay School of Management, Delhi, India
Mukesh Saini IIT Ropar, India
Pinaki Mitra IIT Guwahati, India
Prerna Mahajan IITM, Delhi, India
Raveesh University of Delhi, India
Richa Sharma University of Delhi, India
Rinkle Rani Thapar University, India
Sandeep Marwaha ICASR, India
Udai Pratap Rao S.V. National Institute of Technology, Surat, India
V. B. Singh University of Delhi, India
A. K. Mohapatra IGDTUW, India
Shefalika Ghosh Samaddar NIT Sikkim, India
Vinay Kumar Vivekananda Institute of Professional Studies (VIPS),
India
Deepali Kamthania Vivekananda Institute of Professional Studies (VIPS),
India
Judhistir Mahapatro National Institute of Technology, Uttarakhand, India
 Organization IX

Advisory Committee
Abdul Hanan Abdullah Universiti Teknologi Malaysia (UTM), Malaysia
Ao Lei University of Surrey, UK
Bingpeng Zhou Hong Kong University of Sciences Technology, SAR
China
Chandra K. Jaggi University of Delhi, India
D. K. Lobiyal Jawaharlal Nehru University, New Delhi, India
Jaime Lloret Polytechnic University of Valencia, Spain
K. K. Bharadwaj Jawaharlal Nehru University, New Delhi, India
Kusum Deep IIT Roorkee, India
Manoranjan Mohanty New York University Abu Dhabi, UAE
M. D. Asri Bin Ngadi Universiti Teknologi Malaysia (UTM), Malaysia
Mukesh Prasad University of Technology, Sydney, Australia
Paresh Virparia Sardar Patel University, Gujarat, India
Prakash C. Jha University of Delhi, India
Rajiv Ratn Shah Singapore Management University, Singapore
Saroj Kaushik Indian Institute of Technology, Delhi, India
Subhash Bhalla University of Aarhus, Denmark
Tiaohao Guo Queen Mary University of London, UK
Vasudha Bhatnagar University of Delhi, India
Vibhakar Mansotra University of Jammu, India
Xiaokang Zhou Shiaga University, Japan
Xu Zhang Xi’an University of Technology, China
Yue Cao Northumbria University, UK

Local Organizing Committee

Ram Shringar Raw Indira Gandhi National Tribal University, India
Reema Thareja SPMC, University of Delhi, India
Jaya Gera SPMC, University of Delhi, India
Baljeet Kaur SPMC, University of Delhi, India
Shweta Tyagi SPMC, University of Delhi, India
Pratibha SPMC, University of Delhi, India
Mansi Sood SPMC, University of Delhi, India
Anuradha Singhal SPMC, University of Delhi, India
Sonia Kumari SPMC, University of Delhi, India
Shaheen SPMC, University of Delhi, India
Akanksha Bansal Chopra SPMC, University of Delhi, India
Seema Rani SPMC, University of Delhi, India
X Organization

Student Coordinators

Manisha Vashisth
Pooja Garg
Anchal Dua
Deepali Singhal
Vaishali Wahi
 Contents

Communication and System Technologies

Trending Pattern Analysis of Twitter Using Spark Streaming . . . . . . . . . . . . 3

Prachi Garg, Rahul Johari, Hemang Kumar, and Riya Bhatia

NPCCPM: An Improved Approach Towards Community Detection

in Online Social Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
Hilal Ahmad Khanday, Rana Hashmy, and Aaquib Hussain Ganai

Financial Time Series Forecasting Using Deep Learning Network . . . . . . . . . 23

Preeti, Ankita Dagar, Rajni Bala, and Ram Pal Singh

MapReduce Based Analysis of Sample Applications Using Hadoop . . . . . . . 34

Mohd Rehan Ghazi and N. S. Raghava

End-to-End Security in Delay Tolerant Mobile Social Network . . . . . . . . . . . 45

Rinki Rani and C. P. Katti

Energy Efficient Transmission in the Presence of Interference for Wireless

Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55
Ajay Sikandar, Sushil Kumar, Prashant Singh, Manoj Kumar Tyagi,
and Durgesh Kumar

Capturing User Preferences Through Interactive Visualization to Improve

Recommendations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
Pooja Vashisth, Purnima Khurana, Punam Bedi, and Sumit Kr Agarwal

Item-Based Collaborative Filtering Using Sentiment Analysis

of User Reviews . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
Abhishek Dubey, Ayush Gupta, Nitish Raturi, and Pranshu Saxena

Emotion Analysis of Twitter Data Using Hashtag Emotions . . . . . . . . . . . . . 88

Prerna Goel and Reema Thareja

Secure Data Exchange and Data Leakage Detection

in an Untrusted Cloud . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99
Denis Ulybyshev, Bharat Bhargava, and Aala Oqab-Alsalem

Computing and Network Technologies

Call Admission Control Scheme for Cellular Wireless Network Using

Queueing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
Jitendra Kumar, Vikas Shinde, and Punit Johari
XII Contents

On Scalability of Interconnection Network Topologies. . . . . . . . . . . . . . . . . 130

Nibedita Adhikari and C. R. Tripathy

Minimizing Route Coupling Effect in Multipath Video Streaming Over

Vehicular Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 139
Ahmed Aliyu, Abdul Hanan Abdullah, Ajay Sikandar, Usman M. Joda,
Fatai I. Sadiq, and Abubakar Ado

Wireless EEG Signal Transmission Using Visible Light Optical

Camera Communication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 152
Geetika Aggarwal, Xuewu Dai, Richard Binns, Reza Saatchi,
Krishna Busawon, and Edward Bentley

Aeronautical Assisted IoT Implementation: Route Lifetime and Load

Capacity Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 162
Kirshna Kumar, Pankaj Kumar Kashyap, and Sushil Kumar

An Efficient Best Fit Channel Switching (BFCS) Scheme for Cognitive

Radio Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
Anisha Grover and Vikram Bali

Coarse-Grain Localization in Underwater Acoustic Wireless Sensor

Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
Archana Toky, Rishi Pal Singh, and Sanjoy Das

Content Credibility Check on Twitter . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197

Priya Gupta, Vihaan Pathak, Naman Goyal, Jaskirat Singh,
Vibhu Varshney, and Sunil Kumar

Transmission Line Sag Calculation with Ampacities

of Different Conductors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 213
Sandeep Gupta and Shashi Kant Vij

Fuzzy-Kohonen Self-organizing Clustering Algorithm in Wireless

Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225
Pankaj Kumar Kashyap, Kirshna Kumar, and Sushil Kumar

IEEE 802.11 Based Heterogeneous Networking: An Experimental Study . . . . 237

Piyush Dhawankar and Rupak Kharel

A Load-Aware Matching Game for Node Association in Wireless

Ad-Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
Upasana Dohare and D. K. Lobiyal

Optimizing and Enhancing the Lifetime of a Wireless Sensor Network

Using Biogeography Based Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . 260
Ajay Kaushik, S. Indu, and Daya Gupta
 Contents XIII

Application and Services

Investigation of Parameters Influencing the Success

of Crowdfunded Campaigns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275
Jaya Gera and Harmeet Kaur

Rise of Blockchain Technology: Beyond Cryptocurrency . . . . . . . . . . . . . . . 286

Hasil-E-Hayaat, Anu Priya, Aanchal Khatri, and Prashant Dixit

Smart Healthcare Based on Internet of Things . . . . . . . . . . . . . . . . . . . . . . 300

Dhruv Rohatgi, Siddharth Srivastava, Simran Choudhary,
Aanchal Khatri, and Vaishali Kalra

Blockchain Technology in Fund Management. . . . . . . . . . . . . . . . . . . . . . . 310

David Doe Fiergbor

Performance Analysis of Time Series Forecasting Using Machine Learning

Algorithms for Prediction of Ebola Casualties. . . . . . . . . . . . . . . . . . . . . . . 320
Manish Kumar Pandey and Karthikeyan Subbiah

Impeccable Renaissance Approach: An e-Village Initiative . . . . . . . . . . . . . . 335

Danish Faizan and Shaheen Ishrat

Bot Development for Military Wargaming Simulation . . . . . . . . . . . . . . . . . 347

Punam Bedi, S. B. Taneja, Pooja Satija, Garima Jain,
Aradhana Pandey, and Aditi Aggarwal

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 361

Communication and System
Technologies
 Trending Pattern Analysis of Twitter Using
Spark Streaming

Prachi Garg(&), Rahul Johari, Hemang Kumar, and Riya Bhatia

Wireless Adhoc Network Group of Engineering and Research (WANGER) Lab,

University School of Information, Communication and Technology (USICT),
Guru Gobind Singh Indraprastha University, Sector – 16C,
Dwarka 110078, Delhi, India
prachi3331@gmail.com, rahul.johari.in@ieee.org,
hemangsk@gmail.com, riyabhatia26@gmail.com

Abstract. A method had been adopted to predict the trending patterns on the
twitter in near-real time environment. These trending patterns help the compa-
nies to know their customers and to predict their brand awareness. The pattern
was recognized by analyzing the tweets fetched in real time environment and by
examining the most popular hashtags on the twitter platform in past few sec-
onds. The work was implemented using a big data technology ‘Spark Stream-
ing’. These hashtag patterns allow the people to follow the discussions on
particular brand, event or any promotion. These hashtags are used by many
companies as a signature tag to gain popularity of their brand on social net-
working platforms.

Keywords: Twitter patterns
Twitter trends
Popular hashtags

Spark Streaming
DStream

1 Introduction

Pattern recognition is the task of identifying similarities within a dataset. Twitter is a

social networking platform where people find and follow certain hashtags related to an
event, brand or any kind of promotion. The world is getting smaller and smaller day by
day through internet and usage of social sites. Data is growing exponentially as the
number of users and activities over the web are increasing rapidly [1]. The consumer
market is becoming competitive and the need to keep a tab on trends is a must. These
trends are the patterns being followed by most of the people. Twitter is a micro
blogging site that provides an opportunity for performing analysis on expressed
opinions and to predict the popular hashtags denoting a trend in the market [2]. In this
work, pattern recognition [3] of twitter trends was performed where tweets were fet-
ched on three consecutive days at same time every day. The tweets were processed and
the popular hashtags were computed separately for each day. These popular hashtags
denote the pattern on each day which is being followed by the people. While posting a
tweet, a user can mention a hashtag anywhere in the tweet text. Therefore only the
hashtags were extracted from each tweet and the count of each unique hashtag was

© Springer Nature Singapore Pte Ltd. 2018

G. C. Deka et al. (Eds.): ICACCT 2018, CCIS 899, pp. 3–13, 2018.
https://doi.org/10.1007/978-981-13-2035-4_1
4 P. Garg et al.

maintained. This count denoted the number of occurrences of the respective hashtag.
The pattern so formed is used further as awareness analysis.
Twitter is a social networking platform [4], where users posts, can retweet others’
post and can interact using twitter messages called tweets. Data across twitter appli-
cation is growing exponentially as the number of users and activities over the web are
increasing rapidly. People take over to twitter to present their opinions related to any
issue. Hashtags is usually a label used by many people to emphasize the theme of their
tweet content [5]. It makes it easier for other users to find and follow the content related
to such themes as highlighted by these tags. This work adopted the approach of
analyzing such hashtags to evaluate the theme or trending pattern being followed
currently by the various people on social sites. Different social networking sites uses
these hashtags to evaluate the inclination of various users and comes out with the trends
being followed. Different companies uses this analysis process to identify the per-
spectives of different people about their brand and predicts the reach of their products
to users. This helps the companies to perform the awareness analysis of their respective
products. Exploiting this approach in this work, the pattern of trending was evaluated
[6]. The work was performed in near-real time. Companies follows the same task for
larger intervals of time to come up with large patterns, but such huge computations are
not possible on a single node (standalone).

2 Problem Definition

This work focused on performing pattern recognition of trends being followed on the
twitter. The tweets are important for analysis because data arrive at a high frequency
and algorithms that process them must do so under very strict constraints of storage and
time. All public tweets posted on twitter are freely available through a set of APIs
provided by Twitter. Using streaming APIs, the streaming context object [7] (created
for every task of streaming in Spark) established the connection of the spark master to
the twitter. The fetching of tweets occurred in near-real time since Spark involves
micro- batch processing wherein the fetched data is stored in the form of batches at
regular intervals of time [8]. The pattern was recognized using the hashtags to predict
the trending pattern. Different companies perform the same task of pattern recognition
and trending analysis for large intervals of time. The gist of this task used by many
companies was being showcased in this work.
Today the data is generating in exponentially huge amount across different plat-
forms. Different companies uses such data to analyze the reach of their product to
people and the views about their product. It is impossible to manually process such a
huge amount of data. This is where the need of automatic analyzing process becomes
evident. That is why, the tool ‘Spark’ fits in here correctly. Spark has in-memory
processing, due to which the processing speed of datasets is quite high. It works using
Resilient Distributed Datasets (RDDs), which have partitions to store the data. This
involves parallel processing. Therefore, Spark core API called Spark Streaming was
used to implement the work.
Twitter allows users to post messages, find and follow hashtags and provides its
data in real time for the researchers to perform any kind of analysis on it. The messages
 Trending Pattern Analysis of Twitter Using Spark Streaming 5

known as ‘tweets’ are streamed in near-real time in this work, as it included the micro-
batch processing wherein different batches were formed containing tweets, at regular
intervals. Such a huge amount of data can be efficiently used for social network studies
and analysis to gain useful and meaningful results. A user follows a set of people, and
has a set of followers. When that user sends an update out, that update is seen by all of
his followers. User can also retweet other user’s updates. Users find and follow the
hashtags on twitter. Hashtags are the tags, defined using a symbol of hash, which are
used by people to emphasize the theme of their tweet content [2]. These labels are used
by users to easily find the messages with a specific theme or content. Different social
networking platforms uses these hashtags to predict the trending and to identify the
pattern of the popular hashtags. Companies implement this at large scale to predict the
awareness, about their respective products, among people. Since the tweets are fetched
in real time, therefore an ecosystem having high processing speed was required.

3 Proposed System

To improve the scalability, efficiency and processing speed, it was proposed to

implement the application on Spark. Since, spark provides in-memory processing, the
computational and processing speed of Spark is quite high. Spark uses the core API
known as Spark Streaming. Spark streaming works by creating DStreams (Discretized
Streams). While fetching the data, the data is stored only at regular intervals of time.
Therefore, a dataset known as RDD is used, which stores the data being streamed
during an interval of time. As the interval finishes, the data is streamed but will only be
stored, after the commencement of next interval, in new RDD. This process creates a
group of RDDs. This collection of RDDs is stated as DStream. The interval at which
the batch is formed is known as micro-batch processing intervals. The processing of
this DStream is also done at regular intervals of time. This interval is defined as
window interval. Window interval states that how many RDDs have to be taken from a
DStream, to process the data. Therefore at each interval, it defines a certain window
containing a number of RDDs, on which the computations will be applied to process
the data contained in those RDDs. This is how Spark Streaming works as depicted in
Fig. 1.

3.1 Twitter Streaming APIs

Twitter enables users to fetch the twitter data in real time using special streaming APIs.
These APIs helps the application to establish a connection between the twitter and the
sink. Twitter provides four keys: ‘Consumer Key’, ‘Consumer Secret key’, ‘Access
Token’ and ‘Access Token Secret’. These keys are treated as the APIs and are unique
to every user. In this work, these APIs were provided at the run time using arguments.
Following steps were being followed to generate the streaming APIs:
• An application was created by the user by visiting the twitter site, after logging into
twitter account.
6 P. Garg et al.

Fig. 1. Mechanism of streaming using Spark

• The newly created application generates a unique set of Consumer key and Con-
sumer Secret key.
• Along with this, a set of Access Token key and Access Token Secret key was
generated.
These keys are passed as arguments at run-time while executing the application.
Further these APIs are used to set the system properties so that twitter4j library can use
them to generate the OAuth credentials. This library is used by twitter stream to
establish the connection between twitter and the sink and finally create the stream to
fetch the data. To set the system properties, following command was used:

Similarly for other keys, the system properties were defined.

4 Methodology Adopted

4.1 Creating a Spark Streaming Context Object

This object is created by passing the Spark configuration object and the interval in
micro- batch processing. To create this object, following command was executed:

Here setAppName() method defines the application name. setMaster() defines the
cluster on which the spark will run. In this work, local mode was used as the cluster and
2 threads were used to implement it.
Spark Streaming uses this object to establish a connection between the source (from
where the live data has to be streamed) and the sink (where the live data will be stored).
 Trending Pattern Analysis of Twitter Using Spark Streaming 7

This object acts as the entry point for all streaming functionality. The Streaming
Context object is created after the initialization of Spark Configuration object and the
Spark Context object which are require to start the spark shell. Spark configuration
object also defines the cluster on which the application should be executed. There are
three possible clusters (master node) available in Spark which are ‘Mesos Cluster’,
‘Yarn Cluster’ and the ‘Local Mode’. This local mode is the standalone mode where
the application executes on the single node.

Here Seconds(1) is the micro-batch interval that is, the batch would be formed at
regular intervals of 1 s.

4.2 Creating a DStream

Spark streaming is a core Spark API which enables the live data stream processing.
Internally, this API transforms the live data streams being fetched into various batches.
Therefore, spark streaming never processes record by record of the fetched data, instead
it processes the whole batch at once. These batches are created at regular intervals of
time, and are stored as RDDs (Resilient Distributed Dataset). The collection of these
batches is known as DStreams (Discretized Streams). A group of batches are processed
in each interval. These groups of batches are defined using the window interval being
defined during the initialization of DStreams. Interval for creating the batches at regular
intervals is also defined in initialization phase. In this work, the interval for creating
batches was 1 s and the window interval was set as 5 s. This state that batches will be
formed at intervals of 1 s and the processing of DStreams (collection of batches) is
done at intervals of 5 s. This means that the processing will be done on the data being
fetched in last 5 s. This batch interval is known as micro-batch processing interval.
Spark Streaming works by creating an object called Spark Streaming Context.
Sometimes, a filter can be applied while fetching the tweets, which would then stream
only the tweets containing that particular filter keyword in the tweet text. The streaming
of tweets and the formation of batches occurs using the createStream() method. The
Streaming Context object and the filter (if there) is passed as arguments to it. Since this
whole process is executed on batches, and batches are formed only at regular intervals
of time, therefore this kind of streaming is stated as near-real time streaming.

Here ‘stream’ is the DStream formed for streaming the tweets. The ‘filters’ passed
as an argument in createStream() method is the filter if used to fetch the tweets. This
filter is used to target and fetch only those tweets, which have this value of filter being
used, in the tweet text. Therefore, only the tweets containing this word (value of filter)
would be fetched and stored in the DStream created. TwitterUtils is the class used as
the utility file to perform the real-time streaming of tweets.
8 P. Garg et al.

4.3 Filtering the Hashtags

The tweets being fetched undergoes the split() method. This method splits the tweet
text into words, where each word was analyzed whether it starts from a hashtag or not.
If the word starts with the hashtag, then that particular word was retained and rest of the
words of the whole tweet text were discarded. The splitting of the tweet was done using
“ ” delimiter.

In this process, on every tweet fetched, split() method was executed using the “ ”
delimiter. This divided each tweet text into words. Finally, the words beginning with #
were retained and rest of the words were discarded. Finally, ‘hashTags’ is the DStream
storing only the words starting with #.

4.4 Computing Popular Hashtags Using Window Interval

For each tweet streamed, hashtags were retained if present. Words other than hashtags
were discarded. Now the window was created which contained the hashtags of only
some particular time interval. This resulted in a collection of hashtags in that particular
window. In this work, the window of 5 s was used. This interval states that the window
would contain the hashtags identified out of tweets in last 5 s only. Any further pro-
cessing can now only be done individually on these windows. This was how the
processing of the tweets fetched in last 5 s was done. Now the count of each unique
hashtag was made which resulted in the number of occurrences of each hashtag across
the window set of hashtags. The hashtags were sorted based on the number of
occurrences (count value) and were finally displayed. Finally, the 10 most popular
hashtags (based on their number of occurrences) were displayed at each interval of 5 s.

Here the count of each unique hashtag was computed that is, how many number of
times a hashtag was used by different users. Finally the hashtags were sorted, using
sortByKey() method, in decreasing order based on the count value. In this command
the ‘Seconds(5)’ defines the window interval. A window was created which considers a
certain number of RDDs at a time. This window was formed at regular intervals of time
that is, at intervals of 5 s. Now the processing of RDDs would be done only at intervals
of 5 s. Therefore, RDDs lying in a particular window would be considered together
while processing.
 Trending Pattern Analysis of Twitter Using Spark Streaming 9

4.5 Simulation Performed

The approach followed in this work is explained below in Algorithm 1.

4.6 Pattern or Trend Recognition on Twitter

The fetched tweets and the computation of the most popular hashtags resulted in the
trends being followed currently. The same process was executed for three days at same
time every day. This resulted in different trends or the patterns of the tweets every day
[9]. This was how the pattern or the trend of twitter hashtags was predicted and
recognized. These trends are used by companies to get to know their customers and the
awareness of their product, brand or any promotion in market. These trends depicts
patterns of the awareness among people. Out of all the hashtags, the 10 most popular
hashtags were considered to form the trending pattern [10].
10 P. Garg et al.

Fig. 2. Popular hashtags identified on day 1.

Fig. 3. Popular hashtags identified on day 2.

4.7 Results
The application was executed on three consecutive days. The popular hashtags were
identified on all the three days, wherein the hashtags were identified from the tweets in
last 5 s. Figure 2 depicts the popular hashtags on day 1. It also defines the total number
of hashtags in that interval. Figure 3 depicts the popular hashtags that were identified
 Trending Pattern Analysis of Twitter Using Spark Streaming 11

Fig. 4. Popular hashtags identified on day 3.

Fig. 5. Bar chart depicting the results of this application

on day 2. Similarly, the process was executed on day 3, and the hashtags were iden-
tified as depicted in Fig. 4. The Fig. 5 depicts the bar chart depicting the hashtags
identified versus their respective number of occurrences on each day. Figure 6 depicts
the entire flow of steps being followed to generate the set of popular hashtags.
12 P. Garg et al.

Fig. 6. Flowchart mentioning the steps being followed.

5 Conclusion

Users find and follow the hashtags on twitter to support an issue or a product. Different
companies uses this method of trending as a way to compute the awareness of their
product. They identify, how many people are tweeting about their product using these
hashtags analysis. Companies uses it to find the reach of their product to different users.
Different social networking sites are using this kind of pattern recognition to evaluate
the trending patterns in real-time. Spark has the capability of in-memory processing,
 Trending Pattern Analysis of Twitter Using Spark Streaming 13

therefore, this tool was used to implement the system. This work is used for identifying
the fake tweets being made by people to come under the top trending group.

Acknowledgments. We would like to thank our institution Guru Gobind Singh Indraprastha
University for such a great exposure to accomplish such tasks and providing a strong platform to
develop our skills and capabilities.

References
1. Tsai, C.-W., Yang, Y.-L., Chiang, M.-C., Yang, C.-S.: Intelligent big data analysis: a review.
Int. J. Big Data Intell. 1(4), 181–191 (2014)
2. Weller, K., Bruns, A., Burgess, J.E., Mahrt, M., Puschmann, C.: Twitter and society: an
introduction. In: Twitter and Society, vol. 89, pp. xxix–xxxviii. Peter Lang, New York
(2014)
3. Hatua, A., Nguyen, T., Sung, A.: An approach for pattern recognition and prediction of
information diffusion model on Twitter. World Acad. Sci. Eng. Technol. Int. J. Comput. Inf.
Eng. 5(3) (2018)
4. Roberts, H., Sadler, J., Chapman, L.: The value of Twitter data for determining the
emotional responses of people to urban green spaces: a case study and critical evaluation.
Urban Stud. (2018). https://doi.org/10.1177/0042098017748544
5. Türker, İ., Sulak, E.E.: A multilayer network analysis of hashtags in twitter via co-
occurrence and semantic links. Int. J. Mod. Phys. B 32(4), 1850029 (2018)
6. De Cock, B., Pedraza, A.P.: From expressing solidarity to mocking on Twitter: pragmatic
functions of hashtags starting with# jesuis across languages. Lang. Soc. 47, 1–21 (2018)
7. Stypinski, M.: Apache Spark streaming (2017)
8. Shoro, A.G., Soomro, T.R.: Big data analysis: Apache spark perspective. Glob. J. Comput.
Sci. Technol. (2015)
9. Li, H., Dombrowski, L., Brady, E.: Working toward empowering a community: how
immigrant-focused nonprofit organizations use twitter during political conflicts. In:
Proceedings of the 2018 ACM Conference on Supporting Groupwork, pp. 335–346.
ACM (2018)
10. Javed, N., Muralidhara, B.L.: Semantic interpretation of tweets: a contextual knowledge-
based approach for tweet analysis. In: Margret Anouncia, S., Wiil, U.K. (eds.) Knowledge
Computing and Its Applications, pp. 75–98. Springer, Singapore (2018). https://doi.org/10.
1007/978-981-10-6680-1_4
 NPCCPM: An Improved Approach Towards
Community Detection in Online Social Networks

Hilal Ahmad Khanday ✉ , Rana Hashmy, and Aaquib Hussain Ganai

( )

Department of Computer Sciences, University of Kashmir, Srinagar, India

hilalhyder@gmail.com, ranahashmy@gmail.com,
hussainaaquib332@gmail.com

Abstract. In this paper, we focus on the task community detection in social

networks as it is the key aspect of complex network analysis. Lot of work has
already been carried out on community detection, though most of the work done
in this field is on non-overlapping communities. But in real networks, some nodes
may belong to more than one community, so overlapping community detection
needs more attention. The most popular technique for detecting overlapping
communities is the Clique Percolation Method (CPM) which is based on the
concept that the internal edges of a community are likely to form cliques due to
their high density. CPM uses the term k-clique to indicate a complete sub-graph
with k vertices. But it is not clear a priori which value of k one has to choose to
detect the meaningful structures. Here we propose a method NO PARAMETER
CORE CPM (NPCCPM) which calculates the value of k dynamically. Dynamic
calculation of k makes it sure to give out the good community structure. We have
developed a tool that improves the quality of simple CPM by making CPM-cover
much more efficient by absorbing all the eligible nodes to communities and
leaving out the bad nodes as outliers with respect to the given new detected cover.

Keywords: Social networks · Community detection · Clique · CPM

NPCCPM · Overlapping communities

1 Introduction

Social interactions have been increasing at a rapid pace, so to detect the subsets of nodes
in the social networks that are intra-densely interactive is an important task of the hour.
Understanding the structure of the network and making decisions in the network has
gained a great attention during last few years. Nodes in networks organize into densely
linked groups that are commonly referred to as network communities, clusters or
modules [1, 2]. The idea of community detection is different from the simple division
of network into sub-groups of members, rather it is a concrete (meaningful) division of
network into sub-groups of members. Detecting these communities in the social
networks is an NP Hard problem.
The understanding and models of network communities has evolved over time [3,
4]. Early works on network community detection were heavily influenced by the
research on the strength of weak ties [5]. This lead researchers to think of networks as

© Springer Nature Singapore Pte Ltd. 2018

G. C. Deka et al. (Eds.): ICACCT 2018, CCIS 899, pp. 14–22, 2018.
https://doi.org/10.1007/978-981-13-2035-4_2
 NPCCPM: An Improved Approach Towards Community Detection 15

consisting of dense clusters that are linked by a small number of long-range ties [6].
Graph partitioning [2], betweenness centrality [6], as well as modularity [7] based
methods all assume such view of network communities and thus search for edges that
can be cut in order to separate the clusters. Since then a lot of work has been done in the
field and later it was realized that such definition of network communities does not allow
for community overlaps. In many networks a node may belong to multiple communities
simultaneously which leads to overlapping community structure [8–10]. Since the inter‐
actions over the social networks are overlapped in nature [10], so using disjoint
community detection approach doesn’t suit best for social networks because of leaving
out some overlapped natural members of communities. Therefore the natural approach
for discovering the community structure in the social network is overlapped one.
Figure 1 is a simple network with two overlapping communities. In the figure, node 5
and node 6 belong to both the two communities, so they are overlapping nodes.

Fig. 1. Network with simple overlapped community structure

2 Related Work

Girvan and Newman’s algorithm [6] provides the key idea for community detection i.e.
whatever mechanism we use to detect the communities; the idea is to divide the network
into subsets of nodes, thereby increasing the power of intra-closeness within the groups
than between the groups. Detection of communities in social networks has two
approaches: one is the disjoint community detection - in which communities have no
intersected (common) members and another approach is overlapping community detec‐
tion - in which communities have some intersected members.
Since then much more work has been made in this area [11, 12]. Given a social
network represented by an undirected graph G with nodes n and edges m, the task of
community detection is to find the groups of nodes that are much more like communities.
The term community has made its existence since 1887 [6] but there is no globally
concrete definition of this term yet known but for us it is a group of nodes having better
intracloseness within group than intercloseness between groups [7, 8].
Many traditional community detecting methods hold that each node can only
belong to one community, such as Modularity optimization [13, 14], Hierarchical
clustering [6, 15], Spectral Algorithms [16, 17], methods based on statistical
16 H. A. Khanday et al.

inference [18]. However in some real networks, communities are not independent,
nodes can belong to more than one community, which will lead to overlapping
communities. For example, a researcher may belong to more than one research
group, or a protein may exist in multiple complex systems. Therefore, the identifi‐
cation of overlapping communities is of central importance.
The principal step in the direction of the overlapped community detection approach
has been made by Palla et al. in 2005 whilst proposing Clique Percolation Method
(CPM). CPM is based on the impression that communities tend to form cliques due to
the high density of edges inside. The CPM works by detecting the cliques in the given
social graph of some clique size k, where k is the number of nodes forming the clique.
This CPM is able to discover a community structure that mostly makes the coverage of
a minimum number of nodes under respective community cover, although there can be
a vast percentage of nodes in the network that can be best members of some communities
in the CPM’s detected cover.
Palla and co-workers have designed a software package implementing the CPM,
called cfinder, which is freely available (www.cfinder.org). The algorithm has been
extended to the analysis of weighted, directed and bipartite graphs. For weighted graphs,
in principle one can follow the standard procedure of thresholding the weights, and then
applying the method on the resulting graphs, treating them as unweighted. Farkas et al.
[10] proposed that instead of thresholding the weights of cliques, defines the geometric
mean of the weights of all edges of the clique. The method has been extended to bipartite
graphs by Lehmann et al. [8].
The clique size k parameter is a big disadvantage of CPM because it is unclear
beforehand on what value of k, CPM will result the best meaningful community structure
[1]. There is also an extended version of this CPM that has been named as extended
CPM (ECPM). ECPM uses basic result cover of simple CPM as core cover uses
belonging coefficient to cover all other nodes that have been left uncovered by CPM.
This approach takes much more time to make the coverage of all nodes possible.

3 Proposed Method

Clique Percolation Method (CPM) is the most common technique for detecting over‐
lapped communities. It is based on the concept that the internal edges of a community
are likely to form cliques due to their high density. On the other hand, it is unlikely that
intercommunity edges form cliques. Palla et al. uses the term k-clique to indicate a
complete sub-graph with k vertices. But it is not clear a priori which value of k one has
to choose to detect meaningful structures. Our work tries to resolve the problem of this
clique size parameter k by calculating it dynamically in the given network, such that
there is no difference in making choice about its value beforehand in which case one is
not sure about the reliability of final community structure. We then improve the quality
of CPM by using the output communities of CPM as cores and by using community
conductance [10] as a measure to absorb the rest of the nodes that have been left uncov‐
ered by CPM in efficient amount of time; less its value, better is community like structure.
Another random document with
no related content on Scribd:
always and to remember that the modern woman owes it to herself to go out
of the home and keep abreast with the times?”
But it was not a question. It was a statement. Freda made no reply and
her mother changed the subject with the satisfied air of the sower of seed.
“When you come to Ireland,” she told her father laughingly that night,
“you will sit on the doorstep and learn to smoke a pipe. And Gregory will
be president of the Republic. And I will be—(ask mother)—a model
housewife, chasing the pigs—”
They laughed with an abandonment which indicated some joke deeper
than the banality about the pigs.
“It’s a worthy task,” said her father. “I’ll come—and I’ll enjoy learning
to smoke a pipe and see Gregory run the government—and as for you—
whatever you do you’ll be doing it with spirit.”
She nodded.
“I’ve just begun to break my trail.”
Then the day came when they must leave the little frame house and after
the excitement of getting extremely long railway tickets at the station and
checking all Freda’s luggage through to New York, they said good-by to the
Thorstads and left them standing together, incongruous even in their
farewells to their daughter.
They were to stop at St. Pierre over night. Mrs. Flandon had written to
urge them to do so and Freda would not have refused, if she had been
inclined to, bearing the sense of her obligation to them. She had not told her
father of that. It amused her to think that her father and Gregory each felt
the other responsible for those Fortunatus strings of railway ticket. But she
wanted Gregory to meet the Flandons again that the debt might be more
explainable later on.
St. Pierre was familiar this time when they entered it in mid-afternoon as
she had on that first arrival with her mother. It was pleasant to see Mrs.
Flandon again and to taste just for a moment the comfortable luxury of the
Flandon house. Freda felt in Mrs. Flandon a warmth of friendliness which
made it easy to speak of the money and assure her of Gregory’s ability to
pay it a little later.
“You’re not to bother,” said Helen, “until you’re quite ready. We were
more glad to send it than I can tell you. It’s a hostage to fortune for us.”
 Then she changed the subject quickly.
“I wonder if you’ll mind that I asked a few people for dinner to-night.
You married a celebrity and you want to get used to it. So many people
were interested in the news item about your marriage and wanted to meet
Gregory and you. I warned them not to dress so that’s all right.”
“It’s very nice,” said Freda, “I’ll enjoy it and I think—though I never
dare to speak for Gregory—that he will too. I remember having a beautiful
time at dinner here before. When I was here visiting the Brownleys you
asked me—do you remember?”
“I asked the Brownleys to-night. They were in town—all but Allie. I
asked the elder two and Bob and her young man—Ted Smillie, you know.”
She looked at Freda a little quizzically and Freda looked back,
wondering how much she knew.
“Think they’ll want to meet me?” she asked straight-forwardly.
“I do, very much. I think it’s better, Freda, just to put an end to any silly
talk. It may not matter to you but you know I liked your father so much and
it occurred to me that it might matter to him if any untrue gossip were not
killed. And it’s so very easy to kill it.”
“You take a great deal of trouble for me,” protested Freda.
Helen hesitated. She was on the verge of greater confidence and decided
against it.
“Let me do as I please then, will you?” she said smilingly and Freda
agreed.
Helen felt a little dishonest about it. The dinner was another hostage to
fortune. It was gathering up the loose ends neatly—it was brushing out of
sight bits of unsightly thought—establishing a basis which would enable
her later to do other things.
She had an idea that it would please Gage, though he had been non-
committal when she had broached the idea of having Gregory and his wife
for a brief visit. Helen had seen but little of Gage of late. She knew he was
working hard and badly worried about money. They had sold a piece of
property to raise that thousand for the Macmillans and he had told her
definitely of bad times ahead for him. She offered to reduce the expenses of
the household and he had agreed in the necessity. They must shave every
expense. But it invigorated Helen. She had amends to make to Gage and the
more practical the form the easier it was to make them. Neither of them
desired to unnecessarily trouble those dark waters of mental conflict now.
Helen guessed that Gage’s mind was not on her and that the bad tangle of
his business life absorbed him. Brusque, haggard, absorbed, never
attempting or apparently needing affection, he came and went. Never since
Carpenter’s death had they even discussed the question of separation. That
possibility was there. They had beaten a path to it. But hysteria was too
thoroughly weeded out of Gage to press toward it. Without mutual reproach
they both saw that separation in the immediate future was the last
advantageous thing for the work of either of them and flimsy as that
foundation seemed for life together, yet it held them. They turned their
backs upon what they had lost or given up and looked ahead. Helen heard
Gage refer some political question to her for the first time, with a kind of
wonder. She suspected irony, then dropped her own self-consciousness as it
became apparent that he really did not have any twisted motive behind the
query. She began to see that in great measure he had swung loose from her,
substituting some new strength for his dependence on her love. And, when
some moment of emotional sorrow at the loss of their ardors came over her,
she turned as neatly as did he from disturbing thought to the work, which
piled in on her by letter and by conference.

They sat at dinner in the long white-paneled dining-room, twelve men

and women. The three Brownleys and young Ted Smillie—Jerrold Haynes
because Helen wanted to have him meet Freda and Emily Haight because
she fitted in with Jerrold now that Walter Carpenter was gone. To these
Helen had added the young Harold Spencers because they were the leaders
of that group of young people who made or destroyed gossip. It was a
dinner party made up hurriedly on the excuse of Gregory’s celebrity and
such little intrigue as was hidden in its inception made it no less a pleasant
company.
Interest was concentrated on Freda and Gregory of course and under
Helen’s deft manipulation the story of their marriage and its secrecy was
told, lightly, but with a clearness of detail that sent Ted’s eyes rather
consciously to his plate once or twice as he avoided Barbara’s glance. Ted
was sitting beside Freda and paying her open homage when he could get her
attention. But Gage had much to say to her.
 “Are you still chasing romance?” he asked. “I always remember your
startling me with your belief that women were more attractive when they
believed in romance.”
“Yes—I’m still after it. I feel the least bit guilty towards Gregory.
Because while he goes back to Ireland with his heart in his hands ready to
offer it to the country, the whole revolution is to me not as great tragedy as
it is adventure. It is tragedy intellectually but not emotionally as far as I am
concerned while to Gregory”—she turned her head to glance at Gregory.
“And marriage is adventure too, isn’t it?”
She forgot Ted and leaned a confidential elbow towards Gage, resting
her chin in her cupped hand.
“I wouldn’t dare say it in the hearing of my mother or the feminist
feminists but that’s what it is. They talk of partnerships and new contracts—
but they can’t analyze away or starve the adventure of it. All this talk—all
the development of women changes things, but its chief change is in
making the women type different—stronger, finer, you know, like your wife
and Margaret Duffield. But even with women like that when it comes to
love and to marriage it is adventure, isn’t it? You can’t rationalize things
which aren’t rational and you can’t modernize the things that are eternal.”
She became a little shy, afraid of her words. “Mother thinks I’m a
reactionary. I don’t think I am. I want women to be stronger, finer—I’ll
work for that—but that’s one thing, Mr. Flandon. It hasn’t anything to do
with the adventure between men and women, really.”
He started at that. But Ted claimed Freda’s attention and reluctantly she
turned to him.
“I think you treated me rather badly not telling me you were married. I
thought all along that I had a chance, you know.”
The brazenness did not make her angry. Nothing could anger her to-
night. She was all warm vigor, pervading every contact between her and
every one else.
“Barbara looks very well to-night,” she answered with cool irrelevance.
Barbara did. She had dressed with her customary skill but with the wit to
avoid her usual look of sophistication. To-night she was playing the artless
simple girl for Gregory’s benefit, listening to him with only an appreciative
comment now and then. It was clear that Gregory was talking to her as he
talked to one in whom he felt there was intelligence.
 “And how clever she is,” added Freda reflectively.
The talk grew more general. Barbara called the attention of every one to
something Gregory had said, a concession for one who did not usually share
her dinner partners or else a successful attempt to break up other
conversations. Irish problems led to a discussion of general politics. Helen
was in the talk now—vigorously. Mrs. Brownley gave the retailed opinion
of Mr. Brownley before he could quote himself.
Gage heard without contributing to what was being said. He was
listening with amusement to Mrs. Brownley’s platitudes and half
unconsciously letting his admiration rise at the clarity of Helen’s thought
and the deftness of her phrases. What presence she had! In the
contemplation of her he felt the problems which had been harassing him all
day—deadlocks in plans, money shortage, fall away. As they had used to—
he slipped into memories and amazingly they did not cause him pain,
though even as he looked he saw upon her the marks of the work she had
done and would do, the new definiteness, the look of being headed
somewhere. But his rancor seemed to have burned itself out and with it had
gone the old possessive passion. He stirred restlessly. Some phœnix was
rising.
Mr. Brownley turned at his movement, offering sympathy.
“Nothing for us to do, Gage,” he chuckled tritely, “except to talk about
recipes. The women talk politics now.”
Gage did not laugh at the old joke.
“Women and men may get together on a subject yet,” he answered, with
heavy awkwardness.
Instantly it seemed to him that it was what he had meant to say for a long
time. He caught the incredulous, almost pitiful look on Helen’s face as she
heard and pretended not to hear, met the quick, wondering glance she
snatched away from him.
Her tremulousness gave him confidence. Impatient of his guests now, he
looked across at her, his eyes kindling. Whether they could work it out
through his storms and hers ceased to gnaw at his thought of her. He saw
her strong, self-sufficient, felt his own strength rising to meet hers, also
self-sufficient. The delight of the adventure, the indestructible adventure
between man and woman remained. His mind moored there.
THE END
Typographical errors corrected by the etext transcriber:
rose with the bawn=> rose with the dawn {pg 149}
what a beneficient=> what a beneficent {pg 183}
 *** END OF THE PROJECT GUTENBERG EBOOK
SPELLBINDERS ***

Updated editions will replace the previous one—the old editions will
be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright in
these works, so the Foundation (and you!) can copy and distribute it
in the United States without permission and without paying copyright
royalties. Special rules, set forth in the General Terms of Use part of
this license, apply to copying and distributing Project Gutenberg™
electronic works to protect the PROJECT GUTENBERG™ concept
and trademark. Project Gutenberg is a registered trademark, and
may not be used if you charge for an eBook, except by following the
terms of the trademark license, including paying royalties for use of
the Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is very
easy. You may use this eBook for nearly any purpose such as
creation of derivative works, reports, performances and research.
Project Gutenberg eBooks may be modified and printed and given
away—you may do practically ANYTHING in the United States with
eBooks not protected by U.S. copyright law. Redistribution is subject
to the trademark license, especially commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund from
the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law in
the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms of
this agreement by keeping this work in the same format with its
attached full Project Gutenberg™ License when you share it without
charge with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.

1.E. Unless you have removed all references to Project Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears, or
with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
 This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning of
this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.

1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if you
provide access to or distribute copies of a Project Gutenberg™ work
in a format other than “Plain Vanilla ASCII” or other format used in
the official version posted on the official Project Gutenberg™ website
(www.gutenberg.org), you must, at no additional cost, fee or expense
to the user, provide a copy, a means of exporting a copy, or a means
of obtaining a copy upon request, of the work in its original “Plain
Vanilla ASCII” or other form. Any alternate format must include the
full Project Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™ works
unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or providing

access to or distributing Project Gutenberg™ electronic works
provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
 copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™

electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
the Project Gutenberg Literary Archive Foundation, the manager of
the Project Gutenberg™ trademark. Contact the Foundation as set
forth in Section 3 below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on, transcribe
and proofread works not protected by U.S. copyright law in creating
the Project Gutenberg™ collection. Despite these efforts, Project
Gutenberg™ electronic works, and the medium on which they may
be stored, may contain “Defects,” such as, but not limited to,
incomplete, inaccurate or corrupt data, transcription errors, a
copyright or other intellectual property infringement, a defective or
damaged disk or other medium, a computer virus, or computer
codes that damage or cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in paragraph
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of receiving it,
you can receive a refund of the money (if any) you paid for it by
sending a written explanation to the person you received the work
from. If you received the work on a physical medium, you must
return the medium with your written explanation. The person or entity
that provided you with the defective work may elect to provide a
replacement copy in lieu of a refund. If you received the work
electronically, the person or entity providing it to you may choose to
give you a second opportunity to receive the work electronically in
lieu of a refund. If the second copy is also defective, you may
demand a refund in writing without further opportunities to fix the
problem.

1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted
by the applicable state law. The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.
1.F.6. INDEMNITY - You agree to indemnify and hold the
Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and distribution
of Project Gutenberg™ electronic works, harmless from all liability,
costs and expenses, including legal fees, that arise directly or
indirectly from any of the following which you do or cause to occur:
(a) distribution of this or any Project Gutenberg™ work, (b)
alteration, modification, or additions or deletions to any Project
Gutenberg™ work, and (c) any Defect you cause.

Section 2. Information about the Mission of

Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new computers.
It exists because of the efforts of hundreds of volunteers and
donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project Gutenberg™’s
goals and ensuring that the Project Gutenberg™ collection will
remain freely available for generations to come. In 2001, the Project
Gutenberg Literary Archive Foundation was created to provide a
secure and permanent future for Project Gutenberg™ and future
generations. To learn more about the Project Gutenberg Literary
Archive Foundation and how your efforts and donations can help,
see Sections 3 and 4 and the Foundation information page at
www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation
The Project Gutenberg Literary Archive Foundation is a non-profit
501(c)(3) educational corporation organized under the laws of the
state of Mississippi and granted tax exempt status by the Internal
Revenue Service. The Foundation’s EIN or federal tax identification
number is 64-6221541. Contributions to the Project Gutenberg
Literary Archive Foundation are tax deductible to the full extent
permitted by U.S. federal laws and your state’s laws.

The Foundation’s business office is located at 809 North 1500 West,

Salt Lake City, UT 84116, (801) 596-1887. Email contact links and up
to date contact information can be found at the Foundation’s website
and official page at www.gutenberg.org/contact

Section 4. Information about Donations to

the Project Gutenberg Literary Archive
Foundation
Project Gutenberg™ depends upon and cannot survive without
widespread public support and donations to carry out its mission of
increasing the number of public domain and licensed works that can
be freely distributed in machine-readable form accessible by the
widest array of equipment including outdated equipment. Many small
donations ($1 to $5,000) are particularly important to maintaining tax
exempt status with the IRS.

The Foundation is committed to complying with the laws regulating

charities and charitable donations in all 50 states of the United
States. Compliance requirements are not uniform and it takes a
considerable effort, much paperwork and many fees to meet and
keep up with these requirements. We do not solicit donations in
locations where we have not received written confirmation of
compliance. To SEND DONATIONS or determine the status of
compliance for any particular state visit www.gutenberg.org/donate.

While we cannot and do not solicit contributions from states where

we have not met the solicitation requirements, we know of no
prohibition against accepting unsolicited donations from donors in
such states who approach us with offers to donate.

International donations are gratefully accepted, but we cannot make

any statements concerning tax treatment of donations received from
outside the United States. U.S. laws alone swamp our small staff.

Please check the Project Gutenberg web pages for current donation
methods and addresses. Donations are accepted in a number of
other ways including checks, online payments and credit card
donations. To donate, please visit: www.gutenberg.org/donate.

Section 5. General Information About Project

Gutenberg™ electronic works
Professor Michael S. Hart was the originator of the Project
Gutenberg™ concept of a library of electronic works that could be
freely shared with anyone. For forty years, he produced and
distributed Project Gutenberg™ eBooks with only a loose network of
volunteer support.

Project Gutenberg™ eBooks are often created from several printed

editions, all of which are confirmed as not protected by copyright in
the U.S. unless a copyright notice is included. Thus, we do not
necessarily keep eBooks in compliance with any particular paper
edition.

Most people start at our website which has the main PG search
facility: www.gutenberg.org.

This website includes information about Project Gutenberg™,

including how to make donations to the Project Gutenberg Literary
Archive Foundation, how to help produce our new eBooks, and how
to subscribe to our email newsletter to hear about new eBooks.