Experimental and numerical simulation of lignite chemical looping gasification with phosphogypsum as oxygen carrier in a fluidized bed

Phosphogypsum (PG) is a solid waste produced in the wet process of producing phosphoric acid.Lignite is a kind of promising chemical raw material.However,the high sulfur of lignite limits the utilization of lig-nite as a resource.Based on fluidized bed experiments,the optimal reaction conditions for the production syngas by lignite chemical looping gasification (CLG) with PG as oxygen carrier were studied.The study found that the optimal reaction temperature should not exceed 1123 K;the mole ratio of water vapor to lignite should be about 0.2;the mole ratio of PG oxygen carrier to lignite should be about 0.6.Meanwhile,commercial software Comsol was used to establish a fuel reaction kinetics model.Through computational fluid dynamics (CFD) numerical simulation,the process of reaction in fluidized bed were well captured.The model was based on a two-fluid model and coupled mass transfer,heat transfer and chemical reac-tions.This study showed that the fluidized bed presents a flow structure in which gas and solid coexist.There was a high temperature zone in the middle and lower parts of the fluidized bed.It could be seen from the results of the flow field simulated that the fluidized bed was beneficial to the progress of the gasification reaction.     

计及频率稳定的多直流异步外送电网切机容量优化

异步互联格局下,送端电网惯性大幅下降,因直流闭锁引发的高频问题较为严重,传统应对高频问题的稳控切机策略存在切机量不精确（过切或欠切）以及切机后系统转动惯量匮乏等风险。针对现有稳控切机方案的不适应性,提出一种计及系统频率稳定需求的多直流异步外送电网切机容量优化模型。模型中耦合大容量直流闭锁故障下各种频率指标约束、网络潮流约束、备用及切机量约束,考虑系统内各类型机组调节性能及位置的差异性,利用理想点法和优序图法得到各类型机组的切机惩罚因子,通过切机综合代价最小化目标确定大容量直流闭锁事故下送端电网的最优切机方案。以改进的IEEE RTS-79系统为例进行了算例分析,验证了所构建模型的有效性与频率适应性。     

电网故障处置预案文本中的命名实体识别研究

电网故障处置预案是电网故障处置的重要参考,对电网故障处置预案文本中各类电力设备、名称编号等细粒度的关键实体信息进行抽取,是实现计算机学习理解预案内容并进一步支撑故障处置智能化的重要基础。文中提出一种基于深度学习的电网故障处置预案文本命名实体识别技术,首先采用字向量表征预案文本,然后将注意力机制以及双向长短期记忆网络相结合,有所侧重地提取实体词深层字符特征,最后采用条件随机场求解最优序列化的标注。算例表明:文中所提预案文本命名实体识别模型不依赖人工特征,能够自动高效地提取文本特征,准确识别预案文本中细粒度的实体词,满足预案文本中关键实体信息精确定位和识别的要求。     

关注区可变的实时仿真方法与平台

交直流混合电网的实时仿真既要考虑电力电子设备的开关特性,又要保证适应较大的电网规模,在实际工程中面临诸多困难.给子网络赋予动态可变的关注标志,对关注子网络采用存储压力小的节点消去法,对非关注子网络采用计算量少的线性组合法,从而保证骨架型节点电压法的实用性.在Xilinx公司的Virtex-7 FPGA VC709开发板中,采用无缝的并行化仿真计算程序对接方式和灵活的结构参数查询方法解决了现场可编程逻辑门阵列资源的紧缺问题,设计了一种关注区可变的实时数字仿真平台.以典型的交直流混合电网为例,仿真验证了所提方法的可行性与所研发平台的有效性.     

考虑样本类别不平衡的电网故障事件智能识别方法

电网中不同设备的故障概率存在差异,影响智能诊断技术的准确性.为解决此问题,提出了一种基于代价敏感学习和模型自适应选择融合的电网故障事件智能识别方法.首先,利用Word2vec模型将预处理后的电网告警信息向量化,并搭建2个双向长短期记忆网络作为基础分类器;然后,设计代价敏感损失函数,将交叉熵损失函数与代价敏感损失函数分别应用于2个分类器中;最后,提出一种模型自适应选择融合法,融合上述分类器,得到故障事件识别结果.实际数据测试表明,所提方法能够有效降低故障事件识别中样本类别不平衡的影响.     

