Collaborative Computing Networking Applications

and Worksharing 13th International Conference

CollaborateCom 2017 Edinburgh UK December 11 13
2017 Proceedings Imed Romdhani download
https://textbookfull.com/product/collaborative-computing-
networking-applications-and-worksharing-13th-international-
conference-collaboratecom-2017-edinburgh-uk-
december-11-13-2017-proceedings-imed-romdhani/

Download more ebook from https://textbookfull.com

We believe these products will be a great fit for you. Click
the link to download now, or visit textbookfull.com
to discover even more!

Collaborative Computing Networking Applications and

Worksharing 11th International Conference
CollaborateCom 2015 Wuhan November 10 11 2015 China
Proceedings 1st Edition Song Guo
https://textbookfull.com/product/collaborative-computing-
networking-applications-and-worksharing-11th-international-
conference-collaboratecom-2015-wuhan-november-10-11-2015-china-
proceedings-1st-edition-song-guo/

Medical Image Understanding and Analysis 21st Annual

Conference MIUA 2017 Edinburgh UK July 11 13 2017
Proceedings 1st Edition María Valdés Hernández

https://textbookfull.com/product/medical-image-understanding-and-
analysis-21st-annual-conference-miua-2017-edinburgh-uk-
july-11-13-2017-proceedings-1st-edition-maria-valdes-hernandez/

Intelligent Human Computer Interaction 9th

International Conference IHCI 2017 Evry France December
11 13 2017 Proceedings 1st Edition Patrick Horain

https://textbookfull.com/product/intelligent-human-computer-
interaction-9th-international-conference-ihci-2017-evry-france-
december-11-13-2017-proceedings-1st-edition-patrick-horain/

Distributed Computing and Internet Technology 13th

International Conference ICDCIT 2017 Bhubaneswar India
January 13 16 2017 Proceedings 1st Edition Padmanabhan
Krishnan
https://textbookfull.com/product/distributed-computing-and-
internet-technology-13th-international-conference-
icdcit-2017-bhubaneswar-india-january-13-16-2017-proceedings-1st-
Intelligent Computing Theories and Application 13th
International Conference ICIC 2017 Liverpool UK August
7 10 2017 Proceedings Part I 1st Edition De-Shuang
Huang
https://textbookfull.com/product/intelligent-computing-theories-
and-application-13th-international-conference-
icic-2017-liverpool-uk-august-7-10-2017-proceedings-part-i-1st-
edition-de-shuang-huang/

Service Oriented Computing 15th International

Conference ICSOC 2017 Malaga Spain November 13 16 2017
Proceedings 1st Edition Michael Maximilien

https://textbookfull.com/product/service-oriented-computing-15th-
international-conference-icsoc-2017-malaga-spain-
november-13-16-2017-proceedings-1st-edition-michael-maximilien/

Smart Computing and Communication Second International

Conference SmartCom 2017 Shenzhen China December 10 12
2017 Proceedings 1st Edition Meikang Qiu

https://textbookfull.com/product/smart-computing-and-
communication-second-international-conference-
smartcom-2017-shenzhen-china-december-10-12-2017-proceedings-1st-
edition-meikang-qiu/

Advances in Computer Entertainment Technology 14th

International Conference ACE 2017 London UK December 14
16 2017 Proceedings 1st Edition Adrian David Cheok

https://textbookfull.com/product/advances-in-computer-
entertainment-technology-14th-international-conference-
ace-2017-london-uk-december-14-16-2017-proceedings-1st-edition-
adrian-david-cheok/

Shell structures : theory and applications. Volume 4.

Proceedings of the 11th International Conference "Shell
Structures: Theory and Applications" (SSTA 2017),
October 11-13, 2017, Gdansk, Poland 1st Edition
Wojciech Pietraszkiewicz
https://textbookfull.com/product/shell-structures-theory-and-
applications-volume-4-proceedings-of-the-11th-international-
conference-shell-structures-theory-and-applications-
Imed Romdhani
Lei Shu
Hara Takahiro
Zhangbing Zhou
Timothy Gordon
Deze Zeng (Eds.)
252

Collaborative Computing:
Networking, Applications
and Worksharing
13th International Conference, CollaborateCom 2017
Edinburgh, UK, December 11–13, 2017
Proceedings

123
Lecture Notes of the Institute
for Computer Sciences, Social Informatics
and Telecommunications Engineering 252

Editorial Board
Ozgur Akan
Middle East Technical University, Ankara, Turkey
Paolo Bellavista
University of Bologna, Bologna, Italy
Jiannong Cao
Hong Kong Polytechnic University, Hong Kong, Hong Kong
Geoffrey Coulson
Lancaster University, Lancaster, UK
Falko Dressler
University of Erlangen, Erlangen, Germany
Domenico Ferrari
Università Cattolica Piacenza, Piacenza, Italy
Mario Gerla
UCLA, Los Angeles, USA
Hisashi Kobayashi
Princeton University, Princeton, USA
Sergio Palazzo
University of Catania, Catania, Italy
Sartaj Sahni
University of Florida, Florida, USA
Xuemin Sherman Shen
University of Waterloo, Waterloo, Canada
Mircea Stan
University of Virginia, Charlottesville, USA
Jia Xiaohua
City University of Hong Kong, Kowloon, Hong Kong
Albert Y. Zomaya
University of Sydney, Sydney, Australia
More information about this series at http://www.springer.com/series/8197
Imed Romdhani Lei Shu
•

Hara Takahiro Zhangbing Zhou

•

Timothy Gordon Deze Zeng (Eds.)

•

Collaborative Computing:
Networking, Applications
and Worksharing
13th International Conference, CollaborateCom 2017
Edinburgh, UK, December 11–13, 2017
Proceedings

123
Editors
Imed Romdhani Zhangbing Zhou
Edinburgh Napier University China University of Geosciences
Edinburgh Beijing
UK China
Lei Shu Timothy Gordon
Guangdong University of Petrochemical University of Nebraska–Lincoln
Technology Lincoln
Maoming UK
China
Deze Zeng
Hara Takahiro School of Computer Science
Osaka University China University of Geosciences
Osaka Wuhan, Hubei
Japan China

ISSN 1867-8211 ISSN 1867-822X (electronic)

Lecture Notes of the Institute for Computer Sciences, Social Informatics
and Telecommunications Engineering
ISBN 978-3-030-00915-1 ISBN 978-3-030-00916-8 (eBook)
https://doi.org/10.1007/978-3-030-00916-8

Library of Congress Control Number: 2018954768

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 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 Switzerland AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
 Preface

We are delighted to introduce the proceedings of the 13th edition of the 2017 European
Alliance for Innovation (EAI) International Conference on Collaborative Computing:
Networking, Applications and Worksharing (CollaborateCom). This conference has
brought together researchers, developers, and practitioners from around the world who
are leveraging and developing collaboration between distributed teams of humans,
computer applications, and/or autonomous robots to achieve higher productivity and
produce joint products that would have been impossible to develop without the con-
tributions of multiple collaborators.
The technical program of CollaborateCom 2017 consisted of 65 papers, in oral
presentation sessions during the main conference tracks. The three-day conference
included ten sessions. Aside from the high-quality technical paper presentations, the
technical program also featured one keynote speech titled “Converged Technology for
Intelligent Airport Services.” The keynote speaker was Prof. Henry Wang from the
University of West London, UK.
Coordination between the Steering Committee and the Organizing Committee was
essential for the success of the conference. We sincerely appreciate the support and
guidance of the general chairs: Prof. Takahiro Hara, Lei Shu and Imed Romdhani. We
would like to thank the program chairs: Zhangbing Zhou, Timothy Gordon, and
Takahiro Hara, who supervised the review process of the technical papers and com-
piled a high-quality technical program. We greatly appreciate the excellent support and
hard work of the local chair, Prof. Imed Romdhani. We are also grateful to the con-
ference manager, Dominika Belisova, for her support, and all the authors who sub-
mitted their papers to the CollaborateCom 2017 conference.
We strongly believe that the CollaborateCom conference provides a good forum for
all researchers, developers, and practitioners to discuss all science and technology
aspects that are relevant to collaborative computing. We also expect that the future
CollaborateCom conference will be as successful and stimulating as indicated by the
contributions presented in this volume.

