远程公文传输解决方案

以黑龙江省审计厅办公自动化系统为背景,简要说明了公文远程传输的实现内容和方法。内容包括:公文远程传输对于建立办公自动化系统的重要意义;远程传输的功能需求;以及实现远程传输的基本方法。     

Stable marker-particle method for the Voronoi diagram in a flow field

The Voronoi diagram in a flow field is a tessellation of water surface into regions according to the nearest island in the sense of a “boat-sail distance”, which is a mathematical model of the shortest time for a boat to move from one point to another against the flow of water. The computation of the diagram is not easy, because the equi-distance curves have singularities. To overcome the difficulty, this paper derives a new system of equations that describes the motion of a particle along the shortest path starting at a given point on the boundary of an island, and thus gives a new variant of the marker-particle method. In the proposed method, each particle can be traced independently, and hence the computation can be done stably even though the equi-distance curves have singular points.     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

透镜初级球差的横向剪切干涉条纹研究

利用玻璃平行平板构成简单的横向剪切干涉仪可以观察到单薄透镜形成的准直光束的剪切干涉条纹,由干涉条纹分布求出对应的几何像差和离焦量.用焦距为190 mm的单薄透镜做实验,实验结果与计算机模拟结果符合,说明可以从剪切干涉条纹的分布求出透镜的轴向调整误差和初级球差.     

On the complexity of suboptimal decoding for list and decision feedback schemes

We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2^nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2^nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent.     

广义准正则格形码距离谱的计算

本文讨论了格形码距离谱的计算问题，定义了度量空间意义下的广义准正则格形码，对具有Ｉｍａｉ与Ｈｉｒａｋａｗａ［２］和Ｕｎｇｅｒｂｏｅｃｋ［３］定义的典型的时不变网格结构的广义准正则格形码，证明了其距离谱可用全零信息序列对应的码字进行计算。在理论上推广了Ｍ．Ｒｏｕａｎｃｅ与Ｄ．Ｊ．Ｃｏｓｔｅｌｏ的结果，解决了非平方欧几里德度量意义下一类ＴＣＭ信号序列的距离谱计算问题     

The minimum squared euclidean distance of multi-h phase codes

The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD should be as large as possible. The necessary and sufficient conditions of maximizing SSD are derived. Finally, SSD and the exact formulae for MSED of binary 2-h phase codes are also presented.     

关于图的直径和平均距离

图的直径和平均距离是度量网络有效性的两个重要参数．Ore通过图的顶点数和直径给出无向图的最大边数．Entringer，Jakson，Slater和Ng，Teh通过图的顶点数和边数分别给出无向图和有向图平均距离的下界．该文提供这两个结果的简单证明，给出有向图类似Ore的结果，并通过图的直径改进Entringer等人的结果到更一般的情形．结合本文和Ore的结果，可以得到一个无向图和有向图平均距离的下界，它比Plesnik得到的下界更好．     

基于参差距离的相位差变化值的解模糊方法研究

利用相位差及其变化率对辐射源进行定位是新近提出的一种快速单基无源定位方法。本文分析了利用相位干涉议得到的相位差变化值的相位模糊特点,提出了一种利用相位干涉仪的接收天线之间的参差距离对相位差变化值进行解模糊的方法,讨论了正确解模糊的条件和范围,并给出了仿真结果。