Bio inspired Computing Theories and

Applications 11th International

Conference BIC TA 2016 Xi an China
October 28 30 2016 Revised Selected
Papers Part I 1st Edition Maoguo Gong
Visit to download the full and correct content document:
https://textbookfull.com/product/bio-inspired-computing-theories-and-applications-11t
h-international-conference-bic-ta-2016-xi-an-china-october-28-30-2016-revised-select
ed-papers-part-i-1st-edition-maoguo-gong/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Bio inspired Computing Theories and Applications 13th

International Conference BIC TA 2018 Beijing China
November 2 4 2018 Proceedings Part I Jianyong Qiao

https://textbookfull.com/product/bio-inspired-computing-theories-
and-applications-13th-international-conference-bic-
ta-2018-beijing-china-november-2-4-2018-proceedings-part-i-
jianyong-qiao/

Green Pervasive and Cloud Computing 11th International

Conference GPC 2016 Xi an China May 6 8 2016
Proceedings 1st Edition Xinyi Huang

https://textbookfull.com/product/green-pervasive-and-cloud-
computing-11th-international-conference-gpc-2016-xi-an-china-
may-6-8-2016-proceedings-1st-edition-xinyi-huang/

Computer Engineering and Technology 20th CCF Conference

NCCET 2016 Xi an China August 10 12 2016 Revised
Selected Papers 1st Edition Weixia Xu

https://textbookfull.com/product/computer-engineering-and-
technology-20th-ccf-conference-nccet-2016-xi-an-china-
august-10-12-2016-revised-selected-papers-1st-edition-weixia-xu/

Internet and Distributed Computing Systems 9th

International Conference IDCS 2016 Wuhan China
September 28 30 2016 Proceedings 1st Edition Wenfeng Li

https://textbookfull.com/product/internet-and-distributed-
computing-systems-9th-international-conference-idcs-2016-wuhan-
china-september-28-30-2016-proceedings-1st-edition-wenfeng-li/
Machine Learning and Intelligent Communications First
International Conference MLICOM 2016 Shanghai China
August 27 28 2016 Revised Selected Papers 1st Edition
Huang Xin-Lin (Eds.)
https://textbookfull.com/product/machine-learning-and-
intelligent-communications-first-international-conference-
mlicom-2016-shanghai-china-august-27-28-2016-revised-selected-
papers-1st-edition-huang-xin-lin-eds/

Evaluation of Novel Approaches to Software Engineering

11th International Conference ENASE 2016 Rome Italy
April 27 28 2016 Revised Selected Papers 1st Edition
Leszek A. Maciaszek
https://textbookfull.com/product/evaluation-of-novel-approaches-
to-software-engineering-11th-international-conference-
enase-2016-rome-italy-april-27-28-2016-revised-selected-
papers-1st-edition-leszek-a-maciaszek/

Computational Collective Intelligence 8th International

Conference ICCCI 2016 Halkidiki Greece September 28 30
2016 Proceedings Part I 1st Edition Ngoc-Thanh Nguyen

https://textbookfull.com/product/computational-collective-
intelligence-8th-international-conference-iccci-2016-halkidiki-
greece-september-28-30-2016-proceedings-part-i-1st-edition-ngoc-
thanh-nguyen/

Computational Linguistics and Intelligent Text

Processing 17th International Conference CICLing 2016
Konya Turkey April 3 9 2016 Revised Selected Papers
Part I Alexander Gelbukh
https://textbookfull.com/product/computational-linguistics-and-
intelligent-text-processing-17th-international-conference-
cicling-2016-konya-turkey-april-3-9-2016-revised-selected-papers-
part-i-alexander-gelbukh/

Interoperability Safety and Security in IoT Second

International Conference InterIoT 2016 and Third
International Conference SaSeIoT 2016 Paris France
October 26 27 2016 Revised Selected Papers 1st Edition
Nathalie Mitton
https://textbookfull.com/product/interoperability-safety-and-
security-in-iot-second-international-conference-
interiot-2016-and-third-international-conference-
Maoguo Gong · Linqiang Pan
Tao Song · Gexiang Zhang (Eds.)

Communications in Computer and Information Science 681

Bio-inspired Computing –
Theories and Applications
11th International Conference, BIC-TA 2016
Xi'an, China, October 28–30, 2016
Revised Selected Papers, Part I

123
Communications
in Computer and Information Science 681
Commenced Publication in 2007
Founding and Former Series Editors:
Alfredo Cuzzocrea, 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
Phoebe Chen
La Trobe University, Melbourne, Australia
Xiaoyong Du
Renmin University of China, Beijing, China
Joaquim Filipe
Polytechnic Institute of Setúbal, Setúbal, Portugal
Orhun Kara
TÜBİTAK BİLGEM and Middle East Technical University, Ankara, Turkey
Igor Kotenko
St. Petersburg Institute for Informatics and Automation of the Russian
Academy of Sciences, St. Petersburg, Russia
Ting Liu
Harbin Institute of Technology (HIT), Harbin, China
Krishna M. Sivalingam
Indian Institute of Technology Madras, Chennai, India
Takashi Washio
Osaka University, Osaka, Japan
More information about this series at http://www.springer.com/series/7899
Maoguo Gong Linqiang Pan
•

Tao Song Gexiang Zhang (Eds.)

•

Bio-inspired Computing –
Theories and Applications
11th International Conference, BIC-TA 2016
Xi’an, China, October 28–30, 2016
Revised Selected Papers, Part I

123
Editors
Maoguo Gong Tao Song
Xidian University China University of Petroleum
Xi’an Qingdao
China China
Linqiang Pan and
Huazhong University of Science
and Technology Faculty of Engineering, Computing
Wuhan and Science
China Swinburne University of Technology
Sarawak Campus
Kuching
Malaysia
Gexiang Zhang
Southwest Jiaotong University
Chengdu
China

ISSN 1865-0929 ISSN 1865-0937 (electronic)

Communications in Computer and Information Science
ISBN 978-981-10-3610-1 ISBN 978-981-10-3611-8 (eBook)
DOI 10.1007/978-981-10-3611-8

Library of Congress Control Number: 2016962020

© Springer Nature Singapore Pte Ltd. 2016

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.

Printed on acid-free paper

This Springer imprint is published by Springer Nature

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

Bio-inspired computing is a field of study that abstracts computing ideas (data struc-
tures, operations with data, ways to control operations, computing models, etc.) from
living phenomena or biological systems such as evolution, cells, tissues, neural net-
works, immune system, and ant colonies. Bio-Inspired Computing: Theories and
Applications (BIC-TA) is a series of conferences that aims to bring together researchers
working in the main areas of natural computing inspired from biology, for presenting
their recent results, exchanging ideas, and cooperating in a friendly framework. The
conference has four main topics: evolutionary computing, neural computing, DNA
computing, and membrane computing.
Since 2006, the conference has taken place at Wuhan (2006), Zhengzhou (2007),
Adelaide (2008), Beijing (2009), Liverpool and Changsha (2010), Penang (2011),
Gwalior (2012), Anhui (2013), Wuhan (2014), and Anhui (2015). Following the
success of previous editions, the 11th International Conference on Bio-Inspired
Computing: Theories and Applications (BIC-TA 2016) was organized by Xidian
University, during October 28–30, 2016.
BIC-TA 2016 attracted a wide spectrum of interesting research papers on various
aspects of bio-inspired computing with a diverse range of theories and applications.
We received 343 submissions, of which 115 papers were selected for two volumes of
Communications in Computer and Information Science.
We gratefully thank Xidian University, Huazhong University of Science and
Technology, and Northwestern Polytechnical University for extensive assistance in
organizing the conference. We also thank Dr. Jiao Shi and all other volunteers, whose
efforts ensured the smooth running of the conference.
The editors warmly thank the Program Committee members for their prompt and
efficient support in reviewing the papers, and the authors of the submitted papers for
their interesting papers.
Special thanks are due to Springer for their skilled cooperation in the timely pro-
duction of these volumes.

October 2016 Maoguo Gong

Linqiang Pan
Tao Song
Gexiang Zhang
 Organization

Steering Committee
Guangzhao Cui Zhengzhou University of Light Industry, China
Kalyanmoy Deb Indian Institute of Technology Kanpur, India
Miki Hirabayashi National Institute of Information and Communications
Technology (NICT), Japan
Joshua Knowles University of Manchester, UK
Thom LaBean North Carolina State University, USA
Jiuyong Li University of South Australia, Australia
Kenli Li University of Hunan, China
Giancarlo Mauri Università di Milano-Bicocca, Italy
Yongli Mi Hong Kong University of Science and Technology,
Hong Kong, SAR China
Atulya K. Nagar Liverpool Hope University, UK
Linqiang Pan Huazhong University of Science and Technology, China
Gheorghe Păun Romanian Academy, Bucharest, Romania
Mario J. Pérez-Jiménez University of Seville, Spain
K.G. Subramanian Universiti Sains Malaysia, Malaysia
Robinson Thamburaj Madras Christian College, India
Jin Xu Peking University, China
Hao Yan Arizona State University, USA

Program Committee

Rosni Abdullah, Malaysia Michael Chen, China

