- D-CON - lists.rwth-aachen.de

RWTH Junior Principal Investigator Fellowships
by Joost-Pieter Katoen 01 Dec '20

01 Dec '20

[Apologies for multiple copies.] Are you a young rising star in computer science, obtained your PhD less than 3 years ago and spent 2 years outside Germany? Then: consider to apply for a Junior Principal Investigator Fellowship at RWTH Aachen University, one of the top universities in Germany. Application deadline: February 9, 2021. What do we offer? Among others: a. A junior research group leader for 4 years (possibly 5 years). b. Funding for one full-time doctoral candidate. c. A research budget for consumables. d. The opportunity to supervise doctoral candidates e. Mentoring and career development support. More information including application requirements at: https://www.rwth-aachen.de/cms/root/Forschung/Angebote-fuer-Forschende/RWTH… CS@RWTH top notch? Check the information at: https://www.informatik.rwth-aachen.de/cms/Informatik/Fachgruppe/Auszeichnun…

1 0

LATA 2020 & 2021: extended submission deadline October 26
by IRDTA 16 Oct '20

16 Oct '20

LATA 2020 & 2021: extended submission deadline October 26*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ******************************************************************************* 14th-15th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ******************************************************************************* * Extended submission deadline: October 26 * AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Marie-Pierre Béal (University of Paris-Est, FR) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Mikhail Volkov (Ural Federal University, RU) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 26, 2020 – EXTENDED - Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

LATA 2020 & 2021: 3rd call for papers
by IRDTA 01 Oct '20

01 Oct '20

LATA 2020 & 2021: 3rd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ******************************************************************************* 14th-15th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ******************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Marie-Pierre Béal (University of Paris-Est, FR) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Mikhail Volkov (Ural Federal University, RU) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 19, 2020 Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

Several Ph.D. positions in Algorithms, Verification and Logic for Uncertainty and Randomness
by Joost-Pieter Katoen 28 Sep '20

28 Sep '20

====================================================================== Various Open Positions for Research Assistants/Associates in the post-graduate program UnRAVeL “Uncertainty and Randomness in Algorithms, Verification and Logic” at RWTH Aachen University, Aachen, Germany https://www.unravel.rwth-aachen.de/ ====================================================================== Context. The RWTH Aachen University is looking for enthusiastic and highly qualified doctoral researchers. Various positions are available within the interdisciplinary Research Training Group (RTG) UnRAVeL founded by Deutsche Forschungsgemeinschaft (DFG). The key emphasis of an RTG is on the qualification of doctoral researchers with a focused research program and a structured training strategy. The RTG UnRAVeL aims to significantly advance probabilistic modelling and analysis for uncertainty by developing new theories, algorithms, and tool-supported verification techniques, and to apply them to core problems from security (e.g., probabilistic protocols), planning (robotics and railway engineering), and safety and performance analysis (railway systems). To tackle these research challenges, theoretical computer scientists from computer-aided verification, automata, logic and games, algorithms and complexity, together with experts from management science (robust optimization), applied computer science (robotics and security), and railway engineering intensively cooperate within the RTG UnRAVeL. Required profile. Candidates must have (or soon obtain) a master degree in Computer Science, Mathematics or related area and have completed their studies with excellent grades. You should have interest in performing original, highly competitive scientific research, publishing your results in top conferences and scientific journals. Self-motivation and the ability to work both independently and as a team player in local and international research groups are expected. Fluency in English is required; proficiency in German is helpful but not compulsory. How to apply? Your written application should contain: - a curriculum vitae - a transcript of records (list of courses and grades) - a cover letter including a statement of interest in (some of) the RTG topics (Algorithms and Complexity, Verification, Logic, or Application Scenarios) that can be found on our web-site, and - a recommendation letter e.g., by your master thesis supervisor(s). All documents should be formatted as a single pdf-file. You should send your application ultimately by ** October 30, 2020 (AoE) ** to the e-mail address: unravel-appl(a)cs.rwth-aachen.de. We check applications once they are received, and will conduct interview until our vacancies are filled. What do we offer? We offer a stimulating international research environment, the possibility to participate in highly competitive and interdisciplinary research and the opportunity to involve students in your research through project work. Doctoral researchers have a status as employee with a salary according to the German federal employee scale TV-L E13; the exact salary is subject to your family situation. The duration of the positions is three years. RWTH Aachen University offers excellent facilities for professional and personal development. Starting date of the positions: January 1, 2021 and June 1, 2021. Enquiries can be directed to Prof. Joost-Pieter Katoen (e-mail: katoen(a)cs.rwth-aachen.de). RWTH Aachen University is certified as a “Family-Friendly University”. We particularly welcome and encourage applications from women, disabled persons and ethnic minority groups, recognizing they are underrepresented across RWTH Aachen University. The principles of fair and open competition apply and appointments will be made on merit.

