TASK DEFINITION: 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.
PROBLEM: In this paper, we introduce a new deep convolutional neural network (ConvNet) module that promotes competition among a set of multi-scale convolutional filters. This new module is inspired by the inception module, where we replace the original collaborative pooling stage (consisting of a concatenation of the multi-scale filter outputs) by a competitive pooling represented by a maxout activation unit. This extension has the following two objectives: 1) the selection of the maximum response among the multi-scale filters prevents filter co-adaptation and allows the formation of multiple sub-networks within the same model, which has been shown to facilitate the training of complex learning problems; and 2) the maxout unit reduces the dimensionality of the outputs from the multi-scale filters. We show that the use of our proposed module in typical deep ConvNets produces classification results that are either better than or comparable to the state of the art on the following benchmark datasets: MNIST, CIFAR-10, CIFAR-100 and SVHN.

SOLUTION: Competitive Multi-scale Convolution

PROBLEM: In this paper, we briefly introduce MiniNLP, a natural language processing library for clinical narratives. MiniNLP is an experiment of our ideas on efficient and effective medical language processing. We introduce the overall design of MiniNLP and its major components, and show the performance of it in real projects.

SOLUTION: A Short Introduction to MiniNLP

PROBLEM: There are already quite a few tools for solving the Satisfiability Modulo Theories (SMT) problems. In this paper, we present VolCE, a tool for counting the solutions of SMT constraints, or in other words, for computing the volume of the solution space. Its input is essentially a set of Boolean combinations of linear constraints, where the numeric variables are either all integers or all reals, and each variable is bounded. The tool extends SMT solving with integer solution counting and volume computation/estimation for convex polytopes. Effective heuristics are adopted, which enable the tool to deal with high-dimensional problem instances efficiently and accurately.

SOLUTION:
A Tool for Computing and Estimating the Volume of the Solution Space of SMT(LA) Constraints