资源列表
dbscan
- dbscan算法的实现，用C#环境开发实现 -dbscan
SampEn
- 通过matlab矩阵处理功能实现样本熵的快速计算。-By the matrix processing functions to achieve fast calculation of sample entropy
linelong
- 该程序是用于提取CAD中各多段线的长度，并以文本的形式输出数据-The program is used to extract the CAD polyline length, and output data in text form
SampEn
- 优化的样本熵程序，适合于描述时间序列的复杂度-Optimized procedures, suitable for describing the sequence of time complexity of sample entropy
GatherImpl
- 采集模块，实现上线和线下时，所用的时间，采用接口的方法实现-The acquisition module, on-line and offline, the time, the use of the interface
QPSK_BER
- DQPSK调制与解调后得到误码率曲线，与理论值很相近-DQPSK modulation and demodulation of the BER curves, very close to the theoretical value
mars_car_problem
- 这是一个用ruby写的经典火星车问题，其中包含了单元测试代码-This is a classic ruby write rover problem, which contains the unit test code
ex_7_11
- ABAQUS FORTRAN programming for random numerical process application
MultiThread2
- 很好的一款多线程实例哦 很适合初学者 里面有我精心准备的很多代码 简单实用-Good examples of a multi-threaded, oh it is suitable for beginners to have a lot of code inside my carefully prepared simple and practical
charnums
- 求一个字符串中连续出现的次数最多的子串[C语言实现]-The highest number of children seeking a consecutive string string [C language]
ezd000
- 用佐普利兹方程推导反射透射系数与入射角关系-Zoeppritz equation derived by reflection and transmission coefficient and the angle of incidence relations
jose
- 约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。通常解决这类问题时我们把编号从0~n-1，最后结果+1即为原问题的解。 -Josephus (Josephus problem) is the application of a mathematical problem: Given n indi