timer

说明：  本方法用C++语言实现Matlab bwlable，亲测有效(this is bwlabel function by using C++)

在以用鼠标键盘控制圆的运动的VC++工程程序！不错的源码(In the mouse and keyboard to control the movement of the circle of vc + + project program!)

为核心的文本hyperlinkview iOS，精选ios编程学习，很好的参考资料。(As the core of the text hyperlinkview iOS, select IOS programming learning, a good reference.)

判断输入的三条边是否能组成一个三角形。C#编写。(Three sides to determine whether the input can form a triangle. Written in C#.)

SyslogGather.exe其实就是一款测试SYSLOG的绿色版软件。可以设置默认端口，默认是514，可以设置是否保存日志。如果你选择了这个选项，则日志在SyslogGather.exe同目录下的logfiles目录中。为纯文本格式。 　　可能你会说SyslogGather.exe功能并不强大，但是作为一个基本的SYSLOG接收器，倒是也非常轻便。平时做测试的时候，还是非常方便的。 (SyslogGather.exe SYSLOG is actually a green version of the software testing. You can set the default port, the default is 514, you can set whether to save the log. If you choose this option, then log in SyslogGather.exe same directory logfiles directory. To plain text format. You might say SyslogGather.exe function is not strong, but as a basic SYSLOG receiver touches are also very lightweight. Usually do testing, is very convenient.)

TCPIP 经典案例，三次握手，四次分手，握手协议，入门经典(The minute you think of giving up, think of the reason why you held on so long)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

【实例简介】 用C#写的西门子S7-200 PLC 的PPI通讯测试程序，可读写I,Q,M,VB等，希望对学习PPI通讯的同学有帮助。

利用水平集函数来检测物体轮廓，一般水平集收敛用到signed distance function的，但是这里实现的程序不用每次都要进行reinitialization就可以使水平集函数趋于收敛。(The use of level set function to detect an object contour, the general level set signed distance function used in the convergence, but the program here do not realize every time to be able to make the level set reinitialization functions tend to converge.)

Ufida file edit a document, the file collection and network, usage please Google