Hamming1

window IO CPP code example

This a set of simple implementations for aligning scans of range-bearing laser data. They are written as demonstrations of basic algorithm implementations and are not designed for real-world (ie, efficient) application. The source code consists of MatLab scripts, mex-files and C++ code. to objects). This demo also provides a nice example of using "placement new" and explicit destruction. (This a set of simple implementations for aligning scans of range-bearing laser data. Th are written as a journalist in demonstrations of basic algor ithm implementations and are not designed for r Leveraging-world (ie, efficient) application. The source code consi sts of MatLab scripts, Mex-files and C code. to objects). This demo als o provides a nice example of using the "placement ne w "and explicit destruction.)

it is about wimax,which is the most important technology .

Un jueguito echo para practicar lenguage C

TLD跟踪算法源代码下载（纯C++版本），OpenTLD-master，某大牛重新编写的C++版本TLD跟踪算法，脱离MATLAB。(C++ impleletion of TLD)

能够模拟光纤光栅，对于我们的实验研究有很大的帮助，是我们能够了解它大概的趋势买并且有助于实验的制作(Able to simulate fiber grating, for our experimental study of great help, we are able to understand it' s probably a tendency to buy and help make the experiment)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

主要编写的是一个是期类，包括日期的加法，减法，大于符号，小于符号的重载，和一些常用符号的重载，及日期类的一些常见运算(Is mainly written in a period of class, including the date of addition, subtraction, greater than symbol, less than symbols overloaded, and some common signs of overload, and the date of the class some common operations)

D算法求最短路径利用matlab解决 输出S矩阵和行向量(Dijkstra algorithm)

modifi bf load flow in matlab