Secure authentication of classical messages with single photons

This paper proposes a scheme for secure authentication of classical messages with single photons and a hashed function. The security analysis of this scheme is also given, which shows that anyone cannot forge valid message authentication codes (MACs). In addition, the lengths of the authentication key and the MACs are invariable and shorter, in comparison with those presented authentication schemes. Moreover, quantum data storage and entanglement are not required in this scheme. Therefore, this scheme is more efficient and economical.     

Heterogeneous Graphical Granger Causality by Minimum Message Length

The heterogeneous graphical Granger model (HGGM) for causal inference among processes with distributions from an exponential family is efficient in scenarios when the number of time observations is much greater than the number of time series, normally by several orders of magnitude. However, in the case of “short” time series, the inference in HGGM often suffers from overestimation. To remedy this, we use the minimum message length principle (MML) to determinate the causal connections in the HGGM. The minimum message length as a Bayesian information-theoretic method for statistical model selection applies Occam’s razor in the following way: even when models are equal in their measure of fit-accuracy to the observed data, the one generating the most concise explanation of data is more likely to be correct. Based on the dispersion coefficient of the target time series and on the initial maximum likelihood estimates of the regression coefficients, we propose a minimum message length criterion to select the subset of causally connected time series with each target time series and derive its form for various exponential distributions. We propose two algorithms—the genetic-type algorithm (HMMLGA) and exHMML to find the subset. We demonstrated the superiority of both algorithms in synthetic experiments with respect to the comparison methods Lingam, HGGM and statistical framework Granger causality (SFGC). In the real data experiments, we used the methods to discriminate between pregnancy and labor phase using electrohysterogram data of Islandic mothers from Physionet databasis. We further analysed the Austrian climatological time measurements and their temporal interactions in rain and sunny days scenarios. In both experiments, the results of HMMLGA had the most realistic interpretation with respect to the comparison methods. We provide our code in Matlab. To our best knowledge, this is the first work using the MML principle for causal inference in HGGM.     

基于MPI的分子对接并行算法

基于消息传递接口(Message Passing Interface,MPI),用两种不同的并行程序设计方法对Autodock程序进行修改.将修改后的程序应用于HIV-1蛋白酶(Protease)和小分子抑制剂XK263的对接体系,测试了并行程序的加速比和并行效率.结果表明,两种改进的并行Autodock程序都可以很好地完成计算,尤其是方案Ⅱ并行程序的加速比和并行效率更高.     

Minimum-Integer Computation Finite Alphabet Message Passing Decoder: From Theory to Decoder Implementations towards 1 Tb/s

In Message Passing (MP) decoding of Low-Density Parity Check (LDPC) codes, extrinsic information is exchanged between Check Nodes (CNs) and Variable Nodes (VNs). In a practical implementation, this information exchange is limited by quantization using only a small number of bits. In recent investigations, a novel class of Finite Alphabet Message Passing (FA-MP) decoders are designed to maximize the Mutual Information (MI) using only a small number of bits per message (e.g., 3 or 4 bits) with a communication performance close to high-precision Belief Propagation (BP) decoding. In contrast to the conventional BP decoder, operations are given as discrete-input discrete-output mappings which can be described by multidimensional LUTs (mLUTs). A common approach to avoid exponential increases in the size of mLUTs with the node degree is given by the sequential LUT (sLUT) design approach, i.e., by using a sequence of two-dimensional Lookup-Tables (LUTs) for the design, leading to a slight performance degradation. Recently, approaches such as Reconstruction-Computation-Quantization (RCQ) and Mutual Information-Maximizing Quantized Belief Propagation (MIM-QBP) have been proposed to avoid the complexity drawback of using mLUTs by using pre-designed functions that require calculations over a computational domain. It has been shown that these calculations are able to represent the mLUT mapping exactly by executing computations with infinite precision over real numbers. Based on the framework of MIM-QBP and RCQ, the Minimum-Integer Computation (MIC) decoder design generates low-bit integer computations that are derived from the Log-Likelihood Ratio (LLR) separation property of the information maximizing quantizer to replace the mLUT mappings either exactly or approximately. We derive a novel criterion for the bit resolution that is required to represent the mLUT mappings exactly. Furthermore, we show that our MIC decoder has exactly the communication performance of the corresponding mLUT decoder, but with much lower implementation complexity. We also perform an objective comparison between the state-of-the-art Min-Sum (MS) and the FA-MP decoder implementations for throughput towards 1 Tb/s in a state-of-the-art 28 nm Fully-Depleted Silicon-on-Insulator (FD-SOI) technology. Furthermore, we demonstrate that our new MIC decoder implementation outperforms previous FA-MP decoders and MS decoders in terms of reduced routing complexity, area efficiency and energy efficiency.     

