资源列表
shujujiegou
- 对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型），对自己所创建的图完成以下操作： -For any given map (not less than 20 vertices, edges not less than 30, the type of map can be a directed graph, undirected g
ground-penetrating-radar-
- 地质雷达数值模拟软件，能够实现二维和三维的数值模拟-Ground penetrating radar simulation software, enables two-dimensional and three-dimensional numerical simulation
atan_lgam1_Arcsn
- 该版本的单复变程序增加了三个函数：复反正切函数atan(x+yi),实Γ函数，实反椭圆正弦函数（即雅可比分号形式的第一类[不完全]椭圆积分）Arcsn(e x),0<=e<=1,-1<=x<=1。-This version of the single complex variable program adds three functions: complex tangent function atan (x+ yi), the real function of Γ, th
modulation
- 实现函数信号发生器功能 可采用调频、调幅等方式对信号调制并有图形。复制和频率在一定范围内连续可调。-Function can be used to achieve the function signal generator FM, AM, etc. on the signal modulation and a graphic. Copy and frequency adjustable within a certain range.
number
- 通过Visual Basic编写的基本的水仙花数的运算程序，内容适合新手，代码简单通俗易懂。-Written in Visual Basic through the basic procedures for computing the number of daffodils, content suitable for novice, simple and easy to understand code.
yichuansuanfa_01
- 用C#实现了最基本的遗传算法，即单节点交叉变异的遗传算法。可以通过阅读代码自行修改-Using C# to achieve the most basic genetic algorithm, that is a single node in the genetic algorithm crossover and mutation. You can modify the code by reading
joke
- 约瑟夫环问题：设编号为1，2，3，……，n的n(n>0)个人按顺时针方向围坐一圈，每个人持有一个正整数密码。开始时任选一个正整数做为报数上限m，从第一个人开始顺时针方向自1起顺序报数，报到m是停止报数，报m的人出列，将他的密码作为新的m值，从他的下一个人开始重新从1报数。如此下去，直到所有人全部出列为止。令n最大值取30。要求设计一个程序模拟此过程，求出出列编号序列。-Josephus problem: Let numbered 1,2,3, ... ..., n of n (n>
xindaoC
- 信息论编程信道容量计算，C语言。编译环境为DEV_C-Information theory, channel capacity calculation programming, C language. Compiler environment DEV_C
nco
- A numerically-controlled oscillator (NCO) is a digital signal generator which creates a synchronous (i.e. clocked), discrete-time, discrete-valued representation of a waveform, usually sinusoidal.
L1_Tracking_v4_release
- 该程序将计算机视觉的目标跟踪问题转化为寻找稀疏矩阵的过程，将预先的得到的样本粒子与稀疏矩阵线性相乘得到目标-The program will target tracking in computer vision into the process of finding a sparse matrix, the sample will be obtained in advance of the particles multiplied with the goal of sparse linear
TDOA-Fang-in-cellnet
- 蜂窝网TDOA定位算法的一种Fang算法，我自己测试过的。-Cellular TDOA algorithm of a Fang algorithm, I tested.
N-gram
- 在分析了传统的分类模型后 ,文中提出了用N元语言模型作为中文文本分类模型。根据该方法 ,设计并实现一个基于词的2元语言模型分类器。-After the review of traditional text classi fication models , a method using N2gram language models to classi fy Chinese text was presented. With the bi2gram model, a text classi fie