Muhammad Abulaish, Saudi Arabia
Chang Wook Ahn, South Korea
Adel Al-Jumaily, Australia
Bahareh Asadi, Iran
Li He, USA
Eduard Babulak, European Commission,
Community Research
and Development Information
Mehdi Bahrami, Iran
Soumya Banerjee, India
Jagdish Chand Bansal, India
Debnath Bhattacharyya, India
Monowar H. Bhuyan, India
Kavita Burse, India
Tsung-Che Chiang, Taiwan, China
Sung-Bae Cho, South Korea
Kadian Davis, Jamaica
Sumithra Devi K.A., India
Ciprian Dobre, Romania
Amit Dutta, India
Carlos Fernandez-Llatas, Spain
Pierluigi Frisco, UK
Maoguo Gong, China (Chair)
Shan He, UK
Jer Lang Hong, Malaysia
Tzung-Pei Hong, Taiwan, China
Wei-Chiang Hong, Taiwan, China
Mo Hongwei, China
VIII Organization
Sriman Narayana Iyengar, India
Antonio J. Jara, Spain
Sunil Kumar Jha, India
Guoli Ji, China
Mohamed Rawidean Mohd Kassim,
Malaysia
M. Ayoub Khan, India
Razib Hayat Khan, Norway
Joanna Kolodziej, Poland
Ashwani Kush, India
Shyam Lal, India
Kenli Li, China
Chun-Wei Lin, China
Wenjian Luo, China
Mario J. Pérez-Jiménez, Spain
Vittorio Maniezzo, Italy
Francesco Marcelloni, Italy
Hasimah Mohamed, Malaysia
Chilukuri K. Mohan, USA
Abdulqader Mohsen, Malaysia
Holger Morgenstern, Germany
Andres Muñoz, Spain
G.R.S. Murthy, India
Akila Muthuramalingam, India
Atulya Nagar, UK
Asoke Nath, India
Linqiang Pan, China (Chair)
Mrutyunjaya Panda, India
Manjaree Pandit, India
Gheorghe Păun, Romania
Andrei Păun, USA
Yoseba Penya, Spain
Ninan Sajeeth Philip, India
Hugo Proença, Portugal
Sponsors
Xidian University
Huazhong University of Science and Technology
Northwestern Polytechnical University
Balwinder Raj, India
Balasubramanian Raman, India
Nur’ Aini Abdul Rashid, Malaysia
Mehul Raval, India
Rawya Rizk, Egypt
Thamburaj Robinson, India
Samrat Sabat, India
S.M. Sameer, India
Rajesh Sanghvi, India
Aradhana Saxena, India
Sonia Schulenburg, UK
G. Shivaprasad, India
K.K. Shukla, India
Madhusudan Singh, South Korea
Pramod Kumar Singh, India
Ravindra Singh, India
Sanjeev Singh, India
Satvir Singh, India
Don Sofge, USA
Tao Song, China
Kumbakonam Govindarajan
Subramanian, Malaysia
Ponnuthurai Suganthan, Singapore
S.R. Thangiah, USA
Nikolaos Thomaidis, India
D.G. Thomas, India
Ravi Sankar Vadali, India
Ibrahim Venkat, Malaysia
Sudhir Warier, India
Ram Yadav, USA
Umi Kalsom Yusof, Malaysia
Sotirios Ziavras, USA
Pan Zheng, Malaysia
 Contents – Part I

DNA Computing

DNA Self-assembly Model to Solve Compound Logic Operators Problem . . . 3

Shihua Zhou, Bin Wang, Xuedong Zheng, and Changjun Zhou

Model Checking Computational Tree Logic Using Sticker Automata . . . . . . . 12

Weijun Zhu, Yanfeng Wang, Qinglei Zhou, and Kai Nie

Two-Digit Full Subtractor Logical Operation Based on DNA

Strand Displacement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
Junwei Sun, Xing Li, Chun Huang, Guangzhao Cui, and Yanfeng Wang

One-Bit Full Adder-Full Subtractor Logical Operation Based on DNA

Strand Displacement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
Yanfeng Wang, Xing Li, Chun Huang, Guangzhao Cui, and Junwei Sun

Logic Gate Based on Circular DNA Structure with Strand Displacement . . . . 39

Guangzhao Cui, Xi Wang, Xuncai Zhang, Ying Niu, and Hua Liu

The Working Operation Problem Based on Probe Machine Model . . . . . . . . 47

Jing Yang and Zhixiang Yin

Matrix Flat Splicing Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54

Rodica Ceterchi, Linqiang Pan, Bosheng Song, and K.G. Subramanian

A Universal Platform for Building DNA Logic Circuits . . . . . . . . . . . . . . . . 64

Zicheng Wang, Jian Ai, Yanfeng Wang, Guangzhao Cui, and Lina Yao

Membrane Computing

A Hybrid “Fast-Slow” Convergent Framework for Genetic Algorithm

Inspired by Membrane Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
Zhongwei Li, Shengyu Xia, Yun Jiang, Beibei Sun, Yuezhen Xin,
and Xun Wang

An Image Threshold Segmentation Algorithm with Hybrid Evolutionary

Mechanisms Based on Membrane Computing . . . . . . . . . . . . . . . . . . . . . . . 85
Shuo Liu, Kang Zhou, Shan Zeng, Huaqing Qi, and Tingfang Wu

K-Medoids-Based Consensus Clustering Based on Cell-Like P Systems

with Promoters and Inhibitors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95
Xiyu Liu, Yuzhen Zhao, and Wenxing Sun
X Contents – Part I

Fault Classification of Power Transmission Lines Using Fuzzy Reasoning

Spiking Neural P Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
Kang Huang, Gexiang Zhang, Xiaoguang Wei, Haina Rong,
Yangyang He, and Tao Wang

Membrane Algorithm with Genetic Operation and VRPTW-Based Public

Optimization System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118
Yingying Duan, Kang Zhou, Huaqing Qi, and Zhiqiang Zhang

An Immune Algorithm Based on P System for Classification . . . . . . . . . . . . 133

Lian Ye and Ping Guo

Simulation of Fuzzy ACSH on Membranes with Michaelis-Menten Kinetics . . . 142

J. Philomenal Karoline, P. Helen Chandra,
S.M. Saroja Theerdus Kalavathy, and A. Mary Imelda Jayaseeli

A Family P System of Realizing RSA Algorithm . . . . . . . . . . . . . . . . . . . . 155

Ping Guo and Wei Xu

A General Object-Oriented Description for Membrane Computing. . . . . . . . . 168

Xiyu Liu, Yuzhen Zhao, and Wenping Wang

Matrix Representation of Parallel Computation for Spiking

Neural P Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
Juan Hu, Guangchun Chen, Hong Peng, Jun Wang, Xiangnian Huang,
and Xiaohui Luo

The Computational Power of Array P System with Mate Operation. . . . . . . . 200

P. Helen Chandra, S.M. Saroja T. Kalavathy, and M. Nithya Kalyani

The Computational Power of Watson-Crick Grammars: Revisited . . . . . . . . . 215

Nurul Liyana Mohamad Zulkufli, Sherzod Turaev,
Mohd Izzuddin Mohd Tamrin, and Azeddine Messikh

An Improvement of Small Universal Spiking Neural P Systems

with Anti-Spikes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 226
Shuo Liu, Kang Zhou, Shan Zeng, Huaqing Qi, and Xing Chen

The Implementation of Membrane Clustering Algorithm Based on FPGA . . . 237

Yunying Yang, Jun Ming, Jun Wang, Hong Peng, Zhang Sun,
and Wenping Yu

Tools and Simulators for Membrane Computing-A Literature Review . . . . . . 249

S. Raghavan and K. Chandrasekaran

Parallel Contextual Hexagonal Array P Systems . . . . . . . . . . . . . . . . . . . . . 278

James Immanuel Suseelan, D.G. Thomas, Robinson Thamburaj,
Atulya K. Nagar, and S. Jayasankar
 Contents – Part I XI

Superadiabatic STIRAP: Population Transfer and Quantum

Rotation Gates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299
Youssouf Hamidou Issoufa and Azeddine Messikh

Image Segmentation Using Membrane Computing: A Literature Survey. . . . . 314

Rafaa I. Yahya, Siti Mariyam Shamsuddin, Salah I. Yahya,
Shafatnnur Hasan, Bisan Al-Salibi, and Ghada Al-Khafaji

Integrated Membrane Computing Framework for Modeling Intrusion

Detection Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 336
Rufai Kazeem Idowu, Ravie Chandren Muniyandi,
and Zulaiha Ali Othman

Neural Computing

A Deep Learning Model of Automatic Detection of Pulmonary Nodules

Based on Convolution Neural Networks (CNNs). . . . . . . . . . . . . . . . . . . . . 349
Xiaojiao Xiao, Yan Qiang, Juanjuan Zhao, and Pengfei Zhao

A Study on the Recognition and Classification Method of High Resolution

Remote Sensing Image Based on Deep Belief Network . . . . . . . . . . . . . . . . 362
Guanyu Chen, Xiang Li, and Ling Liu

Classification Based on Brain Storm Optimization Algorithm . . . . . . . . . . . . 371

Yu Xue, Tao Tang, and Tinghuai Ma

Stacked Auto-Encoders for Feature Extraction with Neural Networks . . . . . . 377

Shuanglong Liu, Chao Zhang, and Jinwen Ma

Fault Diagnosis of Power Systems Based on Triangular Fuzzy Spiking

Neural P Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 385
Chengyu Tao, Wenping Yu, Jun Wang, Hong Peng, Ke Chen,
and Jun Ming

A Recognition Method of Hand Gesture with CNN-SVM Model . . . . . . . . . 399

Miao Ma, Zuxue Chen, and Jie Wu

Cross-Media Information Retrieval with Deep Convolutional

Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 405
Liang Bai, Tianyuan Yu, Jinlin Guo, Zheng Yang, and Yuxiang Xie

Exploration of the Critical Diameter in Networks . . . . . . . . . . . . . . . . . . . . 411

Haifeng Du, Jingjing Wang, Xiaochen He, and Wei Du

Image Compression Based on Genetic Algorithm and Deep

Neural Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 417
Haisheng Deng, Hongying Liu, Feixiang Wang, Zhi Wang,
and Yikai Wang
XII Contents – Part I

DNN-Based Joint Classification for Multi-source Image Change Detection . . . 425

Wenping Ma, Zhizhou Li, Puzhao Zhang, and Tianyu Hu

Differencing Neural Network for Change Detection in Synthetic Aperture

Radar Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 431
Feng Chen, Jiao Shi, and Maoguo Gong

