-
eltamaly2019
说明： This paper proposes an accurate global maximum power point tracking (MPPT) technique based on Wind Driven
Optimization (WDO) algorithm for photovoltaics system (PVS) under non-uniform solar irradiance. Under nonuniform
solar irradiance or partial shading conditions (PSC), the power-voltage curve of the PVS has several
maximum power points (MPPs),
- 2019-02-04 23:20:02下载
- 积分：1
-
ifix语音报警
说明： ifix实现语音报警，可以修改代码选择不同的报警类型进行报警。(IFIX realizes voice alarm, and can modify the code to select different types of alarm to alarm.)
- 2020-06-19 12:40:01下载
- 积分：1
-
FlexFTP
使用Flex實做FTP上傳及下載檔案功能，並實現續傳效果。(Using the Flex really do FTP upload and download files function, and to achieve the resume effect.)
- 2010-08-12 16:15:36下载
- 积分：1
-
exercises-code
《Visual C++ 面向对象与可视化程序设计》课后习题代码。(《Visual C++ and visualization of object-oriented programming》after-school exercise code.)
- 2013-11-28 10:34:35下载
- 积分：1
-
PMSM
Simulink 仿真模型 PMSM 永磁同步电机 SVPWM 矢量速度控制闭环(Simulink simulation model, PMSM permanent magnet synchronous motor, SVPWM vector speed control, closed-loop)
- 2017-08-18 15:58:31下载
- 积分：1
-
Z_Stack-1.4.2-NWK
这是TI官方提供的关于ZigBee协议栈中的NWK层的代码分析，正在学习ZigBee的朋友可以好好看看，很有用的！(This is the official information provided on the TI ZigBee NWK layer protocol stack code in the analysis of ZigBee' s friends are learning to be a good look, very useful!)
- 2011-05-08 17:28:30下载
- 积分：1
-
MOVIDRIVE_DFP21_DPV1
说明： 用于西门子STEP7硬件组态，SEW变频器的GSD文件(SIEMENS STEP7, GSD File of SEW Valve Island, Hardware Configuration Use)
- 2020-06-20 07:20:01下载
- 积分：1
-
bldc-proteus
无刷电机 proteus 的一系列仿真 A series of simulation brushless motor proteus(Brushless motor simulation proteus series A series of simulation brushless motor proteus)
- 2012-09-11 11:26:04下载
- 积分：1
-
Mnist-Torch
说明： mnist图片集分类 pytorch实现(mnist classification)
- 2020-08-03 11:20:10下载
- 积分：1
-
5
说明： 1、 创建图类，存储结构使用邻接矩阵。
2、 输入图的节点数n（不超过10个）、边数m，节点分别用1-n代表。
3、 采用“起始节点，终止节点，权值”输入图的m条边，创建图。
4、 输出从节点1开始的BFS遍历，在遍历过程中，如有多个可以选择的节点，则优先选择编号较小的节点。
5、 输出从节点1开始的DFS遍历，在遍历过程中，如有多个可以选择的节点，则优先选择编号较小的节点。
6、 输出从第1节点到第n节点最短路径的长度，如果没有路经，输出0。(1. Create graph class and use adjacency matrix in storage structure.
2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively.
3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value".
4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred.
5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred.
6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.)
- 2019-02-19 14:49:05下载
- 积分：1
