关于上位机与plc通讯的hoshlink说明

说明：  NFC smart card reader driver example

说明：  without installation on your computer. Recognize text and characters from PDF scanned documents (including multipage files), photographs and digital camera captured images.

我近期从事视频开发所以将我参考的资料上传给大家看看。(I recently engaged in video development, therefore, refer to the information I upload to the U.S. to see.)

MULTIPLE KERNEL LEARNING FOR DIMENSIONALITY REDUCTION

Labview example to read temperature

说明：  STM8S005K6-EEPROM读写，非常详细，直接用库函数编写(STM8S005K6-EEPROM read and write, very detailed, written directly with library functions)

[输入] 图的顶点个数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

说明：  AD9518-3芯片LP管脚调试，用于PLL调试中LP管脚(AD9518-3 PLLdebug,This Project is based on ADIsimCLK.)

用mathematics对boost变换器进行编程，得到分岔混沌图(using mathematics to get the bifurcation and chaos diagram of boost converter)

用快速傅立叶变换FFT实现信号的谱分析，包括FFT程序，谱分析程序和绘图程序-using Fast Fourier Transform FFT spectrum analysis of the signals, including FFT procedures, spectral analysis procedures and drawing program