突出矿井瓦斯抽放限制影响因素的AHP-熵权法评价模型

为提高煤与瓦斯突出矿井瓦斯抽放效果,建立了3个一级指标、14个二级指标的突出矿井瓦斯抽放限制影响因素评价指标体系,利用AHP和熵权法分别确定指标因子主、客观权重.通过实地调研分析和反馈验证了AHP-熵权法的可行性和正确性,利用加权平均法确定评价模型的综合权重.研究表明:封孔方式、钻孔半径、抽放时间、煤体裂隙发育程度和抽放负压是目前影响煤矿瓦斯抽放效果的主控因素.     

The coupled-cluster formalism – a mathematical perspective

ABSTRACT

The Coupled-Cluster (CC) theory is one of the most successful high precision methods used to solve the stationary Schrödinger equation. In this article, we address the mathematical foundation of this theory with focus on the advances made in the past decade. Rather than solely relying on spectral gap assumptions (non-degeneracy of the ground state), we highlight the importance of coercivity assumptions – Gårding type inequalities – for the local uniqueness of the CC solution. Based on local strong monotonicity, different sufficient conditions for a local unique solution are suggested. One of the criteria assumes the relative smallness of the total cluster amplitudes (after possibly removing the single amplitudes) compared to the Gårding constants. In the extended CC theory the Lagrange multipliers are wave function parameters and, by means of the bivariational principle, we here derive a connection between the exact cluster amplitudes and the Lagrange multipliers. This relation might prove useful when determining the quality of a CC solution. Furthermore, the use of an Aubin–Nitsche duality type method in different CC approaches is discussed and contrasted with the bivariational principle.     

Maximal Subrings and Covering Numbers of Finite Semisimple Rings

We classify the maximal subrings of the ring of n×n matrices over a finite field, and show that these subrings may be divided into three types. We also describe all of the maximal subrings of a finite semisimple ring, and categorize them into two classes. As an application of these results, we calculate the covering number of a finite semisimple ring.     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.     

An inequality connecting entropy distance,Fisher Information and large deviations

In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.     

Small activation entropy bestows high-stability of nanoconfined D-mannitol

It has been a long-standing puzzling problem that some glasses exhibit higher glass transition temperatures(denoting high stability) but lower activation energy for relaxations(denoting low stability). In this paper, the relaxation kinetics of the nanoconfined D-mannitol(DM) glass was studied systematically using a high-precision and high-rate nanocalorimeter.The nanoconfined DM exhibits enhanced thermal stability compared to the free DM. For example, the critical cooling rate for glass formation decreases from 200 K/s to below 1 K/s; the Tg increases by about 20 K–50 K. The relaxation kinetics is analyzed based on the absolute reaction rate theory. It is found that, even though the activation energy E~*decreases,the activation entropy S~*decreases much more for the nanoconfined glass that yields a large activation free energy G~*and higher thermal stability. These results suggest that the activation entropy may provide new insights in understanding the abnormal kinetics of nanoconfined glassy systems.     

An Improved Composite Multiscale Fuzzy Entropy for Feature Extraction of MI-EEG

Motor Imagery Electroencephalography (MI-EEG) has shown good prospects in neurorehabilitation, and the entropy-based nonlinear dynamic methods have been successfully applied to feature extraction of MI-EEG. Especially based on Multiscale Fuzzy Entropy (MFE), the fuzzy entropies of the τ coarse-grained sequences in τ scale are calculated and averaged to develop the Composite MFE (CMFE) with more feature information. However, the coarse-grained process fails to match the nonstationary characteristic of MI-EEG by a mean filtering algorithm. In this paper, CMFE is improved by assigning the different weight factors to the different sample points in the coarse-grained process, i.e., using the weighted mean filters instead of the original mean filters, which is conductive to signal filtering and feature extraction, and the resulting personalized Weighted CMFE (WCMFE) is more suitable to represent the nonstationary MI-EEG for different subjects. All the WCMFEs of multi-channel MI-EEG are fused in serial to construct the feature vector, which is evaluated by a back-propagation neural network. Based on a public dataset, extensive experiments are conducted, yielding a relatively higher classification accuracy by WCMFE, and the statistical significance is examined by two-sample t-test. The results suggest that WCMFE is superior to the other entropy-based and traditional feature extraction methods.     

相关熵及其有限性的条件

就相关熵的性质进行了讨论，证明了在pp密度逼近中使用的作为“距离”的相关熵不满足距离定义中的第三个条件，并给出了三角不等式成立的条件。