模拟化学反应系统的快速无偏T-Leap算法

化学反应系统中的Leap算法可在获得较好精度的同时大幅提高模拟速度.最近提出的无偏Leap方法有效地克服了由Leap时间区间内的反应次数的近似均值与真实均值之间的偏差引起的Leap算法的误差的不足.本文讨论了一个基于物种相对改变估计真实均值的快速无偏T-Leap算法,并将该算法推广到模拟时滞化学系统中.该快速算法具有易于编码、比前者更快等优点.当系统中的反应通道或物种的数目较大时,该方法具有更明显的速度优势.     

模拟化学反应系统的快速无偏τ-Leap算法

化学反应系统中的Leap算法可在获得较好精度的同时大幅提高模拟速度.最近提出的无偏Leap方法有效地克服了由Leap时间区间内的反应次数的近似均值与真实均值之间的偏差引起的Leap算法的误差的不足.本文讨论了一个基于物种相对改变估计真实均值的快速无偏T-Leap算法,并将该算法推广到模拟时滞化学系统中.该快速算法具有易于编码、比前者更快等优点.当系统中的反应通道或物种的数目较大时,该方法具有更明显的速度优势.     

加速随机模拟化学反应系统的"最后所有可能的步进"方法

提出了一种改进的模拟化学反应系统的加速方法,称为"最后所有可能的步进"(FAPS)方法.此方法不仅可以用较少的模拟次数得到整个运行过程中任何时刻物种的统计特性,而且还可以与leap算法相结合,有效地进行大规模的化学反应系统的模拟.数值模拟的结果表明提出的方法可以广泛地应用于多种化学反应系统,并且与已有的方法相比其运行效率有显著的改进.     

模拟时滞化学反应系统的自适应τ-Leap算法

