Verilog大量例程，可用于Verilog的学习

JSP网络编程资料，PDF文件，对学习有帮助-JSP network programming information, PDF files, helpful for learning

crystal report dataset

地震资料处理中的存储问题,学地震的,欢迎共同探讨-seismic data processing storage problems, learning earthquakes, welcome to explore

c language curriculum design topics, can be achieved: increased staff records delete staff records find staff records amend trade union records with staff records and other functions. From beginner c language source code is very useful.

Keil Cx51 V7.0 单片机高级语言编程与uVision 2 应用实践电子书-Keil Cx51 V7.0 Single-chip high-level language programming and the application of the practice of e-books uVision 2

某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有 n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定 n口油井的位置,即它们的 x 坐标（东西向）和 y 坐标（南北向）,应如何确定主管道的最优位置,即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置,使得给定n口油井的位置,编程计算各油井到主管道之间的输油管道最小长度总和。 -An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time in charge of Road to determine the optimal location, making a given n the location of oil wells, programmed to calculate the well-to-charge of Road between the length of the sum of the smallest oil pipeline.

Navida之GPU编程资料。3d图形开发必备资料！-Navida of GPU programming information. 3d graphic development of essential information!

不错的电子书籍――“富爸爸财务自由之路”-good e-books-- "Dad road to financial freedom"

Java学习从入门到精通，非常适合初级java爱好者-Java learning from entry to the proficient and very suitable for the junior java lovers

关于串口理论文章，Powerpoint格式-theoretical articles on the serial port, Powerpoint format