Change Detection in Synthetic Aperture Radar Images Based on Fuzzy

Restricted Boltzmann Machine . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 438
Na Li, Jiao Shi, and Maoguo Gong

Machine Learning

Decision Variable Analysis Based on Distributed Computing . . . . . . . . . . . . 447

Zhao Wang, Maoguo Gong, and Tian Xie

A Multi-task Learning Approach by Combining Derivative-Free

and Gradient Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456
Yiqi Hu and Yang Yu

A Collaborative Learning Model in Teaching-Learning-Based

Optimization: Some Numerical Results . . . . . . . . . . . . . . . . . . . . . . . . . . . 466
Bei Dong, Xiaojun Wu, and Yifei Sun

Incremental Learning with Concept Drift: A Knowledge

Transfer Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 473
Yu Sun and Ke Tang

Visual Tracking Based on Ensemble Learning with Logistic Regression. . . . . 480

Xiaolin Tian, Sujie Zhao, and Licheng Jiao

A New Optimal Neuro-Fuzzy Inference System for MR Image

Classification and Multiple Scleroses Detection. . . . . . . . . . . . . . . . . . . . . . 487
Hakima Zouaoui, Abdelouahab Moussaoui, Abdelmalik Taleb-Ahmed,
and Mourad Oussalah

The Influence of Diversification Strategy on Capital Structure . . . . . . . . . . . 494

Xuefeng Li

An Improved Hybrid Bat Algorithm for Traveling Salesman Problem . . . . . . 504

Wedad Al-sorori, Abdulqader Mohsen, and Walid Aljoby ßer

Design of Selecting Security Solution Using Multi-objective

Genetic Algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 512
Yunghee Lee, Jaehun Jung, and Chang Wook Ahn
 Contents – Part I XIII

A Multi-agent System for Creating Art Based on Boids with Evolutionary

and Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 518
Tae Jong Choi, Jaehun Jeong, and Chang Wook Ahn

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 525

 Contents – Part II

Evolutionary Computing

Kernel Evolutionary Algorithm for Clustering. . . . . . . . . . . . . . . . . . . . . . . 3

Xiangming Jiang, Jingjing Ma, and Chao Lei

A Multi-parent Crossover Based Genetic Algorithm for Bi-Objective

Unconstrained Binary Quadratic Programming Problem . . . . . . . . . . . . . . . . 10
Chao Huo, Rongqiang Zeng, Yang Wang, and Mingsheng Shang

Unsupervised Image Segmentation Based on Watershed and Kernel

Evolutionary Clustering Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
Chao Lei, Jingjing Ma, and Xiangming Jiang

Classification Based on Fireworks Algorithm . . . . . . . . . . . . . . . . . . . . . . . 35

Yu Xue, Binping Zhao, and Tinghuai Ma

Overlapping Community Detection in Network:

A Fuzzy Evaluation Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
Wei Zhao, Yangzhi Guo, Chao Lei, and Jianan Yan

Multifactorial Brain Storm Optimization Algorithm . . . . . . . . . . . . . . . . . . . 47

Xiaolong Zheng, Yu Lei, Maoguo Gong, and Zedong Tang

An Improved Heuristic Algorithm for UCAV Path Planning. . . . . . . . . . . . . 54

Kun Zhang, Peipei Liu, Weiren Kong, Yu Lei, Jie Zou, and Min Liu

An Efficient Benchmark Generator for Dynamic Optimization Problems . . . . 60

Changhe Li

Ensemble of Different Parameter Adaptation Techniques in Differential

Evolution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
Liang Wang and Wenyin Gong

Research on Multimodal Optimization Algorithm for the Contamination

Source Identification of City Water Distribution Networks . . . . . . . . . . . . . . 80
Xuesong Yan, Jing Zhao, and Chengyu Hu

Visual Tracking by Sequential Cellular Quantum-Behaved Particle Swarm

Optimization Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
Junyi Hu, Wei Fang, and Wangtong Ding

An Improved Search Algorithm About Spam Firewall . . . . . . . . . . . . . . . . . 95

Kangshun Li, Lu Xiong, and Zhichao Wen
XVI Contents – Part II

Artificial Bee Colony Algorithm Based on Clustering Method and Its

Application for Optimal Power Flow Problem . . . . . . . . . . . . . . . . . . . . . . 101
Liling Sun and Hanning Chen

Study on Hybrid Intelligent Algorithm with Solving Pre-stack AVO Elastic

Parameter Inversion Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
Qinghua Wu, Ying Hao, and Xuesong Yan

A Hybrid Multi-objective Discrete Particle Swarm Optimization Algorithm

for Cooperative Air Combat DWTA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
Guang Peng, Yangwang Fang, Shaohua Chen, Weishi Peng,
and Dandan Yang

A Novel Image Fusion Method Based on Shearlet and Particle Swarm

Optimization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
Qiguang Miao, Ruyi Liu, Yiding Wang, and Jianfeng Song

Generalized Project Gradient Algorithm for Solving Constrained Minimax

Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
Cong Zhang, Limin Sun, and Zhibin Zhu

A Real Adjacency Matrix-Coded Differential Evolution Algorithm

for Traveling Salesman Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
Hang Wei, Zhifeng Hao, Han Huang, Gang Li, and Qinqun Chen

A Hybrid IWO Algorithm Based on Lévy Flight. . . . . . . . . . . . . . . . . . . . . 141

Xuncai Zhang, Xiaoxiao Wang, Guangzhao Cui, and Ying Niu

Evolutionary Process: Parallelism Analysis of Differential Evolution

Algorithm Based on Graph Theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151
Xiaoqi Peng, Zhifeng Hao, Han Huang, Hongyue Wu, and Fangqing Liu

A Mean Shift Assisted Differential Evolution Algorithm . . . . . . . . . . . . . . . 163

Hui Fang, Aimin Zhou, and Guixu Zhang

Quantum-Behaved Particle Swarm Optimization Using MapReduce. . . . . . . . 173

Yangyang Li, Zhenghan Chen, Yang Wang, and Licheng Jiao

Dynamic Fitness Landscape Analysis on Differential Evolution Algorithm . . . 179

Shuling Yang, Kangshun Li, Wei Li, Weiguang Chen, and Yan Chen

Improving Artificial Bee Colony Algorithm with Historical Archive . . . . . . . 185

Yalan Zhou, Jiahai Wang, Shangce Gao, Xing Yang, and Jian Yin

Recent Advances in Evolutionary Programming . . . . . . . . . . . . . . . . . . . . . 191

Jing Yu and Lining Xing

Application of Discrete Ant Colony Optimization in VRPTW. . . . . . . . . . . . 204

Qinhong Fu, Kang Zhou, Huaqing Qi, and Tingfang Wu
 Contents – Part II XVII

Differential Evolution Algorithm with the Second Order Difference Vector . . . 219
Xinchao Zhao, Dongyue Liu, Xingquan Zuo, Huiping Liu, and Rui Li

Multi-objective Optimization

Biomimicry of Plant Root Foraging for Distributed Optimization:

Models and Emergent Behaviors . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 231
Hanning Chen, Xiaodan Liang, Maowei He, and Weixing Su

Adaptive Bacterial Foraging Algorithm and Its Application in Mobile

Robot Path Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
Xiaodan Liang, Maowei He, and Hanning Chen

A Novel Hierarchical Artificial Bee Colony Optimizer and Its Application

for Model-Based Prediction of Droplet Characteristic in 3D Electronic
Printing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
Maowei He and Hanning Chen

Research on Network-on-Chip Automatically Generate Method Based

on Hybrid Optimization Mapping . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 254
Chao Li and Yuqiang Chen

Evolutionary Algorithms for Many-Objective Ground Station Scheduling

Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
Zhongshan Zhang, Lining Xing, Yuning Chen, and Pei Wang

Indicator-Based Multi-objective Bacterial Foraging Algorithm with

Adaptive Searching Mechanism . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 271
Lianbo Ma, Xu Li, Tianhan Gao, Qiang He, Guangming Yang,
and Ying Liu

Applying K-means Clustering and Genetic Algorithm for Solving MTSP . . . . 278
Zhanqing Lu, Kai Zhang, Juanjuan He, and Yunyun Niu

A Multi-objective Optimization Algorithm Based on Tissue P System

for VRPTW . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285
Wenbo Dong, Kang Zhou, Huaqing Qi, Cheng He, Jun Zhang,
and Bosheng Song

The Subideal Version of the SOI-Algorithm and Its Application . . . . . . . . . . 302

Haifeng Sang and Qingchun Li

A Diversity Keeping Strategy for the Multi-objective Examination

Timetabling Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 310
Yu Lei, Jiao Shi, and Kun Zhang
XVIII Contents – Part II

A Grid-Based Decomposition for Evolutionary Multiobjective

Optimization. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 316
Zhiwei Mei, Xinye Cai, and Zhun Fan

Multi-objective Evolutionary Algorithm for Enhancing the Robustness

of Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 322
Zheng Li, Shanfeng Wang, and Wenping Ma

Multi-objective Optimization with Nonnegative Matrix Factorization

for Identifying Overlapping Communities in Networks. . . . . . . . . . . . . . . . . 328
Hongmin Liu, Hao Li, and Wei Zhao

Magnetic Bacterial Optimization Algorithm for Mobile Robot Path

Planning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334
Hongwei Mo, Lifang Xu, and Chaomin Luo

Pattern Recognition

A Simple Deep Feature Representation for Person Re-identification. . . . . . . . 343

Shengke Wang, Lianghua Duan, Yong Zhao, and Junyu Dong

A Common Strategy to Improve Community Detection Performance Based

on the Nodes’ Property . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 355
Wei Du and Xiaochen He

HVS-Inspired Dimensionality Reduction Model Based on Factor Analysis . . . 362

Zhigang Shang, Mengmeng Li, and Yonghui Dong

Human Face Reconstruction from a Single Input Image Based on a Coupled

