词典

分酒问题C++源代码-hours liquor issue C source code

用差分方法求解沃尔泰拉方程，此处为一个变元的方程，由于该方程同时含有微分和积分，一般求解有一定的困难。-use of the finite difference method for Volterra equation here as a variable element of the equation, As the same time contain differential equations and integral, the general solution is definitely difficult.

图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -err

应用背景的今天，剧本TFR的计算和信号代预计将完全兼容GNU Octave，但用户写几行代码来产生时频图。关键技术假设每个类的特征都是由高斯分布具有相同的已知协方差，但不同的手段它可以证明（杜达等，2000），LDA是最优的，因为它最大限度地减少误判率。在布兰卡茨等人（2011）所示的假设不同手段的一个共同的类协方差的很好地满足脑电分类问题。

二叉树的后序算法(递归)-after the sequence of binary tree algorithm (recursive)

研究生期间上《数值计算方法》课的作业，所有代码都是C语言实现并调试通过，现在上传为大家服务。这是带权算法-This is the assignment of numerical analysis course during my graduated education,all the codes are realized by C language,and have been debugged successfully,here I d like to share it with all of you.This one realized the algorithm of weighting

DBSCAN(Density-Based Spatial Clustering of Applications with Noise)是一个比较有代表性的基于密度的聚类算法。与划分和层次聚类方法不同，它将簇定义为密度相连的点的最大集合，能够把具有足够高密度的区域划分为簇，并可在噪声的空间数据库中发现任意形状的聚类。

This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C++ derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C++ 6 on a Windows 2000 platform.-This algorithm was developed by Professor Ronald L. Rivest of MIT and can be found presented in several languages. What I provide to you here is a C derivative of the original C implementation of Professor Rivets. The library code itself is platform-independant and has been tested in Redhat Linux. I ve included the sample code and makefile that I used for the Linux test. The demo, however, was written with Visual C 6 on a Windows 2,000 platform.

Delaunay三角剖分为点的平面内的一组P是三角测量的DT（P），使得在P点没有任何三角形DT中（P）的外接圆内。 Delaunay三角最大化在三角测量三角形的各角的最小角度;他们倾向于避免骨感三角形。

应用背景In generated networks, selecting one node as source and some nodes as receivers in random (single source multicast network), we make performance test for network coding based multicast route algorithm (we put forward it ourselves, corresponding to high multicast rate and low multicast rate), shortest path distribution tree route algorithm (DIJKSTRA algorithm) and Maximum-rate distribution tree route algorithm (PRIM algorithm), respectively. 关键技术 In this program, two things have been done: (1) generate random topologies (2)performance test。   network coding cap:     5.0000  dijk cap:     5.0000  prim cap:     5.0000  network coding res1:     0.0000--res2:    12.0000  dijk res:    14.0000  prim res:    14.0000  average degree:     2.