3gpp-channel-modle

Matlab辅助激光光学分析与应用 内涵源码(Matlab assisted laser optical analysis and Application)

algorihtmo the ant metaheurist

一个粒子滤波Matlab代码,很值得学习(A particle filter Matlab code)

主成分分析MATLAB相关程序主成分分析MATLAB相关程序(Principal component analysis related MATLAB program )

Bayesian Multi Layer Perceptron Neural Network

说明：  针对物流配送中心选址优化问题中存在的多方面影响因素，难以精准实现优化选址的问题，通过综合考虑网点的物资需求量与配送时间的影响，建立结合配送时间的选址模型，并使用一种免疫优化算法对物流配送中心选址问题进行解决.(Immune optimization algorithm for location of logistics distribution center)

利用线性矩阵不等式编写的可行解求解程序，可以看一下了。(LMI simulation)

本文首先研究了ISAR成像的基本原理，在理想转台模型的基础上对距离-多普勒(R-D)成像算法做了分析，对目前常用的运动补偿技术进行了对比和研究，并将这些技术用于雅克-42飞机的实测数据中。然后，论文系统地论述了压缩感知主体理论，重点对信号重构中的基追踪(BP)算法和正交匹配追踪(OMP)算法进行了深入的研究和讨论，并通过正弦信号的仿真结果验证了两种方法的有效性。(Firstly, the basic principle of ISAR imaging study, based on an ideal model for distance turntable- Doppler (RD) imaging algorithm to do the analysis of the motion compensation techniques currently used are compared and studied, and the use of these technologies in the measured data in the Yak-42 aircraft. Then, the paper systematically discusses the theory of compressed sensing body, focusing on the signal reconstruction of the base track (BP) algorithm and orthogonal matching pursuit (OMP) algorithm is conducted in-depth studies and discussions, and the simulation results verify the sinusoidal signal the effectiveness of the two methods.)

Base64编码说明 Base64编码要求把3个8位字节(3*8=24)转化为4个6位的字节(4*6=24),之后在6位的前面补两个0,形成8位一个字节的形式。 如果剩下的字符不...(Base64-encoded instructions require the Base64 encoding three 8-bit bytes (3* 8 = 24) was converted to 4 6 bytes (4* 6 = 24), then in front of the two s complement 6 0, 8 is formed bits in a byte form. If the rest of the characters do not ...)

说明：  kurtogram是一种四阶谱分析工具，用于检测和表征信号中的非平稳性。可用于轴承的故障诊断(The kurtogram is a fourth-order spectral analysis tool elaborated for detecting and characterising nonstationarities in a signal. It relies on the assertion that each type of transient is associated with an optimal (frequency/frequency resolution) dyad (f ; Df) which maximises the kurtosis. The Fast Kurtogram computes the kurtogram over a grid that finely samples the (f ; Df) plane. Its complexity is on the order of N log N. This is the "plain vanilla" code used in paper: J. Antoni, Fast Computation of the Kurtogram for the Detection of Transient Faults, Mechanical Systems and Signal Processing, Volume 21, Issue 1, January 2007, Pages 108-124.)