一些特殊有限群的整群环的挠子群

由（ZC-3）对于p^2q阶群成立.讨论了p阶循环群与q阶循环群圈积的整群环的挠子群,证明了一些特殊有限群的整群环中某些有限子群与该群的某个子群有理共轭.     

心磁和心电信号的混沌时间序列分析

计算了一组心磁和心电检测信号的关联维数和最大李亚普诺夫(Lyapunov)指数.心磁和心电信号的关联维数分别在2.28±0.27和1.12±0.13范围内,最大Lyapunov指数分别在0.68±0.12和0.32±0.04范围内.对其它4组数据中心测点的计算结果也说明心磁和心电信号具有混沌特性.此外,结果显示心磁边缘测点的混沌吸引子与中心部分有明显差别,可用于分析信号的有效检测范围.     

Laguerre正交基前向神经网络及其权值直接确定法

根据多项式理论,构造了一种以Laguerre正交多项式作为隐层神经元激励函数的前向神经网络模型.根据标准BP算法,导出了权值修正的迭代公式(包括标量形式和矩阵形式).区别于这种需要迭代训练获得最优权值的方法,针对该网络模型,进一步提出了一种基于伪逆的直接计算权值的方法.该权值直接确定法避免了以往的权值反复迭代训练的冗长过程.仿真结果显示其具有比传统的BP迭代法更快的计算速度,并且能够能达到更高的工作精度.     

关于置换特征标的一个注记

利用有限秩自由R-模V与一个G-集Ω构造出一个G-模VΩ,并给出了由它定义的特征标的计算公式,我们的结果是置换模R[Ω]定义的特征标的一个推广。     

离子色谱-紫外检测器测定食品中亚硝酸盐和硝酸盐

建立了离子色谱-紫外检测器测定食品中亚硝酸盐和硝酸盐的分析方法。样品经超声提取后,以3.6 mmol/L Na_2CO_3溶液为流动相,经Metrosep A supp7-250阴离子交换分析柱,于210 nm处进行紫外检测。结果表明该方法在0.025～0.20 mg/L(亚硝酸盐)、0.10～2.0 mg/L(硝酸盐)范围内具有良好的线性关系,相关系数r均在0.999以上。亚硝酸盐和硝酸盐的检出限分别为0.004 5 mg/L和0.017 2 mg/L,检测下限分别为0.018 mg/L和0.068 mg/L,实际样品加标回收率分别为81.3%～87.3%和98.3%～103.1%,相对标准偏差小于5%。实验表明,该方法简便、灵敏,可用于测定食品中的亚硝酸盐和硝酸盐。     

基于可靠度理论对滑移式落石的稳定性及敏感性分析

汶川地震引发了大量的地质灾害,其中坡表停留孤石的判定及治理成为了灾害重建的难题。针对偏心滑落式孤石的稳定性极限特征,用可靠度理论,建立其可靠度判定极限状态方程;并根据现场量测及概率统计方法,对函数中孤石处的坡脚α、孤石的内摩擦角φ、单位长度危岩体重力G、孤石黏聚力c、孤石高度h等基本变量的均值、变异性系数及分布特征进行确定。基于以上研究成果,建立了偏心滑移式孤石稳定性可靠度指标计算方法;同时对各基本变量的可靠度敏感性进行研究。研究结果表明:孤石的倾角的可靠度敏感性最高,其次是孤石的单位长度重量、内摩擦角和黏聚力指标;而孤石的高度对其没有影响。     

Fast Fractal Image Encoding Based on Special Image Features

The fractal image encoding method has received much attention for its many advantages over other methods, such as high decoding quality at high compression ratios. However, because every range block must be compared to all domain blocks in the codebook to find the best-matched one during the coding procedure, baseline fractal coding (BFC) is quite time consuming. To speed up fractal coding, a new fast fractal encoding algorithm is proposed. This algorithm aims at reducing the size of the search window during the domain-range matching process to minimize the computational cost. A new theorem presented in this paper shows that a special feature of the image can be used to do this work. Based on this theorem, the most inappropriate domain blocks, whose features are not similar to that of the given range block, are excluded before matching. Thus, the best-matched block can be captured much more quickly than in the BFC approach. The experimental results show that the runtime of the proposed method is reduced greatly compared to the BFC method. At the same time, the new algorithm also achieves high reconstructed image quality. In addition, the method can be incorporated with other fast algorithms to achieve better performance. Therefore, the proposed algorithm has a much better application potential than BFC.