We show that two irreducible operators on H are unitari1y equivalentif and only if W*(A B)’≌M2(C), and give an answer to the open question posedby J. B. Conway (Subnormal Operators, πPitman, Advanced Publishing Pro...We show that two irreducible operators on H are unitari1y equivalentif and only if W*(A B)’≌M2(C), and give an answer to the open question posedby J. B. Conway (Subnormal Operators, πPitman, Advanced Publishing Program,Boston, London, Melbourne, 1981) for irreducible operator. We also show that ifT, T1 and T2 are irreducible operators with T T1≌T T2, then T1≌T2. Finally,weshow that K0 (A(D))≌Z, giving a new result on the K0-group of Banach algebras.展开更多
为了有效地求解0-1背包问题,提出了改进探路者算法(IPFA)。首先,对种群个体进行二进制编码,把连续问题变为离散问题,然后,使用探路者算法进行寻优,并结合贪心修复与优化算法(greedy repair and optimization algorithm,GROA)修复不可行...为了有效地求解0-1背包问题,提出了改进探路者算法(IPFA)。首先,对种群个体进行二进制编码,把连续问题变为离散问题,然后,使用探路者算法进行寻优,并结合贪心修复与优化算法(greedy repair and optimization algorithm,GROA)修复不可行解和对解进行优化,通过变异策略来增加种群的多样性。仿真实验结果表明,提出算法比其他3个算法具有更好的全局寻优能力、更快的收敛速度和较强的稳定性。展开更多
基金The 973 Project of China and the NNSF (Grant No. 19631070) of China.
文摘We show that two irreducible operators on H are unitari1y equivalentif and only if W*(A B)’≌M2(C), and give an answer to the open question posedby J. B. Conway (Subnormal Operators, πPitman, Advanced Publishing Program,Boston, London, Melbourne, 1981) for irreducible operator. We also show that ifT, T1 and T2 are irreducible operators with T T1≌T T2, then T1≌T2. Finally,weshow that K0 (A(D))≌Z, giving a new result on the K0-group of Banach algebras.
文摘为了有效地求解0-1背包问题,提出了改进探路者算法(IPFA)。首先,对种群个体进行二进制编码,把连续问题变为离散问题,然后,使用探路者算法进行寻优,并结合贪心修复与优化算法(greedy repair and optimization algorithm,GROA)修复不可行解和对解进行优化,通过变异策略来增加种群的多样性。仿真实验结果表明,提出算法比其他3个算法具有更好的全局寻优能力、更快的收敛速度和较强的稳定性。
