************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast

详细表述了分数阶傅立叶变换的离散实现，将现有的算法进行比较。-In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that lters the bes

最小生成树之Prim算法 Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O(n^2) Prim算法实现： （1）集合：设置一个数组set(i=0,1,..,n-1),初始值为 0,代表对

Codes .M object detection with matlab. Create the list of detections D for the images referenced in the G list Tickets Detector File contains the address of the detector file, Xml extension G List of rectangles of objects that are really in