August 2018 Imed Romdhani

Lei Shu
Hara Takahiro
Zhangbing Zhou
Timothy Gordon
Deze Zeng
 Organization

Steering Committee
Imrich Chlamtac EAI/Create-Net, Italy
Song Guo University of Aizu, Japan
Bo Li The Hong Kong University of Science and Technology,
SAR China
Xiaofei Liao Huazhong University of Science and Technology, China

Organizing Committee
Honorable Chair
Qinghua Zhang Guangdong University of Petrochemical Technology,
(President) China

General Co-chairs
Lei Shu Guangdong University of Petrochemical Technology,
China/University of Lincoln, UK
Takahiro Hara Osaka University, Japan
Imed Romdhani Edinburgh Napier University, UK

TPC Co-chairs
Timothy Gordon University of Lincoln, UK
Zhangbing Zhou China University of Geosciences, Beijing,
China/TELECOM SudParis, France

General Track Co-chairs

Liehuang Zhu Beijing Institute of Technology, China
Jianwei Niu Beihang University, China

Track 1 Co-chairs
Jianwu Wang University of Maryland, Baltimore County, USA
Zhuofeng Zhao North China University of Technology, China

Track 2 Co-chairs
Yucong Duan Hainan University, China
Antonella Longo University of Salento, Italy
VIII Organization

Track 3 Co-chairs
Shigang Yue University of Lincoln, UK
Farshad Arvin University of Manchester, UK

Track 4 Co-chairs
Helge Janicke De Montfort University, UK
Leandros Maglaras De Montfort University, UK/ABMS Open University,
Switzerland

Local Co-chairs
Jiafu Wan South China University of Technology, Guangzhou, China
Jianfeng Huang Guangdong University of Petrochemical Technology,
China

Workshops Co-chairs
Peng Li University of Aizu, Japan
Chunsheng Zhu The University of British Columbia, Canada

Publicity Co-chairs
Oli Mival Edinburgh Napier University, UK
Weipeng Jing Northeast Forestry University, China
Daichi Amagata Osaka University, Japan

Posters and PhD Track Chair

Mithun Mukherjee Guangdong University of Petrochemical Technology,
China

Publication Co-chairs
Fei Lei Beijing University of Technology, China
Deze Zeng China University of Geosciences, Wuhan, China

Demo Chair
Amjad Mehmood Guangdong University of Petrochemical Technology,
China

Poster/Demo Co-chair
Sanjay Madria Missouri University of Science and Technology, USA

Sponsorship Co-chairs
Li Yan Guangdong University of Petrochemical Technology,
China
Guangjie Han Hohai University, China
 Organization IX

Web Chair
Zhiqiang Huo University of Lincoln, UK

Special Sessions
Special Session: Internet of Things
Special Session Chair
Ahmed Al-Dubai Edinburgh Napier University, UK

Special Session: Collaborative Next Generation Networking

Special Session Co-chairs
Deze Zeng China University of Geosciences, Wuhan, China
Heng Qi Dalian University of Technology, China

Special Session: Collaboration Techniques in Data-Intensive Cloud Computing

Special Session Co-chairs
Shaojie Qiao Chengdu University of Information Technology, China
Cheqing Jin East China Normal University, China
Hongzhi Wang Harbin Institute of Technology, China

Special Session: Collaborative Manufacturing System and Machinery Fault

Diagnosis
Special Session Co-chairs
Ailin Yu Guangdong University of Technology, China
Chilou Zhou South China University of Technology, China
Jianfeng Huang Guangdong University of Petrochemical Technology,
China

Workshop: Vehicular Telematics over Heterogeneous Wireless Networks

Workshop Chair
Daxin Tian Beihang University, China

Conference Manager
Dominika Belisova European Alliance for Innovation
X Organization

Technical Program Committee

Ali Emre Turgut Middle East Technical University, Turkey
Abdelrahman Osman University of Tabuk, Saudi Arabia
Elfaki
Alex Norta Tallinn University of Technology, Estonia
Antonella Longo University of Salento, Italy
Anna Lisa Ferrara University of Surrey, UK
Athanasios Giannetsos University of Surrey, UK
Aggeliki Tsohou Ionian University, Greece
Antonis Tzounis University of Thessaly, Greece
Artemios Voyiatzis TU Wien, Austria
Bin Li Guangzhou Maritime University, China
Christos Xenakis University of Piraues, Greece
Chao Tong Beihang University, China
Dayang Sun The University of British Columbia, Canada
Francois Siewe De Montfort University, UK
Fekade Getahun Addis Ababa University, Ethiopia
Guolin He South China University of Technology, China
Guangquan Xu Tianjin University, China
Georgios V. Lioudakis National Technological University of Athens, Greece
Georgios Karopoulos National and Kapodistrian University of Athens, Greece
Honghao Gao Shanghai University, China
Helge Janicke De Montfort University, UK
Haoming Li Freescale Semiconductors, Inc., USA
Haipeng Dai Nanjing University, China
Iryna Yevseyeva De Montfort University, UK
Jianlong Xu Shantou University, China
Jianqiang Wang Tsinghua University, China
Jian Wang Inria, France
Jin Liu Wuhan University, China
Jin Li Guangzhou University, China
Joe Tekli Lebanese American University (LAU), Lebanon
Joel Rodrigues University of Beira Interior, Portugal
Kutluk Bilge Arikan Atilim University, Turkey
Mengxuan Li China Ship Development and Design Center, China
Maria Karyda University of the Aegean, Greece
Marco Comerio University of Milano-Bicocca, Italy
Mohamed Amine Ferrag Guelma University, Algeria
Meikang Qiu Pace University, USA
Mingliang Xu Zhengzhou University, China
Man Hon Cheung The Chinese University of Hong Kong, SAR China
Nanjangud C. Narendra MS Ramaiah University of Applied Sciences, India
Nianjun Joe Zhou IBM T. J. Watson Research Center, USA
Nikos Tziritas Chinese Academy of Sciences, China
Ouyang Zhenchao Beihang University, China
 Organization XI

Payam Zahadat University of Graz, Austria

