k元船方体网络的可靠性

[k]元[n]方体[Qkn]是设计大规模多处理机系统时最常用的互连网络拓扑结构之一。对于[1≤m≤n-1],设[F]是[Qkn]中的一个由非空点集[VF]和非空边集[EF]构成的故障集,满足[Qkn-F]中不存在[Qkn-m]且[VF]破坏的[Qkn-m]的集合与[EF]破坏的[Qkn-m]的集合互不包含。设[f＊（n,m）]是破坏[Qkn]中的所有子立方[Qkn-m]所需要的故障集[F]的最小基数。证明了对于奇数[k≥3],[fk（n,1）]为[k＋1],[fk（n,n-1）]为[kn-1-1＋n],[f＊（n,m）]的上下界分别为[Cm-1n-1km＋Cm-1n-2km-1]和[km]。举例说明了上界[Cm-1n-1km＋Cm-1n-2km-1]是最优的。     

环[F2+uF2+vF2]上的[(1+v)-]常循环码

研究了环[R=F2+uF2+vF2] 上的[(1+v)-]常循环码。利用环[R]上奇长循环码的生成元来刻画环[R]上奇长的[(1+v)-]常循环码,进而给出了[Rn]到[(F2+uF2)2n]的一个广义Gray映射[φ],证明了环[R]上的[(1+v)-]常循环码[C]在[φ]下的广义Gray像[φ(C)]是环[F2+uF2]上的循环码。     

Evaluation of metabolism from heart rate in industrial work

Oxygen consumption ([Vdot]O₂) and heart rate (HR) were measured in 40 men performing different types of industrial work in eight factories

A [Vdot]O₂-HR relationship was established for each subject using an exercise test on a bicycle ergometer. HR measured during the industrial work was entered in the [Vdot]O₂-HR function, and [Vdot]O₂ thus calculated. A systematic comparison of the calculated [Vdot]O₂ (c[Vdot]O₂) with the actual measured [Vdot]O₂ (m[Vdot]O₂), showed that c[Vdot]O₂ significantly overestimated the [Vdot]O₂ during industrial work. The degree of overestimation was related to the type of work performed. The static muscular activity and the non-steady-state characteristics of the work were responsible for most of the overestimation

A more reliable technique for estimating metabolic rate is to make simultaneous measurements of [Vdot]O₂ and HR at different times during the work day and then from these recordings establish a function: [Vdot]O₂=f(HR). Continuous HR recordings can then be used to calculate a more accurate estimate of the metabolic rate.     

位平面和SIFT相结合的图像匹配方法

针对传统的相关匹配算法计算量大,对图像旋转敏感等问题,提出了一种位平面和尺度不变特征变换（SIFT）相结合的图像匹配算法。将待拼接的两幅图像[A、][B]各自分解为8个位平面,对两幅图像都选择前4个具有视觉信息的位平面[A1A2A3A4]和[B1B2B3B4];对[A1A2、][A2A3、][A3A4]图像进行异或运算,得到3幅图像。由于异或后的图像[A1A2]具有足够的细节部分,轮廓却不清晰,图像[A3A4]轮廓清晰,但是丢失了太多细节,而图像[A2A3]具有清晰的轮廓,又具有足够的细节信息,所以采用图像[A2A3],然后与原图像[A]进行异或得到[A],同时采用同样的方法得到图像[B],再次采用SIFT算法进行点对匹配,利用欧氏距离进行图像匹配,最后利用RANSAC进行图像容错处理,得到一幅匹配图像。实验结果表明,该算法有效地提高了匹配速度,对图像明暗变化、尺度旋转等具有较强的健壮性。     

Global Convergence of a Class of Collinear Scaling Algorithms with Inexact Line Searches on Convex Functions

