100% found this document useful (1 vote)
35 views55 pages

Intelligent Computing Proceedings of The 2020 Computing Conference Volume 1 Kohei Arai 2024 Scribd Download

Conference

Uploaded by

buscionaame
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
35 views55 pages

Intelligent Computing Proceedings of The 2020 Computing Conference Volume 1 Kohei Arai 2024 Scribd Download

Conference

Uploaded by

buscionaame
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 55

Experience Seamless Full Ebook Downloads for Every Genre at textbookfull.

com

Intelligent Computing Proceedings of the 2020


Computing Conference Volume 1 Kohei Arai

https://textbookfull.com/product/intelligent-computing-
proceedings-of-the-2020-computing-conference-volume-1-kohei-
arai/

OR CLICK BUTTON

DOWNLOAD NOW

Explore and download more ebook at https://textbookfull.com


Recommended digital products (PDF, EPUB, MOBI) that
you can download immediately if you are interested.

Intelligent Computing Proceedings of the 2020 Computing


Conference Volume 3 Kohei Arai

https://textbookfull.com/product/intelligent-computing-proceedings-of-
the-2020-computing-conference-volume-3-kohei-arai/

textboxfull.com

Intelligent Computing Proceedings of the 2020 Computing


Conference Volume 2 Kohei Arai

https://textbookfull.com/product/intelligent-computing-proceedings-of-
the-2020-computing-conference-volume-2-kohei-arai/

textboxfull.com

Intelligent Computing: Proceedings of the 2018 Computing


Conference, Volume 2 Kohei Arai

https://textbookfull.com/product/intelligent-computing-proceedings-of-
the-2018-computing-conference-volume-2-kohei-arai/

textboxfull.com

Proceedings of the Future Technologies Conference (FTC)


2020, Volume 1 Kohei Arai

https://textbookfull.com/product/proceedings-of-the-future-
technologies-conference-ftc-2020-volume-1-kohei-arai/

textboxfull.com
Intelligent Systems and Applications: Proceedings of the
2020 Intelligent Systems Conference (IntelliSys) Volume 2
Kohei Arai
https://textbookfull.com/product/intelligent-systems-and-applications-
proceedings-of-the-2020-intelligent-systems-conference-intellisys-
volume-2-kohei-arai/
textboxfull.com

Intelligent Systems and Applications: Proceedings of the


2020 Intelligent Systems Conference (IntelliSys) Volume 3
Kohei Arai
https://textbookfull.com/product/intelligent-systems-and-applications-
proceedings-of-the-2020-intelligent-systems-conference-intellisys-
volume-3-kohei-arai/
textboxfull.com

Proceedings of the Future Technologies Conference FTC 2018


Volume 1 Kohei Arai

https://textbookfull.com/product/proceedings-of-the-future-
technologies-conference-ftc-2018-volume-1-kohei-arai/

textboxfull.com

Proceedings of the Future Technologies Conference FTC 2018


Volume 2 Kohei Arai

https://textbookfull.com/product/proceedings-of-the-future-
technologies-conference-ftc-2018-volume-2-kohei-arai/

textboxfull.com

Advances in Computer Vision: Proceedings of the 2019


Computer Vision Conference (CVC), Volume 1 Kohei Arai

https://textbookfull.com/product/advances-in-computer-vision-
proceedings-of-the-2019-computer-vision-conference-cvc-volume-1-kohei-
arai/
textboxfull.com
Advances in Intelligent Systems and Computing 1228

Kohei Arai
Supriya Kapoor
Rahul Bhatia Editors

Intelligent
Computing
Proceedings of the 2020 Computing
Conference, Volume 1
Advances in Intelligent Systems and Computing

Volume 1228

Series Editor
Janusz Kacprzyk, Systems Research Institute, Polish Academy of Sciences,
Warsaw, Poland

Advisory Editors
Nikhil R. Pal, Indian Statistical Institute, Kolkata, India
Rafael Bello Perez, Faculty of Mathematics, Physics and Computing,
Universidad Central de Las Villas, Santa Clara, Cuba
Emilio S. Corchado, University of Salamanca, Salamanca, Spain
Hani Hagras, School of Computer Science and Electronic Engineering,
University of Essex, Colchester, UK
László T. Kóczy, Department of Automation, Széchenyi István University,
Gyor, Hungary
Vladik Kreinovich, Department of Computer Science, University of Texas
at El Paso, El Paso, TX, USA
Chin-Teng Lin, Department of Electrical Engineering, National Chiao
Tung University, Hsinchu, Taiwan
Jie Lu, Faculty of Engineering and Information Technology,
University of Technology Sydney, Sydney, NSW, Australia
Patricia Melin, Graduate Program of Computer Science, Tijuana Institute
of Technology, Tijuana, Mexico
Nadia Nedjah, Department of Electronics Engineering, University of Rio de Janeiro,
Rio de Janeiro, Brazil
Ngoc Thanh Nguyen , Faculty of Computer Science and Management,
Wrocław University of Technology, Wrocław, Poland
Jun Wang, Department of Mechanical and Automation Engineering,
The Chinese University of Hong Kong, Shatin, Hong Kong
The series “Advances in Intelligent Systems and Computing” contains publications
on theory, applications, and design methods of Intelligent Systems and Intelligent
Computing. Virtually all disciplines such as engineering, natural sciences, computer
and information science, ICT, economics, business, e-commerce, environment,
healthcare, life science are covered. The list of topics spans all the areas of modern
intelligent systems and computing such as: computational intelligence, soft comput-
ing including neural networks, fuzzy systems, evolutionary computing and the fusion
of these paradigms, social intelligence, ambient intelligence, computational neuro-
science, artificial life, virtual worlds and society, cognitive science and systems,
Perception and Vision, DNA and immune based systems, self-organizing and
adaptive systems, e-Learning and teaching, human-centered and human-centric
computing, recommender systems, intelligent control, robotics and mechatronics
including human-machine teaming, knowledge-based paradigms, learning para-
digms, machine ethics, intelligent data analysis, knowledge management, intelligent
agents, intelligent decision making and support, intelligent network security, trust
management, interactive entertainment, Web intelligence and multimedia.
The publications within “Advances in Intelligent Systems and Computing” are
primarily proceedings of important conferences, symposia and congresses. They
cover significant recent developments in the field, both of a foundational and
applicable character. An important characteristic feature of the series is the short
publication time and world-wide distribution. This permits a rapid and broad
dissemination of research results.
** Indexing: The books of this series are submitted to ISI Proceedings,
EI-Compendex, DBLP, SCOPUS, Google Scholar and Springerlink **

More information about this series at http://www.springer.com/series/11156


Kohei Arai Supriya Kapoor
• •

Rahul Bhatia
Editors

Intelligent Computing
Proceedings of the 2020 Computing
Conference, Volume 1

123
Editors
Kohei Arai Supriya Kapoor
Saga University The Science and Information
Saga, Japan (SAI) Organization
Bradford, West Yorkshire, UK
Rahul Bhatia
The Science and Information
(SAI) Organization
Bradford, West Yorkshire, UK

ISSN 2194-5357 ISSN 2194-5365 (electronic)


Advances in Intelligent Systems and Computing
ISBN 978-3-030-52248-3 ISBN 978-3-030-52249-0 (eBook)
https://doi.org/10.1007/978-3-030-52249-0
© 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, expressed 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
Editor’s Preface

On behalf of the Committee, we welcome you to the Computing Conference 2020.


The aim of this conference is to give a platform to researchers with fundamental
contributions and to be a premier venue for industry practitioners to share and
report on up-to-the-minute innovations and developments, to summarize the state
of the art and to exchange ideas and advances in all aspects of computer sciences
and its applications.
The aim of this conference is to give a platform to researchers with fundamental
contributions and to be a premier venue for industry practitioners to share and
report on up-to-the-minute innovations and developments, to summarize the state
of the art and to exchange ideas and advances in all aspects of computer sciences
and its applications.
For this edition of the conference, we received 514 submissions from 50+
countries around the world. These submissions underwent a double-blind peer
review process. Of those 514 submissions, 160 submissions (including 15 posters)
have been selected to be included in this proceedings. The published proceedings
has been divided into three volumes covering a wide range of conference tracks,
such as technology trends, computing, intelligent systems, machine vision, security,
communication, electronics and e-learning to name a few. In addition to the con-
tributed papers, the conference program included inspiring keynote talks. Their
talks were anticipated to pique the interest of the entire computing audience by their
thought-provoking claims which were streamed live during the conferences. Also,
the authors had very professionally presented their research papers which were
viewed by a large international audience online. All this digital content engaged
significant contemplation and discussions amongst all participants.
Deep appreciation goes to the keynote speakers for sharing their knowledge and
expertise with us and to all the authors who have spent the time and effort to
contribute significantly to this conference. We are also indebted to the Organizing
Committee for their great efforts in ensuring the successful implementation of the
conference. In particular, we would like to thank the Technical Committee for their
constructive and enlightening reviews on the manuscripts in the limited timescale.

v
vi Editor’s Preface

We hope that all the participants and the interested readers benefit scientifically
from this book and find it stimulating in the process. We are pleased to present the
proceedings of this conference as its published record.
Hope to see you in 2021, in our next Computing Conference, with the same
amplitude, focus and determination.

Kohei Arai
Contents

Demonstrating Advanced Machine Learning and Neuromorphic


Computing Using IBM’s NS16e . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Mark Barnell, Courtney Raymond, Matthew Wilson, Darrek Isereau,
Eric Cote, Dan Brown, and Chris Cicotta
Energy Efficient Resource Utilization: Architecture
for Enterprise Network . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
Dilawar Ali, Fawad Riasat Raja, and Muhammad Asjad Saleem
Performance Evaluation of MPI vs. Apache Spark for Condition
Based Maintenance Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
Tomasz Haupt, Bohumir Jelinek, Angela Card, and Gregory Henley
Comparison of Embedded Linux Development Tools for the WiiPiiDo
Distribution Development . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
Diogo Duarte, Sérgio Silva, João M. Rodrigues, Salviano Pinto Soares,
and António Valente
FERA: A Framework for Critical Assessment of Execution
Monitoring Based Approaches for Finding Concurrency Bugs . . . . . . . 54
Jasmin Jahić, Thomas Bauer, Thomas Kuhn, Norbert Wehn,
and Pablo Oliveira Antonino
A Top-Down Three-Way Merge Algorithm for HTML/XML
Documents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
Anastasios G. Bakaoukas and Nikolaos G. Bakaoukas
Traceability Framework for Requirement Artefacts . . . . . . . . . . . . . . . . 97
Foziah Gazzawe, Russell Lock, and Christian Dawson
Haptic Data Accelerated Prediction via Multicore Implementation . . . . 110
Pasquale De Luca and Andrea Formisano

vii
viii Contents

Finding the Maximal Independent Sets of a Graph Including the


Maximum Using a Multivariable Continuous Polynomial Objective
Optimization Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
Maher Heal and Jingpeng Li
Numerical Method of Synthesized Control for Solution of the Optimal
Control Problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
Askhat Diveev
Multidatabase Location Based Services (MLBS) . . . . . . . . . . . . . . . . . . 157
Romani Farid Ibrahim
wiseCIO: Web-Based Intelligent Services Engaging Cloud
Intelligence Outlet . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
Sheldon Liang, Kimberly Lebby, and Peter McCarthy
A Flexible Hybrid Approach to Data Replication
in Distributed Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196
Syed Mohtashim Abbas Bokhari and Oliver Theel
A Heuristic for Efficient Reduction in Hidden Layer Combinations
for Feedforward Neural Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208
Wei Hao Khoong
Personalized Recommender Systems with Multi-source Data . . . . . . . . . 219
Yili Wang, Tong Wu, Fei Ma, and Shengxin Zhu
Renormalization Approach to the Task of Determining the Number
of Topics in Topic Modeling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234
Sergei Koltcov and Vera Ignatenko
Strategic Inference in Adversarial Encounters Using
Graph Matching . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 248
D. Michael Franklin
Machine Learning for Offensive Security: Sandbox Classification
Using Decision Trees and Artificial Neural Networks . . . . . . . . . . . . . . . 263
Will Pearce, Nick Landers, and Nancy Fulda
Time Series Analysis of Financial Statements for Default Modelling . . . 281
Kirill Romanyuk and Yuri Ichkitidze
Fraud Detection Using Sequential Patterns from Credit
Card Operations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 287
Addisson Salazar, Gonzalo Safont, and Luis Vergara
Retention Prediction in Sandbox Games with Bipartite
Tensor Factorization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 297
Rafet Sifa, Michael Fedell, Nathan Franklin, Diego Klabjan, Shiva Ram,
Arpan Venugopal, Simon Demediuk, and Anders Drachen
Contents ix

Data Analytics of Student Learning Outcomes Using Abet


Course Files . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 309
Hosam Hasan Alhakami, Baker Ahmed Al-Masabi,
and Tahani Mohammad Alsubait
Modelling the Currency Exchange Rates Using Support
Vector Regression . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 326
Ezgi Deniz Ülker and Sadik Ülker
Data Augmentation and Clustering for Vehicle Make/Model
Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 334
Mohamed Nafzi, Michael Brauckmann, and Tobias Glasmachers
A Hybrid Recommender System Combing Singular Value
Decomposition and Linear Mixed Model . . . . . . . . . . . . . . . . . . . . . . . . 347
Tianyu Zuo, Shenxin Zhu, and Jian Lu
Data Market Implementation to Match Retail Customer Buying
Versus Social Media Activity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 363
Anton Ivaschenko, Anastasia Stolbova, and Oleg Golovnin
A Study of Modeling Techniques for Prediction of Wine Quality . . . . . 373
Ashley Laughter and Safwan Omari
Quantifying Apparent Strain for Automatic Modelling, Simulation,
Compensation and Classification in Structural Health Monitoring . . . . . 400
Enoch A-iyeh
A New Approach to Supervised Data Analysis in Embedded Systems
Environments: A Case Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 416
Pamela E. Godoy-Trujillo, Paul D. Rosero-Montalvo,
Luis E. Suárez-Zambrano, Diego H. Peluffo-Ordoñez,
and E. J. Revelo-Fuelagán
Smart Cities: Using Gamification and Emotion Detection
to Improve Citizens Well Fair and Commitment . . . . . . . . . . . . . . . . . . 426
Manuel Rodrigues, Ricardo Machado, Ricardo Costa,
and Sérgio Gonçalves
Towards a Smart Interface-Based Automated Learning Environment
Through Social Media for Disaster Management and Smart
Disaster Education . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 443
Zair Bouzidi, Abdelmalek Boudries, and Mourad Amad
Is Social Media Still “Social”? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 469
Chan Eang Teng and Tang Mui Joo
Social Media: Influences and Impacts on Culture . . . . . . . . . . . . . . . . . 491
Mui Joo Tang and Eang Teng Chan
x Contents

Cost of Dietary Data Acquisition with Smart Group Catering . . . . . . . . 502


Jiapeng Dong, Pengju Wang, and Weiqiang Sun
Social Engineering Defense Mechanisms: A Taxonomy and a Survey
of Employees’ Awareness Level . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 521
Dalal N. Alharthi and Amelia C. Regan
How Information System Project Stakeholders Perceive
Project Success . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 542
Iwona Kolasa and Dagmara Modrzejewska
Fuzzy Logic Based Adaptive Innovation Model . . . . . . . . . . . . . . . . . . . 555
Bushra Naeem, Bilal Shabbir, and Juliza Jamaludin
A Review of Age Estimation Research to Evaluate Its Inclusion
in Automated Child Pornography Detection . . . . . . . . . . . . . . . . . . . . . . 566
Lee MacLeod, David King, and Euan Dempster
A Comprehensive Survey and Analysis on Path Planning Algorithms
and Heuristic Functions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 581
Bin Yan, Tianxiang Chen, Xiaohui Zhu, Yong Yue, Bing Xu, and Kai Shi
Computational Conformal Mapping in Education
and Engineering Practice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 599
Maqsood A. Chaudhry
Pilot Study of ICT Compliance Index Model to Measure the Readiness
of Information System (IS) at Public Sector in Malaysia . . . . . . . . . . . . 609
Mohamad Nor Hassan and Aziz Deraman
Preliminary Experiments on the Use of Nonlinear Programming
for Indoor Localization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 629
Stefania Monica and Federico Bergenti
Improved Deterministic Broadcasting for Multiple Access Channels . . . 645
Bader A. Aldawsari and J. Haadi Jafarian
Equivalent Thermal Conductivity of Metallic-Wire
for On-Line Monitoring of Power Cables . . . . . . . . . . . . . . . . . . . . . . . . 661
M. S. Al-Saud
A Novel Speed Estimation Algorithm for Mobile UE’s
in 5G mmWave Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 673
Alawi Alattas, Yogachandran Rahulamathavan, and Ahmet Kondoz
In-App Activity Recognition from Wi-Fi Encrypted Traffic . . . . . . . . . . 685
Madushi H. Pathmaperuma, Yogachandran Rahulamathavan,
Safak Dogan, and Ahmet M. Kondoz
A Novel Routing Based on OLSR for NDN-MANET . . . . . . . . . . . . . . . 698
Xian Guo, Shengya Yang, Laicheng Cao, Jing Wang, and Yongbo Jiang
Contents xi

