Blocked crystallization in capped ultrathin polymer films studied by molecular simulations

The crystallization of capped ultrathin polymer films is closely dependent on film thickness and interfacial interaction. Using dynamic Monte Carlo simulations, the crystallization behaviors of polymer films confined between two substrates were investigated. The crystallization rate of confined polymers is reduced with high interfacial interactions. Above a critical strength of interfacial interaction, polymer crystallization in the thin film is inhibited within the simulation time scales. An increase in film thickness leads to a rise in critical interfacial interaction. In thicker films, the chains have more space to change conformation to form crystal stems. In addition, there are fewer absorbed segments in confined chains for the thicker films, and thus the chains have stronger ability to adjust their conformation. Therefore an increase in film thickness can cause a reduction in the entropic barrier required for the formation of crystals and thus an increase in the critical interfacial interaction. © 2018 Society of Chemical Industry     

论携号转网行为的私法规制

以电信用户入网协议为切入点,电信用户的携号转网行为应受到《合同法》《消费者权益保护法》等私法规范的保护与限制。该行为引起的格式条款解释、合同终止、违约责任、损失赔偿等问题,不能仅靠《电信条例》等公法规范来调整。应当积极引导广大消费者用户以私法领域相关规定为依据,转变争议解决思维,拓宽纠纷处理途径,合理选择维权手段,以保护自身合法民事权益,与行业监管部门共同推动电信行业有序发展。     

基于深度信念网络的列车故障音频诊断方法

铁路在交通运输行业有着举足轻重的地位，一旦列车发生故障将会导致严重的生命财产损失。由于列车发生故障的概率相对较低，因此难以捕获列车的故障样本。针对上述问题，提出了一种无监督学习的列车故障识别方法，通过检测列车音频信号来识别列车故障。该方法基于深度信念网络(DBN)，利用小波包分解提取检测信号的特征向量并将其作为DBN的输入，待网络充分训练后，由训练好的DBN识别当前列车的运行状况。现场监测实验结果表明，该方法能够在无监督的条件下有效识别列车故障，保障了列车的运行安全。     

社交网络中基于网络结构支撑模型的谣言传播研究

结合结构支撑理论，探究节点网络结构支持力的一些性质，提出了社交网络结构中的全网支持力和被支持力的总量一致性，并进一步提出计算节点支持力的方法。谣言作为特殊信息，在支持力不同节点之间的传播特性有所不同，借鉴随机游走模型中的PageRank计算方法，对不同节点支持力的谣言传播以及传播后的辟谣状况进行了仿真模拟，结果表明支持力不同的节点对于谣言传播和辟谣影响明显。     

Exactly satisfying initial conditions neural network models for numerical treatment of first Painlevé equation

In this paper, novel computing approach using three different models of feed-forward artificial neural networks (ANNs) are presented for the solution of initial value problem (IVP) based on first Painlevé equation. These mathematical models of ANNs are developed in an unsupervised manner with capability to satisfy the initial conditions exactly using log-sigmoid, radial basis and tan-sigmoid transfer functions in hidden layers to approximate the solution of the problem. The training of design parameters in each model is performed with sequential quadratic programming technique. The accuracy, convergence and effectiveness of the proposed schemes are evaluated on the basis of the results of statistical analyses through sufficient large number of independent runs with different number of neurons in each model as well. The comparisons of these results of proposed schemes with standard numerical and analytical solutions validate the correctness of the design models.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

Synthesis and Characterization of Co Nanocomposite Based on Poly(benzimidazole-amide) Matrix and Their Behavior as Catalyst in Oxidation Reaction

2,6-Bis(5-amino-1H-benzimidazol-2-yl)pyridine was prepared and characterized by Fourier transform infrared spectroscopy, elemental analysis, ¹H-NMR, and ¹³C-NMR spectroscopic methods. Then a new poly(benzimidazole-amide) was synthesized by polymerization of the corresponding diamine and isophthalic acid. The obtained poly(benzimidazole-amide) exhibited good yield and high thermal stability. Due to the existence of benzimidazole moieties in polymer’s structure, it has the tendency to form complexes with metal ions. So, a new poly(benzimidazole-amide)/Co nanocomposite was prepared. Morphological studies revealed that metal nanoparticles were dispersed in the polymer matrix without any aggregation. poly(benzimidazole-amide)/Co nanocomposite was used as a catalyst in the oxidation of ethyl benzene to acetophenone with tert-butyl hydroperoxide.     

An integrated approach to analysing the cost efficiency of postal networks

An integrated approach to measure the cost efficiency of the postal network of Universal Service Provider is proposed. An integrated approach enables the measurement of cost efficiency for delivery and non-delivery postal network units. The proposed approach is verified and tested on the postal network of the selected provider and the results were derived by using Data Envelopment Analysis (DEA). The results show that the main sources of inefficiency are inadequate allocation of resources relative to the network units. In addition, the study indicates that economies of scale have a positive impact on the efficiency of postal network units.     

Simultaneous synthesis of a heat exchanger network with multiple utilities using utility substages

Heat exchanger network synthesis (HENS) has progressed by using mathematical programming-based simultaneous methodology. Although various considerations such as non-isothermal mixing and bypass streams are applied to consider real world alternatives in modeling phase, many challenges are faced because of its properties within non-convex mixed-integer nonlinear programming (MINLP). We propose a modified superstructure, which contains a utility substage for use in considering multiple utilities in a simultaneous MINLP model. To improve model size and convergence, fixed utility locations according to temperature and series connections between utilities are suggested. The numbers of constraints, discrete, and continuous variables show that overall model size decreases compared with previous research. Thus, it is possible to expand the feasible search area for reaching the nearest global solution. The model's effectiveness and applications are exemplified by several literature problems, where it is used to deduce a network superior to that of any other reported methodology.