We propose an approach that predicts whether a tweet, which is accompanied by multimedia content (image/video), is trustworthy or deceptive. We test different combinations of quality and trust-oriented features (tweet-based, userbased and forensics) in tandem with a standard classification and an agreement-retraining technique, with the goal of predicting the most likely label (fake or real) fo...

A crucial problem in development of systems for automatic morphological analysis for inflective languages is the treatment of stem alternations. The existing models require development of the corresponding rules that specify what stems can be generated from a given one. Many of such rules (e.g., for Russian about a thousand) do not have any reasonable linguistic interpretation. We suggest a met...

The main objective is to support and assist the development, validation and verification of the SWAN model and its use in operational conditions. The development is based on new scientific insights in the evolution of waves in shallow water. The verification and validation is based on field observations and laboratory experiments supplemented with numerical experiments. Operational use is suppo...

Although non-parametric tests have already been proposed for that purpose, statistical significance tests for non-standard measures (different from the classification error) are less often used in the literature. This paper is an attempt at empirically verifying how these tests compare with more classical tests, on various conditions. More precisely, using a very large dataset to estimate the w...

We investigate techniques for verifying hierarchical systems, i.e., nite state systems with a nesting capability. The straightforward way of analysing a hierarchical system is to rst atten it into an equivalent non-hierarchical system and then apply existing nite state system veriication techniques. Though conceptually simple, attening is severely punished by the hierarchical depth of a system....

A complete, precise, and systematic analysis on the geometrical nature of contacts between two arbitrary polygons and derivation of the geometric contact constraints between two such polygons are provided. Based on the results, a general algorithm is presented to identify the geometrically valid contact formations (CFs) from a given set Spc of possible principal contacts (PCs) between two polyg...

IX

We associate a covering relation to the usual order relation defined in the set of all idempotent endomorphisms projections of a finite-dimensional vector space. A characterization is given of it. This characterization makes this order an order verifying the Jordan-Dedekind chain condition. We give also a property for certain finite families of this order. More precisely, the family of parts in...