Service Oriented Computing 15th

International Conference ICSOC 2017

Malaga Spain November 13 16 2017
Proceedings 1st Edition Michael
Maximilien
Visit to download the full and correct content document:
https://textbookfull.com/product/service-oriented-computing-15th-international-confere
nce-icsoc-2017-malaga-spain-november-13-16-2017-proceedings-1st-edition-michael
-maximilien/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Service Oriented Computing ICSOC 2017 Workshops Lars

Braubach

https://textbookfull.com/product/service-oriented-computing-
icsoc-2017-workshops-lars-braubach/

Service Oriented Computing 16th International

Conference ICSOC 2018 Hangzhou China November 12 15
2018 Proceedings Claus Pahl

https://textbookfull.com/product/service-oriented-computing-16th-
international-conference-icsoc-2018-hangzhou-china-
november-12-15-2018-proceedings-claus-pahl/

Distributed Computing and Internet Technology 13th

International Conference ICDCIT 2017 Bhubaneswar India
January 13 16 2017 Proceedings 1st Edition Padmanabhan
Krishnan
https://textbookfull.com/product/distributed-computing-and-
internet-technology-13th-international-conference-
icdcit-2017-bhubaneswar-india-january-13-16-2017-proceedings-1st-
edition-padmanabhan-krishnan/

Ambient Intelligence 13th European Conference AmI 2017

Malaga Spain April 26 28 2017 Proceedings 1st Edition
Andreas Braun

https://textbookfull.com/product/ambient-intelligence-13th-
european-conference-ami-2017-malaga-spain-
april-26-28-2017-proceedings-1st-edition-andreas-braun/
Service Oriented Computing 17th International
Conference ICSOC 2019 Toulouse France October 28 31
2019 Proceedings Sami Yangui

https://textbookfull.com/product/service-oriented-computing-17th-
international-conference-icsoc-2019-toulouse-france-
october-28-31-2019-proceedings-sami-yangui/

Service Oriented Computing 18th International

Conference ICSOC 2020 Dubai United Arab Emirates
December 14 17 2020 Proceedings Eleanna Kafeza

https://textbookfull.com/product/service-oriented-computing-18th-
international-conference-icsoc-2020-dubai-united-arab-emirates-
december-14-17-2020-proceedings-eleanna-kafeza/

Collaborative Computing Networking Applications and

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

Ubiquitous Computing and Ambient Intelligence 11th

International Conference UCAmI 2017 Philadelphia PA USA
November 7 10 2017 Proceedings 1st Edition Sergio F.
Ochoa
https://textbookfull.com/product/ubiquitous-computing-and-
ambient-intelligence-11th-international-conference-
ucami-2017-philadelphia-pa-usa-
november-7-10-2017-proceedings-1st-edition-sergio-f-ochoa/

Service Oriented Computing ICSOC 2015 Workshops WESOA

RMSOC ISC DISCO WESE BSCI FOR MOVES Goa India November
16 19 2015 Revised Selected Papers 1st Edition Alex
Norta
https://textbookfull.com/product/service-oriented-computing-
icsoc-2015-workshops-wesoa-rmsoc-isc-disco-wese-bsci-for-moves-
goa-india-november-16-19-2015-revised-selected-papers-1st-
 Michael Maximilien
Services Science Antonio Vallecillo
Jianmin Wang
Marc Oriol (Eds.)
LNCS 10601

Service-Oriented
Computing
15th International Conference, ICSOC 2017
Malaga, Spain, November 13–16, 2017
Proceedings

123
Lecture Notes in Computer Science 10601
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7408
Michael Maximilien Antonio Vallecillo
•

Jianmin Wang Marc Oriol (Eds.)

•

Service-Oriented
Computing
15th International Conference, ICSOC 2017
Malaga, Spain, November 13–16, 2017
Proceedings

123
Editors
Michael Maximilien Jianmin Wang
IBM Clouds Lab Tsinghua University
San Francisco, CA Tsinghua
USA China
Antonio Vallecillo Marc Oriol
ETSI Informatica Polytechnic University of Catalonia
Universidad Malaga Barcelona
Malaga Spain
Spain

ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-319-69034-6 ISBN 978-3-319-69035-3 (eBook)
https://doi.org/10.1007/978-3-319-69035-3

Library of Congress Control Number: 2017956085

LNCS Sublibrary: SL2 – Programming and Software Engineering

© Springer International Publishing AG 2017

The chapter ‘Risk-Based Proactive Process Adaptation’ is licensed under the terms of the Creative Commons
Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/). For further details see
license information in the chapter.
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 International Publishing AG
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
 Preface

Welcome to the Proceedings of ICSOC 2017, the 15th International Conference on

Service-Oriented Computing. ICSOC is the premier international forum for academics,
industry researchers, developers, and practitioners to report and share ground-breaking
work on all topics related to services and service-oriented computing. ICSOC fosters
cross-community scientific innovation and excellence by gathering experts from var-
ious disciplines, such as business process management, distributed systems, computer
networks, wireless and mobile computing, cloud computing, cyber-physical systems,
networking, scientific workflows, services science, data science, management science,
and software engineering.
ICSOC 2017, the 15th event in this series, took place in Málaga, Spain, during
November 13–16, 2017. Following on the ICSOC tradition, it featured three keynote
presentations, a research and industry presentations track, as well as workshops, tool
demonstrations, tutorials, and a PhD track.
Since its beginnings, services have become a core principle in software develop-
ment. They provide perfect mechanisms for modularization, encapsulation, and for
designing, analyzing, and deploying the architecture of large software systems, at the
right level of abstraction, and in terms of loosely coupled, independent, and reusable
parts with well-defined interfaces. Recently, services have gained rapid popularity
across most software disciplines, showing all their benefits for building complex and
critical applications in domains such as cloud computing, the Internet of Things (IoT),
cyber-physical systems, mobile computing, and so on. This pervasive use of services
has become industrially accepted best practice in all these application areas.
The increased success of using services in software and systems engineering has
also raised new challenges, requiring collaborative research across multiple disciplines,
groups, companies, and centers. As with previous editions, this year’s call for papers
generated substantial interest from the community. A total of 179 full research and
industry submissions were received from 23 countries across six continents. Each paper
submission was carefully reviewed by at least three members of the Program Com-
mittee (PC), followed by discussions moderated by a senior PC member who made a
recommendation in the form of a meta-review. The PC consisted of 172 world-class
experts in service-oriented computing and related areas (153 PC members and 19
senior PC members) from 28 different countries. The ICSOC 2017 program featured 33
full papers (acceptance rate of 18%) and 20 short papers. The selected papers cover a
wide variety of important topics in the area of service-oriented computing, including
foundational issues on service discovery and service-systems design, business process
modelling and management, economics of service-systems engineering, as well as
services on the cloud, social networks, IoT, and data analytics.
We would like to express our gratitude to all individuals, institutions, and sponsors
that supported ICSOC 2017. This high-quality program would not have been possible
without the expertise and dedication of our PC members and in particular our senior PC
VI Preface