1 0

PhD/Post-Doc positions at the University of Duisburg-Essen
by Barbara Koenig 08 Sep '20

08 Sep '20

The Theoretical Computer Science Group (Prof. Barbara Koenig) at the University of Duisburg-Essen, Campus Duisburg (Germany) has two open PhD positions paid according to TV-L 13 (full-time). The first position (no. 604-20) is in the DFG project SpeQt ("Spectra of Behavioural Distances and Quantitative Logics"), which has recently been granted by the German Research Foundation. This is a joint project with Prof. Lutz Schröder at the University of Erlangen-Nürnberg. A project description is attached below. The second position (no. 605-20) is not associated with a specific project. The PhD thesis topic will be in the area of modelling and verification of concurrent systems. You can apply for one or both positions. For both positions, candidates at post-doc level can also be considered. Due to the Covid-19 pandemic universities in Germany are partially closed. However, there is the possibility to meet and work at the university, observing the current Corona regulations. There is of course the possibility to do the job interview virtually. Requirements ------------ You should have or should be in the process of obtaining an MSc or equivalent degree (in Computer Science or Mathematics). Prior knowledge about the topics of the projects is considered an advantage. Good English speaking and writing skills are demanded, as well as the willingness to learn German. For a post-doc position you should have or should be in the process of obtaining a PhD. The application deadline is 8th October 2020. https://www.uni-due.de/theoinf/index_en.php ====================================================================== Your Application ---------------- You can obtain further information by adressing your enquiries to: Barbara Koenig barbara_koenig(a)uni-due.de tel.: ++49-203-3793397 If you are interested in the position, please send your application. Your application should include: * A description of your interest in the position, including your motivation and specific qualifications. * A curriculum vitae, including an abstract of your graduate thesis and the name of your supervisor. * If you are interested in a post-doc position, please include a list of your publications and the names of possible referees. Please send your application directly to me (barbara_koenig(a)uni-due.de). ---------------------------------------------------------------------- DFG Project SpeQt - Spectra of Behavioural Distances and Quantitative Logics ---------------------------------------------------------------------- One of the central topics in the study of concurrent systems are notions of system equivalence, which define when two given system states have the same behaviour in a given sense. Classically, i.e. over relational transition systems, such system semantics range on a spectrum between branching-time and linear-time equivalences, with each equivalence reflecting a notion of possible interaction with systems, and characterized by a dedicated modal logic. In this setting, equivalences and logics are two-valued, i.e. two states are either equivalent or inequivalent, and a formula is either satisfied or not satisfied in a given state. For systems involving quantitative data, such as probabilities, weights, or more generally values in some metric space, it has been recognized that quantitative notions of equivalence, i.e. behavioural distances, and quantitative logics are more suitable for some purposes, and enable a more fine-grained analysis. For instance, while two states in Markov chains with small differences in their transition probabilities are just inequivalent under two-valued probabilistic bisimilarity, a suitable behavioural distance will retain the information that the two states are not exactly equivalent but still quite similar. As indicated above, behavioural distances by their very nature apply to settings that deviate from the classical relational model; these settings are generally less standardized and vary quite widely. This creates a need for uniform methods that apply to many system types at once. For branching-time behavioural metrics, we have developed such methods in earlier work within the framework of universal coalgebra, which encapsulates system types as functors and systems as coalgebras for the given type functor. The objective of SpeQt is to additionally parametrize these methods over the system semantics, thus providing support for spectra of behavioural distances in coalgebraic generality. The key tool we foresee for such a parametrization are graded monads, which we have successfully used in earlier work to parametrize two-valued equivalences. Central research goals include game-theoretic and logical characterization and efficient calculation of distances. Our results will enable us to derive such logics, games and algorithms in a principled way for a whole range of different types of transition systems and for the full spectrum between branching-time and linear-time semantics. We plan to test and evaluate the resulting algorithms in case studies centered around conformance testing of hybrid systems and differential privacy.

