Buck+TypeII compensation_mathcad

说明：  Dedicated PPT, simple and generous style

说明：  该程序基于QPSK调制，信道使用基于最简单的高斯白噪声，评估了该系统的误码率特性(The program is based on QPSK modulation, and the channel usage is based on the simplest Gaussian white noise. The bit error rate characteristics of the system are evaluated.)

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

东莞赛马场查询系统,可通用为其他查询系统-Dongguan racetrack inquiry system, common to other inquiries systems

通过神经网络利用matlab和python实现人脸识别(Face recognition using MATLAB and python through neural network)

This is HC-05 Bluetooth test program

说明：  关于Python的一些资料，帮助快速学习Python(The Guide of Python Quickly)

本文件为django的基础知识，包含django的入门技巧及学习路线，django入门与实践(This document is the basic knowledge of django, including Django introductory skills and learning routes, Django introductory and practical)

月1日 - 说明: 主要用于C#开发客户端,用于读写西门(hi every bodyertgeghrgb)

详细介绍了可穿戴无线传感器网络，给初学者一个良好的认知(The wearable wireless sensor network is introduced in detail)