Computational Intelligence and

Intelligent Systems Kangshun Li

Visit to download the full and correct content document:
https://textbookfull.com/product/computational-intelligence-and-intelligent-systems-ka
ngshun-li/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Computational Intelligence and Intelligent Systems 7th

International Symposium ISICA 2015 Guangzhou China
November 21 22 2015 Revised Selected Papers 1st Edition
Kangshun Li
https://textbookfull.com/product/computational-intelligence-and-
intelligent-systems-7th-international-symposium-
isica-2015-guangzhou-china-november-21-22-2015-revised-selected-
papers-1st-edition-kangshun-li/

Computational Intelligence and Intelligent Systems 9th

International Symposium ISICA 2017 Guangzhou China
November 18 19 2017 Revised Selected Papers Part II
Kangshun Li
https://textbookfull.com/product/computational-intelligence-and-
intelligent-systems-9th-international-symposium-
isica-2017-guangzhou-china-november-18-19-2017-revised-selected-
papers-part-ii-kangshun-li/

Computational Intelligence and Sustainable Systems

Intelligence and Sustainable Computing H. Anandakumar

https://textbookfull.com/product/computational-intelligence-and-
sustainable-systems-intelligence-and-sustainable-computing-h-
anandakumar/

Computational and Statistical Methods in Intelligent

Systems Radek Silhavy

https://textbookfull.com/product/computational-and-statistical-
methods-in-intelligent-systems-radek-silhavy/
Artificial Intelligence and Algorithms in Intelligent
Systems Radek Silhavy

https://textbookfull.com/product/artificial-intelligence-and-
algorithms-in-intelligent-systems-radek-silhavy/

Computational Intelligence and Intelligent Systems 10th

International Symposium ISICA 2018 Jiujiang China
October 13 14 2018 Revised Selected Papers Hu Peng

https://textbookfull.com/product/computational-intelligence-and-
intelligent-systems-10th-international-symposium-
isica-2018-jiujiang-china-october-13-14-2018-revised-selected-
papers-hu-peng/

Computational Intelligence Cyber Security and

Computational Models Models and Techniques for
Intelligent Systems and Automation Third International
Conference ICC3 2017 Coimbatore India December 14 16
2017 Proceedings Geetha Ganapathi
https://textbookfull.com/product/computational-intelligence-
cyber-security-and-computational-models-models-and-techniques-
for-intelligent-systems-and-automation-third-international-
conference-icc3-2017-coimbatore-india-december-14-16/

Computational Intelligence Cyber Security and

Computational Models Models and Techniques for
Intelligent Systems and Automation 4th International
Conference ICC3 2019 Coimbatore India December 19 21
2019 Revised Selected Papers Suresh Balusamy
https://textbookfull.com/product/computational-intelligence-
cyber-security-and-computational-models-models-and-techniques-
for-intelligent-systems-and-automation-4th-international-
conference-icc3-2019-coimbatore-india-december-19-21-2/

Computational Statistics and Mathematical Modeling

Methods in Intelligent Systems Proceedings of 3rd
Computational Methods in Systems and Software 2019 Vol
2 Radek Silhavy
https://textbookfull.com/product/computational-statistics-and-
mathematical-modeling-methods-in-intelligent-systems-proceedings-
of-3rd-computational-methods-in-systems-and-
Kangshun Li
Wei Li
Zhangxing Chen
Yong Liu (Eds.)

Communications in Computer and Information Science 873

Computational Intelligence
and Intelligent Systems
9th International Symposium, ISICA 2017
Guangzhou, China, November 18–19, 2017
Revised Selected Papers, Part I

123
Communications
in Computer and Information Science 873
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
Kangshun Li Wei Li
•

Zhangxing Chen Yong Liu (Eds.)

•

Computational Intelligence
and Intelligent Systems
9th International Symposium, ISICA 2017
Guangzhou, China, November 18–19, 2017
Revised Selected Papers, Part I

123
Editors
Kangshun Li Zhangxing Chen
College of Mathematics and Informatics Chemical and Petroleum Engineering
South China Agricultural University University of Calgary
Guangzhou Calgary, AB
China Canada
Wei Li Yong Liu
Jiangxi University of Science School of Computer Science
and Technology and Engineering
Ganzhou, Jiangxi The University of Aizu
China Aizu-Wakamatsu, Fukushima
Japan

ISSN 1865-0929 ISSN 1865-0937 (electronic)

Communications in Computer and Information Science
ISBN 978-981-13-1647-0 ISBN 978-981-13-1648-7 (eBook)
https://doi.org/10.1007/978-981-13-1648-7

Library of Congress Control Number: 2018948807

© 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

Volumes CCIS 873 and CCIS 874 comprise proceedings of the 9th International
Symposium on Intelligence Computation and Applications (ISICA 2017) held in
Guangzhou, China, during November 18–19, 2017. ISICA 2017 successfully attracted
over 180 submissions. After rigorous reviews and plagiarism checking, 51 high-quality
papers are included in CCIS 873, while another 50 papers are collected in CCIS 874.
ISICA conferences are one of the first series of international conferences on compu-
tational intelligence that combines elements of learning, adaptation, evolution, and
fuzzy logic to create programs as alternative solutions to artificial intelligence.
ISICA 2017 featured the most up-to-date research in analysis and theory of evo-
lutionary computation, neural network architectures and learning, neuro-dynamics and
neuro-engineering, fuzzy logic and control, collective intelligence and hybrid systems,
deep learning, knowledge discovery, learning, and reasoning. ISICA 2017 provided a
venue to foster technical exchanges, renew everlasting friendships, and establish new
connections. Prof. Yuanxiang Li, one of the pioneers in parallel and evolution com-
puting at Wuhan University, wrote a beautiful poem in Chinese for the ISICA 2017
event. It is our pleasure to translate his poem with the title of “Computational Intel-
ligence Debate on the Pearl River”:
Wear a smile on a bright face;
Under the night light on the Pearl River;
You are like star and moon shining on the Tower Small Slim Waist;
Ride waves on the cruise ship;
Leave bridges behind in a boundless moment.

You are from far away;

A journey of thousand miles;
Meet in the Guangzhou City;
Brighten up the field of intelligent evolution;
Explore the endless road to intelligence.
Prof. Li’s poem points out one of ISICA’s missions of pursuing the truth that a
complex system inherits the simple mechanism of evolution, while simple models may
lead to the evolution of complex morphologies. Following the success of the past eight
ISICA events, ISICA 2017 continued to explore the new problems emerging in the
fields of computational intelligence.
On behalf of the Organizing Committee, we would like to thank warmly the
sponsors, South China Agricultural University, who helped in one way or another to
achieve our goals for the conference. We wish to express our appreciation to Springer
for publishing the proceedings of ISICA 2017. We also wish to acknowledge the
VI Preface