基于改进自注意力机制生成对抗网络的智能电网GPS欺骗攻击防御方法

为了避免全球定位系统欺骗攻击(GSA)对相量测量装置造成的危害,提出了一种基于改进自注意力机制生成对抗网络(SAGAN)的智能电网GSA防御方法.首先,通过引入深度学习参数,构建了改进网络-物理模型,利用历史数据计算得到当前时刻的量测值.然后,在SAGAN的生成器和判别器网络中分别融入一个时间注意力模块,提出了一种用于实现网络-物理模型的改进SAGAN防御方法.通过训练改进SAGAN,得到一对判别器和生成器,利用判别器检测采集的量测值是否遭受GSA,当检测到攻击时,利用生成器生成的数据替换欺骗数据,从而实现智能电网对GSA的主动防御.最后,基于IEEE 14节点和IEEE 118节点系统进行仿真测试,结果验证了所提方法的可行性和有效性.     

Strength, strain-rate sensitivity and ductility of copper with nanoscale twins

We present a comprehensive computational analysis of the deformation of ultrafine crystalline pure Cu with nanoscale growth twins. This physically motivated model benefits from our experimental studies of the effects of the density of coherent nanotwins on the plastic deformation characteristics of Cu, and from post-deformation transmission electron microscopy investigations of dislocation structures in the twinned metal. The analysis accounts for high plastic anisotropy and rate sensitivity anisotropy by treating the twin boundary as an internal interface and allowing special slip geometry arrangements that involve soft and hard modes of deformation. This model correctly predicts the experimentally observed trends of the effects of twin density on flow strength, rate sensitivity of plastic flow and ductility, in addition to matching many of the quantitative details of plastic deformation reasonably well. The computational simulations also provide critical mechanistic insights into why the metal with nanoscale twins can provide the same level of yield strength, hardness and strain rate sensitivity as a nanostructured counterpart without twins (but of grain size comparable to the twin spacing of the twinned Cu). The analysis also offers some useful understanding of why the nanotwinned Cu with high strength does not lead to diminished ductility with structural refinement involving twins, whereas nanostructured Cu normally causes the ductility to be compromised at the expense of strength upon grain refinement.     

冲压成形仿真过程中有限元网格模型的建立

网格模型对冲压成形模拟的精度和效率影响极大 ,文中阐述了有限元网格模型建立的方法 ,并从单元尺寸、单元类型、自适应网格再划分技术等方面论述了如何解决精度与效率的问题。     

GPELab,a Matlab toolbox to solve Gross–Pitaevskii equations I: Computation of stationary solutions

This paper presents GPELab (Gross–Pitaevskii Equation Laboratory), an advanced easy-to-use and flexible Matlab toolbox for numerically simulating many complex physics situations related to Bose–Einstein condensation. The model equation that GPELab solves is the Gross–Pitaevskii equation. The aim of this first part is to present the physical problems and the robust and accurate numerical schemes that are implemented for computing stationary solutions, to show a few computational examples and to explain how the basic GPELab functions work. Problems that can be solved include: 1d, 2d and 3d situations, general potentials, large classes of local and nonlocal nonlinearities, multi-components problems, and fast rotating gases. The toolbox is developed in such a way that other physics applications that require the numerical solution of general Schrödinger-type equations can be considered.     

Efficient multiple-precision integer division algorithm

Design and implementation of division algorithm is one of the most complicated problems in multi-precision arithmetic. Huang et al. [1] proposed an efficient multi-precision integer division algorithm, and experimentally showed that it is about three times faster than the most popular algorithms proposed by Knuth [2] and Smith [3]. This paper reports a bug in the algorithm of Huang et al. [1], and suggests the necessary corrections. The theoretical correctness proof of the proposed algorithm is also given. The resulting algorithm remains as fast as that of [1].