The problem of determining of the normalization constant of a wave function describing an arbitrary type of an infinite motion for a one-dimensional potential is discussed. It is shown that for the cases of the momentum or the quasi-wave number representations the normalization constant does not depend on the representation parameter. In contrast to these cases for the energy representation the...

We study the matrix representation of Poincaré normalization using the Carleman linearization technique for non-autonomous differential systems with quasi-periodic coefficients. We provide a rigorous proof of the validity of the matrix representation of the normalization and obtain a recursive algorithm for computing the normalizing transformation and the normal form of the differential systems...

This paper deals with morphological and part-of-speech tagging applied to manuscripts written in Middle High German. I present the results of a set of experiments that involve different levels of token normalization and dialect-specific subcorpora. As expected, tagging with “normalized”, quasi-standardized tokens performs best. Normalization improves accuracies by .–. percentage points, r...

Let I be a monomial ideal in a polynomial ring over a field k. If the Rees cone of I is quasi-ideal, we express the normalization of the Rees algebra of I in terms of an Ehrhart ring. We introduce the basis Rees cone of a matroid and study their facets. Then an application to Rees algebras is presented.

This paper advances a new “quasi-blind” calibration algorithm to calibrate a multi-array network (MAN) of acoustic-vector-sensors, whose component-sensors may have non-ideal gain/phase responses, incorrect orientations, and imprecise locations. This proposed calibration is “quasi-blind” in not requiring any prior knowledge/estimation of any training signal’s arrival-angle. This proposed algorit...

We discuss the logic of pregroups, introduced by Lambek [34], and its connections with other type logics and formal grammars. The paper contains some new ideas and results: the cut-elimination theorem and a normalization theorem for an extended system of this logic, its P-TIME decidability, its interpretation in L1, and a general construction of (quasi-ordered) bilinear algebras and pregroups w...

This paper deals with part-of-speech tagging applied to manuscripts written in Middle High German. We present the results of a set of experiments that involve different levels of token normalization and dialect-specific subcorpora. As expected, tagging with “normalized”, quasi-standardized tokens performs best (accuracy > 91%). Training on slightly simplified word forms or on larger corpora of ...