资源列表
boundary
- 用c++编写的地震数据处理中边界判断程序-Seismic boundary with c++ written procedures for determining
fft
- 用C++编写的一维和二维快速傅里叶变换程序-Prepared with C++ one-dimensional and two-dimensional fast Fourier transform procedure
fogeo3d
- 用c++编写的三维地震显示程序,软件及其应用实例-Prepared with c++ D seismic display program, software and application examples
Matlab-Trans-C
- 在matlab下如何调用c语言编写的程序,包括编译器的选择和设置-In matlab how to call the c language program, including the compiler options and settings
code
- 这是传统的仿射传播算法的基本代码和Sil有效评价指标的基本代码,举例说明了一下,操作简单易学、易掌握-This is the basic code of affinity propagation algorithm of traditional basic code and Sil effective evaluation index, illustrated, easy to learn, easy to master
Integer_Partition
- 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+...+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) 例如但n=4时,他有5个划分,{4},{3,1},{2,2},{2,1,1},{1,1,1,1} -Integer division
biaodashiqiuzhi
- 数据结构 表达式求之/翻译 主要用的队列知识-Expressions translation data structure
rate-equ
- 速率方程求解,的详细过程。还有范例,方便一步一步学习-Rate equations, the detailed process. There sample rate equations, the detailed process. There are examples
C-random-walk
- 用C语言实现的随机漫步算法的模拟,最终的计数器数组,显示出漫步的“密度”,即输出在实验中每一块瓷砖被接经过的次数。-C language simulation of random walk algorithm, the final counter array, showing stroll " density" , ie each output in the experiment was taken after a number of tiles.
demo
- 基于VC++的灰度车牌定位系统 开发环境vc6.0-Based VC++ gray plate positioning system development environment vc6.0
migong
- 数据结构大作业“迷宫搜索”的MFC程序。含深度优先和宽度优先两种演示,可以鼠标编辑地图。界面良好,代码清晰。-Data structure operations " Labyrinth search" MFC program. Containing two kinds of depth-first and breadth-first presentation, you can edit the map mouse. Good interface, clear code.
capacity-limit-traffic-assignment
- 本代码是容量限制交通分配的代码。但是不通过完整的OD表进行配流,而是针对组成OD表的逐一起始点、终点的基础数据进行配流。路权是取的BFR函数,加了距离惩罚函数。-This code is the capacity limit traffic assignment code. But not through the complete OD table assignment, but for each table consisting OD initial, end with the underly
