-
yibutongxinhetongbutongxindequbie
描述了异步通信和同步通信的的概念还有对两者的区别做出了详细的讲解(Describe the concept of asynchronous communication and synchronous communication and make the detailed explanation to the difference between the two)
- 2015-01-21 18:20:45下载
- 积分：1
-
calculate-FFT
基于FFT平面相控阵天线方向图快速计算 (Figure quickly calculate FFT-based planar phased array antenna direction)
- 2013-12-04 12:31:56下载
- 积分：1
-
zifuchuan
说明： 求N个字符的最大公共子串，超高效率，希望能给大家带来帮助谢谢(Request N sub-character string of the largest public, high efficiency, We hope you help thank you)
- 2010-04-15 15:40:10下载
- 积分：1
-
blobtrack
opencv自带的跟踪框架程序，方便开发者开发出能够自动检测前景、目标跟踪的算法程序(Opencv own tracking framework application, convenient and developers to develop to be able to automatically detect prospects, the algorithm of target tracking application )
- 2014-12-24 15:43:27下载
- 积分：1
-
储能策略的微网可靠性程序
基于3种储能策略对微电网的可靠性指标计算评估(Reliability evaluation of microgrid based on energy storage strategy)
- 2017-07-07 11:07:32下载
- 积分：1
-
__
说明： mdfkgfrevfieogmte lvtmpbmtrp "gteympvftr tg (jnoirenmtgoljvbe /fjrmpgjpg)
- 2009-12-18 09:03:04下载
- 积分：1
-
comunicationNet
系统介绍通信网，包括通信网信源模型，erlang拒绝和等待系统，通信网性能分析(system introduced communications network, including communications network source model, and refused to wait for the erlang system performance analysis of communication networks, etc.)
- 2007-04-02 15:56:33下载
- 积分：1
-
matlabenginetest
该程序是一个matlab与C++混合编程的例子，用matlab引擎在c++中调用matlab程序(that the procedure was a mixed Matlab and C programming examples, Matlab engine used in c Calling Matlab procedures)
- 2007-05-11 17:19:53下载
- 积分：1
-
Wavelet_denoising
小波去噪matlab程序，有demo，本人已运行，能用，大家可以试一试。(Wavelet denoising matlab program, demo, I have to run, can be used, we can try.)
- 2013-10-25 21:10:04下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
