Additive Hermitian idempotent preservers between operator algebras

Let L be an additive map between (real or complex) matrix algebras sending $n\times n$ Hermitian idempotent matrices to $m\times m$ Hermitian idempotent matrices. We show that there are nonnegative integers $p,q$ with $n(p+q)=r\le m$ and an $m\times m$ unitary matrix U such that$L(A)=U[(I_p?A)\oplus (I_q?A^t)\oplus 0_{m?r}]U^{?},\text{for any}n\times n\text{Hermitian}A\text{with rational trace}.$ We also extend this result to the (complex) von Neumann algebra setting, and provide a supplement to the Dye-Bunce-Wright Theorem asserting that every additive map of Hermitian idempotents extends to a Jordan ?-homomorphism.     

光码分多址系统中光学相关接收机判决阈值的分析

介绍了光码分多址系统中常用地址码（一维扩时码、二维码和三维码）的特点，并对它们各自的互相关均值和方差进行了理论分析。基于非相干光码分多址系统中光学相关接收机的基本原理，结合不同的用户地址码，对系统误码率性能进行了分析，得到了接收机最佳判决阈值与地址码基本特性参数和系统同时用户数间的关系。最后，给出了数值仿真结果。结果表明，对于采用特定地址码的光码分多址系统，只有选择合适的接收机判决阈值，系统的误码率性能才能达到最佳。研究结果对光码分多址系统中接收机判决阈值的选取具有一定的参考作用。     

Skew-Hermitian Triangular Splitting Iteration Methods for Non-Hermitian Positive Definite Linear Systems of Strong Skew-Hermitian Parts

By further generalizing the skew-symmetric triangular splitting iteration method studied by Krukier, Chikina and Belokon (Applied Numerical Mathematics, 41 (2002), pp. 89–105), in this paper, we present a new iteration scheme, called the modified skew-Hermitian triangular splitting iteration method, for solving the strongly non-Hermitian systems of linear equations with positive definite coefficient matrices. We discuss the convergence property and the optimal parameters of this new method in depth. Moreover, when it is applied to precondition the Krylov subspace methods like GMRES, the preconditioning property of the modified skew-Hermitian triangular splitting iteration is analyzed in detail. Numerical results show that, as both solver and preconditioner, the modified skew-Hermitian triangular splitting iteration method is very effective for solving large sparse positive definite systems of linear equations of strong skew-Hermitian parts.     

PACKING PAIRS BY QUINTUPLES:THE CASE OF ZERO CONGRUENCE MOD 4

ＰＡＣＫＩＮＧＰＡＩＲＳＢＹＱＵＩＮＴＵＰＬＥＳ：ＴＨＥＣＡＳＥＯＦＺＥＲＯＣＯＮＧＲＵＥＮＣＥＭＯＤ４ＹＩＮＪＩＡＮＸＩＮＧＡｂｓｔｒａｃｔ：ＬｅｔＤ（ｖ）ｄｅｎｏｔｅｔｈｅｍａｘｉｍｕｍｎｕｍｂｅｒｏｆｑｕｉｎｔｕｐｌｅｓｏｆａｖ－ｓｅｔｏｆｐｏ...     

Classification of Extremal Double Circulant Self-Dual Codes of Lengths 64 to 72

Recently extremal double circulant self-dual codes have been classified for lengths n ≤ 62. In this paper, a complete classification of extremal double circulant self-dual codes of lengths 64 to 72 is presented. Almost all of the extremal double circulant singly-even codes given have weight enumerators for which extremal codes were not previously known to exist.     

SWITRIM��������ƺ�ʹ�øſ�

研制出了用于计算氚投料量在FEB聚变堆各个子系统中的分布及其随时间变化的数值模拟程序包SWITRIM。通过近5年的使用，表明其运行良好、计算结果可靠。用SWITRIM数值模拟研究了聚变堆起动过程中的“氚坑深度和氚坑时间”新现象。简单介绍了SWITRIM程序包的组成和用户使用说明以及最新的运用等。     

Performance Enhancement for Optical Fast Frequency-hopping CDMA Systems by BCH Channel Coding

In this paper, the impact of optical beat noise on the performance of optical fast frequency-hopping code-division multiple-access (FFH OCDMA) networks is analyzed. BCH/FFH-OCDMA to reduce the impact of optical beat noise is proposed. It is shown that, BCH/FFH-OCDMA has much better performance under the same bit rate, same chip time and same number of available wavelengths. Another advantage for BCH/FFH-OCDMA is that the code length of one-coincidence sequence will be shorter, which can greatly reduce the difficulty of fabrication for fiber gratings.     

The largest strongly consecutive repeat-free code

Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]ⁿ.     

Submanifolds associated with graphs

In this paper we present an interesting relationship between graph theory and differential geometry by defining submanifolds of almost Hermitian manifolds associated with certain kinds of graphs. We show some results about the possibility of a graph being associated with a submanifold and we use them to characterize CR-submanifolds by means of trees. Finally, we characterize submanifolds associated with graphs in a four-dimensional almost Hermitian manifold.