二维柱几何非定常中子输运方程基于格式的界面预估校正并行算法

针对二维柱几何非定常中子输运方程的Sn-间断有限元方法,提出基于格式的界面预估校正并行算法.数值算例表明,该并行算法在精度与并行度等诸方面均具有良好的性质,与已有的基于隐式格式的并行扫描算法相比,对于二维中子输运大规模计算问题,并行计算效率较高,并行加速比可增加-倍以上,且可保持原隐式格式的计算精度.     

二维球坐标系中子输运方程的一种并行SN算法

针对二维球坐标系下中子输运方程的SN算法, 提出基于(单元, 方向)二元组的有向图模型, 在已有的基于有向图的并行流水线算法基础上, 设计粒度可控多级并行SN算法。其中, 采用区域分解和并行流水线相结合的方式挖掘空间-角度方向的并行度, 提出能群流水并行方法, 并通过设置合适的流水线粒度来平衡有向图调度、通信和空闲等待开销。实验结果表明: 该算法可以有效地求解二维球坐标系下的中子输运方程。在某国产并行机1920核上, 对于96万网格、60个方向、24能群、数十亿自由度的典型中子输运问题, 获得了71%的并行效率。     

基于几何区域分解的三维输运问题并行迭代算法

对三维直角坐标下的输运隐式差分方程,研究了基于几何区域分解的并行迭代算法,给出了串、并行迭代误差估计.并对相关数值结果进行了分析、比较.     

辐射输运菱形差分SN方程的扩散综合加速方法

讨论辐射输运菱形差分S_N方程的源迭代加速方法,在一维情形下给出与输运算子离散相容的线性多频灰体加速计算格式.数值算例表明该加速算法是健壮有效的.     

节块内嵌离散纵标(SN)方法的算法研究及程序开发

介绍节块内嵌离散纵标(S_N)方法求解三维堆芯中子输运/扩散方程的算法框架.在基于扩散理论的三维粗网节块展开方法(NEM)的算法体系中,用基于输运理论的径向二维细网节块离散纵标方法(NDOM)的内迭代过程,替代节块展开方法(NEM)内迭代的径向求解过程.该算法充分考虑了核电厂反应堆堆芯的三维结构特点,另一方面,也充分利用了已经成熟的三维粗网节块展开方法(NEM)和二维离散纵标方法(S_N)的研究成果,同时有效避免了利用离散纵标方法(S_N)求解三维中子输运方程所面临的计算内存和计算时间的瓶颈问题.编制开发二维多群节块离散纵标方法(NDOM)模块程序NS_NM和三维多群节块展开方法(NEM)模块程序MGNEM,并以此为基础编制开发节块内嵌S_N方法的模块程序HANWIND;其中,NS_NM为HANWIND求解两维问题的功能模块.针对OECD/NEA-2D C5G7MOX基准问题以及两环路核电厂三维堆芯的数值验算结果表明,节块内嵌S_N方法的算法开发及程序编制有效、切实可行.     

δ函数SN方法求解含各向异性散射输运方程的本征值问题

将角通量分解成一个δ函数和一个低阶函数,分别采用解析方法和求积组来计算源项.利用δ函数S_N方法,计算了平几何条件下含各向异性散射单速输运方程的临界问题.分析和数值结果表明,采用数量较少的离散方向,能够达到较高计算精度.     

解二维输运问题的三角网间断有限元法

本文研究了求解二维柱对称几何中子输运问题的三角网间断有限元法,证明了数值方法的稳定性,给出了一些数值计算结果,并与精确解和DSN等方法的计算结果进行了比较,取得了满意的结果。     

对称性及多群中子扩散方程数值解

在多群中子扩散方程解析解的基础上,利用方程及求解域的对称性建立了新的数值求解中子扩散方程的理论模型.该模型显著的优点是适用于各种对称区域(二维、三维区域)尤其是非正方形区域中子扩散方程的求解,它彻底避免了常规节块法应用于非正方形几何时所出现的奇异性问题,且所得的解在求解域内任意点上均满足扩散方程.以二、三维六角形几何为例建立了数学模型,并用基准问题校核了模型的正确性. 关键词： 中子扩散方程 对称群 数值解 解析     

球几何中子输运保正线性间断有限元格式

针对球几何中子输运方程线性间断有限元方法计算的负中子通量问题,构造了保正线性间断有限元格式,该格式保持中子角通量0阶矩和1阶矩。现有方法计算中子角通量非负时,采用传统的线性间断有限元方法,求解线性方程组;原方法计算出现负通量,则采用构造的保正格式,求解非线性方程组。编制了球几何中子输运问题保正格式程序模块,并集成到应用程序。数值算例表明构造的保正格式计算的中子通量非负,有效降低数值误差,提高数值计算的精度。     

流体力学方程的间断有限元方法

在二维区域三角形网格上应用一阶、二阶和三阶精度间断有限元方法,对流体力学方程和方程组进行了数值模拟.计算结果与差分方法计算结果比较,认为间断有限元方法在求解复杂边界条件和区域问题上有一定的优势.     

弹性分组环网的分组延时性能研究

本文采用了M/G/1/K排队模型对Darwin标准草案中建议的弹性分组环网的分组传输延时进行了性能分析,结果表明不同优先级的业务等待延时不同,高优先级分组在网络中传输延时最低,中优先级分组的延时仅略低于低优先级分组,当网络规模增加时,这种差距逐渐减小甚至可以忽略;并且从理论上推导出网络最大吞吐量,这对于制定相关标准、设计和规划实用网络具有重要指导作用.     

优先权排队在消防物联网中的应用

针对消防物联网系统中消防监控中心收到的火警信息存在延迟,可能导致救火作战时机延误的问题,提出了一种火警信息优先传输的解决方案。首先,推导出FCFS的M/M/1排队系统的运行指标;其次,将消防报警信息分为火警报警信息、火警消除信息、故障报警信息和故障消除信息等四个优先级,建立非抢占优先权排队系统,并推导出各个优先级的运行指标;最后,从平均逗留时间和平均队长两个维度,比较了非抢占优先权排队系统和M/M/1系统的性能。提出的火警信息优先传输方案,满足了火警信息时延小的要求,同时实现复杂度低,为消防物联网安全信息数据的获取提供一定的理论支撑。     

Testing a priority-based queue model with Linux command histories

We study human dynamics by analyzing Linux history files. The goodness-of-fit test shows that most of the collected datasets belong to the universality class suggested in the literature by a variable-length queuing process based on priority. In order to check the validity of this model, we design two tests based on mutual information between time intervals and a mathematical relationship known as the arcsine law. Since the previously suggested queuing process fails to pass these tests, the result suggests that the modelling of human dynamics should properly consider the statistical dependency in the temporal dimension.     

Effective usage of shortest paths promotes transportation efficiency on scale-free networks

With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási–Albert scale-free networks under efficient routing protocol, where one packet’s delivery priority is related to its current distance to the destination. Compared with the traditional first-in-first-out queuing strategy, although the network capacity has no evident changes, some other indexes reflecting transportation efficiency are significantly improved in the congestion state. Extensive simulation results and discussions are carried out to explain the phenomena. Our work may be helpful for the designing of optimal networked-traffic systems.     

A domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by discontinuous Galerkin methods

We present here a domain decomposition method for solving the three-dimensional time-harmonic Maxwell equations discretized by a discontinuous Galerkin method. In order to allow the treatment of irregularly shaped geometries, the discontinuous Galerkin method is formulated on unstructured tetrahedral meshes. The domain decomposition strategy takes the form of a Schwarz-type algorithm where a continuity condition on the incoming characteristic variables is imposed at the interfaces between neighboring subdomains. A multifrontal sparse direct solver is used at the subdomain level. The resulting domain decomposition strategy can be viewed as a hybrid iterative/direct solution method for the large, sparse and complex coefficients algebraic system resulting from the discretization of the time-harmonic Maxwell equations by a discontinuous Galerkin method.     