Statistical Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 373
Yujuan Sun, Muwei Jian, and Junyu Dong

Research on Micro-blog New Word Recognition Based on MapReduce . . . . . 379

Chaoting Xiao, Jianhou Gan, Bin Wen, Wei Zhang, and Xiaochun Cao

A Memetic Kernel Clustering Algorithm for Change Detection

in SAR Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 388
Yangyang Li, Gao Lu, and Licheng Jiao

Collaborative Rating Prediction Based on Dynamic Evolutionary

Heterogeneous Clustering. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 394
Jianrui Chen, Uliji, Hua Wang, and Chunxia Zhao

Improving Sample Optimization with Convergence Speed Controller

for Sampling-Based Image Matting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 400
Liang Lv, Han Huang, Zhaoquan Cai, and Yihui Liang
 Contents – Part II XIX

An Improved Extraction Algorithm About Disease Spots . . . . . . . . . . . . . . . 407

Lu Xiong, Dongbo Zhang, and Kangshun Li

Fine-Grained Image Categorization with Fisher Vector . . . . . . . . . . . . . . . . 413

Xiaolin Tian, Xin Ding, and Licheng Jiao

Analysis of SNP Network Structure Based on Mutual Information of Breast

Cancer Susceptibility Genes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 420
Shudong Wang, Shanqiang Zhang, Shanshan Li, Xinzeng Wang,
Sicheng He, Yan Zhao, Xiaodan Fan, Fayou Yuan, Xinjie Zhu,
and Yun Jiang

Novel Image Deconvolution Algorithm Based on the ROF Model. . . . . . . . . 431

Su Xiao

Nucleic Acid Secondary Structures Prediction with Planar Pseudoknots

Using Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 441
Zhang Kai, Li Shangyi, He Juanjuan, and Niu Yunyun

The Short-Term Traffic Flow Prediction Based on MapReduce . . . . . . . . . . . 448

Suping Liu and Dongbo Zhang

Saliency Detection Model for Low Contrast Images Based on Amplitude

Spectrum Analysis and Superpixel Segmentation. . . . . . . . . . . . . . . . . . . . . 454
Hua Yang, Xin Xu, and Nan Mu

Memetic Image Segmentation Method Based on Digraph Coding . . . . . . . . . 461

Tao Wu, Jiao Shi, and Yu Lei

Change Detection in Remote Sensing Images Based on Clonal Selection

Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 467
Tao Wu, Yu Lei, and Maoguo Gong

Others

An Improved Algorithm for Constructing Binary Trees Using the Traversal

Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 475
Fangxiu Wang, Kang Zhou, Huaqing Qi, and Bosheng Song

Improved Multi-step Iterative Algorithms for the Fixed Points of Strongly

Pseudo-Contractive Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 489
Jiangrong Liu, Kang Zhou, Shan Zeng, Huaqing Qi, Bosheng Song,
and Tingfang Wu

Grammar Automatic Checking System for English Abstract of Master’s

Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 497
Yueting Xu, Ziheng Wu, Han Huang, Tianxiong Yang, Pan Yu,
and Erang Lu
XX Contents – Part II

Verified Error Bounds for Symmetric Solutions of Operator Matrix

Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 507
Qingchun Li, Ziyu Li, Haifeng Sang, and Panpan Liu

Immune Multipath Reliable Transmission with Fault Tolerance in Wireless

Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 513
Hongbing Li, Dong Zeng, Liwan Chen, Qiang Chen, Mingwei Wang,
and Chunjiong Zhang

The Research of Solving Inverse Problems of Complex Differential

Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 518
Kangshun Li, Yan Chen, and Jun He

Fast Algorithms for Verifying Centrosymmetric Solutions of Sylvester

Matrix Equations. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 524
Ziyu Li, Haifeng Sang, and Ying Zhao

Research on Distributed Anomaly Traffic Detection Technology Based

on Hadoop Platform . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 530
Qiang Chen

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 537

DNA Computing
 DNA Self-assembly Model to Solve Compound
Logic Operators Problem

Shihua Zhou(B) , Bin Wang, Xuedong Zheng, and Changjun Zhou

Key Laboratory of Advanced Design and Intelligent Computing, Dalian University,

Ministry of Education, Dalian 116622, China
shihuajo@gmail.com

Abstract. Self-assembly is the process that the component form an

ordered form or structure. Because of the biochemical characteristics of
DNA molecules, they become a research emphasis in the field of self-
assembly. DNA-based self-assembly technology has been widely used in
the fields of nanometer machining, molecular circuit, polymer materials,
and so on. DNA self-assembly is an effective mechanism that nanometer
structure is built bottom-up. In order to overcome the problem that any
kind of self-assembled model can only solve the single algorithm, in this
paper, a new DNA self-assembly algorithmic model is designed to solve
compound logic operators problem. Five types of DNA tiles are designed
according to the characteristic of compound operation problem, namely
Initial Tile, Process Tile, Operation Tile, End Tile and Boundary Tile.
At last, the process of self-assembly are demonstrated by an instance.

Keywords: DNA self-assembly · Compound logic operators ·

Algorithmic model

1 Introduction
DNA computing [1–3] is an important research content in the crossing field of
computer science and biological science. It is a new and fast-developing direction
along with the successful completion of human genome project. In 1994, Adleman
implemented to solve Hamiltonian Path Problem that there are seven vertices
by the biological method according to the complementarity principle of DNA
molecular bases [4]. The birth of DNA computing marks the appearance of a
new computing mode and breaks the original calculation model. It opens up a
new path for solving various complicated problem.
The basic principle of DNA computing [5] is that DNA sequences are used
as a carrier of information coding, and the specific DNA sequences are used to
map the problem by the double helix of DNA molecules and the properties of
the complementary base pairing. Using enzymes as operator, the solution space
is generated by controllable biochemical reactions. Then, the solution results are
extracted by polymerase chain reaction PCR, aggregation, overlapping ampli-
fication technology POA, ultrasonic degradation, affinity chromatography, elec-
trophoresis, molecular and purification, separation of magnetic beads and other
modern molecular biological technology.

c Springer Nature Singapore Pte Ltd. 2016
M. Gong et al. (Eds.): BIC-TA 2016, Part I, CCIS 681, pp. 3–11, 2016.
DOI: 10.1007/978-981-10-3611-8 1
4 S. Zhou et al.

Self-assembly is an extremely common phenomenon in the nature. The bio-

chemical process of synthesis of DNA, transcription and regulation of RNA, syn-
thesis and folding of protein synthesis or the generation of living organisms is the
product of self-assembly. In the process of self-assembly, human only can design
product and open the process of self-assembly. When self-assembly process begins
automatically, no longer need any external forces. Winfree et al. [6] firstly came
up with the idea of computing by self-assembly tiles. In 2000, Mao et al. first
put forward three cross Tile based-DNA self-assembly model, then the model
was verified that it can implement accumulation of exclusive or operation by
biological experiment [7]. In 2006, He et al. presented a kind of self-assembly
model that can realize two nonnegative binary integer addition by coding DNA
single sequence [8]. In 2009, on the basis of Brun work, Zhang et al. formed the
division operation system by DNA self-assembly [9]. In 2010, Lai et al. used lin-
ear self-assembly to implement two nonnegative binary integer subtraction [10].
In 2011, Zhang et al. combined AuNP self-assembled polymerization with DNA
computing, and constructed DNA self-assembly logic calculation model [11]. In
2013, Fan et al. built logic gates to implement the single logic operator by DNA
self-assembly [12]. In 2016, Bi et al. used self-assembly of duplex-looped DNA
hairpin motif based on strand displacement reaction to solve logic operations
[13].
At present, using self-assembly model to solve simple operation has gained
some achievement, including mathematics, logic, and other operations. How-
ever, any kind of self-assembled model can only solve the single algorithm. For
compound operation, even the most basic operations, the existing models are
unable to realize. Only through the way of dismantling, compound operations
was dismantled into several simple operations, then they are solved one by one.
This paper proposes a new DNA self-assembly system, in which both additive
operation and subtraction operation can been realized simultaneously.

2 The Principle of DNA Self-assembly

DNA self-assembly [6] is a Tile-based calculation mode. Problem is mapped to

the initial framework. Under the condition of certain biochemical reaction, the
assembly process between Tile and assembly is implemented through the comple-
mentary matching. Final assembly is the output of problem. DNA self-assembly
models are divided into three types, namely linear model, 2D self-assembly model
and 3D self-assembly, in which, 2D self-assembly model is currently the most
widely used model. 2D self-assembly model is made up of four parts, namely
basic Tile, bonding strength function, seed Tile and strength parameters. Basic
Tile is used to build the various calculation operator, store data that is pro-
duced in the operation process and perform various calculations. Each side of
Tile has some identification in order to indicate different numerical or operator.
Bonding strength function is used to define the combination intensity between
two stick ends of two adjacent tiles. Seed Tile is used to define start and end of
the self-assembly. Strength parameters are used to represent thermal and kinetic
 DNA Self-assembly Model to Solve Compound Logic Operators Problem 5

parameters. Only when the summation of bonding strength parameters between

every two tiles is greater than the given parameter, the assembly reaches the
steady state.
In the process of solving practical problems, we usually abstract and sim-
plify the molecule so as to improve the efficiency of modeling. Every abstract
DNA Tile owns four coupling ends, and every coupling end expresses a special
sticky end. Two sticky ends with complementary characteristics can be con-
nected together. σLU , σLD , σRU and σRD represent four sticky ends respectively.
According to the needs of the problem, a variety of different DNA structures can
been constructed through the design of their operational function so as to realize
a variety of different operations (Fig. 1).

Fig. 1. The abstract diagram of DNA Tile

3 Compound Logic Operators