Panagiotis Andriotis University of the West of England, UK
Pavlina Fragkou Technological Institute of Athens, Greece
Qiang Duan Pennsylvania State University, USA
Shuichang Liu Hunan University of Technology, China
Shangguan Wei Beijing Jiaotong University, China
Shangguang Wang Beijing University of Posts and Telecommunications,
China
Shizhan Chen Tianjin University, China
Stephan University of Leicester, UK
Reiff-Marganiec
Simon Watson University of Manchester, UK
Shasha Mo Beihang University, China
Sotiris Moschoyiannis University of Surrey, UK
Song Guo Hong Kong Polytechnic University, SAR China
Tomas Krajnik Czech Technical University, Czech Republic
Tiago Cruz University of Coimbra, Portugal
Vasilis Sourlas University College London, UK
Wentao Wang Guangzhou City Polytechnic, China
Wencan Zhang Foshan University, China
Weiwei Fang Beijing Jiaotong University, China
Yingchun Long Shaoguan University, China
Yingjun Chen Guangdong University of Petrochemical Technology,
China
Yucong Duan Hainan University, China
Yunchuan Sun Beijing Normal University, China
Ying He De Montfort University, UK
Ying Li Beihang University, China
Yu Shui Deakin University, Australia
Liangyong Qi Qufu Normal University, China
Limin Sun Chinese Academy of Sciences, China
Long Cheng Virginia Tech, USA
Lu Liu University of Derby, UK
Le Dong University of Electronic Science and Technology of China
(UESTC), China
Xiujuan Liang Guangdong Ocean University, China
Xiaolei Ma University of Washington, USA
Xiaobing Sun Yangzhou University, China
Xiong Li Hunan University of Science and Technology, China
Xinkai Wu Cal Poly Pomona, USA
Zhipeng Cai Georgia State University, USA
Zheli Liu Nankai University, China
 Contents

Main Track

Sentiment Analysis of Chinese Words Using Word Embedding

and Sentiment Morpheme Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Jianwei Niu, Mingsheng Sun, and Shasha Mo

Collaborative and Green Resource Allocation in 5G HetNet

with Renewable Energy . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
Yi Liu, Yue Gao, Shengli Xie, and Yan Zhang

On Cost Efficient Dataflow Computing Program Deployment in SDN

Managed Distributed Computing Environment . . . . . . . . . . . . . . . . . . . . . . 27
Yating Zhang, Yuepeng Li, Long Zheng, and Deze Zeng

A Short Review of Constructing Noise Map Using

Crowdsensing Technology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Xuhui Zhang, Lei Shu, Zhiqiang Huo, Mithun Mukherjee, and Yu Zhang

Research of Positioning Tracking on Dynamic Target Based on the Integral

Complementing Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
Jianrong Xu, Guiping Lu, Jingsheng Lin, and Jianfeng Huang

LWTP: An Improved Automatic Image Annotation Method Based

on Image Segmentation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
Jianwei Niu, Shijie Li, Shasha Mo, and Jun Ma

A Comparative Analysis of Content Delivery Capability for Collaborative

Dual-Architecture Network. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
Xuan Liu, Peng Yang, Yongqiang Dong, and Syed Hassan Ahmed

AXE: Objects Search in Mobile Volunteered Service. . . . . . . . . . . . . . . . . . 73

Yao Wu, Wenjuan Liang, Yuncheng Wu, Hong Chen, and Cuiping Li

Modeling the Impacts of WiFi Signals on Energy Consumption

of Smartphones. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 88
Yuxia Sun, Junxian Chen, and Yong Tang

Constrained Route Planning Based on the Regular Expression . . . . . . . . . . . 98

Jing Wang, Huiping Liu, and Zhao Zhang

A Human-Machine Collaborative Detection Model for Identifying

Web Attacks. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
Yong Hu, Bo Li, Weijing Ye, and Guiqin Yuan
XIV Contents

A Reinforcement Learning Based Workflow Application Scheduling

Approach in Dynamic Cloud Environment . . . . . . . . . . . . . . . . . . . . . . . . . 120
Yi Wei, Daniel Kudenko, Shijun Liu, Li Pan, Lei Wu, and Xiangxu Meng

p-Faster R-CNN Algorithm for Food Detection. . . . . . . . . . . . . . . . . . . . . . 132

Yanchen Wan, Yu Liu, Yuan Li, and Puhong Zhang

PUED: A Social Spammer Detection Method Based on PU Learning

and Ensemble Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
Yuqi Song, Min Gao, Junliang Yu, Wentao Li, Lulan Yu, and Xinyu Xiao

Position vs. Attitude: How Topological Factors Influence Our Difference

in the Attitudes on Online Interrelationships? A Case Study
with Language Use . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
Bo Wang, Yingjun Sun, Yuexian Hou, Dawei Song, and Ruifang He

Route-Oriented Participants Recruitment in Collaborative Crowdsensing . . . . 164

Shu Yang, Jinglin Li, Quan Yuan, and Zhihan Liu

Management Node Selection Based on Cloud Model

in a Distributed Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176
Hanyi Tang, Qibo Sun, and Jinglin Li

CNTE: A Node Centrality-Based Network Trust Evaluation Method . . . . . . . 186

Xiang Yuan, Qibo Sun, and Jinglin Li

Minimum Cost Load Migration in Distributed Software Defined Networks. . . 197

Kuangyu Qin, Chuanhe Huang, N. Ganesan, and Kewei Liu

Hybrid-Aware Collaborative Multipath Communications

for Heterogeneous Vehicular Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
Yana Liu, Wei Quan, Jinjie Zeng, Gang Liu, and Hongke Zhang

Internet of Things (IoT) and Collaboration

RETaIL: A Machine Learning-Based Item-Level Localization System

in Retail Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 221
Xiaoyi Xu, Xiaoming Chen, Jiang Ji, Feng Chen, and Addicam V. Sanjay

A Point of Interest Recommendation Approach by Fusing Geographical

and Reputation Influence on Location Based Social Networks . . . . . . . . . . . 232
Jun Zeng, Feng Li, Junhao Wen, and Wei Zhou

An Electricity Power Collection Data Oriented Missing Data

Imputation Solution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243
Jiangqi Chen, Han Li, Ting Zhao, and He Liu
 Contents XV

Curve-Registration-Based Feature Extraction for Predictive Maintenance

of Industrial Equipment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 253
Shouli Zhang, Xiaohong Li, Jianwu Wang, and Shen Su

Predicting Next Points of Interests Based on a Markov Model . . . . . . . . . . . 264

Jie Xu, Chunxiao Xing, and Yong Zhang

A Topology-Aware Reliable Broadcast Scheme for Multidimensional

VANET Scenarios. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275
Fengrui Liu, Chuanhe Huang, and Xiying Fan

MAC-ILoc: Multiple Antennas Cooperation Based Indoor Localization

Using Cylindrical Antenna Arrays . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 286
Wu Jie, Zhu Minghua, and Xiao Bo

Easing Traffic Congestion: An Improved Clustering Method for Sharing

Bike Station Deployment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 296
Jian Kang, Weipeng Jing, and Chengfang Zhao

Sensor Data Classification for the Indication of Lameness in Sheep. . . . . . . . 309

Zainab Al-Rubaye, Ali Al-Sherbaz, Wanda McCormick, and Scott Turner

Collaborative Data and Workflow Management

Learning Planning and Recommendation Based on an Adaptive

Architecture on Data Graph, Information Graph and Knowledge Graph . . . . . 323
Lixu Shao, Yucong Duan, Zhangbing Zhou, Quan Zou,
and Honghao Gao

A 3D Registration Method Based on Indoor Positioning

Through Networking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 333
Haibo Li, Huahu Xu, Honghao Gao, Minjie Bian, and Huaikou Miao

A Load Balancing Method Based on Node Features

in a Heterogeneous Hadoop Cluster. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 344
Pengcheng Yang, Honghao Gao, Huahu Xu, Minjie Bian,
and Danqi Chu

