-
MD5压缩算法
说明： MD5压缩算法源码 BCB 工程 + 源码(MD5 compression algorithm source BCB project + source code)
- 2020-02-28 22:10:03下载
- 积分：1
-
加噪
此程序可用于地震数据处理，可加任意程度的随机噪声(Adding noise to seismic data)
- 2018-12-02 18:36:40下载
- 积分：1
-
drop_double_standardmodel
说明： 源模型是从pudn下载，里边的双闭环控制能用但是没有理论依据且参数设计不合理，下垂控制模块也是有问题，重新改进过的(The source model is downloaded from the pudn. The double closed-loop control can be used, but there is no theoretical basis and the parameter design is unreasonable. The droop control module is also problematic and has been improved)
- 2020-10-20 11:37:24下载
- 积分：1
-
1162195
监测指定目录中的文件目录的改变 ！不错,仅供学习与参考(Monitor changes to the file directory in the specified directory! Yes, for study and reference only)
- 2018-12-01 22:22:39下载
- 积分：1
-
radar_ddc
说明： 雷达下变频处理，低通滤波法，希尔伯特变换，(Radar down conversion processing, low-pass filtering, Hilbert transform,)
- 2021-03-05 20:19:30下载
- 积分：1
-
PIC12F508-PICC-control-led
基于pic12f508开发的流水灯控制程序，PICC编程。c语言控制(Pic12f508 based on the development of light water control program, PICC program. c language control)
- 2011-06-28 19:56:10下载
- 积分：1
-
典型序列的产生
一、 实验目的
1. 掌握典型序列的产生方法。
2. 掌握DFT的实现方法，利用DFT对信号进行频域分析。
3. 熟悉连续信号经采样前后频谱的变化，加深对时域采样定理的理解。
4. 分别利用卷积和DFT分析信号及系统的时域和频域特性，验证时域卷积定理。
二、实验环境
1． Windows2000操作系统
2． MATLAB6.0(First, the purpose of the experiment 1. master the method of producing typical sequence. 2. master the realization method of DFT and use DFT to analyze the signal in frequency domain. 3. familiar with the change of the frequency spectrum before and after the continuous signal sampling, deepen the understanding of the time domain sampling theorem. 4. the time domain and frequency domain characteristics of the convolution and DFT analysis signals and systems are used to verify the time domain convolution theorem. Two. Experimental environment 1. Windows2000 operating system 2. MATLAB6.0)
- 2018-03-09 10:34:32下载
- 积分：1
-
cjelatex
电子学报英文版LATEX模板，投搞的重要工具，有源代码(E-Journal in English LATEX template, an important tool Tougao, source code)
- 2021-04-21 12:28:49下载
- 积分：1
-
遗传算法求解多旅行商问题
旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分：1
-
宇电AIBUS及MODBUS通讯协议说明V80
宇电AIBUS及MODBUS通讯协议说明V80(YUDIAN AIBUS and MODBUS communication protocols explain V80)
- 2018-05-10 22:05:41下载
- 积分：1
