Slovenskočeský NLP workshop (SloNLP 2016) - 18. september

stránka workshopu

Organizátori: Rudolf Rosa a Petra Barančíková (ÚFAL MFF UK) Kontakt: {rosa, barancikova}@ufal.mff.cuni.cz

SloNLP je slovenskočeský workshop speciálně zaměřený na zpracování přirozeného jazyka a počítačovou lingvistiku. Jeho hlavním cílem je podpořit spolupráci mezi mladými výzkumníky v oblasti NLP v Česku a na Slovensku; k účasti proto vyzýváme zejména magisterské studenty a doktorandy věnující se počítačové lingvistice. Mezi témata workshopu patří automatické rozpoznávání mluvené řeči (ASR), automatická analýza a generování přirozeného jazyka (morfologie, syntax, sémantika...), dialogové systémy, strojový překlad (MT), vyhledávání informací (IR), praktické aplikace NLP technologií, a další témata počítačové lingvistiky. Uvítáme i články o probíhajícím výzkumu s předběžnými výsledky (work in progress), články popisující negativní výsledky (negative results), a články představující návrhy na budoucí výzkum.

Programový výbor:

• Rudolf Rosa (ÚFAL MFF UK)
• Petra Barančíková (ÚFAL MFF UK)
• Vladimír Benko (JÚĽŠ SAV)
• Ján Genči (KPI TUKE)
• Aleš Horák (FI MUNI)
• Markéta Lopatková (ÚFAL MFF UK)
• David Mareček (ÚFAL MFF UK)
• Alexandr Rosen (ÚTKL FF UK)

Computational Intelligence and Data Mining - September 17th and 18th

4rd international workshop

Within the 16th conference on Information Technologies - Applications and Theory, ITAT 2016, which will be held September 15–19 in Tatranske Matliare, in the eastern part the fascinating Slovak mountains High Tatras, the 4th international workshop Computational Intelligence and Data Mining will be organized. We welcome contributions concerning all topics related to these two overlapping areas, in particular the following:

• Learning, including metalearning and active learning
• Artificial neural networks, including deep networks
• Metaheuristics, including evolutionary algorithms and evolutionary optimization
• Fuzzy systems, including fuzzy reasoning
• Exploratory data analysis
• Data mining based on machine learning and/or statistical methods
• Statistical models, including distribution models, regression models and classifiers
• Rules extraction from data
• Analysis of time series or sequences
• Applications of computational intelligence and data mining methods

Prospective authors are requested to prepare a 2-column paper of 5-8 pages length in English, according to the LaTeX class “itatnew” and to submit it using the EasyChair system. Each submitted paper will be reviewed by 2-3 members of the international program committee. All accepted papers will be published in ITAT proceedings (electronic and paper version), papers receiving the best evaluations by reviewers will be made publicly available through the frequently accessed CEUR Workshop Proceedings publication service (CEUR-WS.org).

Programový výbor:

• Dirk Arnold, University of Dalhousie
• Jose Luis Balcazar, Technical University of Catalonia, Barcelona
• Petr Berka, University of Economics, Prague
• Pascal Bouvry, University of Luxemburg
• Hans Engler, University of Georgetown
• Jan Faigl, Czech Technical University, Prague
• Pitoyo Hartono, University of Chukyo
• Martin Holeňa, Czech Academy of Sciences, Prague
• Ján Hric, Charles University, Prague
• Zsolt Csaba Johanyák, University of Kecskemét
• Robert John, University of Nottingham
• Jan Kalina, Czech Academy of Sciences, Prague
• Jiří Kléma, Czech Technical University, Prague
• Pavel Kordík, Czech Technical University, Prague
• Tomas Krilavičius, Vytautas Magnus University, Kaunas
• Věra Kůrková, Czech Academy of Sciences, Prague
• Stéphane Lallich, University of Lyon
• Philippe Lenca, Telecom Bretagne, Brest
• Antoni Ligęza, AGH University of Science and Technology, Krakow
• Marco Lübbecke, RWTH University, Aachen
• Donato Malerba, University of Bari
• Mirko Navara, Czech Technical University, Prague
• Engelbert Memphu Nguifo, Blaise Pascal University, Clermont-Ferrand
• Ostap Okhrin, Technical University of Dresden
• Tomáš Pevný, Czech Technical University, Prague
• Petr Pošík, Czech Technical University, Prague
• Jan Rauch, University of Economics, Prague
• Jose Luis Calvo Rolle, University of Coruña
• Patrick Siarry, University of Paris-East
• Heike Trautmann, University of Münster
• Tingting Zhang, Mid-Sweden University, Sundsvall
• Filip Železný, Czech Technical University, Prague

WASACNA 2016 : Workshop on Algorithmic and Structural Aspects of Complex Networks and Applications - September 17th

The network science is interdisciplinary, very active research area that blends rigorous theory and experiments in analyzing structure and behavior of real-world complex networks. The workshop is aimed to offer a platform for exchanging research results on the theoretical foundation, computational, algorithmic, structural, experimental and empirical aspects of complex networks. The submissions of high-quality and original research papers are welcomed however authors are encouraged to describe work in progress and/or late research results. It is strongly recommended that submitted papers should address an application to real-world problems.

Paper submission: follow the ITAT author’s formatting instructions

Program Committee:

• Naďa Krivoňáková (FCHPT SUT)
• Marek Lelovský (FCHPT SUT)
• Martin Nehéz (FCHPT SUT, chair)
• Soňa Pavlíková (FCHPT SUT)
• Imrich Vrťo (IM SAV)

Algorithmic Aspects of Finding Semigroups of Partial Automorphisms of Combinatorial Structures - September 17th

The problem of the time complexity of determining the full automorphism group of a combinatorial structure (for example a graph) is one of the well-known unsettled algorithmic problems with numerous practical implications in a number of fields. The relevance of this topic was well documented by the immense interest exhibited by the research community with regard to the recent breakthrough of Laszlo Babai who announced the discovery of a quasipolynomial time algorithm for graphs. The focus of our workshop will be on an extension of the automorphism group problem to that of inverse semigroup problem. The full inverse semigroup of partial automorphisms of a combinatorial structure is a much richer algebraical structure that contains the automorphism group of the combinatorial object as a subgroup. Furthermore, the inverse semigroup of partial automorphisms contains much more detailed local information about the underlying object. Thus, the problem of determining the full inverse semigroup of partial automorphisms of a combinatorial structure is at least as hard as the corresponding automorphism group problem.

In our workshop, we focus on algorithmic problems related to determining the inverse semigroup of a combinatorial structure as well as related problems of finding structures with a given inverse semigroup, and applications of inverse semigroups to constructing objects with a prescribed relation between their local and global properties.

We invite interested participants to contact the organizers, and submit a short abstract via EasyChair. Please prepare and submit your abstract in the text form as well as in pdf using provided LaTeX template. Pdf form of the abstract may contain math symbols and references. It will be included in the the conference proceedings. In the Easychair system, include your pdf abstract in the field labelled as paper and also submit the LaTeX source files in a zip file.

This workshop is sponsored by the VEGA 1/0577/14 grant aimed at investigating the relations between Semigroup Theory and Combinatorics.

Organizers:

• Tatiana Jajcayová, Dept. of Applied Comp. Science,
• Róbert Jajcay, Dept. of Algebra, Faculty of Mathematics, Physics and Computer Science, Comenius University, Bratislava, Slovakia