资源列表
processing2-arduino-(2)
- Arduino and matlab file for radar project
generators
- Generator trajectory for radar project
USB_OTG_and_EH_3-0_release_1_1_10May2012
- USB OTG release version .1 is discussed. Project design specifications for the USB OTG is described.
paper23
- 两篇关于视觉测量的文章，双目视觉测试物体的高度，很好，很实用-Two articles on the visual measurement of the article, binocular vision test object height, very good, very practical
dtw
- DTW算法 教程，可以用于语音识别，图像识别等等。 DTW algorithm tutorial, can be used for speech recognition, image recognition, etc-MATLAB voice processing program, speech enhancement, speech pretreatment, very rich, very useful for reference.
DTWword
- DTW算法用于语音识别的资料介绍，不错的参考资料。-DTW algorithm for speech recognition of information, a good reference.
ModBus
- 51单片机实现MODBUS功能，工控领域可以借鉴。-D51 MCU MODBUS function, industrial control area can be used for reference.
Compressive-Sensing
- 本文提出基于压缩感知的被动式目标轨迹测绘算法，仅用少量观测数据一次性精确测绘出目标轨迹，减少了计算和通信开销，降低了能耗。-In this paper, a passive object trajectory mapping algorithm based on compressive perception is proposed. Only a small amount of observation data can be used to accurately plot the target
First-order-Predicate-Ambient-Logic
- 基于μ-演算的一阶谓词界程逻辑，用谓词变量构造不动点公式，方便描述闭环系统的性质，公式语义简洁．-Based on μ-calculus, the predicate variable is used to construct the fixed point formula, which is convenient to describe the properties of the closed-loop system and the semantics of the formula is co
Particle-Swarm-Optimization
- 本文提出变量随机分解策略，增加关联变量分配到同组的概率，使得算法更好的保留变量间的关联性，并将合作协同进化框架融合到算法中，提出了基于大规模变量分解的多目标粒子群优化算法-In this paper, a stochastic variable decomposition strategy is proposed to increase the probability of assigning related variables to the same group, which makes th
Parallel-Algorithm
- 基于Spark 分布式图计算模型，提出大规模复杂网络社区并行发现算法DBCS 。-Based on Spark distributed graph computing model, a large scale and complex network community parallel discovery algorithm DBCS is proposed.
Top-k-Local-Alignment
- 本文研究了基于外存后缀树的top- 局部比对算法，它从根本上消除了内存空间对算法的束缚-In this paper, we study the top-local matching algorithm based on the external suffix tree, which fundamentally eliminates the memory space constraints on the algorithm