On the properties of elastic-viscous fluid flow past an obstacle

Fundamental equations for the analysis of plane flow of elastic-viscous fluid are established.On such a basis,a perturbed-weighted residual finite element model for small Deborah number situations is formulated.The model is further incorporated for investigations on the behavioral characteristics of the elastic-viscous fluid flow when passing an obstacle,which include the mechanisms of the retardation of separation point,and the reduction of drag forces and so forth.The numerical investigations demonstrate the favorable advantages of the present model in its remarkable simplicity and reasonable accuracy attained in plane flow analysis.     

重力式码头CAD集成系统的面向对象实现

本文所构建的重力式码头CAD集成系统GrawCAD(Gravity Wharf CAD Integrated System)将面向对象的编程方法贯穿于系统各个模块的具体实现过程中,集分析、设计与绘制工程图于一体,具体集成的模块包括：数据输入、构件设计、结构分析与优化设计、工程图纸的绘制和工程文档的编制等。GrawCAD利用标准的C 实现了适用于Windows及Linux等不同操作系统的核心计算类库,采用AutoCAD二次开发技术开发了工程图纸绘制模块,利用内存数据映射在系统不同进程间传递数据,利用消息发送及多线程对数据实时更新。     

Performance of parallel TURBOMOLE for density functional calculations

The parallelization of density functional treatments of molecular electronic energy and first-order gradients is described, and the performance is documented. The quadrature required for exchange correlation terms and the treatment of exact Coulomb interaction scales virtually linearly up to 100 nodes. The RI-J technique to approximate Coulomb interactions (by means of an auxiliary basis set approximation for the electron density) even shows superlinear speedup on distributed memory architectures. The bottleneck is then linear algebra. Demonstrative application examples include molecules with up to 300 atoms and 3000 basis functions that can now be treated in a few hours per geometry optimization cycle in C₁ symmetry. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 1746–1757, 1998     

3维Mortar谱元法模拟Kelvin-Helmhtz不稳定性混合层

采用Mortar谱元法和多处理器并行计算技术模拟了Kelvin-Helmhtz界面不稳定性湍流的混合发展过程,通过对混合层动量厚度、能谱和总动能的计算,评估了Kelvin-Helmhtz混合层的演化机理。计算结果表明：3维Mortar谱元法具有高计算精度和光滑区域的指数收敛特性,可以有效模拟混合层流动的湍流混合和演化,能够捕捉到涡的合并现象和大涡到小涡的级联过程;初期的混合层层流运动发展成具有连续谱结构的湍流运动过程,实现了Kelvin-Helmhtz界面不稳定性混合层流动从2维发展到3维的转捩特征,总湍流统计动能的变化反映了粘性耗散过程的作用。通过对Kelvin-Helmhtz 3维界面不稳定性混合层流动和3维层流向湍流转捩过程的数值模拟,程序的有效性得到了验算,表明谱元法应用于湍流混合模拟是可行的。     

非定常圆柱绕流的实验研究

本文采用流场显示方法研究单圆柱在非定常流动中的涡旋脱落规律。实验结果表明：在不同的ＫＣ数（ＫＣ＝Ｕ∞Ｔ／Ｄ）下，非常圆柱绕流的涡旋脱落特性是不相同的，一般随ＫＣ数值的增加，其涡旋脱落对数也增加，但有明显的阶梯性，同时圆柱分离点的周期变化后于流场的变化。     

构建面向对象的并行有限元计算集群

介绍了一种面向对象的方法来组建计算机集群进行并行有限元分析。将构成集群系统的软、硬件组件设计成不同的类层次结构,形成一个完整的集群系统类库,并以系统分析、总体设计、结点通信以及系统效率测试等过程尝试以系统化的方法来分析整个构建过程。实际结果及并行有限元分析算例表明,这样的设计策略,可以非常清晰地从整体上把握系统的实现,大大降低系统构建的复杂性,使所生成的系统具有很好的可扩展性。