条形码技术的国际发展趋势及我国的对策

介绍了供应链管理中的一个得力工具——条形码技术，对这一技术进行了剖析，分析了条形码技术的国际发展趋势以及在我国的应用现状，最后针对我国在实现条形码技术时所遇到的各种问题提出了一些建议。     

基于自相关的激光编码解算

分析了半自主激光制导武器的激光编码规律，提出了运用自相关技术对激光编码进行解算。通过仿真试验验证，运用该技术可准确预测、精确同步复制敌方激光编码，并形成有效的激光诱饵，达到全程自适应干扰的目的。     

Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs

Five non-isomorphic quasi-symmetric 2-(49, 9, 6) designs are known. They arise from extremal self-dual [50, 25, 10] codes with a certain weight enumerator. Four of them have an automorphism of order 3 fixing two points. In this paper, it is shown that there are exactly 48 inequivalent extremal self-dual [50, 25, 10] code with this weight enumerator and an automorphism of order 3 fixing two points. 44 new quasi-symmetric 2-(49, 9, 6) designs with an automorphism of order 3 are constructed from these codes.     

微型低速短波数据终端的研制

短波信道是一种变参信道,存在严重的衰落和干扰。本文讨论了信道对数据信号传输的影响,并详细叙述了用于中短距离数据通信的微型短波数据终端的设计思想,最后还提供了该终端的硬件系统框图及信道实验结果。     

用酉几何构作笛卡尔认证码

利用有限域上的酉几何构作了一个笛卡尔认证码，并计算了它们的参数。此外，假定根据均匀概率分布选择编码规则，计算了模仿攻击与替换攻击成功的概率的最大值Ｐ１与Ｐｓ。     

Mechanism and Defense on Malicious Code

With the explosive growth of network applications, the threat of the malicious code against network security becomes increasingly serious. In this paper we explore the mechanism of the malicious code by giving an attack model of the maliciouscode, and discuss the critical techniques of implementation and prevention against the malicious code. The remaining problems and emerging trends in this area are also addressed in the paper.     

用于分布式识别的语音参数的提取和性能分析

主要研究用于分布式语音识别(DSR)的语音参数的提取方法以及参数性能分析。以前所用到的语音参数大部分是LPC倒谱参数,但其抗噪声性能较差。文中主要讨论了MEL倒谱参数,并在移动通信环境下,比较了两者的性能。     

数字建筑之文化符码浅析

从数字时代演化和人类行为学角度出发，简述了数字设计的概念以及文化符码的观念理论，以文化符码三层说对某数字设计的实例进行了分析，从文化符码解读了数字设计创作的方法论。     

Iterative Method for Constructing Complete Complementary Sequences with Lengths of 2^mN

Complete complementary sequences are widely used in spectrum spread communications because of their ideal correlation functions. A previous method generates complete complementary sequences with lengths of N^nN （n,N ∈ Z^＋）. This paper presents a new iterative method to construct complete complementary sequences with lengths of 2^mN （m,N ∈ Z^＋）. The analysis proves that this method can produce many sequence sets that do not appear in sequence sets generated by the former method, especially shorter sequence sets. The result will certainly increase the application of complete complementary sequences in communication engineering and related fields.