technical specifications summarization design mode includes Quick Reference manu...

软电话或称softphone，是一种通信终端设备，是虚拟电话，向终端用户提供廉价可靠、良好通话质量的语音服务。只要在同一网内，就可以不受限制的进行通话 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

对软件需求的全过程做了详细的介绍，内有9章内容，对于编写需求有很高的参考价值-The demand for software to do the whole process of a detailed introduction, there are nine chapters, for the preparation of a high reference value for demand

CHM格式,讲述极限编程的好文档.具体介绍了什么是极限编程.极限编程的设计原则,极限编程的建模以及一些极限编程的想法-CHM format, on the Extreme Programming good documentation. Specific details of what is Extreme Programming. Extreme Programming design principles of Extreme Programming Modeling and some thoughts Extreme Programming

VMware Workstation 6 基本使用

image maker can be used to create and write the images of files

求迷宫中从入口到出口的所有路径是一个经典的程序设计问题。由于计算机解迷宫室，通常用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向在继续探索，直到所有可能的通路都探索到为止。为了保证在任何位置上都能沿原路返回，显然需要用一个后进先出的结构来保存从入口到当前位置的路径。因此，在球迷宫通路的算法中应用“栈”也就是自然而然的事了。 -seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past.

基于TMS320LF2407的PCI总线通用运动控制卡设计-Based on the PCI bus TMS320LF2407 General Motion Control Card Design

二叉树数据结构的讲义，全面介绍了完全二叉树、满二叉树的概念-Binary tree data structure of the lecture notes, a comprehensive description of the complete binary tree, full binary tree concept

驱动程序超级宝典 第一次上传！！不好见量-Super driver Baodian From the first time! ! Not see the volume of

数字图像放大缩小及旋转计算组间方差和组内方差的时候调用了一个函数专门求阈值，可能这里的计算还是有一点问题。而且在我的函数里，要256次调用这个函数，又因为计算机是按字节处理数据的，因此写图像数据的时候要用每8个写到一个数组中，然后通过计算得到字节类型的值，这些都使得我的算法效率比较低，最后一个问题，我觉得如果使用位运算会快一些，但是前面的问题还没有想到比较好的解决方法。-Digital Image zoom and rotation calculation of variances and group between the two groups when the variance of a function call seeking specific threshold, the calculation may be here, or there was a problem. And in my function, it is necessary 256 calls to this function, and also because the computer is processing data in bytes, and therefore the time to write image data to use for every 8 write an array, and then calculated byte type values, which are made to my algorithm" s efficiency is relatively low, the last issue, I think that if you use bit computing will be faster, but the previous issues have not yet thought of a better solution.