-
chuizhi
说明： 垂直发射弹道仿真程序(采用四元数法).matlab编写。(Vertical launch trajectory simulation program (using the quaternion method). Matlab prepared.)
- 2021-01-01 15:28:58下载
- 积分：1
-
momentum
Matlab策略之动量策略，根据前P个月的收益率，选取股票收益率最高和最低的组合买入，并持有Q个月(Matlab strategy momentum strategies, based on the previous month yields P, select the highest and the lowest stock returns a combination of buy and hold Q Months)
- 2021-02-07 22:29:55下载
- 积分：1
-
SVMNR
支持向量机的非线性回归预测，得到回归方程的参数，可进行预测(Nonlinear regression predicting support vector machine regression equation obtained parameters can be predicted)
- 2014-08-28 18:06:04下载
- 积分：1
-
complex_for_file_ex_4
优化算法，用于多目标非线性函数在约束条件下的求解，经典算法simplex演变而来(Optimization algorithm for solving multi-objective nonlinear function under constraints, the classical algorithm simplex evolved)
- 2012-11-28 10:53:32下载
- 积分：1
-
051ljy
利用MATLAB设计的小型数字图像处理系统(MATLAB design of small-scale use of digital image processing system)
- 2009-04-18 16:56:47下载
- 积分：1
-
tsp
模拟退火算法的解决 具体在mATlab实现算法 (matlab)
- 2009-07-12 10:20:39下载
- 积分：1
-
Gauss-Legendre-quadrature
说明： 任意三角形上的任意阶Gauss积分程序
算法详见参考文献
H.T. Rathod, K.V. Nagaraja, B. Venkatesudu, N.L. Ramesh, Gauss Legendre quadrature over a triangle, J. Ind. Inst. Sci. 84 (2004)
183–188.(Gauss Legendre quadrature over any triangle)
- 2021-04-27 18:48:44下载
- 积分：1
-
cuedsid1_june_02
test for modal analysis
- 2012-05-27 15:23:23下载
- 积分：1
-
sub_pass.tar
根据公汽线路信息数据，编写对任意车站，寻找通过该站的汽车线路的M文件；
（3）编写M文件，对任意两个车站m,n，判断是否有线路通过这两车站，若有则编写寻找通过该站的汽车线路的M文件
（4）对任意两个车站m,n，若没有线路直接通过这两车站，编写通过一次转车而到达两站的M文件
(According to the bus line information and data to write on any station to find the M-file line through the station car (3) the preparation of the M-file, any two stations m, n, determine whether the line through these two stations, if write to find the M-file line through the station car (4) any two stations m, n, if there is no line directly through the two stations, the preparation time to change trains to reach the M-file of the two stations)
- 2012-07-03 21:28:27下载
- 积分：1
-
Floyd
从任意一条单边路径开始。所有两点之间的距离是边的权，或者无穷大，如果两点之间没有边相连。 2，对于每一对顶点 u 和 v，看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。 3，不可思议的是，只要按排适当，就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
- 2011-09-02 23:33:33下载
- 积分：1
