UNLABELLED We describe a tool for quantifying the uniformity of mapped reads in high-throughput sequencing experiments. Our statistic directly measures the uniformity of both read position and fragment length, and we explain how to compute a P-value that can be used to quantify biases arising from experimental protocols and mapping procedures. Our method is useful for comparing different protoc...

Balanced truncation is the most commonly used model order reduction scheme in control engineering. This is due to its favorable properties of automatic stability preservation and the existence of a computable error bound, enabling the adaption of the reduced model order to a specified tolerance. It aims at minimizing the worst case error of the frequency response over the full infinite frequenc...

We derive new trace inequalities for NURBS-mapped domains. In addition to Sobolev-type inequalities, we derive discrete trace inequalities for use in NURBS-based isogeometric analysis. All dependencies on shape, size, polynomial order, and the NURBS weighting function are precisely specified in our analysis, and explicit values are provided for all bounding constants appearing in our estimates....

We study the distribution of the mean radial displacement of charges of a two-dimensional (2D) one-component plasma in the thermodynamic limit N→∞ at finite temperature β>0. We compute explicitly the large deviation functions showing the emergence of a fourth-order phase transition as a consequence of a change of topology in the plasma distribution. This weak phase transition occurs exactly at ...

In this paper we generalize a result of Benson to all finite generalized polygons. In particular, given a collineation θ of a finite generalized polygon S, we obtain a relation between the parameters of S and, for various natural numbers i, the number of points x which are mapped to a point at distance i from x by θ. As a special case we consider generalized 2n-gons of order (1, t) and determin...

We introduce a new identification scheme based on the Gap Diffie-Hellman problem. Our identification scheme makes use of the fact that the computational Diffie-Hellman problem is hard in the additive group of points of an elliptic curve over a finite field, on the other hand, the decisional Diffie-Hellman problem is easy in the multiplicative group of the finite field mapped by a bilinear map. ...

The problem of finite model finding, finding a satisfying model for a set of first-order logic formulas for a finite scope, is an important step in many verification techniques. In MACE-style solvers, the problem is mapped directly to a SAT problem. We investigate an alternative solution of mapping the problem to the logic of equality with uninterpreted functions (EUF), a decidable logic with m...

in order to determine optimum landuses (in accordance with natural capability) and improve the current land management, landuse planning process was applied by using gis. within the framework of system analysis approach basic ecological and socio-economic , data were mapped. the mapped data were digitized and imported to idrisi and arc/info to build a database ,along with other descriptive data...