It was recently shown that monotone gene action, i.e., order-preservation between allele content and corresponding genotypic values in the mapping from genotypes to phenotypes, is a prerequisite for achieving a predictable parent-offspring relationship across the whole allele frequency spectrum. Here we test the consequential prediction that the design principles underlying gene regulatory netw...

Let K be a field of characteristic not two or three with an involution and F be its fixed field. Let Hm be the F -vector space of all m-square Hermitian matrices over K. Let ρm denote the set of all rank-one matrices in Hm. In the tensor product space ⊗ k i=1 Hmi , let ⊗ k i=1 ρmi denote the set of all decomposable elements ⊗ k i=1 Ai such that Ai ∈ ρmi , i = 1, . . . , k. In this paper, additi...

Scholars writing books that are widely used to support teaching in higher education may be undervalued due to a lack of evidence of teaching value. Whilst sales data may give credible evidence for textbooks, it may poorly reflect educational uses of other types of books. As an alternative, this article proposes a method to automatically search for mentions of books in online academic course syl...

Automatic acquisition of inference rules for predicates has been commonly addressed by computing distributional similarity between vectors of argument words, operating at the word space level. A recent line of work, which addresses context sensitivity of rules, represented contexts in a latent topic space and computed similarity over topic vectors. We propose a novel two-level model, which comp...

This paper describes TM/XML, an XML syntax for Topic Maps that is very close to the natural, or colloquial, XML representation of the information in the topic map. It can be used to process Topic Maps data with XML tools, and integrate non-Topic Maps systems with Topic

In this paper we study n ∏ i=1 Z2i -Additive Cyclic Codes. These codes are identified as Z2n [x]submodules of n ∏ i=1 Z2i [x]/〈x αi − 1〉; αi and i being relatively prime for each i = 1, 2, . . . , n. We first define a n ∏ i=1 Z2i -additive cyclic code of a certain length. We then define the distance between two codewords and the minimum distance of such a code. Moreover we relate these to binar...