Computational Science ICCS 2020 20th International Conference Amsterdam The Netherlands June 3 5 2020 Proceedings Part V Valeria V. Krzhizhanovskaya

Computational Science ICCS 2020 20th
International Conference Amsterdam

The Netherlands June 3 5 2020
Proceedings Part V Valeria V.
Krzhizhanovskaya
Visit to download the full and correct content document:
https://textbookfull.com/product/computational-science-iccs-2020-20th-international-c
onference-amsterdam-the-netherlands-june-3-5-2020-proceedings-part-v-valeria-v-kr
zhizhanovskaya/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
Computational Science ICCS 2020 20th International

Conference Amsterdam The Netherlands June 3 5 2020
Proceedings Part I Valeria V. Krzhizhanovskaya
https://textbookfull.com/product/computational-science-
iccs-2020-20th-international-conference-amsterdam-the-
netherlands-june-3-5-2020-proceedings-part-i-valeria-v-
krzhizhanovskaya/

Proceedings Part IV Valeria V. Krzhizhanovskaya
netherlands-june-3-5-2020-proceedings-part-iv-valeria-v-
krzhizhanovskaya/

Proceedings Part VII Valeria V. Krzhizhanovskaya
netherlands-june-3-5-2020-proceedings-part-vii-valeria-v-
krzhizhanovskaya/
Web Information Systems Engineering – WISE 2020: 21st

International Conference, Amsterdam, The Netherlands,
October 20–24, 2020, Proceedings, Part I Zhisheng Huang
https://textbookfull.com/product/web-information-systems-
engineering-wise-2020-21st-international-conference-amsterdam-
the-netherlands-october-20-24-2020-proceedings-part-i-zhisheng-
Web Information Systems Engineering – WISE 2020: 21st
International Conference, Amsterdam, The Netherlands,
October 20–24, 2020, Proceedings, Part II Zhisheng
Huang
https://textbookfull.com/product/web-information-systems-
engineering-wise-2020-21st-international-conference-amsterdam-
the-netherlands-october-20-24-2020-proceedings-part-ii-zhisheng-
huang/
Computational Science and Its Applications ICCSA 2020

20th International Conference Cagliari Italy July 1 4
2020 Proceedings Part VII Osvaldo Gervasi
https://textbookfull.com/product/computational-science-and-its-
applications-iccsa-2020-20th-international-conference-cagliari-
italy-july-1-4-2020-proceedings-part-vii-osvaldo-gervasi/
Computational Science and Its Applications ICCSA 2020

20th International Conference Cagliari Italy July 1 4
2020 Proceedings Part VI Osvaldo Gervasi
https://textbookfull.com/product/computational-science-and-its-
applications-iccsa-2020-20th-international-conference-cagliari-
italy-july-1-4-2020-proceedings-part-vi-osvaldo-gervasi/

Conference Wuxi China June 11 13 2018 Proceedings Part
II Yong Shi
iccs-2018-18th-international-conference-wuxi-china-
june-11-13-2018-proceedings-part-ii-yong-shi/

Conference Wuxi China June 11 13 2018 Proceedings Part
III Yong Shi
iccs-2018-18th-international-conference-wuxi-china-
june-11-13-2018-proceedings-part-iii-yong-shi/
Valeria V. Krzhizhanovskaya · Gábor Závodszky ·
Michael H. Lees · Jack J. Dongarra ·
Peter M. A. Sloot · Sérgio Brissos ·
João Teixeira (Eds.)
LNCS 12141
Computational
Science – ICCS 2020
20th International Conference
Amsterdam, The Netherlands, June 3–5, 2020
Proceedings, Part V
Lecture Notes in Computer Science 12141
Founding Editors
Gerhard Goos
Karlsruhe Institute of Technology, Karlsruhe, Germany
Juris Hartmanis
Cornell University, Ithaca, NY, USA
Editorial Board Members

Elisa Bertino
Purdue University, West Lafayette, IN, USA
Wen Gao
Peking University, Beijing, China
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Gerhard Woeginger
RWTH Aachen, Aachen, Germany
Moti Yung
Columbia University, New York, NY, USA
More information about this series at http://www.springer.com/series/7407
Valeria V. Krzhizhanovskaya •
Gábor Závodszky Michael H. Lees

• •
Jack J. Dongarra Peter M. A. Sloot

• •
Sérgio Brissos João Teixeira (Eds.)

•
Computational
Science – ICCS 2020
20th International Conference
Amsterdam, The Netherlands, June 3–5, 2020
Proceedings, Part V
123
Editors
Valeria V. Krzhizhanovskaya Gábor Závodszky
University of Amsterdam University of Amsterdam
Amsterdam, The Netherlands Amsterdam, The Netherlands
Michael H. Lees Jack J. Dongarra
University of Amsterdam University of Tennessee
Amsterdam, The Netherlands Knoxville, TN, USA
Peter M. A. Sloot Sérgio Brissos
University of Amsterdam Intellegibilis
Amsterdam, The Netherlands Setúbal, Portugal
ITMO University
Saint Petersburg, Russia
Nanyang Technological University
Singapore, Singapore
João Teixeira
Intellegibilis
Setúbal, Portugal
ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-030-50425-0 ISBN 978-3-030-50426-7 (eBook)
https://doi.org/10.1007/978-3-030-50426-7
LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues
© Springer Nature Switzerland AG 2020

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