Logic operation [11–13] is also called Boolean operation. Boolean used mathe-
matical method to study on logic problems, and created succeeded the logical
calculus. He uses equation to express verdict, and the ratiocination is regarded
as the transformation of the equation. The effectiveness of this transformation is
not depend on the explanation of symbols, and only depends on the combination
of the symbols. This logic theory is referred to as Boolean algebra. In the 1930s,
logic algebra was applied to the circuit system. And then, due to the development
of electronic technology and computer, the transformation rules of all sorts of
complex large systems compliance with laws that Boolean reveals. Logical oper-
ators are usually used to test the true and false value. One of the most common
logic operator is used to determine whether leave cycle or continue to execute the
instruction in the cycle. There are only two logic constants, namely 0 and 1, and
they are used to represent two contrary logic states. As with ordinary algebra,
logic variables can also been expressed by letters, symbols, Numbers and their
combination. But they have the essential difference. The values of logic constant
only have two possibilities, namely 0 and 1, and no have intermediate value.
Table 1 shows the rules of three common logic operators. They are XOR, NOR
and NAND respectively.
6 S. Zhou et al.

Table 1. The rules of three common logic operators

x1 x2 XOR NOR NAND

0 0 0 1 1
0 1 1 0 1
1 0 1 0 1
1 1 0 0 0

4 Theoretical Model of Compound Logic Operators

Theoretical model of compound logic operators is designed contains five types of
Tile, namely Initial Tile, Process Tile, Operation Tile, End Tile and Boundary
Tile. Initial Tile express the start of the self-assembly process and record the first
parameter of compound logic operators. Process Tile is the passing tile, and it is
used to pass the calculation parameter and intermediate result. Operation Tile
is the operational rule tile, and End Tile is the final result tile. Boundary Tile
is used to control the growth direction and array orientation of self-assembly.

4.1 Initial Tile

Initial Tile is used to express the start of the self-assembly process and record
the first parameter of compound logic operators. This type of Tile owns three
stick ends, namely σLU , σRU and σRD . σLU and σRD are responsible for the
connection. When bonding strength is greater than the given parameter, Initial
Tiles are connected by σLU and σRD . σRU is used to transmit the first parameter
and connect Operation Tile. Initial Tile only owns two types. One type expresses
‘0’, and the other expresses ‘1’ (Fig. 2).

Fig. 2. Initial Tile

4.2 Process Tile

The role of Process Tile is the other parameter of compound logic operators
or the store of intermediate result. Process Tile also owns two types. One type
expresses ‘0’, and the other expresses ‘1’. Process Tile owns four stick ends,
namely σLU , σLD , σRU and σRD . When bonding strength is greater than the
given parameter, Process Tiles are connected by σLU and σRD . σLD is used to
receive the intermediate result and the front logic operator and connected with
Operation Tile, and owns six states. The intermediate result is transmitted by
σRU (Fig. 3).
 DNA Self-assembly Model to Solve Compound Logic Operators Problem 7

Fig. 3. Process Tile

4.3 Operation Tile

Two calculation parameters are connected by Operation Tile. In this paper, com-
pound logic operators contain XOR, NOR and NAND, therefore, Operation Tile
owns three types. Operation Tile also owns four stick ends, namely σLU , σLD ,
σRU and σRD . When bonding strength is greater than the given parameter, σLU
and σRD are used to connect two adjacent Operation Tiles. The front parameter
is transmitted by σLD , and the arithmetic is transmitted by σRU (Fig. 4).

Fig. 4. Operation Tile

4.4 End Tile

End Tile marks the end of the operation and outputs the final result. End Tile
only owns two types. End Tile owns three stick ends, namely σLU , σLD and
σRD . σLU and σRD play an role in connecting End Tiles. σLD is used to receive
the final result of compound logic operators (Fig. 5).

Fig. 5. End Tile

4.5 Boundary Tile

Boundary Tile is used to control the growth direction and array orientation of
self-assembly, and is divided into two types. One is Start Boundary Tile which
marks the beginning of a line of tile assembly. The other is End Boundary Tile
which marks the end of a line of tile assembly. The role of all of their stick ends
is the connection (Figs. 6 and 7).
8 S. Zhou et al.

Fig. 6. Start Boundary Tile

Fig. 7. End Boundary Tile

5 The Model Instance of Compound Logic Operators

In this paper, a model instance of compound logic operators is given as so to
illustrate the correctness of the self-assembly model. The model of compound
logic operators is used to calculate 110010 ⊕ 011001 ∧ 110011 ∨ 001010. Five
kinds of tile in accordance with a certain number mix into the mix pool. They
can react automatically, and do not need any manual intervention. Figures 8, 9
and 10 show the bottom-up process. Figure 8 shows the self-assembly process of
XOR operation, and Fig. 9 shows the self-assembly process of NAND operation.
Figure 10 shows the self-assembly process of NOR operation.

Fig. 8. Self-assembly of XOR operation

DNA Self-assembly Model to Solve Compound Logic Operators Problem 9

Fig. 9. Self-assembly of NAND operation

Fig. 10. Self-assembly of NOR operation

10 S. Zhou et al.

6 Conclusions
In this paper, DNA self-assembly model of logic operators is designed. According
to the characteristic of the compound operators, we design five types of DNA
Tiles which meet the needs of computation, namely Initial Tile, Process Tile,
Operation Tile, End Tile and Boundary Tile. We demonstrate the process of self-
assembly by an instance. The computation time that the final result is gotten is
linear, and the model can greatly control the complexity of computation. How
to use membrane computing strategy, such as [14–18] to develop DNA based
computing models is a worthy research direction.

Acknowledgments. This work is supported by the National Natural Science Founda-

tion of China (Nos. 61402066, 61402067, 61572093), the Project Supported by Scientific
Research Fund of Liaoning Provincial Education Department (No. L2014499).

References
1. Rasmus, L., Matthew, R., Andrew, P.: A novel DNA computing based encryption
and decryption algorithm. Theor. Comput. Sci. 632, 43–73 (2016)
2. UbaidurRahman, N., Balamurugan, C., Mariappan, R.: A strand graph semantics
for DNA-based computation. Procedia Comput. Sci. 46, 463–475 (2015)
3. Ullah, A., D’Addona, D., Arai, N.: DNA based computing for understanding com-
plex shapes. Biosystems 117, 40–53 (2014)
4. Adleman, L.M.: Molecular computation of solutions to combinatorial problems.
Science 266(5187), 1021–1024 (1994)
5. Hossein, E., Majid, D.: Application of DNA computing in graph theory. Artif.
Intell. Rev. 38(3), 223–235 (2012)
6. Winfree, E., Liu, F., Wenzler, L., Seeman, N.: Design and self-assembly of two-
dimensional DNA crystals. Nature 394(6693), 539–544 (1998)
7. Mao, C.D., LaBean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using
algorithmic self-assembly of DNA triple-crossover molecules. Nature 407, 493–496
(2000)
8. Zhao, J., Qian, L., Liu, Q., Zhang, Z., He, L.: DNA addition based on linear self-
assembly. Chin. Sci. Bull. 51(21), 2485–2489 (2006). (in Chinese)
9. Zhang, X.C., Wang, Y.F., Chen, Z.H.: Arithmetic computation using self-assembly
of DNA tiles: subtraction and division. Prog. Nat. Sci. 19(3), 377–388 (2009)
10. Fang, X., Lai, X.: DNA subtraction modular arithmetic based on linear self-
assembly. Chin. Sci. Bull. 55(10), 957–963 (2010). (in Chinese)
11. Zhang, C., Yang, J., Xu, J.: Molecular logic computing model based on self-
assembly of DNA nanoparticles. Chin. Sci. Bull. 56(33), 3566–3571 (2011)
12. Yu, Y., Lu, J., Wang, D., Pei, H., Fan, C.: DNA/RNA based logic gates and
computing. Chin. Sci. Bull. 58(2), 131–140 (2013). (in Chinese)
13. Bi, S., Yue, S., Wu, Q., Ye, J.: Initiator-catalyzed self-assembly of duplex-looped
DNA hairpin motif based on strand displacement reaction for logic operations and
amplified biosensing. Biosens. Bioelectron. 83, 281–286 (2016)
14. Song, T., Pan, L.: Spiking neural P systems with request rules. Neurocomputing
193(12), 193–200 (2016)
15. Song, T., Liu, X., Zhao, Y., Zhang, X.: Spiking neural P systems with white hole
neurons. IEEE Trans. Nanobiosci. (2016). doi:10.1109/TNB.2016.2598879
 DNA Self-assembly Model to Solve Compound Logic Operators Problem 11

16. Song, T., Pan, Z., Wong, D.M., Wang, X.: Design of logic gates using spiking
neural P systems with homogeneous neurons and astrocytes-like control. Inf. Sci.
372, 380–391 (2016)
17. Wang, X., Song, T., Gong, F., Pan, Z.: On the computational power of spiking
neural P systems with self-organization. Scientific Reports. doi:10.1038/srep27624
18. Shi, X., Wu, X., Song, T., Li, X.: Construction of DNA nanotubes with controllable
diameters and patterns by using hierarchical DNA sub-tiles. Nanoscale. doi:10.
1039/C6NR02695H
Another random document with
no related content on Scribd:
 (3.) Brooklyn.

(4.) Queens, consisting of that portion of Queens County to

be incorporated into the Greater New York.

(5.) Richmond, that is, Staten Island.

Power is given to the Municipal Assembly to subdivide these

Boroughs still further, in case of need. The Greater New York
will start with these five Boroughs for administrative
purposes. Your Committee have reconstructed the Borough
system, as submitted in the tentative draft, upon lines which
we are of one accord in believing to be a better and more
appropriate development of the plan for the Greater New York.
These lines give to each Borough various boards through which
the prosecution of local improvements may be facilitated
within the limits of small districts, but reserve to the
Municipal Assembly the right to incur indebtedness and to
authorize the making of contracts."

The draft thus prepared was subjected to criticism in the

