Statistical inference about the speciation process has often been based on the isolation-with-migration (IM) model, especially when the research aim is to learn about the presence or absence of gene flow during divergence. The generalised IM model introduced in this paper extends both the standard two-population IM model and the isolation-with-initial-migration (IIM) model, and encompasses both...

We provide a library to facilitate the implementation of new models in codes such as matrix element and event generators or codes for computing dark matter observables. The library contains a SLHA reader routine as well as diagonalisation routines. This library is also available in CalcHEP, micrOMEGAs and LanHEP.

A full-rank IC x n matrix G ( D ) over the rational functions F ( D ) generates a rate R = k / n convolutional code C. G ( D ) is minimal if it can be realized with as few memory elements as any encoder for C, and G ( D ) is canonical if it has a minimal realization in controller canonical form. We show that G ( D ) is minimal if and only if for all rational input sequences p1 ( D ) , the span ...

We discuss the decoding of error-correcting block codes over complex numbers for the transmission over impulsive noise channels. The encoder multiplies a vector of complex information symbols resulting from a modulation scheme, e.g., quadrature amplitude modulation (QAM), with a unitary generator matrix . Choosing the inverse Fourier transform as , the encoding procedure is similar to orthogona...

By extension of a fault detection optimization approach to linear time invariant (LTI) systems, this short paper deals with the fault detection filter (FDF) problem for linear time-delay systems with L2-norm bounded unknown inputs. The basic idea is first to introduce a new FDF as the residual generator; and then based on an objective function to formulate the FDF design as an optimization prob...

In this paper we study a MAP/M/K system with join-the-shortest-queue (JSQ) discipline which consists of K servers and K queues with infinite buffers. An arrival joins the shortest queue and in the case that there are n (n≤ K) queues having the same shortest length, the customer will join any one of these shortest queues with probability 1/n. We model the system as a levelexpanding QBD (LDQBD) p...

This paper presents a method for calculating steady state probabilities of M |Er|c|K queueing systems. The infinitesimal generator matrix is used to define all possible states in the system and their transition probabilities. While this matrix can be written down immediately for many other M |PH |c|K queueing systems with phase-type service times (e.g. Coxian, Hypoexponential, . . . ), it requi...

In previous works we considered codes defined as ideals of quotients of non commutative polynomial rings, so called Ore rings of automorphism type. In this paper we consider codes defined as modules over non commutative polynomial rings, removing therefore some of the constraints on the length of the codes defined as ideals. The notion of BCH codes can be extended to this new approach and the c...

This paper investigates polar codes for q-ary input channels using other kernels than [ 1 0 1 1 ] to construct the generator matrix. The kernel is optimized by maximizing the spread of the polar martingale and it is shown that in certain cases, the resulting construction has a significantly improved error probability (even at small block length like n = 1024).

We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a Reed-Solomon code of small field size. As a by-product of this result, we settle the GM-MDS conjecture of Dau et. al. in the affirmative.