本文发展了一种模拟时滞化学反应系统的自适应τ-Leap算法（DAr—Leap）．该算法将后验τ-Leap算法应用到时滞化学反应系统，能够自动调节τ使得在时间区间[t，t＋τ）内发生多次反应事件并且精确地满足Leap条件，从而避免了负分子数目的产生，较大地提高了模拟速度．     

一种新型压缩预处理CGS算法

CGS算法是求解大型非对称线性方程组的常用算法，然而该算法无极小残差性质，因此它常因出现较大的中间剩余向量而出现典型的不规则收敛行为．本根据IRA方法提出了一种压缩预处理CGS方法，数值实验表明这种算法在一定程度上减小了迭代算法在收敛过程中的剩余问题，从而使得算法具有更好的稳定性，该法构造简单，减少了收敛次数，加快了收敛速度．     

三项记忆梯度法及其投影算法的收敛性分析

对于无约束优化问题,提出了一类新的三项记忆梯度算法．这类算法是在参数满足某些假设的条件下,确定它的取值范围,从而保证三项记忆梯度方向是使目标函数充分下降的方向．在非单调步长搜索下讨论了算法的全局收敛性．为了得到具有更好收敛性质的算法,结合Solodov and Svaiter(2000)中的部分技巧,提出了一种新的记忆梯度投影算法,并证明了该算法在函数伪凸的情况下具有整体收敛性．     

求解机器人制造单元调度问题的化学反应优化算法

针对多类型工件加工机器人制造单元调度NP难题,提出一种局部搜索的化学反应优化算法。该算法采用基于迭代次数的线性排序选择,维持解的多样性;构建紧后工件阻塞时间最小化交换的邻域结构加快收敛速度。此外,该算法主要参数由正交试验获得。通过求解随机产生的算例,仿真结果表明,化学反应优化算法优于遗传算法,提出算法较化学反应优化算法能更有效地搜索到更好解。     

一种有限元-边界元耦合分域算法

提出了一种有限元-边界元耦合分域算法．该算法将所分析问题的区域分解成有限元和边界元子域,在满足两子域界面上位移和面力协调连续的条件下,通过迭代求解得到问题的解．在迭代求解过程中,引入动态松弛系数,使收敛得以加速．该方法在两子域界面上有限单元结点和边界单元结点的位置相互独立,无需协调一致,对诸如裂纹扩展过程的模拟具有独特的优势．用所提出的耦合算法分析算例,得到的结果与有限元法、边界元法和另一种耦合算法的数值计算结果一致,验证了这种算法的正确性和可行性．     

基于线性时变模型的非线性动态系统最优控制DISOPE算法

本文针对现有的ＤＩＳＯＰＥ算法迭代次数过多的缺陷［１］，对连续时间非线性动态系统提出了一种基于时变线性二次型问题的ＤＩＳＰＯＥ算法，分析了该算法的最优性和收敛性，仿真例子表明本文算法可以减少迭代次数，从而节省计算时间．     

线性规划联合算法的理论与应用

本在[1]的基础上．较系统的叙述了线性规划联合算法的步骤、相关理论及其应用，指出该算法具有避免人工变量、减少迭代次数、使用灵活、应用方便等特点。     

艾拉姆咖分布参数变点的Bayes估计

研究了艾拉姆咖分布变点估计的非迭代抽样算法(IBF)和MCMC算法.在贝叶斯框架下,选取无信息先验分布,得到关于变点位置的后验分布和各参数的满条件分布,并且详细介绍了IBF算法和MCMC方法的实施步骤.最后进行随机模拟试验,结果表明两种算法都能够有效的估计变点位置,并且IBF算法的计算速度优于MCMC方法.     

A multicast routing algorithm based on searching in directed graph

Aiming at constructing a delay and delay variation bounded Steiner tree in the real-time streaming media communication, in this paper, we discuss a multicast routing algorithm based on searching a directed graph (MRASDH). During the process of the construction of the multicast tree, some nodes and links in the network topology do not affect the outcome of the constructed tree. Therefore, based on the thought of shrinking the search space through deleting these non-relative nodes and edges to the utmost, the ant algorithm is utilized to generate a directed sub-graph of the network topology for each destination node, in which each node owns a bounded out-degree. And all these sub-graphs can be merged into a new directed graph that serves as the new search space. In the new space, the simulated annealing algorithm is applied to obtain a multicast tree that satisfies the condition for the optimization. The performance analysis and simulation results demonstrate that this algorithm can effectively construct a delay and delay variation bounded multicast tree. They also show that the algorithm have lower time complexity than the current ones, which means a much better result would be achieved when the system scale rises greatly.     

Issues of feasibility,coherence, and robustness in a premise-to-claim model of argumentation: Results from four experiments

The paper considers several issues. (1) The feasibility of a premise to claim model of dialogue: the results show that a rule-based system can generate claims in the same sequence as they appear in a real discussion. (2) The relationship between the increased knowledge created in the leap from premise to claim on the perceived coherence and comprehensibility of dialogue: the system’s reaction to making available all premises before run time was to provide a rapid summary of the debate, whereas the result of randomly rearranging the order of introduction of premises showed that the majority of claims were still made, and that a very similar sequence of claims was followed; for the first half the observed sequence was taken by the simulation program, because initially the number of (randomly introduced) premises was so small that they did not match the available warrants. (3) Robustness of a rule-based argumentation system in the face of expert fallibility: the test condition here was a reduced set of rules (as a proxy for lack of expert knowledge) which however, showed an overall convergence to the same claims in the same sequence as when all the rules were used.     

灰色模型的最优化及其参数的直接求法

基于灰色模型的内涵表达式和白化方程响应式均为等比级数的观点,提出了一种不用求ago值、均值,不涉及灰色微分方程,白化微分方程概念,直接求灰色模型参数a,c的方法,通过此方法建立的新模型不仅从理论上可保证是在满足给定评价标准为模拟绝对误差平方和最小(或模拟相对误差平方和最小)、给定精度条件下的最优化模型,从而结束了灰色模型只有更优,没有最优的历史.并从理论上证明了新模型具有白化指数律重合性、白化系数律重合性,伸缩变换一致性.最后通过实例编程验证该方法具有可操作性,且预测精度高,效果好.     

One-dimensional equilibrium model and source parameter determination for soil-column experiment

One-dimensional equilibrium soil-column experiment models with source (sink) reaction terms are discussed in this paper. In the case of occurring high-order chemical reactions, the zero production term in traditional models should be modified to a nonlinear term related with time (or space) and solute concentration, and then a mathematical model with nonlinear terms is put forward. Furthermore, an actual soil-column experiment in Zhangdian, Zibo is investigated. By applying an optimal perturbation algorithm, the source coefficient in the model is determined both in the cases of accurate data and inaccurate data. The inversion results show that for such inverse source coefficient problems with limited additional data, some optimal methods could be more efficient than regularization strategies, and for some real equilibrium soil-column experiments, the process of source (sink) reactions could be a key factor in the solute transportation.     

A note on chance constrained programming with fuzzy coefficients

This paper deals with nonlinear chance constrained programming as well as multiobjective case and goal programming with fuzzy coefficients occurring in not only constraints but also objectives. We also present a fuzzy simulation technique for handling fuzzy objective constraints and fuzzy goal constraints. Finally, a fuzzy simulation based genetic algorithm is employed to solve a numerical example.     

概率统计方法在高分子共聚合反应中的应用

本文从聚合反应的机理出发,给出了一般的s元共聚反应的概率模型和实现共聚物大分子链增长过程的随机模拟方法,并讨论了动力学参数的估计问题.这对研究共聚物的统计类别,大分子链的微结构和预测共聚物的组成等都有重要意义.作者对苯乙烯—丙烯酸丁酯的二元共聚物的链增长过程做了实际模拟,并且采用Bayes方法估计动力学参数,所得结果与文献结果甚为一致.     

Strong Predictor-Corrector Approximation for Stochastic Delay Differential Equations

This paper presents a strong predictor-corrector method for the numerical solution of stochastic delay differential equations (SDDEs) of Itô-type. The method is proved to be mean-square convergent of order min{$1/2, \hat{p}$} under the Lipschitz condition and the linear growth condition, where $\hat{p}$ is the exponent of Hölder condition of the initial function. Stability criteria for this type of method are derived. It is shown that for certain choices of the flexible parameter $p$ the derived method can have a better stability property than more commonly used numerical methods. That is, for some $p$, the asymptotic MS-stability bound of the method will be much larger than that of the Euler-Maruyama method. Numerical results are reported confirming convergence properties and comparing stability properties of methods with different parameters $p$. Finally, the vectorised simulation is discussed and it is shown that this implementation is much more efficient.     

Chaos synchronization of the fractional-order Chen’s system

In this paper, based on the stability theorem of linear fractional systems, a necessary condition is given to check the chaos synchronization of fractional systems with incommensurate order. Chaos synchronization is studied by utilizing the Pecora–Carroll (PC) method and the coupling method. The necessary condition can also be used as a tool to confirm results of a numerical simulation. Numerical simulation results show the effectiveness of the necessary condition.