1 0

LATA 2020 & 2021: 1st call for papers
by IRDTA 05 Aug '20

05 Aug '20

LATA 2020 & 2021: 1st call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 14th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 & 2021 Milan, Italy March 1-5, 2021 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://irdta.eu/lata2020-2021/ ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 & 2021 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. LATA 2020 & 2021 will merge the scheduled program for LATA 2020, which could not take place because of the Covid-19 crisis, with a new series of papers submitted on this occasion. VENUE: LATA 2020 & 2021 will be held in Milan, the third largest economy among European cities and one of the Four Motors for Europe. The venue will be: University of Milano-Bicocca Viale Piero e Alberto Pirelli 22 Building U6 Aula Mario Martini (Aula U6-04) Milan SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference, inductive inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2020 & 2021 will consist of: invited talks peer-reviewed contributions KEYNOTE SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Laure Daviaud (City, University of London), About Decision Problems for Weighted Automata Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Marie-Pierre Béal (University of Paris-Est, FR) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Amélie Gheerbrant (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Lane A. Hemaspaandra (University of Rochester, US) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Mikhail Volkov (Ural Federal University, RU) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Upload submissions to: https://easychair.org/conferences/?conf=lata20202021 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of Information and Computation (Elsevier, 2019 JCR impact factor: 0.872) will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/lata2020-2021/registration/ DEADLINES (all at 23:59 CET): Paper submission: October 19, 2020 Notification of paper acceptance or rejection: November 23, 2020 Final version of the paper for the LNCS proceedings: November 30, 2020 Early registration: November 30, 2020 Late registration: February 15, 2021 Submission to the journal special issue: June 5, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

SLSP 2020: extended submission deadline June 8
by IRDTA 30 May '20

30 May '20

