-
5902930-Computer-Graphics
computer graphics on matlab
- 2010-12-14 19:10:38下载
- 积分：1
-
matlab-fir
用窗函数法设计FIR数字滤波器，能熟悉矩形窗、海宁窗、汉明窗和布莱克曼窗。掌握用上述窗函数法设计FIR数字滤波器的原理和方法。熟悉线性相位FIR数字滤波器特性。了解各种窗函数对滤波特性的影响。
(FIR window design with a digital filter function can be familiar with the rectangular window, Haining window, Hamming window and Blackman window. Master window function with the FIR digital filter design theory and methods. Familiar with linear phase FIR digital filter characteristics. Learn a variety of window function on the filter characteristics.)
- 2011-04-28 22:02:12下载
- 积分：1
-
Generator
Cluster generator。
By using this application it is possible to generate the well-known atomic clusters like Mackay-Icosahedron, Marks- and Ino-decahedrons and also fcc- and bcc-clusters.(Cluster generator。)
- 2012-04-27 13:52:12下载
- 积分：1
-
C---Cookbook
C ++ CODEBOOK 完整电子版，学习c++必备。(C++ CODEBOOK)
- 2015-01-23 17:20:13下载
- 积分：1
-
magic_and_Foc2
带参数的汽车轮胎公式模型，亲测可出图，可修改参数(Formula model of automobile tire with parameters can be plotted and parameters can be modified.)
- 2021-03-31 23:39:09下载
- 积分：1
-
NSGA-III
测试可以跑，根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个（原文献说最好与参考点个数相同）个体的初始种群，其中 N 是种群大小。接下来，算法进行迭代直至终止条件满足。在第 t 代，算法在当前种群 Pt的基础上，通过随机选择，模拟两点交叉（Simulated Binary Crossover，SBX）和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此，两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代，首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层（F1，F2等等）。然后，算法构建一个新的种群St，构建方法是从 F1开始，逐次将各非支配层的解加入到 St，直至 St的大小等于 N，或首次大于 N。假设最后可以接受的非支配层是 L层，那么在 L+ 1 层以及之后的那些解就被丢弃掉了，且 St FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取，选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)
- 2021-01-26 22:38:41下载
- 积分：1
-
Image-Classification
本文实现了09年CVPR的文章Linear Spatial Pyramid Matching using Sparse Coding for Image Classification(This package contains the Matlab codes implementing the ScSPM algorithm described in CVPR 09 paper
"Linear Spatial Pyramid Matching using Sparse Coding for Image Classification".
)
- 2013-09-22 19:16:03下载
- 积分：1
-
PSO
粒子群算法，也称粒子群优化算法（Particle Swarm Optimization），缩写为 PSO， 是近年来发展起来的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法。(Particle swarm optimization, also known as particle swarm optimization (Particle Swarm Optimization), abbreviated as PSO, is a new evolutionary algorithm developed in recent years (Evolutionary Algorithm- EA). Kind, and simulated annealing algorithm PSO algorithm is similar evolutionary algorithms, it is also starting a random solution, through an iterative search for the optimal solution, which is also used to uate the quality through fitness solution, but it is simpler than genetic algorithm rules It has no genetic algorithm " crossover" (Crossover) and " variant" (Mutation) operation, which by following the current search to find the optimal value to the global optimum. This algorithm is its easy implementation, high accuracy, fast convergence, etc. attracted academic attention and show its superiority in solving practical problems. PSO algorithm is a parallel algorithm.)
- 2015-01-18 20:38:17下载
- 积分：1
-
tfa
matlab关于自适应最优核程序,主要用于时域与频域的分析和计算(AOK in the matlab)
- 2013-05-14 15:45:22下载
- 积分：1
-
maple--introduction-book
maple introduction book
- 2015-04-05 12:55:33下载
- 积分：1
