计算电磁学及其在复杂电磁环境数值模拟中的应用和发展趋势

概述计算电磁学的发展历程及其数值方法,并从学术研究、商业软件以及专用软件三个层次论述国内外研究的最新进展.结合复杂电磁环境的应用介绍复杂电磁环境数值模拟平台的研究现状,最后提出未来发展趋势的几点设想.     

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

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

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.     

基于荧光光谱技术的菜籽油氧化状态智能评价

菜籽油在加工及贮藏过程中，易受氧气、温度、光照等因素的影响，产生氧化酸败现象。为准确判断油脂氧化程度，实现不同氧化模式下菜籽油品质的快速判别，采用三维同步荧光光谱技术结合平行因子分析法及BP神经网络法建立菜籽油氧化状态的智能评价模型。以冷榨菜籽油为原料，将样品分别置于常温、Schaal烘箱、高温模式中氧化处理，期间采集菜籽油的三维同步荧光光谱数据及理化指标，当理化指标超出国标限定范围时，停止采集数据。结果表明，菜籽油中荧光物质在不同氧化模式中的演变规律呈显著差异，氧化温度对菜籽油荧光光谱有明显影响。常温氧化350 d与第1 d相比，菜籽油的特征荧光峰位置无变化，仅在激发波长Ex为620和660 nm附近荧光峰强度发生微弱变化；Schaal烘箱氧化26 d后，在激发波长Ex为620和660 nm附近荧光峰强度显著减弱，且在激发波长Ex为350～450 nm之间有新的荧光峰生成；高温氧化48 h后，Ex为620和660 nm处荧光峰消失，在Ex为400～550 nm处产生显著荧光峰，相对Schaal烘箱氧化，荧光波长发生一定程度红移，这是由于高温氧化过程中油脂氧化生成的物质稳定性较差引起的。利用平行因子分析法对三维同步荧光光谱数据进行分解获取有效的二维荧光光谱数据，当组分数为6，Δλ=60 nm时激发波长的载荷值最大，不同样品间差异最显著。选定Δλ=60 nm波段的二维荧光光谱数据用于智能评价，作为BP神经网络模型的输入值，以极性组分作为模型输出值，分别对菜籽油三种氧化模式数据建模训练。实验结果表明，三种氧化模式对应的训练集、验证集、测试集模型相关系数r均能达到0.9以上，其中常温氧化模式中验证集及测试集模型的相关系数r为1，输出值与目标值较接近，模型的预测效果较好；综合三种氧化模式数据建模，对应训练集、验证集、测试集模型的相关系数分别为0.999，0.913和0.988，均方误差均较小，说明该模型能准确判断菜籽油的不同氧化状态。因此，三维同步荧光光谱技术结合平行因子分析法、BP神经网络法建立快速检测模型能实现菜籽油不同氧化状态的判别，为菜籽油的氧化程度的评价提供新方法，同时为其他食用油的品质评价提供参考。     

基于消息传递接口的空中爆炸问题的并行计算

研究了用于处理三维多物质欧拉网格的模糊界面技术以及算法存在的数据相关性问题,提出了解决数据相关性的方法。采用基于消息传递接口(MPI)模式,设计出了相应的MMIC-3D并行程序,得到了无限空气介质中爆炸的三维数值模拟结果,计算结果与实际的实验现象及规律基本吻合。在共享存储的全对称多处理机(SMP)上进行了测试,得到了理想的加速比。     

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.     

激光聚变中的科学计算

科学计算在激光聚变研究中发挥着重要的作用.经过长期的努力,中国已形成了以LARED系列程序为核心的分段模拟激光聚变主要环节和关键问题的二维数值模拟能力.文章首先介绍了激光聚变的主要物理过程、主要物理过程的特征以及对科学计算的要求.其次,介绍了LARED系列程序的主要功能以及在激光聚变物理研究中的应用,介绍了正在研制和发展的模拟激光聚变全过程的新一代高性能并行应用程序的思路.最后,介绍了激光聚变科学计算中面临的一些挑战性问题.     

A parallel extended GCD algorithm

A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O(n/logn) time using at most n¹⁺ processors on CRCW PRAM. Sorenson and Chor and Goldreich both use a modular approach which consider the least significant bits. By contrast, our algorithm only deals with the leading bits of the integers u and v, with uv. This approach is more suitable for extended GCD algorithms since the coefficients of the extended version a and b, such that au+bv=gcd(u,v), are deeply linked with the order of magnitude of the rational v/u and its continuants. Consequently, the computation of such coefficients is much easier.     

Due-window assignment with identical jobs on parallel uniform machines

A scheduling problem with a common due-window, earliness and tardiness costs, and identical processing time jobs is studied. We focus on the setting of both (i) job-dependent earliness/tardiness job weights and (ii) parallel uniform machines. The objective is to find the job allocation to the machines and the job schedule, such that the total weighted earliness and tardiness cost is minimized. We study both cases of a non-restrictive (i.e. sufficiently late), and a restrictive due-window. For a given number of machines, the solutions of the problems studied here are obtained in polynomial time in the number of jobs.     

拉氏数值模拟中的人工粘性方法

较好的人工粘性需要满足较小的计算开销、不能去除真实具有的涡运动等条件.提出一种应用于拉氏数值模拟中基于Lew人工粘性,同时增加了限制器的人工粘性方法.可以有效减少数值模拟结果对网格的依赖;采用特征值限制器控制施加的人工粘性大小,通过限制器能够区分激波压缩和等熵压缩;方便应用在二维、三维,结构网格或者非结构网格上.