资源列表
attemper
- 使用动态规划的方法求接出怎样在两条装配线上以最快的时间完成装配任务-The use of dynamic programming methods for how to access the assembly line in the two shortest time to complete the assembly task
2polindrom
- A palindrome is a string which reads the same from the beginning to the end than from the end to the beginning (whitespaces are not considered). Implemented a function to check whether a given string is a palindrome.
Reader
- 读取文档，将文档中的字符串转化为数组存储。用于解析文件-Read the document, the document string into an array of storage. Used to resolve file
pn_gen
- PN-Generaot based on linear shift registers.
anticlock
- anticlock is a software used to print the binary tree anticlockwise
2
- 已有a、b亮光链表，每个链表中的结点包括学好、成绩。要求把两个链表合并，按学号升序排列。 -Have a, b light list, each node in the list, including learn, results. Required to merge the two lists, in ascending order by student number.
3
- 3.1 最长公共子序列问题 最长公共子序列（动态规划） 实验数据：input.txt X={A,B,C,B,D,A,B} Y={B,D,C,A,B,A} ——要求给出X、Y的最长公共子序列Z，程序运行结束时，将计算结果输出到文件output.txt中。输出文件中包含问题的答案：找不到公共子序列时给出“null” 。 -3.1 the longest common subsequence problems longest common subsequence (dynam
OMP
- 用于压缩感知的正交匹配追踪算法，是一种贪婪算法，已经成功实现。-OMP algorithm for compressive sensing
feature_extraction
- function [ff] = featurextraction(Broi,I), where Broi is a binary mask of the grayscale image I. The resut ff is a matrix containg the glcm and lbp features of the image I over the binary mask.
tTest
- T检验，用于差异表达基因的筛选，参数可以自行设置-T test
m
- 基于RFE-SVM进行两类的特征提取算法，能够提取出最佳的变量，已经经过测试，绝好的算法-two kinds of feature extraction algorithm based on RFE-SVM, it can extract the best variables,it has been tested,it is the best algorithm
kuan去除相干斑
- 经典的KUAN算法，可以用来去除SAR图像中的相干斑噪声，修改加载的图片路径后可以直接运行。