In this paper we discuss the deflation criterion used in the extended QR algorithm based on the chasing of rotations. We provide absolute and relative perturbation bounds for this deflation criterion. Further, we present a generalization of aggressive early deflation to the extended QR algorithms. Aggressive early deflation is the key technique for the identification and deflation of already co...

We explore extended B-splines as a stable basis for isogeometric analysis with trimmed parameter spaces. The stabilization is accomplished by an appropriate substitution of Bsplines that may lead to ill-conditioned system matrices. The construction for non-uniform knot vectors is presented. The properties of extended B-splines are examined in the context of interpolation, potential, and linear ...

C λ-extended oscillator algebras, generalizing the Calogero-Vasiliev algebra , where C λ is the cyclic group of order λ, have recently proved very useful in the context of supersymmetric quantum mechanics and some of its variants. Here we determine the spectrum generating algebra of the C λ-extended oscillator. We then construct its coherent states, study their nonclassical properties, and comp...

We present the extended Kuranishi space for Kodaira surface as a nontrivial example to Kontsevich and Barannikov’s extended deformation theory. We provide a non-trivial example of Hertling-Manin’s weak Frobenius manifold. In addition, we find that Kodaira surface is its own mirror image. Our computation is done in the context of compact nilmanifolds. The calculation of extended deformation and ...

Tree descriptions based on dominance constraints are popular in several areas of computational linguistics including syntax, semantics , and discourse. Tree descriptions in the language of context unii-cation have attracted some interest in uniication and rewriting theory. Recently, dominance constraints and context uniication have both been used in diierent underspeciied approaches to the sema...

First we modify the basic (binary) context-tree weighting method such that the past symbols x1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source se...

First we modify the basic (binary) context-tree weighting method such that the past symbols x1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source se...

an extended star is a tree which has only one vertex with degree larger than two. the -center problem in a graph  asks to find a subset  of the vertices of  of cardinality  such that the maximum weighted distances from  to all vertices is minimized. in this paper we consider the -center problem on the unweighted extended stars, and present some properties to find solution.

the objective of the present study was to compare the efficacy of conventional and extendedintramammary (imm) therapy of persistent subclinical mastitis in lactating dairy cattle using nafcillinpenicillin-dihydrostreptomycin combination (npd). sixty-five dairy cows with 126 infected quarters were enrolled in the study. infected cows were allocated randomly to 1 of 3 different treatment regimens...

Discriminative translation models utilizing source context have been shown to help statistical machine translation performance. We propose a novel extension of this work using target context information. Surprisingly, we show that this model can be efficiently integrated directly in the decoding process. Our approach scales to large training data sizes and results in consistent improvements in ...