A Comparative Study of Active and Passive Learning Approaches


in Hybrid Learning, Undergraduate, Educational Programs . . . . . . . . . 715
Khalid Baba, Nicolas Cheimanoff, and Nour-eddine El Faddouli
Mobile Learning Adoption at a Science Museum . . . . . . . . . . . . . . . . . . 726
Ruel Welch, Temitope Alade, and Lynn Nichol
Conceptualizing Technology-Enhanced Learning Constructs:
A Journey of Seeking Knowledge Using Literature-Based Discovery . . . 746
Amalia Rahmah, Harry B. Santoso, and Zainal A. Hasibuan
Random Sampling Effects on e-Learners Cluster Sizes Using
Clustering Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 760
Muna Al Fanah
Jupyter-Notebook: A Digital Signal Processing Course Enriched
Through the Octave Programming Language . . . . . . . . . . . . . . . . . . . . 774
Arturo Zúñiga-López, Carlos Avilés-Cruz, Andrés Ferreyra-Ramírez,
and Eduardo Rodríguez-Martínez
A Novel Yardstick of Learning Time Spent in a Programming
Language by Unpacking Bloom’s Taxonomy . . . . . . . . . . . . . . . . . . . . . 785
Alcides Bernardo Tello, Ying-Tien Wu, Tom Perry, and Xu Yu-Pei
Assessing and Development of Chemical Intelligence Through
e-Learning Tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 795
E. V. Volkova
Injecting Challenge or Competition in a Learning Activity
for Kindergarten/Primary School Students . . . . . . . . . . . . . . . . . . . . . . 806
Bah Tee Eng, Insu Song, Chaw Suu Htet Nwe, and Tian Liang Yi

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 827


Demonstrating Advanced Machine Learning
and Neuromorphic Computing Using IBM’s
NS16e

Mark Barnell1(B) , Courtney Raymond1 , Matthew Wilson2 , Darrek Isereau2 ,


Eric Cote2 , Dan Brown2 , and Chris Cicotta2
1 Air Force Research Laboratory, Information Directorate, Rome, NY 13441, USA
[email protected]
2 SRC, Inc., 6225 Running Ridge Road, North Syracuse, NY 13212, USA

Abstract. The human brain can be viewed as an extremely power-efficient bio-


logical computer. As such, there have been many efforts to create brain-inspired
processing systems to enable advances in low-power data processing. An exam-
ple of brain-inspired processing architecture is the IBM TrueNorth Neurosynaptic
System, a Spiking Neural Network architecture for deploying ultra-low power
machine learning (ML) models and algorithms. For the first time ever, an advanced
scalable computing architecture was demonstrated using 16 TrueNorth neuro-
morphic processors containing in aggregate over 16 million neurons. This sys-
tem, called the NS16e, was used to demonstrate new ML techniques including
the exploitation of optical and radar sensor data simultaneously, while consum-
ing a fraction of the power compared to traditional Von Neumann computing
architectures. The number of applications that have requirements for computing
architectures that can operate in size, weight and power-constrained environments
continues to grow at an outstanding pace. These applications include proces-
sors for vehicles, homes, and real-time data exploitation needs for intelligence,
surveillance, and reconnaissance missions. This research included the successful
exploitation of optical and radar data using the NS16e system. Processing perfor-
mance was assessed, and the power utilization was analyzed. The NS16e system
never used more than 15 W, with the contribution from the 16 TrueNorth proces-
sors utilizing less than 5 W. The image processing throughput was 16,000 image
chips per second, corresponding to 1,066 image chips per second for each watt of
power consumed.

Keywords: Machine vision · High Performance Computing (HPC) · Artificial


Intelligence (AI) · Machine learning image processing · Deep Learning (DL) ·
Convolutional Neural Networks (CNN) · Spiking Neural Network (SNN) ·
Neuromorphic processors

Received and approved for public release by the Air Force Research Laboratory (AFRL) on 11
June 2019, case number 88ABW-2019-2928. Any opinions, findings, and conclusions or recom-
mendations expressed in this material are those of the authors, and do not necessarily reflect the
views of AFRL or its contractors. This work was partially funded under AFRL’s Neuromorphic
- Compute Architectures and Processing contract that started in September 2018 and continues
until June 2020.

© Springer Nature Switzerland AG 2020


K. Arai et al. (Eds.): SAI 2020, AISC 1228, pp. 1–11, 2020.
https://doi.org/10.1007/978-3-030-52249-0_1
2 M. Barnell et al.

1 Background
Background and insight into the technical applicability of this research is discussed in
Sect. 1. Section 2 provides an overview of the hardware. Section 3 provides detail on
our technical approach. Section 4 provides a concise summary of our results. Section 5
addresses areas of future research, and conclusions are discussed in Sect. 6.
We are currently in a period where the interest and the pace of research and devel-
opment in ML and AI technological advances is high. In part, the progress is enabled
by increases in investment by government, industry, and academia.
Currently, ML algorithms, techniques, and methods are improving at an accelerated
pace, i.e., with methods to recognize objects and patterns outpacing human perfor-
mance. The communities’ interest is supported by the number of applications that can
use existing and emerging ML hardware and software technologies. These applications
are supported by the availability of large quantities of data, connectivity of information,
and new high-performance computing architectures. Such applications are now preva-
lent in many everyday devices. For example, data from low cost optical cameras and
radars provide automobiles the data needed to assist humans. These driver assistants
can identify road signs, pedestrians, and lane lines, while also controlling vehicle speed
and direction. Other devices include smart thermostats, autonomous home floor clean-
ers, robots that deliver towels to hotel guests, systems that track and improve athletic
performance, and devices that help medical professionals diagnose disease. These appli-
cations, and the availability of data collected on increasingly smaller devices, are driving
the need and interest in low-power neuromorphic chip architectures.
The wide applicability of information processing technologies has increased com-
petition and interest in computing hardware and software that can operate within the
memory, power, and cost constraints of the real world. This includes continued research
into computing systems that are structured like the human brain. The research includes
several decades of development, in-part pioneered by Carver Mead [1]. Current exam-
ples of the more advanced neuromorphic chips include SpiNNaker, Loihi, BrainScaleS-
1, NeuroGrid/Braindrop, DYNAP, ODIN and TrueNorth [2]. These systems improve
upon traditional computing architectures, such as the Von Neumann architecture, where
physical memory and logic are separated. In neuromorphic systems, the colocalization
of memory and computation, as well as reduced precision computing, increases energy
efficiencies, and provides a product that uses much less power than traditional compute
architectures.
IBM’s TrueNorth Neurosynaptic System represents an implementation of these
newly available specialized neuromorphic computing architectures [3]. The TrueNorth
NS1e, an evaluation board with a single TrueNorth chip, has the following technical
specifications: 1 million individually programmable neurons, 256 million individually
programmable synapses, and 4,096 parallel & distributed cores. Additionally, this chip
uses approximately 200 mW of total power, resulting in 20 mW/cm2 power density
[4–6].
Demonstrating Advanced Machine Learning and Neuromorphic Computing 3

The latest iteration of the TrueNorth Neurosynaptic System includes the NS16e, a
single board containing a tiled set of 16 TrueNorth processors, assembled in a four-by-
four grid. This state-of-the-art 16 chip computing architecture yields a 16 million neu-
ron processor, capable of implementing large, multi-processor models or parallelizing
smaller models, which can then process 16 times the data.
To demonstrate the processing capabilities of the TrueNorth, we developed multiple
classifiers. These classifiers were trained using optical satellite imagery from the United
States Geological Survey (USGS) [7]. Each image chip in the overall image was labeled
by identifying the existence or non-existence of a vehicle in the chip. The chips were
not centered and could include only a segment of a vehicle [8]. Figure 1 shows the raw
imagery is on the left and the processed imagery on the right. In this analysis, a single
TrueNorth chip was able to process one thousand, 32 × 32 pixel chips per second.

Advanced Network Classification


USGS imagery was
Raw Imagery Processed Imagery Chipped,
Human-labeled and
preprocessed to train, test,
and validate our network
model.

14 Layer
Neural Network

Results Vehicle Detection


Accuracy of 97.6% 24,336 Total Chips
Probability of Detection 89.5%, Classified at 1,000 chips/sec
Probability of False Alarm 1.4% 3 Watts