SLSP 2020: extended submission deadline June 8*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ********************************************************************************** 8th INTERNATIONAL CONFERENCE ON STATISTICAL LANGUAGE AND SPEECH PROCESSING SLSP 2020 Cardiff, United Kingdom October 14-16, 2020 Co-organized by: School of Computer Science and Informatics Cardiff University Data Innovation Research Institute Cardiff University Institute for Research Development, Training and Advice (IRDTA), Brussels/London https://irdta.eu/slsp2020/ ********************************************************************************** * Extended submission deadline: JUNE 8 * AIMS: SLSP is a yearly conference series aimed at promoting and displaying excellent research on the wide spectrum of statistical methods that are currently in use in computational language or speech processing. It aims at attracting contributions from both fields. Though there exist large conferences and workshops hosting contributions to any of these areas, SLSP is a more focused meeting where synergies between the two domains will hopefully happen. In SLSP 2020, significant room will be reserved to young scholars at the beginning of their career and particular focus will be put on methodology. Previous events took place in Tarragona, Grenoble, Budapest, Pilsen, Le Mans, Mons, and Ljubljana. VENUE: SLSP 2020 will take place in Cardiff, the capital of Wales and its political, commercial and cultural centre. The venue will be: Council Chamber Glamorgan Building King Edward VII Ave Cathays Park Cardiff CF10 3WT https://www.cardiff.ac.uk/visit/accessibility/cathays-park-campus/glamorgan… SCOPE: The conference invites submissions discussing the employment of statistical models (including machine learning) within language and speech processing. Topics of either theoretical or applied interest include, but are not limited to: Anaphora and coreference resolution Audio event detection Authorship identification, plagiarism, and spam filtering Biases, explainability and interpretability in language and speech processing Corpora and resources for speech and language Data mining, term extraction, and semantic web Dialogue systems and spoken language understanding Information retrieval and information extraction Knowledge representation and ontologies Lexicons and dictionaries Machine translation and computer-aided translation Multimodal technologies Natural language understanding and generation Neural representation of speech and language Opinion mining and sentiment analysis Part-of-speech tagging, parsing, and semantic role labelling Question-answering systems for speech and text Speaker identification and verification Speech recognition and synthesis Spelling correction Text categorization and summarization Text normalization and inverted text normalization Text-to-speech User modeling Wake word detection STRUCTURE: SLSP 2020 will consist of: invited lectures peer-reviewed contributions posters KEYNOTE SPEAKERS: Dilek Hakkani-Tür (Amazon), Neural Response Generators for Social Conversations John H.L. Hansen (University of Texas, Dallas), Challenges and Advancements in Speaker Diarization & Recognition for Naturalistic Data Streams Mark A. Hasegawa-Johnson (University of Illinois, Urbana-Champaign), Automatic Discovery of Phoneme Inventories for Speech Technology in Under-resourced Languages PROGRAMME COMMITTEE: Mahmoud Al-Ayyoub (Jordan University of Science and Technology, JO) Chitta Baral (Arizona State University, US) Jon Barker (University of Sheffield, UK) Jean-François Bonastre (University of Avignon, FR) Fethi Bougares (University of Le Mans, FR) Felix Burkhardt (audEERING, DE) Nicoletta Calzolari (National Research Council, IT) Bill Campbell (Amazon, US) Angel Chang (Simon Fraser University, CA) Kenneth W. Church (Baidu Research, US) Philipp Cimiano (Bielefeld University, DE) Carol Espy-Wilson (University of Maryland, US) Nikos Fakotakis (University of Patras, GR) Marcello Federico (Amazon AI, US) Robert Gaizauskas (University of Sheffield, UK) Ondřej Glembek (Brno University of Technology, CZ) Ralph Grishman (New York University, US) Thomas Hain (University of Sheffield, UK) Gareth Jones (Dublin City University, IE) Martin Karafiát (Brno University of Technology, CZ) Philipp Koehn (Johns Hopkins University, US) Haizhou Li (National University of Singapore, SG) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Seiichi Nakagawa (Chubu University, JP) Fuchun Peng (Facebook, US) Stephen Pulman (University of Oxford, UK) Matthew Purver (Queen Mary University of London, UK) Paolo Rosso (Technical University of Valencia, ES) Diana Santos (University of Oslo, NO) Irena Spasić (Cardiff University, UK) Tomek Strzalkowski (Rensselaer Polytechnic Institute, US) Erik Tjong Kim Sang (Netherlands eScience Center, NL) Tomoki Toda (Nagoya University, JP) Isabel Trancoso (Instituto Superior Técnico, PT) K. Vijay-Shanker (University of Delaware, US) Hsin-Min Wang (Academia Sinica, TW) Andy Way (Dublin City University, IE) Caiming Xiong (Salesforce, US) Steve Young (University of Cambridge, UK) Wlodek Zadrozny (University of North Carolina Charlotte, US) Guodong Zhou (Soochow University, CN) ORGANIZING COMMITTEE: Luis Espinosa-Anke (Cardiff) Sara Morales (Brussels) Manuel Parra-Royón (Granada) David Silva (London, co-chair) Irena Spasić (Cardiff, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). Upload submissions to: https://easychair.org/conferences/?conf=slsp2020 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS/LNAI series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/slsp2020/registration/ DEADLINES (all at 23:59 CET): Paper submission: June 8, 2020 – EXTENDED - Notification of paper acceptance or rejection: July 6, 2020 Final version of the paper for the LNCS/LNAI proceedings: July 15, 2020 Early registration: July 15, 2020 Late registration: September 30, 2020 Submission to the journal special issue: January 16, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: School of Computer Science and Informatics, Cardiff University / Prifysgol Caerdydd Data Innovation Research Institute, Cardiff University / Prifysgol Caerdydd IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

BigDat 2020 Autumn: early registration June 2
by IRDTA 25 May '20

25 May '20