commission and in public hearings, and, after amendment and
revision, was reported to the Legislature in February, 1897,
as the charter recommended by the Commission for the
consolidated city called "The Greater New York." It received
some amendment and was passed. On submission, as required by
the State constitution, to the mayors of New York and Brooklyn
and the mayor and Common Council of Long Island City, it was
approved in Brooklyn and Long Island City, but returned
without approval by the mayor of New York. The Legislature
then re-enacted the bill, and it was made law, by the
governor's signature, on the 4th of May, 1897.

NEW YORK CITY: A. D. 1897 (September-November).

Election of the first Mayor of Greater New York.
The first municipal election in Greater New York excited a
passion of interest that was natural in the city itself, but
extraordinary in the degree and the extent to which it spread,
not only throughout the United States, but widely in the
foreign world. The election was looked upon as the test of a
vastly important experiment in the democratic government of an
enormous city. The charter of the great consolidated
municipality had lodged tremendous, unprecedented power and
responsibility in the office of its mayor. The people were
given an opportunity to determine by a single act of suffrage—
by their choice of a single man—the character of their
government. Would they choose that man, at the beginning of
the new system, in the interest of the corrupting organization
in party politics which had misruled the old city of New York
for years, or would they rise to the grand opportunity
afforded them, and set a strong, free, independently honest
man at the head of their local government. Democracy in
municipal affairs, at least, had never been put on trial so
sharply before. To a great number of the citizens of New York
the duty of the hour was plain, and they promptly set their
hands to it. Many months before the election they began the
organization of a Citizens' Union, in which men of all
political parties, sinking every other difference, should join
for the defeat of Tammany and "Boss" Croker, and for the
election to the mayor's office of the best mayor to be found.
With remarkable unanimity, their thought of the man turned to
Seth Low, President of Columbia University, but one time mayor
of Brooklyn, where his vigor, his firmness and his
independence had been conspicuously proved. An extensive
canvass of the city showed so widely spread a feeling in favor
of Mr. Low that he was named at the beginning of September as
the candidate of the non-partisan Citizens' Union. It was
hoped that the whole opposition to Tammany Hall could be
united in support of Mr. Low, representing as he did no
partisan hostility to any organization in national or state
politics. It was especially hoped and believed that the
Republican party organization would endorse the choice of the
 Citizens' Union and make Mr. Low (himself a strong Republican)
its own candidate. By nothing less than a general combination
could the compact forces of Tammany Hall be overcome, and that
fact was well understood.
{324}
It was a fact so plain, indeed, that when the head of the
Republican organization in New York persisted in setting a
party candidate in the field, to divide the opposing voters of
the city, there seemed to be small doubt of the intention with
which it was done. The master politicians of the party were
evidently more willing that the vast powers of the mayoralty,
in the organization of the government of Greater New York,
should be wielded by their prototypes of Tammany than that
they should be given to independent hands. The party was
obedient to them, and General Benjamin F. Tracy was put
forward, by a Republican convention held September 28, in
opposition to Mr. Low. The night previous, another candidate
had appeared, in the person of Mr. Henry George, author of the
economic doctrine of the "single tax," supported ardently by a
large following, especially in the Democratic party. A section
of that party, organized under the name of the United Democracy,
had nominated Mr. George, and his nomination was endorsed a
week later by a great assembly which claimed to represent the
Jeffersonian Democracy of New York. On the 30th of September
the nomination of the Tammany Democracy was given to Judge
Robert A. Van Wyck. Between these four principal candidates,
the result of the election was only put in doubt by some
question as to the strength of the Democratic vote which Mr.
George would draw away from Judge Van Wyck. It was a question
extinguished sadly, three days before the election, by the
sudden death of Mr. George. He had not been in good health,
and the strain of the exciting canvass broke him down. His
followers made a hasty nomination of his son, Henry George,
Jr., in his place; but the personal prestige which might have
carried a large vote with them was lost. Of the triumph of
Tammany there was no longer any doubt, and no surprise was
felt (though abundant grief and anger found expression) when
 the returns of the voting on November 2d were announced. Judge
Van Wyck was elected by the ballots of 233,997 citizens, against
151,540 cast for Mr. Low, 102,873 for General Tracy, 21,693
for the younger Mr. George. Tammany would have been beaten if
the Republican vote had gone to Mr. Low. Besides the four
principal candidates here named, there were four other
nominees who received small numbers of votes. Lucien Sanial,
put forward by the Social Democrats, received 14,467; William
T. Wardwell, named by the Prohibitionists, received 1,359;
Patrick J. Gleason and Alfred B. Cruikshank, running with
little more than some personal support, received a few
hundreds of votes each.

NEW YORK CITY: A. D. 1899 (April-December).

The Mazet Investigation.

An investigation of charges against the city government, by a

committee of the Legislature, Mr. Robert Mazet, chairman, was
opened in April, 1899, the examination of witnesses being
conducted by Mr. Frank Moss. The investigation followed lines
much the Same as those pursued by the Lexow committee, in
1894, and revealed much the same foul state of things,
especially in the department of police. But there was
evidently less earnestness in the committee; the probing of
iniquities was fill less thorough, and the whole proceeding
was stopped with suspicious suddenness as soon as it drew near
to prominent members of the party by which it was controlled.
It called fresh attention to the rottenness in municipal
politics, and it led to the creation of a new commission for
the revision of the Greater New York charter; but otherwise it
was most unsatisfactory.

NEW YORK CITY: A. D. 1899-1900.

The Ramapo Water Contract.

In August, 1899, Bird S. Coler, Controller of the City,

exposed a gigantic scheme of plunder involved in a contract
 with the Ramapo Water Company, which Tammany officials,
assisted, it was said, by some interested Republicans, were
attempting to crowd through the Board of Public Improvements.
The contract would have bound the city for forty years to pay
to the Ramapo Company $70 per million gallons for 200,000,000
gallons of water daily. In his Message to the State
Legislature, January 2, 1901, Governor Odell thus referred to
the matter: "Under chapter 985 of the laws of 1895, as
amended, the Ramapo Water Company was given the power of
condemnation for the purpose of securing to it the water and
lands necessary for its purposes. During the year 1899 an
attempt was made to enter into a contract with this company by
the municipal board empowered to make such contracts. This
proposition, when presented to the citizens of New York, was
severely criticised by them, and the question of continued
municipal ownership of their water supply was thus brought to
their attention. The Legislature of 1900 enacted a law which
made the consummation of such a contract impossible without
the unanimous consent of those empowered to make such
contract. The ownership of water rights sufficient to provide
the city of New York with an ample supply of pure and
wholesome water should be entirely under the control and
direction of the municipality." Action on the subject was
taken by the Legislature, which, in March, repealed the Act of
1895, thus stripping the Ramapo Company of its extraordinary
powers.

NEW YORK CITY: A. D. 1900 (January-September).

The Rapid Transit Tunnel Contract.
Projected Tunnel to Brooklyn.

"The great project of underground rapid transit is now an

assured thing. A few months ago the prospect seemed very dark.
It is true that the rapid transit commissioners, a very able
and upright body of men, with the invaluable aid of a
distinguished engineer, Mr. Parsons, had a good while ago
decided on the route and the plans; but the way seemed blocked
 by a series of semi-political and semi-legal difficulties. …
Suddenly these difficulties began to disappear. … The
financial plan adopted was that the city should provide the
money which a contractor would expend in building the road,
the contractor following the plans furnished by the city,
submitting to municipal inspection, and agreeing upon his part
to pay the interest on the bonds sold by the city to obtain
the money, and also to pay enough into a sinking fund to
provide for the ultimate redemption of the bonds. Bids were
called for on November 15, to be opened on January 15. … It
turned out that two well-known contractors were the only
bidders, and the award was given to Mr. John B. McDonald. His
bid was $35,000,000. The theory of this contract is that the
road is to be the property of the city, leased for fifty years
to the contractor, who is to pay a rental that will be large
enough so that the taxpayers will not have expended a penny. …
{325}
The main trunk line will start at the post-office (City Hall
Square) on the south and proceed northward along the spine of
Manhattan Island, following the general direction of Broadway
to Kingsbridge, a distance from the point of beginning of
twelve or thirteen miles. Near the upper end of Central Park,
at a distance of six or seven miles from the point of
beginning, a branch of the tunnel road will take a
northeasterly direction, terminating at Bronx Park, which is
about the same distance north as Kingsbridge, but several
miles further east. The road will have four tracks for six
miles of main line, two of which will be used for local trains
and two for express trains."

American Review of Reviews,

February, 1900.

Work on the great undertaking was begun promptly, and had made
great progress within the first twelve months.

In September, 1900, preliminary steps were taken toward the

construction of a connecting tunnel, under the East River, to
Brooklyn, and through the congested districts of the latter
borough. "At least three years will be necessary for the
preliminary work and actual construction before trains are
running. … Tentative estimates have been made, and these are
said to be from $8,000,000 to $10,000,000. … The route as
contemplated … starts in connection with the Manhattan
proposed tunnel at a point at or near the intersection of
Broadway and Park Row; thence under Broadway and Bowling Green
to Whitehall Street; under Whitehall Street to South Street;
thence under South Street to the East River, and under the
river, striking the Brooklyn shore at a point in Joralemon
Street between the East River and Furman Street, under
Joralemon Street to Fulton Street, to the Borough Hall, out
Fulton Street to Flatbush Avenue, and under this thoroughfare
to the railroad station. On the New York side the route
includes a loop to be built whose debouching point shall lie
between Bowling Green and Exchange Place in Broadway, running
under Broadway to Bowling Green, and thence under Bowling
Green to State Street, to and under Battery Park to Whitehall
Street, thence returning under Whitehall Street and Battery
Park to State Street and to Broadway. The construction calls
for two tracks, and avoids all grade crossings, each track to
have a separate tubular tunnel."

New York Times,

September 28, 1900.

On the 25th of January, 1901, announcement was published that