Ariyawansa [2] has presented a class of collinear scaling algorithms for unconstrained minimization. A certain family of algorithms contained in this class may be considered as an extension of quasi-Newton methods with the Broyden family [11] of approximants of the objective function Hessian. Byrd, Nocedal and Yuan [7] have shown that all members except the DFP [11] method of the Broyden convex family of quasi-Newton methods with Armijo [1] and Goldstein [12] line search termination criteria are globally and q-superlinearly convergent on uniformly convex functions. Extension of this result to the above class of collinear scaling algorithms of Ariyawansa [2] has been impossible because line search termination criteria for collinear scaling algorithms were not known until recently. Ariyawansa [4] has recently proposed such line search termination criteria. In this paper, we prove an analogue of the result of Byrd, Nocedal and Yuan [7] for the family of collinear scaling algorithms of Ariyawansa [2] with the line search termination criteria of Ariyawansa [4]. Received: May 8, 1996; revised January 27, 1999     

时域鲁棒设计的新方法──［P］和［V］·［V~－1］的极小化

本文讨论在极点配置的约束下，使［Ｐ］和［Ｖ］·［Ｖ－１］（条件数）极小化的问题，其中Ｐ是（Ａ＋ＢＦ）＇Ｐ＋Ｐ（Ａ＋ＢＦ）＝－２Ｉｎ的工定解，Ｖ是Ａ＋ＢＦ的特征向量矩阵．两种指标都反映了系统鲁棒稳定的程度．通过定义一矩阵函数并引入新的自由变量Ｕ，可放松极点配置的约束，并能系统的推导［Ｐ］／Ｕ及（［Ｖ］·［Ｖ－１］）／Ｕ，从而将鲁棒设计转化为无约束的梯度法寻优，实例说明，本文设计方法的效果很好．     

联图[K1,1,3∨Cn]的交叉数

联图[G∨H]表示将[G]的每个顶点与[H]的每个顶点连边得到的图。在Klesc给出的联图[K1,1,2∨Cn]的交叉数为[Z(4,n)+n2+3]的基础上,根据联图的相关性质,运用反证法和排除法,得到了联图[K1,1,3∨Cn]与[{K1,1,3+e}∨Cn]的交叉数均为[Z(5,n)+n+n2+4]。并假设在Zarankiewicz猜想成立的前提下,提出对[K1,1,m∨Cn(m≥4)]的交叉数的一个猜想：[cr?(K1,1,m∨Cn)≥Z(m+2,n)+m+12m2n2+m2m-12n2+][m+1,m≥4]。     

PT-对称中量子态的区分

量子态的区分问题在量子信息技术中有许多重要应用。在量子力学中,两个态[ψ1]和[ψ2]可区分当且仅当它们正交,在[PT]量子理论的背景下考虑态的可区分性问题,基于一个非自伴但[PT-]对称的Hamiltonian量能够构造一个所在Hilbert空间的新内积的方法,给出了[ψ1]与[ψ2]可区分的刻画。通过例子对这个问题进行了详细讨论。     

外1-平面图的均匀边染色

图[G]的[s]-均匀边[k]-染色是指用[k]种颜色对图的边进行染色,使得图[G]的每个顶点所关联的任何两种颜色的边的条数至多相差[s]。使得对于每个不小于[k]的整数[t],图[G]都具有[s]-均匀边[t]-染色的最小整数[k]称为图[G]的[s]-均匀边色数阈值。文中证明了外1-平面图的1-均匀边色数阈值最多为5,不含有相邻的3圈的外1-平面图的均匀边色数阈值最多为4,外1-平面图的2-均匀边色数阈值恰好为1。     

环Fp+uFp+vFp上的(1+u+v)-循环码

常循环码是一类重要的线性码,由于其纠错性能易于分析,因而广泛应用于实践中,同时,利用有限环上常循环码还可以直接构造最优线性码。定义了有限非链环[Fp+uFp+vFp]上[(1+u+v)]-循环码的相关概念,讨论了其生成多项式;引入了一种新的Gray映射[?],证明了该环上[(1+u+v)]-循环码在此Gray映射[?]下的[p]元象是一个长为[2pn]的2-准循环码,并由此构造出了两个最优二元准循环码。     