Fig. 1. Electro-optical (EO) image processing using two-class network to detect car/no car in
scene using IBM’s neuromorphic compute architecture, called TrueNorth (using one chip)

Previous work was extended upon through the use of new networks and placement of
those networks on the TrueNorth chip. Additionally, results were captured, and analyses
were completed to assess the performance of these new network models. The overall
accuracy of the best model was 97.6%. Additional performance measures are provided
at the bottom of Fig. 1.

2 Hardware Overview

Development of the TrueNorth architecture dates to the DARPA Systems of Neuro-


morphic Adaptive Plastic Scalable Electronics (SyNAPSE) project beginning in 2008.
This project sought to develop revolutionary new neuromorphic processors and design
tools. Each TrueNorth chip is made of 5.4 billion transistors, and is fabricated using
4 M. Barnell et al.

a 28 nm low-power complementary metal-oxide-semiconductor (CMOS) process tech-


nology with complimentary pairs of logic functions. The True North chip is 4.3 cm2
using under 200 mW of power per chip.
The NS16e board is configured with 16 TrueNorth chips in a 4 × 4 chip configuration.
In aggregate, this board provides users with access to 16 million programmable neurons
and over 4 billion programmable synapses. The physical size of the NS16e board is
215 mm × 285 mm [9].
To expand on this configuration, four of these NS16e boards were emplaced in a
standard 7U space. Thereby, this new neuromorphic system occupies about 19 by 23 by
7 inches in a rack space. The four-board configuration, called the NS16e-4, results in a
neuromorphic computing system with 64 million neurons and 16 billion synapses.
Such a configuration enables users to extend upon the single chip research described
in Sect. 1, and implement inferencing algorithms and data processing in parallel. Addi-
tionally, the system uses a fraction of the processing power compared to traditional
computing hardware occupying the same physical footprint. The Air Force Research
Laboratory’s (AFRL’s) rack mounted neurosynaptic system, called BlueRaven, is shown
in Fig. 2.

BlueRaven NeurosynapƟc System

• Rack mounted
• Four NS16e boards with an
aggregate of 64 million
neurons and 16 billion
synapses
• Enabling parallelization
research and design
• Used to process 5000 x
5000 pixels of information
every 3 seconds.

Fig. 2. AFRL’s BlueRaven system – equivalent to 64 million neurons and 16 billion synapses

The BlueRaven High Performance Computer (HPC) also contains a 2U Penguin


Computing Relion 2904GT. The Penguin server is utilized for training network models
Demonstrating Advanced Machine Learning and Neuromorphic Computing 5

before being deployed to the neuromorphic hardware, as well as for data pre-processing.
Table 1 details Blue Raven’s specifications.

Table 1. BlueRaven system architecture configuration detail

Specification Description
Form Factor 2U Server + 2U NS16e Sled
NS16e 4× IBM NS16e PCIe Cards
Neurosynaptic Cores 262,144
Programmable Neurons 67,108,864
Programmable Synapses 17,179,869,184
PCIe NS16e Interface 4× PCIe Gen 2
Ethernet - Server 1x 1 Gbit
Ethernet – NS16e 1x 1 Gbit per NS16e
Training GPUs 2x NVIDIA Tesla P100
Volatile Memory 256 GB
CPUs 2× 10-Core E5-2630

3 Approach
The NS16e processing approach includes the use of deep convolutional Spiking Neural
Networks (SNN) to perform classification inferencing of the input imagery. The deep
networks were designed and trained using IBM’s Energy-efficient Deep Neuromorphic
Networks (EEDN) framework [4].
The neurosynaptic resource utilization of the classifiers were purposely designed to
operate within the constraints of the TrueNorth architecture. Specifically, they stayed
within the limits of the single TrueNorth’s 1 million neurons and 256 million synapses.
The benefit of this technical approach is that it immediately allowed us to populate
an NS16e board with up to sixteen parallel image classifier networks, eight to process
optical imagery and eight to process radar imagery. Specifically, the processing chain
is composed of a collection of 8 duplicates of the same EEDN network trained on a
classification task for each chosen dataset.

3.1 USGS Dataset


EO imagery happens to be a very applicable data set to use to exercise the BlueRaven
system. It is applicable because it is freely available, and is of favorable quality (i.e., high-
resolution). The quality of the data enabled us to easily identify targets in the imagery.
Additionally, the data could be easily chipped and labeled to provide the information
necessary for network model training and validation.
6 M. Barnell et al.

This overhead optical imagery includes all 3 color channels (red, green and blue).
The scene analyzed included 5000 × 5000 pixels at 1-foot resolution. From this larger
scene, image chips were extracted. Each image chip from the scene was 32 × 32 pixels.
There was no overlap between samples, thereby sampling the input scene with a receptive
field of 32 × 32 pixels and a stride of 32 pixels. This resulted in over 24,336 (156 ×
156) sub-regions.
The USGS EO data was used to successfully build TrueNorth-based classifiers that
contained up to six object and terrain classes (e.g., vehicle, asphalt, structure, water,
foliage, and grass). For this multi-processor neurosynaptic hardware demonstration, a
subset of the classes was utilized to construct a binary classifier, which detected the
presence or absence of a vehicle within the image chip.
The data set was divided up into a training and test/validation sets. The training
set contained 60% of the chips (14,602 image chips). The remaining 40% of the chips
(9,734) were used for test/validation. The multi-processor demonstration construct and
corresponding imagery is shown in Fig. 3.

Multi-Processor Neurosynaptic Demonstration


Optical Imagery

Binary classification of a vehicle/no vehicle within the image


Example Imagery and Demonstration Construct

Fig. 3. Example USGS tile and demonstration construct

3.2 Multi-chip Neurosynaptic Electro-Optical Classification

The content of the chip was defined during data curation/labeling. The label was in one
of two categories: no vehicle or a vehicle. Additionally, the chips were not chosen with
the targets of interest centered in the image chip. Because of this, many of the image
chips contained portions of a vehicle, e.g., a chip may contain an entire vehicle, fractions
of a vehicle, or even fractions of multiple vehicles.
The process of classifying the existence of a vehicle in the image starts with object
detection. Recognizing that a chip may contain a portion of a vehicle, an approach was
developed to help ensure detection of the vehicles of interest. This approach created
Demonstrating Advanced Machine Learning and Neuromorphic Computing 7

multiple 32 × 32 × 3 image centroids. These centroids were varied in both the X and Y
dimensions to increase the probability of getting more of the target in the image being
analyzed.
A block diagram showing the processing flow from USGS imagery to USGS imagery
with predicted labels is shown in Fig. 4. This includes NS16e implementations with 8
parallel classifier networks, 1 per each TrueNorth on half the board.

USGS USGS Image w/


5000x5000 Predicted Labels
Image Model

Model

Image Model ClassificaƟon


Sub-region Processor
Model

Image Model
Chipper
Model

Model

TrueNorth
USGS Model

Fig. 4. NS16e USGS block diagram

The copies of the EO network were placed in two full columns of the NS16e, or
eight TrueNorth processors in a 4 × 2 configuration, with one network copy on each
processor. As a note, the remainder of the board was leveraged to study processing with
additional radar imagery data.

3.3 Electro-Optical Classification Hardware Statistics


Analyses of the systems power consumption was completed. The TrueNorth system
operates at a rate of 1 kHz. This rate directly correlates to the number of image chips
that can be processed per second. The USGS/Radar network models were replicated
across 16 TrueNorth chips and resulted in a processing speed of 16,000 inferences
per second. At this rate and using 8 TrueNorth chips, the new compute and exploitation
architecture was able to process the full 5,000 × 5,000 pixel optical imagery with 24,336
image chips in 3 s.
8 M. Barnell et al.

The NS16e card’s power usage during inferencing is shown in Table 2. The total uti-
lization of the board was less than 14 W. The runtime analyses included the measurement
of periphery circuits and input/output (I/O) on the board.

Table 2. NS16e board power usage

Board power
Board Voltage (V) Current (A) Power (W)
Nominal Measured Computed
Interposer (Inclrding MMP) +12 0.528 6.336
16-chip board (Including TN chips) +12 0.622 7.462
Total 1.150 13.798

Table 3 details the power utilization of the TrueNorth chips without the boards
peripheral power use. The contribution from the TrueNorth accounted for approximately
5 W of the total 15 W.

Table 3. NS16e TrueNorth power usage

TrueNorth power only


Component Voltage (V) Current (A) Power (W)
Measured Measured Computed
TrueNorth Core VDD 0.980 4.74 4.636
TrueNorth I/O Drivers 1.816 0.04 0.063
TrueNorth I/O Pads 1.000 0.00 0.002
Total 4.701