Towards Collaborative Typed Resources Manipulation in Health-Care

Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355
Lixu Shao, Yucong Duan, Zhangbing Zhou, Antonella Longo,
Donghai Zhu, and Honghao Gao

Constructing Search as a Service Towards Non-deterministic and Not

Validated Resource Environment with a Positive-Negative Strategy . . . . . . . . 365
Yucong Duan, Lixu Shao, Xiaobing Sun, Lizhen Cui, Donghai Zhu,
and Zhengyang Song
XVI Contents

A Passenger Flow Analysis Method Through Ride Behaviors

on Massive Smart Card Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 374
Weilong Ding, Zhuofeng Zhao, Han Li, Yaqi Cao, and Yang Xu

Ranking the Influence of Micro-blog Users Based on Activation

Forwarding Relationship . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383
Yiwei Yang, Wenbin Yao, and Dongbin Wang

UR Rank: Micro-blog User Influence Ranking Algorithm Based

on User Relationship . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 394
Wenbin Yao, Yiwei Yang, and Dongbin Wang

Using the MapReduce Approach for the Spatio-Temporal Data Analytics

in Road Traffic Crowdsensing Application . . . . . . . . . . . . . . . . . . . . . . . . . 405
Sandhya Armoogum and Shevam Munchetty-Chendriah

An Efficient Critical Incident Propagation Model for Social Networks

Based on Trust Factor . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 416
XiaoMing Li, Limengzi Yuan, ChaoChao Liu, Wei Yu, Xue Chen,
and Guangquan Xu

Impact of the Important Users on Social Recommendation System . . . . . . . . 425

Zehua Zhao, Min Gao, Junliang Yu, Yuqi Song, Xinyi Wang,
and Min Zhang

Analysis on Communication Cost and Team Performance in Team

Formation Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 435
Weijun Chen, Jing Yang, and Yang Yu

An Efficient Black-Box Vulnerability Scanning Method

for Web Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 444
Haoxia Jin, Ming Xu, Xue Yang, Ting Wu, Ning Zheng, and Tao Yang

Collaboration with Artificial Intelligence

Collaborative Shilling Detection Bridging Factorization

and User Embedding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 459
Tong Dou, Junliang Yu, Qingyu Xiong, Min Gao, Yuqi Song,
and Qianqi Fang

Integrating User Embedding and Collaborative Filtering for Social

Recommendations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 470
Junliang Yu, Min Gao, Yuqi Song, Qianqi Fang, Wenge Rong,
and Qingyu Xiong

CORB-SLAM: A Collaborative Visual SLAM System for Multiple Robots . . . 480

Fu Li, Shaowu Yang, Xiaodong Yi, and Xuejun Yang
 Contents XVII

Security and Trustworthy

An Efficient and Privacy Preserving CP-ABE Scheme

for Internet-Based Collaboration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 493
Jinmiao Wang and Bo Lang

An Efficient Identity-Based Privacy-Preserving Authentication Scheme

for VANETs. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 508
Jie Cui, Wenyu Xu, Kewei Sha, and Hong Zhong

ProNet: Toward Payload-Driven Protocol Fingerprinting via Convolutions

and Embeddings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 519
Yafei Sang, Yongzheng Zhang, and Chengwei Peng

Formal Verification of Authorization Policies for Enterprise Social

Networks Using PlusCal-2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530
Sabina Akhtar, Ehtesham Zahoor, and Olivier Perrin

High Performance Regular Expression Matching on FPGA . . . . . . . . . . . . . 541

Jiajia Yang, Lei Jiang, Xu Bai, and Qiong Dai

Adaptive Carving Method for Live FLV Streaming . . . . . . . . . . . . . . . . . . . 554

Haidong Ge, Ning Zheng, Lin Cai, Ming Xu, Tong Qiao, Tao Yang,
Jinkai Sun, and Sudeng Hu

Android App Classification and Permission Usage Risk Assessment . . . . . . . 567

Yidong Shen, Ming Xu, Ning Zheng, Jian Xu, Wenjing Xia, Yiming Wu,
Tong Qiao, and Tao Yang

A Privacy Settings Prediction Model for Textual Posts on Social Networks . . . 578
Lijun Chen, Ming Xu, Xue Yang, Ning Zheng, Yiming Wu, Jian Xu,
Tong Qiao, and Hongbin Liu

Collaboration Techniques in Data-intensive Cloud Computing

HSAStore: A Hierarchical Storage Architecture for Computing Systems

Containing Large-Scale Intermediate Data . . . . . . . . . . . . . . . . . . . . . . . . . 591
Zhoujie Zhang, Limin Xiao, Shubin Su, Li Ruan, Bing Wei, Nan Zhou,
Xi Liu, Haitao Wang, and Zipeng Wei

Early Notification and Dynamic Routing: An Improved SDN-Based

Optimization Mechanism for VM Migration . . . . . . . . . . . . . . . . . . . . . . . . 602
Xuanlong Qin, Dagang Li, Ching-Hsuan Chen, and Nen-Fu Huang

Cloud Data Assured Deletion Based on Information Hiding

and Secondary Encryption with Chaos Sequence. . . . . . . . . . . . . . . . . . . . . 613
Yijie Chen and Wenbin Yao
XVIII Contents

Performance Analysis of Storm in a Real-World Big Data Stream

Computing Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 624
Hongbin Yan, Dawei Sun, Shang Gao, and Zhangbing Zhou

Collaborative Next Generation Networking

Shortest Path Discovery in Consideration of Obstacle in Mobile Social

Network Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 637
Dawei Sun, Wentian Qu, Shang Gao, and Li Liu

Minimize Residual Energy of the 3-D Underwater Sensor Networks

with Non-uniform Node Distribution to Prolong the Network Lifetime . . . . . 647
Gaotao Shi, Jia Zeng, Chunfeng Liu, and Keqiu Li

Combinational Meta-paths Mining for Correlation Relationship Evaluation

in Bibliographic Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 660
Qinchen Wu, Peng Wu, and Li Pan

Detecting Spammer Communities Using Network Structural Features . . . . . . 670

Wen Zhou, Meng Liu, and Yajun Zhang

Citation Based Collaborative Summarization of Scientific Publications

by a New Sentence Similarity Measure . . . . . . . . . . . . . . . . . . . . . . . . . . . 680
Chengzhe Yuan, Dingding Li, Jia Zhu, Yong Tang, Shahbaz Wasti,
Chaobo He, Hai Liu, and Ronghua Lin

Collaborative Manufacturing System and Machinery Fault Diagnosis

Exploiting User Activities for Answer Ranking in Q&A Forums. . . . . . . . . . 693

Chenyang Zhao, Liutong Xu, and Hai Huang

A Two-Level Classifier Model for Sentiment Analysis. . . . . . . . . . . . . . . . . 704

Haidong Hao, Li Ruan, Limin Xiao, Shubin Su, Feng Yuan,
Haitao Wang, and Jianbin Liu

An Effective Method for Self-driving Car Navigation based on Lidar . . . . . . 718

Meng Liu, Yu Liu, Jianwei Niu, Yu Du, and Yanchen Wan

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 729

Main Track
 Sentiment Analysis of Chinese Words
Using Word Embedding and Sentiment
Morpheme Matching

Jianwei Niu(B) , Mingsheng Sun, and Shasha Mo

State Key Laboratory of Virtual Reality Technology and Systems,

School of Computer Science and Engineering, Beihang University,
Beijing 100191, China
[email protected]

