Kalman filter

此源代码借助opnet平台实现了固定TDMA协议，对于学习opnet的初学者来说这是一个很好的例子，比较全面的涉及了opnet的方方面面。

[数据挖掘]数据挖掘部分算法的matlab实现 C4_5 比较经典的代码-[Data Mining] part of data mining algorithms compare classic C4_5 realize matlab code

Gabor提取图像纹理  /***************************************************************************  *   Copyright (C) 2006 by Mian Zhou   *  *   M.Zhou@reading.ac.uk   *  *                                                                         *  *   This program is free software; you can redistribute it and/or modify  *  *   it under the terms of the GNU General Public License as published

获得最大并行度的哲学家问题解法-maximum degree of parallelism philosopher Solutions

下一步

SparseLib＋＋是可用于跨计算平台的有效的稀疏矩阵计算的C＋＋类库，软件包包括处理不同稀疏存储格式的矩阵类。包括两篇技术文档和类库的源代码（版本为1.6）-SparseLib++ can be used for cross-platform calculation of the effective sparse matrix calculation of the C++ class library , the package includes different store formats sparse matrices. Including two technical documentation and class library source code (version 1.6)

资源描述摘要:介绍了用罗克韦尔PLC 设备构成温控系统的设计与研究, 讨论了PLC 输入输出控制的外部接口及显示扩展的软硬件 设计, 并对PLC 和PC 的通信和数据技术进行了分析, 给出了部分程序。 关键词:PLC;温度控制;热电阻模块;通信

用c++编的进程调度算法-With c++ Made the process of scheduling algorithm

资源描述用c语言完成的AOA_TOA改进算法 .现在网上大部分的无线定位算法的实现都是通过MATLAB完成的，这这一版的代码是通过c语言啦完成的，对研究算法而非搞硬件技术的人来说非常的实用。

逐次超松驰迭代法(Successive Over Relaxation Me thod,简称SOR方法)是高斯―塞德尔方法的一种加速方法，是解大型稀疏矩阵方程组的有效方法之一，它具有计算公式简单，程序设计容易,占用计算机内存较少等优点,但需要较好的加速因子(即最佳松驰因子).下面我们首先说说松驰一词的含意,再利用它来解释雅可比迭代法与高斯―塞德尔迭代法,最后给出逐次超松驰迭代法的推算公式和收敛性条件.-Successive over relaxation iteration method (Successive Over Relaxation Me thod, called SOR method) is the Gauss- Seidel method for an accelerated method is solution of large sparse matrix equations, one effective method, it has a simple formula, programming easy, take up less computer memory, etc., but the need for better acceleration factor (that is, the best relaxation factor). Let us first talk about the meaning of the term relaxation, and then use it to explain the Jacobi s iterative method and the Gauss- Seidel iterative method, and finally gives successive over relaxation iterative method of projection formula and the convergence condition.