BigDat 2020 Autumn: early registration June 2*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ********************************************** 7th INTERNATIONAL SCHOOL ON BIG DATA BigDat 2020 Autumn Beersheba, Israel October 25-29, 2020 Co-organized by: Ben-Gurion University of the Negev Department of Software and Information Systems Engineering Data Science Research Center Institute for Research Development, Training and Advice (IRDTA) Brussels / London https://irdta.eu/bigdat2020a/ ********************************************** --- Early registration deadline: June 2, 2020 --- ********************************************** SCOPE: BigDat 2020 Autumn will be a research training event with a global scope aiming at updating participants on the most recent advances in the critical and fast developing area of big data. Previous events were held in Tarragona, Bilbao, Bari, Timisoara, Cambridge and Ancona. Big data is a broad field covering a large spectrum of current exciting research and industrial innovation with an extraordinary potential for a huge impact on scientific discoveries, medicine, engineering, business models, and society itself. Renowned academics and industry pioneers will lecture and share their views with the audience. Most big data subareas will be displayed, namely foundations, infrastructure, management, search and mining, security and privacy, and applications (to biological and health sciences, to business, finance and transportation, to online social networks, etc.). Major challenges of analytics, management and storage of big data will be identified through 24 four-hour and a half courses, 2 keynote lectures and 1 round table, which will tackle the most active and promising topics. The organizers are convinced that outstanding speakers will attract the brightest and most motivated students. Interaction will be a main component of the event. An open session will give participants the opportunity to present their own work in progress in 5 minutes. Moreover, there will be two special sessions with industrial and recruitment profiles. ADDRESSED TO: Master's students, PhD students, postdocs, and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees. Since there will be a variety of levels, specific knowledge background may be assumed for some of the courses. Overall, BigDat 2020 Autumn is addressed to students, researchers and practitioners who want to keep themselves updated about recent developments and future trends. All will surely find it fruitful to listen and discuss with major researchers, industry leaders and innovators. VENUE: BigDat 2020 Autumn will take place in Beersheba, the largest city in the Negev desert of southern Israel and an important technology center. The venue will be: Ben-Gurion University of the Negev Marcus Family Campus https://in.bgu.ac.il/en/Pages/interactive.aspx STRUCTURE: 3 courses will run in parallel during the whole event. Participants will be able to freely choose the courses they wish to attend as well as to move from one to another. KEYNOTE SPEAKERS: tba PROFESSORS AND COURSES: (to be completed) Paolo Addesso (University of Salerno), [introductory/intermediate] Data Fusion for Remotely Sensed Data Thomas Bäck & Hao Wang (Leiden University), [introductory/intermediate] Data Driven Modeling and Optimization for Industrial Applications Paul Bliese (University of South Carolina), [introductory/intermediate] Using R for Mixed-effects (Multilevel) Models Altan Cakir (Istanbul Technical University), [intermediate] Big Data Analytics with Apache Spark Edward Chang (Stanford University), [intermediate] Artificial Intelligence for Disease Diagnosis and Precision Surgery Michael X. Cohen (Radboud University Nijmegen), [introductory] Dimension Explosion and Dimension Reduction in Brain Electrical Activity Ian Fisk (Flatiron Institute), [introductory] The Infrastructure to Support Data Science Michael Freeman (University of Washington), [intermediate] Interactive Data Visualization Using D3 + Observable David Gerbing (Portland State University), [introductory] Derive Meaning from Data with R Visualizations Yifan Hu (Yahoo Research), [introductory/advanced] Data Visualization and Machine Learning Wagner A. Kamakura (Rice University), [intermediate] Advanced Business Analytics using Excel Addins Ravi Kumar (Google), [intermediate/advanced] Clustering for Big Data Victor O.K. Li (University of Hong Kong), [intermediate] Deep Learning and Applications Panos Pardalos (University of Florida), [intermediate/advanced] Optimization and Data Sciences Techniques for Large Networks Valeriu Predoi (University of Reading), [introductory] A Beginner's Guide to Big Data Analysis: How to Connect Scientific Software Development with Real World Problems Alexandre Vaniachine (VirtualHealth), [intermediate] Open-source Columnar Databases Sebastián Ventura (University of Córdoba), [intermediate/advanced] Supervised Descriptive Pattern Mining Xiaowei Xu (University of Arkansas, Little Rock), [introductory/advanced] Deep Learning for Text Mining OPEN SESSION An open session will collect 5-minute voluntary presentations of work in progress by participants. They should submit a half-page abstract containing the title, authors, and summary of the research to david(a)irdta.eu by October 17, 2020. INDUSTRIAL SESSION: A session will be devoted to 10-minute demonstrations of practical applications of big data in industry. Companies interested in contributing are welcome to submit a 1-page abstract containing the program of the demonstration and the logistics needed. People participating in the demonstration must register for the event. Expressions of interest have to be submitted to david(a)irdta.eu by October 17, 2020. EMPLOYER SESSION: Firms searching for personnel well skilled in big data will have a space reserved for one-to-one contacts. It is recommended to produce a 1-page .pdf leaflet with a brief description of the company and the profiles looked for to be circulated among the participants prior to the event. People in charge of the search must register for the event. Expressions of interest have to be submitted to david(a)irdta.eu by October 17, 2020. ORGANIZING COMMITTEE: Stavi Baram (Beersheba) Mark Last (Beersheba) Carlos Martín-Vide (Tarragona, program chair) Sara Morales (Brussels) Manuel J. Parra-Royón (Granada) Lior Rokach (Beersheba, co-chair) Bracha Shapira (Beersheba, co-chair) David Silva (London, co-chair) REGISTRATION: It has to be done at https://irdta.eu/bigdat2020a/registration/ The selection of up to 8 courses requested in the registration template is only tentative and non-binding. For the sake of organization, it will be helpful to have an estimation of the respective demand for each course. During the event, participants will be free to attend the courses they wish. Since the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed and the on-line registration tool disabled when the capacity of the venue is exhausted. It is highly recommended to register prior to the event. FEES: Fees comprise access to all courses and lunches. There are several early registration deadlines. Fees depend on the registration deadline. Refunding of registration fees will not be possible. However, an exception will be made in case the event must be postponed due to the continuation of the coronavirus crisis in Autumn (which is a scenario the organizers do not expect). ACCOMMODATION: Suggestions for accommodation will be available in due time. CERTIFICATE: A certificate of successful participation in the event will be delivered indicating the number of hours of lectures. QUESTIONS AND FURTHER INFORMATION: david(a)irdta.eu ACKNOWLEDGMENTS: Ben-Gurion University of the Negev Institute for Research Development, Training and Advice (IRDTA) – Brussels/London