时域鲁棒设计的新方法——σ[P]和σ[V]·σ[V-1]的极小化

本文讨论在极点配置的约束下,使σ[P]和σ[V]·σ[V-1](条件数)极小化的问题,其 中P是(A+BF)'P+P(A+BF)=-21n的正定解,V是A+BF的特征向量矩阵.两 种指标都反映了系统鲁棒稳定的程度.通过定义一矩阵函数并引入新的自由变量U,可放松 极点配置的约束,并能系统的推导σ2[P]/U及(σ2[V]·σ2[V-1])/U,从而将鲁棒设计 转化为无约束的梯度法寻优,实例说明,本文设计方法的效果很好.     

Numerical aspects of the generalized CG-method applied to least squares problems

The Generalized Conjugate Gradient (GCG) method of Concus and Golub [1] and Widlund [2] and its adjusted form (AGCG) are considered for the numerical solution of the least squares problems. Some numerical comparisons with the SOR [3] and CG [4] method are also given indicate that the GCG method is always better than the SOR [3] and that the adjusted GCG (AGCG) scheme is preferable to the CG, GCG and SOR methods.     

一种新的L1度量Fisher线性判别分析研究

Fisher线性判别分析（Fisher Linear Discriminant Analysis,FLDA）是一种典型的监督型特征提取方法,旨在最大化Fisher准则,寻求最优投影矩阵。在标准Fisher准则中,涉及到的度量为[L2]范数度量,此度量通常缺乏鲁棒性,对异常值点较敏感。为提高鲁棒性,引入了一种基于[L1]范数度量的FLDA及其优化求解算法。实验结果表明：在很多情形下,相比于传统的[L2]范数FLDA,[L1]范数FLDA具有更好的分类精度和鲁棒性。     

On partial realization

It is shown that the partial realization problem treated by Kalman [1] and Tether [2] can be solved in a simple way using the method of [3] instead of Ho's algorithm.     

任意分布数据的基数分配链接排序算法

文中将映射链接思想引入了基数排序,提出了一种谓之基数分配链接的新排序方法（以下简称为“基数分配链接排序”）,给出了该排序算法的描述、时间复杂度分析及用Ｃ语言编写程序进行算法比较的实验结果,算法分析和实验结果都表明：基数分配链接排序方法和待排序数据分布无关,其时间复杂度为Ｏ（Ｎ）,并且排序速度明显优于Ｑｕｉｃｋ Ｓｏｒｔ＾［１］,Ｆｌａｓｈ Ｓｏｒｔ＾［１］,Ｐｒｏｐｏｒｔｉｏｎ Ｓｐｌｉｔ Ｓｏｒ     

Further comments on "Application of 0-1 integer programming to multitarget tracking problems"

The 0-1 integer programming formulation of the multitarget tracking problem reported in [1] is claimed in [2] to be inappropriate without additional assumptions. This disparity is resolved, showing that the formulation in [1] is correct as it stands.     

MV代数的子代数及相关重言式之间的关系

对MV单位区间[[0,1]]和n-值MV代数[Ln]的子代数的结构问题及其上重言式之间的关系进行了较为细致的研究。主要结论是：如果MV单位区间[[0,1]]的子代数[M]同构于n-值MV代数[Ln]的子代数,那么,存在正整数[m]满足[(m-1)|(n-1)]使得[M=Lm];如果[M]是MV单位区间[[0,1]]的子代数,那么或[M]为有限MV代数[Ln],或[M]为区间[[0,1]]上包含[{0,1}]的稠密集;若正整数[n-1]可分解为[(m1-1)(m2-1)?(mt-1)],其中[m1-1,m2-1,?,mt-1]是两两互素的正整数,则[Ln]是[Lm1,Lm2,?,Lmt]生成的MV代数;[T([0,1])=n=2∞T(Ln)],其中[T(M)]表示MV代数[M]上全体重言式之集合。     

