Paraphrase patterns are semantically equivalent patterns, which are useful in both paraphrase recognition and generation. This paper presents a pivot approach for extracting paraphrase patterns from bilingual parallel corpora, whereby the paraphrase patterns in English are extracted using the patterns in another language as pivots. We make use of log-linear models for computing the paraphrase l...

We study semilinear evolution equations [Formula: see text] posed on a Hilbert space [Formula: see text], where A is normal and generates a strongly continuous semigroup, B is a smooth nonlinearity from [Formula: see text] to itself, and [Formula: see text], [Formula: see text], [Formula: see text]. In particular the one-dimensional semilinear wave equation and nonlinear Schrödinger equation wi...

0

We present an in-depth study of masses and decays of excited scalar and pseudoscalar [Formula: see text] states in the Extended Linear Sigma Model (eLSM). The model also contains ground-state scalar, pseudoscalar, vector and axial-vector mesons. The main objective is to study the consequences of the hypothesis that the [Formula: see text] resonance, observed a decade ago by the BES Collaboratio...

The string matching problem that appears in many applications like word processing, information retrieval, bibliographic search, molecular biology, etc., consists in finding the first or all the occurrences of a pattern in a text, where the pattern and the text are strings over the same alphabet. Many algorithms for solving this problem exist in literature [10, 20]. The naive (brute force) algo...

We summarize our fully automatic approach to the TRECVID 2009 Search task. Our submissions summarized in Table 1 use linear combinations of the following basic techniques. • text ASR text retrieved by the Dutch translation of selected topic terms. • image Similarity of representative frames of shots. • face Face detector output for topics involving people. • feature Total weight of high level f...

We present an efficient method for character skew rectification in scene text images. The method is based on a novel skew estimators, which exploit intuitive glyph properties and which can be efficiently computed in a linear time. The estimators are evaluated on a synthetically generated data (including Latin, Cyrillic, Greek, Runic scripts) and real scene text images, where the skew rectificat...

Current state-of-the-art speaker verification algorithms use Gaussian Mixture Models (GMM) to estimate the probability density function of the acoustic feature vectors. They are denoted here as global systems. In order to give better performance, they have to be combined with other classifiers, using different fusion methods. The performance of the final classifier depend on the choice of the s...

Traditionally, text is stored on computers as a stremn of characters. The goal of this research is to store text in a form that facilitates word manipulation whilst reducing storage space. A word list with syntactic linear ordering is stored and words in a text are given two-byte integer codes that point to their respective positions in this list. The implementation of the encoding scheme is de...

We consider Pogorelov estimates and Liouville-type theorems to parabolic [Formula: see text]-Hessian equations of the form text] in text]. derive that any text]-convex-monotone solution when satisfies a quadratic growth must be linear function plus polynomial