dedication and commitment of both the staff at the Springer Beijing Office and the
CCIS editorial staff. We would like to thank the authors for submitting their work, as
well as the Program Committee members and reviewers for their enthusiasm, time, and
expertise. The invaluable help of active members from the Organizing Committee,
including Wei Li, Hui Wang, Lei Yang, Yan Chen, Lixia Zhang, Weiguang Chen,
Zhuozhi Liang, Junlin Jin, Ying Feng, and Yunru Lu, in setting up and maintaining the
online submission systems by EasyChair, assigning the papers to the reviewers, and
preparing the camera-ready version of the proceedings is highly appreciated. We would
like to thank them personally for helping to make ISICA 2017 a success.

March 2018 Kangshun Li

Yong Liu
Wei Li
Zhangxing Chen
 Organization

Honorary Chairs
Hisao Ishibuchi Osaka Prefecture University, Japan
Qingfu Zhang City University of Hong Kong, SAR China
Yang Xiang Deakin University, Australia

General Chairs
Kangshun Li South China Agricultural University, China
Zhangxing Chen University of Calgary, Canada
Yong Liu University of Aizu, Japan

Program Chairs
Aniello Castiglione University of Salerno, Italy
Jing Liu Xidian University, China
Han Huang South China University of Technology, China
Hailin Liu Guangdong University of Technology, China

Local Arrangements Chairs

Wei Li South China Agricultural University, China
Yan Chen South China Agricultural University, China

Publicity Chairs
Lei Yang South China Agricultural University, China
Lixia Zhang South China Agricultural University, China

Program Committee
Aimin Zhou East China Normal University, China
Allan Rocha University of Calgary, Canada
Dazhi Jiang Shantou University, China
Dongbo Zhang Guangdong University of Science and Technology,
China
Ehsan Aliabadian University of Calgary, Canada
Ehsan Amirian University of Calgary, Canada
Feng Wang Wuhan University, China
Guangming Lin Southern University of Science and Technology, China
Guoliang He Wuhan University, China
VIII Organization

Hailin Liu Guangdong University of Technology, China

Hu Peng Jiujiang University, China
Hui Wang Nanchang Institute of Technology, China
Iyogun Christopher University of Calgary, Canada
Jiahai Wang Sun Yet-Sen University, China
Jing Wang Jiangxi University of Finance and Economics, China
Jun He Aberystwyth University, UK
Jun Zou The Chinese University of Hong Kong, SAR China
Kangshun Li South China Agricultural University, China
Ke Tang Southern University of Science and Technology, China
Kejun Zhang Zhejiang University, China
Lingling Wang Wuhan University, China
Lixin Ding Wuhan University, China
Lu Xiong South China Agricultural University, China
Maoguo Gong Xidian University, China
Mohammad Zeidani University of Calgary, Canada
Rafael Almeida University of Calgary, Canada
Sanyou Zeng China University of Geosciences, China
Shenwen Wang Shijiazhuang University of Economics, China
Wayne Li University of Calgary, Canada
Wei Li South China Agricultural University, China
Wensheng Zhang Chinese Academy of Sciences, China
Xiangjing Lai University of Angers, France
Xin Du Fujian Normal University, China
Xinyu Zhou Jiangxi Normal University, China
Xuesong Yan China University of Geosciences, China
Xuewen Xia East China Jiaotong University, China
Ying Huang Gannan Normal University, China
Yong Liu The University of Aizu, Japan
Zahra Sahaf University of Calgary, Canada
Zhangxing Chen University of Calgary, Canada
Zhun Fan Shantou University, China
 Contents – Part I

Neural Networks and Statistical Learning – Neural

Architecture Search

A New Recurrent Neural Network with Fewer Neurons for Quadratic

Programming Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Sanfeng Chen, Xin Han, Fei Tang, and Guangming Lin

Mutual-Information-SMOTE: A Cost-Free Learning Method

for Imbalanced Data Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
Ying Chen, Yufei Chen, Xianhui Liu, and Weidong Zhao

Ontology Sparse Vector Learning Algorithm . . . . . . . . . . . . . . . . . . . . . . . 31

Xin Xin Huang and Shu Gong

Bacterial Foraging Algorithm Based on Reinforcement Learning

for Continuous Optimizations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
Huiyan Jiang, Wanpeng Dong, Lianbo Ma, and Rui Wang

A Novel Attribute Reduction Approach Based on Improved

Attribute Significance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
Jun Ye and Lei Wang

Neural Networks and Statistical Learning – Transfer of Knowledge

Traffic Condition Assessment Based on Support Vectors Machine

Using Intelligent Transportation System Data . . . . . . . . . . . . . . . . . . . . . . . 69
Deng Lei and Weihua Zhong

Bidirectional Negative Correlation Learning . . . . . . . . . . . . . . . . . . . . . . . . 84

Yong Liu

Reflectance Estimation Based on Locally Weighted Linear

Regression Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
Dejun Lu, Weifeng Zhang, Kaixuan Cuan, and Pengfei Liu

A Multi-task Learning Approach for Mandarin-English Code-Switching

Conversational Speech Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102
Xiao Song, Yi Liu, Daming Yang, and Yuexian Zou

Feature Selection of Network Flow Based on Machine Learning . . . . . . . . . . 112

Taian Xu
X Contents – Part I

Evolutionary Multi-objective and Dynamic Optimization

– Optimal Control and Design

Multi-objective Optimal Scheduling of Valves and Hydrants for Sudden

Drinking Water Pollution Incident . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
Chengyu Hu, Lu Zou, Xuesong Yan, and Wenyin Gong

A Novel Mutation and Crossover Operator for Multi-objective

Differential Evolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 138
Qingxia Li and Wenhong Wei

Multi-objective Gene Expression Programming Based Automatic

Clustering Method. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 148
Ruochen Liu, Jianxia Li, and Manman He

Multi-objective Firefly Algorithm Guided by Elite Particle . . . . . . . . . . . . . . 159

Jiayuan Wang, Li Lv, Zhifeng Xie, Xi Zhang, Hui Wang, and Jia Zhao

Improving Energy Demand Estimation Using an Adaptive Firefly

Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 171
Hui Wang, Zhangxin Chen, Wenjun Wang, Zhijian Wu, Keliu Wu,
and Wei Li

Evolutionary Multi-objective and Dynamic Optimization

– Hybrid Methods

Firefly Algorithm with Elite Attraction . . . . . . . . . . . . . . . . . . . . . . . . . . . 185

Jing Wang

A Hybrid Fireworks Explosion Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 195