members. We are also grateful for the guidance of the General Chair, Carlos Canal, the
untiring efforts of external reviewers, and the complete ICSOC Steering Committee.
All of them helped make ICSOC 2017 a great success. Finally, we would like to thank
all the authors who submitted papers to the conference, and we congratulate those
authors whose papers appear in these proceedings. These papers reflect the quality
of the current state of the art in service oriented computing research and practice. We
hope that you find these papers interesting and stimulating.

August 2017 Michael Maximilien

Antonio Vallecillo
Jianmin Wang
 Organization

General Chair
Carlos Canal University of Málaga, Spain

Program Chairs
Michael Maximilian IBM Cloud Labs, USA
Antonio Vallecillo University of Málaga, Spain
Jianmin Wang Tsinghua University, China

Steering Committee Liaison

Jian Yang Macquarie University, Australia

Steering Committee
Boualem Benatallah UNSW, Australia
Fabio Casati University of Trento, Italy
Bernd J. Krämer FernUniversität in Hagen, Germany
Winfried Lamersdorf University of Hamburg, Germany
Heiko Ludwig IBM, USA
Mike Papazoglou Tilburg University, The Netherlands
Jian Yang Macquarie University, Australia
Liang Zhang Fudan University, China

Workshop Chairs
Lars Braubach Hochschule Bremen, Germany
Juan M. Murillo University of Extremadura, Spain

Demonstration Chairs
Nima Kaviani IBM and Curatio.me, USA
Manuel Lama University of Santiago de Compostela, Spain

Industry Chairs
Flavio de Paoli University of Milano-Bicocca, Italy
Antonio Ruiz University of Seville, Spain
VIII Organization

Panel Chairs
Schahram Dustdar Technical University, Vienna, Austria
Michael Sheng University of Adelaide, Australia

PhD Symposium Chairs

Loli Burgeño University of Málaga, Spain
Naouel Moha Université du Qüebec à Montréal, Canada

Finance Chair
Bernd J. Krämer FernUniversität in Hagen, Germany

Local Organization Chair

Ernesto Pimentel University of Málaga, Spain

Local Organization
Jose M. Álvarez Palomo University of Málaga, Spain
Francisco Durán University of Málaga, Spain
Nathalie Moreno University of Málaga, Spain
Alejandro Pérez Vereda University of Málaga, Spain
Mónica Trella University of Málaga, Spain

Publication Chair
Marc Oriol Universitat Politècnica de Catalunya

Publicity Chairs
Guadalupe Ortiz University of Cádiz, Spain
Juan Manuel Vara Rey Juan Carlos University, Spain
Genoveva Vargas-Solar CNRS, France

Web Chairs
Javier Berrocal University of Extremadura, Spain
J. Manuel García-Alonso University of Extremadura, Spain

Senior Program Committee

Boualem Benatallah UNSW, Australia
Athman Bouguettaya University of Sydney, Australia
Fabio Casati University of Trento, Italy
 Organization IX

Flavio De Paoli Università di Milano Bicocca, Italy

Schahram Dustdar TU Wien, Austria
Xavier Franch Universitat Politècnica de Catalunya, Spain
Aditya Ghose University of Wollongong, Australia
Mohand Said Hacid University of Lyon, France
Grace Lewis Carmegie Mellon Software Engineering Institute, USA
Cesare Pautasso University of Lugano, Switzerland
Barbara Pernici Politecnico di Milano, Italy
Gustavo Rossi UNLP, Argentina
Antonio Ruiz-Cortés University of Seville, Spain
Michael Sheng University of Adelaide, Australia
Stefan Tai TU Berlin, Germany
Zahir Tari RMIT University, Australia
Samir Tata IBM Research – Almaden, USA
Mathias Weske HPI/University of Potsdam, Germany
Jian Yang Macquarie University, Australia
Liang Zhang Fudan University, China

Program Committee
Rama Akkiraju IBM, USA
Pedro Álvarez Universidad de Zaragoza, Spain
Vasilios Andrikopoulos University of Groningen, The Netherlands
Alvaro Arenas Instituto de Empresa Business School, Spain
Ebrahim Bagheri Ryerson University, Canada
Luciano Baresi Politecnico di Milano, Italy
Nejib Ben Hadj-Alouane National School of Engineers of Tunis (ENIT), Tunisia
Moez Ben Haj Hmida National Engineering School of Tunis (ENIT), Tunisia
Salima Benbernou Université Paris Descartes, France
Djamal Benslimane University of Lyon, France
Sami Bhiri Telecom SudParis, France
Domenico Bianculli University of Luxembourg, Luxembourg
Walter Binder University of Lugano, Switzerland
Omar Boucelma Aix-Marseille University, France
Lars Braubach Hochschule Bremen, Germany
Christoph Bussler Oracle Corporation, USA
Cristina Cabanillas Vienna University of Economics and Business, Austria
Manuel Carro UPM and IMDEA Software Institute, Spain
Wing-Kwong Chan City University of Hong Kong, SAR China
Francois Charoy University of Lorraine, France
Faouzi Ben Charrada University of Tunis El Manar, Tunisia
Sanjay Chaudhary Ahmedabad University, India
Liang Chen RMIT, Australia
Shiping Chen CSIRO, Australia
Lawrence Chung The University of Texas at Dallas, USA
Edward Curry Insight Centre, Ireland
X Organization

Hoa Khanh Dam University of Wollongong, Australia

