Pre-conference proceedings of the 3rd IFIP TC 13.6 HWID working conference

The committees under IFIP include the Technical Committee TC13 on Human – Computer Interaction within which the work of this volume has been conducted. TC 13 on Human-Computer Interaction has as its aim to encourage theoretical and empirical human science research to promote the design and evaluation of human-oriented ICT. Within TC 13 there are different Working Groups concerned with different aspects of Human-Computer Interaction. The flagship event of TC13 is the bi-annual international conference called INTERACT at which both invited and contributed papers are presented. Contributed papers are rigorously refereed and the rejection rate is high. Publications arising from these TC13 events are published as conference proceedings such as the INTERACT proceedings or as collections of selected and edited papers from working conferences and workshops. See http://www.ifip.org/ for aims and scopes of TC13 and its associated Working Group

The Turing Guide

This volume celebrates the various facets of Alan Turing (1912–1954), the British mathematician and computing pioneer, widely considered as the father of computer science. It is aimed at the general reader, with additional notes and references for those who wish to explore the life and work of Turing more deeply. The book is divided into eight parts, covering different aspects of Turing’s life and work. Part I presents various biographical aspects of Turing, some from a personal point of view. Part II presents Turing’s universal machine (now known as a Turing machine), which provides a theoretical framework for reasoning about computation. His 1936 paper on this subject is widely seen as providing the starting point for the field of theoretical computer science. Part III presents Turing’s working on codebreaking during World War II. While the War was a disastrous interlude for many, for Turing it provided a nationally important outlet for his creative genius. It is not an overstatement to say that without Turing, the War would probably have lasted longer, and may even have been lost by the Allies. The sensitive nature of Turning’s wartime work meant that much of this has been revealed only relatively recently. Part IV presents Turing’s post-War work on computing, both at the National Physical Laboratory and at the University of Manchester. He made contributions to both hardware design, through the ACE computer at the NPL, and software, especially at Manchester. Part V covers Turing’s contribution to machine intelligence (now known as Artificial Intelligence or AI). Although Turing did not coin the term, he can be considered a founder of this field which is still active today, authoring a seminal paper in 1950. Part VI covers morphogenesis, Turing’s last major scientific contribution, on the generation of seemingly random patterns in biology and on the mathematics behind such patterns. Interest in this area has increased rapidly in recent times in the field of bioinformatics, with Turing’s 1952 paper on this subject being frequently cited. Part VII presents some of Turing’s mathematical influences and achievements. Turing was remarkably free of external influences, with few co-authors – Max Newman was an exception and acted as a mathematical mentor in both Cambridge and Manchester. Part VIII considers Turing in a wider context, including his influence and legacy to science and in the public consciousness. Reflecting Turing’s wide influence, the book includes contributions by authors from a wide variety of backgrounds. Contemporaries provide reminiscences, while there are perspectives by philosophers, mathematicians, computer scientists, historians of science, and museum curators. Some of the contributors gave presentations at Turing Centenary meetings in 2012 in Bletchley Park, King’s College Cambridge, and Oxford University, and several of the chapters in this volume are based on those presentations – some through transcription of the original talks, especially for Turing’s contemporaries, now aged in their 90s. Sadly, some contributors died before the publication of this book, hence its dedication to them. For those interested in personal recollections, Chapters 2, 3, 11, 12, 16, 17, and 36 will be of interest. For philosophical aspects of Turing’s work, see Chapters 6, 7, 26–31, and 41. Mathematical perspectives can be found in Chapters 35 and 37–39. Historical perspectives can be found in Chapters 4, 8, 9, 10, 13–15, 18, 19, 21–25, 34, and 40. With respect to Turing’s body of work, the treatment in Parts II–VI is broadly chronological. We have attempted to be comprehensive with respect to all the important aspects of Turing’s achievements, and the book can be read cover to cover, or the chapters can be tackled individually if desired. There are cross-references between chapters where appropriate, and some chapters will inevitably overlap. We hope that you enjoy this volume as part of your library and that you will dip into it whenever you wish to enter the multifaceted world of Alan Turing

Алгоритм класифікації та кластерного аналізу DenStream для вирішення задач з забезпечення інформаційної безпеки