Abstract. Sentiment analysis has become significantly important with

the increasing demand of Natural Language Processing (NLP). A novel
Chinese Sentiment Words Polarity (CSWP) analyzing method, which
is based on sentiment morpheme matching method and word embed-
ding method, is proposed in this paper. In the CSWP, the sentiment
morpheme matching method is creatively combined with existing word
embedding method, it not only successfully retained the advantages of
flexibility and timeliness of the unsupervised methods, but also improved
the performance of the original word embedding method. Firstly, the
CSWP uses word embedding method to calculate the polarity score
for candidate sentiment words, then the sentiment morpheme match-
ing method is applied to make further analysis for the polarity of words.
Finally, to deal with the low recognition ratio in the sentiment mor-
pheme matching method, a synonym expanding step is added into the
morpheme matching method, which can significantly improve the recog-
nition ratio of the sentiment morpheme matching method. The perfor-
mance of CSWP is evaluated through extensive experiments on 20000
users’ comments. Experimental results show that the proposed CSWP
method has achieved a desirable performance when compared with other
two baseline methods.

Keywords: Sentiment polarity analysis · Word formation rule

Sentiment morpheme matching · Word embedding
Synonym expanding

1 Introduction
Recent years has witnessed the rapid development of the Internet. With the
explosive growth in the online comment number, the value of massive informa-
tion has emerged gradually. Mining the valuable information from comments
often relies on extracting the sentimental polarity of texts. In much previous
work, the sentiment analysis is done at document level. However, the sentiment
c ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018
I. Romdhani et al. (Eds.): CollaborateCom 2017, LNICST 252, pp. 3–12, 2018.
https://doi.org/10.1007/978-3-030-00916-8_1
4 J. Niu et al.

analyzing of comments often requires sentence-level or even word-level sentiment

analysis. What’s more, the word-level sentiment analysis is the basics of all other
sentiment analyzing works.
One promising sentiment analysis method is to combine the manual tagged
corpora with the supervised learning method. In this sentiment analysis method,
a supervised learning model will be trained with tagged dataset, and then use
the trained model to execute analyzing work. For training the machine learning
models, [1] manually collected and tagged 177 negative tweets and 182 positive
tweets and, [2] manually tagged 900 sentences and 2519 words. As can be seen
that before the analysis work, lots of corpora must be manually collected and
tagged for training the supervised machine learning models. However, collecting
and tagging the massive corpora is time costly and boring. Additionally, the
training set in [1] is collected in period time, and the training set in [2] only
content limited sentiences and words. The limited size will lead these datasets
cannot include enough sentiment expression form, thereby leading the bad adap-
tive capacity in different situations.
The other promising sentiment analysis method is to use massive untagged
corpora to train unsupervised method. A typical practice of these methods is
to use the statistical methods on massive corpora to calculate the probability
of a word’s sentiment polarity. [3] exploited the PMI to calculate the polar-
ity score for the candidate sentiment words. However, the PMI is sensitive to
frequency. It means that two low frequency words can also have a high PMI
value. Additionally, [4] utilized word embedding method to convert words into
word vectors and use word vectors to calculate the similarity between candidate
words and sentiment seed sets. Word2vec tool can generate the real vectors for
words according to the context of them. However, two words which have opposite
sentiment polarity also can have similar context in sometimes.
In this paper, A novel Chinese Sentiment Words Polarity (CSWP) analyzing
method is proposed. The design of the CSWP is to exploit the word embedding
method and the sentiment morpheme matching method. The CSWP retains
the advantages about flexibility and timeliness of the unsupervised methods.
These features can lead to better practicality in real life. The performance of
CSWP is evaluated through extensive experiments on 20000 online comments.
The experimental results showed that the proposed CSWP method achieved a
desirable performance compared with other methods.
The rest paper is organized as follows. Section 2 reviews related research
about word-level sentiment analysis. Section 3 overviews the architecture of
CSWP and describes the implement of CSWP in detail. Section 4 reports a
series of experiments to evaluate the performance of CSWP, and the results are
shown in the end of this section. Finally, conclusions are driven in Sect. 5.

2 Related Work
This section will review the related work in the field of word-level sentiment
analysis. Up to now, there are two kinds of methods have been proposed for
 CSWP 5

sentiment words analysis: the supervised based method and the unsupervised
based method.
The methods based on supervised method always use some trained mathe-
matical models and some manual tagged corpora to predict the sentiment polar-
ity of words. For example, [5] considered the polarity judging question as a binary
classification problem, and used SVM models to analyze the sentiment polarity.
Moreover, [6,7] used conjunctions as the training features of machine learning
models to judge the sentiment polarity of sentiment words. In addition, morphol-
ogy information and syntactic information also have been exploited in sentiment
polarity analysis [8]. What’s more, with the huge growth in the use of microblogs
[9,10], [11,12] implemented SVM model to extract the emoticons and as these
emoticons as the judging gists for analyzing the sentiment polarity of text. They
considered that emoticons can accurately reflect the real emotion of microblogs.
As for methods based on the unsupervised method, they usually utilize mas-
sive untagged corpora and statistical methods. [13] directly used the similarity
of words to judge their sentiment polarity. [14] also used the value of similarity,
but the authors considered the similarity as the features of clustering method.
Additionally, the statistical variables such as Point Mutual Information, Coin-
cident Entropy and PageRank also have been used in sentiment analysis [3,15].
These statistical variables are exploited to calculate the sentiment polarity score
for candidate sentiment words. Because the unsupervised methods are based on
untagged corpora and statistical methods, they generally have relative low pre-
cision ratio. However, the advance of do not need manual tagged corpora leads
these methods always have strong timeliness and can adapt variable situations.

3 Methodology
This section will describe the detailed flow of the CSWP and the rationale behind
the design of the CSWP. Firstly, the overview of the CSWP will be introduced,
and then the detail of the CSWP will be described step by step. Finally, the
pseudo code will be shown in the end of this section.

3.1 System Overview

The architecture of the proposed CSWP method is shown in Fig. 1. The CSWP
method mainly contains three phases: the preprocessing phase, the initial judge
phase and the further judge phase. In the preprocessing phase, a large collection
of online comments is segmented into independent Chinese words. The segment
step is implemented by using the HanLP Chinese segment tool1 —a useful Chi-
nese text processing tool. After finished the segment step, all the adjectives are
picked out to build up candidate sentiment words set. In the initial judge phase,
the candidate sentiment words are given. The initial judge phase is responsible
to calculate polarity score for every candidate sentiment words. In the end, can-
didate words are sent into further judge phase. The further judge phase exploits
1
https://github.com/hankcs/HanLP.
6 J. Niu et al.

sentiment morpheme matching method to make further judge for the polarity of
the candidate sentiment words, and the final judging results will be output by
this phase.

CSWP

Online Candidate Word2Vec Words Similarity Word Embedding

Preprocessing
Comments Words Vectors Judging

Pre-processing Initial Judge

Sentiment Morpheme Analysis

Morphemes Matching judging Results

Further Judge

Fig. 1. Architecture of CSWP method

3.2 Preprocessing Phase

Unlike English, there are not separators between Chinese words, so the word
segmentation is a necessary step in Chinese natural language processing. The
preprocessing phase is responsible to segment the dataset and pick out all the
candidate sentiment words by using the HanLP Chinese segment tool. During
segmenting the dataset into independent words, the HanLP also tags the part-of-
speech for every candidate sentiment words. The HanLP Chinese segment tool
utilize “ad” to tag the adjectives. Then in the step of picking out the candidate
sentiment words, the preprocessing phase picks out all the adjectives as the
candidate words. The examples of Chinese words segmentation results are shown
in Table 1.