(ICCS – https://www.iccs-meeting.org/iccs2020/).
During the preparation for this 20th edition of ICCS we were considering all kinds
of nice ways to celebrate two decennia of computational science. Afterall when we
started this international conference series, we never expected it to be so successful and
running for so long at so many different locations across the globe! So we worked on a
mind-blowing line up of renowned keynotes, music by scientists, awards, a play written
by and performed by computational scientists, press attendance, a lovely venue… you
name it, we had it all in place. Then corona hit us.
After many long debates and considerations, we decided to cancel the physical event
but still support our scientists and allow for publication of their accepted peer-reviewed
work. We are proud to present the proceedings you are reading as a result of that.
ICCS 2020 is jointly organized by the University of Amsterdam, NTU Singapore,
and the University of Tennessee.
The International Conference on Computational Science is an annual conference
that brings together researchers and scientists from mathematics and computer science
as basic computing disciplines, as well as researchers from various application areas
who are pioneering computational methods in sciences such as physics, chemistry, life
sciences, engineering, arts and humanitarian fields, to discuss problems and solutions in
the area, to identify new issues, and to shape future directions for research.
Since its inception in 2001, ICCS has attracted increasingly higher quality and
numbers of attendees and papers, and 2020 was no exception, with over 350 papers
accepted for publication. The proceedings series have become a major intellectual
resource for computational science researchers, defining and advancing the state of the
art in this field.
The theme for ICCS 2020, “Twenty Years of Computational Science”, highlights
the role of Computational Science over the last 20 years, its numerous achievements,
and its future challenges. This conference was a unique event focusing on recent
developments in: scalable scientific algorithms, advanced software tools, computational
grids, advanced numerical methods, and novel application areas. These innovative
novel models, algorithms, and tools drive new science through efficient application in
areas such as physical systems, computational and systems biology, environmental
systems, finance, and others.
This year we had 719 submissions (230 submissions to the main track and 489 to the
thematic tracks). In the main track, 101 full papers were accepted (44%). In the the-
matic tracks, 249 full papers were accepted (51%). A high acceptance rate in the
thematic tracks is explained by the nature of these, where many experts in a particular
field are personally invited by track organizers to participate in their sessions.
vi Preface
ICCS relies strongly on the vital contributions of our thematic track organizers to
attract high-quality papers in many subject areas. We would like to thank all committee
members from the main and thematic tracks for their contribution to ensure a high
standard for the accepted papers. We would also like to thank Springer, Elsevier, the
Informatics Institute of the University of Amsterdam, the Institute for Advanced
Study of the University of Amsterdam, the SURFsara Supercomputing Centre, the
Netherlands eScience Center, the VECMA Project, and Intellegibilis for their support.
Finally, we very much appreciate all the Local Organizing Committee members for
their hard work to prepare this conference.
We are proud to note that ICCS is an A-rank conference in the CORE classification.
We wish you good health in these troubled times and hope to see you next year for
ICCS 2021.
June 2020 Valeria V. Krzhizhanovskaya

Gábor Závodszky
Michael Lees
Jack Dongarra
Peter M. A. Sloot
Sérgio Brissos
João Teixeira
Organization
Thematic Tracks and Organizers

Advances in High-Performance Computational Earth Sciences:
Applications and Frameworks – IHPCES
Takashi Shimokawabe
Kohei Fujita
Dominik Bartuschat
Agent-Based Simulations, Adaptive Algorithms and Solvers – ABS-AAS

Maciej Paszynski
David Pardo
Victor Calo
Robert Schaefer
Quanling Deng
Applications of Computational Methods in Artificial Intelligence and Machine

Learning – ACMAIML
Kourosh Modarresi
Raja Velu
Paul Hofmann
Biomedical and Bioinformatics Challenges for Computer Science – BBC

Mario Cannataro
Giuseppe Agapito
Mauro Castelli
Riccardo Dondi
Rodrigo Weber dos Santos
Italo Zoppis
Classifier Learning from Difficult Data – CLD2

Michał Woźniak
Bartosz Krawczyk
Paweł Ksieniewicz
Complex Social Systems through the Lens of Computational Science – CSOC

Debraj Roy
Michael Lees
Tatiana Filatova
viii Organization
Computational Health – CompHealth

Sergey Kovalchuk
Stefan Thurner
Georgiy Bobashev
Computational Methods for Emerging Problems in (dis-)Information

Analysis – DisA
Michal Choras
Konstantinos Demestichas
Computational Optimization, Modelling and Simulation – COMS

Xin-She Yang
Slawomir Koziel
Leifur Leifsson
Computational Science in IoT and Smart Systems – IoTSS

Vaidy Sunderam
Dariusz Mrozek
Computer Graphics, Image Processing and Artificial Intelligence – CGIPAI

Andres Iglesias
Lihua You
Alexander Malyshev
Hassan Ugail
Data-Driven Computational Sciences – DDCS

Craig C. Douglas
Ana Cortes
Hiroshi Fujiwara
Robert Lodder
Abani Patra
Han Yu
Machine Learning and Data Assimilation for Dynamical Systems – MLDADS

Rossella Arcucci
Yi-Ke Guo
Meshfree Methods in Computational Sciences – MESHFREE

Vaclav Skala
Samsul Ariffin Abdul Karim
Marco Evangelos Biancolini
Robert Schaback
Organization ix
Rongjiang Pan
Edward J. Kansa
Multiscale Modelling and Simulation – MMS

Derek Groen
Stefano Casarin
Alfons Hoekstra
Bartosz Bosak
Diana Suleimenova
Quantum Computing Workshop – QCW

Katarzyna Rycerz
Marian Bubak
Simulations of Flow and Transport: Modeling, Algorithms

and Computation – SOFTMAC
Shuyu Sun
Jingfa Li
James Liu
Smart Systems: Bringing Together Computer Vision, Sensor Networks

and Machine Learning – SmartSys
Pedro J. S. Cardoso
João M. F. Rodrigues
Roberto Lam
Janio Monteiro
Software Engineering for Computational Science – SE4Science

Jeffrey Carver
Neil Chue Hong
Carlos Martinez-Ortiz
Solving Problems with Uncertainties – SPU

Vassil Alexandrov
Aneta Karaivanova
Teaching Computational Science – WTCS

Angela Shiflet
Alfredo Tirado-Ramos
Evguenia Alexandrova
x Organization
Uncertainty Quantification for Computational Models – UNEQUIvOCAL

Wouter Edeling
Anna Nikishova
Peter Coveney
Program Committee and Reviewers
Ahmad Abdelfattah Daniel Berrar Neil Chue Hong

Samsul Ariffin Sanjukta Bhowmick Svetlana Chuprina
Abdul Karim Marco Evangelos Paola Cinnella
Evgenia Adamopoulou Biancolini Noélia Correia
Jaime Afonso Martins Georgiy Bobashev Adriano Cortes
Giuseppe Agapito Bartosz Bosak Ana Cortes
Ram Akella Marian Bubak Enrique
Elisabete Alberdi Celaya Jérémy Buisson Costa-Montenegro
Luis Alexandre Robert Burduk David Coster
Vassil Alexandrov Michael Burkhart Helene Coullon
Evguenia Alexandrova Allah Bux Peter Coveney
Hesham H. Ali Aleksander Byrski Attila Csikasz-Nagy
Julen Alvarez-Aramberri Cristiano Cabrita Loïc Cudennec
Domingos Alves Xing Cai Javier Cuenca
Julio Amador Diaz Lopez Barbara Calabrese Yifeng Cui
Stanislaw Jose Camata António Cunha
Ambroszkiewicz Mario Cannataro Ben Czaja
Tomasz Andrysiak Alberto Cano Pawel Czarnul
Michael Antolovich Pedro Jorge Sequeira Flávio Martins
Hartwig Anzt Cardoso Bhaskar Dasgupta
Hideo Aochi Jeffrey Carver Konstantinos Demestichas
Hamid Arabnejad Stefano Casarin Quanling Deng
Rossella Arcucci Manuel Castañón-Puga Nilanjan Dey
Khurshid Asghar Mauro Castelli Khaldoon Dhou
Marina Balakhontceva Eduardo Cesar Jamie Diner
Bartosz Balis Nicholas Chancellor Jacek Dlugopolski
Krzysztof Banas Patrikakis Charalampos Simona Domesová
João Barroso Ehtzaz Chaudhry Riccardo Dondi
Dominik Bartuschat Chuanfa Chen Craig C. Douglas
Nuno Basurto Siew Ann Cheong Linda Douw
Pouria Behnoudfar Andrey Chernykh Rafal Drezewski
Joern Behrens Lock-Yue Chew Hans du Buf
Adrian Bekasiewicz Su Fong Chien Vitor Duarte
Gebrai Bekdas Marta Chinnici Richard Dwight
Stefano Beretta Sung-Bae Cho Wouter Edeling
Benjamin Berkels Michal Choras Waleed Ejaz
Martino Bernard Loo Chu Kiong Dina El-Reedy
Organization xi
Amgad Elsayed Pedro Guerreiro Jakub Klikowski

Nahid Emad Tobias Guggemos Harald Koestler
Chriatian Engelmann Xiaohu Guo Ivana Kolingerova
Gökhan Ertaylan Piotr Gurgul Georgy Kopanitsa
Alex Fedoseyev Filip Guzy Gregor Kosec
Luis Manuel Fernández Pietro Hiram Guzzi Sotiris Kotsiantis
Antonino Fiannaca Zulfiqar Habib Ilias Kotsireas
Christos Panagiotis Hadjidoukas Sergey Kovalchuk
Filelis-Papadopoulos Masatoshi Hanai Michal Koziarski
Rupert Ford John Hanley Slawomir Koziel
Piotr Frackiewicz Erik Hanson Rafal Kozik
Martin Frank Habibollah Haron Bartosz Krawczyk
Ruy Freitas Reis Carina Haupt Elisabeth Krueger
Karl Frinkle Claire Heaney Valeria Krzhizhanovskaya
Haibin Fu Alexander Heinecke Pawel Ksieniewicz
Kohei Fujita Jurjen Rienk Helmus Marek Kubalcík
Hiroshi Fujiwara Álvaro Herrero Sebastian Kuckuk
Takeshi Fukaya Bogumila Hnatkowska Eileen Kuehn
Wlodzimierz Funika Maximilian Höb Michael Kuhn
Takashi Furumura Erlend Hodneland Michal Kulczewski
Ernst Fusch Olivier Hoenen Krzysztof Kurowski
Mohamed Gaber Paul Hofmann Massimo La Rosa
David Gal Che-Lun Hung Yu-Kun Lai
Marco Gallieri Andres Iglesias Jalal Lakhlili
Teresa Galvao Takeshi Iwashita Roberto Lam
Akemi Galvez Alireza Jahani Anna-Lena Lamprecht
Salvador García Momin Jamil Rubin Landau
Bartlomiej Gardas Vytautas Jancauskas Johannes Langguth
Delia Garijo João Janeiro Elisabeth Larsson
Frédéric Gava Peter Janku Michael Lees
Piotr Gawron Fredrik Jansson Leifur Leifsson
Bernhard Geiger Jirí Jaroš Kenneth Leiter
Alex Gerbessiotis Caroline Jay Roy Lettieri
Ivo Goncalves Shalu Jhanwar Andrew Lewis
Antonio Gonzalez Pardo Zhigang Jia Jingfa Li
Jorge Chao Jin Khang-Jie Liew
González-Domínguez Zhong Jin Hong Liu
Yuriy Gorbachev David Johnson Hui Liu
Pawel Gorecki Guido Juckeland Yen-Chen Liu
Michael Gowanlock Maria Juliano Zhao Liu
Manuel Grana Edward J. Kansa Pengcheng Liu
George Gravvanis Aneta Karaivanova James Liu
Derek Groen Takahiro Katagiri Marcelo Lobosco
Lutz Gross Timo Kehrer Robert Lodder
Sophia Wayne Kelly Marcin Los
Grundner-Culemann Christoph Kessler Stephane Louise
xii Organization
Frederic Loulergue Mai Nguyen Lukasz Rauch

Paul Lu Hoang Nguyen Vishal Raul
Stefan Luding Nancy Nichols Robin Richardson
Onnie Luk Anna Nikishova Heike Riel
Scott MacLachlan Hitoshi Nishizawa Sophie Robert
Luca Magri Brayton Noll Luis M. Rocha
Imran Mahmood Algirdas Noreika Joao Rodrigues
Zuzana Majdisova Enrique Onieva Daniel Rodriguez
Alexander Malyshev Kenji Ono Albert Romkes
Muazzam Maqsood Eneko Osaba Debraj Roy
Livia Marcellino Aziz Ouaarab Katarzyna Rycerz
Tomas Margalef Serban Ovidiu Alberto Sanchez
Tiziana Margaria Raymond Padmos Gabriele Santin
Svetozar Margenov Wojciech Palacz Alex Savio
Urszula Ivan Palomares Robert Schaback
Markowska-Kaczmar Rongjiang Pan Robert Schaefer
Osni Marques Joao Papa Rafal Scherer
Carmen Marquez Nikela Papadopoulou Ulf D. Schiller
Carlos Martinez-Ortiz Marcin Paprzycki Bertil Schmidt
Paula Martins David Pardo Martin Schreiber
Flávio Martins Anna Paszynska Alexander Schug
Luke Mason Maciej Paszynski Gabriela Schütz
Pawel Matuszyk Abani Patra Marinella Sciortino
Valerie Maxville Dana Petcu Diego Sevilla
Wagner Meira Jr. Serge Petiton Angela Shiflet
Roderick Melnik Bernhard Pfahringer Takashi Shimokawabe
Valentin Melnikov Frank Phillipson Marcin Sieniek
Ivan Merelli Juan C. Pichel Nazareen Sikkandar
Choras Michal Anna Basha
Leandro Minku Pietrenko-Dabrowska Anna Sikora
Jaroslaw Miszczak Laércio L. Pilla Janaína De Andrade Silva
Janio Monteiro Armando Pinho Diana Sima
Kourosh Modarresi Tomasz Piontek Robert Sinkovits
Fernando Monteiro Yuri Pirola Haozhen Situ
James Montgomery Igor Podolak Leszek Siwik
Andrew Moore Cristina Portales Vaclav Skala
Dariusz Mrozek Simon Portegies Zwart Peter Sloot
Peter Mueller Roland Potthast Renata Slota
Khan Muhammad Ela Pustulka-Hunt Grazyna Slusarczyk
Judit Muñoz Vladimir Puzyrev Sucha Smanchat
Philip Nadler Alexander Pyayt Marek Smieja
Hiromichi Nagao Rick Quax Maciej Smolka
Jethro Nagawkar Cesar Quilodran Casas Bartlomiej Sniezynski
Kengo Nakajima Barbara Quintela Isabel Sofia Brito
Ionel Michael Navon Ajaykumar Rajasekharan Katarzyna Stapor
Philipp Neumann Celia Ramos Bogdan Staszewski
Organization xiii
Jerzy Stefanowski Nestor Tiglao Maciej Woloszyn

Dennis Stevenson Alfredo Tirado-Ramos Michal Wozniak
Tomasz Stopa Arkadiusz Tomczyk Maciej Wozniak
Achim Streit Mariusz Topolski Yu Xia
Barbara Strug Paolo Trunfio Dunhui Xiao
Pawel Strumillo Ka-Wai Tsang Huilin Xing
Dante Suarez Hassan Ugail Miguel Xochicale
Vishwas H. V. Subba Rao Eirik Valseth Feng Xu
Bongwon Suh Pavel Varacha Wei Xue
Diana Suleimenova Pierangelo Veltri Yoshifumi Yamamoto
Ray Sun Raja Velu Dongjia Yan
Shuyu Sun Colin Venters Xin-She Yang
Vaidy Sunderam Gytis Vilutis Dongwei Ye
Martin Swain Peng Wang Wee Ping Yeo
Alessandro Taberna Jianwu Wang Lihua You
Ryszard Tadeusiewicz Shuangbu Wang Han Yu
Daisuke Takahashi Rodrigo Weber Gábor Závodszky
Zaid Tashman dos Santos Yao Zhang
Osamu Tatebe Katarzyna H. Zhang
Carlos Tavares Calafate Wegrzyn-Wolska Jinghui Zhong
Kasim Tersic Mei Wen Sotirios Ziavras
Yonatan Afework Lars Wienbrandt Italo Zoppis
Tesfahunegn Mark Wijzenbroek Chiara Zucco
Jannis Teunissen Peter Woehrmann Pawel Zyblewski
Stefan Thurner Szymon Wojciechowski Karol Zyczkowski
Contents – Part V
Computational Optimization, Modelling and Simulation
Information Theory-Based Feature Selection: Minimum Distribution

Similarity with Removed Redundancy . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Yu Zhang, Zhuoyi Lin, and Chee Keong Kwoh
On the Potential of the Nature-Inspired Algorithms for Pure

Binary Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Iztok Fister Jr., Iztok Fister, Dušan Fister, Grega Vrbančič,
and Vili Podgorelec
Analytical Techniques for the Identification of a Musical Score:

The Musical DNA. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
Michele Della Ventura
Reduced-Cost Constrained Modeling of Microwave and Antenna

Components: Recent Advances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
Anna Pietrenko-Dabrowska, Slawomir Koziel, and Leifur Leifsson
Aerodynamic Shape Optimization for Delaying Dynamic Stall

of Airfoils by Regression Kriging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
Vishal Raul, Leifur Leifsson, and Slawomir Koziel
Model-Based Sensitivity Analysis of Nondestructive Testing Systems

Using Machine Learning Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
Jethro Nagawkar, Leifur Leifsson, Roberto Miorelli, and Pierre Calmon
Application of Underdetermined Differential Algebraic Equations

to Solving One Problem from Heat Mass Transfer . . . . . . . . . . . . . . . . . . . 84
Viktor F. Chistyakov, Elena V. Chistyakova, and Anatoliy A. Levin
Fully-Asynchronous Fully-Implicit Variable-Order Variable-Timestep

Simulation of Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 94
Bruno Magalhães, Michael Hines, Thomas Sterling,
and Felix Schürmann
Deep Learning Assisted Memetic Algorithm for Shortest Route Problems . . . 109
Ayad Turky, Mohammad Saiedur Rahaman, Wei Shao, Flora D. Salim,
Doug Bradbrook, and Andy Song
A Relaxation Algorithm for Optimal Control Problems Governed

by Two-Dimensional Conservation Laws . . . . . . . . . . . . . . . . . . . . . . . . . . 122
Michael Herty, Loubna Salhi, and Mohammed Seaid
xvi Contents – Part V
Genetic Learning Particle Swarm Optimization with Interlaced

Ring Topology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136
Bożena Borowska
Low Reynolds Number Swimming with Slip Boundary Conditions . . . . . . . . 149

Hashim Alshehri, Nesreen Althobaiti, and Jian Du
Trilateration-Based Multilevel Method for Minimizing

the Lennard-Jones Potential . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 163
Jithin George and Zichao (Wendy) Di
A Stochastic Birth-Death Model of Information Propagation Within

Human Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 176
Prasidh Chhabria and Winnie Lu
A Random Line-Search Optimization Method via Modified Cholesky

Decomposition for Non-linear Data Assimilation. . . . . . . . . . . . . . . . . . . . . 189
Elias D. Nino-Ruiz
A Current Task-Based Programming Paradigms Analysis . . . . . . . . . . . . . . . 203

Jérôme Gurhem and Serge G. Petiton
Radial Basis Functions Based Algorithms for Non-Gaussian Delay

Propagation in Very Large Circuits . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
Dmytro Mishagli and Elena Blokhina
Ant Colony Optimization Implementation for Reversible Synthesis

in Walsh-Hadamard Domain. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 230
Krzysztof Podlaski
COEBA: A Coevolutionary Bat Algorithm for Discrete

Evolutionary Multitasking . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 244
Eneko Osaba, Javier Del Ser, Xin-She Yang, Andres Iglesias,
and Akemi Galvez
Convex Polygon Packing Based Meshing Algorithm for Modeling of Rock

and Porous Media . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 257
Joaquín Torres, Nancy Hitschfeld, Rafael O. Ruiz,
and Alejandro Ortiz-Bernardin
Computational Science in IoT and Smart Systems
Modelling Contextual Data for Smart Environments. Case Study

of a System to Support Mountain Rescuers . . . . . . . . . . . . . . . . . . . . . . . . 273
Radosław Klimek
Contents – Part V xvii
Fuzzy Intelligence in Monitoring Older Adults with Wearables . . . . . . . . . . . 288

Dariusz Mrozek, Mateusz Milik, Bożena Małysiak-Mrozek,
Krzysztof Tokarz, Adam Duszenko, and Stanisław Kozielski
Deep Analytics for Management and Cybersecurity of the National

Energy Grid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 302
Ying Zhao
Regression Methods for Detecting Anomalies in Flue Gas Desulphurization

Installations in Coal-Fired Power Plants Based on Sensor Data . . . . . . . . . . . 316
Marek Moleda, Alina Momot, and Dariusz Mrozek
Autonomous Guided Vehicles for Smart Industries – The State-of-the-Art

and Research Challenges . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 330
Rafal Cupek, Marek Drewniak, Marcin Fojcik, Erik Kyrkjebø,
Jerry Chun-Wei Lin, Dariusz Mrozek, Knut Øvsthus,
and Adam Ziebinski
IoT-Based Cow Health Monitoring System. . . . . . . . . . . . . . . . . . . . . . . . . 344

Olgierd Unold, Maciej Nikodem, Marek Piasecki, Kamil Szyc,
Henryk Maciejewski, Marek Bawiec, Paweł Dobrowolski,
and Michał Zdunek
Visual Self-healing Modelling for Reliable Internet-of-Things Systems . . . . . 357

João Pedro Dias, Bruno Lima, João Pascoal Faria, André Restivo,
and Hugo Sereno Ferreira
Comparative Analysis of Time Series Databases in the Context of Edge

Computing for Low Power Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . 371
Piotr Grzesik and Dariusz Mrozek
Conversational Interface for Managing Non-trivial

Internet-of-Things Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 384
André Sousa Lago, João Pedro Dias, and Hugo Sereno Ferreira
Improving Coverage Area in Sensor Deployment Using

Genetic Algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398
Frantz Tossa, Wahabou Abdou, Eugène C. Ezin, and Pierre Gouton
Object-Oriented Internet Reactive Interoperability . . . . . . . . . . . . . . . . . . . . 409

Mariusz Postół
Impact of Long-Range Dependent Traffic in IoT Local Wireless Networks

on Backhaul Link Performance . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423
Przemyslaw Wlodarski
xviii Contents – Part V
Computer Graphics, Image Processing and Artificial Intelligence
OpenGraphGym: A Parallel Reinforcement Learning Framework for Graph

Optimization Problems. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 439
Weijian Zheng, Dali Wang, and Fengguang Song
Weighted Clustering for Bees Detection on Video Images . . . . . . . . . . . . . . 453

Jerzy Dembski and Julian Szymański
Improved Two-Step Binarization of Degraded Document Images

Based on Gaussian Mixture Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 467
Robert Krupiński, Piotr Lech, and Krzysztof Okarma
Cast Shadow Generation Using Generative Adversarial Networks . . . . . . . . . 481

Khasrouf Taif, Hassan Ugail, and Irfan Mehmood
Medical Image Enhancement Using Super Resolution Methods. . . . . . . . . . . 496

Koki Yamashita and Konstantin Markov
Plane Space Representation in Context of Mode-Based Symmetry

Plane Detection. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 509
Lukáš Hruda, Ivana Kolingerová, and Miroslav Lávička
Impression Curve as a New Tool in the Study of Visual Diversity

of Computer Game Levels for Individual Phases of the Design Process . . . . . 524
Jarosław Andrzejczak, Marta Osowicz, and Rafał Szrajber
Visual Analysis of Computer Game Output Video Stream

for Gameplay Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 538
Kamil Kozłowski, Marcin Korytkowski, and Dominik Szajerman
Depth Map Estimation with Consistent Normals from Stereo Images . . . . . . . 553
Alexander Malyshev
Parametric Learning of Associative Functional Networks Through

a Modified Memetic Self-adaptive Firefly Algorithm . . . . . . . . . . . . . . . . . . 566
Akemi Gálvez, Andrés Iglesias, Eneko Osaba, and Javier Del Ser
Dual Formulation of the TV-Stokes Denoising Model for Multidimensional

Vectorial Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 580
Alexander Malyshev
Minimizing Material Consumption of 3D Printing

with Stress-Guided Optimization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 588
Anzong Zheng, Shaojun Bian, Ehtzaz Chaudhry, Jian Chang,
Habibollah Haron, Lihua You, and Jianjun Zhang
Contents – Part V xix
Swarm Intelligence Approach for Rational Global Approximation

of Characteristic Curves for the Van der Waals Equation of State . . . . . . . . . 604
Almudena Campuzano, Andrés Iglesias, and Akemi Gálvez
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 617

Computational Optimization, Modelling
and Simulation
Information Theory-Based Feature Selection:
Minimum Distribution Similarity
with Removed Redundancy
Yu Zhang , Zhuoyi Lin, and Chee Keong Kwoh(&)
School of Computer Science and Engineering, Nanyang Technological

University, 50 Nanyang Avenue, Singapore 639798, Singapore
{YU007,ZHUOYI001,ASCKKWOH}@ntu.edu.sg
Abstract. Feature selection is an important preprocessing step in pattern

recognition. In this paper, we presented a new feature selection approach in two-
class classification problems based on information theory, named minimum
Distribution Similarity with Removed Redundancy (mDSRR). Different from
the previous methods which use mutual information and greedy iteration with a
loss function to rank the features, we rank features according to their distribution
similarities in two classes measured by relative entropy, and then remove the
high redundant features from the sorted feature subsets. Experimental results on
datasets in varieties of fields with different classifiers highlight the value of
mDSRR on selecting feature subsets, especially so for choosing small size
feature subset. mDSRR is also proved to outperform other state-of-the-art
methods in most cases. Besides, we observed that the mutual information may
not be a good practice to select the initial feature in the methods with subsequent
iterations.
Keywords: Feature selection Feature ranking Information theory

Redundancy
1 Introduction
In many pattern recognition applications, the original dataset can be in a large feature
size and may contain irrelevant and redundant features, which would be detrimental to
the training efficiency and model performance [1, 2]. In order to reduce the undesirable
effect of the curse of dimensionality and to simply the model for parsimony [3], an
intuitive way is to determine a feature subset, and this process is known as feature
selection, or variable selection.
The ideal situation for feature selection is to select the optimal feature subset that
maximize the prediction accuracy, however, this is impractical due to the intractable
computation caused by the exhausted searching over the whole feature space, espe-
cially when the prior knowledge is limited and the dependency among features remains
unknown. Therefore, varieties of suboptimal feature selection algorithms have been
proposed, and they are mainly divided into three categories according to the evaluation
metric: Wrapper, Embedded, and Filter methods [3].
© Springer Nature Switzerland AG 2020

V. V. Krzhizhanovskaya et al. (Eds.): ICCS 2020, LNCS 12141, pp. 3–17, 2020.
https://doi.org/10.1007/978-3-030-50426-7_1
4 Y. Zhang et al.
Both Wrapper and Embedded methods are dependent on the classifiers. Wrapper
methods score the feature subsets via the error rate on a given classifier, and certain
searching strategies are employed to generate the next feature subset to avoid NP-hard
problem [4, 5]. Such kinds of methods take the interactions among features into
consideration and always can find the best subset for a particular learning algorithm,
however, they are computation complex and prone to over-fitting, additionally, the
subset needs to be reselected when changing the classifiers [6, 7]. In the meantime,
embedded methods select the features during the model construction processes and thus
they are more efficient than Wrappers [3], but the main limitation is that they rely
heavily on the hypotheses the classifier makes [6, 8].
Unlike Wrapper and Embedded methods, Filter methods are independent of the
classifiers, therefore they can better expose the relationships among features. Besides,
Filter methods are simpler, faster and more scalable than Wrapper and Embedded
methods, as they rank the features according to the proximity measures, such as the
mutual information (MI) [3], correlation [10], chi-square [11] and relief-based algo-
rithms [12]. The determination of the best feature subset of Filter methods is to select a
cut-off point on their ranked features via the cross validation. But the drawback of Filter
methods is that they cannot investigate the interaction between the features and clas-
sifiers [3, 5].
In Filter methods, information theory-based measure which exploiting not only the
relationships between features and labels, but also the dependencies among features,
plays a dominant role [9, 13]. Battiti [9] proposed Mutual Information Feature
Selection (MIFS) method, which finds feature subset via greedy selection according to
the MI between feature subsets and labels. After that, varieties of methods are presented
to improve MIFS. Kwak and Choi developed MIFD-U method by considering more
about the MI between features and labels [14], Peng et al. proposed minimal-
redundancy-maximal-relevance (mRMR) framework by providing the theoretical
analysis and combining with wrappers [15], Estévez et al. proposed Normalised MIFS
(NMIFS) which replaces the MI with normalized MI [16], and Hoque et al. developed
MIFS-ND by considering both MI of feature-feature and feature-label [17].
Consequently, a lot of information theory-based measures have been designed and
adopted in Filter methods. Joint MI (JMI) [18], Interaction Capping (ICAP) [19],
Interaction Gain Feature Selection (IGFS) [20] and Joint MI Maximisation (JMIM) [7]
were raised by taking the joint MI into consideration, from which ICAP and IGFS
depend on the feature interaction; Conditional MI Maximization (CMIM) criterion
[21], Conditional Infomax Feature Extraction (CIFE) [22] and Conditional MIFS
(CMIFS) [23] were proposed by adopting conditional MI; Double Input Symmetrical
Relevance (DISR) method was developed by using symmetrical relevance as the
objective function [24].
Intuitively, the common procedure for the above information theory related Filter
methods is, selecting the initial feature with maximum MI, then increasing the feature
subset size on previously defined features according to an objective function. There-
fore, the selection of the initial feature will influence the determination of the final
feature subset. As a result, a good initial feature may lead to a smaller feature subset
size as well as a good classification performance. However, the maximum MI between
the features and labels may not be a good criteria to determine the initial feature. We
Information Theory-Based Feature Selection 5
argue that the initial feature found in this way may have a lower classification ability
than many other features, which will further lead to relatively large feature subset size
or a poor performance that actually can be avoided.
In this paper, we proposed a new approach to select feature subset based on
information theory in two-class classification problems, named minimum Distribution
Similarity with Removed Redundancy (mDSRR). Different from previous methods
which use greedy search approach in adding the features into the feature subset, we
rank the features according to their distribution similarity and then remove the
redundancy from the ranked feature subset. Furthermore, we compared mDSRR with
other state-of-the-art methods on 11 public datasets with different classifiers, results
show that mDSRR is superior to other methods, which can achieve high performance
with only a few features. Additionally, by comparing the classification performance
and the initial feature defined by mDSRR and other methods, we demonstrated that
using MI to determine the initial feature may not be a good practice.
This paper is organized as follows: Sect. 2 provides the background of information
theory, theoretical analysis and the implementation of the proposed method, Sect. 3
demonstrates the results of the experiments and discuss the results, and Sect. 4 con-
cludes this work.
2 Methods
2.1 Information Theory

This section briefly introduces the related concepts of information theory that will be
used in this work. Suppose random variables X and Y represent feature vectors, and
random variable C denotes the class label.
The entropy is a measure of the amount of uncertainty before a value of random
variable is known, for a discrete random variable which takes value x from the alphabet
v, i.e. x 2 v, with probability pX(x), the entropy is defined as
X
H ðX Þ ¼ x2X
pX ð xÞlogðpX ð xÞÞ ð1Þ
The entropy is positive and bounded, i.e. 0 H ð X Þ logðj X jÞ. Similarly, when taking
two discrete random variables X and Y and their joint probability p(x, y) into con-
sideration, the joint entropy can be represented as
X X
H ðX; Y Þ ¼ x2X y2Y
pðx; yÞlogðpðx; yÞÞ ð2Þ
The conditional entropy of X given that C is a measure of the average additional

information in X when C is known, which is defined as
XX
H ðXjC Þ ¼ pðx; cÞlogðpðxjcÞÞ ð3Þ
c2C x2X
6 Y. Zhang et al.
where p(x|c) is the conditional probability for x given that c, and according to the chain
rule,
H ðX; C Þ ¼ H ðXjC Þ þ H ðC Þ ð4Þ
Mutual information of X and Y is the average amount of information that we get

about X from observing Y, or in other word, the reduction in the uncertainty of X due
to the knowledge of Y, it is represented as
I ðX; Y Þ ¼ H ð X Þ H ðXjY Þ ¼ H ð X Þ þ H ðY Þ H ðX; Y Þ ð5Þ
The mutual information is symmetrical and non-negative, it equals to 0 only when the
variables are statistically independent. Similarly, the conditional mutual information of
X and Y given that C is represented as
I ðX; YjCÞ ¼ H ðXjCÞ HðXjY; CÞ ð6Þ
Kullback-Leibler divergence, also known as relative entropy, is another important

concept that will be used in this work. It measures the difference between two prob-
ability mass vectors, if we denote the two vectors as p and q, then the relative entropy
between p and q is defined as
X
pð x Þ
DðpjjqÞ ¼ pð xÞlog ð7Þ
x2X
qð x Þ
Obviously, it is asymmetric between p and q.
2.2 Minimum Distribution Similarity Feature Ranking

We try to rank the features according to their distribution similarities between classes to
separate the objects, where the distribution similarity can be measured by the relative
entropy.
Recalling the mathematic representation of relative entropy, Eq. (7) in Sect. 2.1, D
(p||q) represents the “distance” between the probability mass vectors p and q, and it also
can be regarded as the measurement of information loss of q from p. Here, we regard
x as the event representing the instances in one type of feature whose values located in a
certain range, or a small bin, X as the event set, and p and q as the distributions of x for
two classes separately. In this work, we use small bins rather than using the exact value
pð xÞ
of feature, because when q(x) = 0, p(x) 6¼ 0, logðqðxÞÞ ! 1; when p(x) = 0, q(x) 6¼ 0,

pðxÞ log pðxÞ
qðxÞ ¼ 0. Obviously, if there is no overlapped feature values in two classes,

pðxÞ log pðxÞ
qðxÞ would either equal to ∞ or 0, under this circumstance, D(p||q) would
equal to ∞ or 0. It is worth noting that if a large number of features do not have
overlapped values in different classes, all these features would be assigned value of
infinity or zero and we cannot know which one is more important.
Although introducing small bins can solve the above problem, if the bin number is
selected too small, the difference for two classes cannot be captured accurately; if it is
too large, the relative entropy value would tend to be the same as when taking exact
value stated above. Therefore, several choices of bin number determined according to
the corresponding total instance amount are evaluated to select the proper solution here.
Furthermore, since D(p||q) 6¼ D(q||p), we use D = D(p||q) + D(q||p) as the measure to
sort the features.
Another problem is how to deal with the circumstance when D ! ∞ in practical.
In this work, we use qðxÞ ¼ instance number
1
of class II in D(p||q) to replace q(x) = 0 to avoid
D becomes infinity. This practice, although may not so accurate, can reflect the trend of
D. On one side of the spectrum, when the number of total instances in a certain bin is
large, the measure of distribution similarity when there is only one sample of class II in
this bin is almost the same as that when there is no sample of class II, both of the two
circumstance means an extremely low similarity between the distribution for two
classes. At another extreme, when the instance number in a certain bin is small and
there is only samples
of class I in this bin, due to its small sample number, p(x) tends to
pðxÞ
be 0, pðxÞ log qðxÞ would be an extremely small value and would not contain too
much information. Therefore, replacing q(x) = 0 with qðxÞ ¼ instance number 1
of class II in
the practical calculation is rational. This practice can reflect the real distribution sim-
ilarity trend, especially under the truth that this circumstance would not happen too
much with the application of bin. The above algorithm has been briefly described in a
previous work [25].
2.3 Minimum Distribution Similarity with Removed Redundancy

(mDSRR)
In Sect. 2.2, we already got a feature list sorted according to their potential importance
to classification, where the irrelevant features will be ranked in the back. However, the
redundancy may still exist. The combination of the features redundant to each other
may not contribute to higher performance but lead to overfitting. Therefore, removing
redundant features is necessary to improve model’s performance and efficiency Dif-
ferent from previous works which use MI or conditional MI between features and label,
in this work, we consider the conditional MI between features under the condition of
label as the criteria to remove redundancy. In particular, we adopt conditional MI rather
than the MI because according to, features have high mutual information may have
different information within the class, hence taking labels into consideration is
essential.
The complexity to calculate the conditional MI between two features within a
feature set with feature size n is proportional to ðn 1Þ þ ðn 2Þ þ þ 1 ¼ n 2n, as
2
2
the increase of n, the calculation complexity will grow as n . In case of the feature
number is large, it would be impractical to find all conditional MI as the time con-
sumption would be large. Hence, we only calculate the conditional MI for the first m
ranked features.
8 Y. Zhang et al.
From Eq. (4) and (6), we can obtain
I ðX; YjCÞ ¼ H ðXjCÞ H ðXjY; CÞ ¼ H ðXjC Þ H ðX; YjC Þ þ H ðYjC Þ

ð8Þ
¼ H ðXjCÞ þ H ðYjC Þ þ H ðC Þ H ðX; Y; C Þ
to calculate the conditional MI between two features under the condition of labels. The
relationship among the items in Eq. (8) is illustrated in Fig. 1. From the Venn diagram,
the redundancy between feature X and Y under the condition of class C can be
measured as the percentage of I(X; Y|C) taken in H(X, Y|C), which can be represented as
the ratio r between I(X; Y|C) and H(X|C) + H(Y|C) − I(X; Y|C), that is
I ðX; YjC Þ
r¼ ð9Þ
H ðXjC Þ þ H ðYjC Þ I ðX; YjC Þ
where 0 r 1. In Eq. (9), r = 0 means X and Y are independent under the condition
of C; the larger the r is, the larger the redundancy between X and Y; when r = 1, X and
Y are totally dependent, or totally redundant under the condition of the label. And once
r exceeds the predefined threshold, the feature which is ranked in later position between
two redundant features will be removed from the feature subset.
Algorithm 1. mDSRR method
1 Input: class I data feature set , class II data feature set , bin number n.
2 Initialize: initial feature set .
3 Begin
4 for
5
6 end
7 sort from largest value to smallest value, get a new feature set .
8 take the first items in , .
9 for :
10 calculate
12 if :
1
14 end
15 end
16 End
17 Output: .
is the number of features.
Fig. 1. Venn diagram of the relationship among items in Eq. (8).
Combining the feature ranking algorithm in Sect. 2.2 and the remove redundancy
step described above, our feature selection method is finally developed and named as
mDSRR (minimum Distribution Similarity with Removed Redundancy). The algorithm
is summarized in Algorithm 1.
3 Results
To highlight the effectiveness of mDSRR in feature selection, five state-of-the-art

methods, including mRMR [15], DISR [24], ICAP [19], CIFE [22], and CMIM [21]
are used for comparison. These five approaches are chosen because that, (i) they are all
Filter methods based on information theory; (ii) they cover information theory mea-
sures like MI, joint MI and conditional MI; (iii) they are classic and popular feature
selection methods which have been applied widely in diversity of areas. All methods
are evaluated on 11 public datasets and 4 kinds of classifiers, including Supporting
Vector Machine (SVM), Decision Tree (DT), Random Forest (RF) and Naïve Bayes
(NB). The average classification accuracy (Acc) for the 10-fold cross validation, which
can reflect the general performance while avoiding the bias, is recorded and works as
the criteria to evaluate different methods.
3.1 Datasets
Eleven public datasets from UCI Repository [26] are used for comparison, they were
all in two classes with multivariate and integer or real attributes, and covering a
diversity of areas, such as life, economic, chemistry and biology, medical, computer,
artificial and physical. These datasets vary in instance numbers and feature numbers,
hence can be used for fair comparisons, the related information for these datasets are
briefly listed in Table 1.
10 Y. Zhang et al.
Table 1. Datasets used in this work.

Dataset name Number of instances Number of features
Arcene 200 10000
Audit 776 17
Biodegradation 1055 41
Breast Cancer Wisconsin 683 (origin 699) 10
Breast Cancer Coimbra 116 9
Diabetic Retinopathy Debrecen 1151 19
Madelon 2600 500
Musk 7074 166
Parkinson 756 751
Sonar 208 60
Spambase 4601 57
3.2 Parameter Determination in mDSRR

In mDSRR, the parameter bin number needs to be assured, to achieve it, we did
experiments on 11 datasets to see the impacts of the selection of bin number. Following
the rules what we described in Sect. 2.2, the bin number cannot be selected too large
and too small, we consider the circumstance when bin number equals to 10 ; 15 ; 20 ; 30
1 1 1 1
1
and 50 of the total number of instance for dataset with a relatively large instance
amount, i.e. > 600, and 12 ; 15 ; 10 ; 15 and 20
1 1 1
of the total number of instance for dataset
with a relatively small instance amount, i.e. < 300. The comparison of the Acc
achieved by feature subsets with different choices of bin number for 11 datasets are
plotted in Supplementary Figure S1 and S2. The best choice of bin number is selected
as the one that achieves the best Acc most times in four classifiers, if two or more
Table 2. The best choice of bin number for 11 datasets.

Datasets Number of instances Best bin number in portion*
Breast Cancer Coimbra 116 1/5
Arcene 200 1/15
Sonar 208 –**
Breast Cancer Wisonsin 683 –
Parkinson 756 1/20
Audit 776 1/20 or 1/30
Biodegradation 1055 1/50
Diabetic Retinopathy Debrecen 1151 1/50
Madelon 2600 1/50
Spambase 4601 1/50
Musk 7074 1/50
*Best bin number in portion is the portion of bin number taken up in total instance
number.
**Means the choice of best bin number percentage is hard to define according to the
existing results.
choices of bin number realize the best Acc equal times, then we consider their per-
formance under the same feature subset size. The times for different choices of bin
number which achieving the best Acc are counted in Supplementary Table S1, and the
summarize of the best choices of bin number for these datasets are listed in Table 2.
From the experiment results, the portion that the bin number taking up in the total
instances decreased as the total number of instances increases. For datasets with
instance number at around 100, we use bin number roughly as 1/5 of the total instance
number; for total instance number around 200–500, we use its 1/15 as bin number; for
total instance number around 500–1000, we use 1/20; for total instance number larger
than 1000, we use 1/50.
Actually, with the histogram idea, there is no best choice of bin number without a
strong assumption about the shape of the distribution, and the parameter we chose is a
suboptimal one, but in later sections, we will show the good performance of mDSRR
with such choices of bin number.
The other parameter in mDSRR is the redundancy remove threshold rth. Although
sometimes the redundancy between two features may be large, they may still contain
useful information and should not be deleted, hence we consider the circumstances
when rth = 0.9, 0.99 and 0.9999. The feature subset sizes after removing redundancy
with different selection of rth are recorded in Supplementary Table S2 and their
comparisons are plotted in Supplementary Figure S3. 0.9999 is chosen as the final
value of rth which achieves the best performance most times, although in some cases no
feature is removed with such a high threshold.
3.3 Performance Comparison on Datasets with Large Feature Size

To compare the performance of different feature selection methods on datasets with a
relatively large feature set size, we plotted the average Acc of 10-fold cross validation
for feature subsets with different sizes in Fig. 2. For datasets whose feature size
exceeding 100, e.g. Arcene, Madelon, Musk and Parkinson, the results of feature
subsets with size from 1 to 50 are shown, and for the others (Biodegradation, Spambase
and Sonar), the results of feature subsets with all possible sizes are shown. The bin
numbers are chosen following the rules we concluded in Sect. 3.2.
The application of mDSRR method on dataset Arcene, Parkinson and Sonar has
obvious advantages over other methods, the feature subset determined by mDSRR can
achieve the highest value with only a small feature subset size. For example, in Arcene
dataset, the feature subset with size 10 selected by mDSRR realize 85% Acc with SVM
classifier, while other methods never reach this value no matter how many features are
added; although mDSRR does not realize the best Acc in this dataset with NB clas-
sifier, the feature subset it determined with only 2 features achieve Acc as high as 71%,
which is almost the same as the best Acc achieved by ICAP (71.5%), with feature
subset size 32. Furthermore, with the same feature subset size which are less than 25,
40 and 10 in dataset Arcene, Parkinson and Sonar, respectively, the performance of
mDSRR are much better than other methods in most cases.
Although the general performances of mDSRR on the remaining 4 datasets is not as
outstanding as the above datasets, the advantages of mDSRR still can be found. For
Biodegradation dataset, the best Acc are achieved by mRMR with SVM and DT
Another random document with
no related content on Scribd:
dying. I must go to him. Surely you wouldn’t have the heart to keep me
away? He is the only relative I have in the world! How can I act, and sing,
and laugh, when there is a weight like lead at my heart?”
The stage-manager eyed her pityingly. “I know it’s very hard,” he said,
in a softened voice. “But just consider a moment. You cannot get a train to
Durlston to-night, for the last one went at about six o’clock; so you would
have to wait till morning in any case. Now, suppose you go back to St.
John’s Wood, what will you do? Simply sit still and make yourself ill with
fretting, most probably. Whereas, if you remain here, your mind will, at
least temporarily, be diverted into other channels. Miss Franks, I am sure
you are a brave young lady. Won’t you try?”
“Oh, it’s cruel, Mr. Calhoun——” Grace Haviland began, but her brother
would not allow her to finish the sentence.
Celia was well-nigh distracted. Although loth to cause the stage-manager
so much inconvenience and bother, it would be too terrible to think of
Herbert, perhaps dying, with none of his own kin near him, whilst she was
playing on the hateful stage. Calhoun pulled out his watch, for the precious
minutes were speeding away. All three looked at her in eager expectation.
What would her answer be?
After what seemed an eternity, although it was in reality only about fifty
seconds, she heaved a deep sigh.
“All right, I’ll go through with it,” she said with an effort. “Or at least
I’ll do my best. But please—leave me alone—just for a few minutes.”
“That’s a brave girl!” exclaimed Haviland, with gratification. “I knew
she wouldn’t put us in such a fix.”
“In seven minutes the call-boy will be here,” said the stage-manager; and
then with a word of encouragement the two men withdrew.
Celia sat down at the table and buried her face in her hands. She tried to
think, even to pray, but her senses seemed quite dulled. Fortunately the
possibility of her stumbling or breaking down never entered her mind. She
had promised to go through with it; and she meant to fulfil her promise.
There might be tears and pain at heart, but there would be the usual stage-
smile on her face. When she raised her head, there was an expression of
almost fierce determination on her countenance. She would not, must not,
fail!
Mrs. Jackson readjusted the details of her costume, whilst Grace tried to
utter words of commiseration and encouragement. Then the former
produced a small spirit-flask and glass, and bade Celia drink.
“There’s nothing like a drop of brandy neat, for putting life into a body,”
she said cheerfully. “Come now, drink it, missie; it will do you good.”
But the girl demurred. “No thanks, I would rather not,” she replied. “I
am all right now;” and then the patter of flying feet heralded the coming of
the call-boy.
For years after Celia remembered that night, and declared she could
never have gone through it again. Calhoun said she had never acted so well.
In the third act, in which she was the central figure all through, she
surpassed herself, and as the curtain fell, evoked a veritable tumult of
applause. And not one out of that light-hearted, pleasure-loving audience
had the slightest idea how it hurt her to give that merry ringing laugh at the
end of the first scene; or that when, later on, she had to say, “Where is my
beloved?... My beloved lays a-dying!” the tears in her voice were
unfeigned.
But her nerves were stretched to their utmost limit of endurance, and the
reaction was bound to follow. She returned to the dressing-room in a state
bordering on exhaustion, scarcely heeding Mr. Calhoun’s “Well done!”
Fortunately, however, the worst was over, for the remaining act entailed but
slight exertion. She begged Grace Haviland to read the account of the
assault at Durlston whilst she was changing her costume; and, occasionally
interrupted by sundry comments from Mrs. Jackson, Grace complied with
her request.
The gist of the matter was this:—
Jacob Strelitzki, a former heeler at Messrs. Mendel and Co.’s boot
factory at Durlston, had, after an absence of two months, returned and run
amok at the factory, attempting to wound three men with a large clasp-
knife. Being of the opinion that he was either the victim of delirium
tremens, or else had lost his reason, the factory people made every effort to
detain him, but he cleverly managed to slip through their fingers and made
his escape. Nothing more was heard of him until that very morning, when
he had forced his way into the studio at the Towers, and, without any
warning, attacked Mr. Karne—who was at work upon a picture—with the
same clasp-knife he had used on the former occasion. Mr. Karne’s servants
had come to the rescue, and managed to subdue the man, who was
undoubtedly a raving lunatic, but not before he had been able to inflict
serious injury to the unfortunate artist. No adequate motive for the crime
was assigned, except that for some time Strelitzki had cherished a senseless
grudge against Herbert Karne, and had so worked upon his comrades at the
factory, that at his instigation they had even set fire to the artist’s house.
Recently, however, a complete reconciliation between Herbert Karne and
the factory people had taken place; and the latter were shocked and
horrified in the extreme at the dastardly action of their former colleague.
Meanwhile, Mr. Karne lay in a critical condition, having been wounded in
the thorax and right lung.
Celia’s face blanched as she listened, whilst a sickening anxiety tore at
her heart. Oh, if only Higgins had despatched the telegram a little earlier,
she would have been well on her way to Durlston by now. As it was, she
would have to wait till morning. Would morning ever come?
Mrs. Jackson thought the girl was going to faint, and insisted on forcing
some brandy down her throat. She was very sympathetic, almost
obtrusively so; for it was that tactless sympathy which is worse than none at
all.
“Keep your heart up, miss,” she said cheerily, noticing that Celia’s tears
were making havoc with her make-up. “You can’t rely on some of them
ha’penny papers, you know. I don’t suppose it’s really so bad as they put it
there. Not but what you’ve not cause to be anxious, for all that. I remember
when my poor daughter—her that was on the trapeze business at the ’alls—
fell right down from the roof to the floor without so much as a net to catch
her, they sent for me—I was dresser to Mrs. Potter Wemyss at the
Haymarket then—and I arrived at the ’all just in time to find the poor gel
stiffening. They told me at first it was only a slight accident; but she was
stretched out dead when I got there, miss, and looking as calm as calm can
be. Them accidents are nasty things, I reckon. I do hope as you won’t find
your poor brother laid out ready——”
“Oh, for goodness’ sake, stop!” called out Grace, imperatively. “Can’t
you see that you are frightening Miss Franks?”
She felt ready to throw the hand-glass or any other convenient missile at
the woman for her arrant thoughtlessness.
Poor Celia was pale and trembling, whilst visions of her brother lying
dead flashed before her mind’s eye. How she managed to get through that
last act she never knew. The dim faces of the audience looming out of the
semi-darkness seemed to her like rows of grisly skeletons mocking her with
sardonic mirth. The sweep of the violins in the orchestra sounded like a
funeral dirge. Two or three times she was almost overcome with dizziness;
but at length all was over, and, for the last time, the curtain fell.
“You did splendidly, Cely,” Guy Haviland said to her on the way home.
“You are what I have a great admiration for: a brave girl—a girl with
‘grit.’ ”
But Celia felt brave no longer. She leant back in the brougham with her
head against Grace’s shoulder, and cried quietly all the way. She was utterly
worn out.
CHAPTER XVIII
“NEITHER JEW NOR GREEK”—ONE GOD OVER ALL
An unmistakable air of gloom hung over the factory club at Durlston. The
members, instead of playing cards or chess as usual, gathered round the fire
and smoked their pipes in silence; whilst one of them sat over in the corner,
and with his velvet cap carelessly donned, droned prayers to himself out of
a well-thumbed Hebrew book. They were all anxiously awaiting the result
of the medical consultation concerning their benefactor, Herbert Karne; and
could settle to nothing until their suspense had been relieved. Now that they
had relinquished their enmity towards him, they went to the other extreme,
and exalted him into a kind of demi-god. If he lived they would do all in
their power to make amends for their past ingratitude; if he died they would
lament him as a martyr, for it was by one of themselves that he had been
struck down.
Presently the door swung open to admit the foreman, Emil Blatz; and at
his appearance the men looked up with expectancy plainly written on their
faces.
“Well, what news?” said one, as though half afraid to ask the question.
The new-comer closed the door and came forward. “The Manchester
physician has just gone back,” he answered. “Strelitzki has been sent to the
Prestwich asylum.”
“And the doctors’ verdict?”
“Mr. Karne will live.”
“Gott sei dank!” ejaculated the man in the corner. He had wanted
Herbert Karne to change his name, so that the Angel of Death would be
deceived, and pass on without claiming his prey.
There was not a man in the room who was not intensely relieved by the
news. Each clamoured for further particulars, and went to the Towers to
read the bulletin for himself. Once more they were able to enter into their
various pastimes and pursuits without feeling that to laugh or chat would be
to exhibit callousness or bad taste. A load had been lifted from their hearts.
Mr. Karne would live.
For nine days he had hovered ’twixt life and death—a time of
heartrending anxiety to his sister, who attended him with untiring devotion,
and scarcely ate or slept until the crisis had been overcome. On the tenth
day Lady Marjorie arrived; and by a coincidence it was on the tenth day
that he began to mend.
“He will get better quickly now that you are here,” Celia said
optimistically; and her prophecy was, happily, fulfilled. Herbert had so
much to live for now, that he was determined to make a good fight for life
and health. He recovered quickly and thoroughly, quite astonishing Dr.
Forrest by his unusual obedience to his orders.
Lady Marjorie looked thin and pale; and quite unlike the vivacious little
woman of a few months ago. During her stay abroad she had suffered both
mentally and physically, the sorrow on her mind having greatly retarded her
recovery from the fever. But as her lover grew stronger, she also picked up
health. The roses returned to her cheeks, and the sparkle to her eyes; until
by degrees she regained the sprightliness which had been hers of old.
“It was a good thing Strelitzki did not quite finish me off just as our
happiness was on the horizon,” Herbert said to her half playfully one day.
“Just imagine if you had come back to find a nice little urn awaiting you,
labelled ‘Concentrated essence of Herbert Karne.’ I am an advocate of
cremation, you know!”
But Marjorie’s eyes filled at the very thought. “Oh, darling, I can’t bear
to hear you jest about it,” she rejoined seriously. “If that wretched lunatic
had killed you, I should have died too.”
And her lover, although he persisted in making light of the whole affair,
knew that her words were no vain exaggeration. He began to wonder what
Marjorie could see in him, that she should love him so. He considered
himself quite the luckiest man in the world.
A fortnight before Christmas the good people at Durlston were
somewhat surprised to hear that Durlston House was about to change hands,
the new owner being a Mrs. Thornton, of Sydney. One or two of them went
to Lady Marjorie expressing their regret; and asked her if she were leaving
the town for good.
“Oh no, not for good,” she answered with a merry twinkle in her blue
eyes. “Only for about six weeks.” And more she would not divulge.
But somehow the news leaked out, and there was quite a crowd of well-
wishers outside the registrar’s office on the following Monday morning.
They were mostly the tradespeople who attended at Durlston House and the
Towers, probably drawn thither by the fascination which always seems to
hover round a bridal couple, whatever their degree.
It was a dreadfully plebeian way of getting married, they said to each
other; in fact, it was hardly respectable. “No banns, no church, no wedding-
bells, no cake, no free drinks, no nothing.”
“And it’s not as if they couldn’t afford it, neither,” said Mrs. Smith, who
kept the chandler’s shop in the High Street; “she being a hearl’s daughter
and all.”
“Perhaps it’s because she were a widder,” hazarded Mrs. Jones.
“Widders ain’t so pertikler as spinsters, seeing as it’s their second try.”
At the station, however, Mr. Karne somewhat redeemed his character in
their eyes. The factory people, despite the fact that he was marrying out of
the faith, had sent a deputation to wish the bridal pair good luck and a
pleasant journey. In replying to their congratulations, Herbert said that on
account of the state of his health, he had been obliged to have the marriage
as quiet as possible; but when, in the course of a few weeks, he brought his
bride home to the Towers, he hoped to be well enough to organize all the
festivities generally associated with a happy wedding.
His little speech elicited general satisfaction, and after some
consideration it was unanimously agreed throughout the town that he could
not very well have had a “big” wedding, when he had so recently lain at
death’s door.
“Although it do seem to me that a bride and bridegroom hev no more
right to put off their wedding breakfast than a dead Irishman has to
postpone his wake,” remarked Mrs. Jones to Mrs. Smith. “Seeing as one
follows the other quite natural-like, as you may say. Still, if them Jews at
Mendel’s is satisfied, it’s nowt to do with you and me.”
And there the matter rested.
Celia drove back from the station with Lord Bexley and Mr. Harry
Barnard, who had been the witnesses of the marriage. She could not help
looking a little bit woe-begone in spite of Mr. Barnard’s jocularity.
Although not begrudging Herbert and Marjorie their happiness—on the
contrary, she was deeply thankful for it—she felt that Marjorie was the most
enviable woman in the world, for she had gained her heart’s desire: she had
married the man she loved.
At lunch Mr. Barnard suddenly bethought him of a letter which had
arrived for Herbert that morning.
“It was a black-bordered envelope, so I advised Higgins not to deliver it,
in case Bert should take it as a bad omen, coming on his wedding-day,” he
said in explanation. “What the dickens did I do with it, though? Ah, here it
is!” extracting it from the depths of one of his numerous pockets. “I
suppose we had better forward it, Miss Franks?”
Celia examined the envelope. “I can open it,” she replied, with a sigh. “I
know where it comes from. Poor Mrs. Neville Williams——”
“Do you mean to say she is——” asked Lord Bexley, in a tone of awe.
The girl nodded. “Yes, she is dead,” she rejoined solemnly, as she read
the letter. “I am glad that you did not give this to my brother, Mr. Barnard.”
“But I saw Dr. Milnes last week,” pursued Bexley, as though he could
scarcely believe it. “He told me that the operation was quite a success.”
“Yes, so it was, according to the nurse’s account also,” answered Celia.
“She says: ‘The operation in itself was entirely successful, but the
unfortunate lady succumbed to weakness following a relapse.’ Poor Mrs.
Neville Williams! I am sorry she is dead!”
“She was a slap-bang and a dash kind of woman, if ever there was one,”
remarked Harry Barnard, unfeelingly. “Never happy unless she was up to
some sort of a lark. Great Scott, the tricks she used to get up to when Bert
and I were in Paris! As flighty as a two-year-old she was, but as cunning as
they make ’em. She would have made up to you if you had given her half a
chance, wouldn’t she, my lord?”
Bexley looked over at Celia and felt uncomfortable. “Mrs. Neville
Williams is dead,” he said with quiet emphasis. “Requiescat in pace.”
And then Celia, who considered Mr. Barnard’s remarks in somewhat bad
taste, tactfully changed the subject.
The “Voice of the Charmer” had but another week to run, for the theatre
was wanted for the Christmas pantomime. Celia had promised to return to
the cast for the final performances; and accompanied by the two gentlemen,
caught the afternoon train to London.
Haviland and Calhoun were glad to see her back, for the play without
her in it had been like Hamlet without the Prince of Denmark, even though
Miss Graham had done her best to imitate the original Mallida’s
interpretation of the part.
Celia was not sorry when the last night arrived, although she was bound
to admit that all her co-workers had been exceedingly kind to her, from the
manager down to the call-boy. But when Mr. Calhoun asked her if she
would continue in the part if they resumed the run of the play in the new
year, she quietly but firmly declined; and neither he nor Haviland could
persuade her to alter her mind.
After Christmas, which she spent very enjoyably at Woodruffe, Herbert
and Marjorie wrote for her to come and join them in Bournemouth, both
assuring her that she need have no scruples about trespassing on the
seclusion of their honeymoon, for there were two or three people they knew
staying at the same hotel. The Wiltons, however, would not hear of her
taking her departure until after their annual Christmas party, which was, to
them, the great event of the winter season.
“Your brother ought to be able to spare you a little longer, now that he
has a wife to keep him company,” said Enid, with authority; and to this all
the other members of the family agreed.
But at length, after her sister-in-law had despatched three or four more
letters of invitation, Celia bade farewell to them all and went. She found
both her brother and his wife greatly improved in health; and the cordial
welcome they gave her quite dispelled the fear she had had that her visit
might be an intrusion. Their fellow-visitors at the hotel organized various
forms of social enjoyment; and as the weather was genial—although it was
January—they went about a good deal.
“There is somebody you know staying at Cliff Terrace,” Marjorie
informed her whilst she unpacked. “He came to Bournemouth because he
knew we were here. We scarcely expected you until Monday, and I told him
so; but I should not be surprised if he came round to-morrow.”
“Who is it?” asked the girl with curiosity, but Lady Marjorie only smiled
at her in a tantalizing manner, and refused to say.
The next day was Sunday. Celia expected the mysterious somebody all
day, but he did not arrive. She wondered if it were Lord Bexley, and hoped
he had not been trying to get his sister to intercede in his favour. She
scarcely thought he would do such a thing, for he had appeared to take her
decision as final, when she had rejected his proposal at the Havilands.
In the evening she expressed her intention of going to church; and as
Marjorie was not allowed to inhale the night air, she went alone, her brother
promising to meet her at the conclusion of the service. He did not scruple to
allow her to go unaccompanied, for ever since she had passed out of the
hands of her governess, she had been used to go about by herself.
The church was of modern build, fitted with electric light and numerous
creature comforts unthought of in the days of our fathers. Celia nestled back
in the corner of her pew, allowing the solemn stillness of the sanctuary to
pervade her spirit. Evensong always had the effect of making her feel happy
and restful; it was like a soothing lullaby after a busy day. She loved
especially the jubilant Magnificat and the solemnly sweet Nunc Dimittis, for
they were of peculiarly Jewish interest, and made her glory in her Hebrew
descent.
After the service was over, and the bulk of the congregation filed out,
she still remained in her seat, dreamily listening to the exquisite organ
melody. It was one of Chopin’s most beautiful Nocturnes, sweetly mournful
and pathetic in parts, but occasionally displaying the fervour of its
restrained passion. Celia knew it well, but she had never heard it played
amidst such surroundings before. The building was now in semi-darkness,
the glare of the electric light having been replaced by the softening shadows
of night. At the altar a surpliced choir-boy was extinguishing the six
candles, one by one. He performed the action with care and reverence; and
then quietly withdrew.
And still the music played on, rising and falling like the throbbing of a
heart; and still, with her face turned towards the east—where the sacred
symbol stood out in bold relief—Celia listened. At last, recollecting that her
brother might be waiting, she passed on tip-toe down the aisle and through
the porch. But he was not there; so, knowing that he would not like her to
wait about alone, she began to make her way towards the hotel.
It was a fine night, frosty and dry. There was no moon, but the stars
shone with dazzling splendour. Celia crossed over to the esplanade, and
stood contemplating the prospect for a moment, whilst the salt breeze
brushed against her cheek. As she gazed at the vast expanse of sky and
ocean, and listened to the dull roar of the waves, some lines she had once
sung in the “Golden Legend” recurred to her memory:
“The night is calm and cloudless,
And still as still can be,
The stars come forth to listen
To the music of the sea.”
She loved all the sounds of Nature, but especially that “music of the
sea.” Its chords were deep and resonant; and full of meaning to those who
had ears to listen to its ever-changing harmonies. All around was mystery;
mystery in the impenetrable height of the starry heavens; mystery in the
great depth of the moving waters. What was beyond and below?—she
wondered with reverential awe; and realizing—if ever so slightly—the
majestic grandeur of the great Creator’s handiwork, an overpowering sense
of her own littleness overcame her, until, with a sudden longing for human
companionship, she turned to continue her walk.
“ ‘In maiden meditation, fancy free,’ ” quoted a familiar voice close
behind her. “Star-gazing is a pleasant occupation for two, but rather
lonesome for one in solitude. May I join you, Celia dear?”
It was nearly four years since she had last seen him, but even in the
darkness, she recognized his stalwart form.
“Geoffrey!” she exclaimed. “At last!” And try as she would, she could
not keep the joy out of her voice.
There was nobody about, and he took possession of her arm as if it were
the most natural thing in the world. And the funny part about it was that she
did not feel the least surprise that he should do so. How he came to be there
she had not the faintest idea; she did not even wonder about it. She only
knew that his coming filled her with a delicious sense of happiness, and that
the song of the sea sounded sweeter than it had done before.
“I arrived at your hotel just after you had gone,” Geoffrey explained. “So
Herbert sent me on to meet you. I was in church, quite near you, all the
time; but you looked so absorbed that I didn’t like to bring you down from
heaven to earth until it was absolutely necessary. Celia, has Lady Marjorie
said anything to you about me lately?”
“She told me that somebody I knew was staying at Cliff Terrace and
intended coming to see me; but she did not say it was you. I was expecting
the somebody all day.”
“Were you? Oh, if I had only known that you were here, I would have
come round early this morning. Lady Marjorie has been very good to me;
she has made me see what a timid ass I’ve been. It was not entirely my
fault, though. Stannard would have it that you were engaged to Lord
Bexley; and I was so busy looking after my poor aunt and Miss Thornton
that——”
“Miss Thornton!” interpolated the girl, suddenly shrinking away from
him. “I had forgotten Miss Thornton.”
Her sky was overcast again.
“You don’t know her, do you?” asked Geoffrey, wonderingly. “She is
Stannard’s fiancée.”
Celia drew a deep sigh. Stannard’s fiancée! That made all the difference.
But how foolish she had been to have made such a mistake!
“She used to be subject to fits,” her lover went on to explain. “But
fortunately I have been able to effect a complete cure. She has been under
my supervision for some months.”
“And she is going to marry Dick Stannard?” Celia asked, anxious to hear
a corroboration of the statement.
“Yes, she is going to marry Dick,” he replied with satisfaction. “But I
don’t want to speak about Miss Thornton just now. Oh, you dear, sweet girl,
how nice it is to be talking to you like this after such a long time!” This
with an affecting pressure of her hand. “You do love me just a wee bit,
don’t you, dear?”
“I love you more than a wee bit, Geoffrey,” she answered, in the tone of
one who makes a great confession. “I have loved you ever since that night
when——”
“When I kissed you under the mistletoe? I remember. I’ve been living on
that kiss for four years. I am just aching and hungering for another one. I
am going to have it here and now.”
“Geoffrey!” she protested. “In the open street!”
“I don’t care,” he answered with determination. “There is nobody to see
except Nature, and Nature keeps her secrets well. Ah”—as he put his desire
into execution—“that was beautiful. But tell me, darling, if you really loved
me all that time ago, why did you become engaged to another fellow?”
“Because you—you—didn’t——”
“Because I didn’t come forward and claim you?” he suggested, finishing
the sentence for her. “But your brother made me promise not to speak: he
thought it might hinder your career. He told me he did not approve of mixed
marriages either, although he has not practised what he preached. Lady
Marjorie is a Christian.”
“Herbert says now that love is more powerful than race and creed,” the
girl said softly. “Love breaks all barriers down.”
“Yes, he is right,” her lover rejoined with deepening earnestness. “But
there is no barrier of creed ’twixt you and me, now, darling; no barrier of
any kind. Did you notice the text of the sermon, to-night, Celia: ‘Neither
Jew nor Greek’? Oh, it seemed to me as if the clergyman must have chosen
it because he knew we were in the church. ‘Neither Jew nor Greek’ ...
united, made one in Christ. No difference between the Jew and the Gentile,
for the same God is God of both!”
They had arrived at the hotel, and Herbert Karne was looking out for
them in the vestibule. Geoffrey’s buoyant manner and Celia’s happy face
told him, before he asked, that their meeting had been a satisfactory one.
Lady Marjorie looked up from her book with a softened expression in
her blue eyes, when they made their appearance at the door of the private
drawing-room.
“So your visitor has come at last, girlie,” she said, as Celia bent down
and kissed her. “I told him that I thought you would give him a hearty
welcome. Was I right, Dr. Geoff?”
“Yes, quite right,” the young doctor replied, as he gripped her hand. “I
can never be sufficiently grateful to you for your kindness, Lady Marjorie.”
“You really were the silliest pair of lovers I ever came across,” Marjorie
said, as she glanced at them and thought what a well-matched couple they
made. “I knew that each of you was just longing for the other; and yet you
both held aloof, although there was no cause or just impediment why you
should not have come together long ago. So I determined to intervene and
make you happy. And, judging by the looks of you both, I think I have
succeeded.”
“You have, indeed!” rejoined Geoffrey, as he drew his sweetheart closer
to him; and Celia, whose heart was too full for words, expressed by her
shining eyes, the great happiness which was hers at last.
* * * * *
On the deck of a channel-steamer bound for Calais stood a young girl,
shading her eyes with her hand. She was watching the land as it receded
from view, yet with no feeling of regret, for she was making the journey
with the one she loved best in the world.
Less than twenty-four hours ago she had stood beside him at the altar,
and made her marriage vows. The “Voice that breathed o’er Eden” was still
ringing in her ears; the crashing chords of the Wedding March seemed
interwoven with the throbbing of the ship’s engines; the very air seemed
full of the far-off sound of wedding-bells.
It was a bright spring morning, a day fit for the renewing of energy and
hope. All around was sunlight: on the shimmering waters, the polished
deck, and on the girl’s bright hair. It seemed to her like a happy omen,
symbolizing the sunshine on the sea of life. With a deep sigh of happiness
she turned away; and, looking up, encountered the fond gaze of her lover-
husband.
“Why such a sigh, sweet?” he asked, tenderly placing her hand within
his own. “Of what were you thinking, my little wife?”
“Many things, Geoffrey,” she answered softly, her face lit up with a
radiant smile. And then, as they both continued to gaze landwards, she
added: “But—chiefly—that life is full of joy;—and God is good!”
THE END
PRINTED BY WILLIAM CLOWES AND SONS, LIMITED, LONDON AND BECCLES.
FOOTNOTES:
[1] Bridegrooms.
[2] Gentile.
[3] Ritually clean.
[4] Jewish holydays.
[5] Pertaining to Judaism.
[6] Confirmation.
[7] Day of Atonement.
[8] Festive.
[9] Congratulation.
[10] Bridegroom.
[11] Sabbath.
[12] Money.
[13] Jews.
[14] Smart wit.
[15] Mourning.
[16] Converted Jewess.
[17] Sabbath.
[18] Holy-days.
[19] Converse with familiarity.
[20] Bridegroom.
Typographical errors corrected by

the etext transcriber:
whether whether they be Jews or
Gentiles=> whether they be Jews or
Gentiles {pg 84}
Jacob Strelitkzi=> Jacob Strelitzki
{pg 107}
Is was so quiet=> It was so quiet
{pg 128}
mental note or=> mental note of
{pg 220}
*** END OF THE PROJECT GUTENBERG EBOOK NEITHER JEW
NOR GREEK ***
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.

Computational Science ICCS 2020 20th International Conference Amsterdam The Netherlands June 3 5 2020 Proceedings Part V Valeria V. Krzhizhanovskaya

Uploaded by

Copyright:

Available Formats

You might also like

Computational Science ICCS 2020 20th International Conference Amsterdam The Netherlands June 3 5 2020 Proceedings Part V Valeria V. Krzhizhanovskaya

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Computational Science ICCS 2020 20th International Conference Amsterdam The Netherlands June 3 5 2020 Proceedings Part V Valeria V. Krzhizhanovskaya

Uploaded by

Copyright:

Available Formats

Computational Science ICCS 2020 20th

International Conference Amsterdam

Computational Science ICCS 2020 20th International

Computational Science ICCS 2020 20th International

Computational Science ICCS 2020 20th International

Web Information Systems Engineering – WISE 2020: 21st

Computational Science and Its Applications ICCSA 2020

Computational Science and Its Applications ICCSA 2020

Computational Science ICCS 2018 18th International

Computational Science ICCS 2018 18th International

Editorial Board Members

Gábor Závodszky Michael H. Lees

Jack J. Dongarra Peter M. A. Sloot

Sérgio Brissos João Teixeira (Eds.)

ISSN 0302-9743 ISSN 1611-3349 (electronic)

© Springer Nature Switzerland AG 2020

Twenty Years of Computational Science

Welcome to the 20th Annual International Conference on Computational Science

June 2020 Valeria V. Krzhizhanovskaya

Thematic Tracks and Organizers

Agent-Based Simulations, Adaptive Algorithms and Solvers – ABS-AAS

Applications of Computational Methods in Artiﬁcial Intelligence and Machine

Biomedical and Bioinformatics Challenges for Computer Science – BBC

Classiﬁer Learning from Difﬁcult Data – CLD2

Complex Social Systems through the Lens of Computational Science – CSOC

Computational Health – CompHealth

Computational Methods for Emerging Problems in (dis-)Information

Computational Optimization, Modelling and Simulation – COMS

Computational Science in IoT and Smart Systems – IoTSS

Computer Graphics, Image Processing and Artiﬁcial Intelligence – CGIPAI

Data-Driven Computational Sciences – DDCS

Machine Learning and Data Assimilation for Dynamical Systems – MLDADS

Meshfree Methods in Computational Sciences – MESHFREE

Multiscale Modelling and Simulation – MMS

Quantum Computing Workshop – QCW

Simulations of Flow and Transport: Modeling, Algorithms

Smart Systems: Bringing Together Computer Vision, Sensor Networks

Software Engineering for Computational Science – SE4Science

Solving Problems with Uncertainties – SPU

Teaching Computational Science – WTCS

Uncertainty Quantiﬁcation for Computational Models – UNEQUIvOCAL

Program Committee and Reviewers

Ahmad Abdelfattah Daniel Berrar Neil Chue Hong

Amgad Elsayed Pedro Guerreiro Jakub Klikowski

Frederic Loulergue Mai Nguyen Lukasz Rauch

Jerzy Stefanowski Nestor Tiglao Maciej Woloszyn

Computational Optimization, Modelling and Simulation

Information Theory-Based Feature Selection: Minimum Distribution

On the Potential of the Nature-Inspired Algorithms for Pure

Analytical Techniques for the Identification of a Musical Score:

Reduced-Cost Constrained Modeling of Microwave and Antenna

Aerodynamic Shape Optimization for Delaying Dynamic Stall

Model-Based Sensitivity Analysis of Nondestructive Testing Systems

Application of Underdetermined Differential Algebraic Equations

Fully-Asynchronous Fully-Implicit Variable-Order Variable-Timestep

A Relaxation Algorithm for Optimal Control Problems Governed

Genetic Learning Particle Swarm Optimization with Interlaced

Low Reynolds Number Swimming with Slip Boundary Conditions . . . . . . . . 149