Table 4 provides detail on the power utilization without loading on the system (idle).

4 Results

In Fig. 5, we see an example of predictions (yellow boxes) overlaid with ground truth
(green tiles). Over the entirety of our full-scene image, we report a classification accuracy
of 84.29% or 3,165 of 3,755 vehicles found. Our misclassification rate, meaning the
number of false positives or false negatives, is 35.39%. Of that, 15.71% of targets are
false negatives, i.e. target misses. This can be tuned by changing the chipping algorithm
used with a trade off in the inference speed of a tile.
Demonstrating Advanced Machine Learning and Neuromorphic Computing 9

Table 4. Idle NS16e power usage

Board power
Board Voltage (V) Current (A) Power (W)
Nominal Measured Computed
Interposer (Including MMP) +12 0.518 6.216
16-chip board (Including TN chips) +12 0.605 7.265
TOTAL 1.123 13.481
TrueNorth power only
Component Voltage (V) Current (A) Power (W)
Measured Measured Computed
TrueNorth Core VDD 0.978 4.64 4.547
TrueNorth I/O Drivers 1.816 0.03 0.051
TrueNorth I/O Pads 0.998 0.00 0.001
TOTAL 4.599

Multi-Processor Neurosynaptic Demonstration


Legend
Target Positively Identified
Target Falsely Identified
Truth (Human Labeled Cars)

• Detected 3165 of 3755


(84.29%) of the Vehicles
• 8000 inferences per
second

Fig. 5. Example USGS tile results

5 Future Research

Neuromorphic research and development continue with companies such as Intel and
IBM. They are contributing to the communities’ interest in these low power processors.
As an example, the SpiNNaker system consists of many ARM cores and is highly
10 M. Barnell et al.

flexible since neurons are implemented at the software level, albeit somewhat more
energy intensive (each core consumes ~1 W) [10, 11].
As new SNN architectures continue to be developed, new algorithms and applica-
tions continue to surface. This includes technologies such as bioinspired vision systems
[12]. Additionally, Intel’s Loihi neuromorphic processor [13] is a new SNN neuromor-
phic architecture which enables a new set of capabilities on ultra-low power hardware.
Loihi also provides the opportunity for online learning. This makes the chip more flex-
ible as it allows various paradigms, such as supervisor/non-supervisor and reinforc-
ing/configurability. Additional research of these systems, data exploitation techniques,
and methods will continue to enable new low power and low-cost processing capabilities
with consumer interest and applicability.

6 Conclusions

The need for advanced processing algorithms and methods that operate on low-power
computing hardware continues to grow out an outstanding pace. This research has
enabled the demonstration of advanced image exploitation on the newly developed
NS16e neuromorphic hardware, i.e., a board with sixteen neurosynaptic chips on it.
Together, those chips never exceeded 5 W power utilization. The neuromorphic board
never exceeded 15 W power utilization.

References
1. Mead, C.: Neuromorphic electronic systems. Proc. IEEE 78(10), 1629–1636 (1990)
2. Rajendran, B., Sebastian, A., Schmuker, M., Srinivasa, N., Eleftheriou, E.: Low-power neu-
romorphic hardware for signal processing applications (2019). https://arxiv.org/abs/1901.
03690
3. Barnell, M., Raymond, C., Capraro, C., Isereau, D., Cicotta, C., Stokes, N.: High-performance
computing (HPC) and machine learning demonstrated in flight using Agile Condor®. In: IEEE
High Performance Extreme Computing Conference (HPEC), Waltham, MA (2018)
4. Esser, S.K., Merolla, P., Arthur, J.V., Cassidy, A.S., Appuswamy, R., Andreopoulos, A.,
et al.: CNNs for energy-efficient neuromorphic computing. In: Proceedings of the National
Academy of Sciences, p. 201604850, September 2016. https://doi.org/10.1073/pnas.160485
0113
5. R.F. Service: The brain chip. In: Science, vol. 345, no. 6197, pp. 614–615 (2014)
6. Cassidy, A.S., Merolla, P., Arthur, J.V., Esser, S.K., Jackson, B., Alvarez-Icaza, R., Datta, P.,
Sawada, J., Wong, T.M., Feldman, V., Amir, A., Rubin, D.B.-D., Akopyan, F., McQuinn, E.,
Risk, W.P., Modha, D.S.: Cognitive computing building block: a versatile and efficient digital
neuron model for neurosynaptic cores. In: The 2013 International Joint Conference on Neural
Networks (IJCNN), pp. 1–10, 4–9 August 2013
7. U.S. Geological Survey: Landsat Data Access (2016). http://landsat.usgs.gov/Landsat_S
earch_and_Download.php
8. Raymond, C., Barnell, M., Capraro, C., Cote, E., Isereau, D.: Utilizing high-performance
embedded computing, agile condor®, for intelligent processing: an artificial intelligence
platform for remotely piloted aircraft. In: 2017 IEEE Intelligent Systems Conference, London,
UK (2017)
Demonstrating Advanced Machine Learning and Neuromorphic Computing 11

9. Modha, D.S., Ananthanarayanan, R., Esser, S.K., Ndirango, A., et al.: Cognitive computing.
Commun. ACM 54(8), 62–71 (2011)
10. Furber, S.B., Galluppi, F., Temple, S., Plana, L.A.: The SpiNNaker project. Proc. IEEE 102(5),
652–665 (2014)
11. Schuman, C.D., Potok, T.E., Patton, R.M., Birdwell, J.D., Dean, M.E., Rose, G.S., Plank,
J.S.: A survey of neuromorphic computing and neural networks in hardware. CoRR
abs/1705.06963 (2017)
12. Dong, S., Zhu, L., Xu, D., Tian, Y., Huang, T.: An efficient coding method for spike camera
using inter-spike intervals. In: IEEE DCC, March 2019
13. Tang, G., Shah, A., Michmizos, K.P.: Spiking neural network on neuromorphic hardware for
energy-efficient unidimensional SLAM. CoRR abs/1903.02504. arXiv:1611.05141 (2019)
Energy Efficient Resource Utilization:
Architecture for Enterprise Network
Towards Reliability with SleepAlert

Dilawar Ali1(B) , Fawad Riasat Raja2 , and Muhammad Asjad Saleem2


1 Ghent University, Ghent, Belgium
[email protected]
2 University of Engineering and Technology Taxila, Taxila, Pakistan

Abstract. Enterprise networks usually require all the computing machines to


remain accessible (switched-on) at all times regardless of the workload in order to
entertain user requests at any instant. This comes at the cost of excessive energy
utilization. Many solutions have been put forwarded, however, only few of them
are tested in a real-time environment, where the energy saving is achieved by com-
promising the systems’ reliability. Therefore, energy-efficient resource utilization
without compromising the system’s reliability is still a challenge. In this research,
a novel architecture, “Sleep Alert”, is proposed that not only avoids the exces-
sive energy utilization but also improves the system reliability by using Resource
Manager (RM) concept. In contrary to traditional approaches, Primary and Sec-
ondary Resource Managers i.e. RMP and RMS respectively are used to avoid the
single point of failure. The proposed architecture is tested on a network where
active users were accessing the distributed virtual storage and other applications
deployed on the desktop machines, those are connected with each other through
a peer-to-peer network. Experimental results show that the solution can save con-
siderable amount of energy while making sure that reliability is not compromised.
This solution is useful for small enterprise networks, where saving energy is a big
challenge besides reliability.

Keywords: Enterprise networks · Resource manager · Green computing · Sleep


proxy · Energy-efficient computing

1 Introduction
Efficient utilization of energy is one of the biggest challenges around the globe. The dif-
ference between demand and supply is always on rise. For high performance, computing
a reliable, scalable, and cost-effective energy solution satisfying power requirements and
minimizing environmental pollution will have a high impact. The biggest challenge in
enterprise networks is how to manage power consumption. Data centers utilize huge
amount of energy in order to ensure the availability of data when accessed remotely.
Major problem now a day is that energy is scarce, that is why renewable energy
i.e. producing energy by wind, water, solar light, geothermal and bio-energy is a hot
issue in research. It is of equal importance that how efficiently this limited energy would

© Springer Nature Switzerland AG 2020


K. Arai et al. (Eds.): SAI 2020, AISC 1228, pp. 12–27, 2020.
https://doi.org/10.1007/978-3-030-52249-0_2
Energy Efficient Resource Utilization: Architecture for Enterprise Network 13

be utilized so an investment in green technology that leads to strengthen the economy


besides reducing the environment pollution be made. In US Department of Energy, office
of Energy Efficiency and Renewable Energy (EERE) is also working on energy efficiency
and renewable energy resources with an aim to reduce the dependence on imported oil
[1].
The number of internet users has increased 5 times from 2000 to 2009. Currently the
internet users are more than 2.4 billion [2]. Whereas Microsoft report shows, it will be
more than 4 billion in coming years. Some other sources say it will be more than 5 billion
by year 2020 [3]. More the number of users, more is the energy consumed, and an increase
amount of CO2 will be emitted The global Information and Communications Technology
(ICT) industry elucidate approximately 2% of global carbon dioxide (CO2 ) emissions,
number equivalent to aviation, which means rapid increase in environmental pollution.
The power deficiency issue and energy crisis are currently main topics of debate on
discussion forums and in professional conferences. It is considered a worldwide goal
to optimize energy consumption and minimize CO2 emissions in all critical sectors
of an economy [4]. Therefore, major concern is to reduce the utilization of energy in
enterprise networks using our prescribed scheme. A contribution to this scheme is to
widen the research area in Green computing, where main goal is not just to save the
operational energy of a product but also the overall energy, which is consumed from
product development till the completion of recycling process [4].
Data centers contain servers and storage systems, which operate and manage the
enterprise resource planning solutions. Major components of data center are environ-
mental controls (e.g., ventilation/air conditioning), redundant or backup power supplies,
multiple data communication connections and security devices (e.g. camera). Large data
centers are often considered as a major source of air pollution in the form of CO2. By
releasing plenty of heat, they raise global warming and consume as much energy as does
a small town [5]. In enterprise networks a machine (often a desktop) is usually in active
mode so as it remains available whenever accessed remotely. This reveals that some
machines having no load (i.e. idle one) may remain continuously in active state.
To cope with energy management issues, many hardware and software based solu-
tions have been put forward. Vendors have manufactured such devices e.g. Dynamic
Voltage and Frequency Scaling (DVFS) enabled devices, which will consume less energy
than the Non-DVFS enabled devices’. Many software solutions, too, have been proposed
which reduce energy consumption. The most prominent is the one that takes the machines
into sleep mode when they are idle. However, in the later scheme, there are a number of
issues e.g. reliability which will be addressed in next section.
This proposed architecture not only emphasizes on the shortcomings of existing
architectures which are identified in this research work but also cater most of the issues
occurred during real-time test environment. These include reliability of sleep proxy
architecture and overhead - where the proxy node sends a periodic signal to the proxy
server after every five minutes, notifying its presence on the network - as these have not
been addressed in the traditional approaches. The main benefit of proposed scheme is
no extra or costly hardware is required to implement the solution.
Sleep Alert, a cost effective solution, eliminates the concept of single point failure
and addition of any extra hardware to make the network reliable and energy efficient. This
14 D. Ali et al.

solution is useful for small enterprise networks, where saving energy is a big challenge
besides reliability.

1.1 Major Contributions

The major contributions are as follows:

1. A simple architecture to cope with the challenge of single point failure and ensure
the service until last node is available in the network.
2. Low cost solution to save considerable amount of energy while making sure that
reliability is not compromised.

2 Literature Review
The traditional approach regarding the design of a computer network is to ensure the
accessibility of each machine connected in the network at any cost. Energy consumption
is not taken into account while designing such networks [6]. Generally, a network design
is highly redundant for fault tolerance. All network equipment stays powered-on even
if unused or slightly used. Many solutions [7–16] have been proposed to efficiently use
the energy.
In Green Product Initiative [12], the use of energy efficient devices by using Dynamic
voltage and frequency scaling (DVFS) technique has been introduced but this solution
is not appropriate for the jobs having a short deadline. This is because DVFS-enabled
devices take more time than the normal execution time of a job. Hardware based solutions
[12, 17] require particular hardware such as GumStix [17], when the host sleeps these
low powered devices becomes active. Sometime particular hardware device is required
for each machine beside operating system alteration on both application and host. Apple
has come up with a sleep proxy that is compatible only with Apple-designed hardware
and is appropriate for home networks only [15].
Sleep proxy architecture [13] is a common software based solution to lesser energy
consumption. The major flaw with this technique is that if sleep proxy server is down,
then there is no other way to access any machine. Using the designated machine as sleep
proxy server is, too, not a good approach as the danger of Single Point Failure always
lurks. A different approach is SOCKs based approach, which includes the awareness
of the power state of a machine that how a Network Connectivity Proxy (NCP) could
enable substantial energy savings by letting idle machines to enter a low-power sleep
state and still ensures their presence in the network. This is just a design and prototype,
not yet implemented. Furthermore, there is always a significant difference in simulation-
based test of sleep proxy architecture and real time testing in enterprise networks [14].
Software based solution to energy efficient computing normally based on sleep approach
such as Wake on LAN (WOL) [18] is a standard methodology used to make available a
sleeping machine in a network when required by sending a magic packet.
Cloud and fog computing are the common trend introduced in recent decade. The
way the Information and Communication Technology (ICT) and computing systems are
increasing, it is necessary to take in account the future challenges of energy consumption
Energy Efficient Resource Utilization: Architecture for Enterprise Network 15

due to these latest technologies [19]. Cloud computing involve the large number of data
set on different location. Many companies like Google, Amazon, Yahoo, Microsoft,
having huge data centers are currently following the cloud architecture to handle the large
number of data sets. The progression toward the cloud architecture results in increase of
data centers which lead to increase in the huge amount of energy consumption. Survey
shows that the energy consumption by data centers in US was between 1.7% and 2.2% of
entire power consumption of US in 2010 [20]. To control the huge energy consumption
issues in cloud servers the concept of greening cloud computing [21] and Pico servers
[22], power aware computing, were introduced. Common methods to achieve energy
saving in green cloud computing data center are adaptive link rate, implementing virtual
network methodology, sleeping less utilized servers, green/power aware routing and
server load/network traffic consolidation [23].
Efficient resource allocation is a new diversion to cope with energy challenge.
Research shows different method of resource allocation one of common is allocation
based on priority [24]. This technique requires the intelligent system to predict the
behavior of a network based on different machine learning concepts [25]. Whereas
while implementing the virtual machine based solution for energy efficiency, the prior-
ity allocation and resource sharing algorithms were designed to allocate the resources,
to save maximum energy. The major flaw in technique is excessive load on the network
due to constant reallocations of resources [26]. Intelligent approach to minimize the
consumption of energy is to predict the network work load based on different models
this model turn the work load in different classes and then evaluate each class based on
several available models [27]. Most of available software based solutions are not tested
in real time environment; others are complex and have many shortcomings when tested
in real-time environment. Ensuring reliability is a big challenge for such kind of appli-
cations while saving sufficient amount of energy. Single point failure is one of major
point of concern in this research domain.
Many solutions were proposed but some solutions are complex to contrivance while
other requires a lot of infrastructure to implement. Most of companies in developing
countries even have the major budgetary constraints to set up such a large infrastructure.
In case of small enterprises environments, even if they establish such a large and complex
network solutions, the cost to operate, maintain and make these solutions serviceable
is too much to afford. This lead to even an expensive solution then they get the benefit
from energy savage. They normally need a short, simple and less cost effective energy
saving solutions and hoping the high reliability rate and the good performance as well.
Solution that is beneficial for these kind of organizations especially in under devel-
oped countries is simply the “Sleep Alert”, where they are afraid to upgrade the whole
network or the change cost is much large then the annual revenue of an organization and
need a simple and cost effective solution.

3 System Architecture
Concept of sleep proxy is much appreciated but as the time goes on researchers came to
know some of the major problems that caused the deadlocks in network and effect the
availability of the sleeping machine to respond to a remote request. Some issues with
current sleep proxy that we discuss in this research are as follows:
16 D. Ali et al.

• For making the environment green we can’t take a risk of letting the network on the
sack of just one proxy.
• Because of one proxy, if it went down due to some reason, states of all sleeping
machine lost and they are unable to come back in wake up mode when required.
• As a proxy is a dedicated machine, that have to maintain the state of sleeping machine,
an extra overhead as it consumes extra energy.
• Taking a decision when to go in sleep mode.
• Some sleep approaches lead system to shutdown and restart when required, these
requires lot of energy at start and also takes much time to restart then as from sleep
state.

In contrary to previous sleep proxy approaches, the concept of Resource Manager


(RM) is proposed to avoid the single point failure, further categorization of the RM is
Primary Resource Manager (RMp ) and Secondary Resource Manager (RMs ). In pro-
posed architecture, there is no dedicated machine to act as a RM like in traditional sleep
proxy approaches. Any ordinary machine can act as a RM when required.
To avoid the single point failure two machines were used to act as RMp and RMs
at the same time. Whenever RMp stops working RMs will take over as RMp and use
the next available machine as RMs and this cycle continues till there is a last machine
available in the network. If RMp went down or stop working the intermediate device
(router) will update its routing table and this update will redirect the incoming traffic
towards RMs . Receiving the traffic by RMs is the signal to RMs that RMp is down, so
RMs will update its status from RMs to RMp . It’s the time to ping the whole network to
get the current state of all the desktop machines and allow a next available machine to
act as RMs .
There are two modes of each desktop machine, Energy Saving (ES) Mode and Energy
Consumption (EC) Mode. A machine, as a Resource Manager, can be in two states, either
‘Working State’ (W) or ‘Down State’ (D). To access a sleeping machine remote user’s
request will be forwarded to RMp or RMs - incase RMp is down. RMp will send a WOL
packet to the particular machine to bring it back in the awake state or EC mode. Each
machine has a small database that contains the states of sleeping machines. Usually this
database is updated when a particular machine acts as a Resource Manager. The infor-
mation recorded in this database is IP of each machine, Mac address, Connecting ports
and current state of machine. Five states of a machine defined in proposed architecture
are; Primary Resource manager [RMp ], Secondary Resource manager [RMs ], Machine
Active [A], Energy saving Mode [S], Machine not available in the network [N]. Proposed
architecture is shown in Fig. 1. This is a software-based solution and no extra hardware
is required to implement this solution.

3.1 General Terminologies

Status Indicator. Status indicator is an application running on each machine and


conveys the present status (sleep or wake) of a particular machine to RMP .
Energy Efficient Resource Utilization: Architecture for Enterprise Network 17

Fig. 1. Proposed system architecture

Sleep Status. When there is no activity on any machine for a specific amount of time
i.e. a machine is in idle state then it will turn into sleep state and through status indicator
it will send the message about its status (sleep) to RMp . There is no need to keep track
which machine is acting as RMp . Ordinary machine will broadcast its status message
in the network and only RMp will save this status of a particular machine and other
machine will discard this message.

Wake Status. When a machine is in sleep state and there is network traffic (Remote
user accessing the machine) for that machine, RMp will send a WOL message to that
machine. If sleeping machine acknowledged this WOL message, then RMp will update
the status (sleep to wake) of that machine in its database. But if there is no response at
all from the machine after sending three WOL messages, RMp will consider that the
machine is no more in the network.

Message Packet. A message’s that is forwarded and received are of following format.
Protocol defined for the identification of message packet is presented below and shown
in Fig. 2. Message contains following five tokens, which are separated by [-]:

Message Protocol : [Message_Type − Requested _Ip − Source_Ip − Destination_Ip − Termination]

• Message Type: Code representing the task to be required from requested pc.
• Requested IP: IP of targeted machines, which respond to user request, is requested IP.
• Source IP: is the IP of sender machine
• Destination IP: is the IP of receiving machine.
• Termination: is usually a termination character, which in our case is ‘$’.

Message Type. Message type is predefined codes those are helpful in determining the
type of request. Message codes are shown in Table 1:
Another Random Scribd Document
with Unrelated Content
Long-butts, 97
Losing hazards, short and long, 153–172;
half-ball strokes, 154; 156;
middle-pocket, 158;
jennies, 160;
long, 162;
care required in playing, 168;
forcing, 170;
inferiority to winning hazards, 172;
by use of follow, 218–221; 371
Luck in playing, 303

MʻNeil, Hugh, 51
Mannock, J. P., 52
Mardon, Mr., writer on billiards, 8, 12, 17, 18, 19, 20
Marker, duties of the, 412, 414, 415, 428, 445;
services should be devoted to game and players alone, 446
Marking-boards, 99;
nickel-plated, 100
Massé stroke, method of playing, 255, 353
Matches, championship, 373
Measurements in billiards, approximate, 146;
how made, 147
Memmott, Charles, champion of Australia, 26, 39;
record of screw back spots, 48; 52, 274
Miss, must be played with the point of cue, 284
Miss-cue, meaning of the term, 106
Mitchell, William, 43–46;
as spot player, 44–48;
beaten by Roberts, jun., even, 50; 52, 228, 367
Mode of entering a billiard-room, 104, 441
Morris, Tom, 25, 26, 39
Moss, W., 35
Mulberry, George, 25

Nap of cloth, effect of playing with or against, 193, 207, 208, 270
Nearest ball pool, 431
‘Nell Gwynne,’ Strand, match at, 24
Nerve in playing, 3, 305–306
North, John, his style, 47, 48, 119
Nursery cannons, 348–361;
value of — on three-inch pocket table, 363

Oil lamps for lighting billiard-rooms, 66


One-ball practice. See Elementary instruction
Oriental Club, plan of room, 57, 62
Orme & Sons, their automatic arrangement for returning balls, 86;
323
Over-caution in playing, evils of, 318

Partie Américaine dite du cadre, 364


Peall, W. J., aid from, 4; 44;
remarkable breaks, 45; 46, 48;
defeats Roberts, jun., 49, 50;
present position, 51; 52;
weight of his cue, 94;
consecutive screw back spot strokes, 274; 282;
turning a corner at cushion nurseries, 359; 367
Peall cushion rest, 98 n.
Pendleton, Tom, 16
Penrhyn slates, 73
Pipeclay for marking baulk-lines, 83
Piqué strokes, mode of playing, 256
Plain strokes, 142–188
Plan of billiard-table, 74, 75
Plants, definition of, 106;
method of playing, 244;
laws which govern them unknown, 246;
in pyramids, 400
Players, system of classifying, 302;
difference in, 303;
luck, 303
Pneumatic cushions, 79
Pockets of billiard-tables, 11, 69;
blind, 146, 150;
Billiard Association standard, 362, 368
Pontifex, Mr. Dudley D., aid from, 3;
memorandum by, 115, 325
Pook, John, Kentfield’s manager, 18
Pool basket, 101, 253–254
Pool, importance of playing for position in, 145;
useful as winning hazard practice, 320;
description of the game, 408;
rules and penalties, 410;
safety and hazards, 411;
starring, 411;
playing for cannons, 411;
measuring distances, 412;
marker’s duty, 412;
the opening stroke, 412;
Cook’s record, 412;
doubles, 150, 400, 413;
story concerning consecutive doubles, 413;
anecdote about sharpers, 413, 414;
for other varieties of the game, see Black pool, Black and pink,
Cork, Nearest ball, Selling, Single, Skittle, Snooker, Three-pool
Porker, Mr., his match with Mr. Mardon, 12
Position mère, 329; 351
‘Practical Billiards,’ Dufton’s, on skittle pool, 435
Pratt, his style, 9;
match with a stranger, 10
Precautions in play, 259
Prince of Wales, the, See Wales, Prince of
Prince of Wales’s Hotel, Moss Street, Manchester, matches at, 28
Professionals, rate of scoring, 307
Push stroke, the, 52;
method of playing, 224; 370;
its permissibility, 382;
character defined, 383;
so-called proofs of foulness, 383, 384;
objections to striking twice, 385, 386;
the case for and against, 386
Pyramids, 33;
importance of playing for position in, 145;
general hints concerning, 388;
salient points of the game, 389;
rules regarding, 390;
handicapping players, 390;
setting up the balls, 391;
ways of playing the first stroke, 391;
safety, 392;
making a series of hazards, 392;
plants and doubles, 394;
when the object ball is close to a cushion, 396;
useful strokes, 396–406;
good break by an Undergraduate, 407
Queen’s Club, 116
Quill stroke, 370

Rebound following impact, 164, 167


Referees, duties of, 444
Rencontres, 105, 230
Rests, 98, 115
Richards, matches with Roberts, sen., 367
Richards, D., 25, 27, 41, 120
Right-angled screw, the, 198
Rimington-Wilson, Mr. R. H. R., aid from, 4;
on the top-of-the-table game, 325;
on cannon nurseries, 359;
on the professional championship, 366
Roberts, John, jun., 11, 23, 25, 26, 27, 28;
beats Cook for the championship, 33;
beats A. Bowles, 33;
beaten by Joseph Bennett, 34;
defeats Bennett, 33, 34; 40;
again beats Cook for championship, 41; 43, 46;
in India, 47;
defeats and is beaten by Cook, 47; 48;
beaten by Peall, 49;
beats Cook and Joseph Bennett for championship, 50;
beats Mitchell, 50;
beaten by Peall, spots only, 50;
challenged by Peall, 51;
his wonderful play, 51;
matches with Ives, 53, 359, 365;
his long spot-barred breaks, 54;
weight of his cue, 94;
admirable cue delivery, 116;
ease and grace of style, 119;
skill, 121, 125, 127, 128, 212, 268;
good at the spot stroke, 274; 370;
offer to assist in recasting rules of the game, 375;
on the push stroke, 386
Roberts, John, sen., 12, 13;
contrasted with Kentfield, 14, 15;
rapid rise, 16;
taught the spot stroke by Mr. Lee Birch, 16;
interviews Kentfield, 17, 18;
champion, 19; 21;
lessee of Saville House, Leicester Square, 22;
his famous break of 346 in a match with William Dufton, 22;
matches with Alfred Bowles and Charles Hughes, 23, 24; 26, 28;
defeated by Cook, 31;
endurance match with an amateur, 32; 367
Rotation of ball, 189–214;
cause of, 192;
round horizontal axis, forward, 194;
backward, 196;
round vertical axis, 202
Royal Aquarium, Westminster, 43, 44, 45, 49, 50, 368
‘R.-W. Billiard Diagram Notebook,’ 398
Rudolph, match with Cook, 40
Rules of billiards, 374;
defective character, 374;
proposed revision, 375;
penalties for infringing, 375;
suggestions respecting, 376–386;
discriminating between the act of aiming and the act of striking,
377;
playing a miss otherwise than with the point of the cue, 378;
playing with the wrong ball, 378;
foul strokes, 379;
when player’s ball touches another ball, 379;
offences committed by persons other than the players, 380;
spectators offering advice, 376, 380;
obstructing players, 380;
obstruction of the striker by the non-striker, 381;
how far the marker may assist either player, 381;
the push stroke, 382;
the half-push, 384;
striking a ball twice, 384;
chief objections to the push stroke, 385, 386

Safety, when to be sought for, 283;


pocketing an adversary’s ball, 285;
double baulk, 290
St. James’s Hall, 30, 47, 368
St. Martin chalk, 99
Sala, J. G., record of consecutive screw back spots, 48; 274
Samson, Mr., architect, 60, 62;
designs by, 64–65
Scoring, different rate of, between amateurs and professionals, 307
Screw, the, 196, 197, 247;
right-angled, 198;
regulation of strength necessary in playing, 198;
importance of regulating, 200;
close, 250
Selling pool, principle of the game, 429
Seymour, William, 116
‘Sharping’ in billiard-rooms, 413, 414
Shell-out, the game of, 407, 408
Shorter, Fred, wins love game from Bennett, 41–42;
beats Cook, 42;
beats Taylor, 42;
forfeits to Bennett, 47
Side, transmission of, 194, 202;
acquired by friction with cushion, 206;
imparting, 315;
can it be communicated by one ball to another?, 443.
See Rotation
Skittle pool, description of, 431;
rules, 432;
usual way of playing, 434
Skylight sashes for ventilating billiard-rooms, 62
Slates for billiard-tables, 73–77
Smoking in billiard-room, 442
Snooker, 408;
variations in rules, 424;
general method of play, 424;
penalties, 425, 426;
main object of player, 427;
the element of luck, 427
Spiller, William, 52
Spot stroke, the, 11, 16;
agitation against, 39;
result of barring, 172;
constant practice required for success, 264;
danger of using, 265;
its genuineness, 266;
ivory and bonzoline balls in playing, 266;
use of chalk, 267;
method of playing, 268;
its limits, 269;
the screw back, 273;
the stab, 276;
must be taught by a master, 279;
methods adopted to continue break or obtain safety, 279;
invaluable as practice for winning hazard play, 282; 320
Spot-barred breaks, 45
Spot stroke tables, 85
Spots, inadvisability of altering, 153
Stab, the, use of in playing cannons, 182;
and spot stroke, 276
Stakes, advantages and disadvantages of playing for, 436
Stammers, 36, 39
Standard Association tables, 71
Stanley, S. W., 25, 33, 36, 37, 38, 39, 40, 41
Starke, defeated by Roberts, sen., 19;
further matches with him, 21
Stevenson, H. W., 27, 52
Strength, definition of, 106
String, to, meaning of, 106
Strokes, following, 194;
screw, 196, 247;
practising, 208;
massé, 214, 255;
miscellaneous, 215;
fine, 222;
push and half-push, 224;
bricole, 226, 242;
kiss, 230;
jennies, 239;
plants, 244;
close screws, 250;
leap or jump, 250;
piqué, 255;
compensations, 260;
spot, 264
Style, 112

Tables. See Billiard-tables


Taylor, Tom, 36, 37, 39, 40, 41, 42, 44, 47, 48, 368
Templates, 71
Terms, billiard, technical, explained, 104–106
Three-ball practice, 142 et seq.
Three-inch pocket table. See Championship table
Three-pool, 413;
strange occurrence at, 413;
principles of the game, 415, 416
Thurston, John, 10;
his improvement of tables, 11
Thurston & Co., 55
Timbrell, William, 40, 43
‘Times,’ the, quoted on the push stroke, 386
Tips of cues, 95;
process of tipping, 95;
cleaning, 95;
renovating, 96
Tobin tubes for ventilating billiard-rooms, 61
Top-of-the-table game, the, 325–348
‘Twisting chalk,’ Carr’s, 7
Two-ball practice, 130–141

Union Club, Manchester, 14, 16

Ventilation in billiard-rooms, 59, 62


Vignaux, M., aid from his book, 3;
cited, 189, 206, 259, 327, 351, 440
Vulcanite cushions, 77

Wales, Prince of, 20;


at championship match, 29;
at match Roberts v. Cook, Newmarket, 47
Walker, Mr. Russell D., aid from, 3;
on the championship, 366, 367
Warming billiard-rooms, 60, 63
White, Fred, 49
Wilson, R., 44
Winning hazards, 142–153;
confidence required, 320
Wright & Co., 55, 71

PRINTED BY
SPOTTISWOODE AND CO., NEW-STREET SQUARE
LONDON

1. If a man wants to play fast he would surely select the worst—not the best—
player as antagonist.—Ed.
2. It is difficult to believe in the possibility of scoring over 700 points in an
hour with the imperfect implements then in use; half that number is probably
nearer the truth.—Ed.
3. Alfred Bennett died after these lines were in type.
4. Roberts twice in 1894, during exhibition games, exceeded 1,000 in spot-
barred breaks, making 1,033 and 1,392.
5. The raised woodwork above the leads.
6. I do not, of course, mean that the spot stroke is a one-position stroke—far
from it; but from an ordinary spectator’s point of view it is summed up in the
words ‘potting the red ad infinitum.’
7. Formerly only four slates were used, with the result that a joint ran straight
across the table from the centre of one middle pocket to the other. If, then, warping
or subsidence of the floor ensued, an ugly ridge arose opposite the pocket, making
it unmissable from one side, and almost impossible from the other.
8. Battens are screwed to the slates in order to take the tacks which fasten
down the cloth.
9. Each ball weighs about 4⅔ ounces.
10. The jointed cue with a spare top joint renders the above devices
unnecessary, and they are all open to some objection.
11. An excellent cushion rest, capable of being used as an ordinary rest, is that
known as the Peall Cushion Rest, which possesses the advantages of simplicity and
ease of handling.
12. See illustration, p. 129.
13. Often called the half-ball angle, both definitions being very inaccurate; but
they are in common use, and generally understood.
14. Or restitution, the effect of compression.
15. The Americans term what we call side ‘English’ or ‘twist.’
16. Delarue, Paris.
17. Memmott has made, we believe, the extraordinary number of 423
consecutive screw back spot strokes.
18. For a description of this game, see pp. 29–31.
19. Taylor’s cannons were made on balls jammed in the jaws of the pocket;
Ives’ cannons were made on balls well outside of the jaws.
20. The numbers quoted are those of the Billiard Association’s Rules.
21. The rules do not say for how many balls the offender has to pay:
presumably all that are left on the table are scored to his adversary.
22. See pp. 148 and 244.
23. Published by Webster, 60 Piccadilly.
24. The numbers quoted are those of the Association Rules.
TRANSCRIBER’S NOTES
1. P. 302, changed “à force de forger on devient forgeron”
to “à force de forger en devient forgeron”.
2. Silently corrected obvious typographical errors and
variations in spelling.
3. Retained archaic, non-standard, and uncertain spellings
as printed.
4. Re-indexed footnotes using numbers and collected
together at the end of the last chapter.
*** END OF THE PROJECT GUTENBERG EBOOK BILLIARDS ***

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

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

Let us accompany you on the journey of exploring knowledge and


personal growth!

textbookfull.com

You might also like