Table 1. The example of word segmentation results

3.3 Initial Judge Phase

The initial judge phase is used to calculate the polarity score for every candidate
sentiment words. The specific process of this phase can be divided into the
following two steps:

– Step 1. Generate Word Vectors

Firstly, all the words are sorted according to their frequency in the dataset,
and then twenty obvious positive candidate words and twenty obvious nega-
tive candidate words are picked out to build up positive negative seed sets.
These two seed sets will be used in step 2 to assist with calculating the polarity
 CSWP 7

score. Next, all the candidate sentiment words are converted into 200 dimen-
sional vectors by exploiting word2vec tool. The word2vec tool can convert the
words into continuous space vectors and while retain the context features for
the words.
– Step 2. Calculate the Polarity Score
Firstly, the value of similarity between candidate sentiment words and senti-
ment seed sets (including the positive seed set and the negative seed set) is
calculated. Then the similarity between candidate word and the positive seed
set is defined as the word’s positive similarity, and the similarity between a
candidate word and negative seed set is defined as the word’s negative seed
set. After getting the similarity, the polarity score of a word is calculated
by utilizing the word’s positive similarity to minus it’s negative similarity.
The positive and negative of the score implies the positive and negative of
the sentiment polarity of the word. The formula of computing similarity and
polarity score are shown in 1 and 2, respectively.
m
 k
l=1 Ail ×Bjl
sim(Ai |B) =   (1)
k 2 k 2
j=1 l=1 (Ail ) × l=1 (Bjl ) ×m
score(Ai ) = sim(Ai |C) − sim(Ai |D) (2)

where A donates the set of candidate words, and B donates the set of
sentiment seeds (positive seeds or negative seeds). Ai (i = 1, 2, . . . , n) and
Bj (j = 1, 2, . . . , m) donate the vector of the word. Vector Ai is composed
by Ai1 , Ai2 , . . . , Aik , and vector Bj is composed by Bj1 , Bj2 , . . . , Bjk . The
subscript k is the dimension of the word vector. What’s more, C donates the
positive sentiment seed set, and D donates the negative sentiment seed set.
Cj and Dj donate the vector of word, they have same structure as Bj .

3.4 Further Judge Phase

Although word embedding method can judge the polarity of sentiment words
independently, the frequency of words and the context of words can influence
the analyzing results. Moreover, the size and the content of text also will influence
the results. All above factors may lead to a reduction in performance. To mitigate
the influence of these issues, a sentiment word formation rule matching method
is proposed to assist with the word embedding method. Through utilizing the
formation rule matching method, the CSWP can correct some errors caused by
previous factors. But if you want to use formation rules to judge the polarity of
sentiment words independently, you may also get a bad result, because formation
rules always hard to be summarized, and it is impossible to collect all rules.
Therefore, an independent rule matching method cannot adapt complex real
situations.
The sentiment word formation rules which the CSWP exploits is based on
sentiment morpheme matching method and synonym expanding method. Exist-
ing work mentioned that some sentiment words express their sentiment through
8 J. Niu et al.

their interior morphemes, so exploiting some sentiment morpheme matching

rules can also analyze the sentiment polarity of Chinese words. For example,
only contains the positive morpheme , so this word
will be judged as positive sentiment word. But contains the pri-
vative morpheme and positive , furthermore, the privative
morpheme has more front position than positive morpheme in ,
so will be judged as negative sentiment word. The specific
steps of this phase can be divided into following 3 steps:

– Step1. Sentiment Morpheme Matching

After using cosine similarity to calculate the polarity score, CSWP scans every
candidate word for checking whether it contains positive morpheme, negative
morpheme and privative morpheme. In course of scanning morphemes, CSWP
will utilize the morpheme matching rules to judge the sentiment polarity of
the candidate words. If a candidate word cannot match any rule, then CSWP
will jump to step 2. If all the candidate words have finished the sentiment mor-
pheme matching, then CSWP will jump to step 3. The sentiment morpheme
matching problem can be described as follows: given a candidate sentiment
Chinese word W = w1 w2 . . . wn , where wi is the morpheme in the Chinese
word W , and subscript i is the position indicator of wi . The goal of the
method is to determine the position of wi in W . Before giving the specific
rules description, we have several conventions about symbol expression, they
are shown as follows:
1. if wi is a positive morpheme, then use pi to replace it.
2. if wi is a negative morpheme, then use ei to replace it.
3. if wi is a privative morpheme, then use ri to replace it.
So, the specific rules can be described as follows:
– Rule1: given a W , if pi ∈ W , ej ∈ / W , rk ∈
/ W ; then score = 1.
– Rule2: given a W , if pi ∈ W , ej ∈ / W , rk ∈ W and i < k; then score = 0.
– Rule3: given a W , if pi ∈ W , ej ∈ / W , rk ∈ W and k < i; then score =
−1.
– Rule4: given a W , if pi ∈ / W , ej ∈ W , rk ∈
/ W ; then score = −1.
– Rule5: given a W , if pi ∈ / W , ej ∈ W , rk ∈ W and k < j; then score = 1.
– Rule6: given a W , if pi ∈ / W , ej ∈ W , rk ∈ W and j < k; then score = 0.
– Rule7: given a W , if pi ∈ W , ej ∈ W , rk ∈ / W and j < i; then score =
−1.
– Rule8: given a W , if pi ∈ W , ej ∈ W , rk ∈ W and k < j < i; then
score = 1.
– Step 2. Synonyms Expanding
If a candidate word can’t match any rule, then the process will jump to
this step. The candidate word sent to this step will be expanded to some
synonyms by searching synonym dictionary. Then, the CSWP will use this
word’s synonyms continue to execute step 1. And if one of the synonyms can
match a rule, the polarity score of this candidate word also will be changed.
– Step 3. Output Final Results
Finally, after step 1 has finished the sentiment morpheme matching process,
 CSWP 9

the final results have come into being. The candidate words which have pos-
itive score will be marked as positive sentiment words, and the candidate
words which have negative score will be marked as negative sentiment words.
Moreover, the words which have zero score will be given up.

3.5 Pseudo Code of CSWP

Algorithm 1 explains how CSWP works. Line 2–7 corresponds the word embed-
ding judging phase. Line 8–14 corresponds the sentiment morpheme matching
phase.

Algorithm 1. Sentiment polarity judging

Input: SDP dataset, sentiment morphemes, synonym dictionary.
Output: positive sentiment word set, negative sentiment word set.
1: Let A donates the candidate word set, C donates the positive seed set, D donate
the negative seed set.
2: convert all Ai into word vectors.
3: build up C and D /*C and D are picked from A*/.
4: for all Ai do
5: use equation(1) to calculate the sim(Ai |C) and sim(Ai |D)
6: score(Ai ) = sim(Ai |C) − sim(Ai |D)
7: end for
8: for all Ai do
9: if Ai can match a rule of morpheme matching then
10: update score(Ai ) according to the rule.
11: else
12: utilize synonym expanding to expand synonyms and jump back to Line 9.
13: end if
14: end for

4 Experiments and Results

In this section, we firstly introduce the preparing of the experimental dataset,
and then we introduced a series of comparative experiments. The purpose of
these experiments is to evaluate whether the CSWP method has a desirable per-
formance in word-level Chinese sentiment analysis compared with two baseline
method.

