Physico-mathematical simulation of methane and argon removal absorption process by liquid ammonia from synthesis gas of ammonia production

Abstract

The elaboration of the theoretical experimental model of the absorption process under a pressure of 30 MPa and moderate temperatures included the experimental research of methan and argon absorption from the five-component mixture H₂-N₂-CH₄-Ar-NH₃ by liquid ammonia on a pilot plant and carrying out the computerized research of process statics.     

大学物理实验教学改革探索——谈“少台套大循环”教学模式与管理

教学改革的最终目标都是为了有益于学生的全面发展以及实践能力的提高。以大学物理实验改革为例,介绍了＂少台套大循环＂的实验改革与教学管理方法。经过两年多＂少台套大循环＂的运行,这种改革不仅提高了学生的实验操作能力,而且在教学资源有效配置方面探索出一种可行的运行模式。     

资源受限下森林火灾应急救援多目标调度优化

许多森林火灾由于救援资源受限而不能在第一时间扑灭,导致火灾扩大蔓延,进而造成更大的森林资源损失。因此,在救援资源受限情形下,如何对消防救援车辆进行合理的调度安排以快速和低成本地扑灭火灾已成为亟待解决的现实问题。本文研究了一类资源受限下森林火灾应急救援多目标调度优化问题,为该问题构建了多目标混合整数非线性规划模型,优化目标为同时最小化总灭火救援时间和救援车辆总行驶距离。为有效求解该问题,首先将上述非线性模型等价转化为线性模型。然后提出ε-约束法和模糊逻辑相结合的算法对问题进行求解。最后,以大兴安岭山发生的火灾案例和随机生成仿真算例对模型和算法有效性进行验证,结果表明所提出的模型和算法能够有效解决资源受限下森林火灾应急救援问题,并为决策者提供最优的消防调度方案。     

Energy and Quadratic Invariants Preserving Methods for Hamiltonian Systems with Holonomic Constraints

We introduce a new class of parametrized structure--preserving partitioned Runge-Kutta ($\alpha$-PRK) methods for Hamiltonian systems with holonomic constraints. The methods are symplectic for any fixed scalar parameter $\alpha$, and are reduced to the usual symplectic PRK methods like Shake-Rattle method or PRK schemes based on Lobatto IIIA-IIIB pairs when $\alpha=0$. We provide a new variational formulation for symplectic PRK schemes and use it to prove that the $\alpha$-PRK methods can preserve the quadratic invariants for Hamiltonian systems subject to holonomic constraints. Meanwhile, for any given consistent initial values $(p_{0}, q_0)$ and small step size $h>0$, it is proved that there exists $\alpha^*=\alpha(h, p_0, q_0)$ such that the Hamiltonian energy can also be exactly preserved at each step. Based on this, we propose some energy and quadratic invariants preserving $\alpha$-PRK methods. These $\alpha$-PRK methods are shown to have the same convergence rate as the usual PRK methods and perform very well in various numerical experiments.     

Two-Phase Image Segmentation by Nonconvex Nonsmooth Models with Convergent Alternating Minimization Algorithms

Two-phase image segmentation is a fundamental task to partition an image into foreground and background. In this paper, two types of nonconvex and nonsmooth regularization models are proposed for basic two-phase segmentation. They extend the convex regularization on the characteristic function on the image domain to the nonconvex case, which are able to better obtain piecewise constant regions with neat boundaries. By analyzing the proposed non-Lipschitz model, we combine the proximal alternating minimization framework with support shrinkage and linearization strategies to design our algorithm. This leads to two alternating strongly convex subproblems which can be easily solved. Similarly, we present an algorithm without support shrinkage operation for the nonconvex Lipschitz case. Using the Kurdyka-Łojasiewicz property of the objective function, we prove that the limit point of the generated sequence is a critical point of the original nonconvex nonsmooth problem. Numerical experiments and comparisons illustrate the effectiveness of our method in two-phase image segmentation.     

Closed-form solutions of general second order linear recurrences and applications

Two closed-form solutions of a general second order linear recurrence with variable coefficients are established. The first form is combinatorial in nature and is derived through the use of a set which counts the number of elements which are two units apart. The second form is closely related to continued fractions and is derived through the use of continued fraction-like relation. Several applications including a number of verifications of conjectures produced from the Ramanujan Machine are worked out, which illustrate its versatility in this respect.     

求分块鳞状因子循环矩阵逆矩阵的一种快速算法

给出了一种计算分块鳞状因子循环矩阵逆矩阵的快速算法,该算法主要利用了离散傅立叶变换和对角块矩阵求逆的递归算法,与标准的利用LU分解法求逆的算法相比,在计算复杂性上有很大的优势.     

Terminal constrained robust hybrid iterative learning model predictive control for complex time-delayed batch processes

This work mainly addresses terminal constrained robust hybrid iterative learning model predictive control against time delay and uncertainties in a class of complex batch processes with input and output constraints. In this work, an equivalently novel extended two-dimensional switched system is first constructed to represent the process model by introducing state difference, output error and new relaxation variable information. Then, a hybrid predictive updating controller is proposed and an optimal performance index function including terminal constraints is designed. Under the condition that the switching signal meets certain conditions, the solvable problem of model predictive control is realized by Lyapunov stability theory. Meanwhile, the design scheme of controller parameters is also given. In addition, the robust constraint set is adopted to overcome the disadvantage that the traditional asymptotic stability cannot converge to the origin when it involves disturbances, such that the system state converges to the constraint set and meets its expected value. Finally, the effectiveness of the proposed algorithm is verified by controlling the speed and pressure parameters of the injection molding process.     

Theo’s reinvention of the logic of conditional statements’ proofs rooted in set-based reasoning

This report documents how one undergraduate student used set-based reasoning to reinvent logical principles related to conditional statements and their proofs. This learning occurred in a teaching experiment intended to foster abstraction of these logical relationships by comparing the relationships between predicates within the conditional statements and inference structures among various proofs (in number theory and geometry). We document the progression of Theo’s set-based emergent model (Gravemeijer, 1999) from a model-of the truth of statements to a model-for logical relationships. This constitutes some of the first evidence for how students can abstract such logical concepts in this way and provides evidence for the viability of the learning progression that guided the instructional design.