NSGAII

matlab实现的粒子滤波器源代码，多若干实例并有与Kalman滤波器性能的比较(realize the particle filter matlab source code, and more with some examples and compare the performance of Kalman filter)

采用matlab的m语言编写，功能为rake接收机的链路生成。其中包含短码生成，业务信道长码生成，瑞利衰落信道代码， 哈达码变换，用户原始数据扩频以及信道衰落。(M using matlab)

说明：  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)

基于四元数方法的姿态解算，详细介绍了四元数解算姿态的基本方法(Quaternion method based solver, detailing the basic method solver quaternion attitude)

multi-object detection by cam shift

This is a matlab ea, implements a high pass filter

image compression algorithm

Beta Gamma Nakagami Normal Rayleigh Rician Weibull

Hybrid power system pv array and wind generator.

说明：  1.1 背包问题 有一个徒步旅行者，已知他能承受的旅行背包的重量不超过a（kg）。设有n种物品可供他选择装入背包，这n种物品分别编号为1，2，…，n。其中第i种物品每件的重量为ai（kg），其使用价值（指一件第i种物品对旅行者来说所带来的好处的一种数量指标）为ci（i＝1，2，…，n）。问这位旅行者应如何选择携带这n种物品的件数，使得总价值最大？ (1.1 knapsack problem is a hikers. he is known to travel to withstand the weight of the backpack not exceed a (kg). N Species with articles for his choice loaded backpack, n product were numbered 1, 2, ..., n. I first of which product each ai of the weight (kg), its value (i refers to a section of the types of items travelers the benefits brought by a number of indicators) for the ci (i = 1, 2, ..., n). Asked how travelers who choose to bring this product to the n pieces, making the total value of the largest?)