游客情感计算的文本大数据挖掘方法比较研究

旅游文本大数据以其方便、快捷和低门槛的特点为游客情感计算提供了极大便利，已经成为旅游大数据的主要来源之一。基于大数据理论和情感理论，以文本大数据为数据源，在全面梳理国内外情感计算相关成果的基础上，利用人工智能中的逻辑/算法编程方法、机器学习方法、深度学习方法对旅游文本大数据进行挖掘，探索最佳的基于文本大数据的游客情感计算方法。研究发现：（1）基于情感词典的游客情感计算模型，其核心是构建情感词典和设计情感计算规则，方法简单，容易实现，适用语料范围广。（2）机器学习，用统计学方法抽取文本中的特征项，具有非线性特征，可靠性较线性特征的情感词典方法高。（3）基于深度学习技术的游客情感计算，效果良好，准确率在85%以上。训练多领域的文本语料易于移植，实用性强，且泛化能力好，较适合大数据时代游客情感计算研究。     

An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Network analysis based on low-rank method for mining information on integrated data of multi-cancers

The noise problem of cancer sequencing data has been a problem that can’t be ignored. Utilizing considerable way to reduce noise of these cancer data is an important issue in the analysis of gene co-expression network. In this paper, we apply a sparse and low-rank method which is Robust Principal Component Analysis (RPCA) to solve the noise problem for integrated data of multi-cancers from The Cancer Genome Atlas (TCGA). And then we build the gene co-expression network based on the integrated data after noise reduction. Finally, we perform nodes and pathways mining on the denoising networks. Experiments in this paper show that after denoising by RPCA, the gene expression data tend to be orderly and neat than before, and the constructed networks contain more pathway enrichment information than unprocessed data. Moreover, learning from the betweenness centrality of the nodes in the network, we find some abnormally expressed genes and pathways proven that are associated with many cancers from the denoised network. The experimental results indicate that our method is reasonable and effective, and we also find some candidate suspicious genes that may be linked to multi-cancers.     

基于加权流量介数中心性的路网脆弱性分析——以无锡市为例

针对当前路网脆弱性研究中缺乏对真实交通状况考量的问题，在复杂网络理论的基础上，结合交通流量信息，提出了基于加权流量介数中心性的路网脆弱性分析方法。首先计算路网拓扑抽象图中各节点的最短路径介数中心性，然后使用流量数据对相应区域最短路径介数中心性加权，综合得到最终的脆弱性指标结果。以无锡市为例，对其实际交通路网脆弱性进行了计算，结果表明，该方法能综合反映静态全局路网结构与动态局部通行信息和现实交通情景下的路网脆弱性。     

Existence of solutions for a higher-order semilinear parabolic equation with singular initial data

We establish the existence of solutions of the Cauchy problem for a higher-order semilinear parabolic equation by introducing a new majorizing kernel. We also study necessary conditions on the initial data for the existence of local-in-time solutions and identify the strongest singularity of the initial data for the solvability of the Cauchy problem.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Enhancing signal-to-noise ratio and resolution in low-field NMR relaxation measurements using post-acquisition digital filters

The traditional way to enhance signal-to-noise ratio (SNR) of nuclear magnetic resonance (NMR) signals is to increase the number of scans. However, this procedure increases the measuring time that can be prohibitive for some applications. Therefore, we have tested the use of several post-acquisition digital filters to enhance SNR up to one order of magnitude in time domain NMR (TD-NMR) relaxation measurements. The procedures were studied using continuous wave free precession (CWFP-T₁) signals, acquired with very low flip angles that contain six times more noise than the Carr–Purcell–Meiboom–Gill (CPMG) signal of the same sample and experimental time. Linear (LI) and logarithmic (LO) data compression, low-pass infinity impulse response (LP), Savitzky–Golay (SG), and wavelet transform (WA) post-acquisition filters enhanced the SNR of the CWFP-T₁ signals by at least six times. The best filters were LO, SG, and WA that have high enhancement in SNR without significant distortions in the ILT relaxation distribution data. Therefore, it was demonstrated that these post-acquisition digital filters could be a useful way to denoise CWFP-T₁, as well as CPMG noisy signals, and consequently reducing the experimental time. It was also demonstrated that filtered CWFP-T₁ method has the potential to be a rapid and nondestructive method to measure fat content in beef and certainly in other meat samples.     

利用带无标签数据的双支持向量机对恒星光谱分类

恒星光谱分类是天文技术与方法领域一直关注的热点问题之一。随着观测设备持续运行和不断改进，人类获得的光谱数量与日俱增。这些海量光谱为人工处理带来了极大挑战。鉴于此，研究人员开始关注数据挖掘算法，并尝试对这些光谱进行数据挖掘。近年来，神经网络、自组织映射、关联规则等数据挖掘方法广泛应用于恒星光谱分类。在这些方法中，支持向量机(SVM)以其强大的学习能力和高效的分类性能而备受推崇。SVM的基本思想是试图在两类样本之间找到一个最优分类面将两类分开。SVM在求解时，通过将其最优化问题转化为具有(QP)形式的凸问题，进而得到全局最优解。尽管该方法在实际应用中表现优良，但为了进一步提高其分类能力，有的学者提出双支持向量机(TSVM)。该方法通过构造两个非平行的分类面将两类分开，每一类靠近某个分类面，而远离另一个分类面。TSVM的计算效率较之传统SVM提高近4倍，因此，自TSVM提出后便受到研究人员的持续关注，并出现若干改进算法。在恒星光谱分类中，一般分类算法都是根据历史观测光谱来建立分类模型，其中最关键的是对光谱进行人工标注，这项工作极为繁琐，且容易犯错。如何利用已标记的光谱以及部分无标签的光谱来建立分类模型显得尤为重要。因此，提出带无标签数据的双支持向量机(TSVMUD)用以实现对恒星光谱智能分类的目的。该方法首先将光谱分为训练数据集和测试数据集两部分；然后，在训练集上进行学习，得到分类依据；最后利用分类依据对测试集上的光谱进行验证。继承了双支持向量机的优势，更重要的是，在训练集上学习分类模型过程中，不仅考虑有标记的训练样本，也考虑部分未标记的样本。一方面提高了学习效率，另一方面得到更优的分类模型。在SDSS DR8恒星光谱数据集上的比较实验表明，与支持向量机SVM、双支持向量机TSVM以及K近邻(KNN)等传统分类方法相比，带无标签数据的双支持向量机TSVMUD具有更优的分类能力。然而，该方法亦存在一定的局限性，其中一大难题是其无法处理海量光谱数据。该工作将借鉴海量数据随机采样思想，利用大数据处理技术，来对所提方法在大数据环境下的适应性展开进一步研究。