1 0

TPNC 2020: 1st call for papers
by IRDTA 22 May '20

22 May '20

TPNC 2020: 1st call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* **************************************************************************** 9th INTERNATIONAL CONFERENCE ON THE THEORY AND PRACTICE OF NATURAL COMPUTING TPNC 2020 Taoyuan, Taiwan December 7-9, 2020 Co-organized by: Chung Yuan Christian University College of Science Institute for Research Development, Training and Advice - IRDTA Brussels / London https://irdta.eu/tpnc2020/ **************************************************************************** AIMS: TPNC is a conference series intending to cover the wide spectrum of computational principles, models and techniques inspired by information processing in nature. TPNC 2020 will reserve significant room for young scholars at the beginning of their career and particular focus will be put on methodology. The conference aims at attracting contributions to nature-inspired models of computation, synthesizing nature by means of computation, nature-inspired materials, and information processing in nature. Previous events took place in Tarragona, Cáceres, Granada, Mieres, Sendai, Prague, Dublin and Kingston. VENUE: TPNC 2020 will take place in Taoyuan, in northwestern Taiwan, neighboring Taipei and home to many industrial parks and tech company headquarters. The venue will be: tba SCOPE: Topics include, but are not limited to: - Theoretical contributions to: affective computing ambient intelligence ant colony optimization approximate reasoning artificial immune systems artificial life cellular automata cognitive computing cognitive robotics collective intelligence combinatorial optimization computational intelligence computing with words developmental systems DNA computing evolutionary algorithms evolutionary computing evolutionary game theory fuzzy logic fuzzy sets fuzzy systems genetic algorithms genetic programming global optimization granular computing heuristics intelligent agents intelligent control intelligent manufacturing intelligent systems intelligent user interfaces machine intelligence membrane computing metaheuristics molecular programming multiobjective optimization neural networks quantum communication quantum computing quantum information rough sets soft computing swarm intelligence swarm robotics unconventional computing - Applications of natural computing to: algorithmics bioinformatics cryptography design economics graphics hardware human-computer interaction knowledge discovery learning logistics medicine natural language processing pattern recognition planning and scheduling programming telecommunications web intelligence A flexible "theory to/from practice" approach would be the perfect focus for the expected contributions. STRUCTURE: TPNC 2020 will consist of: - invited talks - peer-reviewed contributions - posters KEYNOTE SPEAKERS: tba PROGRAMME COMMITTEE: (to be completed) Erik Cambria (Nanyang Technological University, SG) Shyi-Ming Chen (National Taiwan University of Science and Technology, TW) Leroy Cronin (University of Glasgow, UK) Yong Deng (University of Electronic Science and Technology of China, CN) Étienne Kerre (Ghent University, BE) Gui Lu Long (Tsinghua University, CN) Jie Lu (University of Technology Sydney, AU) Robert Mann (University of Waterloo, CA) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Luis Martínez López (University of Jaén, ES) Seyedali Mirjalili (Torrens University Australia, AU) Saeid Nahavandi (Deakin University, AU) Matjaž Perc (University of Maribor, SI) Patrick Siarry (Paris-Est Créteil University, FR) Dan Simon (Cleveland State University, US) Andrzej Skowron (University of Warsaw, PL) Stephen Smith (University of York, UK) Ponnuthurai N. Suganthan (Nanyang Technological University, SG) Miin-Shen Yang (Chung Yuan Christian University, TW) Simon X. Yang (University of Guelph, CA) Yi Zhang (Sichuan University, CN) ORGANIZING COMMITTEE: Meng-Hui Li (Taoyuan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) David Silva (London, co-chair) Miguel A. Vega-Rodríguez (Cáceres) Miin-Shen Yang (Taoyuan, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). Upload submissions to: https://easychair.org/conferences/?conf=tpnc2020 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: https://irdta.eu/tpnc2020/registration/ DEADLINES (all at 23:59 CET): Paper submission: July 25, 2020 Notification of paper acceptance or rejection: August 29, 2020 Final version of the paper for the LNCS proceedings: September 5, 2020 Early registration: September 5, 2020 Late registration: November 23, 2020 Submission to the journal special issue: March 9, 2021 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Chung Yuan Christian University IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

