基于osg的三角网生成

windows_NT_文件系统内幕(中文版)_全部章节以及源代码-Insider windows_NT_ file system (Chinese version) _ all the chapters, as well as the source code

有定时和调时等功能，同时还具有到点报时功能，自己可以任意设定-On a regular basis and adjusted when the functions, but also with the time counting function, they can arbitrarily set

代码实现windows界面的基础绘图功能，其中包括对文档的操作和绘制多种曲线。

1、设置自己计算机的开、关机时间 2、控制自己计算机的工作时间 3、记录违规使用计算机人员的使用的次数-a set up their computers open, 2 shutdown time, to control their own computer three hours of work, the illegal use of computer records of the number of

For certain source coding problems, it is well known that the Kraft inequality provides a simple sufficient condition for the existence of codes with given codeword lengths. Motivated by this fact, a sufficient condition based on the Kraft inequality can also be sought for the problem of zero-error instantaneous coding with decoder side information

哈工大 数据结构 课程设计 洗衣房管理系统 VB。Net实验-Curriculum design data structure HIT Laundry Management System VB. Net Experiment

socket通信的一些说明文档，非常详细，有需要的朋友欢迎下载-socket communications in a number of documentation, very detailed, there is a need to welcome a friend to download

send and receive data via com port application

这是一个制作汉汉堡的游戏，玩家阿在指定时间按要求做汉堡，否则扣分，成功为过关-this is a production-Hamburg game, players Albania in the specified time required to do in Hamburg, otherwise the offense, the success of the clearance

设T[0:n-1]是n个元素的一个数组。对任一元素x，设S(x)={i|T[i]=x}。当|S(x)|>n/2时，称x为T的主元素。设计一个线性时间算法，确定T[0:n]是否有一个主元素。-Set T [0: n-1] is the n elements of an array. Of any element x, set S (x) = (i | T [i] = x). When | S (x) |> n/2 when x for T said the main element. Design a linear time algorithm to determine the T [0: n] whether there is a main element.