利用有限域上的向量空间构作带仲裁的认证码

This paper is devoted to constructing an authentication code with arbitration using subspaces of vector spaces over finite fields.Moreover,if we choose the encoding rules of the transmitter and the decoding rules of the receiver according to a uniform probability distribution,then some parameters and the probabilities of successful attacks are computed.     

Empirical and DFT GIAO quantum‐mechanical methods of 13C chemical shifts prediction: competitors or collaborators?

The accuracy of ¹³C chemical shift prediction by both DFT GIAO quantum‐mechanical (QM) and empirical methods was compared using 205 structures for which experimental and QM‐calculated chemical shifts were published in the literature. For these structures, ¹³C chemical shifts were calculated using HOSE code and neural network (NN) algorithms developed within our laboratory. In total, 2531 chemical shifts were analyzed and statistically processed. It has been shown that, in general, QM methods are capable of providing similar but inferior accuracy to the empirical approaches, but quite frequently they give larger mean average error values. For the structural set examined in this work, the following mean absolute errors (MAEs) were found: MAE(HOSE) = 1.58 ppm, MAE(NN) = 1.91 ppm and MAE(QM) = 3.29 ppm. A strategy of combined application of both the empirical and DFT GIAO approaches is suggested. The strategy could provide a synergistic effect if the advantages intrinsic to each method are exploited. Copyright © 2010 John Wiley & Sons, Ltd.     

Finding dominators via disjoint set union

The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a “static tree” disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in many kinds of global code optimization) and that can be made self-certifying, so that the correctness of the computed dominators is very easy to verify.     

矢量合成移相器

描述一种可靠性、价格、能耗和体积诸方面都优于机械相位调节器的新型电控移相器，它的工作原理基于矢量合成，故定名为矢量合成移相器。并已在兰州重离子加速器相位稳定系统０号、４号、６号机柜中代替机械相位调节器，取得了令人满意的结果。     

基于无消相干子空间的量子避错码设计

针对量子系统的联合消相干模型,可以找到一些不受消相干错误影响的系统状态,这种状态被称为相干保持态,所有相干保持态构成的空间就称为无消相干子空间(decoherencefreesubspace,缩写为DFS).利用DFS的特性可以实现自动容错的量子避错码.首先提出一种DFS的定义,并且以定理的形式证明其他DFS的定义都是等价的.然后给出了DFS的存在性定理.最后利用群论的方法设计一种构造DFS的简单方法 关键词： 相干保持态 无消相干子空间 量子避错码 容错量子计算     

近垒能区6Li+208Pb熔合激发函数测量

测量了6Li+208Pb熔合反应近垒能区全熔合截面,并与考虑非弹道耦合和不考虑耦合的CCFUS程序计算做了比较. 结果表明在垒上能区,破裂使熔合截面减小,在垒下能区,破裂对熔合截面的影响基本上可以忽略.     

从符号学出发的城市家具设计

本文从符号学的角度来分析城市家具的设计，是对设计如何满足现代社会发展需求的探索，从功能到符号，从符号到设计，设计不再是绘画的附属，而是建立符号系统的过程．     

关于自正交的整表代数码

整表代数是群代数的推广，它的理想是群代数码的推广．本文给出了整表代数的单边理想是自正交理想的必要充分条件．     

A Lower Bound on the Greedy Weights of Product Codes

A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e _r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes.