This work compares the post-editing productivity of professional translators and lay users. We integrate an English to Basque MT system within Bologna Translation Service, an endto-end translation management platform, and perform a producitivity experiment in a real working environment. Six translators and six lay users translate or post-edit two texts from English into Basque. Results suggest ...

In this paper, we consider hybrid numbers with Gaussian Mersenne coefficients and investigate their interesting properties such as the Binet formula, Cassini, Catalan, Vajda, D’Ocagne Honsberger identities. Moreover, illustrate results some examples.

In a recent paper [1], Aggarwal, Joux, Prakash, and Santha (AJPS) describe an ingenious public-key cryptosystem mimicking NTRU over the integers. This algorithm relies on the properties of Mersenne primes instead of polynomial rings. The security of the AJPS cryptosystem relies on the conjectured hardness of the Mersenne Low Hamming Ratio Assumption, defined in [1]. This work shows that AJPS’ s...

We describe an uncountable family of compact group automorphisms with entropy log 2. Each member of the family has a distinct dynamical zeta function, and the members are parametrised by a probability space. A positive proportion of the members have positive upper growth rate of periodic points, and almost all of them have an irrational dynamical zeta function. If infinitely many Mersenne numbe...

We present novel automatic metrics for machine translation evaluation that use discourse structure and convolution kernels to compare the discourse tree of an automatic translation with that of the human reference. We experiment with five transformations and augmentations of a base discourse tree representation based on the rhetorical structure theory, and we combine the kernel scores for each ...

Abstract We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact computation. In particular, we clarify a way to properly prepare a set of initial points (i.e., seeds), which is needed when generating multiple pse...

Quasi-orthogonal Hadamard matrices and Mersenne with two three values of the elements, used in digital data processing, are considered, as well basis error-correcting codes algorithms for transforming orthogonal images. Attention is paid to structures cyclic symmetries antisymmetries. The connection between symmetry antisymmetry on a orders equal prime numbers, products close primes, composite ...

The standard algorithm for testing reducibility of a trinomial of prime degree r over GF(2) requires 2r+O(1) bits of memory and Θ(r) bit-operations. We describe an algorithm which requires only 3r/2 + O(1) bits of memory and significantly fewer bit-operations than the standard algorithm. Using the algorithm, we have found 18 new irreducible trinomials of degree r in the range 100151 ≤ r ≤ 70005...