Liping Wang, Renwen Chen, and Chengwang Xie

An Improved Multi-objective Fireworks Algorithm . . . . . . . . . . . . . . . . . . . 204

Dongming Zhan and Chengwang Xie

Evolutionary Design of a Crooked-Wire Antenna . . . . . . . . . . . . . . . . . . . . 219

Lumin Ye, Bin Lan, Yi Yuan, Jianqing Sun, Yongzhi Sun,
and Sanyou Zeng

Typical Constrained Optimization Formulation in Evolutionary

Computation Not Suitable for Expensive Optimization. . . . . . . . . . . . . . . . . 232
Sanyou Zeng, Ruwang Jiao, Changhe Li, Bin Lan, Huanhuan Li,
Jianqing Sun, and Yongzhi Sun
 Contents – Part I XI

Data Mining – Association Rule Learning

Maize Gene Regulatory Relationship Mining Using Association Rule . . . . . . 249

Jianxiao Liu, Chaoyang Wang, Haijun Liu, Yingjie Xiao, Songlin Hao,
Xiaolong Zhang, Jianchao Sun, and Huan Yu

Database Reengineering Scheme from Object-Oriented Model

to Flattened XML Data Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
Yue Liu and Xukun Wu

A Modified Shuffled Frog Leaping Algorithm for Constructing

DNA Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 269
Zhenghui Liu, Bin Wang, Changjun Zhou, Xiaopeng Wei,
and Qiang Zhang

Clustering Based Prediction of Financial Data by ARMA Model . . . . . . . . . 279

Duobiao Ning, Siyu Zhang, Wenfei Chen, and Xinqiao Yu

Research on Data Mining Algorithm of Association Rules Based

on Hadoop . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 288
Linrun Qiu

Data Mining – Data Management Platforms

Data-Driven Phone Selection for Language Identification

via Bidirectional Long Short-Term Memory Modeling . . . . . . . . . . . . . . . . . 301
Xiao Song, Qiang Cheng, Jingping Xing, and Yuexian Zou

Multi-document Summarization via LDA and Density Peaks Based

Sentence-Level Clustering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 313
Baoyan Wang, Yuexian Zou, Jian Zhang, Jun Jiang, and Yi Liu

The Dynamic Relationship Between Bank Credit and Real Estate Price
in China. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 324
Xiaofan Wang and Li Zhou

Big-Data Cloud Services Platform for Growth Enterprises with Adaptive

Exception Handling and Parallelized Data Mining . . . . . . . . . . . . . . . . . . . . 339
Yazhi Wen, Hu Bo, and Bin Wen

Research on Automatic Generation of Test Cases Based

on Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 351
Lu Xiong and Kangshun Li

A Routing Acceleration Strategy via Named Data Networking

in Space-Terrestrial Integrated Networks . . . . . . . . . . . . . . . . . . . . . . . . . . 361
Feng Yang and Di Liu
XII Contents – Part I

Cloud Computing and Multiagent Systems – Service Models

Exploring Migration Issue Based on Multi-agent Modeling . . . . . . . . . . . . . 373

Pengfei Liu, Xiaxu He, Weifeng Zhang, and Enkai Chen

Application of Plant-Derived Anti Repellents in Prevention and Cure

of Parasaissetia Nigra Nietner . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383
Lihe Zhang, Bin Du, Baoli Qiu, and Hui Wang

Research on Resource Trust Access Control Based on Cloud

Computing Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 394
Jun Nie and Dongbo Zhang

A Statistical Study of Technological Innovation Factors in Beijing’s

Low-Carbon Economic Growth. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 405
Xiaofan Wang and Li Zhou

Cloud Computing and Multiagent Systems – Cloud Engineering

Study on Critical Lines Identification in Complex Power Grids. . . . . . . . . . . 423

Yi Wang, Zhiping Tan, and Yanli Zou

A Review of Multi-sensor Data Fusion for Traffic. . . . . . . . . . . . . . . . . . . . 432

Xue Zhao and Dongbo Zhang

Research on Evaluation Method of Service Quality . . . . . . . . . . . . . . . . . . . 445

Yan Zhao, Xiaxia Niu, and Li Zhou

Research on Traffic Data Fusion Based on Multi Detector . . . . . . . . . . . . . . 456

Suping Liu

A Recommend Method of Hotspots Knowledge Based on Big Data

from Evolving Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 468
Yi Zhao, Zhao Li, and Jun Wu

Everywhere Connectivity – IoT Solutions

Improved Location Algorithm Based on DV-Hop for Indoor Internet

of Things . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 483
Qian Cai

A Design of the Shared Farmland System Based on the Internet

of Things Technology and IMS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 492
Na Chang and Junhua Ku

Personalized Recommendation Algorithm Based on Commodity Label . . . . . 499

Yuehua Dong and Xuelei Liang
 Contents – Part I XIII

Mobile Node Localization Based on Angle Self-adjustment with Mine

Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 513
Wangsheng Fang, Hui Wang, and Zhongdong Hu

Research on the Development Strategy of O2O e-Commerce in Traditional

Retail Enterprises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
Sisi Li and Suping Liu

Implementation of Academic News Recommendation System Based

on User Profile and Message Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . 531
Weiling Li, Yong Tang, Guohua Chen, Danyang Xiao,
and Chengzhe Yuan

Everywhere Connectivity – Wireless Sensor Networks

An Optimal Sink Placement for High Coverage and Low Deployment

Cost in Mobile Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . 543
Qingzhong Liang and Yuanyuan Fan

Wireless Sensor Network Time Synchronization Algorithm Overview . . . . . . 552

Chunqiang Liu, Haijie Pang, Ning Cao, Xinze Li, and Dongchen Xu

Collaborative Filtering Recommendation Considering Seed Life Cycle

for BT Download Websites . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 562
Yue Liu, Fei Cai, Qi Sun, and Yiming Zhu

Centralized Access Control Scheme Based on OAuth for Social Networks . . . 576
Yue Liu, Wei Gao, and Jingyun Liao

Research on Localization Scheme of Wireless Sensor Networks Based

on TDOA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 588
Xuefeng Yang, Junqi Ma, and Yuting Lu

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 601

 Contents – Part II

Swarm Intelligence – Cooperative Search

Differential Opposition-Based Particle Swarm . . . . . . . . . . . . . . . . . . . . . . . 3

Lanlan Kang, Wenyong Dong, Shanni Li, and Jianxin Li

Research on Hierarchical Cooperative Algorithm Based on Genetic

Algorithm and Particle Swarm Optimization . . . . . . . . . . . . . . . . . . . . . . . . 16
Linrun Qiu

An Adaptive Particle Swarm Optimization Using Hybrid Strategy . . . . . . . . . 26

