小型发生炉煤气在矿区的应用

本文从民用角度主要介绍了发生炉煤气站工艺流程，讨论了煤气站的经济性、存在问题及对策，从而确定发生炉煤气作为民用煤气的可行性。     

用WKB方法讨论透射系数和反射系数

本文用WKB近似方法讨论了势垒贯穿问题系数T和其透射反射系数R之和恒等为1,即满足恒等式T R=1,并进一步得出这一结论不仅适用于一般势垒贯穿而且在方势垒贯穿中也成立,最后讨论了势垒贯穿的几种极限情况,例如,h→0(即经典情况),势垒高度v→∞、v→0,势垒宽度a→∞、a→0,等几种特殊情况下的T及R的取值问题。     

我国电机保护现状与发展趋势

电动机的保护在企业生产中是非常重要的一项内容，其保护方式及过程有一定的规范要求，其发展趋势要遵循可靠、稳定的原则。     

广义线性模型与非线性模型参数的统计推断

概述了广义线性模型(含半参数广义线性模型)与非线性模型研究的新进展,着重讨论了它们参数估计的统计推断。近年来,广义线性模型与非线性模型的研究发展迅速,有着广泛的应用前景。     

Particle-in-Cell algorithms for emerging computer architectures

We have designed Particle-in-Cell algorithms for emerging architectures. These algorithms share a common approach, using fine-grained tiles, but different implementations depending on the architecture. On the GPU, there were two different implementations, one with atomic operations and one with no data collisions, using CUDA C and Fortran. Speedups up to about 50 compared to a single core of the Intel i7 processor have been achieved. There was also an implementation for traditional multi-core processors using OpenMP which achieved high parallel efficiency. We believe that this approach should work for other emerging designs such as Intel Phi coprocessor from the Intel MIC architecture.     

CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm: 2D and 3D Ising,Potts, and XY models

We present sample CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the q$q$-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models (Komura and Okabe, 2012). We here explain the details of sample programs, and discuss the performance of the present GPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions.     

GPU accelerated online multi-particle beam dynamics simulator for ion linear particle accelerators

An online beam dynamics simulator is being developed for use in the operation of an ion linear particle accelerator. By employing Graphics Processing Unit (GPU) technology, the performance of the simulator has been significantly increased over that of a single CPU and is therefore viable in the demanding accelerator operations environment. Once connected to the accelerator control system, it can rapidly respond to any control set point changes and predict beam properties along an ion linear accelerator in pseudo-real time. This simulator will be a virtual beam diagnostic tool which is especially useful when direct beam measurements are not available. Details about the code structure design, physics algorithms, GPU implementations, and performance are presented.     

实践工程总承包之体会

介绍了目前国际上广为采用的5种工程总承包方式以及水泥工业建设项目总包工程合同管理和索赔管理的内容与要求;分析了设计单位进行工程总承包的优势所在;探讨了工程总包实施中各类风险。     

Fast finite difference Poisson solvers on heterogeneous architectures

In this paper we propose and evaluate a set of new strategies for the solution of three dimensional separable elliptic problems on CPU–GPU platforms. The numerical solution of the system of linear equations arising when discretizing those operators often represents the most time consuming part of larger simulation codes tackling a variety of physical situations. Incompressible fluid flows, electromagnetic problems, heat transfer and solid mechanic simulations are just a few examples of application areas that require efficient solution strategies for this class of problems. GPU computing has emerged as an attractive alternative to conventional CPUs for many scientific applications. High speedups over CPU implementations have been reported and this trend is expected to continue in the future with improved programming support and tighter CPU–GPU integration. These speedups by no means imply that CPU performance is no longer critical. The conventional CPU-control–GPU-compute pattern used in many applications wastes much of CPU’s computational power. Our proposed parallel implementation of a classical cyclic reduction algorithm to tackle the large linear systems arising from the discretized form of the elliptic problem at hand, schedules computing on both the GPU and the CPUs in a cooperative way. The experimental result demonstrates the effectiveness of this approach.     

Fast computation of computer-generated hologram using Xeon Phi coprocessor

We report fast computation of computer-generated holograms (CGHs) using Xeon Phi coprocessors, which have massively x86-based processors on one chip, recently released by Intel. CGHs can generate arbitrary light wavefronts, and therefore, are promising technology for many applications: for example, three-dimensional displays, diffractive optical elements, and the generation of arbitrary beams. CGHs incur enormous computational cost. In this paper, we describe the implementations of several CGH generating algorithms on the Xeon Phi, and the comparisons in terms of the performance and the ease of programming between the Xeon Phi, a CPU and graphics processing unit (GPU).