数值分析中Doolittle算法的仿真程序，我找了好久才找到的！

本帮助文件中的Windows API 函数大约有774个，共分十二大类，基本上包括了大部分的常用和非常用的Windows API 函数。-The help files in Windows API function has about 774, divided into twelve categories, basically most of the commonly used and very used to Windows API functions.

casio DT-930范例 MOT .RAR-casio DT-930 sample MOT.RAR

1. 发卡服务端：Server 项目文件：autojet.prj 2. 计费客户端：Client 项目文件：internet.prj Explorer.prj 先启动Explorer.exe, 再启动internet.exe 3. 数据库脚本 INIT（原版）.SQL 和 New init.sql（新版），数据库名 NetBar 4. 动态连接库： NETBAR.dll hookdll.dll 5. 大学生公寓城System ID为5046 其余程序说明全在程序内的文本文件中说明-1. round card service end: Server project document: Autojet.prj 2. costs the customer end: Client project document: Internet.prj Explorer.prj First starts Explorer.exe, then starts internet.exe 3. databases scripts INIT (first edition) SQL and New init.sql (new edition), database NetBar 4. dynamic connections storehouses: NETBAR.dll hookdll.dll 5. university students lodgings city System ID is 5,046 other procedures explained all explained in the procedure text documents

verilog HDl 交通灯的实现,而且这是有别于一般的vhdl语言-verilog HDl traffic light

泡泡堂，和盛大的游戏非常类似，功能差不多，大家可以相互参考学习下-Bubble Hall, and Shanda" s games are very similar to a similar product, we can learn from the next cross-reference

a simple logging cla-a simple logging class

《算法分析与设计》中的 “矩阵连乘程序”给定n个矩阵｛A1,A2,…,An｝，其中Ai与Ai+1是可乘的，i=1,2 ,…,n-1。由于矩阵满足乘法的结合律，根据加括号的如何确定计算矩阵连乘积的计算次序，使得依此次序计算矩阵连乘积需要的数乘次数最少。

建筑工程类的一些规范，欢迎下载，或许有用-some kind of construction norms, welcome to download, perhaps useful

通过欧几里德距离对三维空间内的数据点进行聚类： 从文件读入三列表示坐标的数据进行聚类。按项目总数和组数平均划分。首先计算两两之间的距离，选出最近的两个点，再按距离由小到大排序，找出距这两个点最近的若干个点。 除去这些点后对其余的点重复进行上述操作。-By Euclidean distance on three-dimensional space, clustering of data points: from the file read into the three coordinates of the data indicated that cluster. According to the average number of total number of projects and group division. First, calculate the distance between 22 to elect the nearest two points, and then from small to large order to identify these two points away from a number of recent points. After removing these points the rest of the point of repeating to carry out such operations.

动态计算网络最长最短路线-dynamic computing network longest shortest route