stm32_f105-07_f2_f4_usb-主机-device_lib

基于GRID格式DEM的等值线追踪算法（已删除编译目录），可用于多种散点插值生成的格网，只需将格网数据写成GRID格式的文本即可．-GRID-based format of the contour DEM tracking algorithm (the compiler has been deleted directory), can be used for a variety of scattered point interpolation to generate a grid, simply written GRID Grid data can be formatted text.

99表 直接生成99表。 比较简单的程序。可以了解简单的代码-99 Table 99 Table directly generated. Relatively simple procedure. Can understand simple code

都是计算方法的上机作业-are calculated on the machine operations

要解决 N 由 N 线性系统 C C E1: A(1,1) X(1) + A(1,2) X(2) +......+ A(1,N) X(N) = A(1,N+1) C E2: A(2,1) X(1) + A(2,2) X(2) +......+ A(2,N) X(N) = A(2,N+1) C   : C   . C EN: A(N,1) X(1) + A(N,2) X(2) +......+ A(N,N) X(N) = A(N,N+1) C C C 输入： 数目的未知数和方程 N;增广的矩阵 C A=(A(I,J)) 哪里 1 < = I < = N 和 1 < = J < = N + 1。 C C 输出： 解决方案 X(1),X(2),...,X(N) 或 A 消息， C 线性系统有没有独特的解决方案。 C

基本排序算法比较与选择-Comparison of the basic sorting algorithm to choose

多层感知器神经网络反向误差传播学习算法多层感知神经网络由输入层、输出层和若干隐层组成本例中用多层感知神经网络求解异或判决问题通过对样本xor.dat的训练进行自学习

杭州电子科技大学在线系统ACM的1162题，用贪心方法解决-Hangzhou University of Electronic Science and Technology ACM-line system of the 1162 title with a greedy solution

格路问题：经典的算法分析与设计题目，用动态规划的方法解决从一个网格起点到终点的最短路径问题-Lattice path problem: the classical algorithm analysis and design topics, with the dynamic programming solution to start from a grid to the end of the shortest path problem

神经计算,里面包含的代码和说明，程序员可以根据自己的需要修改任何一步分-nerve, which contains the code and description, programmers can according to its own need to amend any step pm

数据挖掘经典FP-growth算法C源码实现-Data Mining the classical FP-growth algorithm C source code to achieve