the Board of Rapid Transit Commissioners had adopted a
resolution definitely providing for the extension of the Rapid
Transit Railroad to Brooklyn. The original plan of route in
Brooklyn had been chosen. The only change made was in
Manhattan. The trains would be run through State St. instead
of Whitehall, as formerly planned, with a loop at the Battery
for Manhattan trains.
NEW YORK CITY: A. D. 1900 (April-May).
Ecumenical Conference on Missions.

See (in this volume)

MISSIONS.

NEW YORK CITY: A. D. 1900 (June).

Great fire at the Hoboken piers.

See (in this volume)

HOBOKEN.

NEW YORK CITY: A. D. 1900-1901.

Revision of the charter.

Carefully as the Greater New York charter had been drawn, it

proved unsatisfactory in the working, in various respects, and
a commission to revise it was appointed in 1900. The report of
the commission was submitted to the Governor on the 1st of
December, and transmitted, with his approval, to the
Legislature in the following month. In the hands of the
Legislature, the bill embodying the revised charter underwent
considerable amendment, very much, it would seem, to its
detriment. It was passed by the Senate on the 3d of April and
by the Assembly on the 4th, and went to the Mayor of New York
for the submission to his judgment which the State
Constitution of New York requires. Some of the more important
changes in the charter made by the revision, as passed, are
the shortening of the mayor's term of office from four years
(which the revision commission had advised retaining) to two
years, with eligibility for re-election (which the commission
had advised against); an increase of the administrative powers
of the presidents of boroughs; abolition of the municipal
Council and creation of a Board of Aldermen of 73 members;
reorganization of various departments of the municipal
administration.
NEW YORK CITY: A. D. 1901 (March).
Offered gift of $5,200,000 to the Public Library
by Andrew Carnegie.

See (in this volume)

LIBRARY, NEW YORK PUBLIC.

NEW YORK STATE: A. D. 1894.

The revised Constitution.

See (in this volume)

CONSTITUTION OF NEW YORK.

NEW YORK STATE: A. D. 1896-1897.

Passage of the Raines Liquor Law.

An Act for the regulation of the liquor traffic, which was and
is the subject of much controversy, was passed in March, 1896,
by the Legislature of the State of New York. From its author,
Senator John Raines, it has borne the name of the Raines Law.
It heavily increased the tax on the selling of liquor, raising
it to $800 on common "saloons" in the city of New York; to $650
in Brooklyn; to $500 in other cities having more than 50,000
and not more than 500,000 inhabitants; and to rates in lesser
cities and towns which ranged from 8100 to $350. It forbade
the licensing of any liquor shop within 200 feet of a
schoolhouse or a church, and also forbade the opening of any
new shop of that character in a residence district without
consent of two-thirds of the property owners. It prohibited
the sale of liquor on Sundays, except in hotels and clubs; but
this provision furnished a means of evasion which was speedily
brought into use. "Raines hotels" and "Raines Clubs," as they
were called, sprang into existence everywhere, sufficiently
answering the requirements of the law to escape its penalties.
These and other defects were considerably remedied by
amendments of the Act in April, 1897. It survived a powerful
attack in the Legislature at that time, the whole strength of
 the leading cities in the State being brought against the law.
The country districts were generally united in supporting it,
partly on principle, and partly because of the extent to which
it lightened the burdens of taxation. By apportioning
two-thirds of the enormous revenue raised under the Act to the
towns, counties and cities in which it is collected, and
one-third to the state treasury, the Raines Law fortified
itself strongly in more than the moral sentiment of the
people. Under the Raines Law all local excise boards are
abolished, and the whole licensing and regulating of the
liquor traffic is placed under the supervision of a State
commissioner.

NEW YORK STATE: A. D. 1897.

The Black Civil Service Law.

See (in this volume)

CIVIL SERVICE REFORM: A. D. 1897-1899.

{326}

NEW YORK STATE: A. D. 1898.

Primary Election Law.

An Act which aims to make the political party caucus for

nominating candidates, and for choosing delegates to
nominating conventions, a "primary election," conducted under
strict regulations of law and guarded by registration, was
passed by the New York State Legislature and signed by the
Governor March 23, 1898.

NEW YORK STATE: A. D. 1899.

New Civil Service Enactment.

See (in this volume)

CIVIL SERVICE REFORM: A. D. 1897-1899.
NEW YORK STATE: A. D. 1899 (May).
Taxation of public franchises.

A measure of great importance, introducing a new and eminently

just principle in taxation, was carried through the
Legislature of New York in May, by the energetic influence of
Governor Roosevelt. Recommended by the Governor in a special
message on the 27th of March and passed in an unsatisfactory
form, a bill to provide for the taxing of public franchises
which did not promise successful working was being left on his
hands when the Legislature adjourned. He promptly called a
special session and renewed to it his urgent recommendations.
"I recommend," he said, "the enactment of a law which shall
tax all these franchises as realty, which shall provide for
the assessment of the tax by the Board of State Tax
Commissioners, and which shall further provide that from the
tax thus levied for the benefit of each locality, there shall
be deducted the tax as now paid by the corporation in
question. Furthermore, as the time for assessing the largest
and wealthiest corporations, those of New York and Buffalo,
has passed for this year, and as it will be preferable not to
have the small country corporations taxed before the larger
corporations of the city are taxed, I suggest that the
operations of the law be deferred until October 1, of this
year."

Within a few days, the desired bill was passed by both Houses
of the Legislature, signed by the Governor and became a law.
The public franchises to which it relates are defined in its
first section, as follows:

"The terms 'land,' 'real estate,' and 'real property,' as used

in this chapter, include the land itself above and under
water, all buildings and other articles and structures,
substructures, and superstructures, erected upon, under or
above, or affixed to the same; all wharves and piers,
including the value of the right to collect wharfage, cranage,
 or dockage thereon; all bridges, all telegraph lines, wires,
poles, and appurtenances; all supports and inclosures for
electrical conductors and other appurtenances upon, above, and
underground; all surface, underground, or elevated railroads,
including the value of all franchises, rights, or permission
to construct, maintain, or operate the same in, under, above,
on, or through streets, highways, or public places; all
railroad structures, substructures, and superstructures,
tracks, and the iron thereon, branches, switches, and other
fixtures permitted or authorized to be made, laid, or placed
on, upon, above, or under any public or private road, street,
or grounds; all mains, pipes, and tanks laid or placed in,
upon, above, or under any public or private street or place
for conducting steam, heat, water, oil, electricity, or any
property, substance or product capable of transportation or
conveyance therein, or that is protected thereby, including
the value of all franchises, rights, authority, or permission
to construct, maintain, or operate in, under, above, upon, or
through any streets, highways, or public places, any mains,
pipes, tanks, conduits, or wires, with their appurtenances,
for conducting water, steam, heat, light, power, gas, oil, or
other substance, or electricity for telegraphic, telephonic,
or other purposes; all trees and underwood growing upon land,
and all mines, minerals, quarries, and fossils in and under
the same, except mines belonging to the state. A franchise,
right, authority, or permission, specified in this
subdivision, shall, for the purpose of taxation, be known as a
special franchise. A special franchise shall be deemed to
include the value of the tangible property of a person,
co-partnership, association, or corporation, situated in,
upon, under, or above any street, highway, public place, or
public waters in connection with the special franchise. The
tangible property so included shall be taxed as a part of the
special franchise."

NEW YORK UNIVERSITY:

The Hall of Fame for Great Americans.
 See (in this volume)
HALL OF FAME.

----------NEW ZEALAND: Start--------

NEW ZEALAND: A. D. 1891-1900.

Democratic experiments.
Labor laws and the land system.
Compulsory industrial arbitration and its working.

"I have been a studious observer of every phase of social life

and legislative change that has taken place in this colony
during the past seven years," wrote U. S. Consul Connolly, at
Auckland, in July, 1896. "I arrived at the very beginning of
the experimental era—and it is no misnomer to call much of the
legislation of the past few years experimental in the truest
sense [see, also (in this volume), AUSTRALIA: RECENT
EXTENSIONS OF DEMOCRACY]. But while it is so, there is a most
gratifying feature which compensates for the violence done to
the feelings of those whose motto has been 'let us permit
matters to remain as they are, they suit us well enough.' That
the legislative innovations of the immediate past have shocked
the sensibilities of a large number of prominent and
well-to-do colonists is unquestionably true, but, at the same
time, as against any inconvenience they may have experienced
on this account, there is the fact of increased prosperity in
nearly every branch of trade and industrial life throughout
the country, farm products are fetching satisfactory prices,
manufacturing industries are running full time and paying good
wages and fair interest on the capital invested, labor is
remuneratively employed, interest on money has fallen from 6
and 7 per cent to 4 and 5 per cent (this of itself, is
sufficient to prove that money is abundant). Millions of
English capital are flowing in for the development of the gold
fields of the colony, and the credit of the country at no
period of its history stood so high on the English market as
 it does to-day.
{327}
I may also mention that, through the genuine encouragement
given by the Government to the small-farmer class, the waste
lands of the country are being rapidly taken up wherever land
is found suitable for farming or grazing purposes.
Notwithstanding the admitted prosperity of the colony and the
fact that the Government have had a substantial surplus over
expenditure now for a number of years, the national debt
continues to increase. But the increased indebtedness is not
of the usual character, for the reason that the country has
security for nearly all the money borrowed in recent years.
Money had to be borrowed under Government guaranty to save the
Bank of New Zealand from closing its doors. This was done to
avert financial disaster. …

"Money has been borrowed to purchase large estates for the

