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

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

来自磁光阱中冷原子团的荧光干涉条纹及其应用

实验观察来自磁光阱中冷原子团的荧光经真空系统窗口的平板玻璃反射产生的干涉条纹，理论分析表明从从荧光干涉条纹的强度分布可获得关于俘获原子总数以及密度分布的信息。采用该方法实测了俘获原子总数，并模拟得到了不同密度分布时条纹的对比度变化。     

Large scale petroleum reservoir simulation and parallel preconditioning algorithms research

Solving large scale linear systems efficiently plays an important role in a petroleum reservoir simulator, and the key part is how to choose an effective parallel preconditioner. Properly choosing a good preconditioner has been beyond the pure algebraic field. An integrated preconditioner should include such components as physical background, characteristics of PDE mathematical model, nonlinear solving method, linear     

一种简易云雾室的制作

本文利用自制云雾室把微观粒子的运动转化为宏观现象，从而供实验观察和研究。     

BEPC中电子云导致的束团横向尺寸增长研究

多束团正电子储存环中可能发生电子云不稳定性. 由于电子云导致的束团横向尺寸增长已经成为提高对撞机对撞亮度的主要限制因素之一. 介绍了在BEPC储存环中, 利用条纹相机直接测量由于电子云导致的束团横向尺寸增长结果, 并与模拟计算进行了比较.     

清华物理系量子信息研究的新进展

在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验.     

A two-stage parallel branch and bound algorithm for mixed integer programs

Mixed integer programming (MIP) models are extensively usedto aid strategic and tactical decision making in many businesssectors. Solving MIP models is a computationally intensive processand there is a need to develop solution approaches that enablelarger models to be solved within acceptable timeframes. Inthis paper, we describe the implementation of a two-stage parallelbranch and bound (PB & B) algorithm for MIP. In stage 1of the algorithm, a multiple heuristic search is implementedin which a number of alternative search trees are investigatedusing a forest search in the hope of finding a good solutionquickly. In stage 2, the search is reorganized so that the branchesof a chosen tree are investigated in parallel. A new heuristicis introduced, based on a best projection criterion, which evaluatesalternative B & B trees in order to choose one for investigationin stage 2 of the algorithm. The heuristic also serves as away of implementing a quality load balancing scheme for stage2 of the algorithm. The results of experimental investigationsare reported for a range of models taken from the MIPLIB libraryof benchmark problems.     

A comparison of two algorithms for the assignment problem

State-of-the-art computational results have shown that the shortest augmenting path (SAP) methods are more efficient than other primal-dual and primal-simplex based methods for solving the linear assignment problem on uniprocessor computers. There is, however, some controversy concerning their merits when compared with Bertsekas' auction algorithm on multiprocessor computers. In this study we investigate the performance of these competing methods on the Alliant FX/8. For each method, theoretical motivation, sources of parallelism and computational results are presented.     

Solving large-scale semidefinite programs in parallel

We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously possible, and acceptable parallel scalability on sufficiently large problems. This work was supported in part by NSF grants DMS-0215373 and DMS-0238008.     

利用富铈混合稀土改善工业纯铝中富铁相形貌的研究

利用金相分析方法研究了富Ce混合稀土变质对含不同Fe量的工业纯铝的组织和其中富铁相形貌的影响。试验结果表明,随着Fe含量的增加,富铁相由弥散细小的颗粒状向短棒状、长针状转变;富Ce混合稀土变质使铝中的富铁相由长针状变为弥散细小的颗粒状。随着稀土含量的增加,-αAl晶粒逐渐细化,富铁相尺寸及数量逐渐减小。添加0.5%稀土时,-αAl晶粒细化效果最佳,而且富铁相呈细小颗粒状均匀分布在-αAl基体的晶界处。本文还对稀土改善富铁相的机制进行了分析。