Florian Daniel University of Trento, Italy
Bruno Defude Telecom Sud Paris, France
Shuiguang Deng Zhejiang University, China
Nirmit Desai IBM T.J. Watson Research Center, USA
Hai Dong RMIT, Australia
Khalil Drira LAAS Toulouse, France
Yucong Duan Hainan University, China
Joyce El Haddad University of Paris Dauphine, France
Rik Eshuis Eindhoven University of Technology, The Netherlands
Onyeka Ezenwoye Georgia Regents University, USA
Noura Faci Université Lyon 1, CNRS, France
Marcelo Fantinato University of São Paulo, Brazil
Pablo Fernández Universidad de Sevilla, Spain
Joao E. Ferreira University of Sao Paulo, Brazil
Marios-Eleftherios Fokaefs York University, Canada
Xiang Fu Hofstra, USA
Walid Gaaloul Telecom SudParis, France
N.D. Gangadhar MS Ramaiah University of Applied Sciences, India
G.R. Gangadharan IDRBT, Hyderabad, India
Felix Garcia Universidad Castilla-La mancha, Spain
Paolo Giorgini University of Trento, Italy
Claude Godart University of Lorraine, France
Mohamed Graiet ISIMM, Tunisia
Sven Graupner HP Labs, Palo Alto, USA
Daniela Grigori University of Paris Dauphine, France
Georg Grossmann University of South Australia, Australia
Armin Haller Australian National University, Australia
Jun Han Swinburne University of Technology, Australia
Chihab Hanachi IRIT Laboratory, Toulouse University, France
Qiang He Swinburne University of Technology, Australia
Bernhard Holtkamp Fraunhofer ISST, Germany
Richard Hull IBM Research, USA
Patrick Hung University of Ontario, Canada
Fuyuki Ishikawa National Institute of Informatics, Japan
Hai Jin HUST, China
Nima Kaviani IBM and Curatio.me, USA
Ejub Kajan State University of Novi Pazar, Serbia
Anup Kalia IBM Research NY, USA
Dimka Karastoyanova Kühne Logistics University, Germany
Raman Kazhamiakin Fondazione Bruno Kessler, Italy
Marouane Kessentini University of Michigan–Dearborn, USA
Kais Klai University of Paris 13, France
Ryan Ko University of Waikato, New Zealand
Gerald Kotonya Lancaster University, UK
Peep Kungas University of Tartu, Estonia
 Organization XI

Philippe Lalanda Joseph Fourier University, France

Manuel Lama University of Santiago de Compostela, Spain
Philipp Leitner University of Zurich, Switzerland
Henrik Leopold VU University Amsterdam, The Netherlands
Frank Leymann University of Stuttgart, Germany
Ying Li Zhejiang University, China
Marin Litoiu York University, Canada
Xuanzhe Liu Peking University, China
Xumin Liu Rochester Institute of Technology, USA
Alessio Lomuscio Imperial College London, UK
Jiangang Ma Victoria University, Australia
Zakaria Maamar Zayed University, United Arab Emirates
Javam Machado UFC, Brazil
Zaki Malik Wayne State University, USA
Maude Manouvrier University of Paris Dauphine, France
Jordi Marco Universitat Politècnica de Catalunya, Spain
Massimo Mecella Sapienza Università di Roma, Italy
Brahim Medjahed University of Michigan – Dearborn, USA
Tommi Mikkonen Mozilla and Tampere University of Technology,
Finland
Lars Moench University of Hagen, Germany
Mohamed Mohamed IBM Almaden Research Center, USA
Hamid Reza IBM Research, USA
Motahari-Nezhad
Juan M. Murillo Universidad Extremadura, Spain
Michael Mrissa University of Lyon, France
Nanjangud C. Narendra Ericsson Research, Bangalore, India
Surya Nepal CSIRO, Australia
Anne Ngu Texas State University, USA
Talal H. Noor Taibah University, Saudi Arabia
Alex Norta Tallinn University of Technology, Estonia
Helen Paik UNSW, Australia
Olivier Perrin Lorraine University, France
Pierluigi Plebani Politecnico di Milano, Italy
Pascal Poizat Université Paris Ouest and LIP6, France
Artem Polyvyanyy Queensland University of Technology, Australia
Karthikeyan Ponnalagu IBM Research, India
Mu Qiao IBM Almaden Research Center, USA
Mohamed Quafafou Aix-Marseille University, France
Manfred Reichert University of Ulm, Germany
Wolfgang Reisig Humboldt-Universität zu Berlin, Germany
Stefanie Rinderle-Ma University of Vienna, Austria
Colette Roland Universite Paris1 Panthéon Sorbonne, France
Mohammad Sadoghi IBM T.J. Watson Research Center, USA
Diptikalyan Saha IBM Research, India
Iman Saleh University of Miami, USA
XII Organization

Aviv Segev KAIST, South Korea

Lionel Seinturier University of Lille, France
Mohamed Sellami ISEP, France
Jun Shen University of Wollongong, Australia
Ignacio Silva-Lepe IBM, USA
Sergey Smirnov SAP, Germany
George Spanoudakis City University London, UK
Eleni Stroulia University of Alberta, Canada
Yehia Taher University of Versailles-St-Quentin-en-Yvelines,
France
Guiling Wang North China University of Technology, China
Jianwu Wang University of Maryland, Baltimore County, USA
Xianzhi Wang The University of Adelaide, Australia
Yan Wang Macquarie University, Australia
Zhongjie Wang Harbin Institute of Technology, China
Ingo Weber NICTA, Australia
Lijie Wen Tsinghua University, China
Matthias Weidlich Imperial College London, UK
Hanchuan Xu Harbin Institute of Technology, China
Hamdi Yahyaoui Kuwait University, Kuwait
Sami Yangui Concordia University, Canada
Lina Yao UNSW, Australia
Jianwei Yin Zhejiang University, China
Sira Yongchareon Unitec Institute of Technology, New Zealand
Jian Yu Auckland University of Technology, New Zealand
Qi Yu Rochester Institute of Technology, USA
Uwe Zdun University of Vienna, Austria
Weiliang Zhao Macquarie University, Australia
Yan Zheng Aalto University/Xidian University, Finland
Zibin Zheng Sun Yat-sen University, China
Zhangbing Zhou China University of Geosciences (Beijing), China
Floriano Zini University of Bologna, Italy
Andrea Zisman City University London, UK
Ying Zou Queens University, Canada

Additional Reviewers
Hiba Alili Paris-Dauphine University, France
Moayad Alshangiti Rochester Institute of Technology, USA
Mohammad-Javad Amiri University of California at Santa Barbara, USA
Kahina Bessai Lorraine University, France
Walid Fdhila University of Vienna, Austria
Manuel Gall University of Vienna, Austria
Conrad Indiono University of Vienna, Austria
Diana Jlailaty Paris-Dauphine University, France
Georg Kaes University of Vienna, Austria
 Organization XIII