Обсяг роботи 80 сторінок, 15 ілюстрацій, 4 таблиці, 1 додаток, 11 джерел літератури. Обʼєктом дослідження стала компʼютерна мережа і потоки інформації, що описують її стан. Предметом дослідження особливості поведінки компʼютерної мережі в ситуаціях здійснення загроз інформаційній безпеці. Метою даної роботи є розробка програмного забезпечення для виявлення аномальної поведінки мережевого трафіку, що здатен врахувати потоковий (стрімінговий) характер надходження даних та оснований на ідеях кластерного аналізу. Подальше використання матеріалів дослідження планується у вивченні технічної можливості підключення розробленого модулю до бібліотеки аналізу аномалій системи Splunk Machine Learning Toolkit. Результати досліджень було апробовано на: XIX Всеукраїнська науково-практична конференція студентів, аспірантів та молодих вчених «Теоретичні та прикладні проблеми фізики, математики та інформатики» КПІ ім. Ігоря Сікорського, 13-14 травня 2021 року. Публікація за результатами досліджень: В.Р. Лихошерст, М. В. Грайворонський Використання стримiнгових алгоритмiв кластеризацiї для виявлення аномалiй мережевого трафiку. Матеріали XIX Всеукраїнської науково-практичної конференції студентів, аспірантів та молодих вчених «Теоретичні та прикладні проблеми фізики, математики та інформатики» КПІ ім. Ігоря Сікорського, 2021. С. 354-357The volume of work 80 pages, 15 illustrations, 4 tables, 1 appendix, 11 sources of literature. The object of the study was a computer network and information flows describing its state. The subject of research is the methods of streaming data clustering. The purpose of this work is to develop software to detect abnormal behavior of network traffic, which is able to take into account the streaming (streaming) nature of data and based on the ideas of cluster analysis. Further use of research materials is planned in studying the technical possibility of connecting the developed module to the library of anomalies analysis of the system Splunk Machine Learning Toolkit The research results were tested on: XIX All-Ukrainian scientific-practical conference of students, graduate students and young scientists "Theoretical and applied problems of physics, mathematics and computer science" KPI. Igor Sikorsky, May 13-14, 2021. Publication based on research results: V.R. Lykhosherst, M. V.Graivoronsky Use of streaming clustering algorithms for detection of network traffic anomalies. Proceedings of the XIX All-Ukrainian scientific-practical conference of students, graduate students and young scientists "Theoretical and applied problems of physics, mathematics and computer science" KPI. Igor Sikorsky, 2021. p. 354-357 Keywords: clusterization, computer attacks, invasion detection system, DenStream, DBSCAN

A Survey on Continuous Time Computations

We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

Benchmarks for Parity Games (extended version)

We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online. We give an overview of the parity games, including a description of how they have been generated. We also describe structural properties of parity games, and using these properties we show that our benchmarks are representative. With this work we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from https://github.com/jkeiren/paritygame-generator. This is an extended version of the paper that has been accepted for FSEN 201

The view from elsewhere: perspectives on ALife Modeling

Many artificial life researchers stress the interdisciplinary character of the field. Against such a backdrop, this report reviews and discusses artificial life, as it is depicted in, and as it interfaces with, adjacent disciplines (in particular, philosophy, biology, and linguistics), and in the light of a specific historical example of interdisciplinary research (namely cybernetics) with which artificial life shares many features. This report grew out of a workshop held at the Sixth European Conference on Artificial Life in Prague and features individual contributions from the workshop's eight speakers, plus a section designed to reflect the debates that took place during the workshop's discussion sessions. The major theme that emerged during these sessions was the identity and status of artificial life as a scientific endeavor

Logical Specification and Analysis of Fault Tolerant Systems through Partial Model Checking

This paper presents a framework for a logical characterisation of fault tolerance and its formal analysis based on partial model checking techniques. The framework requires a fault tolerant system to be modelled using a formal calculus, here the CCS process algebra. To this aim we propose a uniform modelling scheme in which to specify a formal model of the system, its failing behaviour and possibly its fault-recovering procedures. Once a formal model is provided into our scheme, fault tolerance - with respect to a given property - can be formalized as an equational µ-calculus formula. This formula expresses in a logic formalism, all the fault scenarios satisfying that fault tolerance property. Such a characterisation understands the analysis of fault tolerance as a form of analysis of open systems and thank to partial model checking strategies, it can be made independent on any particular fault assumption. Moreover this logical characterisation makes possible the fault-tolerance verification problem be expressed as a general µ-calculus validation problem, for solving which many theorem proof techniques and tools are available. We present several analysis methods showing the flexibility of our approach