da_l_l

说明：  2005年电力部数学建模大赛题目： 共有61个比赛项目，1050人参加比赛。请给出算法及其框图，同时给出合理的比赛项目排序表，使连续参加两项比赛的运动员人次尽可能的少；表中“＃”号位置表示运动员参加此项比赛。建立此问题的数学模型，并且合理安排比赛项目顺序，使连续参加两项比赛的运动员人次尽可能的少；程序使用了最小生成树算法。(2005 Mathematical Modeling Contest subject : a total of 61 events, 1,050 people participate in the competition. Please give algorithm and its frame, the event is a reasonable ranking table to enable participation in two consecutive games of 000 athletes as less; Table "#" locations athletes this game. This established the mathematical model, and reasonable arrangements event sequence, and allows the two consecutive games of 000 athletes as less; Procedures for the use of the minimum spanning tree algorithm.)

Model Predictive Control Toolbox

lingo 实例程序 (原材料混合模型)(examples of lingo usage)

Code sort the given int array in C.

说明：  人工神经网络在数模混合电路故障诊断中的应用(Artificial Neural Networks in mixed digital-analog circuit fault diagnosis)

根据有无固定基础设施，无线局域网又可分为BSS (Basic Service Set)和IBSS (Independent Basic Service Set)。我们要研究的ad hoc网络属于后者。假设在一个ad hoc网络中，移动节点的发射功率PTx总是恒定的。要发送数据的移动节点总是先监听信道，测量接收到的信号功率X，其中X= I + N, I为接收到的干扰，N是噪声。移动节点只有在X＜INThre时，才可以发射。式中，INThre为背景噪声门限。 在仿真中，我们规定每个移动节点的发射功率是常数，PTx = 1W；接收节点接收机的灵敏度Smin = -80 dBm；信号质量 min = 2 dB；系统的背景噪声门限INThre = 1.2e-10。 (According to the availability of fixed infrastructure, wireless local area network can be divided into BSS (Basic Service Set) and IBSS (Independent Basic Service Set). We have to study the ad hoc network belong to the latter. Assuming in an ad hoc network, mobile node s transmission power is always constant PTX. To send data to the mobile node always monitor channel, measuring the received signal power X, which X = I+ N, I was received interference, N is the noise. Mobile node only when X <INThre when it is fired. Where, INThre threshold for background noise. In the simulation, we require that each mobile node s transmission power is constant, PTx = 1W receiver node receiver sensitivity Smin =-80 dBm signal quality )

最速下降法，优化算法的一种，具有二次收敛性，若目标函数为二次正定函数，经有限步可达到极小点(Steepest descent method, an algorithm with quadratic convergence, if the objective function is quadratic positive definite function can be achieved by the finite step minima)

稀疏信号的重构算法：IST算法，OMP算法，Lasso算法，StOMP算法，TwIST算法(Sparse signal reconstruct algorithms)

this is kodeing for poster

进行LTE的CRC的添加程序，在lTE系统的链路级仿真中，发端的设计编程。属于LTE CRC附着器。(CRCA，CRCB，LTE)