4.1 Dataset
To validate the proposed method, 20000 online comments were extracted from
Star Data Platform2 , a text data supply platform. For the sake of convenience,
the collection of these comments is named as SDP dataset. The source of SDP
2
https://www.istarshine.com/index.php/Data/dataSurvey#platform.
10 J. Niu et al.

dataset including microblogs, news and post bar. Then, through summarizing
from the NTUSD Chinese sentiment words dictionary3 , three sentiment mor-
pheme sets were build up: a positive sentiment morpheme set, a negative senti-
ment morpheme set and a privative morpheme set. As for the synonym dictionary
utilized in CSWP, the HIT-CIR synonym dictionary4 was downloaded, this dic-
tionary was developed by HIT Center for Information Retrieval Lab. The sample
of sentiment morphemes are shown in Table 2.

Table 2. The sample of the Sentiment Morphemes

4.2 Experimental Results

In this subsection, the performance of the proposed CSWP system is evaluated

with SDP dataset. To illustrate the advantages of CSWP, we also implement
and evaluate an unsupervised baseline method [4] and a supervised method [2]
for comparison.
For illustrating the performance of the CSWP method. The 10-fold cross-
validation is performed to the three methods. In each time of experiments, 2000
comments of SDP dataset are randomly selected as the training data and the rest
are the testing data. The training dataset is used to train supervised baseline
method, and the testing dataset is used to evaluate the performance of three
methods. The final comparative results are divided into positive sentiment words
extracting results and negative sentiment words extracting results. The results
are shown in Figs. 2 and 3.

Fig. 2. Positive results Fig. 3. Negative results

3
http://www.datatang.com/data/44317.
4
http://www.ltp-cloud.com/download/.
 CSWP 11

As can be seen from Figs. 2 and 3, the CSWP achieves the best F1 value,
which is average 19.075% higher than unsupervised baseline and average 9.475%
higher than supervised baseline. Additionally, we can see through the comparison
of the first method and the CSWP that the synonym expanding step has average
improved the accuracy of CSWP by 5.53% and average improved the recall
ratio by 11.195%. It has brought significant improvement to the CSWP. The
reason of the improvement is that the step of synonym expanding can improve
the recognition ratio of the sentiment morpheme matching method. Therefore,
there are more wrong results can be corrected by this phase, and thereby the
performance of the CSWP is improved.

5 Conclusion
This paper proposed a novel Chinese Sentiment Words Polarity (CSWP) analyz-
ing method that exploits the word embedding method and the sentiment mor-
pheme matching method. Compared with the existing word embedding method,
the performance of the CSWP method has achieved the significant improvement
in analyzing the sentiment polarity of Chinese words. To illustrate the perfor-
mance of the CSWP, two baseline methods were implemented, and then the three
methods were evaluated on SDP dataset. The experimental results show that
the CSWP method leads to a desirable performance compared with the unsu-
pervised baseline method which only based on word embedding method, and it
also can be seen from results that the performance of the CSWP also better
than the supervised baseline method which based on maximum entropy model.
The advantages of the CSWP method are that it only needs little manpower in
preparing work, and it retains the advantages of flexibility and timeliness which
belong to unsupervised method, so it will be more competent than supervised
baseline method in different harsh work situation.

Acknowledgment. This work was supported by the National Natural Science Foun-
dation of China (61572060, U1536107, 61472024), and CERNET Innovation Project
(NGII20151104, NGII20160316).

References
1. Go, A., Bhayani, R., Huang, L.: Twitter sentiment classification using distant
supervision. CS224N Project Report, Stanford, 1(2009):12 (2009)
2. Fei, X., Wang, H., Zhu, J.: Sentiment word identification using the maximum
entropy model. In: 2010 International Conference on Natural Language Processing
and Knowledge Engineering (NLP-KE), pp. 1–4. IEEE (2010)
3. Turney, P.D.: Thumbs up or thumbs down?: semantic orientation applied to unsu-
pervised classification of reviews. In: Proceedings of the 40th Annual Meeting on
Association For Computational Linguistics, pp. 417–424. Association for Compu-
tational Linguistics (2002)
4. Fan, X., Li, X., Du, F., Li, X., Wei, M.: Apply word vectors for sentiment analysis
of app reviews. In: 2016 3rd International Conference on Systems and Informatics
(ICSAI), pp. 1062–1066. IEEE (2016)
12 J. Niu et al.

5. Pang, B., Lee, L., Vaithyanathan, S.: Thumbs up?: sentiment classification using
machine learning techniques. In: Proceedings of the ACL-2002 Conference on
Empirical Methods in Natural Language Processing, vol. 10, pp. 79–86. Associ-
ation for Computational Linguistics (2002)
6. Hatzivassiloglou, V., McKeown, K.R.: Predicting the semantic orientation of adjec-
tives. In: Proceedings of the Eighth Conference on European Chapter of the Asso-
ciation for Computational Linguistics, pp. 174–181. Association for Computational
Linguistics (1997)
7. Kanayama, H., Nasukawa, T.: Fully automatic lexicon expansion for domain-
oriented sentiment analysis. In: Proceedings of the 2006 Conference on Empirical
Methods in Natural Language Processing, pp. 355–363. Association for Computa-
tional Linguistics (2006)
8. Ku, L.-W., Liang, Y.-T., Chen, H.-H.: Opinion extraction, summarization and
tracking in news and blog corpora. In: Proceedings of AAAI, pp. 100–107 (2006)
9. Jansen, B.J., Zhang, M., Sobel, K., Chowdury, A.: Twitter power: Tweets as elec-
tronic word of mouth. J. Assoc. Inf. Sci. Technol. 60(11), 2169–2188 (2009)
10. Pak, A., Paroubek, P.: Twitter as a corpus for sentiment analysis and opinion
mining. In: LREc, vol. 10 (2010)
11. Kouloumpis, E., Wilson, T., Moore, J.D.: Twitter sentiment analysis: the good the
bad and the omg! Icwsm, 11(538-541), 164 (2011)
12. Huang, S., Han, W., Que, X., Wang, W.: Polarity identification of sentiment words
based on emoticons. In: 2013 9th International Conference on Computational Intel-
ligence and Security (CIS), pp. 134–138. IEEE (2013)
13. Gauch, S., Wang, J.: Corpus analysis for TREC 5 query expansion. In: TREC
(1996)
14. Wiebe, J.: Learning subjective adjectives from corpora. AAAI/IAAI 20 (2000)
15. Geng, H.T., Cai, Q.S., Kun, Y., Zhao, P.: A kind of automatic text keyphrase
extraction method based on word co-occurrence. J. Nanjing Univ. 42(2), 156–162
(2006)
 Collaborative and Green Resource
Allocation in 5G HetNet
with Renewable Energy

Yi Liu1,2(B) , Yue Gao3 , Shengli Xie1,2 , and Yan Zhang4

1
School of Automation, Guangdong University of Technology, Guangzhou, China
[email protected]
2
Guangdong Province Key Laboratory of IoT Information Technology,
Guangzhou, China
3
Queen Mary University of London, London, UK
[email protected]
4
University of Oslo, Oslo, Norway
[email protected]

Abstract. By deploying dense renewable-connected small-cells, hetero-

