可以自由调整大小进行拍照摄像并自动保存,能捕获视频进录像并保存...

马跳棋盘源程序 ,一个实际问题的解决-Ma checkerboard source, a practical solution to the problem

csharp中异步变同步的基础类库,可以用来把大量的异步过程在同步过程中实现，可以参考相关的文章，因为原文章中这段代码都不完整，此处做了整理，把关键的代码补齐了-AsyncEnumerator and interlock source

JAVA编写的推箱子游戏 虽然很简单也是不错的经典 -JAVA prepared Sokoban game is pretty good although very simple classic

分数阶Liu系统与分数阶统一系统中的混沌现象及二者的异结构同步-Fractional-order Liu system and the fractional order unified system of chaotic phenomena and the different structure of both synchronous

分界控制器保护原理.内部资料.对电力行业做一点小的贡献.-good

内含纯DOS,WIN32控制台和WIN32 GUI三个版本.它们生成的备份文件可以在任何版本中使用. WIN32 GUI版本暂使用备份功能(其他模块也都已全部写好,全是完整的,现在仅开启备份功能),如果想使用还原替换和比较功能,可自行打开调用的开关或加几句调用的代码就可以了-Containing pure DOS, WIN32, and WIN32 GUI console in three versions. They generated backup files can be used in any version. WIN32 GUI version temporarily use the backup function (all other modules have also written, is complete, now only open the backup feature), if you want to use to restore the replacement and comparison of features, can open the call a few of the switches or the code can call the

资源描述 主控芯片为51，功能强大，整个文件包，包括原理图。

Drive ccts for use with solenoid

ROBODoc通过提取源码中的特定格式的注释块（specially formatted headers）并形成文档文件，文档文件的格式包括HTML, ASCII, XML DocBook, LaTeX或RTF 还能间接形成PDF 和HTML Help文档-ROBODoc By extracting the source code of the specific format of the comment block (specially formatted headers) and the formation of the document file, document file formats, including HTML, ASCII, XML DocBook, LaTeX, or RTF also an indirect form PDF and HTML Help documentation

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.