组合的分组测试算法的近似控制标准

对于给定的一个集合,分组测试问题是通过一系列的测试去确定这个集合的一个子集. 在文中, 作者首先运用动态规划的理论与方法, 建立了一个近似控制标准, 目的是对分组测试算法的构建过程进行有效控制, 使所构建的算法达到最优. 其次, 应用该近似控制标准研究了在n个硬币集合中确定一个伪硬币的最小平均测试数的问题. 文中所涉及的近似控制问题, 给出了在一个给定集合中去确定这个集合的一个子集的最优分组测试算法, 该最优分组测试算法是在平均测试步骤最少意义下的最优分组测试算法.     

免疫算法在车辆调度问题中的应用

免疫算法是模仿生物体高度进化、复杂的免疫系统仿生的一种智能化启发式算法。本文根据车辆调度问题的具体情况，应用免疫算法解决车辆调度中路线安排问题，并提出了一种基于分组匹配的亲和力的计算方法。实验结果表明，免疫算法能有效地应用于车辆调度中路线安排问题。     

关于三个相同伪硬币问题的一些新结果

本文中,给定一台比较型测试装置和确切的三个相同伪硬币出现的信息,作者研究最小测试数的探求问题,这个最小测试数能从λ个有同样外观的硬币组成的集合中鉴别出三个相同的伪硬币,这里λ≥4.作者构造了对于无限多个λ值的一个最优鉴别分组测试算法,这个最优鉴别分组测试算法改进了To（s）ic的对于无限多个λ值的一个最优鉴别分组测试算法,也改进了Bo（s）njak的对于无限多个λ值的一个最优鉴别分组测试算法.作者还提出另一个鉴别分组测试算法,并且猜想这个算法是最优的.     

n阶仿射平面上d-disjunct矩阵的讨论

分组测试的NGT算法在许多领域有着广泛的应用,它的数学模型是d-disjunct矩阵.近年来,人们借助于复形理论、图理论、空间理论和容错估算等来研究它.介绍了分组测试和仿射平面的基本知识,在n阶仿射平面上构作了d-disjunct矩阵,证明了它的一些性质,与n阶射影平面上的d-disjunct矩阵作了比较.     

基于支配强度的NSGA Ⅱ改进算法在研究生招生面试分组中的应用

针对研究生招生面试分组这一NP难问题,提出了一种以分组遗传算法(GGA)和基于支配强度的改进NSGA Ⅱ算法为基础的混合多目标分组遗传算法。通过基于矩阵编码的多交叉/多变异算子、次精英化的初始化种群策略以及改进的帕累托支配关系,解决了经典NSGA Ⅱ算法在该问题中的收敛速度慢、易陷入局部最优的问题。仿真实验结果表明,该方法只需进行较少代数(不超过100代)的进化,即可获得最优解集,满足了快速分组的用户偏好。     

分组数据下线性回归模型的参数估计

讨论了分组数据下线性回归模型参数的MLE的存在、唯一性.通过EM算法获得MLE的近似解.通过SEM算法获得MLE的渐近协方差阵.     

变环境情形下Weibull分布分组数据的参数估计

本文研究了变环境情形下Weibull分布分组数据可靠性估计的参数估计问题。给出一种基于EM算法的变环境分组数据Weibull分布参数估计方法,所得估计量具有良好的收敛性,模拟结果表明方法的实践可用性。     

用逐次最小权值轮询算法实现公平和低时延分组调度

分组调度算法是路由交换设备性能的重要保证,对基于轮询的分组调度进行了研究,提出了一种新的调度算法称为逐次最小权值轮询调度算法(successive minimal-weight round robin,SMRR),在每个轮次中为每个活动数据流提供与本轮次中的最小权值相当的服务机会.根据Latency-Rate(LR)Servers理论,证明了SMRR算法和WRR算法的时延上界,并对SMRR算法的公平性和实现复杂性进行了讨论,理论推导和性能分析表明SMRR算法具有比WRR算法更好的时延特性和公平性,同时具有O(1)的时间复杂度,具有良好的可扩展性.     

一类边界耦合的扩散系统爆破现象的数值模拟

对一类边界上非平凡耦合的抛物型系统进行了数值模拟．为验证已有的关于是否出现爆破的理论成果,先用固定网格算法针对四种具体的边界条件进行试验,并根据不同的初始数据分组．为了进一步探讨爆破发生的时刻、位置以及爆破速率,再用移动网格算法针对可能出现爆破现象的两组边界条件和初始数据进行试验,并根据不同的监测函数分组．随后对算法的有效性做出说明并分析试验结果．最后对系统的一种特殊情况给出一个算例．     

求解车辆路径问题的免疫算法

