-
ch1
07C第二版统一参考教案的第1章内容的课件，将上传完整个教案，欢迎学生下载学习！(07C lesson plans reference the second edition of Unity Chapter 1 of courseware content, will upload an entire lesson plan, students are welcome to download to learn!)
- 2010-09-21 15:40:46下载
- 积分：1
-
2
说明： FreeRTOS实验6-1 FreeRTOS任务创建和删除实验(动态方法)(Task creation and deletion experiments (dynamic methods))
- 2019-03-15 21:42:37下载
- 积分：1
-
achieved between the various EJB call can be expanded.
该源码实现了各种EJB之间的调用，可以扩展功能。-achieved between the various EJB call can be expanded.
- 2022-09-27 16:25:03下载
- 积分：1
-
extract-chs-sentence
可实现自动对中文句子进行自动切分，及完成切句子的功能。并且算法里有完整的utf8类型的识别函数。(Can realize automatic sentences for Chinese automatic segmentation, and the completion of the sentence cut function. And the algorithm has the complete identification of the type utf8 function.)
- 2013-08-04 22:50:54下载
- 积分：1
-
dump1090-master
非常好用岁的会回答哈诺要和我如何无任何添加(very good diao ya mei zhi bai)
- 2017-06-13 07:53:10下载
- 积分：1
-
hs
说明： HERSCHEL-BULKLEY模型，用于fluent仿真软件中添加udf使用，限定了剪切速率等关键参考条件(HERSCHEL-BULKLEY model is used to add UDF to fluent simulation software, which limits the critical reference conditions such as shear rate.)
- 2020-06-21 15:20:01下载
- 积分：1
-
anpc5Lcontrol
此为一个三相离网五电平变流器的PWM控制仿真模型，有需要的可以下载参考一下。(This is a PWM control simulation model of a three phase off-grid five level converter, which can be downloaded for reference if necessary.)
- 2018-06-21 09:45:37下载
- 积分：1
-
4linear_DBF
说明： 实现了数字波束形成算法，可以实现静态扫描。(The digital beamforming algorithm is realized, and the static scanning can be realized.)
- 2019-06-04 09:43:49下载
- 积分：1
-
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小...
本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.
- 2022-01-25 16:01:13下载
- 积分：1
-
人工鱼群优化算法
说明： 人工鱼群优化算法的基本原理，基本例子，人工鱼群优化算法的源代码(Artificial fish swarm optimization algorithm basic principle, basic examples, artificial fish swarm optimization algorithm source code)
- 2020-08-10 11:44:13下载
- 积分：1
