给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum tot

对滤波器耦合矩阵中的极点和零点位置进行编程，以求出表示零点极点的多项式-Coupling matrix of the filter pole and zero position programming has been calculated F (w) E (w) polynomial

介绍了时域有限差分(FDTD) 法的基本原理, 推导了二维TM 模Yee 算法的FDFD 表达式, 并结合算例阐述了基于MA TLAB 编程的基本方法。-The basic p rincip le of FDTD w as introduced and the 22D TM mode FDTD arithmetic expression was derived. The p rogramm ing method based onMA TLAB w as illustrated w ith exa

谱聚类熵值排列通过求n 个二次规划问题，就可以求得相似度矩阵W，降低了谱聚类算法对参数的敏感性，使算法更稳定(Clustering Entropy Ranking By finding n quadratic programming problems, we can obtain the similarity matrix W, which reduces the sensitivity of the spectral clustering algorithm to the parameters

进一步采用基于距离和曲线形态的双尺度相似性度量谱聚类算法进行聚类处理，通过求n 个二次规划问题，就可以求得相似度矩阵W，降低了谱聚类算法对参数的敏感性，使算法更稳定(Furthermore, we use the two-scale similarity measure spectrum clustering algorithm based on distance and curve shape to carry out clustering. By finding n quadratic pr