Veronica Leisaputra Unitec, New Zealand

Rodrigo Alves Lima University of Sao Paulo, Brazil
Xuan Lu Peking University, China
Yun Ma Peking University, China
Hoang Long Nguyen Lorraine University, France
Bruno Padilha University of Sao Paulo, Brazil
Yevgen Pikus Fraunhofer ISST, Germany
Ignacio García-Rodríguez University of Castilla-La Mancha, Spain
Guillaume Rosinosky Lorraine University, France
Sana Sellami Aix-Marseille University, France
Manuel Angel Serrano University of Castilla-La Mancha, Spain
Martín
Upendra Sharma IBM Watson Health, USA
Fatma Slaimi Aix-Marseille University, France
Weishi Shi Rochester Institute of Technology, USA
Florian Stertz University of Vienna, Austria
Daniel Sun CSIRO, Australia
Gael Thomas Telecom SudParis, Samovar, France
Norbert Weissenberg Fraunhofer ISST, Germany
Keynote Papers
 A Research Agenda for the Programmable
World: Software Challenges for IoT Era

Tommi Mikkonen

University of Helsinki, Gustav Hällströmin katu 2b, Helsinki, Finland

tommi.mikkonen@helsinki.fi

Abstract. The Internet of Things (IoT) represents the next significant step in the
evolution of the connectivity and programmability. While the majority of
research work in the IoT area today is about data acquisition, real-time and
offline analytics, machine learning, data visualization and other fashionable big
data topics, in this keynote we argue that there is in fact even more profound
change that we are facing – the programmability aspect that is intimately
associated with all IoT systems. Advances in computing hardware development
are making it feasible to introduce full-fledged operating systems in even
smallest devices; advances in radio and battery technologies are enabling con-
stant connectivity in the Global scale. This new world that is populated by
programs of various degree of complexity requires programming skills in var-
ious fields that we now typically consider distinct, including in particular web
and mobile development on the surface, and embedded and distributed software
development at the core. Combining the characteristics of these fields will also
force us to reconsider some of the fundamentals of software engineering in the
process.

Keywords: Internet of Things • Programmable world • Software engineering •

Embedded software • Web programming
 Semantic Search

Ricardo Baeza-Yates

NTENT, USA & Spain

ricardo.baeza@upf.edu

Abstract. Semantic search lies in the cross roads of information retrieval and
natural language processing and is the current frontier of search technology. The
first part consist in building a semantically annotated index with the help of a
knowledge base. For this we first need to predict the language of each document
and parse it accordingly to that language. Second, we need to extract all entities
and concepts mentioned in the document with the help of the knowledge base.
All the knowledge base infrastructure needs to be independent of the language
and we instantiate each language in the lexicon of the knowledge base.
The second part is predicting the intention behind the query, which implies
doing semantic query understanding. This process implies the same semantic
processing as document. After, based on all this information, we have to predict
one or more possible intentions with a certain probability, which is particularly
important for ambiguous queries. These scores will be one of the inputs for the
final semantic ranking. For example, given the query “bond”, possible results for
query understanding are a financial instrument, the movie character, a chemical
reaction, or a term for endearment.
Semantic ranking refers to ranking search results using semantic information.
In a standard search engine, a rank is computed by using signals or features
coming from the search query, from the documents in the collection being
searched and from the search context, such as the language and device being
used. In our case we add semantic relations between the entities and concepts
found in the query was the same objects in the documents, that will come from
different data sources. For this we use machine learning in several stages. The
first stage selects the data sources that we should use to answer the query. In the
second stage, each data source generates a set of answers using “earning to
rank.” The third and final stage ranks these data sources, selecting and ordering
the intentions as well as the answers inside each intention (e.g., news) that will
appear in the final composite answer. All these stages are language independent,
but may use language dependent features.
We will cover the process above having in mind a services-based approach,
including the data science needed to use as relevance feedback the usage log
stream of the semantic search engine.
 “Uber Scale”. Stories and Lessons
from the History of Scaling Uber SOA

Chritopher Adams

UBER
cadams@uber.com

Abstract. In this talk, Chris will discuss how Uber scaled several key compo-
nents of its SOA infrastructure, and extrapolate some lessons and useful
strategies that other companies can apply as they scale.
 Contents

Applications

Similarity Computation Exploiting the Semantic and Syntactic

Inherent Structure Among Job Titles . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
Sarthak Ahuja, Joydeep Mondal, Sudhanshu Shekhar Singh,
and David Glenn George

RISE: Resolution of Identity Through Similarity Establishment

on Unstructured Job Descriptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
Rakesh Rameshrao Pimplikar, Kalapriya Kannan, Abhik Mondal,
Joydeep Mondal, Sushant Saxena, Gyana Parija,
and Chandra Devulapalli

Social-Sensor Cloud Service for Scene Reconstruction. . . . . . . . . . . . . . . . . 37

Tooba Aamir, Athman Bouguettaya, Hai Dong, Sajib Mistry,
and Abdelkarim Erradi

Quark: A Methodology to Transform People-Driven Processes

to Chatbot Services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
Anup K. Kalia, Pankaj R. Telang, Jin Xiao, and Maja Vukovic

Foundations

Cloud Certification Process Validation Using Formal Methods . . . . . . . . . . . 65

Maria Krotsiani, Christos Kloukinas, and George Spanoudakis

Validation of Service Blueprint Models by Means of Formal

Simulation Techniques. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80
Montserrat Estañol, Esperanza Marcos, Xavier Oriol,
Francisco J. Pérez, Ernest Teniente, and Juan M. Vara

Deadlock-Freeness Verification of Business Process Configuration

Using SOG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96
Souha Boubaker, Kais Klai, Katia Schmitz, Mohamed Graiet,
and Walid Gaaloul

Formally Modeling, Executing, and Testing Service-Oriented Systems

with UML and OCL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 113
Loli Burgueño and Martin Gogolla
XXII Contents

Mining and Analytics

App Update Patterns: How Developers Act on User Reviews

in Mobile App Stores . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
Shance Wang, Zhongjie Wang, Xiaofei Xu, and Quan Z. Sheng

Predicting the Evolution of Service Value Features from User Reviews

for Continuous Service Improvement . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 142
Xu Chi, Haifang Wang, Zhongjie Wang, Shiping Chen, and Xiaofei Xu

Confidence-Aware Reputation Bootstrapping in Composite

