Hitachi Actsip-H update 259B

asp入门到精通的源代码，不知道版主是否需要，只管传上去看看吧。-asp proficient entry to the source code, I do not know whether the moderator, just look at it-up.

红蓝2018远控带小马源码 需要的朋友下载吧(Do good to kill a powerful friend in need to download it)

说明：  HK算法思想很朴实,就是在最小均方误差准则下求得权矢量. 他相对于感知器算法的优点在于,他适用于线性可分和非线性可分得情况,对于线性可分的情况,给出最优权矢量,对于非线性可分得情况,能够判别出来,以退出迭代过程.(The idea of HK algorithm is very simple, which is to obtain the weight vector under the minimum mean square error criterion. Compared with the perceptron algorithm, it is suitable for linear separable and non-linear separable cases. For linear separable cases, the optimal weight vector is given. For non-linear separable cases, it can be distinguished to exit the iteration process.)

本程序可读取Yokogawa 光谱仪多个数据文件(CSV格式)并寻峰。数据文件为多个光栅串的测试光谱。串联光栅波长间隔等距，可确定等距串联光栅的中心波长和峰值强度，将数据存入mat file 使用前请设置若干重要参数 【wl_start】 【wl_end】 【FBGs_num】 【Min_PowerValue】【Peaks_seperation】 其他相关变量说明 【OSA_data】 所读入的光谱全图 里面可能包含更宽的波长 【OSA_data_FBGs】截取光栅串所在波长区间，由【wl_start】 【wl_end】决定 导出的数据文件为 FBGs.mat， 其中所保存的 重要变量为 【FBGs_peaks】 【FBGs_peaks】 第1列：峰值所在序号； 第2列：横轴-光栅串中心波长值； 第3列：纵轴-光栅串光强值(This m-code can read multiple data files (CSV format) of the Yokogawa spectrometer and find the peaks. The data file is measured spectrum for multiple FBG series. The wavelength interval of the FBGs is equal distance, and the center wavelength and peak intensity of the FBGs can be determined, and stored in mat file. Please set up a number of important parameters before use [wl_start] [wl_end] [FBGs_num] [Min_PowerValue] [Peaks_seperation] Other relevant variables [OSA_data] The full spectrum of the spectra read in OSA_data may contain wider wavelength range [OSA_data_FBGs] the wavelength range of the FBGs is determined by [wl_start] [wl_end] The exported data file is FBGs.mat, where the important variable is [FBGs_peaks]. [FBGs_peaks] first column: peak number, second column: axis - center wavelength value, third column: longitudinal axis - peak intensity.)

说明：  去雾dehazenet 有效有效有效 去雾去雾(dehazenet good dehaze dehaze)

Jbuilder开发的一个P2P文件共享软件！-Jbuilder development of a peer-to-peer file-sharing software!

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )

说明：  利用matlab2018的simulink编写的svpwm模块，包含了park变换、clark变换等。(SVPWM module written by Simulink of MATLAB 2018 includes Park transform, Clark transform, etc.)

新手上传matlab程序，希望可以和大家互相交流学习(I hope to have a chance to learn from others)

Javascript源代码集,对Javascript感兴趣的可以-Javascript source code sets, right Javascript interested can s