有限长度LDPC码一种速率兼容删余算法

提出一种AWGN信道下有限长度RC-LDPC码的删余算法,该算法对规则及非规则LDPC码均有效。该删余算法基于一系列准则,其中一个重要准则是某个候选删除节点的具有低的近似环外消息度(ACE)的短环的数量。仿真结果表明,ACE对删余码的性能有很大的影响,该算法的性能比已有算法有进一步提高。     

Recognition of words presented during general anaesthesia

Occasionally, patients report memories (‘awareness’) for events occurring during anaesthesia. The experience can be disturbing for both patient and anaesthetist. The present study confirms that anaesthetized patients can retain a weak memory for auditory information presented during the period when they were apparently unconscious. Patients who were played a ten-word stimulus list performed significantly better in subsequently correctly detecting those stimuli in a 40-word test list than did a control group who heard a tape of radio static. Retention was apparent only by the recognition test, indicating that reliance upon patients' spontaneous recall underestimates the potential for retention, and hence the frequency of awareness itself. The results support those who advocate the use of ear plugs or other devices to prevent patients from hearing, and perhaps remembering, disquieting information during surgery.     

Using Tabulated Information

Abstract

Different tabulation formats for currency conversion tables wore examined. It was found that most formats could be used equally well to make conversions bi-directionally, i.e. from A to B and from 13 to A. A fully redundant table, one that required no additional arithmetic operations, could be used more quickly than a schematic table, and in schematic tables it was more important to have each of the major units given directly rather than each of the minor units. A matrix, although fully redundant, was much more difficult to use than the corresponding table of lists. Many subjects clearly did not understand the principles of matrix format. Measures of incidental learning suggested that practice at using a table resulted in only slight knowledge of the content of the table, even though much of each table could be generated from a single rule     

Fatigue life calculation by means of the cycle counting and spectral methods under multiaxial random loading

The paper contains a new algorithm for estimation of fatigue life in HCF regime under multiaxial random loading using spectral methods. Loading of Gaussian distribution and narrow‐ and broad‐band frequency spectra were assumed. Various characteristic states of multiaxial loading were considered. The equivalent stress history was determined with use of the failure criteria of multiaxial fatigue based on the critical plane. For determination of the critical plane position, the method of variance was applied. During simulation, the authors compared the results obtained by a spectral method in the frequency domain with those from the rain‐flow algorithm in the time domain. The paper also contains the results of fatigue tests for 18G2A structural steel subjected to bending and combined bending with torsion. The tests were performed in order to verify the proposed algorithms for determination of fatigue life. It has been shown that under multiaxial random loading results of fatigue life calculated according to the considered algorithms in frequency and time domains are well correlated with the results of experiments.     

大亚湾核电站实施18个月换料的放射性后果评估

针对大亚湾核电站实施18个月换料技术改造的特点，计算了大亚湾核电站在正常运行工况下以及各种设计基准事故工况下对周围环境的放射性后果。计算结果表明，大亚湾核电站实施18个月换料技术改造后，正常运行工况安全设施的性能满足GB6249－86的要求。     

快淬贮氢合金的活化性能与寿命

主要讨论了快淬钛基合金具有良好活化性能及较差循环寿命的机理。研究结果表明:快淬钛基合金电极浸泡在碱液中,合金元素V、Zr、Ti、Mn、Ni以不同速度溶解,其中Ni的溶解速度最慢,使合金电极表面富Ni。富Ni电极表面具有良好的动力学性能,快淬钛基贮氢合金的放电容量急剧衰退与损失大量可吸氢的V、Zr元素密切相关。     

终身教育体系下成人教育的改革和发展策略

探讨了成人教育作为传统学校教育向终身教育发展的一种新型教育制度,应以终身教育理念为导向进行改革和发展,并提出了新的发展目标和策略.     

某星载大口径天线子系统的力学仿真分析

星载天线在发射及在轨阶段将面临严酷的力学环境,要求具有极高的可靠性。为了验证其刚度和强度,缩短研发周期,文中采用NX Nastran软件建立了某星载大口径天线子系统的力学仿真模型;为了验证仿真的有效性,进行了该天线子系统的模态测试,经对比发现两者数据一致性较好;基于建立的有限元模型,分析了该天线子系统在正弦振动和热循环环境工况下的结构响应和受力情况,得到了相应的加速度、位移和应力云图。结果表明,该天线子系统的结构刚强度均满足星载环境要求。该仿真分析对星载天线子系统的结构设计具有重要的指导意义。     

A distributed deadlock detection algorithm for mobile computing system

The mode of mobile computing originated from distributed computing and it has the un-idempotent operation property, therefore the deadlock detection algorithm designed for mobile computing systems will face challenges with regard to correctness and high efficiency. This paper attempts a fundamental study of deadlock detection for the AND model of mobile computing systems. First, the existing deadlock detection algorithms for distributed systems are classified into the resource node dependent （ RD ） and the resource node independent （RI） categories, and their corresponding weaknesses are discussed. Afterwards a new RI algorithm based on the AND model of mobile computing system is presented. The novelties of our algorithm are that： 1 ） the blocked nodes inform their predecessors and successors simultaneously; 2） the detection messages （agents） hold the predecessors information of their originator; 3 ） no agent is stored midway. Additionally, the quit-inform scheme is introduced to treat the excessive victim quitting problem raised by the overlapped cycles. By these methods the proposed algorithm can detect a cycle of size n within n - 2 steps and with （ n^2- n - 2 ）/2 agents. The performance of our algorithm is compared with the most competitive RD and RI algorithms for distributed systems on a mobile agent simulation platform. Experiment results point out that our algorithm outperforms the two algorithms under the vast majority of resource configurations and concurrent workloads. The correctness of the proposed algorithm is formally proven by the invariant verification technique.     

证明推广的卡诺定理的另一种方法

本文提出了对于推广的卡诺定理的另一种较严密的证明方法,此种证明方法更易于为学生接受,其物理含义更为明确。