与时俱进，不断开创物理化学课程建设新局面

As a necessary basic theory course for undergraduates majoring in chemistry, materials, pharmacy, chemical engineering, and biology, physical chemistry plays an important role in cultivating talents to meet the needs of social and economic development. Over the years, the teaching team of physical chemistry of East China University of Science and Technology has carried out the curriculum reform and innovation persistently based on "Team building as the foundation, resource building as the root, mode innovation as the soul, ability training as the origin". This paper will summarize our thinking and experience in striving for the first-class course from the aspects of first-class team construction, first-class resource construction, teaching connotation innovation, teaching mode exploration, and extract the experience that can be used as reference by teaching peers.     

地方综合性大学化学创新人才培养课程新体系的建设

构建课程新体系和改革教学内容是高等教育改革永恒的主题。本文立足于地方综合性大学的特点,通过构建"四位一体"课程新体系,形成三层次的课程模块,进行多角度、多层面的课程内容改革,为化学创新型人才的培养奠定了基础。     

Corrigendum to “New algebraic properties of an amalgamated algebra along an ideal”

At some point, after publication, we realized that Proposition 4.1(2) and Theorem 4.4 in [2 D’Anna, M., Finocchiaro, C. A., Fontana, M. (2016). New algebraic properties of an amalgamated algebra along an ideal. Commun. Algebra 44(5):1836–1851.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]] hold under the assumption (not explicitly declared) that B = f(A)+J. Furthermore, we provide here the exact value for the embedding dimension of A?^fJ, also when B≠f(A)+J, under the hypothesis that J is finitely generated as an ideal of the ring f(A)+J.     

基于离散网格的流形曲面构造综述

基于离散网格的流形曲面构造技术不仅能够生成具有高阶光滑性的曲面,并且该曲面可以是任意拓扑结构的.此外,在构造流形曲面时,无需进行额外的拼接操作,克服了传统曲面造型技术在进行面片之间的拼接时,计算量增大以及曲面光滑性难以保证的难题.本文介绍了流形曲面构造的流程以及构造过程中的难点,然后将目前已有的流形曲面构造技术分为三大类:传统意义上的流形构造方法;基于规范区域的流形构造方法;基于样条曲面推广的流形构造方法.并对每一类都进行详细地分类介绍.最后,对其作一个总结以及对未来的展望.     

重复性建设项目中确定关键路线的方法研究

本文提出了一种确定重复性建设项目关键路线的新方法。借助约束线,首先给出了工序间存在各种约束条件(时间和距离约束)下潜在关键点的确定方法;为处理大规模项目,进一步提出了与图示法相对应的数值算法。以此为基础,提出了确定关键工序和关键路线的具体步骤,并定义和分析了三种不同类型的关键工序。与现有的方法相比,本文提出的确定关键路线的方法更为准确,适用性更强,而且有利于调度优化目标的实现。     

Biembedding Steiner Triple Systems in Surfaces Using the Bose Construction

A uniform framework is presented for biembedding Steiner triple systems obtained from the Bose construction using a cyclic group of odd order, in both orientable and nonorientable surfaces. Within this framework, in the nonorientable case, a formula is given for the number of isomorphism classes and the particular biembedding of Ducrocq and Sterboul (preprint 18pp., 1978) is identified. In the orientable case, it is shown that the biembedding of Grannell et al. (J Combin Des 6 ( 7 ), 325–336) is, up to isomorphism, the unique biembedding of its type. Automorphism groups of the biembeddings are also given.     

关于Steiner问题的一个注记——连接五点之最小网络的一种寻优方案

本文讨论如何寻找连接平面上五个给定点的最小网络这一问题．通过发展越民义证明Pollack在1978年所给出的一个关于寻找连接平面上四个给定点的最小网络的重要结论的方法,我们给出了一个采用简单几何作图方法快速求解该问题的方案．     

Constructing permutation polynomials from piecewise permutations

We present a construction of permutation polynomials over finite fields by using some piecewise permutations. Based on a matrix approach and an interpolation approach, several classes of piecewise permutation polynomials are obtained.     

提高超静定桁架承载能力的杆长调整法

基于超静定桁架的内力分布特点,调整杆长改变单元应力,使结构承载能力得到提高,通过几个例题验证了方法的有效性。     

A class of highly symmetric graphs,symmetric cylindrical constructions and their spectra

In this article, we introduce the algebra of block-symmetric cylinders and we show that symmetric cylindrical constructions on base-graphs admitting commutative decompositions behave as generalized tensor products. We compute the characteristic polynomial of such symmetric cylindrical constructions in terms of the spectra of the base-graph and the cylinders in a general setting. This gives rise to a simultaneous generalization of some well-known results on the spectra of a variety of graph amalgams, as various graph products, graph subdivisions and generalized Petersen graph constructions. While our main result introduces a connection between spectral graph theory and commutative decompositions of graphs, we focus on commutative cyclic decompositions of complete graphs and tree-cylinders along with a subtle group labeling of trees to introduce a class of highly symmetric graphs containing the Petersen and the Coxeter graphs. Also, using techniques based on recursive polynomials we compute the characteristic polynomials of these highly symmetric graphs as an application of our main result.