a

采用simulink和stateflow对ABS模型中的连续控制和离散控制进行仿真(Using simulink and Stateflow model of the ABS control and discrete control of continuous simulation)

本程序实现汉字和字符的识别匹配，通过该算法，可以实现手写体的字符和汉字的识别(This procedure to achieve identification of characters and character matching, through the algorithm, can achieve the character and Chinese character handwriting recognition)

神经网络在matlab上的实现的源代码，本程序可用于分类问题(Matlab neural network to realize the source code, the procedure can be used for classification problems)

Particle swarm optimization has been used to solve many optimization problems since it was proposed by Kennedy and Eberhart in 1995 [4]. After that, they published one book [9] and several papers on this topic [5][7][13][15], one of which did a study on its performance using four nonlinear functions adopted as a benchmark by many researchers in this area [14]. In PSO, each particle moves in the search space with a velocity according to its own previous best solution and its group’s previous best solution. The dimension of the search space can be any positive integer.

说明：  用MATLAB编写的crc检验查表法程序(Prepared using MATLAB CRC test procedure look-up table method)

《MATLAB神经网络30个案例分析》中的第10个例子，案例10 离散Hopfield神经网络的分类——高校科研能力评价。希望对大家有一定的帮助！(The MATLAB neural network analysis of 30 cases of example, 10 cases of 10 discrete Hopfield neural network classification- the ability evaluation of scientific research in higher educational institutions. Hope to have certain help to everybody! )

2016年中国图像图形学报 求质心的快速算法 免滤波 直接可以求得质心的位置 附带 matlab源代码！！(In 2016 the Chinese image and graphics Journal of the fast algorithm for the centroid of the fast algorithm can be obtained directly the center of the location of the matlab source code!!)

This Program enables you to embed a visible watermark to any image

该程序是基于小波变换的熵谱，用来提取时间序列的周期成分。熵谱相对于小波谱来说在提取周期成分上有一定优势(The program is based on spectral entropy of wavelet transform to extract time series of the periodic component. Entropy is relative to the small spectral component in the extraction cycle, there are some advantages)

LTSA[19] is based on the intuition that when a manifold is correctly unfolded, all of the tangent hyperplanes to the manifold will become aligned. It begins by computing the k-nearest neighbors of every point. It computes the tangent space at every point by computing the d-first principal components in each local neighborhood. It then optimizes to find an embedding that aligns the tangent spaces.