purposes of settlement. Those who take up land under this
system, as already stated, pay an annual rental sufficient to
cover the interest on the purchase money and the cost of
administration. The land is always vested in the Government
and this must be regarded as a good asset. One million and a
Half sterling was borrowed last year in England at 3 per cent
per annum. This £1,500,000 loan is called the ' advances to
settlers loan.' This money is lent out to farmers at 4 per
cent per annum. … I need scarcely add that the large
landholders, the mortgage companies, and the money lenders
generally did not favor this kind of legislation, particularly
the cheap advances to settlers, but their opposition was utterly
futile. With the advent of the one-man-one-vote and the
extension of the franchise to women, the power of corporate
wealth in this country appears to have been irrevocably
destroyed. Whether this be for good or evil, I am not, of
course, in a position to say. I can say, however, that no ill
effects of the change are apparent up to the present; on the
contrary, the country is more prosperous and at least as
honestly and as economically administered as it was under the
old régime.

"To say that this country is, in my opinion, more truly

democratic than any country in the world would be merely
stating a simple truth; and to say that the present Government
is a workingman's Government is equally true. A great deal of
the legislation of recent years, however, is in advance of the
requirements and ideas of the people, with the result that
some of it has proved to be annoying and irksome to many. This
is especially true of some of the labor laws. The Government
are honestly endeavoring to place the masses in possession of
their legitimate rights with as little friction as possible,
and at the same time with due regard to vested interests and
the propriety of things generally. But while struggling thus
with the duties and responsibilities of their official
positions, the members of the Ministry are torn asunder by the
clamorous and impracticable demands of the unreasonable and
irresponsible. The sympathies of the Government are
unmistakably with the people, but the honor, the dignity, and
the welfare of the country will not permit them to depart from
a course too inconsistent with the sense of obligation, fair
dealing, integrity, and responsibility which are the admitted
characteristics and duty of all civilized governments. The
great danger at the present moment is too much legislation in
one direction. This is the one thing wherein the Government
find it really hard to resist the demands of organized labor.
There is, however, a very gratifying disposition manifesting
itself among the more reasonable members of the labor
societies to let well enough alone for the present—a
disposition it is much to be hoped may extend throughout the
whole body of the workers. If not, I have no hesitation in
predicting a serious revulsion of public sentiment and
sympathy within the next few years."

United States Consular Reports,

January, 1897, page 35.
"Australian experience seems in many ways to prove the value
of our system of written constitutions, to be construed and
enforced by the courts. The effect on the minds of
ill-informed legislators of the knowledge that they can do
anything for which they can get a majority, is naturally to
beget extravagance and an overweening sense of power, and lead
to excessive experimentation. … It is in devices for the
protection of labor that most of this experimentation occurs.
New Zealand affords the best example of it. It provides
elaborate legal protection for the eight-hour day. A workman
cannot consent to work overtime without extra pay. The state
sees that he gets the extra pay. It looks closely after the
condition of women and children in the factories. It sees that
servant girls are not overcharged by the registry offices for
getting them places. It prescribes one half-holiday a week for
all persons employed in stores and offices, and sees that they
take it. It will not allow even a shopkeeper who has no
employees to dispense with his half-holiday; because if he
does not take it, his competition will injure those who do.
The 'labor department' of the government has an army of
inspectors, who keep a close watch on stores and factories,
and prosecute violations of the law which they themselves
discover. They do not wait for complaints; they ferret out
infractions, so that the laborer may not have to prejudice
himself by making charges. The department publishes a
'journal' once a month, which gives detailed reports of the
condition of the labor market in all parts of the colony, and
of the prosecutions which have taken place anywhere of
employers who have violated the law. It provides insurance for
old age and early death, and guarantees every policy. It gives
larger policies for lower premiums than any of the private
offices, and depreciates the private offices in its documents.
It distributes the profits of its business as bonuses among the
policy-holders, and keeps a separate account for teetotalers,
so that they may get special advantages from their abstinence.
The 'journal' is, in fact, in a certain sense a labor manual,
in which everything pertaining to the comfort of labor is
 freely discussed. The poor accommodation provided for servants
in hotels and restaurants is deplored, and so is the
difficulty which middle-aged men have in finding employment.
More attention to the morals and manners of nursemaids is
recommended. All the little dodges of employers are exposed
and punished. If they keep the factory door fastened, they are
fined. If housekeepers pretend that their servants are
lodgers, and therefore not liable to a compulsory
half-holiday, they are fined. If manufacturers are caught
allowing girls to take their meals in a workshop, they are
fined.

{328}

"As far as I can make out, too, without visiting the country,
there is as yet no sign of reaction against this minute
paternal care of the laborer. The tendency to use the powers
of the government chiefly for the promotion of the comfort of
the working classes, whether in the matter of land settlement,
education, or employment, seems to undergo no diminution. The
only thing which has ceased, or slackened, is the borrowing of
money for improvements. The results of this borrowing have
been so disastrous that the present generation, at least, will
hardly try that experiment again."

E. L. Godkin,
The Australian Democracy
(Atlantic Monthly, March, 1898).

NEW ZEALAND:
Labor Laws.
Compulsory industrial arbitration.

"There is not in any other country in the world a more

valuable or more enlightened body of Labour laws than those
now upon the statute book of this progressive colony. They
cover almost every risk to life, limb, health, and interest of
the industrial classes. They send the law, as it were,
everywhere a worker is employed for daily wages to fling the
shield of the state over him or her in the labour of
livelihood. The bare enumeration of these laws will indicate
the far-reaching ground they cover:—The Coal Mines Act, the
Master and Apprentices Act, the Conspiracy Law Amendment Act,
the Trade Union Act, the Servant's Registry Offices Act (for
the protection of servant girls against the risks of dishonest
offices of that kind), Contractors and Workmen's Lien Act,
three amended Employer's Liability Acts, three amended
Shipping and Seamen's Acts, two Shops and Shop-assistants
Acts, the Factories Act, and the Industrial Conciliation and
Arbitration Act of 1894. … The Industrial Conciliation and
Arbitration Act, passed in 1894 … has attracted much attention
outside New Zealand. An Act with a similar purpose, but
permissive in its operations, was passed … in the New South
Wales Legislature in 1892. It was limited in duration to four
years, and was not a success. The New Zealand bill was more
skilfully drawn, and, possessing the element of a gentle
compulsion, has so far achieved its aim. The Act begins by
inviting all parties to join 'in lawful association for the
purpose of protecting or furthering the interests of employers
or workmen in, or in connection with, any industry in the
colony.' Such parties as accept the legal invitation are
allowed to register themselves as 'an industrial union,' and
this step once taken they are enticed on through a network of
solicitations, provisions, and safeguards, until they find
themselves, almost without knowing it, agreeing to everything
that follows. Trades Unions, or any other labour organization,
or any combination of employers, can register as individual
bodies without a mixed association of workers and employers.
Once registered, they are in the network of arbitration:—'The
effect of registration shall be to render the industrial
union, and all persons who may be members of any society or
trade union, so registered as an industrial union at the time
of registration, or who after such registration may become
members of any society or trade union so registered, subject
to the jurisdiction by this Act given to a Board and the Court
respectively, and liable to all the provisions of this Act,
and all such persons shall be bound by the rules of the
industrial union during the continuance of the membership.' …
'Every industrial agreement duly made and executed shall be
binding on the parties thereto, and on every person who at any
time during the term of such agreement is a member of any
industrial union, trade union, or association party thereto,
and on every employer who shall in the prescribed manner
signify to the Registrar of the Supreme Court where such
agreement is filed concurrence therein, and every such
employer shall be entitled to the benefit thereof, and be
deemed to be a party thereto.' … 'In and for every district
there shall be established a Board of Conciliation, to have
jurisdiction for the settlement of industrial disputes
occurring in such district, which may be referred to it by one
or more of the parties to an industrial dispute, or by
industrial agreement.' … 'Every Board shall consist of such
equal number of persons as the Governor may determine, being
not more than six nor less than four persons, who shall be
chosen by the industrial unions of employers and of workmen in
the industrial district respectively, such unions voting
separately, and electing an equal number of such members.' …
Should this body itself be unable to come to a satisfactory
decision it may refer the matter in question to a small
committee of its members fairly representing each side. If a
settlement or reconciliation be unattainable in this way,
either party to the dispute can appeal to the Court of
Arbitration, which is constituted as follows:—'There shall be
one Court of Arbitration for the whole colony for the
settlement of industrial disputes pursuant to this Act. … The
Court shall consist of three members to be appointed by the
Governor, one to be so appointed on the recommendation of the
councils or a majority of the councils of the industrial
associations of workmen in the colony, and one to be so
appointed on the recommendation of the councils or a majority
of the councils of the industrial associations of employers of
the colony.' … 'No recommendation shall be made as to the
third member, who shall be a Judge of the Supreme Court, and
shall be appointed from time to time by the Governor, and
shall be President of the Court.'"

M. Davitt,
Life and Progress in Australasia,
chapter 68.

Honorable W. P. Reeves, lately Agent-General of New Zealand in

England, but who was Minister of Education and Labor in New
Zealand from 1891 to 1896, and who is looked upon as the
principal author of the industrial arbitration laws in that
colony, wrote, during the summer of 1900, on the working of
those laws, in an article contributed to the "London Express,"
as follows:

"The arbitration law has been in constant use in New Zealand

for about four years and a half. During those years there has
never been a time when there has not been a dispute pending
before one or other of the Conciliation Boards or the Central
Arbitration Court. Writing, as I do, at some distance from
London, I cannot say from memory what the exact number of
disputes finally adjusted has been; but, so far, they cannot
be less than sixty or seventy. Most of these have been
carried, on appeal from some Conciliation Board, to the
Arbitration Court and settled there. In about two cases out of
seven the Conciliation Boards have been able successfully to
arrange the disputes. Even where they have not done so, it by
no means follows that their labors have been useless. Very
often the appeal to the Arbitration Court is merely on one or
two points out of many involved, and the advice of the
Conciliation Board is accepted on the others. Often, too, most
of the parties to a dispute have been ready to accept a board's
suggestions, but it has needed the firm hand of the
Arbitration Court to bring one or two stubborn men to
acquiescence.