A class of antimagic join graphs

A labeling f of a graph G is a bijection from its edge set E(G) to the set {1, 2, . . . , |E(G)|}, which is antimagic if for any distinct vertices x and y, the sum of the labels on edges incident to x is different from the sum of the labels on edges incident to y. A graph G is antimagic if G has an f which is antimagic. Hartsfield and Ringel conjectured in 1990 that every connected graph other than K 2 is antimagic. In this paper, we show that if G 1 is an n-vertex graph with minimum degree at least r, and G 2 is an m-vertex graph with maximum degree at most 2r-1 (m ≥ n), then G1 ∨ G2 is antimagic.     

A dynamic pricing approach for returned products in integrated forward/reverse logistics network design

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics network. In this paper, we address the problem of designing and planning a multi-echelon, multi-period, multi-commodity and capacitated integrated forward/reverse logistics network. Returned products are categorized with respect to their quality levels, and a different acquisition price is offered for each return type. Furthermore, the reservation incentive of customers, the expected price of customers for one unit of used product described by uniform distribution, is applied to model the customers’ return willingness. Due to the fact that the remaining worthwhile value in the used products is the corporation’s key motivation for buying them from customers, a dynamic pricing approach is developed to determine the acquisition price for these products and based on it determine the percentage of returned products collected from customer zones. The used products’ acquisition prices at each time period are determined based on the customers’ return willingness by each collection center.     

High-efficient surface tailoring via reverse atom transfer radical polymerization and reversible addition-fragmentation chain-transfer polymerization in an aqueous system initiated by a monocenter redox pair

The commonly used multi-center initiation methods always lead to the formation of quantities of homopolymer in the surface tailoring based on reverse atom transfer radical polymerization (ATRP) and reversible addition-fragmentation chain-transfer (RAFT) polymerization. In this study, a monocenter redox pair constructed of silica bearing tert-butyl hydroperoxide groups and ascorbic acid (SiO₂-TBHP/AsAc) was applied to substitute the commonly used initiation method of R-supported RAFT grafting polymerization. All the propagating radicals were restricted on the surface of solid particles during the whole procedure theoretically, resulting in a higher grafting efficiency of 95.1% combined with the “controllable” feature at 10 h. This redox pair was also used to initiate the reverse ATRP in miniemulsion successfully with a grafting efficiency of 86.3% at 10 h. The grafting efficiency obtained under this monocenter initiation method was significantly higher than that of the frequently reported surface modification by reverse ATRP and RAFT polymerization. In addition, the high-efficient surface tailoring was traced and confirmed by nuclear magnetic resonance, Fourier transform infrared, X-ray photoelectron spectroscopy, thermogravimetric analysis, transmission electron microscopy, and other analysis tests. The advantage of this monocenter redox pair will open a new avenue for the potential “high-efficient” surface tailoring of various materials.     

Topological multiplicity of the maximum eigenvalue of graph 1-Laplacian

In this paper, we reveal the connection between the independent number of a graph and the topological multiplicity of the maximal eigenvalue of the corresponding graph 1-Laplacian. The pseudo independent number of a graph is introduced, which provides a better lower estimate of the topological multiplicity of the maximum eigenvalue. The technique of our proof is based on the localization property of the eigenvector for graph 1-Laplacian, the Krasnoselski genus, and its relation to the topological join.     

多共振热激活延迟荧光过程的理论研究

本工作借助第一性原理和动力学演化,系统地研究了四个叔丁基-咔唑及吩噻嗪取代的硼-氮化合物(BCz-BN、2PTZ-BN、Cz-PTZ-BN和2Cz-PTZ-BN)的多共振热激活延迟荧光的高效发光机制.结果表明上述分子T₁与T₂间的内转换速率远大于其它辐射与非辐射速率,同时T₂到S₁的反向系间窜越速率也高于T₁到S₁的反向系间窜越速率,因此其多共振热激活延迟荧光过程应遵循T₁→T₂→S₁→S₀的路径.进一步动力学演化表明,T₁与T₂之间的内转换主要发生在演化初期,随着时间的推移,能量逐渐由T₂向S₁转移,并最终在S₁完成荧光发射.上述研究揭示了多共振延迟荧光的微观本质,为未来设计及合成新的多共振热激活延迟荧光分子提供了理论依据.     

HIV-1逆转录酶的分子对接及运动功能相关性分析

目的研究逆转录酶的运动性和生理功能的关系,以及N-乙酰基-β-芳基-1,2-二脱氢乙胺类衍生化合物与其的分子识别,方法采用高斯网络模型和各向异性网络模型研究了p66和p66-DNA的运动模式差异,并用分子对接方法研究化合物与逆转录酶的识别.结果 DNA的结合对p66各区域的运动方向影响不大,但其运动的幅度大大降低.分子对接结果发现Y115和M184的疏水结构在识别的过程中起到重要作用.结论基于各个区域的运动方向分析,推测手指区和RNase H区的开合运动可能是逆转录酶发挥逆转录功能的重要原因.并且,N-乙酰基-β-芳基-1,2-二脱氢乙胺类衍生化合物的N-甲基取代和反式的双键结构更有利于与逆转录酶的识别     

Fullrmc,a rigid body reverse monte carlo modeling package enabled with machine learning and artificial intelligence

A new Reverse Monte Carlo (RMC) package “fullrmc” for atomic or rigid body and molecular, amorphous, or crystalline materials is presented. fullrmc main purpose is to provide a fully modular, fast and flexible software, thoroughly documented, complex molecules enabled, written in a modern programming language (python, cython, C and C++ when performance is needed) and complying to modern programming practices. fullrmc approach in solving an atomic or molecular structure is different from existing RMC algorithms and software. In a nutshell, traditional RMC methods and software randomly adjust atom positions until the whole system has the greatest consistency with a set of experimental data. In contrast, fullrmc applies smart moves endorsed with reinforcement machine learning to groups of atoms. While fullrmc allows running traditional RMC modeling, the uniqueness of this approach resides in its ability to customize grouping atoms in any convenient way with no additional programming efforts and to apply smart and more physically meaningful moves to the defined groups of atoms. In addition, fullrmc provides a unique way with almost no additional computational cost to recur a group's selection, allowing the system to go out of local minimas by refining a group's position or exploring through and beyond not allowed positions and energy barriers the unrestricted three dimensional space around a group. © 2016 Wiley Periodicals, Inc.