BigDat 2020 Autumn: early registration May 9
by IRDTA 04 May '20

04 May '20

BigDat 2020 Autumn: early registration May 9*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ********************************************** 7th INTERNATIONAL SCHOOL ON BIG DATA BigDat 2020 Autumn Beersheba, Israel October 25-29, 2020 Co-organized by: Ben-Gurion University of the Negev Department of Software and Information Systems Engineering Data Science Research Center Institute for Research Development, Training and Advice (IRDTA) Brussels / London https://irdta.eu/bigdat2020a/ ********************************************** --- Early registration deadline: May 9, 2020 --- ********************************************** SCOPE: BigDat 2020 Autumn will be a research training event with a global scope aiming at updating participants on the most recent advances in the critical and fast developing area of big data. Previous events were held in Tarragona, Bilbao, Bari, Timișoara, Cambridge and Ancona. Big data is a broad field covering a large spectrum of current exciting research and industrial innovation with an extraordinary potential for a huge impact on scientific discoveries, medicine, engineering, business models, and society itself. Renowned academics and industry pioneers will lecture and share their views with the audience. Most big data subareas will be displayed, namely foundations, infrastructure, management, search and mining, security and privacy, and applications (to biological and health sciences, to business, finance and transportation, to online social networks, etc.). Major challenges of analytics, management and storage of big data will be identified through 24 four-hour and a half courses, 2 keynote lectures and 1 round table, which will tackle the most active and promising topics. The organizers are convinced that outstanding speakers will attract the brightest and most motivated students. Interaction will be a main component of the event. An open session will give participants the opportunity to present their own work in progress in 5 minutes. Moreover, there will be two special sessions with industrial and recruitment profiles. ADDRESSED TO: Master's students, PhD students, postdocs, and industry practitioners will be typical profiles of participants. However, there are no formal pre-requisites for attendance in terms of academic degrees. Since there will be a variety of levels, specific knowledge background may be assumed for some of the courses. Overall, BigDat 2020 Autumn is addressed to students, researchers and practitioners who want to keep themselves updated about recent developments and future trends. All will surely find it fruitful to listen and discuss with major researchers, industry leaders and innovators. VENUE: BigDat 2020 Autumn will take place in Beersheba, the largest city in the Negev desert of southern Israel and an important technology center. The venue will be: Ben-Gurion University of the Negev Marcus Family Campus https://in.bgu.ac.il/en/Pages/interactive.aspx STRUCTURE: 3 courses will run in parallel during the whole event. Participants will be able to freely choose the courses they wish to attend as well as to move from one to another. KEYNOTE SPEAKERS: tba PROFESSORS AND COURSES: (to be completed) Paolo Addesso (University of Salerno), [introductory/intermediate] Data Fusion for Remotely Sensed Data Thomas Bäck & Hao Wang (Leiden University), [introductory/intermediate] Data Driven Modeling and Optimization for Industrial Applications Paul Bliese (University of South Carolina), [introductory/intermediate] Using R for Mixed-effects (Multilevel) Models Altan Cakir (Istanbul Technical University), [intermediate] Big Data Analytics with Apache Spark Michael X. Cohen (Radboud University Nijmegen), [introductory] Dimension Explosion and Dimension Reduction in Brain Electrical Activity Ian Fisk (Flatiron Institute), [introductory] The Infrastructure to Support Data Science Michael Freeman (University of Washington), [intermediate] Interactive Data Visualization Using D3 + Observable David Gerbing (Portland State University), [introductory] Derive Meaning from Data with R Visualizations Yifan Hu (Yahoo Research), [introductory/advanced] Data Visualization and Machine Learning Ravi Kumar (Google), [intermediate/advanced] Clustering for Big Data Victor O.K. Li (University of Hong Kong), [intermediate] Deep Learning and Applications Panos Pardalos (University of Florida), [intermediate/advanced] Optimization and Data Sciences Techniques for Large Networks Valeriu Predoi (University of Reading), [introductory] A Beginner's Guide to Big Data Analysis: How to Connect Scientific Software Development with Real World Problems Alexandre Vaniachine (VirtualHealth), [intermediate] Open-source Columnar Databases Sebastián Ventura (University of Córdoba), [intermediate/advanced] Supervised Descriptive Pattern Mining Xiaowei Xu (University of Arkansas, Little Rock), [introductory/advanced] Deep Learning for Text Mining OPEN SESSION An open session will collect 5-minute voluntary presentations of work in progress by participants. They should submit a half-page abstract containing the title, authors, and summary of the research to david(a)irdta.eu by October 17, 2020. INDUSTRIAL SESSION: A session will be devoted to 10-minute demonstrations of practical applications of big data in industry. Companies interested in contributing are welcome to submit a 1-page abstract containing the program of the demonstration and the logistics needed. People participating in the demonstration must register for the event. Expressions of interest have to be submitted to david(a)irdta.eu by October 17, 2020. EMPLOYER SESSION: Firms searching for personnel well skilled in big data will have a space reserved for one-to-one contacts. It is recommended to produce a 1-page .pdf leaflet with a brief description of the company and the profiles looked for to be circulated among the participants prior to the event. People in charge of the search must register for the event. Expressions of interest have to be submitted to david(a)irdta.eu by October 17, 2020. ORGANIZING COMMITTEE: Stavi Baram (Beersheba) Mark Last (Beersheba) Carlos Martín-Vide (Tarragona, program chair) Sara Morales (Brussels) Manuel J. Parra-Royón (Granada) Lior Rokach (Beersheba, co-chair) Bracha Shapira (Beersheba, co-chair) David Silva (London, co-chair) REGISTRATION: It has to be done at https://irdta.eu/bigdat2020a/registration/ The selection of up to 8 courses requested in the registration template is only tentative and non-binding. For the sake of organization, it will be helpful to have an estimation of the respective demand for each course. During the event, participants will be free to attend the courses they wish. Since the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed and the on-line registration tool disabled when the capacity of the venue is exhausted. It is highly recommended to register prior to the event. FEES: Fees comprise access to all courses and lunches. There are several early registration deadlines. Fees depend on the registration deadline. Refunding of registration fees will not be possible. However, an exception will be made in case the event must be postponed due to the continuation of the coronavirus crisis in Autumn (which is a scenario the organizers do not expect). ACCOMMODATION: Suggestions for accommodation will be available in due time. CERTIFICATE: A certificate of successful participation in the event will be delivered indicating the number of hours of lectures. QUESTIONS AND FURTHER INFORMATION: david(a)irdta.eu ACKNOWLEDGMENTS: Ben-Gurion University of the Negev Institute for Research Development, Training and Advice (IRDTA) – Brussels/London

1 0