Graphics-processing

惯性导航工具箱，可以实现多种仿真。感兴趣的看看(Inertial navigation toolbox, can achieve various simulation. Interested to see)

说明：  BP算法是为了解决多层前向神经网络的权系数优化而提出来的；所以，BP算法也通常暗示着神经网络的拓扑结构是一种无反馈的多层前向网络(BP algorithm is to solve the multi-layer feedforward neural network weights optimization and put forward Therefore, BP algorithm usually implies that the topology of neural network is a multi-layer feedback-free network)

Demo Test Demo Test

测试可以跑，根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个（原文献说最好与参考点个数相同）个体的初始种群，其中 N 是种群大小。接下来，算法进行迭代直至终止条件满足。在第 t 代，算法在当前种群 Pt的基础上，通过随机选择，模拟两点交叉（Simulated Binary Crossover，SBX）和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此，两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代，首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层（F1，F2等等）。然后，算法构建一个新的种群St，构建方法是从 F1开始，逐次将各非支配层的解加入到 St，直至 St的大小等于 N，或首次大于 N。假设最后可以接受的非支配层是 L层，那么在 L+ 1 层以及之后的那些解就被丢弃掉了，且 St FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取，选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)

find and fix red eye

In this file, the case of polymer casting is considered as an unsteady state heat transfer problem. The explicit scheme of finite difference approach is considered to solve the governing partial differential equation in one dimensional (radial) cylindrical coordinates.

光波传输原理与技术（含有利用matlab进行仿真的代码和相应的结果）(Lightwave transmission principle and technology (with the use of matlab simulation code and corresponding results))

人脸识别matlab程序，yyale人脸库上实现，三阶近邻法 (Face recognition matlab program the yyale face database, the third-order nearest neighbor method)

Book,Adaptive_Filtering_Primer_with_MATLAB Pubnlished in 2006 by CRC press Taylor & Francis Group

基于信道的历史信息来预测不同信道的未来可用时间可以帮助CR选择一个最佳信道进行信息传递。不同的预测准则应用到周期或是随机的开关模式中。一个CR可以学习以往不同信道的模式。我们提出一个简单的分类和学习方法去检测模式的类型和收集需要的信息用于智能信道的选择。MATLAB仿真结果显示提出的方案在随机信道的随机和周期模式中都有优越的表现。随着时间的变化，新到的切换次数减少到55 ，并且延迟时间也相应减少，而吞吐量却在提高。(Prediction of future availability times of different channels based on history information helps a cognitive radio (CR) to select the best channels for control and data transmission. Different prediction rules apply to periodic and stochastic ON-OFF patterns. A CR can learn the patterns in different channels over time. We propose a simple classification and learning method to detect the pattern type and to gather the needed information for intelligent channel selection. Matlab simulations show that the proposed method outperforms opportunistic random channel selection both with stochastic and periodic channel patterns. The amount of channel switches needed over time reduces up to 55 , which reduces also the delay and increases the throughput.)