将免疫算法用于求解车辆路径问题,并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法.实验结果表明,免疫算法能有效地应用于车辆路径问题.     

关于弱半可根群

In this paper, we prove that if a torsion nilpotent group G is a weak semi-radicable group, then every Sylow p-group Gp is a central-by-finite p-group, and moreover Gp's center ζ(GP) satisfies |ζ(GP) : (ζ(GP))P| <∞, that is, ζ(GP) = D×F, where D is a divisible Abelian group, and F is a finite Abelian group.     

Tychonoff property for linear groups

A criterion for a wide class of topological groups which includes linear discrete groups and Lie groups to be Tychonoff groups is established. The main result provides a criterion for an almost polycyclic group to have the Tychonoff property. By the well-known Tits alternative, this yields the required criterion for linear discrete groups. In conclusion it is pointed out that a particular case of the presented proof yields a Tychonoff property criterion for Lie groups. In addition, an example of a polycyclic group without Tychonoff subgroups of finite index is constructed. Translated fromMatematicheskie Zametki, Vol. 63, No. 2, pp. 269–279, February, 1998. The author wishes to express his gratitude to R. I. Grigorchuk for setting the problem and his interest in the work. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00182 and by the American Mathematical Society Fund.     

Torsion-free constructive nilpotent <Emphasis Type="Italic">R</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-groups

We consider a torsion-free nilpotent R _p -group, the p-rank of whose quotient by the commutant is equal to 1 and either the rank of the center by the commutant is infinite or the rank of the group by the commutant is finite. We prove that the group is constructivizable if and only if it is isomorphic to the central extension of some divisible torsion-free constructive abelian group by some torsion-free constructive abelian R _p -group with a computably enumerable basis and a computable system of commutators. We obtain similar criteria for groups of that type as well as divisible groups to be positively defined. We also obtain sufficient conditions for the constructivizability of positively defined groups.     

Spectra of finite linear and unitary groups

The spectrum of a finite group is the set of its element orders. An arithmetic criterion determining whether a given natural number belongs to a spectrum of a given group is furnished for all finite special, projective general, and projective special linear and unitary groups. Supported by RFBR (grant Nos. 08-01-00322 and 06-01-39001) and by the Council for Grants (under RF President) and State Aid of Leading Scientific Schools (project NSh-344.2008.1). __________ Translated from Algebra i Logika, Vol. 47, No. 2, pp. 157–173, March–April, 2008.     

Classes of abelian groups related to sequential convergence

We study classes of abelian groups related to sequential com¬pactness and its generalizations (completeness, coarseness and sequential pre-compactness) in convergence groups. In particular, we describe the algebraic structure of the abelian groups on which every coarse convergence is complete and we prove that: i) every abelian group admits a sequentially precompact convergence; ii) every algebraically compact abelian group admits a sequen¬tially compact convergence.     

Periodic groups saturated by finite simple groups <Emphasis Type="Italic">U</Emphasis><Subscript>3</Subscript>(2<Superscript>m</Superscript>)

Let {ie166-01} be a set of finite groups. A group G is said to be saturated by the groups in {ie166-02} if every finite subgroup of G is contained in a subgroup isomorphic to a member of {ie166-03}. It is proved that a periodic group G saturated by groups in a set {U₃(2^m) | m = 1, 2, …} is isomorphic to U₃(Q) for some locally finite field Q of characteristic 2; in particular, G is locally finite. __________ Translated from Algebra i Logika, Vol. 47, No. 3, pp. 288–306, May–June, 2008.     

关于多克托罗夫定理

本文将多克托罗夫定理的条件减弱，得到了这样的定理：设Ｇ是有限群．如果Ｇ的每个西洛子群的正规化子有Ｈａｉｌ补，则Ｇ为σ－西洛塔解；此外，如果这些补的Ｆｉｔｔｉｎｇ子群是循环群，则Ｇ为超可解群．     

On the Structure of the Units of Group Algebra of Dihedral Group

In this paper, we completely determine the structure of the unit group of the group algebra of some dihedral groups D2 n over the finite field Fpk, where p is a prime.     

On Complemented Subgroups of Finite Groups

51. IntroductionIt is quite clear that the ekistence of complements for some families of subgroups of agroup gives a lot ofinfor~ion about its structure. FOr instance, Hall[6] proved that a groupG is supersoluble with elementary abelian Sylow subgroups if and only if G is complemellted,that is, every subgroup of G is comPlemeded in G. The same anchor also proved that agroup is soluble if and only if every Sylow subgroup is complemellted (see [3;I,3.5]). Morerecelltly, Arad and Wardll] pro…     

利用二阶上三角矩阵构造各类非交换的序群

利用二阶上三角矩阵分别构造了非交换的序群、拟序群、拟偏序群和拟格序群.