-
tra011
说明: 惯性导航解算,得出飞行器的经度纬度高度,陀螺仪和加速度计的值(Inertial Navigation Solution, the longitude, latitude, altitude, gyroscope and accelerometer of the aircraft are obtained.)
- 2019-02-27 16:12:14下载
- 积分:1
-
MC
说明: 泊松模拟,请认真书写上传资料的详细功能、包含内(poission www.pudn.com www.pudn.com )
- 2009-09-12 09:22:35下载
- 积分:1
-
lmscomunication
说明: matlab 防真自适应滤波器(部分)考虑时变代价函数
(Matlab defense really adaptive filter (part) when considering variable cost function)
- 2006-03-21 15:39:59下载
- 积分:1
-
2
说明: 有限单元法,彭细荣,包含matlab源代码,可以通过其运行,学习。(matlab data source about finite element method。 )
- 2012-10-07 09:52:47下载
- 积分:1
-
tianxianxuanzesuanfa
一系列关于天线选择的算法,包括全搜,递增递减和随机天线选择算法(Series of antenna selection algorithms, including full search, Ascending Descending antenna selection algorithm and random)
- 2020-12-29 19:39:01下载
- 积分:1
-
OFDM_guji
ofdm信道估计的程序源代码,使用matlab语言编写(ofdm channel estimation of the source code, the use of language matlab)
- 2009-05-01 08:48:26下载
- 积分:1
-
bilateral-filtering
对含有噪声的图像进行自适应方差双边滤波,与中值滤波进行比较(Consists of the noise image variance adaptive bilateral filtering, comparing with the median filtering)
- 2021-04-27 08:48:44下载
- 积分:1
-
dijkstra
基于图论求解最短路径,经典dijkstra算法,通用版(Based on the graph theory to solve the shortest path, classical dijkstra algorithm, general version)
- 2021-03-27 11:49:12下载
- 积分:1
-
NSGA-III
测试可以跑,根据自己情况修改下函数即可. 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.)
- 2021-01-26 22:38:41下载
- 积分:1
-
NISTUWB_Report_April03
关于UWB的英文资料,能详细很全面很好!(English information on UWB can be very comprehensive and very detailed!)
- 2010-10-08 22:37:12下载
- 积分:1