团簇Co3FeP异构化反应的热力学与动力学研究

为了寻找团簇Co₃FeP的稳定性、结构和内部作用力等规律，利用密度泛函理论，在B3LYP/Lanl2dz的量化水平下对团簇Co₃FeP进行理论计算，得到5种优化构型，并从化学反应热力学与动力学的角度对其异构化反应中的反应物、过渡态和生成物进行了讨论分析。结果表明，所有构型均为C1对称且构型的空间结构对其熵值有影响；构型的稳定性主要由金属原子与非金属原子所决定，并且在常温常压下构型1^（3）、2^（3）和3^（3）可以稳定存在，是大部分异构化反应的最终产物。因此，在实际材料的开发中，不仅需要注意金属原子与非金属原子之间的作用力以确保构型的稳定性，还应首先考虑对稳定构型1^（3）、2^（3）和3^（3）进行相关研究。     

基于联合违约概率的资产组合投资优化方法

投资组合的资产联合违约概率(joint,probability of default,JPoD)是一种有效的系统风险测度工具.基于JPoD分析,提出了一种新的资产组合选择优化方法,即通过计算资产池中每两种资产的JPoD值得到JPoD矩阵,利用遍历算法逐次筛选,得出具有最小系统风险的多资产组合.实证分析首先利用2014 2015年的上证综指和深证成指数据验证了JPoD方法的有效性;其次,分别利用中国股票市场数据和美国股票市场数据将所提出的资产组合选择方法与马科维茨均值-方差组合理论、随机组合方法进行比较,结果表明无论是在中国股票市场还是美国股票市场,JPoD方法都明显优于其他两种方法.     

Hybrid SVM／HMM Method for Face Recognition

A face recognition system based on Support Vector Machine(SVM) and Hidden Markov Model (HMM) has been proposed. The powerful discriminative ability of SVM is combined with the temporal modeling ability of HMM. The output of SVM is moderated to be probability output, which replaces the Mixture of Gauss (MOG) in HMM. Wavelet transformation is used to extract observation vector, which reduces the data dimension and improves the robustness.The hybrid system is compared with pure HMM face recognition method based on ORL face database and Yale face database. Experiments results show that the hybrid method has better performance.     

恒等式证明的概率模型法

本文利用建立概率模型,证明几个重要的恒等式。有些恒等式用常用的分析方法证明是很不易的,但建立了概率模型后,通过求概率或求数学期望,很方便地把恒等式证明出来。     

U-统计量尾概率级数的收敛性

本文对相当广泛的一类权函数和边界函数给出了U-统计量尾概率级数收敛的充分条件.     

组合期权交易策略的概率分析

在假定股票价格服从Ito过程条件下，讨论了采用组合期权交易策略的投资者获益的概率及损益的数学期望，得到了具体计算式，只要投资者获得相应数据，通过具体计算式加以计算，便可以为期权投资者提供数量上的重要参考依据，对期权投资者具有实用价值。     

LehmerDH数在模p剩余系的分布

设 p≥ 3为素数 ,集合A ={a|1≤a 相似文献   

Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms

In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance andWilliams’ formula which enables the implementation of the algorithm in a recursive way. The authors thank A. Arenas for discussion and helpful comments. This work was partially supported by DGES of the Spanish Government Project No. FIS2006–13321–C02–02 and by a grant of Universitat Rovira i Virgili.