用神经网络预测细胞浓度值 Rfirst

说明：  STM32F103驱动代码 用于学习 希望能帮助到您(STM32F103 Driver Code for Learning Hope to Help You)

数据结构中的插入排序分析和比较。有各种插入排序的算法描述。-data structure of the insert sequencing analysis and comparison. Various insertion sorting algorithm description.

关于编译原理的学习内容， 《编译原理（第3版）》-build on the principle of learning content, "Compiler Principle (3rd edition)"

说明：  本程序中含有服务器与客户端两个程序。服务器与客户端通过窗口进行通信。(This program contains two programs, server and client. The server communicates with the client through the window.)

为了方便大家学些，上传了一个贪心算法的算法-In order to facilitate everyone to learn more, upload the algorithm, a greedy algorithm

说明：  独立成分分析(Independent Component Analysis，ICA)是近年来提出的非常有效的数据分析工具，它主要用来从混合数据中提取出原始的独立信号。它作为信号分离的一种有效方法而受到广泛的关注。近几年出现了一种快速ICA算法(Fast ICA)，该算法是基于定点递推算法得到的，它对任何类型的数据都适用，同时它的存在对运用ICA分析高维的数据成为可能。又称固定点(Fixed-Point)算法，是由芬兰赫尔辛基大学Hyvärinen等人提出来的。是一种快速寻优迭代算法，与普通的神经网络算法不同的是这种算法采用了批处理的方式，即在每一步迭代中有大量的样本数据参与运算。但是从分布式并行处理的观点看该算法仍可称之为是一种神经网络算法。(Independent component analysis (ICA) is a very effective data analysis tool proposed in recent years. It is mainly used to extract the original independent signals from the mixed data. As an effective method of signal separation, it has been widely concerned. In recent years, a fast ICA algorithm (fast ICA) has appeared. The algorithm is based on the fixed-point recursive algorithm, which is applicable to any type of data. At the same time, its existence makes it possible to use ICA to analyze high-dimensional data. Also known as fixed-point algorithm, it was proposed by HYV & auml; rinen et al. It is a fast optimization iterative algorithm. Different from the common neural network algorithm, this algorithm adopts the way of batch processing, that is, there are a large number of sample data in each iteration. But from the point of view of distributed parallel processing, this algorithm can still be called a neural network algorithm.)

粒子群优化的超限学习机，运行快，拟合效果好，很方便使用(The particle swarm optimization of the overrun learning machine, fast operation, good fitting effect, very convenient to use.)

说明：  蚁群算法的优化计算-二维路径 经过优化，效果比较好(Two dimensional ant colony algorithm for path optimization After optimization, the effect is better)

Java CLDC MIDP底层编程实例源码,收集自Sun官方的开源项目phoneME，J2ME游戏编程时你会用到，你可以由此进一步探讨JavaME在Java底层的实现，可能对新手有些难度。

语音增强源数据库,目前对于语音增强方面用的比较的广的源数据库。(Speech Enhancement Source Database,At present, there are a wide range of source databases for speech enhancement.)