Service Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 158
Lie Qu, Athman Bouguettaya, and Azadeh Ghari Neiat

Compound Trace Clustering to Generate Accurate and Simple

Sub-Process Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
Yaguang Sun, Bernhard Bauer, and Matthias Weidlich

An Approach to Modeling and Discovering Event Correlation

for Service Collaboration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
Meiling Zhu, Chen Liu, Jianwu Wang, Shen Su, and Yanbo Han

Energy Efficient Scheduling of Application Components via Brownout

and Approximate Markov Decision Process . . . . . . . . . . . . . . . . . . . . . . . . 206
Minxian Xu and Rajkumar Buyya

Predicting the Available Bandwidth on Intra Cloud Network Links

for Deadline Constrained Workflow Scheduling in Public Clouds . . . . . . . . . 221
Rachael Shaw, Enda Howley, and Enda Barrett

Inferring Calling Relationship Based on External Observation

for Microservice Architecture . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
Shinya Kitajima and Naoki Matsuoka

Quality of Service

A QoS-Aware Resource Allocation Controller for Function

as a Service (FaaS) Platform. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241
MohammadReza HoseinyFarahabady, Young Choon Lee,
Albert Y. Zomaya, and Zahir Tari

Probabilistic Qualitative Preference Matching in Long-Term

IaaS Composition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 256
Sajib Mistry, Athman Bouguettaya, Hai Dong, and Abdelkarim Erradi
 Contents XXIII

An Embedding Based Factorization Machine Approach for Web Service

QoS Prediction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 272
Yaoming Wu, Fenfang Xie, Liang Chen, Chuan Chen, and Zibin Zheng

A Deep Learning Approach for Long Term QoS-Compliant

Service Composition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
Hamza Labbaci, Brahim Medjahed, and Youcef Aklouf

Run-time Service Operation and Management

An Artifact-Driven Approach to Monitor Business Processes

Through Real-World Objects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
Giovanni Meroni, Claudio Di Ciccio, and Jan Mendling

BenchFoundry: A Benchmarking Framework for Cloud Storage Services . . . . 314

David Bermbach, Jörn Kuhlenkamp, Akon Dey,
Arunmoezhi Ramachandran, Alan Fekete, and Stefan Tai

Automated Analysis of Cloud Offerings for Optimal Service Provisioning . . . 331

José María García, Octavio Martín-Díaz, Pablo Fernandez,
Antonio Ruiz-Cortés, and Miguel Toro

Middleware for Dynamic Upgrade Activation and Compensations

in Multi-tenant SaaS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 340
Dimitri Van Landuyt, Fatih Gey, Eddy Truyen, and Wouter Joosen

Service Adaptation

Risk-Based Proactive Process Adaptation . . . . . . . . . . . . . . . . . . . . . . . . . . 351

Andreas Metzger and Philipp Bohn

A Debt-Aware Learning Approach for Resource Adaptations

in Cloud Elasticity Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367
Carlos Mera-Gómez, Francisco Ramírez, Rami Bahsoon,
and Rajkumar Buyya

Large-Scale and Adaptive Service Composition Using Deep

Reinforcement Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 383
Hongbing Wang, Mingzhu Gu, Qi Yu, Huanhuan Fei, Jiajie Li,
and Yong Tao

Service Engineering

: An Adaptive Orchestration Platform for Hybrid Dataflows

across Cloud and Edge . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 395
Pushkara Ravindra, Aakash Khochare, Siva Prakash Reddy,
Sarthak Sharma, Prateeksha Varshney, and Yogesh Simmhan
XXIV Contents

Ensuring and Assessing Architecture Conformance to Microservice

Decomposition Patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 411
Uwe Zdun, Elena Navarro, and Frank Leymann

Polly: A Language-Based Approach for Custom Change Detection

of Web Service Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 430
Elyas Ben Hadj Yahia, Jean-Rémy Falleri, and Laurent Réveillère

Design and Evaluation of a Self-Service Delivery Framework. . . . . . . . . . . . 445

Constantin Adam, Nikos Anerousis, Muhammed Fatih Bulut,
Robert Filepp, Anup Kalia, Brian Peterson, John Rofrano,
Maja Vukovic, and Jin Xiao

Automated Generation of REST API Specification from Plain

HTML Documentation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 453
Hanyang Cao, Jean-Rémy Falleri, and Xavier Blanc

Efficient Keyword Search for Building Service-Based Systems Based

on Dynamic Programming . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 462
Qiang He, Rui Zhou, Xuyun Zhang, Yanchun Wang, Dayong Ye,
Feifei Chen, Shiping Chen, John Grundy, and Yun Yang

Supporting the Decision of Migrating to Microservices

Through Multi-layer Fuzzy Cognitive Maps . . . . . . . . . . . . . . . . . . . . . . . . 471
Andreas Christoforou, Martin Garriga, Andreas S. Andreou,
and Luciano Baresi

A Tree-Based Reliability Analysis for Fault-Tolerant Web

Services Composition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 481
Yanjun Shu, Decheng Zuo, Hongwei Liu, Quan Z. Sheng,
Wei Emma Zhang, and Jian Yang

Modernization of Information Systems at Red.es: An Approach Based

on Gap Analysis and ADM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 490
Marcos López-Sanz, Valeria de Castro, Esperanza Marcos,
and Jorge Moratalla

Improving Web Services Design Quality Using Dimensionality

Reduction Techniques . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 499
Hanzhang Wang and Marouane Kessentini

Service Recommendation

ARA-Assessor: Application-Aware Runtime Risk Assessment

for Cloud-Based Business Continuity. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 511
Min Fu, Shiping Chen, Jian Yang, Surya Nepal, and Liming Zhu
 Contents XXV

Personalized Quality Centric Service Recommendation . . . . . . . . . . . . . . . . 528

Yiwen Zhang, Xiaofei Ai, Qiang He, Xuyun Zhang, Wanchun Dou,
Feifei Chen, Liang Chen, and Yun Yang

Cataloger: Catalog Recommendation Service for IT Change Requests . . . . . . 545

Anup K. Kalia, Jin Xiao, Muhammed F. Bulut, Maja Vukovic,
and Nikos Anerousis

ATLAS: A World-Wide Travel Assistant Exploiting Service-Based

Adaptive Technologies. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 561
Antonio Bucchiarone, Martina De Sanctis, and Annapaola Marconi

Services in Organizations, Business and Society

A Variability Model for Store-Oriented Software Ecosystems:

An Enterprise Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 573
Bahar Jazayeri, Olaf Zimmermann, Gregor Engels,
and Dennis Kundisch

An Analysis of RESTful APIs Offerings in the Industry . . . . . . . . . . . . . . . 589

Antonio Gamez-Diaz, Pablo Fernandez, and Antonio Ruiz-Cortes

Efficient Influential Individuals Discovery on Service-Oriented

Social Networks: A Community-Based Approach . . . . . . . . . . . . . . . . . . . . 605
Fanghua Ye, Jiahao Liu, Chuan Chen, Guohui Ling, Zibin Zheng,
and Yuren Zhou

Empirical Study on REST APIs Usage in Android Mobile Applications. . . . . 614

Mohamed A. Oumaziz, Abdelkarim Belkhir, Tristan Vacher,
Eric Beaudry, Xavier Blanc, Jean-Rémy Falleri, and Naouel Moha

Services in the Cloud

Revenue-Driven Service Provisioning for Resource Sharing

in Mobile Cloud Computing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 625
Hongyue Wu, Shuiguang Deng, Wei Li, Jianwei Yin, Qiang Yang,
Zhaohui Wu, and Albert Y. Zomaya

Continuous Learning as a Service for Conversational Virtual Agents . . . . . . . 641

Shivali Agarwal, Shubham Atreja, and Gargi Dasgupta

Costradamus: A Cost-Tracing System for Cloud-Based Software Services . . . 657

Jörn Kuhlenkamp and Markus Klems

An Automatic Approach for Transforming IoT Applications

to RESTful Services on the Cloud. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
Yu Zhao, Ying Zou, Joanna Ng, and Daniel Alencar da Costa
XXVI Contents

RobOps: Robust Control for Cloud-Based Services . . . . . . . . . . . . . . . . . . . 690

Cheng Chen, Jordi Arjona Aroca, and Diego Lugones

Serverless Execution of Scientific Workflows . . . . . . . . . . . . . . . . . . . . . . . 706

Qingye Jiang, Young Choon Lee, and Albert Y. Zomaya

A Market-Based Approach for Detecting Malware in the Cloud

via Introspection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 722
Nada Alruhaily, Carlos Mera-Gómez, Tom Chothia, and Rami Bahsoon

Trustless Intermediation in Blockchain-Based Decentralized

Service Marketplaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 731
Markus Klems, Jacob Eberhardt, Stefan Tai, Steffen Härtlein,
Simon Buchholz, and Ahmed Tidjani

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 741

Applications
Similarity Computation Exploiting the Semantic
and Syntactic Inherent Structure
Among Job Titles

Sarthak Ahuja1(B) , Joydeep Mondal1 , Sudhanshu Shekhar Singh1 ,

and David Glenn George2
1
IBM Research Lab, New Delhi, India
sarahuja@in.ibm.com
2
IBM Talent Management Solutions, Portsmouth, UK

Abstract. Solutions providing hiring analytics involve mapping com-

pany provided job descriptions to a standard job framework, thereby
requiring computation of a similarity score between two jobs. Most sys-
tems doing so apply document similarity computation methods to all
pairs of provided job descriptions. This approach can be computationally
expensive and adversely impacted by the quality of the job descriptions
which often include information not relevant to the job or candidate qual-
ifications. We propose a method to narrow down pairs of job descriptions
to be compared by comparing job titles first. The observation that each
job title can be decomposed into three components, domain, function
and attribute, forms the basis of our method. Our proposal focuses on
training the machine learning models to identify these three components
of any given job title. Next we do a semantic match between the three
identified components, and use those match scores to create a composite
similarity score between any two pair of job titles. The elegance of this
solution lies in the fact that job titles are the most concise definition
of the job and the resulting matches can easily be verified by human
experts. Our results show that the approach provides extremely reliable
results.

1 Introduction
The problem of finding similarity between a pair of documents lays groundwork
for the problem of clustering similar documents together. Most of the initial
research in this domain was based on standard document similarity computing
methods such as tf- IDF, LSA, LDA etc. In certain specific scenarios, such as
job descriptions in recruitment domain, the documents have very precise titles
as well. Doing a preliminary match between pairs of titles can greatly reduce the
effort required to eventually compare documents for similarity.
In our work for the recruitment analytics domain, and the recent develop-
ments therein, one problem that we have faced time and again is that of identi-
fying which job requisitions are similar. This problem arises in two contexts:
c Springer International Publishing AG 2017
M. Maximilien et al. (Eds.): ICSOC 2017, LNCS 10601, pp. 3–18, 2017.
https://doi.org/10.1007/978-3-319-69035-3_1
4 S. Ahuja et al.

1. Machine Learning models to identify good candidates: A typical application

of machine learning in hiring is to learn success models for various jobs. To
be meaningful, the models need to be learnt at a job group level instead of
job level, so that sufficient data can be obtained for training the models.
2. Candidates’ previous jobs need to be matched with the opening they apply
to (or to the openings that can be recommended to them). This requires
comparing an applicant’s job previous jobs to the job openings available in
the applicant tracking system.
Job requisitions typically consist of several well-defined components: required
skills, years of experience, job title, job location and a job description. Since
required skills, years of experience and job location are well-defined structured
fields, the complexity comes in matching job title and job descriptions across
jobs. In this paper, we present a Parts Of Title (POT) tagging and wordnet
based matching technique to create a match score for two job titles.
Our work here is based on the basic premise that any given job title can be
broken into three components Attribute, Function and Domain. Attribute typi-
cally denotes some sense of hierarchy (Senior, Junior, lead etc.), function denotes
functionality (Manager, supervisor, director etc.), while domain is about the core
job area. For example, a senior software engineer is a software (domain) engineer
(function) at senior level. A senior electrical engineer is an electrical (domain)
engineer at senior level. Although the two job titles have two out of three com-
mon words, they are obviously not the same jobs. A software engineer or even a
junior software developer is a much closer job to senior software engineer than
senior electrical engineer.
These three components might contains multiple words, or can also be null
depending upon the context. Our work here describes a method that utilizes
semantic match scoring between the three components, and combining those
scores using logical domain insights to create a match score between a pair of
job titles.
This paper is organized as follows. The next section describes some liter-
ature on title or phrase similarity/clustering. Section 3 describes the complete
pipeline and methodology. Section 4 explains the methodology, Sect. 5 presents
our evaluation and results. Section 6 concludes and discusses some future work.

