nbody_sh1p.tar

多种算法实现链表的排序，可以更具需要进行适当该表计算哦，是基础了，欢迎同在学习的伙伴一起努力哦~ 数据结构实验

使用二进制PSO解决0-1背包问题的MATLAB程序(The use of PSO to solve 0-1 knapsack problem)

应用背景并行计算是最近新兴的一门技术，但是关于并行计算的代码在现在还不是特别普遍。本文是关于折半插入排序的并行计算的应用，希望对您的学习有一定的帮助。关键技术并行计算，多线程，折半插入排序，加速比，并行，串行

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

一本将基于近邻传播算法的半监督聚类的算方法书.对于聚类研究的很有帮助(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. )

格子Boltzmann方法 格子Boltzmann方法是为了保留格子气自动机方法的优点，克服其缺点而发展起来的方法。 特别是1992年，钱跃弘、陈十一等的开创性工作(提出LBGK模型方法)，使该方法广泛地应用到计算流体力学(单相流、多相流、多孔介质流、热对流、磁流体、反应-扩散等)。 (Lattice Boltzmann method of lattice Boltzmann method is to retain the lattice gas automata method has the advantage to overcome its shortcomings and has developed methods. Especially in 1992, Qian Yue-hong, Chen XI, such as the pioneering work (LBGK model proposed method), so that the method widely used in computational fluid dynamics (single-phase flow, multiphase flow, porous media flow, thermal convection, magnetic fluid, the reaction- the proliferation, etc.).)

设计MPI程序模拟广播（MPI_Bcast）操作：将每个MPI进程按照所在节点名称建立node通信子域分组；再将各个node子通信域的0号进程再次组成一个名为head的通信域；在进行广播时，首先，由root进程将消息在head通信子域内广播，然后，再由head子域内各进程在其所在的node子域内进行广播。(Design the MPI program MPI_Bcast operation: Each MPI process establishes a node communication sub-domain grouping according to the node name; then, each process of the 0 node of each node sub-communication domain is again formed into a communication domain named head; At first, the root process broadcasts the message in the head communication sub-domain, and then the processes in the head sub-domain broadcast in the node sub-domain where it is)

Provide basic stack dumping functions

cuda官方代码，关于数据拷贝的带宽测试(cuda official code, copy data bandwidth on test)

研究多目标遗传算法的优化，包含遗传算法过程中涉及的的各个步骤，非常适合于研究遗传算法及对遗传算法进行多目标优化的同学