不可压N-S方程的基于粘接元的区域分裂解法

首先,简单介绍了基于粘接元的无重叠区域分裂方法.这种方法利用变分原理,非常适合有限元近似.然后,着重讨论了这种区域分裂方法在求解不可压Navier-Stokes方程中的应用,具体包括等价变分公式的建立、通过算子分裂的时间离散、区域分裂情形下广义Stokes问题的共轭梯度迭代求解方法、空间的有限元离散.最后,以数值实验结果验证了这种区域分裂方法应用于不可压Navier-Stokes方程求解时的可靠性.     

光网络中视频业务传输的节点排队机制

对服务质量(QoS)中的队列机制进行了重点的分析, 并对先进先出(FIFO)以及具有优先级(PQ)的两种队列机制的特点进行了详细的比较。具有优先级(PQ)队列可以降低高优先级业务的平均排队时延, 但却无法保证时延抖动的要求。提出了基于具有优先级队列机制的改进方案。仿真结果表明, 新的排队机制有效得解决了具有优先级(PQ)排队机制中无法保证高优先级(视频)业务传输中的时延抖动问题, 当初始时延分布差别很大的数据包在经过节点排队调度之后, 时延抖动有了明显改善。     

散斑干涉相位条纹图的频域滤波处理

为了解决在数字散斑干涉技术测量时,散斑干涉相位条纹图像中大量噪声对相位解包裹结果和精度产生严重影响的问题,介绍了一种条纹正余弦分解和频域低通滤波结合的方法,实现了散斑干涉相位条纹图的高精度滤波。该方法的基本思路是在对相位图像进行滤波处理前,先将相位图通过正余弦函数进行映射转换成两幅图,分别经过频域滤波,然后再合成为相位图。这种分解频域滤波方法可以在滤波的同时,有效保留相位跳变信息。实验结果表明：与传统的图像降噪方法相比,该方法能够在保留图像“尖峰”信息的基础上,较好地滤除图像中的散斑噪声,方法简单有效,有效解决了传统滤波方法应用在相位条纹图中,相图灰度信息丢失10%~40%的问题。     

An efficient S-DDM iterative approach for compressible contamination fluid flows in porous media

In this paper, we develop an efficient splitting domain decomposition method (S-DDM) for compressible contamination fluid flows in porous media over multiple block-divided sub-domains by combining the non-overlapping domain decomposition, splitting, linearization and extrapolation techniques. The proposed S-DDM iterative approach divides the large domain into multiple block sub-domains. In each time interval, the S-DDM scheme is applied to solve the water head equation, in which an efficient local multilevel scheme is used for computing the values of water head on the interfaces of sub-domains, and the splitting implicit scheme is used for computing the interior values of water head in sub-domains; and the S-DDM scheme is then proposed to solve the concentration equation by combining the upstream volume technique. Numerical experiments are performed and analyzed to illustrate the efficiency of the S-DDM iterative approach for simulating compressible contamination fluid flows in porous media. The developed method takes the excellent attractive advantages of both the non-overlapping domain decomposition and the splitting technique, and reduces computational complexities, large memory requirements and long computational durations.     

A continuous model of human dynamics

Ideas and tools from statistical physics have recently been applied to the investigation of human dynamics. The timing of human activities, in particular, has been studied both experimentally and analytically. Empirical data show that, in many different situations, the time interval separating two consecutive tasks executed by an individual follows a heavy-tailed probability distribution rather than Poisson statistics. To account for this data, human behaviour has been viewed as a decision-based queuing system where individuals select and execute tasks belonging to a finite list of items as an increasing function of a task priority parameter. It is then possible to obtain analytically the empirical result P(τ)∼1/τ, where P(τ) is the waiting time probability distribution.Here a continuous model of human dynamics is introduced using instead an infinite queuing list. In contrast with the results obtained by other models in the finite case we find a waiting time distribution explicitly depending on the priority distribution density function ρ. The power-law scaling P(τ)∼1/τ is then recovered when ρ is exponentially distributed.