CommodityDataTool1

用于fluent脉冲热源边界条件的udf(UDF for the boundary condition of fluent pulse heat source)

Leader election for the MPI the Peterson algorithm

说明：  利用罚函数计算min X1^2+X2^2 s.t. 2X1-X2≤7 X1^2+3X2^2=2(Penalty function calculation)

提出了一种以目标函数变化量作为评价函数的改进禁忌搜索算法,并进行了理论分析,然后将其与有效禁忌搜索算法作了性能比较。通过比较三个公共测试数据集的计算结果,验证了本文提出的禁忌搜索算法的可行性和有效性。(Proposed a change in the objective function as the evaluation function of the improved tabu search algorithm, and has carried on the theoretical analysis, then made a performance comparison with tabu search algorithm is effective. By comparing the calculation results of three test data set, and verified the feasibility and effectiveness of the proposed tabu search algorithm.)

PSo代码如何提供鼠标点击和帮助请用代码dcscsdcccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc

此程序包的矩阵求逆函数基于 CUDA 的实现包含对称的积极明确逆矩阵使用 GPU。用法，请参阅 testspd.cpp 中的示例。此外，一般块矩阵求逆通过高斯(pivotting) 没有消除。请参阅 testge.cpp 例如使用。注： GE 可能无法在单精度足够稳定。请参阅生成文件更改为双精度。

一本将基于近邻传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助(Abstract: A semi-supervised clustering method based on affinity propagation (AP) algorithm is proposed in this paper. AP takes as input measures of similarity between pairs of data points. AP is an efficient and fast clustering algorithm for large dataset compared with the existing clustering algorithms, such as K-center clustering. But for the datasets with complex cluster structures, it cannot produce good clustering results. It can improve the clustering performance of AP by using the priori known labeled data or pairwise constraints to adjust the similarity matrix. Experimental results show that such method indeed reaches its goal for complex datasets, and this method outperforms the comparative methods when there are a large number of pairwise constraints. )

Mapreduce实现的TF-IDF词频统计分析，可以直接运行于HADOOP环境下，适合初学者。(Realization Mapreduce TF-IDF, word frequency statistics, can be run directly in the the under HADOOP environment, suitable for beginners.)

并行图像细化算法和C代码实现，希望对大家有用(parallel image thinning algorithm and C code to achieve the hope that it may be useful to)

--概述： 变形两个图像的位图或影片剪辑的序列作为输出结果。 硬件要求： 此示例需要 DirectX 11 能够卡，如果没有检测到示例将使用 DirectX 11 参考模拟器。 -软件要求： 从 http://msdn.microsoft.com 安装 Visual Studio 2012