超辐射机制相对论返波管的数值计算

 运用相对论返波管非线性理论,推导出描述相对论返波管束波互作用的非线性自洽方程组;数值求解了该非线性自洽方程组,揭示了相对论返波管中由非稳态束波互作用产生的超辐射现象的基本规律：输出超辐射波峰值功率大约与参与互作用电子总电荷量的平方成正比。并将超辐射和由稳态束波互作用所产生的受激辐射作了相关比较,结果表明：超辐射是短电子束脉冲产生非稳态束波互作用的结果,而受激辐射是长电子束脉冲产生稳态束波互作用的结果;不断增加电子束脉冲宽度,辐射机制由超辐射转变为受激辐射。     

Parallel computing structures capable of flexible associations and recognition of fuzzy inputs

We experimentally show that computing with attractors leads to fast adaptive behavior in which dynamical associations can be made between different inputs which initially produce sharply distinct outputs. We do so by first defining a set of simple local procedures which allow a computing array to change its state in time so as to produce classical Pavlovian conditioning. We then examine the dynamics of coalescence and dissociation of attractors with a number of quantitative experiments. We also show how such arrays exhibit generalization and differentiation of inputs in their behavior.     

PN结伏安特性的实验研究

介绍了验证PN结伏安关系特性实验的实验原理,并利用绘图软件Origin7.5对实验数据进行处理.结果表明,PN结的扩散电流和两端的正向电压之间满足指数关系.通过与理论公式的比较,准确地测出了玻尔兹曼常数.     

Some exact expressions for the mean and higher moments of functions of sample moments

Examples of exact expressions for the moments (mainly of the mean) of functions of sample moments are given. These provide checks on alternative developments such as asymptotic series for n, and simulation processes. Exact expressions are given for the mean of the square of the sample coefficient of variation, particularly in uniform sampling; Frullani integrals studied by G. H. Hardy arise. It should be kept in mind that exact results for (joint) moment generating functions (mgfs) are of interest as they produce a means of obtaining exact results for (cross) moments—including moments with negative indices. Thus an exact expression for the joint mgf of the 1st two noncentral moments can be used to obtain the mean of the (c.v.)² (but not for the mean of the c..). A general expression is given for the moment generating function of the sample variance. The limitations of Fisher's symbolic formula for the characteristic function of sample moments (or more general statistics) are noted.This research was sponsored by the Applied Mathematical Sciences Research program, Office of Energy Research, U. S. Department of Energy under contract DE-AC0584OR21400 with the Martin Marietta Energy Systems. Inc.     

分析非轴对称腔的复光线数值迭代法

将像散光束的复光线表示法用于分析非轴对称腔，并对有复杂像散的折迭腔作了数值迭代计算以说明方法的应用．     

离子能量分析器测量特性的仿真研究

针对空间等离子体及其模拟环境、空间原子氧及其模拟环境对离子能谱测量的需要,利用仿真软件COMSOL,对离子能量分析器的低能离子测量特性进行了仿真研究。介绍了离子能量分析器的工作原理,对离子能谱测量过程进行了公式推导。通过对三种待选仪器设计方案进行离子透过率仿真分析,确定了一种较优的仪器设计方案。多种离子温度下的误差分析结果也表明,该设计方案能够较为准确地测量离子能量分布。分析了电场畸变、等离子鞘层、栅网对齐方式和离子温度对测量结果的影响,根据仿真结果对一些仿真实验现象做出了合理的解释。     

A Dynamic Anomaly Detection Approach Based on Permutation Entropy for Predicting Aging-Related Failures

Software aging is a phenomenon referring to the performance degradation of a long-running software system. This phenomenon is an accumulative process during execution, which will gradually lead the system from a normal state to a failure-prone state. It is a crucial challenge for system reliability to predict the Aging-Related Failures (ARFs) accurately. In this paper, permutation entropy (PE) is modified to Multidimensional Multi-scale Permutation Entropy (MMPE) as a novel aging indicator to detect performance anomalies, since MMPE is sensitive to dynamic state changes. An experiment is set on the distributed database system Voldemort, and MMPE is calculated based on the collected performance metrics during execution. Finally, based on MMPE, a failure prediction model using the machine learning method to reveal the anomalies is presented, which can predict failures with high accuracy.     

Blind quantum computation with identity authentication

Blind quantum computation (BQC) allows a client with relatively few quantum resources or poor quantum technologies to delegate his computational problem to a quantum server such that the client's input, output, and algorithm are kept private. However, all existing BQC protocols focus on correctness verification of quantum computation but neglect authentication of participants' identity which probably leads to man-in-the-middle attacks or denial-of-service attacks. In this work, we use quantum identification to overcome such two kinds of attack for BQC, which will be called QI-BQC. We propose two QI-BQC protocols based on a typical single-server BQC protocol and a double-server BQC protocol. The two protocols can ensure both data integrity and mutual identification between participants with the help of a third trusted party (TTP). In addition, an unjammable public channel between a client and a server which is indispensable in previous BQC protocols is unnecessary, although it is required between TTP and each participant at some instant. Furthermore, the method to achieve identity verification in the presented protocols is general and it can be applied to other similar BQC protocols.     

Quantum Principles and Mathematical Computability

Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then outline a quantum mechanical “algorithm” for one of the insoluble problems of mathematics, the Hilbert's tenth and equivalently the Turing halting problem. The key element of this algorithm is the computability and measurability of both the values of physical observables and of the quantum-mechanical probability distributions for these values.