niudunMATLAB

DLLInjector DLLInjector source code MioStar MioStar source code MioStar GUI MioStar GUI source code MioStar Application All pieces assembled togheter. Run the MioStar GUI.exe to run it. the rest should be self explaining.

PCA程序，用于信号的主分量分析，用过几次，感觉不错(PCA program, the main component for signal analysis, used a few times, I feel good)

student project for start programing

风能功能实现，包括DFIG以及风电场的各种模型。主要由PSCAD软件搭建的模型。包括线路故障，低电压穿越，以及线路测距的各种模型。(The wind and a variety of functions, including DFIG model of wind farm. Mainly by the PSCAD software to build the model.Including the fault line, low voltage ride through, and a variety of models ranging in line.)

饱和时滞系统matlab相图,给出输入变量的上下界(The matlab phase diagram of the saturated time-delay system is given, and the upper and lower bounds of the input variables are given)

利用Matlab实现矢量量化LBGVQ算法，(failed to translate)

说明：  C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？ 要求：输入K，n，a1，a2......an 输出：他能最多带出的宝物价值 (C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)

遗传算法matlab程序 tsp旅行商问题(matlab yuanchengxu)

这里是vc与matlab混编的一些资料，希望能帮到大家啊！(Here is the matlab vc mixed with some of the information, hope to help you ah!)

For inverting a matrix, Gauss-Jordan elimination is about as efficient as any other method. For solving sets of linear equations, Gauss-Jordan elimination produces both the solution of the equations for one or more right-hand side vectors b, and also the matrix inverse A(-1). However, its principal weaknesses are (i) that it requires all the right-hand sides to be stored and manipulated at the same time, and (ii) that when the inverse matrix is not desired, Gauss-Jordan is three times slower than the best alternative technique for solving a single linear set.