证明了L∞John椭球体E∞K的连续性，并进一步证明了L∞John椭球体E∞K与经典John椭球体JK的连通性。

The continuity of L∞ John ellipsoid E∞ K is demonstrated in this paper. Furthermore,the connec-tion between the L∞ John ellipsoid E∞ K and the classical John ellipsoid is shown.

遗传算法GA(genetic algorithm)作为一种解决复杂问题的有效方法,是由美国密执安大学的John Holland教授于1975年首先提出来的,这种算法是以达尔文的生物进化论为启发而创建的,是基于生物进化中自然选择、适者生存和物种遗传思想的搜索算法。

Genetic algorithm (GA based algorithm), as a kind of effective method to solve complex problems, is by the university of Michigan professor John Holland in 1975, first of all, this algorithm is based on Darwinian evolution inspired, is based on natural selection, survival of the fittest in biological evolution and genetic search algorithm.

以John H. Schumann的文化适应模式为理论依据，对大理学院MBBS项目南亚留学生进行文化适应调查，并对调查的数据进行分析，以期阐释大理学院MBBS项目南亚留学生的文化适应对他们的汉语学习所产生的影响，并提出改善文化适应的建议。

Based on John H. Schumann''s acculturation model, this paper conducts a survey research of the acculturation of MBBS students from South Asia in Dali University. After analyzing the statistic data, this paper tries to explain the influence of the acculturation situation on MBBS students'' Chinese language learning in Dali University, and puts forward suggestions for improving the acculturation.

在锥约束非可微多目标优化问题Mond-Weir型高阶弱对偶定理的基础上,利用Fritz-John型必要条件,在没有任何约束品性条件下给出了逆对偶定理.最后,考虑了特殊情况,研究了单目标情况下对偶问题的逆对偶定理.

In this paper, based on the weak duality theorems of Mond-Weir type higher-order dual for nondiffer-entiable multiob jective problems with cone constraints, we derive converse duality theorems by using Fritz-John type necessary condition without any constraint qualifications. Finally, we consider the special case of the result, and establish converse duality theorem for single ob jective programming problem with con constraint.

主要研究了涉及重整化变换的一族有理函数 Tnλ Fatou 分支的拓扑性质。事实上，若 D 是有理函数Tnλ的任意1个 Fatou 分支，对任意的参数λ∈R 与 n 〉1，探讨了 D 与 John 区域的联系。所得结果给出了重整化变换的 Julia 集 J（Tnλ）拓扑复杂性的一个详细刻画。

The topological properties about the Fatou sets of a family of rational maps Tnλ concerning renormalization transformation are mainly studied. In fact,let D be any Fatou component of Tnλ the relations between the John do-main and D are investigated. Hence a perfect topological description of the Julia sets J(Tnλ)about the topological complexity is given.