Powell

1.支持文章，论坛，图片，flash，音乐，BT等采集. 2.增加自定文件采集.用户可采集网页中的所有文件. 3.采集内容替换功能，用户可设置替换规则进行替换. 4.支持所有文件远程保存到本地. 5.断点续采功能.不受意外关闭影响，重新启动后可继续采集 不重复. 6.支持多种CMS导库，本程序 与(科汛网站管理系统V2.2)整合在一起. 7.增加2级分类采集。适应各种网站采集. 8.缓存机制，在缓存中保存数据，操作常见动作，大量减少对数据库的增加，删除频繁的操作。 用户:admin 密码:admin -1. Support articles, forums, photos, flash, music, so BT acquisition. 2. an increase in fixed document collection. website users can collect all the documents. 3. content Acquisition replacement gong energy, users can set up rules to replace the replacement. 4. all documents supporting the preservation of the local long-distance. 5. Breakpoint continued mining function. not the closure affected by the accident, the restart will continue after acquisition will not repeat them. 6. CMS support for a variety of guided arsenals, this procedure (Section website flood management system V2.2) together. 7. two additional classification acquisition. Adapt site acquisition. 8. Cache mechanism, the preservation of data cache,

VB 连连看【网络版】源码，网络对战的实现是基于Winsock控件，游戏具备地图编辑模式、分数清零、游戏提示、重新排列、保存地图等功能，在监听的端口有连接请求发生时，立即调用Accept方法。游戏画面中的每个方块均采用一个Image控件来实现，有些麻烦了些，不过效果挺好。试玩了一下，别有一番风味。本连连看游戏源码支持二次开发，若你的水平足够高，完全可以继续开发完善。

说明：  测试函数：主要用于测试智能优化算法，如遗传算法、粒子群算法等的性能(Test function: it is mainly used to test the performance of intelligent optimization algorithms, such as genetic algorithm and particle swarm optimization algorithm)

说明：  One-Stage算法不需要Region Proposals阶段，可以直接产生物体的类别概率和位置坐标值，经过单次检测即可直接得到最终的检测结果。(The one stage algorithm does not need the region proposals stage, and can directly generate the category probability and position coordinate value of the object. After a single detection, the final detection result can be obtained directly.)

说明：  在图像加密过程中，对像素进行行列置乱时，用到的可以改变像素的位置。(In image encryption, row and column scrambling of pixels)

读入一个值n表示棋盘的大小，然后求出n*n格棋盘上放n皇后棋且不会相互吃掉对方的所有解答-Reading into a value of n, said the size of the chessboard, and then calculated n* n chessboard grid put n Queen s chess and will not eat each other all the answers

说明：  设计双通道线性相位或低延迟PR滤波器组。(Design the two-channel linear-phase or low-delay PR filter banks. Give the filter coefficients of the lowpass and highpass analysis filters, and plot their frequency responses, amplitude distortion and aliasing distortion.)

说明：  K-means算法是基于划分的思想，因此算法易于理解且实现方法简单易行，但需要人工选择初始的聚类数目即算法是带参数的。类的数目确定往往非常复杂和具有不确定性，因此需要专业的知识和行业经验才能较好的确定。而且因为初始聚类中心的选择是随机的，因此会造成部分初始聚类中心相似或者处于数据边缘，造成算法的迭代次数明显增加，甚至会因为个别数据而造成聚类失败的现象。(K-means algorithm is based on the idea of partitioning, so the algorithm is easy to understand and the implementation method is simple and feasible, but it requires manual selection of the initial number of clusters, that is, the algorithm is with parameters. The number of classes is often very complex and uncertain, so professional knowledge and industry experience are needed to better determine. Moreover, because the selection of initial clustering centers is random, some initial clustering centers will be similar or at the edge of data, resulting in a significant increase in the number of iterations of the algorithm, and even the phenomenon of clustering failure due to individual data.)

说明：  司守奎数学建模算法课件，简单易懂，用途广泛(Mathematical Modeling Algorithms Courseware)

说明：  旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)