On the role of kinesthetic thinking in computational geometry

Computational geometry is a new (about 30 years) and rapidly growing branch of knowledge in computer science that deals with the analysis and design of algorithms for solving geometric problems. These problems typically arise in computer graphics, image processing, computer vision, robotics, manufacturing, knot theory, polymer physics and molecular biology. Since its inception many of the algorithms proposed for solving geometric problems, published in the literature, have been found to be incorrect. These incorrect algorithms rather than being ‘purely mathematical’ often contain a strong kinesthetic component. This paper explores the relationship between computational geometric thinking and kinesthetic thinking, the effect of the latter on the correctness and efficiency of the resulting algorithms, and their implications for education.     

Finitely Presented Functors and Degenerations#

Given two d-dimensional Λ-modules M and N, then M degenerates to N if and only if there exists an exact sequence of the form 0→ U→ U ⊕ M→ N→ 0 for some U ? mod Λ (Zwara, 1998 Zwara , G. ( 1998 ). A degeneration-like order for modules . Arch. Math. 71 : 437 – 444 . [CSA] [CROSSREF]  [Google Scholar]). Having this as a starting point, in this article we give a characterization of degenerations by the existence of a certain finitely presented functor. This gives new information about U in the sequence above. We show how this new information can be used to prove that M   _deg N even when M ⊕ X ≤  _deg N ⊕ X for some X for modules over Λ _q  = k〈 x,y〉/〈 x ²,y ²,xy + qyx〉, q ≠ 0 in k, where k is an algebraically closed field.     

A large closed queueing network with autonomous service and bottleneck

This paper studies the queue-length process in a closed Jackson-type queueing network with the large number N of homogeneous customers by methods of the theory of martingales and by the up- and down-crossing method. The network considered here consists of a central node (hub), being an infinite-server queueing system with exponentially distributed service times, and k single-server satellite stations (nodes) with generally distributed service times with rates depending on the value N. The service mechanism of these k satellite stations is autonomous, i.e., every satellite server j serves the customers only at random instants that form a strictly stationary and ergodic sequence of random variables. Assuming that the first k-1 satellite stations operate in light usage regime the paper considers the cases where the kth satellite station is a bottleneck node. The approach of the paper is based both on development of the method from the paper by Kogan and Liptser [16], where a Markovian version of this model has been studied, and on development of the up- and down-crossing method. This revised version was published online in June 2006 with corrections to the Cover Date.     

Borel Subalgebras Redux with Examples from Algebraic and Quantum Groups

Both building upon and revising previous literature, this paper formulates the general notion of a Borel subalgebra B of a quasi-hereditary algebra A. We present various general constructions of Borel subalgebras, establish a triangular factorization of A, and relate the concept to graded Kazhdan–Lusztig theories in the sense of Cline et al. (Tôhoku Math. J. 45 (1993), 511–534). Various interesting types of Borel subalgebras arise naturally in different contexts. For example, `excellent" Borel subalgebras come about by abstracting the theory of Schubert varieties. Numerous examples from algebraic groups, q-Schur algebras, and quantum groups are considered in detail.     

On critical values of numerical parameters characterizing intersections of embedded sets

To study intersections of embedded bounded closed sets in Banach space, a numerical parameter was introduced earlier; in a certain sense, this parameter describes the deviation of the shape of a set from that of a sphere. Critical values of this parameter for some classes of Banach spaces are determined, a new numerical parameter serving the same purpose is introduced, and the relation between the two parameters is examined. Translated fromMatematicheskie Zametki, Vol. 68, No. 2, pp. 303–310, August, 2000.     

Fan-Ha截口定理的改进及其应用

本文首先证明Ｆａｎ－Ｈａ截口定理的一个改进形式和一些相应的等价形式;其 次作为应用,我们得到一个极大极小定理、一些重合定理和一个极大元定理．     

一种基于物体质心的图像自动化校准方法

图像校准是将任意相邻两图像都具有公共部分的一列图像合成一副全图的图像处理过程.而图像自动化校准的难点在于对一组图像公共部分特征信息的提取和自动匹配,尤其是自动匹配和图像校准的误差分析.本文基于放射变换不变性,给出了一种基于特征信息质心的自动匹配方法,与目前国际上主流特征提取和特征校准方法相比,本文方法较准确,且适用于卫星图片及一些MRI和CT 图片.本文方法的另一优点是具有线性计算复杂度.