LOOK MY HART LOOK YOUR FACE

从微软网站上下的,介绍了公共裤Compact Framework 2.0_OpenNETCF Smart Device Framework 2.0.rar的新增内容,转发给同行--windows mobile开发者-From Microsoft

Catia script generated form VB. Very usefull for catia users, This macro is used to all catpart to needed cat formats automatically in a folder.

IIS5.0安装所需的系统文件 appconf.d-IIS5.0 to install the required system files appconf.d

这个程序可以计算给定点处的小区信号范围覆盖。-is program computes a map of visibility from a selected point on a topography. It has been written to help the search for radio relay best location. Because it considers only direct line of sight, it gives a good estimation for possible radio link for short distances only (less than 10 km), neglecting curvature of the Earth, Fresnel zone and atmospheric refraction on radio waves propagation. The program computes the relative elevation angle of the mask for each point (the angle is null or negative if the point is visible). The function needs a digital elevation model Z and associated (X,Y) vectors or matrices of coordinates (same unit as Z), position of the point (X0,Y0), the antenna height H0 (for instance 4 m), and the hypothetic antenna height Ha on each topography points (for instance 3 m). When no output argument is given, the function plots a map of the results (color map of mask angles, and blank for visible points, see example screenshot). The s

这是界面美观的好帮手,也是朋友给我的,请大家-This beautiful interface a good helper, but also to my friends, let us look at the good

应用于电子商务行业，具有重要的应用价值；-Used in e-commerce industry, has important application value

Ajax 无刷新聊天室源代码，可供大家学些一下。-Ajax without refreshing the chat room source code, available to learn about everyone.

php anonymouse mail sender

计算机类基础课程教材，计算机组成原理（第二版）-Computer Class-based curriculum materials, computer Composition Principle

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )