A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

张量广义特征值的S-型包含区域

设{A,B}为m阶n维正则张量对,通过将指标集N={1,2,…,n}划分为非空真子集S及其补集S珚=N/S,利用分类讨论的思想以及张量对{A,B}某些元素选取的任意性和不等式缩放技巧,解决了张量对{A,B}的特征值定位问题,并给出张量对{A,B}特征值的S-型包含区域.数值结果表明,所得包含区域比已有包含区域更精确.     

封闭式运动减肥对肥胖青少年体质健康的影响

对44名14～19岁肥胖青少年进行6周的封闭式饮食控制及运动,测定实验对象的身体形态、身体机能、身体素质和血液健康等指标.通过数理统计方法对实验所测得的数据进行分析.结果表明:肥胖青少年的脂肪量、体质量、体脂率都有明显的下降(P0.05);肺活量逐渐上升,身体素质指标(耐力、柔韧、50 m跑)与血液健康指标(血脂TC、甘油三酯TG、空腔胰岛素FINS)都呈非常明显改善(P0.01).封闭式运动减肥对青少年肥胖者体质健康具有良好的效能表现.     

具有sn-网的空间

证明了具有σ—点有限sn—网及σ—局部可数sn—网的空间可刻划为度量空间在某些确定映射下的象.     

顶凌覆盖节水增产技术研究

通过1998年、2000年的试验研究，系统分析了顶凌覆盖技术在高寒区节水增温保温、增产增收的机理及其应用效果。提出该技术可以缓解低温干旱特别是春旱对农业生产的困扰，是一项可以抗旱保春播增产增收的实用技术，在高寒地区具有较高的推广价值。     

Clifford分析中无界域上正则函数的边值问题

在引入修正Cauchy核的基础上,讨论了无界域上正则函数的带共轭值的边值问题：a(t)Φ (t) b(t)Φ (t) c(t)Φ-(t) d(t)Φ=g(t)．首先给出了无界域上正则函数的Plemelj公式,然后利用积分方程方法和压缩不动点原理证明了问题解的存在唯一性．     

Products of mixed covering arrays of strength two

A covering array CA(N;t,k, v is an N × k array such that every N × t subarray contains all t‐tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006     

具有某种断面的半群的研究进展

本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后，概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面，纯正断面，正则^*－断面和恰当断面。提出了可以进一步研究的重要的问题。     

Banach空间中渐近正则半群的不动点定理

设X是p一致凸Banach空间,具有弱一致正规结构与非严格的Opial性质.又设C是X的非空凸弱紧子集.在适当的条件下,证明了C上每个渐近正则半群T={T(t):t∈S}都有不动点进一步,在类似的条件下,也讨论了一致凸Banach空间中渐近正则半群的不动点的存在性.