On ordered categories as a framework for fuzzification of algebraic and topological structures

Using the framework of ordered categories, the paper considers a generalization of the fuzzification machinery of algebraic structures introduced by Rosenfeld as well as provides a new approach to fuzzification of topological structures, which amounts to fuzzifying the underlying “set” of a structure in a suitably compatible way, leaving the structure itself crisp. The latter machinery allows the so-called “double fuzzification”, i.e., a fuzzification of something that is already fuzzified.     

图K_n-E(k_0P_3(∪ri=1k_iP(q_i-1)))的色唯一性

记δｎ＝ｋ≤ｎｋｎ－ｋ，在本文中证明了：ｒ∈Ｎ，若ｉ∈｛１，２，…，ｒ｝，ｑｉ（＞５）都是素数，并且［（δｑｉ－１－１）！＋１］／δｑｉ－１是正整数，则图簇Ｋｎ－Ｅｋ０Ｐ３∪ｋ１Ｐｑ１－１∪ｋ２Ｐｑ２－１∪…∪ｋｒＰｑｒ－１是色唯一的，推广了文［１］的结果     

Ek/G/1排队系统的遍历性

该文研究了$E_k/G/1$排队系统等待时间$W(t)$和队长$L(t)$的 Harris遍历、几何遍历和一致遍历. 首先作者利用判别法给出了$W(t)$的$h$ -骨架链的几种遍历性的充要条件.由此得出$W(t)$的相应结果,然后在$W(t)$的结果的基础上,利用小集的方法得到了队长 $L(t)$的这几种遍历性成立的充要条件.     

一类中立型微分系统周期解的存在性与唯一性

利用Krasnoselskii不动点理论,用分析的方法,对一类中立型微分系统的周期解进行定性与定量地研究,获得了这一类微分系统周期解存在性与唯一性的充分条件.该研究方法异于相关文献中常用的方法,获得的主要结论是新的.     

On the local convergence of adjoint Broyden methods

The numerical solution of nonlinear equation systems is often achieved by so-called quasi-Newton methods. They preserve the rapid local convergence of Newton’s method at a significantly reduced cost per step by successively approximating the system Jacobian though low-rank updates. We analyze two variants of the recently proposed adjoint Broyden update, which for the first time combines the classical least change property with heredity on affine systems. However, the new update does require, the evaluation of so-called adjoint vectors, namely products of the transposed Jacobian with certain dual direction vectors. The resulting quasi-Newton method is linear contravariant in the sense of Deuflhard (Newton methods for nonlinear equations. Springer, Heidelberg, 2006) and it is shown here to be locally and q-superlinearly convergent. Our numerical results on a range of test problems demonstrate that the new method usually outperforms Newton’s and Broyden’s method in terms of runtime and iterations count, respectively. Partially supported by the DFG Research Center Matheon “Mathematics for Key Technologies”, Berlin and the DFG grant WA 1607/2-1.     

On the number of minimal models of a log smooth threefold

We give a topological bound on the number of minimal models of a class of three-dimensional log smooth pairs of log general type.     

Drinfeld Realization of Twisted Quantum Affine Algebras

The quantum affine algebra has two realizations, the usual Drinfeld–Jimbo definition and a new Drinfeld realization given by Drinfeld. In this article, we use the adjoint action to prove that these two realizations are isomorphic for the twisted quantum affine algebra.     

Nonlinear self-adjointness of the Krichever–Novikov equation

It is known that the classification of third-order evolutionary equations with the constant separant possessing a nontrivial Lie–Bäcklund algebra (in other words, integrable equations) results in the linear equation, the KdV equation and the Krichever–Novikov equation. The first two of these equations are nonlinearly self-adjoint. This property allows to associate conservation laws of the equations in question with their symmetries. The problem on nonlinear self-adjointness of the Krichever–Novikov equation has not been solved yet. In the present paper we solve this problem and find the explicit form of the differential substitution providing the nonlinear self-adjointness.     

Adjoint concepts for the optimal control of Burgers equation

Adjoint techniques are a common tool in the numerical treatment of optimal control problems. They are used for efficient evaluations of the gradient of the objective in gradient-based optimization algorithms. Different adjoint techniques for the optimal control of Burgers equation with Neumann boundary control are studied. The methods differ in the point in the numerical algorithm at which the adjoints are incorporated. Discretization methods for the continuous adjoint are discussed and compared with methods applying the application of the discrete adjoint. At the example of the implicit Euler method and the Crank Nicolson method it is shown that a discretization for the adjoint problem that is adjoint to the discretized optimal control problem avoids additional errors in gradient-based optimization algorithms. The approach of discrete adjoints coincides with that of automatic differentiation tools (AD) which provide exact gradient calculations on the discrete level.     

阳离子基因载体的pH敏感遮蔽体系的制备及表征

合成了一种pH敏感的遮蔽体系-谷氨酸苄酯/谷氨酸共聚物(PBLG-co-PGA), 用于对DNA/阳离子基因载体复合物颗粒表面正电荷的遮蔽, 以提高其在体内的稳定性. 研究表明, PBLG-co-PGA (PGA(x), x为PGA占共聚物中摩尔百分数)具有pH敏感性. 并以pH敏感点接近生理pH值的PGA(60)为遮蔽体系进行研究. PGA(60)能够对DNA/PEI(1:1)复合物颗粒表面正电荷进行有效遮蔽. 凝胶阻滞电泳显示, 用PGA(60)对DNA/PEI复合物进行不同比例遮蔽, 没有发生与DNA的链交换作用. MTT细胞毒性测试表明, PGA(60)和三元复合物DNA/PEI/PGA(60) 在测试范围内几乎没有细胞毒性. 荧光素酶转染实验表明, 部分遮蔽后转染效率有所提高; 用PGA(60)对DNA/PEI复合物完全遮蔽为负电后, 由于同细胞表面的电荷排斥作用, 三元复合物不易被细胞内吞, 导致不发生细胞转染. 因其合适的pH响应性, PGA(60)将可能成为一种能随pH值的变化, 实现对聚阳离子基因载体进行电荷遮蔽/智能释放的遮蔽材料.