清华大学数学实验之数学建模综合PDF幻灯片

本代码实现循环阈值基于内类方差最小化 （就这样做的 Otsufor 线性阈值） 的两个的版本。我们的方法是适用于 circulardata，例如颜色、 方向等。

一个用C++写的大数运算类，支持大数的加，减，乘，除和模运算，速度快。-C wrote a majority of the computing categories, large numbers support the addition, subtraction, multiplication and addition and modular, fast.

统计一个txt文件中字符的个数和单词的个数 可以指定文本文件中搜索指定字符-a txt document the number of characters and words can specify the number of text files to search for the designated characters

要解决 AX = B 鉴于初始逼近 X(0)。 输入： 方程和未知数的数目 n;条目 A(I,J)，1 < = I J < = n 的矩阵 ；条目 B (一)， 1 < = I < = n 的非均匀期限 B ；条目 XO(I)，1 < = I < = n 的 X(0) ；容忍 TOL ；最大值 N.迭代的次数 输出: 近似解 X(1),...,X(n) 或一条消息 迭代的次数超过了。

二维图像离散余弦变换：数字图像处理常用例程，可执行文件在Release中，具体说明见Readme。-two-dimensional discrete cosine transform image : Digital image processing routines used, in the Release executable file, specify see readme.

最短路径算法，采用Dijkstra算法实现两点之间的最短路径算法。-shortest path algorithm Dijkstra algorithm used between two points is the shortest path algorithm.

能够读取一般文件和写入一般文件。生成随机数，将随机数写入文件。

资源描述Abstract Considering rapid developments in the technologies of both radio-frequency identification (RFID) systems and wireless sensor networks (WSN), an integration of the two technologies may lead to the formation of an RFID-enhanced WSN which would possess improved functions and capabilities. In the RFID-enhanced WSN, many reader-enhanced nodes have increasingly been employed. In such networks, RFID data contains a lot of duplication, because the same tag may be read multiple times, and collision may occur among readers, while energy constraints are also a serious problem. These three could in turn cause serious problems. In this paper, we have proposed our CSMA-based algorithm since it is light, efficiently minimizes all kinds of reader collision, and eliminates the duplicate data. For this purpose, we have used a separate control channel and a tag ID forwarding mechanism with a special co

应用背景 一个简单的推箱子游戏源码 很早的时候写的 游戏虽然没几关 不过直接添加游戏关卡的地图数组就可以了 关键技术 图形绘制 游戏算法 mfc等

资源描述#include #define maxsize 100 using namespace std; /*class base {     int length; };*/ class Seqlist                //实现顺序表类 {     private:         int size;        //当前元素个数         int length;            //当前表的总长度              public:         int *elem;            //动态存放数据         Seqlist();        //构造函数的声明         int listset();    //顺序表的创建    &nbs