Application of x-ray fluorescence analysis to investigation of the composition of gunshot residues

We have used x-ray fluorescence analysis to study the elemental composition of gunshot residues from smooth-bore and rifled-bore guns. We have established that it is possible to differentiate between types of projectiles (jacketed/lead), types of primers (corrosive/noncorrosive), and types of propellant powders (black/smokeless) by analysis of the elemental composition of the gunshot residues. We have shown that the mercury content in gunshot residues on the surface of the object carrying the residues steadily decreases as storage time increases. Despite this fact, mercury can be preserved as a component of gunshot residues on the object (cotton cloth) under room conditions for more than 45 days. __________ Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 73, No. 3, pp. 320–325, May–June, 2006.     

The largest strongly consecutive repeat-free code

Answering a question of Körner and Simonyi, this paper gives a strongly consecutive repeat-free code of maximal size in [b]ⁿ.     

Spreading Code Design Using a Global Optimization Method

The performance of a code division multiple access system depends on the correlation properties of the employed spreading code. Low cross-correlation values between spreading sequences are desired to suppress multiple access interference and to improve bit error performance. An auto-correlation function with a distinct peak enables proper synchronization and suppresses intersymbol interference. However, these requirements contradict each other and a trade-off needs to be established. In this paper, a global two dimensional optimization method is proposed to minimize the out-of-phase average mean-square aperiodic auto-correlation with average mean-square aperiodic cross-correlation being allowed to lie within a fixed region. This approach is applied to design sets of complex spreading sequences. A design example is presented to illustrate the relation between various correlation characteristics. The correlations of the obtained sets are compared with correlations of other known sequences.     

码分复用数字音频水印嵌入方案

结合人耳听觉特性，用扩频方法在音频信号中的听觉不敏感区域嵌入多路数字水印，从而实现码分复用．在对嵌入信息的检测中，除了少量系统参数外，数字水印的提取不需要原始信号，并且毋需精确同步．实验表明，该水印具有很好的隐蔽性；尤其是对常见攻击，MP3编码具有良好的稳健性．     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

Solid codes and the uniform density of fd-domains

By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper.     

红外遥控键盘单片机接口实现技术

本介绍了一种利用电视机遥控器作为单片机输入键秀的接口原理和方法，并讨论了如何使用单片机来指令的解码，实践证明这种接口方式可以节省单片机的硬件资源，缩小单片机系统的体积，同时也方便了单片机的操作，尤其是某些需要远距离操作场合。     

关于笛卡尔积码的广义Hamming重量的分析

在文献[1 0 ] 中 ,由旧码C1 、C2 构造了一类新码C1 C2 ———笛卡尔积码。本文根据文献[1 ]中提出的广义Hamming重量的定义 ,分析了笛卡尔积码与旧码C1 、C2 的广义Hamming重量的关系 ,给出了几个有意义的结果     

用于留数算术中的数值／留数／数值的转换

介绍用光学方法完成留数算术中的数值/留数/数值的转换,并附有实验结果。     

Self-Orthogonal 3-(56,12,65) Designs and Extremal Doubly-Even Self-Dual Codes of Length 56

In this paper, we show that the code generated by the rows of a block-point incidence matrix of a self-orthogonal 3-(56,12,65) design is a doubly-even self-dual code of length 56. As a consequence, it is shown that an extremal doubly-even self-dual code of length 56 is generated by the codewords of minimum weight. We also demonstrate that there are more than one thousand inequivalent extremal doubly-even self-dual [56,28,12] codes. This result shows that there are more than one thousand non-isomorphic self-orthogonal 3-(56,12,65) designs. AMS Classification: 94B05, 05B05