含离子液体体系的二元液液相平衡的计算

离子液体是许多领域中逐渐推广的绿色溶剂。鉴于离子液体在双相化学和工业萃取过程中的应用,对含离子液体体系的液液相平衡的研究,将有利于科研和生产。本文以文献中提供的未进行过数据关联的含[Et3NH][Al2Cl7]、[Emim] [NTf2]、[Bmim][PF6]、[Penmim][PF6]、[Hxmim][PF6]、[Hptmim][PF6]、[Omim][PF6]等7种离子液体与苯(C6C6),三氯化磷(PCl3),正丙醇(C3H7OH),正丁醇(C4H9OH),正戊醇(C5H11OH)等组成的10个二元系的溶解度数据为基础,应用NRTL和UNIQUAC活度系数模型进行了关联计算,得到了相应的模型参数。通过比较计算值与实验值,结果令人满意,NRTL和UNIQUAC方程计算得到的10个体系的全体平均误差(AAD,Overall-average deviation)的平均值分别为3．228％和2．691％。同时,在应用NRTL和UNIQUAC活度系数模型对含离子液体的二元体系作相平衡数据的关联的时候,首次将相互作用参数由常用的对温度的线性函数关系改进为对温度的双曲线型函数关系,从而显著地提高了对上部会溶点计算的准确性。     

BMH2C单模匹配算法的研究与改进

BMH2C算法综合BMH和BMHS算法,利用当前窗口字符t[k]及其下一字符t[k+1]组成的双字符串来决定模式串右移量,具有比BM算法、BMH算法、BMHS算法更优的性能。但对于双字符串在模式串中出现一次及以上的情况。BMH2C算法中的模式串右移量仍有待进一步增大,从而减少当前窗口右移次数,提高BMH2C算法的匹配效率。为此,在BMH2C算法的基础上提出一种改进算法,该算法考虑双字符串舭t[k]t[k+1]在模式串中出现的次数,以及该双字符串在模式串中对应位置的后继字符与字符t[k+2]的相等关系。改进算法利用2个右移数组和1个模式串预处理数组,在匹配过程中通过判断字符t[k+2]与模式串预处理数组中相应字符是否相等,从而选择2个右移数组之一的对应值作为当前窗口的右移量。实验结果显示,在相同条件下,对于当前窗口移动次数和匹配所耗时间,BMH2C改进算法比BMH2C算法分别平均减少11.33%和9.40%,有效提高了匹配效率。     

The stability of long action chains in XCS

 XCS [1, 2] represents a new form of learning classifier system [3] that uses accuracy as a means of guiding fitness for selection within a Genetic Algorithm. The combination of accuracy-based selection and a dynamic niche-based deletion mechanism achieve a long sought-after goal–the reliable production, maintenance, and proliferation of the sub-population of optimally general accurate classifiers that map the problem domain [4]. Wilson [2] and Lanzi [5, 6] have demonstrated the applicability of XCS to the identification of the optimal action-chain leading to the optimum trade-off between reward distance and magnitude. However, Lanzi [6] also demonstrated that XCS has difficulty in finding an optimal solution to the long action-chain environment Woods-14 [7]. Whilst these findings have shed some light on the ability of XCS to form long action-chains, they have not provided a systematic and, above all, controlled investigation of the limits of XCS learning within multiple-step environments. In this investigation a set of confounding variables in such problems are identified. These are controlled using carefully constructed FSW environments [8, 9] of increasing length. Whilst investigations demonstrate that XCS is able to establish the optimal sub-population [O] [4] when generalisation is not used, it is shown that the introduction of generalisation introduces low bounds on the length of action-chains that can be identified and chosen between to find the optimal pathway. Where these bounds are reached a form of over-generalisation caused by the formation of dominant classifiers can occur. This form is further investigated and the Domination Hypothesis introduced to explain its formation and preservation.