读取数据库的DBF文件通用算法分析

本文分析了ＤＢＦ文件的结构，讨论了真实记录和虚拟记录的关系，给出了记录长度和文件结构说明长度之间的数学表达式，按这种算法编写的程序具有通用性。     

An Improved S-Random Interleaver Design for Turbo Code Based on Chaos Model

A new method to design interleaver based on Henon chaos model is presented. The designed interleaver is with rather random behavior. Experimental results show that the proposed S-henon interleaver make a magnitude of im provement in bit error rate （BER） performance by 0.4 dB compared with the S-random interleaver for AWGN channel respectively. The S-henon interleaver may be adapted to 3G mobile communication systems.     

关于循环阵列码

本文用代数观点来研究循环阵列码,证明了一般的阵列码是一些极小循环阵列码的直和,并且对极小循环阵列码给出了明确的刻画．当有限域的特征不整除群的阶时,给出了直接写出相应的多项式环的本原幂等元的方法,从而可以直接写出所有的极小循环码．     

非语言代码在英语课堂教学中的应用

非语言代码是一种非文字语言交际手段,是交际者运用身体的自然特征和本能向对方输送信息、表达思想、传递文化的语言代码之外的一切表现形式.非语言代码在课堂教学中起着不可替代的作用.     

Codes Over the p-adic Integers

We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4).     

On Intersection Problem for Perfect Binary Codes

The main result is that to any even integer q in the interval 0 ≤ q ≤ 2^{n+1-2log(n+1)}, there are two perfect codes C₁ and C₂ of length n = 2^m − 1, m ≥ 4, such that |C₁ ∩ C₂| = q.     

Bounds on Codes Derived by Counting Components in Varshamov Graphs

We are interested in improving the Varshamov bound for finite values of length n and minimum distance d. We employ a counting lemma to this end which we find particularly useful in relation to Varshamov graphs. Since a Varshamov graph consists of components corresponding to low weight vectors in the cosets of a code it is a useful tool when trying to improve the estimates involved in the Varshamov bound. We consider how the graph can be iteratively constructed and using our observations are able to achieve a reduction in the over-counting which occurs. This tightens the lower bound for any choice of parameters n, k, d or q and is not dependent on information such as the weight distribution of a code. This work is taken from the author’s thesis [10]     

软土地基上桩-土-高层结构体系动力特性的振动台试验

为了研究软土地基上桩?土相互作用对高层结构动力特性的影响机理,设计了1：6比例的高层结构?桩?土动力相互作用体系,进行了软土地基上框架结构的模型振动台试验。试验采用层状剪切盒模拟土体的边界,锯末和砂土的混合物作为地基土、以12层钢筋混凝土框架结构模拟上部结构,基础采用3×3群桩基础。通过对比考虑土?结构相互作用（SSI）框架模型和刚性地基框架模型的结构动力特性,总结出本试验中SSI效应对高层框架结构的动力特性影响规律：土体对地震动存在显著的过滤作用,放大土体基频附近的振动,且放大幅度随地震动的加强而减小;小震时土体对加速度峰值起放大作用,而在大震时起减小峰值的作用;考虑SSI效应后,结构的频率降低,阻尼比提高,结构的损伤出现得更晚,发展也更慢。在土体频率处,SSI体系的振型受土体影响显著;在远离土体频率处,SSI体系振型与刚性地基一致。     

基于变换域注意力机制的压缩伪影去除的方法

图像有损压缩过程往往会导致图像质量退化,使图像出现压缩伪影。针对现有基于深度学习的方法缺乏对联合图像专家组(Joint Photographic Experts Group,JPEG)压缩算法先验信息的利用,提出一种基于变换域注意力机制的去伪影方法。该方法利用卷积神经网络在像素域和离散余弦变换(discrete cosine transform,DCT)域分别提取特征,再将双域学习的特征信息进行融合。利用量化表设计了DCT注意力机制,该模块根据DCT系数的损失程度给予各频率系数不同的权值,使网络自适应补偿量化引起的误差。于此基础上,在像素域引入通道注意力机制,从而更好地利用量化表的先验信息。在主要数据集上,提出的去伪影方法以固定的模型参数对多种质量因子的压缩图像进行伪影去除实验。实验结果表明,所提出的方法在各评价指标和主观视觉上取得较好的效果。     

Two-point AG codes from the Beelen-Montanucci maximal curve

In this paper we investigate two-point algebraic-geometry codes (AG codes) coming from the Beelen-Montanucci (BM) maximal curve. We study properties of certain two-point Weierstrass semigroups of the curve and use them for determining a lower bound on the minimum distance of such codes. AG codes with better parameters with respect to comparable two-point codes from the Garcia-Güneri-Stichtenoth (GGS) curve are discovered.