This paper describes the approach proposed by UNIFESP for the MediaEval 2016 Predicting Media Interestingness Task and for its video subtask only. The proposed approach is based on combining learning-to-rank algorithms for predicting the interestingness of videos by their visual content.

LetG be a Polish group, τ a Polish topology on a spaceX, G acting continuously on (X, τ), with B ⊂ X G-invariant and in the Borel algebra generated by τ . Then there is a larger Polish topology τ ⊃ τ on X so that B is open with respect to τ, G still acts continuously on (X, τ), and τ has a basis consisting of sets that are of the same Borel rank as B relative to τ . 1

Recently, the relationship between matroids and generalized rough sets based on relations has been studied from the viewpoint of linear independence of matrices. In this paper, we reveal more relationships by the predecessor and successor neighborhoods from relations. First, through these two neighborhoods, we propose a pair of matroids, namely predecessor relation matroid and successor relatio...

We present a pairwise learning-to-rank approach to machine translation evaluation that learns to differentiate better from worse translations in the context of a given reference. We integrate several layers of linguistic information encapsulated in tree-based structures, making use of both the reference and the system output simultaneously, thus bringing our ranking closer to how humans evaluat...

Automatically detecting similar Chinese characters is useful in many areas, such as building intelligent authoring tools (e. g. automatic multiple choice question generation) in the area of computer assisted language learning. Previous work on the computation of Chinese character similarity focused on detecting character glyph similarity while ignored the importance of other character features,...

We prove that the smallest degree of an apolar 0-dimensional scheme to a general cubic form in n+ 1 variables is at most 2n+ 2, when n ≥ 8, and therefore smaller than the rank of the form. When n = 8 we show that the bound is sharp, i.e. the smallest degree of an apolar subscheme is 18.

1. Preliminaries. A functor from a category of combinatorial geometries, or equivalently a category of geometric lattices, to a category of commutative algebras will be described, and some properties of this functor will be investigated. In particular, a cohomology will be associated to each point of a geometry and will be derived from the associated algebra. If (G, S) is a geometry on a set S ...

We prove that the probability PN for a real random Gaussian N ×N ×2 tensor to be of real rank N is PN = (Γ((N + 1)/2))N/G(N + 1), where Γ(x), G(x) denote the gamma and Barnes G-functions respectively. This is a rational number for N odd and a rational number multiplied by πN/2 for N even. The probability to be of rank N + 1 is 1− PN . The proof makes use of recent results on the probability of ...