sms_optic_flow_2.0.tar

计算成组滑动的滑窗检测器的最佳门限已知: 击中数N = 128, 组宽n = 8，PF = 10¡ 6，PD = 90 假设以下条件: (a) 信号不起伏 (b) 忽略天线波束调制 1 (c) 计算PD时忽略目标区以外噪声的影响 组门限(第二门限)为K=8 滑窗的门限(第三门限)为L=16 (滑窗中包含的组数为16) 求解: 最佳的KOPT 和LOPT，对这题做了具体仿真实现。需要的朋友，一定知道很有用。(Optimal threshold calculated as group slidable window detector is known: hit number N = 128, the group width n = 8, PF = 106, PD = 90 assuming the following conditions: (a) signal is not undulation ( b) ignore the antenna beam modulation 1 (c) the calculation of PD ignored outside the target area noise of impact group door limit (the second door limit) for K = 8 sliding window of the door limit (third door limit) for L = 16 (sliding window contains group 16) to solve: the best of the KOPT the LOPT, these questions do specific simulation to achieve. A friend in need, we must know to be useful.)

This is the API guide for zstack developed by Texas Instruments

数值计算中机器精度的确定算法 MATLAB源程序 自带注释(machine precision)

这是一个基于DCT的图像JPEG压缩程序，并将压缩码保存在一TXT文本中(This is a DCT-based JPEG image compression process, and code stored in a compressed text in TXT)

说明：  经典MUSIC在均匀线阵的情况。本例给出了MUSIC算法估计出的算法图，从图中可以直接看到估计的角度。我们的仿真实验用的是8个阵列，2个接受信号。MUSIC算法的精度很高。(MUSIC classic in the case of uniform linear array. In this case gives the MUSIC algorithm to estimate the algorithm maps directly from the chart to see the estimated angle. Our simulation experiments using 8 arrays, two acceptable signals. MUSIC algorithm for high precision.)

high optics simulation

人造卫星的轨道求解，用的是Brower的方法所得到的解,包含了主要的地球扰动项(The satellite orbit Solving with the solution obtained by the method of Brower)

说明：  分布式发电技术的潮流计算，将分布式电源视为PQ与PV节点，再代入配电网络，进行简化计算(The trend of distributed generation computing technology, distributed power regarded as PQ and PV node, and then substituted into the distribution network for simplified calculation)

Simulation the p-orbital of hydrogen atom - l=1, m=1 - please run S211.m file

蚁群算法是目前应用最广的智能算法之一，该程序应用蚁群算法求解最优路径(Ant colony algorithm is one of the most widely used intelligent algorithm, the program ant colony algorithm for optimal path)