Peng Shao, Zhijian Wu, Hu Peng, Yinglong Wang, and Guangquan Li

ITÖ Algorithm with Cooperative Coevolution for Large Scale

Global Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
Yufeng Wang, Wenyong Dong, and Xueshi Dong

A Conical Area Differential Evolution with Dual Populations

for Constrained Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52
Bin Wu, Weiqin Ying, Yu Wu, Yuehong Xie, and Zhenyu Wang

Swarm Intelligence – Swarm Optimization

A Particle Swarm Clustering Algorithm Based on Tree Structure

and Neighborhood. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
Lei Yang, Wensheng Zhang, Zhicheng Lai, and Ziyu Cheng

Optimization of UWB Antenna Based on Particle Swarm

Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
Mingyuan Yu, Jing Liang, Boyang Qu, and Caitong Yue

A Divisive Multi-level Differential Evolution . . . . . . . . . . . . . . . . . . . . . . . 98

Huifang Zhang, Wei Huang, and Jinsong Wang

Complex Systems Modeling – System Dynamic

A Comparative Summary of the Latest Version of MapReduce Parallel

and Old Version from the Perspective of Framework . . . . . . . . . . . . . . . . . . 113
Xinze Li and Qi Liu

A Third-Order Meminductor Chaos Circuit with Complicated Dynamics . . . . 125

Zhiping Tan and Shanni Li
XVI Contents – Part II

Mathematical Model of Cellular Automata in Urban Taxi

Network – Take GanZhou as an Example . . . . . . . . . . . . . . . . . . . . . . . . . 133
Zhaosheng Wang and Shiyu Li

Hybrid Colliding Bodies Optimization for Solving Emergency Materials

Transshipment Model with Time Window . . . . . . . . . . . . . . . . . . . . . . . . . 142
Xiaopeng Wu, Yongquan Zhou, and Qifang Luo

A Dual Internal Point Filter Algorithm Based on Orthogonal Design . . . . . . . 152

Yijin Yang, Tianyu Huo, Bin Lan, and Sanyou Zeng

Complex Systems Modeling – Multimedia Simulation

A Beam Search Approach Based on Action Space for the 2D Rectangular

Packing Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165
Aihua Yin, Lei Wang, Dongping Hu, Hao Rao, and Song Deng

On the Innovation of Multimedia Technology to the Management Model

of College Students . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
Yuanbing Wang

Convenient Top-k Location-Text Publish/Subscribe Scheme . . . . . . . . . . . . . 183

Hong Zhu, Hongbo Li, Zongmin Cui, Zhongsheng Cao, and Meiyi Xie

Effects of Foliar Selenium Fertilizer on Agronomical Traits and Selenium,

Cadmium Contents of Different Rape Varieties. . . . . . . . . . . . . . . . . . . . . . 192
Bin Du, HuoYun Chen, and DanYing Xing

Fresh-Water Fish Quality Traceability System Based on NFC Technology . . . 204

Longqing Zhang, Lei Yang, Liping Bai, Yanghong Zhang,
and Kaiming You

Intelligent Information Systems – Information Retrieval

An Information Filtering Model Based on Neural Network. . . . . . . . . . . . . . 217

Rongrong Li

The Theory of Basic and Applied Research in Information Retrieval

Sorting Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
Xinze Li, Jiying Yang, and Qi Liu

Summary of Research on Distribution Centers . . . . . . . . . . . . . . . . . . . . . . 238

Zeping Li and Huwei Liu

Factorization of Odd Integers as Lattice Search Procedure . . . . . . . . . . . . . . 251

Xingbo Wang
 Contents – Part II XVII

Research on Key Technology of Distributed Indexing and Retrieval

System Based on Lucene . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 259
Rongrong Li

Intelligent Information Systems – E-commerce Platforms

Research on the Integrated Development Model of e-Commerce

Channel and Physical Retail Channel. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 273
Sisi Li

Study on Potency of Controlling on Crematogaster Rogenhoferi

to Parasaissetia Nigra Nietner . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 280
Lihe Zhang, Bin Du, Baoli Qiu, and Hui Wang

Research on the Management and Optimization of Warehouse

Location in e-Commerce Enterprises . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 290
Huwei Liu and Zeping Li

A New SOC Estimation Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303

Weihua Zhong, Fahui Gu, and Wenxiang Wang

Analysis on Current Situation of E-Commerce Platform

for the Development from C2M Model to C2B Model. . . . . . . . . . . . . . . . . 312
Bo Yang

On the Artistic Characteristics of Computer Aided Design

in Fashion Design . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
Ping Wang

Artificial Intelligence and Robotics – Query Optimization

Rock-Paper-Scissors Game Based on Two-Domain DNA

Strand Displacement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 331
Wendan Xie, Changjun Zhou, Xianwen Fang, Zhixiang Yin,
and Qiang Zhang

A Business Resource Scheduled Algorithm of TD-LTE Trunking

System Based on QoS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 341
Qiutong Li, Yuechen Yang, and Baocai Zhong

Assumption Queries Processing of Probabilistic Relational Databases . . . . . . 354

Caicai Zhang, Zongmin Cui, and Hairong Yu

Design and Implementation of Self-balancing Robot Based on STM32 . . . . . 365

Ling Peng and Chunhui Zhou
XVIII Contents – Part II

The Design and Implementation of a Route Skyline Query System

Based on Weighted Voronoi Diagrams . . . . . . . . . . . . . . . . . . . . . . . . . . . 376
Jiping Zheng, Yiwei Ding, Shunqing Jiang, and Zhongling He

Improved RFID Anti-collision Algorithm Based on Quad-Tree . . . . . . . . . . . 390

Hui Guan, Zhaobin Liu, and Yan Zhang

Artificial Intelligence and Robotics – Intelligent Engineering

Discussion on the Important Role of Computer-Aided Intelligent

Manufacturing in the Transition of Garment Industry
to Softening Production . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 403
Ping Wang

A Study of Miniaturized Wide-Band Antenna Design . . . . . . . . . . . . . . . . . 413

Rui Zhang, Jianqing Sun, Yongzhi Sun, Bin Lan, and Sanyou Zeng

Yagi-Uda Antenna Design Using Differential Evolution . . . . . . . . . . . . . . . . 427

Hai Zhang, Hui Wang, and Cong Wang

Research on Coordination Fresh Product Supply Chain Under

New Retailing Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 439
Bo Yang and Dongbo Zhang

Virtualization – Motion-Based Tracking

Real-Time RGBD Object Tracking via Collaborative Appearance

and Motion Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 449
Danxian Chen, Zhanming Liu, Hefeng Wu, and Jin Zhan

Lip Password-Based Speaker Verification Without a Priori Knowledge