2 Literature Survey
In typical text document classification and clustering tasks, the definition of a
distance or similarity measure is essential. The most common methods employ
keyword matching techniques. Methods such TFIDF [2] leverage the frequency
of words occurring in a document to infer on similarity. The assumption is that if
two documents have a similar distribution of words or have common keywords,
then they are similar. Researchers have also extended this to N-gram based
models, where group of consecutive words are taken together to capture the
context. With large N gram models, typically large corpus of documents are
required to obtain sufficient statistical information. As could be seen from the
 Similarity Computation Exploiting 5

senior software engineer versus senior electrical engineer example in the previous
section, these traditional document similarity methods do not work so well when
matching short snippets of text, such as job titles. There are methods involving
web based kernel function [10], wherein results of web search query are used to
provide context to the short terms being compared. This paper defines a semantic
similarity kernel function based on query search results, mathematically analyze
some of its properties (similarity score going to 1 for similar queries as the query
results sets cover all the relevant documents; the kernel measuring mean topical
distance between the queries), and provide examples of its efficacy.
An alternative classification system [3] employs lazy learning from labeled
phrases, and present a strong argument in favor of their method when the prop-
erty of near sufficiency (most of information on document labels is captured
in phrases) holds. They also reveal that in all practical cases from small-scale
to very large-scale manual labeling of phrases is feasible as natural language
constrains the number of common phrases composed of a vocabulary to grow
linearly with the size of the vocabulary. Variants of phrase based classification
have been studied in Information retrieval [9] and it has the advantage of ease
of explainability.
Rich document representations and similarity measures are also an option
for job title classification [11]. Semantic enrichment strategies replace the bag
of words (BOW) representation that is more popular text classification as it is
less adept at handling synonyms, polysemous words and multi word expressions.
A machine learning- based semi-supervised job title classification system [4],
leveraging a varied collection of classification and clustering tools and techniques,
can be used to tackle the challenges of designing a scalable classification system
for a large taxonomy of job categories.
A technical report [8] on learning compound noun semantics discusses an
annotation scheme for compound nouns to derive compound relations (BE,
HAVE, IN, ABOUT, ACTOR, (INST(rument))), and uses this annotation
scheme to meaningfully compare compound nouns. This report inspired us to
create learners to tag the three components of a job descriptions for a mean-
ingful comparison between them. The final paper [7] combines pattern-based
extraction and bootstrapping for noun compounds interpretation. They use a
two-step algorithm to jointly harvest NCs and patterns (verbs and prepositions)
that interpret them for a given abstract relation.

3 Methodology

Our proposed approach to generate a similarity score between two titles T and T 
is illustrated in Figs. 1 and 2. In the former we illustrate the steps for setting up
the system and in the latter we depict the steps that take place in the deployed
system.
We start with a labeled dataset of titles, where each constituent keyword
has been labeled with a particular context in which it occurs. For our training
phase as described in Fig. 1 we use 90% of this data, while the remaining 10%
6 S. Ahuja et al.

Fig. 1. Training Phase. In (1) titles for all documents available in the training set are
extracted and their keywords are labeled with the ground truth context. Next in (2) for
each of these keywords a dictionary is built using WordNet to maintain top synonyms
and corresponding similarity scores on a cloud database for faster computation. Later in
(3) feature vectors for each keyword are extracted and passed onto the Model Training
phase. Finally, all permutations of arrangement of models are trained on the dataset
and the arrangement with the highest validation accuracy is stored for deployment and
evaluation on the testing dataset.
Another random document with
no related content on Scribd:
"What's it all about?" Saxton asked.
"I suspect there's another cat in the neighborhood," Wallace
answered.
Saxton pointed to the center of the clearing. Beneath a tree the
oldster with the scar on his arm sat alone, seemingly unaware that
the others had left him.
"Are they using their chief for a decoy?" Saxton asked.
"Perhaps the old duffer isn't the chief," Wallace answered. He
reached for his firearm.
A dirt-encrusted hand closed over his own. He looked up. Al-fin shook
his head.
Wallace turned to look back at the clearing just in time to see a big
cat step out of the bushes. It glanced across at them with an easy
hate in its red-shot eyes, and turned its attention to the fat man, who
was nearer. Slowly it gathered itself to spring.
Wallace shrugged off Al-fin's hand, that still rested on his, just as the
cat left its feet. He had no chance to fire. The cat finished its spring—
and the ground caved in beneath its feet. A moment later they heard
its snarling and spitting from several yards underground.
Calmly, unhurriedly, the natives picked boulders from the ground and
carried them to the pit. They dropped or threw them down on the cat
until its snarls changed from anger to pain, and died completely.
Wallace and Saxton walked to the edge of the pit and looked down.
The cat was dead. Its carcass lay sprawled over those of another
dozen of its kind.
"Evidently they've used this method often before," Wallace remarked.
A thought occurred to him and he looked at Saxton.
Saxton nodded in unspoken agreement. "We've just seen another
demonstration of that ability we're trying to find," he said.
"But what is it?" Wallace asked.
"Can it be anything except acute hearing?"
"If it was only that, how did they know where the cat would appear,
and what it would do? If it had circled the pit they would have been
helpless. Yet they did nothing except retreat to the far side of the
clearing and wait."
Saxton shook his head in defeat. "They did act with plenty of
assurance—but how did they know? Do you think we should stay
around some more, and watch how they operate?"
Wallace glanced up at the rapidly moving sun. "We'd better get back
to the ship," he said. "We have only about enough time to reach it
before dark. We can come back again tomorrow, if you want."

