通过该程序代码可以快速的进行深圳地图低层方面的图片拼接(以上代码要借助文件)...

bellman-ford的模板，方便大家使用，可以直接粘贴使用-bellman-ford template to facilitate the use of paste can be directly used

对数字设计工程师的要求，与考核。是一个简要的说明-of digital design engineers, and assessment. A summary of the note

Windows上的挖地雷游戏.rar-Windows dug mines on the game. Rar

VB API编程精粹,精选VB API,用典型的实例说明api应用-VB API programming essence Featured VB API, with examples of typical applications api

系统记录器，可以自动记录系统的创建时间，文件夹-records system that can automatically record the creation time and folders

学习VC++时做得小练习，基于单文档应用的简单的数据库编程，易于出血者的使用，实现最基本的数据库管理功能-learning VC when doing small exercises, based on the application of the single-file database programming simple and easy to use bleeding, achieve the most basic database management functions

基于可编程跨导运算放大器POTA低通有源滤波器设计。该文给出了基于可编程跨导运算放大器(POTA)的有源滤波器设计方法，能在一定范围内实现跨导值程控调节, 提高调节精度和准确度。并且利用Jacobi 法求解相似对角形矩阵，避免解高次方程的难题。所设计的有源滤波电路不易受分布电容的影响，稳定性好、灵敏度低。本文给出了设计实例，显示了该方法的优点。-Based on programmable transconductance operational amplifier POTA low-pass active filter design. In this paper, based on the programmable transconductance amplifier (POTA) of the active filter design method that can realize in a certain range transconductance value of program-controlled adjustment, improve precision and accuracy regulation. Jacobi method and use a similar matrix of angular, high-equation solution to avoid problems. Designed active filter circuit less susceptible to the effects of distributed capacitance, good stability, low sensitivity. In this paper, design examples, showing the advantages of the method.

字体颜色一个小程序-font color a small program

LEON3 SOC GRlip IP core. Memory controller.-LEON3 GRlip SOC IP core. Memory controller.

最佳适应算法是动态内存分区分配算法的一种。所谓“最佳”是指每次为作业分配内存时，总是把能满足要求、又是最小的空闲分区分配给作业，避免“大材小用”。为了加速寻找，该算法要求将所有的空闲分区按其内容以从小到大的顺序形成一空闲分区链。这样，第一次找到的能满足要求的空闲区，必然是最佳的。-best adaptation algorithm is a dynamic memory allocation through an algorithm. The so-called "best" means the operation of each memory allocation, always meet requirements, and also the smallest area allocated to idle operations, to avoid "a waste of talent." To speed up the search, the algorithm requires that all leisure district according to content from small to large order of the formation of a regional chain idle. So, the first found to meet the requirements of the free zone will be the best.