geneous networks (HetNets) are able to provide spectral and energy effi-
ciencies for 5G system. However, the small-cell base stations (BSs) may
suffer the intra-cell interferences and variabilities of renewable energy.
In this paper, we firstly introduce a collaborative architecture to deal
with intra-cell interferences and renewable uncertainty for different-tier
of users in HetNets. A stochastic optimization problem is formulated
to maximize the energy efficiency of collaborative HetNet. To solve the
problem, a centralized resources allocation algorithm is proposed based
on random variabilities of spectrum and renewable resources. Finally, the
extensive numerical results are provided to verify the effectiveness of the
proposed collaborative resources allocation method.

Keywords: Collaborative HetNet · Resource allocation

Renewable uncertainty

1 Introduction
Heterogeneous network (HetNet) is treated as a promising solution to support
tremendous number of diverse terminals and wireless services in 5G system. How-
ever, the dense deployment of small-cell BSs and terminals in HetNet will lead to
two important issues: spectrum efficiency and energy efficiency. To address these
two issues, some technologies have been intensively studied. Massive multiple-
input multiple-output (MIMO) technology have been proven to its potential of
significantly improving the spectral efficiency about 10–20 times in the same
frequency bandwidth [1]. Cognitive radio (CR) technology has been proposed to
effectively utilize the spectrum [2,3]. The CR users/devices are allowed to oppor-
tunistically operate in the frequency bands originally allocated to the primary
c ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2018
I. Romdhani et al. (Eds.): CollaborateCom 2017, LNICST 252, pp. 13–26, 2018.
https://doi.org/10.1007/978-3-030-00916-8_2
Other documents randomly have
different content
 feelings of jealousy toward the new route, because it
terminates in another city than Albany; a healthy rivalry
will do more than moral suasion, to wake up the old route
from that lethargy which seems so near akin to death.
Had the Hoosac Tunnel been completed twelve years ago,
we have reason to believe it probable that the people of
Massachusetts alone would have saved an amount in the
way of cheap transportation, nearly if not quite sufficient
to equal its cost."
"We have spoken more freely in this paper than might be
considered becoming in us, but for the fact that in the day
of its need, Albany, along with Massachusetts, came to the
aid of the Western Railroad. And now that we are
suffering so much from its insufficiency to meet the public
want, we trust the presentation of these views and facts
will not be regarded as obtrusive, but rather as properly
coming from those, who, with you, aided to produce a
common benefit, and are now suffering with you from a
common cause."
The cost of the whole work was estimated by the commissioners in
their first report, at $5,719,330, the estimate being based upon
ordinary labor at one dollar a day, and of materials at a
corresponding rate. Nothing has yet occurred to invalidate this
estimate, excepting the advance of the cost of material and labor, an
incidental misfortune common to every public, as well as private
enterprise, requiring labor and material, which has been prosecuted
during the last three years. It is certain that these high rates will
greatly decline, perhaps nearly to their former level within a year;
but admitting that the Commissioners' estimate should be swelled
through these incidental causes to the sum of eight millions, would
such an increase of expense justify the abandonment of this great
enterprise, upon which so much has already been expended, and at
the very period in its progress when the most formidable obstacles
in its way have been surmounted, and its success become a
certainty? Had the Western Eailroad been utterly destroyed last year
by a rebel raid, as were some Southern roads by the march of
Sherman, or by any conceivable cause, would the consideration of
twenty-five, or thirty, or even forty millions, prevent its being rebuilt
at once? Why then should two millions stand in the way of the
Tunnel line, which is now a greater necessity than the Western road
was at the time of its construction?
The time required to complete the work, without the aid of
machinery, was estimated by the Commissioners at eleven years and
four months; and with the aid of such machine drills and power as
had already been applied with success at Mt. Cenis, at seven years
and a half. The work at Mt. Cenis was commenced in 1857, and up
to July, 1861, 2142 feet had been excavated by hand labor; the
machine drills were then applied, and the Italian government has
recently announced that the work will be finished by the close of the
year 1870. It will be seven and a half miles long. The Hoosac Tunnel
will be about four and a half miles long, and at the present time it
has been excavated 4675 feet, and shafts have been sunk to the
depth of 575 feet. The machine drills will be applied in a few days;
but they are drills which will do twice, and possibly three times the
work of those at Mt. Cenis.
To the sound judgment, energy, and untiring perseverance of Mr.
Brooks, and the inventive genius and skill of Mr. Stephen F. Gates, of
Boston, and Mr. Charles Burleigh, of Fitchburg, belongs the credit of
perfecting a pneumatic drill, by means of which our great tunnel will
be completed much within the time named by the Commissioners,
and with a reduction of their estimate of its cost by hand labor of
several hundred thousand dollars. We have seen this drill operated
by compressed air, at the rate of two hundred blows a minute, each
blow given with a force of more than five hundred pounds, cut an
inch and a quarter hole in a block of Hoosac rock, thirty-eight inches
in thirteen minutes, without changing its points. Its superiority over
the Mt. Cenis drill consists in its lightness, automatic feed, and
smaller size. The Mt. Cenis drill is eight feet long, and weighs six
hundred pounds, and the whole machine moves forward in feeding.
The Hoosac drill is four feet long, weighs two hundred and eight
pounds, and can be handled by two men. In feeding, the drill alone
advances, and in such manner as to accommodate itself to any kind
of rock it may encounter, whether hard or soft. Its points are
sharpened in a die by half a dozen blows of the hammer. It will do
the work of twenty men; and, finally, sixteen of them can be applied
to a surface upon which only nine of the Mt. Cenis drills can be used.
The operation of this drill has already been witnessed by hundreds
of persons, among them machinists, engineers, and stone masons,
and not one of them entertains a doubt that it will do all which is
claimed for it by the inventors. But the carriages are nearly ready,
and these little machines will shortly be put to their work. The
friends of the Tunnel have no fears of the result.

Massachusetts has always led her sister States. At the call to arms,
her sons have been first in the field, and first to die for the common
good. Her schools and colleges, her institutions of charity, and her
statutes have furnished models for the new states of the great West,
and for foreign republics. In her manufactures and mechanic arts, in
the products of her inventive genius, in maritime enterprise, in the
building of canals and railroads, and in every undertaking to develop
the resources and promote the prosperity of the country, she has
been first and foremost. With so proud a record, and with almost
exhaustless means at her command, we do not believe our noble
state is yet ready to abandon the lead; nor that the consideration of
a few millions of dollars will prevent her from breaking down the
barrier which divides us from the West, and by which the great
stream of Western traffic has been so long checked and diverted.
Rather let us trust that, by wise legislation, a liberal policy, and a
cordial support of the gentlemen to whom the conduct of this
enterprise is entrusted, the great work of De Witt Clinton will be
perfected, and the noble design of Loammi Baldwin executed, by the
completion of the Hoosac Tunnel, before it shall be announced from
Sardinia that the Alps are pierced and France and Italy have joined
hands under the Grand Vallon.

Transcriber's Note
The cover image was made from an image provided on The Internet Archive and is
placed in the public domain.
 *** END OF THE PROJECT GUTENBERG EBOOK FACTS AND
FIGURES CONCERNING THE HOOSAC TUNNEL ***

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.
Welcome to our website – the ideal destination for book lovers and
knowledge seekers. With a mission to inspire endlessly, we offer a
vast collection of books, ranging from classic literary works to
specialized publications, self-development books, and children's
literature. Each book is a new journey of discovery, expanding
knowledge and enriching the soul of the reade

Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.

Let us accompany you on the journey of exploring knowledge and

personal growth!

textbookfull.com