That evening as he lay on his bunk, Wallace noted that Saxton was
growing restless again. Their being unable to find a way to evade the
bloodhound was bringing the irritable part of his nature to the surface.
The time had come again to furnish diversion. "I'm sure we have all
the clues on those savages," he said. "If we just understood how to fit
them together."
It worked. Saxton stopped pacing and bared his teeth in a smile. "You
still think they developed some special ability, don't you?" he asked. "I
don't agree. Nineteen hundred years—the time the colony's been
here—is too short for any change to take place. Evolution doesn't
work that fast."
"I'm not thinking of the slow process of adaptation," Wallace said,
"where the most fit, and their descendants, are the ones that tend to
survive and propagate. What I had in mind was a form of genetic
change. Such as a plant, or an animal, appearing that is different
from the rest of its species. A botanist, or a biologist, would call it a
'sport.' Like the appearance of a black rose on a bush of red roses. If
the black rose is more fitted to survive in its environment, or if it is
artificially propagated, it would soon replace the red."
"You think then that a child was born here with a difference that made
it more fit to survive in this environment than the others, and that the
savages we saw are its direct descendants?"
Wallace nodded.
"But wouldn't it be too much of a coincidence that the particular trait
should appear just when it was needed?"
"I don't think so," Wallace said. "Nature has a way of providing the
particular trait just at the time it is most needed. A good example is
the way more male children are born during a war. There's no known
explanation for something like that. But nature seems to know what is
needed—and provides it."
"That sounds plausible," Saxton said, after a minute of consideration.
"According to your theory, then, those savages possess an ability
radically different from that of normal humans?"
"Not necessarily radically different," Wallace answered. "It would
probably be a trait inherent in all of us, but not so evident, or fully
developed. Or perhaps it has made its appearance before, in rare
individuals, but not being a survival characteristic—where it appeared
—it died. Something like telepathy, or poltergeism, or any of the other
so-called wild talents."
"I'll admit I'm stumped," Saxton said. "And I don't think we'll learn
anything more here without staying and observing them a lot longer
than I'd care to. If we ever get back home, there are specialists in that
sort of thing, who can do more with the facts we gave them than we
can."
Wallace sighed. "I suppose you're right," he said. "I hope we learn
what it is before we leave, but of course we can't wait if we get the
chance to go."

Early the next afternoon they spied a figure hurrying toward them
from the edge of the wood.
"It's Al-fin," Saxton said. "I wonder why he's in such a hurry."
"He's carrying something under his arm," Wallace commented.
They waited while the native puffed his way up the bank of the small
plateau on which the spaceship rested. When he reached them he
stood for a moment fighting to regain his breath. It was evident that
he had run long and hard.
Pushing his package under one arm, Al-fin raised the other and
pointed at the sky. Bringing his arm around in a wide half-circle, he
made a sound with his lips like an Earth bumblebee. When he
reached the end of the half-circle he held a finger out in a long point.
He ended the performance by holding his hand out toward the
spaceship and making a scooping motion—as though he were
throwing it into the air. Three times he repeated the maneuver.
Wallace watched him in puzzled silence. At the end of the third
repetition his eyes widened with slowly dawning understanding. He
ran for the portal of the ship. "I'll be right back," he tossed over his
shoulder.
Inside he glanced quickly at the s-tracer. Its needles indicated that the
bloodhound was directly across the planet from them!
He dashed back to the open portal. "Inside! Quick!" he called to
Saxton.
Saxton wasted not a minute in obeying. As he pushed past Wallace,
Al-fin came to the portal of the ship. He extended the parcel he had
been carrying under his arm to Wallace. "Meat," he said. "Bye."
"Thanks," Wallace answered, taking the gift. "Thanks—for
everything." He closed the portal quickly.

Three hours later they were in hyperspace. Another five minutes and
they were in the Ten Thousand Worlds portion of the galaxy—and
safe.
Saxton turned over on his side. He had made a faster recovery from
the nausea of the bridge than usual. "Okay," he said to Wallace.
"Give."
Wallace smiled. "Perhaps we'd better open Al-fin's gift first," he said,
deliberately teasing Saxton with his procrastination. He unwrapped
the several large leaves from the package on the table.
Inside was a man's fat arm—with a long scar running from shoulder
joint to elbow!

Saxton groaned and dashed for the lavatory. This time he was sicker
than he'd been during the jump. When he turned, streaks of pale
green showed through the duskiness of his cheeks. "They're
cannibals," he whispered.
"I wouldn't hold that against them," Wallace said. "It might have been
one of the necessities of their survival."
"I suppose so." Saxton turned intently to Wallace. "This much I got,"
he said. "When Al-fin said 'Bye,' I figured that he was telling us to get
out. But how did he know that it would be safe—and how did you
know enough to trust him?"
"I can't take too much credit," Wallace said. "Just all at once
everything clicked together—at the exact moment I understood that
Al-fin was trying to tell us to leave. You remember we decided that
their survival characteristic would probably be something inherent in
all of us, but not developed—or at least not to the extent that an
isolated colony of humans would need here?"
Saxton nodded.
"Well, I'm convinced that the answer is intuition."
"Intuition?"
"Yes," Wallace said. "Everyone knows what intuition is, and has it to
some degree. With no evidence to back up his reasoning a person
knows that something is going to happen. Sometimes he can even
give exact details. It's a definite, perceivable faculty. Yet no one has
ever been able to explain just what it is, or even how it works. But if
you looked at it in another way it wouldn't be so mysterious. It's
another sense—too deeply buried in our subconscious to be
consistently active. Those savages needed it here—fully developed—
and nature provided it."
Saxton pulled himself up on one elbow. "And with it they can
practically see what's going to happen in the future," he finished for
Wallace. "They can predict—and be right every time! That's how Al-
fin knew it would be safe for us to leave." He paused. "It all fits. I think
you've got it."
Wallace smiled. "My guess is that they can't see very far into the
future. That's why Al-fin was out of breath when he came. By the time
he learned about the coming opposition of our ship and the aliens he
had to hurry to get to us, and tell us, before it was too late."
Wallace rubbed the stubble of whiskers on his chin with his knuckles.
"We'll have to report this planet suitable for colonizing," he said. "I
hate to think what will happen to those poor savages when civilization
moves in. They'll soon lose that future-seeing."
Saxton's eyes widened at some inner thought. He sat straight up in
his bunk. "Will they?" he asked. "Or will it work the other way?
Someday the children of those naked savages may...." He stopped.
Wallace recognized the glaze of abstraction that moved over his
features.
Saxton began to sing a stanza from an old popular song that had
recently been revived: "There's gonna be some changes made...."
 *** END OF THE PROJECT GUTENBERG EBOOK SURVIVAL
FACTOR ***

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

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

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

START: FULL LICENSE

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

To protect the Project Gutenberg™ mission of promoting the free

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

Section 1. General Terms of Use and

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

1.F.

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

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

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

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

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

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

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

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

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

Section 2. Information about the Mission of

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

Volunteers and financial support to provide volunteers with the

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

Section 3. Information about the Project

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

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

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

Section 4. Information about Donations to

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

The Foundation is committed to complying with the laws regulating

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

While we cannot and do not solicit contributions from states where

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

International donations are gratefully accepted, but we cannot make

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

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

Section 5. General Information About Project

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

Project Gutenberg™ eBooks are often created from several printed

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

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

This website includes information about Project Gutenberg™,

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