In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.

Ex Input:
This paper presents a system which creates and visualizes probabilistic semantic links between concepts in a thesaurus and classes in a classification system. For creating the links, we build on the Polylingual Labeled Topic Model (PLL-TM) [6]. PLL-TM identifies probable thesaurus descriptors for each class in the classification system by using information from the natural language text of documents, their assigned thesaurus descriptors and their designated classes. The links are then presented to users of the system in an interactive visualization, providing them with an automatically generated overview of the relations between the thesaurus and the classification system. Lisa Posch GESIS – Leibniz Institute for the Social Sciences Cologne, Germany Institute for Web Science and Technologies University of Koblenz-Landau, Germany E-mail: lisa.posch@gesis.org Philipp Schaer GESIS – Leibniz Institute for the Social Sciences Cologne, Germany E-mail: philipp.schaer@gesis.org Arnim Bleier GESIS – Leibniz Institute for the Social Sciences Cologne, Germany E-mail: arnim.bleier@gesis.org Markus Strohmaier GESIS – Leibniz Institute for the Social Sciences Cologne, Germany Institute for Web Science and Technologies University of Koblenz-Landau, Germany E-mail: markus.strohmaier@gesis.org

Ex Output:
A System for Probabilistic Linking of Thesauri and Classification Systems


Ex Input:
Problem solving in Answer Set Programming consists of two steps, a first grounding phase, systematically replacing all variables by terms, and a second solving phase computing the stable models of the obtained ground program. An intricate part of both phases is the treatment of aggregates, which are popular language constructs that allow for expressing properties over sets. In this paper, we elaborate upon the treatment of aggregates during grounding in gringo series 4. Consequently, our approach is applicable to grounding based on semi-naive database evaluation techniques. In particular, we provide a series of algorithms detailing the treatment of recursive aggregates and illustrate this by a running example.

Ex Output:
Grounding Recursive Aggregates: Preliminary Report


Ex Input:
In this work we introduce a conditional accelerated lazy stochastic gradient descent algorithm with optimal number of calls to a stochastic first-order oracle and convergence rate O( 1 ε2 ) improving over the projection-free, Online Frank-Wolfe based stochastic gradient descent of Hazan and Kale [2012] with convergence rate O( 1 ε4 ).

Ex Output:

Conditional Accelerated Lazy Stochastic Gradient Descent