老牌的论坛策略游戏，很经典的，中文名《星际迷航》

ATA-IDE的接口规范，对开发硬盘驱动程序很有用。-ATA-IDE interface specification for the development of hard disk driver useful.

学习图形学时做的一个小玩意，模拟了太阳系8大行星的公转与自转，有兴趣的可以-Learning when to do a graphics gadgets to simulate the 8 planets of the solar system revolution and rotation, are interested in can

This is a modified version of the 99 line Matlab codes for topology optimization. The physical field is set to be temperature fleids. The problem to solve is the classical volume to line heat transfer problem, as well as the problem of the heat dissipation of flat surface by a pipe.

vc++编写的一个圣诞贺卡程序，可以更改其中的各个项目音乐等-written in vc++ a Christmas greeting card program, you can change various projects in which music. . .

本篇文档详细介绍了VIVI的启动过程和移植过程 -This document details VIVI startup process and the process of organ transplant

这是模式识别中关于k均值动态聚类算法的matlab源码-This is the pattern recognition on the k-means clustering algorithm Matlab FOSS

这款 可以测量 你的 系统 的 显示卡的 性能优良状态。

一个简单的模拟喷泉的VB代码，教你有关图片的运用-Simulation of a simple fountain of VB code, teach you about the use of Picture

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.

have playing search print and many very good contcent