700,718 research outputs found

    Combinatorics on Words 10th International Conference

    Get PDF
    This volume contains the Local Proceedings of the Tenth International Conference on WORDS, that took place at the Kiel University, Germany, from the 14th to the 17th September 2015. WORDS is the main conference series devoted to the mathematical theory of words, and it takes place every two years. The first conference in the series was organised in 1997 in Rouen, France, with the following editions taking place in Rouen, Palermo,Turku, Montreal, Marseille, Salerno, Prague, and Turku. The main object in the scope of the conference, words, are finite or infinite sequences of symbols over a finite alphabet. They appear as natural and basic mathematical model in many areas, theoretical or applicative. Accordingly, the WORDS conference is open to both theoretical contributions related to combinatorial, algebraic, and algorithmic aspects of words, as well as to contributions presenting application of the theory of words, for instance, in other fields of computer science, inguistics, biology and bioinformatics, or physics. For the second time in the history of WORDS, after the 2013 edition, a refereed proceedings volume was published in Springer’s Lecture Notes in Computer Science series. In addition, this local proceedings volume was published in the Kiel Computer Science Series of the Kiel University. Being a conference at the border between theoretical computer science and mathematics, WORDS tries to capture in its two proceedings volumes the characteristics of the conferences from both these worlds. While the Lecture Notes in Computer Science volume was dedicated to formal contributions, this local proceedings volume allows, in the spirit of mathematics conferences, the publication of several contributions informing on current research and work in progress in areas closely connected to the core topics of WORDS. All the papers, the ones published in the Lecture Notes in Computer Science proceedings volume or the ones from this volume, were refereed to high standards by the members of the Program Committee. Following the conference, a special issue of the Theoretical Computer Science journal will be edited, containing extended versions of papers from both proceedings volumes. In total, the conference hosted 18 contributed talks. The papers on which 14 of these talks were based, were published in th LNCS volume; the other 4 are published in this volume. In addition to the contributed talks, the conference program included six invited talks given by leading experts in the areas covered by the WORDS conference: Jörg Endrullis (Amsterdam), Markus Lohrey (Siegen), Jean Néraud (Rouen), Dominique Perrin (Paris), Michaël Rao (Lyon), Thomas Stoll (Nancy). WORDS 2015 was the tenth conference in the series, so we were extremely happy to welcome, as invited speaker at this anniversary edition, Jean Néraud, one of the initiators of the series and the main organiser of the first two editions of this conference. We thank all the invited speakers and all the authors of submitted papers for their contributions to the the success of the conference. We are grateful to the members of the Program Committee for their work that lead to the selection of the contributed talks, and, implicitly, of the papers published in this volume. They were assisted in their task by a series of external referees, gratefully acknowledged below. The submission and reviewing process used the Easychair system; we thank Andrej Voronkov for this system which facilitated the work of the Programme Committee and the editors considerably. We grateful thank Gheorghe Iosif for designing the logo, poster, and banner of WORDS 2015; the logo of the conference can be seen on the front cover of this book. We also thank the editors of the Kiel Computer Science Series, especially Lasse Kliemann, for their support in editing this volume. Finally, we thank the Organising Committee of WORDS 2015 for ensuring the smooth run of the conference

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

    Get PDF
    Обсяг роботи 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

    Full text link
    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

    Preface Volume 30, Issue 3

    Get PDF
    AbstractOne of the main areas of research in logic programming is the design and implementation of sequential and parallel (constraint) logic programming systems. This research goes broadly from the design and specification of novel implementation technology to its actual evaluation in real life situations. A series of workshops on Implementations of Logic Programming Systems, previously held in Budapest (1993), Ithaca (1994), Portland (1995), Bonn (1996), Port Jefferson (1997), Manchester (1998) and Las Cruces (1999) provided a forum for ongoing research on the design and implementation of sequential and parallel (constraint) logic programming systems.This volume contains a collection of papers presented at the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming, held in Las Cruces on December 1st, 1999, in conjunction with ICLP'99. The workshop was sponsored and organised by COMPULOG AMERICAS. The workshop also received support from the Association for Logic Programming and from the Department of Computer Science, New Mexico State University.Papers from both academia and industry were invited. Preference was given to the analysis and description of implemented systems (or currently under implementation) and their associated techniques, problems found in their development or design, and steps taken towards the solution of these problems.Topics included, but were not limited to: •standard and non—standard sequential implementation schemes (e.g., generalization/modification of WAM, translation to C, etc.);implementation of parallel logic programming systems;balance between compile-time effort and run-time machinery;techniques for the implementation of different declarative programming paradigms based on, or extending, logic programming (e.g., constraint logic programming, concurrent constraint languages, equational-logic languages);performance evaluation of sequential and parallel logic programming systems, both through benchmarking and using real world applications;other implementation-related issues, such as memory management, register allocation, use of global optimisations, etc.We were very fortunate to have so many interesting research papers, ranging over widely different subjects and giving a broad coverage of current research in sequential and parallel implementation of logic programming systems. Papers on sequential logic programming systems, focus on varied topics: constraint evaluation, support for extensions to logic programming, and abstract machines for performance evaluation. Papers on parallel logic programming systems also focus on diverse topics ranging from distributed implementations, garbage collection, to optimisations for exploiting and-or parallelism.The editors would like to thank all authors that chose to submit their work to this book, and also for their cooperation in making this document possible. We would also like to thank all referees involved in assessing the papers in this special volume.This volume will be published as volume 30, Issue 3 in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier Science B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URL http://www.elsevier.nl/locate/entcs March 14, 2000Horst Reiche

    Benchmarks for Parity Games (extended version)

    Full text link
    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

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

    Get PDF
    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
    corecore