of Speech Language . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 461
Yiu-ming Cheung and Yichao Zhou

Human Motion Model Construction Based on Gene

Expression Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 473
Wei He, Shaoyang Hu, Shanni Li, Junlin Jin, and Kangshun Li

Research of Crowed Abnormal Behavior Detection Technology Based

on Trajectory Gradient . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 486
Kangshun Li, Hongtao Huang, Zebiao Zheng, and Yusheng Lu

A Novel Monitor Image De-hazing for Heavy Haze on the Freeway . . . . . . . 501
Chunyu Xu, Yufeng Wang, and Wenyong Dong

Real-Time Tracking with Multi-center Kernel Correlation Filter . . . . . . . . . . 512

Taoe Wu, Zhiqiang Zhao, Zongmin Cui, Anyuan Deng, and Xiao Yang
 Contents – Part II XIX

Virtualization – Image Recognition

The Reorganization of Handwritten Figures Based on Convolutional

Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 525
Xingzhen Tao, Wenxiang Wang, and Lei Lu

Comparison of Machine Learning Algorithms for Handwritten

Digit Recognition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 532
Shixiao Wu, Wanyun Wei, and Libing Zhang

A User Identification Algorithm for High-Speed Rail Network Based

on Switching Link. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543
Wenxiang Wang and Xingzhen Tao

A New Language Evolution Model for Chinese Spatial Preposition . . . . . . . . 551

Qi Rao and Youjie Zheng

Research on Location Technology Based on Mobile Reference Nodes . . . . . . 561

Xuefeng Yang, Lin Li, and Yue Liu

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 571

 Neural Networks and Statistical
Learning – Neural Architecture Search
 A New Recurrent Neural Network with Fewer
Neurons for Quadratic Programming
Problems

Sanfeng Chen1, Xin Han1,2, Fei Tang1, and Guangming Lin1(&)

1
Shenzhen Institute of Information Technology,
Shenzhen 518029, Guangdong, China
Linggm@sziit.edu.cn
2
School of Mechanical and Electrical Engineering,
Jiangxi University of Science and Technology, Ganzhou 341000, Jiangxi, China

Abstract. A new recurrent neural network is presented to solve a general

quadratic programming problem in real time. In contrast with the available
neural networks, the new neural network is with fewer neurons for solving
quadratic programming problems. The global convergence of the model is
proven with contraction analysis. The discrete time model and an alternative
model for solving the problem under irredundant equality constraints are also
studied. Simulation results demonstrate that the proposed recurrent neural net-
works are effective.

Keywords: Recurrent neural network
Quadratic programming

Contraction analysis
Global convergence

1 Introduction

There are a lot of studies of recurrent neural networks focusing on the filed of signal
processing [1, 2], pattern classification [3, 4], robotics [5, 6], optimization [7], and so on.
Especially, with the invention of the Hopfield [8], it was specially invented for solving
online optimization. Recurrent neural networks are becoming a popular research branch
in the field of online optimization. They are with powerful parallelism and online
solving capability. Recurrent neural networks have made huge advances for online
optimization in both theory and application. A recurrent neural network [9] is developed
for nonlinear programming problems, where a penalty term is introduced as equality and
inequality constraints, and it converges to an approximate optimal solution. A switched-
capacitor neural network is proposed [10] for solving nonlinear convex programming
problems. However, the model will be unstable in the case that the optimal solution is
outside the feasible region. A neural network is proposed for solving linear quadratic
programming problems [11]. The optimal solution is proven globally converged. Some
slack variables is introduced to the problem, which leads the dimension of model is too
large. A dual neural network is proposed for reducing the dimension. It is composed of a
single layer of neurons,and the dimension of the dual network is equal to its neurons.
The model and its modifications [13, 14] are introduced to kinematic control of

© Springer Nature Singapore Pte Ltd. 2018

K. Li et al. (Eds.): ISICA 2017, CCIS 873, pp. 3–16, 2018.
https://doi.org/10.1007/978-981-13-1648-7_1
4 S. Chen et al.

robot [12, 15]. A simplified dual neural network is proposed [16]. It much reduces
complexity while the convergence property is sound. The model is applied to the
KWTA problem in real time [17], which is just a single neuron. However, it just deals
with quadratic programming problem with a square quadratic term in box constraints
and cost function. A recurrent neural network for solving general quadratic program-
ming problems is proposed. It is with fewer neurons, and the dimension of the model is
greatly reduced while keeping sound accuracy and efficiency.
The remainder of this paper is organized as follows. In Sect. 2, A neural network
model is presented for solving quadratic programming problems. In Sect. 3, the con-
vergence of the neural network is analyzed and it is proven to be globally convergent to
the optimal solution of the quadratic programming problems. A discrete-time model in
Sect. 4 for solving the same problem and an alternative neural network model for
solving the quadratic programming problem under irredundant equality constraints are
studied. In Sect. 5, numerical examples are given to demonstrate the effectiveness of
our method. Section 6 is the conclusion.
In this paper, R denotes the real number field, AT represents the transport matrix of
A, I denotes a unitary matrix.

2 Mathematical Model

The general quadratic programming problem as following is studied:

1
minð xT Wx þ cT xÞ
2
Ax ¼ b ð1Þ
s:t:
Ex  e

Where W 2 Rnn , x 2 Rn denotes a positive definite matrix, c 2 Rn , A 2 Rmn ,

b 2 Rm , e 2 Rq and E 2 Rqn . The equality constraint Ax ¼ b is transformed to two
inequalities equivalently: Ax   b and Ax  b. The Eq. (1) is transferred as a
quadratic programming problem subject to inequality constraints. It is as following:

1
minð xT Wx þ cT xÞ
2 ð2Þ
1
s:t: Bx  d
2
2 3 2 3
A b
6 7 6 7
B ¼ 4 A 5; d ¼ 4 b 5 ð3Þ
E e
 A New Recurrent Neural Network with Fewer Neurons 5

Where B 2 Rpn , d 2 Rp and p ¼ 2  m þ q. The inequality constraint of (2) is

transformed as maxðBx  dÞ  0. The maxðxÞ denotes the largest element of vector x.
The problem (1) is equivalent to the Eq. (4):

1
minð xT Wx þ cT xÞ
2 ð4Þ
s:t: BTr x  dr  0

In the Eq. (4), r denotes the row No. of the biggest element of Bx  d, and BTr
represents the rth row of B, dr denotes the rth element of d. According to the KKT
terms, the solution of problem (4) meets the requirements:

Wx þ c  lBr ¼ 0
(
BTr x  dr ¼ 0 if l  0
ð5Þ
BTr x  dr  0 if l ¼ 0

The dual variable of inequality constraint in the Eq. (4) is represented with l 2 R.
The Eq. (5) is simplified with an upper saturation function as following:

Wx þ c  lBr ¼ 0
ð6Þ
BTr x  dr ¼ gðBTr x  dr  lÞ

Where the upper saturation function gð:Þ is as following:


0 x[0
gð:Þ ¼ ð7Þ
x x0

The W is positive definite, x could be explicitly solved with l and the first equality
in Eq. (6) as following:

x ¼ lW 1 Br  W 1 c ð8Þ

A dynamic neuron is used to solve l in Eq. (6) as following:

2 l_ ¼ gðBTr x  dr  lÞ  BTr x þ dr ð9Þ

Where 2 [ 0 is a scaling parameter. Substituting (8) into (9) generates the neural
network dynamics with the following state equation and output equation,
State equation:

2 l_ ¼ gðl þ BTr W 1 Br l  BTr W 1 c  dr Þ  BTr W 1 Br l þ BTr W 1 c þ dr ð10Þ

6 S. Chen et al.

Output equation:

x ¼ lW 1 Br  W 1 c ð11Þ

Where r is the row No. of maxðBx  dÞ, d and B and are as Eq. (3).
Remark 2.1: Only one dynamic neuron is required in the neural network (10), which
is nothing to do with the conditions of Eq. (1). There are at least q dynamic neurons in
recurrent neural networks for solving a general quadratic programming problem in [13–
16, 18]. It is the No. of inequalities of problem (1). However, the proposed model is
just a single dynamic neuron, which greatly reduces the number of neurons and
computational complexity.
Remark 2.2: The neural network dynamic modeled by (10) is a switched dynamic
system. It switches in a family of dynamic systems under the endogenous switching
signal r (signal flow in the neural network is plotted in Fig. 1)

2 l_ ¼ fr ðlÞ; r 2 S ¼ f1; 2. . .; pg
ð12Þ
r:l!S

Where fr ðlÞ ¼ gðBTr x  dr  lÞ  BTr x þ dr

Fig. 1. Signal flow of the simplified neural network.

Remark 2.3: The proposed model is liable to be implemented with hardware. In

comparison with the research [16], the new part with hardware implementation is a
switching of the proposed network (10). The r is a switching signal, which is equal to
the row No. of maxðBx  dÞ. It is the winner of Bx  d. r is gotten with a WTA circuit
[19]. It is worked as the switching signal for Br and dr in (10). There are a lot of studies
on WTA circuits, and it is easily implemented with CMOS [20]. It is also easily
implemented by a recurrent neural network just a single dynamic neuron [19]. There is
just two dynamic neurons in the neural network (10), which is much less than the
solutions of [13–18].
 A New Recurrent Neural Network with Fewer Neurons 7

3 Convergence Analysis

It is a feasible way to prove the global convergence of the proposed system by con-
structing a common negative definite Lyapunov function. However, choosing such a
common Lyapunov function is a difficult problem. Some researches on the contraction
theory [21, 22] greatly simplify the proof process with virtual dynamics of the system.
In this paper, the contraction analysis is made to prove the proposed model (10)
convergent. The proof process is based on one definition and two lemmas:
Definition 3.1 ([22]): Given the system equations x_ ¼ f ðx; tÞ, a region of the state
space is called a contraction region with respect to a uniformly positive definite metric
Mðx; tÞ ¼ HT H if @f@x M þ M @x
T
@f
þM_   bM (with b [ 0Þ in that region.

Lemma 3.1 [22]: Given the system equations

x_ ¼ f ðx; tÞ, any trajectory, which starts in a ball of constant radius with respect to the
metric Mðx; tÞ, center at a given trajectory and contained at all times in a contraction
region with respect o Mðx; tÞ, remains in that ball and converges exponentially to this
trajectory. furthermore, global exponential convergence to the given trajectory is
guaranteed if the whole state space is a contraction region with respect to the metric
Mðx; tÞ.
Remark 3.1: As pointed out in [21], Lemma 3.1 holds for all switched systems in case
that all subsystems in the switched family are within a same contraction region Mðx; tÞ.
Lemma 3.2: The solution to problem (6) (represented by l , x ) is the optimal solution
to problem (1). At the same time, l is an equilibrium point of the state equation of the
proposed model, which is as following:

gðl þ BTr W 1 Br l  BTr W 1 c  dr Þ  BTr W 1 Br l þ BTr W 1 c þ dr ¼ 0

The optimal solution also satisfies (11) as following: x ¼ lW 1 Br  W 1 c:

Proof: According to the KKT condition, equation sets (5) are the optimal solution to
problem (4). Equation sets (6) are equivalent to equation sets (5), the solution to
equation set (6) is equivalent to the optimal solution to problem (1). They are as
following:

gðl þ BTr W 1 Br l  BTr W 1 c  dr Þ  BTr W 1 Br l þ BTr W 1 c þ dr ¼ 0

Where x ¼ lW 1 Br  W 1 c.
Now, we are on the stage to state the convergence result of the proposed model.
Theorem 3.1: The proposed (10) converges to the equilibrium point from any start
point l 2 R, and the Eq. (11) is the optimal solution to Eqs. (1).
8 S. Chen et al.

Proof: Based on the contraction theory for analyzing the convergence of (10):
1
l_ ¼ f ðl; tÞ ¼ ðgðl þ BTr W 1 Br l  BTr W 1 c  dr Þ  BTr W 1 Br l þ BTr W 1 c þ dr Þ ð13Þ
e
@f
The partial derivative @l is as following:
(
@f BT W 1 B
¼  r e r if t  0 ð14Þ
@l  1e t\0

Where t ¼ l þ BTr W 1 Br l  BTr W 1 c  dr . Note that the derivate g0 ðxÞ ¼ 0 if

x  0 and g0 ðxÞ ¼ 1 if x\0 (more exactly, it should be the upper right-hand derivative
since the function gðxÞ is non-smooth at x ¼ 0.) is used in the derivation of (14). By
choose M ¼ 1, we have
T 1
@f T @f _ ¼ 2 @f   2minð1; Br W Br Þ
MþM þM ð15Þ
@l @l @l e

Since W 1 is positive definite and Br is not equal to 0 (otherwise, the corre-

sponding inequality in (2) does not include x), we conclude that BTr W 1 Br [ 0 and
minð1;BTr W 1 Br Þ
e [ 0:
minf1;mini ð1;BTi W 1 Bi Þ
By defining b ¼ e , with BTi denoting the ith row of B and the set
S ¼ f1; 2; . . .; pg, we have the following inequality for all l 2 R and all r 2 S under
the same metric M,

@f T @f _   bM
MþM þM ð16Þ
@x @x

The whole state space of l is a contraction region.

Based on Lemma 3.2, l and x , is the optimal solution to problem (1), and it is
also an equilibrium point to Eq. (10).

4 Extensions

4.1 Discrete-Time Model

In this part, we propose the discrete-time model to solve the problem (1) and give
conditions for global convergence
l l
Replacing l, l_ with ln , n þDt1 n in (10), respectively, and denoting ! ¼ Dte , we get
the following state equation and output equation of the discrete model as following
with some trivial manipulations. state equation:

ln þ 1 ¼ !gðln þ BTr W 1 Br ln  BTr W 1 c  dr Þ þ ð1

 !BTr W 1 Br Þln þ !BTr W 1 c þ !dr ð17Þ
 A New Recurrent Neural Network with Fewer Neurons 9

The output equation:

xn ¼ ln W 1 Br  W 1 c ð18Þ

Where r is the row No. of the largest element of Bxn  d, B and d are as equation
sets (3).
In the discrete-time case, the contraction theory is an extension of the well-known
contraction mapping theorem. We still use the contraction theory to analyze the con-
vergence. For discrete-time systems, the definition of a contraction region and the
condition for contraction are stated as below.
Definition 4.1 ([22]): The discrete-time model is as following:
Equation xn þ 1 ¼ fn ðxn ; nÞ, is a contraction region. Positive definite metric Mn ðxn ;
nÞ ¼ HTn Hn , given in the region 9b [ 0, FnT Fn  I   bI\0, where Fn ¼ Hn þ 1
@fn 1
@xn Hn .

Lemma 4.1 ([22]): If the whole state space is a contraction region, The global con-
vergence to the given trajectory is made sure.
Theorem 4.1: The discrete model (17) will converge to the equilibrium point after
initialization l 2 R and the output of equilibrium point, as shown in (18), is also the
optimal solution to problem (1) under:

2
0\c\2; c\ for all i 2 S ð19Þ
BTi W 1 Bi

where BTi denotes the ith row of B and S ¼ f1; 2; 3; . . .; pg

Proof: Firstly, solve the equilibrium point for the discrete model (17), and get the
output of the Eq. (18). Secondly, prove the global contraction to the equilibrium point.
Step 1: Comparing the discrete-time model (17) and its output (18) with the
continuous-time model (10) and its output (11), we can find that they have the same
equilibrium and the same output at this equilibrium. According to the Lemma 3.2, the
solution to equation set (6) is an equilibrium to the discrete model (17) too, and the
output at the point is the optimal solution to the problem (1).
Step 2: To the discrete model (17),

ln þ 1 ¼ fn ðxn ; nÞ
ð20Þ
¼ !gðln þ BTr W 1 Br ln  BTr W 1 c  dr Þ þ ð1  !BTr W 1 Br Þln þ !BTr W 1 c þ !dr

@fn
Calculate @ln as follows:

@fn 1  !BTr W 1 Br if vn  0
¼ ð21Þ
@ln 1  !if vn \0
10 S. Chen et al.

Where vn ¼ ln þ BTr W 1 Br ln  BTr W 1 c  dr . Choosing Hn ¼ 1 for n ¼ 0; 1;

2; . . .; n then
@fn 1
Fn ¼ Hn þ 1 H ð22Þ
@ln n

Based on (21) and (22),

FnT Fn  ðmaxfj1  cj; j1cBTr W 1 Br jgÞ2
ð23Þ
 ðmaxfj1  cj; maxi2S fj1cBTr W 1 Bi jggÞ2

Set b ¼ 1  ðmaxfj1  cj; maxi2S fj1cBTr W 1 Bi jggÞ2 . To all ln 2 R, r 2 S, the

inequality as following (24) is valid.
FnT Fn  I  bI ð24Þ

Since 0\c\2; 0\cBTi W 1 Bi \2 for i 2 S, we get j1  cj\1; j1  cBTi W 1

Bi j\1 for i 2 S. Therefore, ðmaxfj1  cj; maxi2S fj1cBTr W 1 Bi jggÞ2  1 and b [ 0.
Then the whole state space is within contraction range. Let the equilibrium point of
(17) to be the given trajectory, according to Lemma 4.1, the discrete model (17) will
convergence to the equilibrium point.

4.2 Irredundant Equality Constraint

Based on that the equality constraint exists without redundancy, there is another way to
tackle the problem (1). This is to say, the matrix A 2 Rmn in (1) problem meets the
requirement of rank ðAÞ ¼ m and m\n:
Ex  e in problem (1) is replaced by maxðEx  eÞ  0, then
1 T
min( x Wx þ CT xÞ
2
s.t. Ax ¼ b ð25Þ

ErT x  er  0

Based on KKT conditions and the upper saturation function g(
), the solution to
problem (25) meets,
Wx þ c  AT y  lBTr ¼ 0
Ax ¼ b ð26Þ
ErT x  er ¼ gðErT x  er  lÞ

Where y 2 Rm ; l 2 R. x and y can be explicitly solved in terms of l under the

above three equations:
x ¼ lPEr þ s
ð27Þ
y ¼ ðAW 1 AT Þ1 ðAW 1 Br l þ AW 1 c þ bÞ
 A New Recurrent Neural Network with Fewer Neurons 11

Where P ¼ W 1 AT ðAW 1 AT Þ1 AW 1 þ W 1 , S ¼ W 1 ðAT ðAW 1 AT Þ1 ðAW 1

c þ bÞ  cÞ P 2 Rnn . The third equation in (26) is solved as following:

el_ ¼ gðErT x  er  lÞ  ErT x þ er ð28Þ

Where e [ 0 is a scaling parameter. The state equation of the neural network is as

following:

el_ ¼ gðErT PEr l  l þ ErT s  er Þ  ErT PEr l  ErT s þ er ð29Þ

Before stating the convergence result about the neural network (29), the following
lemma is presented, which is used in the convergence proof.
Lemma 4.2: The symmetric matrix P 2 Rnn , P ¼ W 1 AT ðAW 1 AT Þ1 AW 1 þ W 1
is semi-positive definite, i.e., zT Pz  0 for all z 2 Rn and zT ðW 1 AT ðAW 1 AT Þ1
A  IÞ 6¼ 0.
Proof: Since W 1 2 Rnn is positive definite, it can be factorized into W 1 ¼ QQT
with Q positive definite. Defining G 2 Rmn , G ¼ AQ, then G is also row full rank
(since A is row full rank and Q is positive definite) and therefore G can be decomposed
into G ¼ U½^ 0V via singular value decomposition, where U 2 Rmm , V 2 Rnn are
both unitary matrices, ½^ 0 2 Rmn , ^ 2 Rmm is a diagonal matrix with all positive
elements on the diagonal. Bringing

W 1 ¼ QQT ; G ¼ AQ; and G ¼ U½^ 0V into P

¼ W 1 AT ðAW 1 AT Þ1 AW 1 þ W 1

We get the equations as (30) as below. The stability of the neural network (29) and
its global convergence to the optimal solution of (1) is guaranteed by the following
theorem.
Theorem 4.2: The neural network (29) exponentially converges to its equilibrium from
any initial point l 2 R, and its output at this equilibrium by following the output
Eq. (27) is the optimal solution to problem (1), if rankðAÞ ¼ m in (1) and
ðEiT ðW 1 AT ðAW 1 AT Þ1 A  IÞ 6¼ 0
For i ¼ 1; 2; . . .; q, with EiT denoting the ith row of the matrix E.
Proof: This theorem can be proven in a two-step procedure similar to the proof of
Theorem 4.1. The first step is to solve the equilibrium and show that the output at this
equilibrium is the optimal solution to the problem (1). The second step is to prove the
global contraction to the equilibrium. Note that the condition ðEiT ðW 1 AT ðAW 1
AT Þ1 A  IÞ 6¼ 0 For i ¼ 1; 2; . . .; q, according to Lemma 4.2, guarantees ErT PEr [ 0
for all possible switching signal r. Based on this result, global contraction of the neural
network (29) can be proven. Detailed proof process for the two steps is omitted.
Another random document with
no related content on Scribd:
had caught a chill, and before many hours were over,
Bronchitis declared itself, and notwithstanding the care and
physic from which the doctor had hoped such great things,
on Christmas Eve little Dodie went to Heaven with a smile
on her face, and stretching out her little hands as if
someone had come to fetch her.

"I think Mother must have come for her," said Geoffrey in a
low voice, as they stood round the schoolroom fire talking
about it all.

"Yes," said Jack between his sobs, "Perhaps she was sent to
fetch her, lest she should be afraid of all the new people in
Heaven. Even kind Abraham might frighten her a little, she
was always afraid of people with beards—but she wouldn't
mind them a bit, if Mother fetched her."

Geoffrey nodded quietly. He did not cry. He had not shed a

tear.

When once little Dodie had breathed her last, all sense of
his own loss vanished in the overwhelming thought of what
his Father's sorrow would be, when he found Dodie had
gone.
 CHAPTER VI.
THEIR MOTHER'S CHRISTMAS PRESENT.

It was Christmas Eve. The London express was late on

account of the heavy storm of snow that had fallen during
the day. Thomas, the coachman, muffled up, though he was
in his fur cape, felt another quarter of an hour's waiting
would freeze him to his seat, and his hands to the reins.

He had been walking the horses up and down for at least an

hour outside the station, and the signal was still up.

He had not, however, much longer to wait.

A few minutes more and the red light of the approaching

train came into sight, and before long the homeward
journey had begun.

Thomas was thankful that his master's enquiries on seeing

him, had been after his coachman's wife and family, and not
after his own children.
He had been dreading the interview at the station, and was
glad when he found himself driving the horses towards
home, with his master safely inside the carriage.
"I couldn't, couldn't keep her alive for you, Father," he sobbed.

Major Fortescue, was a man in the prime of life, with hair

nevertheless slightly tinged with grey. He sat leaning back
in the carriage, his hand over his eyes. He was passing
through deep waters during that drive, and he was thankful
that in passing them, he was alone and in the dark, with no
eye but that of God upon him.

How different was the home coming to that to which he had

looked forward.

Even now, though he knew what pain the awakening would

cost him, he allowed himself to imagine for a few moments
what it might have been—to picture his sweet wife standing
at the door to welcome him, to feel her in his arms again, to
kiss her dear forehead, eyes, lips once more. Only half an
hour might have been standing between him and her—as it
was, five, ten, perhaps twenty years might be between
them. He groaned audibly.

His face blanched as suddenly the carriage turned in at the

gate, and he caught sight of his three boys standing in the
open doorway, with a row of servants behind. For a moment
he felt utterly unable to control his feelings, and trembled.

Then with a desperate effort, he turned the handle of the

door and sprang out, to find his eldest boy fling himself into
his arms.

Geoffrey's self-control gave way at last.

"I couldn't, couldn't keep her alive for you, Father," he

sobbed, thinking of little Dodie, who lay so still and sweet in
the nursery upstairs.
Major Fortescue, with his thoughts full of his wife, grew a
shade paler with his effort to keep calm.

"My poor lad," he said, stroking the rough curly head of the
boy.

Geoffrey, supposing from his Father's words that Thomas

had informed him of Dodie's death, gave a sigh of relief and
grew calmer, as his Father kissed his other little boys, and
shook hands warmly with faithful old nurse, who stood
sobbing in a corner, and with the other servants.

He had a kind word for each, and no one could have

guessed what an effort it cost him. He showed no sign of
inward agitation at all, except his exceeding paleness.

"Will you come and see Dodie?" whispered Geoffrey at last,

taking him by the hand.

Major Fortescue had missed Dodie from the beginning, but

it being late in the evening, he took for granted the child
had been sent to bed and he was not sorry. He was glad
that he could look upon his little girl, whom everyone had
described to him, as being the living likeness of her mother,
with no curious eyes upon him. He had dreaded, yet longed
to see her, and of all his children, he had thought most
often of seeing little Dodie.

He therefore followed Geoffrey without a word towards the

nursery.

Geoffrey opened the door softly, and walked on tip-toe

across the dimly-lighted room, towards the little crib in the
corner.

There was something about the general aspect of the room,

and the strong smell of sweet flowers, that made Major
Fortescue's heart suddenly stop beating.

He stood on the threshold perfectly still, as if he had

received a blow, and then followed his little son, whose
head was now reverently bent over the crib, and stood by
his side without a word.

Dodie had her little hands crossed over her breast, holding
a beautiful white flower. There was still the sweet smile on
her lips, and her curly hair lay in clusters over her forehead.

It struck Geoffrey at that moment that after all Dodie was

dressed in white to see her Father, and was looking her
sweetest and best.

Then Geoffrey looked up at his father, to his dying day he

never forgot the look he saw on his face, nor the sound of
his voice as he said quietly:

"The Lord gave, and the Lord hath taken away, blessed be
the name of the Lord."

*****

They gave away the Christmas presents next morning after

breakfast.

"Father," said Geoffrey, as afterwards they stood round the

fire, "I was thinking last week that we couldn't give Mother
a Christmas present, but after all, she has our best, for she
has Dodie."

THE END.
 *** END OF THE PROJECT GUTENBERG EBOOK GEOFF'S
LITTLE SISTER ***

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.