AirQualityUCI

完整波浪计数 很高的成功率，12345ABC 外汇股市都有一定的分析与操盘(FlatDouble ZigZagTriple ZigZagDouble ThreeTriple Thre)

地波场强计算,高频地波场强衰减计算，高频电磁波地波传播计算仿真，Fortran源程序，可以在cirr公开网址上获得。- The PC version of GRWAVE requires an IBM PC/AT or equivalent (80286 microprocessor) with a math co-processor and a minimum of 256 kilobytes of memory. Disk Contents: GRWAVE is supplied on a 3.5" or 5.25" disk which contains three main files. These are GRWAVE.EXE, GRWAVE.FOR and GRWUSR.MAN. GRWAVE.EXE is executable machine language code. GRWAVE.FOR is the FORTRAN source code. Compilation of this source code to produce an executable code requires a FORTRAN compiler which supports double precision complex arithmetic. Microsoft FORTRAN Version 4.01 was used to compile and link GRWAVE.FOR to produce GRWAVE.EXE. Compilation has also been tested with Lahey FORTRAN F77L [*]. It is known the IBM Professional FORTRAN will not work because of a lack of support for double precision complex arithmetic. [*] Note: GRWAVE uses a function, DREAL, which is not an in

内容 Readme.txt BcbChess 中国象棋程序实例的源代码所在的文件夹 BcbExe 中国象棋程序实例的可执行程序所在的文件夹 BcbTest 关于时间测试的项目所在的文件夹 -content Readme.txt BcbChess Chinese chess program is the source code where the text Annex folder BcbExe Chinese chess procedures examples of where the executable folder BcbTest test of time Examination of the project folder

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

使用egm模型计算基于WGS84参考椭球的大地水准面高等大地测量学物理量( geoid, WGS84, egm2008)

说明：  把单片机上的数据利用无线，蓝牙，或者串口上传到上位机(Using wireless, Bluetooth or serial port to upload data from MCU to PC)

方便计算关联维数的关于gp算法的使用，通过计算关联维数，可以获得系统的混沌特性(The calculation of correlation dimension is convenient for the use of GP algorithm. By calculating the correlation dimension, the chaotic characteristics of the system can be obtained)

K-means聚类算法，基于PSO改的聚类算法，对初始点的选择进行优化(K-means clustering algorithm, based on PSO modified clustering algorithm, optimized the selection of the initial point.)

STM32初级教程16课时，掌握软件技巧，实现快速入门开发，(STM32 Primary Course, Quick Start Development.)

MAX7456 OSD generator IC spi code (bascom)