MEASUREMENTS OF CHAIN INTERPENETRATION OF POLYMER GLASSES

The concept of entanglement provides the basis of our current understanding of the flow behavior of polymer melts, Current techniques developed to investigate the degree of interpenetration of polymer chains only provide indirectly the information of the degree of entanglement in a relatively large scale （several to tens of nanometer）. In this article, we report ^1H-NMR spectroscopy with dipolar filters under fast magic angle spinning for probing chain interpenetration of polymer glasses at the molecular level.     

Complete graph conjecture for inner-core electrons: homogeneous index case

The complete graph conjecture that encodes the inner-core electrons of atoms with principal quantum number n >or= 2 with complete graphs, and especially with odd complete graphs, is discussed. This conjecture is used to derive new values for the molecular connectivity and pseudoconnectivity basis indices of hydrogen-suppressed chemical pseudographs. For atoms with n = 2 the new values derived with this conjecture are coincident with the old ones. The modeling ability of the new homogeneous basis indices, and of the higher-order terms, is tested and compared with previous modeling studies, which are centered on basis indices that are either based on quantum concepts or partially based on this new conjecture for the inner-core electrons. Two similar algorithms have been proposed with this conjecture, and they parallel the two "quantum" algorithms put forward by molecular connectivity for atoms with n > 2. Nine properties of five classes of compounds have been tested: the molecular polarizabilities of a class of organic compounds, the dipole moment, molar refraction, boiling points, ionization energies, and parachor of a series of halomethanes, the lattice enthalpy of metal halides, the rates of hydrogen abstraction of chlorofluorocarbons, and the pED(50) of phenylalkylamines. The two tested algorithms based on the odd complete graph conjecture give rise to a highly interesting model of the nine properties, and three of them can even be modeled by the same set of basis indices. Interesting is the role of some basis indices all along the model.     

A study for quality evaluation of Taxilli Herba from different hosts based on fingerprint-activity relationship modeling and multivariate statistical analysis

In this study, a fingerprint-activity relationship modeling between chemical fingerprints and antirheumatic activity was established, and multivariate statistical analysis was used to evaluate the quality of Taxilli Herba (TH) from different hosts. Characteristic fingerprints of 20 batches of TH samples were generated by high-performance liquid chromatography coupled with triple quadrupole-time of flight tandem mass spectrometry (HPLC-Triple TOF-MS/MS), and the similarity analysis was calculated based on thirteen common characteristic peaks by hierarchical clustering analysis (HCA). Subsequently, nine efficacy markers were discovered by combining fingerprints and antirheumatic activity through grey correlation analysis (GCA) and bivariate correlation analysis (BCA). Meanwhile, the content of 5 constituents in 9 markers was determined by high-performance liquid chromatography coupled with triple quadrupole-linear ion trap tandem mass spectrometry (HPLC-QTRAP-MS/MS). The comprehensive quality of TH was assessed using multivariate statistical analysis, including principal components analysis (PCA) and technique for order preference by similarity to ideal solution (TOPSIS). The results showed that a high dose of TH extract could markedly ameliorate arthritis damage compared to other doses, with flavonoids playing an important role in the antirheumatic activity. The comprehensive quality of samples from Morus alba L. (SS) was superior to those from Liquidambar formosana Hance (FXS). The present study will demonstrate the markers associated with efficacy, and provide an applicable strategy for more comprehensive quality control and evaluation of TH.     

脂肪胺结构与密度和折光指数关系的探讨

本文用拓扑方法探讨了脂肪胺的密度和折光指数与其分子结构之间的关系。提出一个既适用于密度又适用于折光指数的定量关系。应用这一定量关系, 不仅能够描述脂肪胺密度和折光指数的变化规律。预测脂肪胺的密度和折光指数,而且能够合理表征物质结构与性能之间的关系。     

Net information measures for modified Yukawa and Hulthén potentials

The dimensional analyses of the position and momentum variances‐based quantum mechanical Heisenberg uncertainty measure, as well as the entropic information measures given by the Shannon information entropy sum and the product of Fisher information measures are carried out for two widely used nonrelativistic isotropic exponential‐cosine screened Coulomb potentials generated by multiplying the superpositions of (i) Yukawa‐like, ?Z(e^?μr/r), and (ii) Hulthén‐like, ?Zμ(1/(e^μr ? 1)), potentials by cos(bμr) followed by addition of the term a/r², where a and b ≥ 0, μ are the screening parameters and Z, in case of atoms, denotes the nuclear charge. Under the spherical symmetry, all the information measures considered are shown to be independent of the scaling of the set [μ, Z] at a fixed value of μ/Z, a, and b and the other parameters defining the superpositions of the potentials. Numerical results are presented, which support the validity of the scaling properties. © 2007 Wiley Periodicals, Inc. Int J Quantum Chem, 2007     

Exact solution of the Boltzmann equation in the homogeneous color conductivity problem

An exact solution of the Boltzmann equation for a binary mixture of colored Maxwell molecules is found. The solution corresponds to a nonequilibrium homogeneous steady state created by a nonconservative external force. Explicit expressions for the moments of the distribution function are obtained. By using information theory, an approximate velocity distribution function is constructed, which is exact in the limits of small and large field strengths. Comparison is made between the exact energy flux and the one obtained from the information theory distribution.     

An open optimization problem in statistical quality control

We ask the experts in global optimization if there is an efficient solution to an optimization problem in acceptance sampling: Here, one often has incomplete prior information about the quality of incoming lots. Given a cost model, a decision rule for the inspection of a lot may then be designed that minimizes the maximum loss compatible with the available information. The resulting minimax problem is sometimes hard to solve, as the loss functions may have several local maxima which vary in an unpredictable way with the parameters of the decision rule.     

关于两两NQD列的若干极限性质

本文讨论了两两ＮＱＤ列的Ｍａｒｃｉｎｋｉｅｗｉｃｚ型弱大数律及Ｊａｍｉｓｏｎ型加权和的强稳定性，指出了两两ＮＱＤ列与独立列的一个本质性区别，从而提出了解决两两ＮＱＤ旬几乎处处收敛和完全收敛的一种方式。     

Information Shift Dynamics Described by Tsallis q = 3 Entropy on a Compact Phase Space

Recent mathematical investigations have shown that under very general conditions, exponential mixing implies the Bernoulli property. As a concrete example of statistical mechanics that are exponentially mixing we consider the Bernoulli shift dynamics by Chebyshev maps of arbitrary order N≥2, which maximizes Tsallis q=3 entropy rather than the ordinary q=1 Boltzmann-Gibbs entropy. Such an information shift dynamics may be relevant in a pre-universe before ordinary space-time is created. We discuss symmetry properties of the coupled Chebyshev systems, which are different for even and odd N. We show that the value of the fine structure constant αel=1/137 is distinguished as a coupling constant in this context, leading to uncorrelated behaviour in the spatial direction of the corresponding coupled map lattice for N=3.     

The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data

Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influence of edges, this paper proposes a self-information weighting-based method to rank all nodes in graph data. In the first place, the graph data are weighted by regarding the self-information of edges in terms of node degree. On this base, the information entropy of nodes is constructed to measure the importance of each node and in which case all nodes can be ranked. To verify the effectiveness of this proposed ranking method, we compare it with six existing methods on nine real-world datasets. The experimental results show that our method performs well on all of these nine datasets, especially for datasets with more nodes.