中子俘获瞬发γ射线数据评价(英文)

简要地介绍了中子俘获瞬发γ射线数据及其衰变纲图的评价方法技术、主要程序及其功能、数据评价流程、强度平衡检验，以及对A=1-44的稳定核素和A>190的部分稳定核素的热中子俘获瞬发γ射线数据及其衰变纲图评价的具体应用.The method of prompt γ-ray data evaluation for neutron capture and how to calculate the prompt γ-ray intensities of neutron capture have been briefly presented. The prompt γ-ray data of thermal-neutron capture of some stable nuclei for A=1-44 and A>190 have been evaluated. The ENSDF format has been adopted. The checks of intensity balance and format have been made. The examples are given to illustrate its application.     

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

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

一种PN码自适应捕获门限的改进算法

文献[1]提出了一种用于直扩系统的PN码自适应门限算法。但该文献也指出,此算法对门限总数十分敏感。当门限总数设置不当时,系统的平均捕获时间将显著增加。这限制了该算法在实际中的应用。本文就此提出了改进,给出了算法及电路框图。仿真结果表明,与原方案相比,改进算法改善了对门限总数的敏感性,降低了PN码平均捕获时间。     

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

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

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.     

Java语言及其虚拟机技术探讨

随着Internet的迅猛发展，Internet编程语言Java愈来愈成为计算机行业的焦点。本文在简述了Java的主要特点后，重点对Java最关键的技术──虚拟机进行了深入的探讨。     

一类三元线性分组码的译码

Ｐｌｅｓｓ［１］证明了三元（１２，６，６）Ｇｏｌａｙ码具有一种双层结构，并据此给出了该码的快速硬判决译码算法。本文推广了Ｇｏｌａｙ码的Ｐｌｅｓｓ结构，给出了由三元（ｎ，ｋ，ｄ）线性分组码构造的三元（３，ｎ＋ｋ，≥ｍｉｎ（ｎ，２ｄ，６））线性分组码，其中包括（１２，６，６）Ｇｏｌａｙ码和（１８，９，６）码，并以三元（１８，９，６）码为例给出了这类码的最大似然软判决译码算法。     

Modular implementation of efficient self-checking checkers for the Berger code

A technique for designing efficient checkers for conventional Berger code is proposed in this paper. The check bits are derived by partitioning the information bits into two blocks, and then using an addition array to sum the number of 1's in each block. The check bit generator circuit uses a specially designed 4-input 1's counter. Two other types of 1's counters having 2 and 3 inputs are also used to realize checkers for variable length information bits. Several variations of 2-bit adder circuits are used to add the number of 1's. The check bit generator circuit uses gates with fan-in of less than or equal to 4 to simplify implementation in CMOS. The technique achieves significant improvement in gate count as well as speed over existing approaches.     

一种可靠多播认证方案及其C语言实现

传统的认证技术对于多播认证并不适用,因为多播认证有它自身的特殊要求。论文介绍了两种针对多播认证特点的解决方案,并结合两种方案的特点阐述了一种改进的适合可靠多播的认证方案,最后给出了C语言的实现。