组合几何蒙特卡罗粒子输运支撑软件框架JCOGIN介绍

介绍了JCOGIN支撑软件框架层次式、模块化的体系结构及其核心数据结构。这些使得JCOGIN软件框架能够支撑大规模复杂几何的蒙特卡罗（MC）粒子输运并行计算。同时介绍了在JCOGIN支撑软件框架下研发的JMCT程序,并进行了性能测试,在2万处理器核上模拟20亿粒子,并行效率达到70%。     

An interpretable intrusion detection method based on few-shot learning in cloud-ground interconnection

An enterprise’s private cloud may be attacked by attackers when communicating with the public cloud. Although traffic detection methods based on deep learning have been widely used, these methods rely on a large amount of sample data and cannot quickly detect new attacks such as Zero-day Attacks. Moreover, deep learning has a black-box nature and cannot interpret the detection results, which has certain security risks. This paper proposes an interpretable abnormal traffic detection method, which can complete the detection task with only a few malicious traffic samples. Specifically, it uses the covariance matrix to characterize each traffic category and then calculates the similarity between the query traffic and each category according to the covariance metric function to realize the traffic detection based on few-shot learning. After that, the traffic images processed by the random masks are input into the model to obtain the predicted probability of the corresponding traffic category. Finally, the predicted probability is linearly summed with each mask to generate the final saliency map to interpret and analyze the model decision. In this paper, experiments are carried out by simulating only 15 and 25 malicious traffic samples. The results show that the proposed method can obtain good accuracy and recall, and the interpretation analysis shows that the model is reliable and interpretable.     

Two-stage least squares and indirect least squares algorithms for simultaneous equations models

This paper analyzes the solution of simultaneous equations models. Efficient algorithms for the two-stage least squares method using QR-decomposition are developed and studied. The reduction of the execution time when the structure of the matrices in each equation is exploited is analyzed theoretically and experimentally. An efficient algorithm for the indirect least squares method is developed. Some techniques are used to accelerate the solution of the problem: parallel versions for multicore systems, and extensive use of the MKL library, thus obtaining efficient, portable versions of the algorithms.     

Nuclear-induced time evolution of entanglement of two-electron spins in anisotropically coupled quantum dot

We study the time evolution of entanglement of two spins in an anisotropically coupled quantum dot interacting with the unpolarised nuclear spins environment. We assume that the exchange coupling strength in the z direction J _z is different from the lateral one J _l . We observe that the entanglement decays as a result of the coupling to the nuclear environment and reaches a saturation value, which depends on the value of the exchange interaction difference J = ‖J _l ? J _z ‖ between the two spins and the strength of the applied external magnetic field. We find that the entanglement exhibits a critical behaviour controlled by the competition between the exchange interaction J and the external magnetic field. The entanglement shows a quasi-symmetric behaviour above and below a critical value of the exchange interaction. It becomes more symmetric as the external magnetic field increases. The entanglement reaches a large saturation value, close to unity, when the exchange interaction is far above or below its critical value and a small one as it closely approaches the critical value. Furthermore, we find that the decay rate profile of entanglement is linear when the exchange interaction is much higher or lower than the critical value but converts to a power law and finally to a Gaussian as the critical value is approached from both directions. The dynamics of entanglement is found to be independent of the exchange interaction for an isotropically coupled quantum dot.     

Escape from the quantum pigeon conundrum

It has recently been argued in Aharonov et al. (2016) that quantum mechanics violates the Pigeon Counting Principle (PCP) which states that if one distributes three pigeons among two boxes there must be at least two pigeons in one of the boxes. However, this conclusion cannot be justified by rigorous theoretical arguments. The issue is further complicated by experimental confirmation of the transition amplitudes predicted in this paper that nevertheless do not support the conclusion of PCP violation. Here we prove via a set of operator identities that the PCP is not violated within quantum mechanics, regardless of interpretation.     

A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems

This paper presents a parallel tabu search algorithm that utilizes several different neighborhood structures for solving the capacitated vehicle routing problem. Single neighborhood or neighborhood combinations are encapsulated in tabu search threads and they cooperate through a solution pool for the purpose of exploiting their joint power. The computational experiments on 32 large scale benchmark instances show that the proposed method is highly effective and competitive, providing new best solutions to four instances while the average deviation of all best solutions found from the collective best results reported in the literature is about 0.22%. We are also able to associate the beneficial use of special neighborhoods with some test instance characteristics and uncover some sources of the collective power of multi-neighborhood cooperation.     

一种新的局部时间积分的区域分解波形松弛算法

提出一种新的区域分解波形松弛算法, 使得可以在不同的子域采用不同的时间步长来并行求解线性抛物方程的初边值问题. 与传统的区域分解波形松弛算法相比, 该算法可以通过预条件子来加快收敛速度, 并且对内存的需求大大降低. 给出了局部时间步长一种具体的实现方法, 证明了离散解的存在唯一性, 并在时间连续水平分析了预条件系统. 数值实验显示了新算法的有效性.     

Simulation of Optical Devices Using Parallel FDTD Method

On this paper, we investigate the algorithm and efficiency of simulation of optical devices using parallel computing method, implement some real wavelength division multiplexing (WDM) components such as resonators to test the method's possibility and efficiency.     

一种带时间窗和车辆数目限制的车辆路线问题及其算法

本文提出了带时间窗和车辆数目限制的车辆路线问题的数学模型,针对该问题的特征构造了一种路线生成算法和禁忌搜索算法,并对Solomon提出的C1、R1、RC1类数据集给出了数值运算的结果,实验结果表明算法是有效的.     

Reducing ghosting due to k-space discontinuities in fast spin echo (FSE) imaging by a new combination of k-space ordering and parallel imaging

In multi-echo imaging sequences like fast spin echo (FSE), the point spread function (PSF) in the phase encoding direction contains significant secondary peaks (sidebands). This is due to discontinuities in adjacent k-space data obtained at different echo times caused by T₂ decay, and leads to ghosting and hence reduced image quality. Recently, utilising multiple coils for signal reception has become the standard configuration for MR systems due to the additional flexibility that parallel imaging (PI) methods can provide. PI methods generally obtain more data than is required to reconstruct an image. Here, this redundancy in information is exploited to reduce discontinuity-related ghosting in FSE imaging. Adjacent phase encoded k-space lines are acquired at different echo times alternately in the regions of discontinuity (called ‘feathering’). This moves the resulting ghost artefacts to the edges of the field of view. This property of the ghost then makes them amenable to removal using PI methods. With ‘feathered’ array coil data it is possible to reconstruct data over the region of the discontinuity from both echo times. By combining this data, a significant reduction in ghosting can be achieved. We show this approach to be effective through simulated and acquired MRI data.