In this paper, we demonstrate the impact of Multiword Expression (MWE) resources in the task of MWE recognition in text. We present results based on the Wiki50 corpus for MWE resources, generated using unsupervised methods from raw text and resources that are extracted using manual text markup and lexical resources. We show that resources acquired from manual annotation yield the best MWE taggi...

In this work, we present a new low memory requirement and low computational time method for solving a class of integral equation of the second kind which is based on the use of B-Spline wavelets. Because of vanishing moments and compact support and semiorthogonality properties of these wavelets, operational matrix of the method is very sparse. Also, applying some appropriate thresholding parame...

The effective use of parallelized hardware is an important goal of today’s computer developments. Nvidia GPUs are an important footing in this context. While CUDA implemented algorithms focus on detailed optimized usage of GPU elements the pragma directive parallelization targets GPU computation for a broader community. In this paper we focus on the implementation of OpenACC and OpenMP 4.5 para...

The way information is represented and processed in a neural network may have important consequences on its computational power and complexity. Basically, information representation refers to distributed or localist encoding and information processing refers to schemes of connectivity that can be complete or minimal. In the past, theoretical and biologically inspired approaches of neural comput...

We reduce (in polynomial time) the enumeration of minimal dominating sets in interval and permutation graphs to the enumeration of paths in DAGs. As a consequence, we can enumerate in linear delay, after a polynomial time pre-processing, minimal dominating sets in interval and permutation graphs. We can also count them in polynomial time. This improves considerably upon previously known results...

During V(D)J recombination, the coding ends to be joined are extensively modified. Those modifications, termed coding-end processing, consist of removal and addition of various numbers of nucleotides. We previously showed in vivo that coding-end processing is specific for each coding end, suggesting that specific motifs in a coding-end sequence influence nucleotide deletion and P-region formati...