c program translation ad to da

windows运行各进程的详细描述，以及各种系统文件-windows running processes are described in detail, and various system files

The Joint Video Team (JVT) of ISO/IEC MPEG and ITU-T VCEG are finalising a new standard for the coding (compression) of natural video images. The new standard [1,2] will be known as H.264 and also MPEG-4 Part 10, “Advanced Video Coding”. This document describes the methods of predicting intra-coded macroblocks in an H.264 CODEC.-The Joint Video Team (JVT) of ISO/IEC MPEG and ITU-T VCEG are finalising a new standard forthe coding (compression) of natural video images. The new standard [1,2] will be known as H.264 andalso MPEG- 4 Part 10,

源码公开的TCP/IP 协议栈在远程监测中的应用。介绍一个适用于8/16 位单片机的嵌入式TCP/IP 协议栈（uIP ） 在发电机远程监测系统中的应用。 重点阐述u I P 的功能特性、体系结构和相关接口，并详细介绍如何在该协议栈上实现一个嵌入式 Web 服务器。目前uIP 已成功地移植到51 单片机上-Open-source TCP/IP protocol stack in the remote monitoring application. To introduce one for 8/16-bit single-chip embedded TCP/IP protocol stack (uIP) in the remote monitoring of generator systems. U IP focuses on the functional characteristics, architecture and related interfaces, and details on how the protocol stack to achieve a built-in Web server. UIP currently have been successfully transplanted into 51 single-chip on

基 于 MFC 的 WinSock 客 户 端 程 序 设 计-MFC-based client for WinSock Programming

解析微小型燃料电池 一个详细解说目前燃料电池的种类及使用特性供参考者参考- Analyzes a small fuel cell detailed illustration at present the fuel cell type and the operating characteristic supplies the reference reference

谭浩强的c语言教学书籍，被各个大学采用的经典教程-Hao strong c language teaching books, has been used by various University of classic tutorials

delaunay的算法技术与实现，从三角网格的算法到优化每一步都有详细的描述.-delaunay algorithm technology and realize, from the triangular mesh algorithms to optimize each step are described in detail.

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.

JAVA设计模式 让开发者了解如何去开发一个项目-JAVA Design Mode allows developers to understand how to develop a project

文件上传下载系统源码，-file upload download source code.