搜索资源列表
GP_Algorithm_luzhenbo
- G-P算法计算关联维的 Matlab 程序 (升级版，mex函数，超快) 作者：陆振波，海军工程大学 欢迎同行来信交流与合作，更多文章与程序下载请访问我的个人主页 电子邮件：luzhenbo@sina.com 个人主页：luzhenbo.88uu.com.cn 更新部分： 引入限制短暂分离参数，使该参数大于序列平均周期时，去除了同一轨道前后点的关联， 使 r 值较小时，ln r - ln C(r) 曲线接近线性 文件夹说明： 1、GP_Alg
关键路径
- (1)输入E条弧<j,k>,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1<=i<=n-1).如果得到的拓朴有序序列中顶点个数小于网中顶点数n,则说明网中存在环,不能求关键路径,算法终止 否则执行步骤(3)(3)从汇点v出发,令vl[n-1]=ve[n-1],按逆拓朴排序求其余各顶点的最迟发生时间vl[i](n-2>=i>=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
e
- 这是一个球点电荷外电势分布的程序，很好用，顶一下吧。-This is a ball point charge potential distribution of foreign procedures, very good, and the top about it.
fixed_point
- Fixed-Point iteration-Function fixed_point(p0, N) approximates the solution of an equation f(x) = 0, rewritten in the form x = g(x), which is a sub-function the user has to enter. the call to the function fixed_point(p0, N) returns the root of the eq
Basics_of_Quantum_Computation
- Basics of Quantum Computation 1 What is the point in Quantum Computation 1 1.1 Preview 1 1.2 A First View of the Advantages 5 1.3 Is Physics Nothing Else But Computation ? 12 2 First Quantum Computations 15 2.1 Quantum Bits, or Qubits 15
golden_cut_method
- 2． 黄金分割法的的核心思想是逼近，而最终结果的精确程度取决于相对精度e的大小，e越小，结果越精确，迭代次数越多，这一点从图一的程序运行结果中可以很明显的看出。 3． 程序运行过程中首先输入初始区间[0，1]，然后输入迭代后最后区间的长度0.2，最后得出极小值和极小值点。 -2. Golden section method is the core idea of approximation, while the final result depends on the precise re
IndoorlocationTrackingUsingRSSIReadingsfromasingle
- 通过单一的Wi-Fi接入点的信号强度来判断移动物体的位置。比较新的一篇文章。用了蒙特卡罗抽样的办法－Monte Carlo Sampling Method－来估计位置。-This paper describes research towards a system for locating wireless nodes in a home environment requiring merely a single access point. The only sensor reading
ALGO2-1
- lgo2-1.c C program for implementing Algorithm 2.1 Algorithm translated to C by: Dr. Norman Fahrer IBM and Macintosh verification by: Daniel Mathews NUMERICAL METHODS: C Programs, (c) John H. Mathews 1995 To accompany the text: NUME
logrank
- Comparison of two survival curves can be done using a statistical hypothesis test called the log rank test. It is used to test the null hypothesis that there is no difference between the population survival curves (i.e. the probability of an event oc
sign_flip
- Descr iption Although the Singular Value Decomposition (SVD) and eigenvalue decomposition (EVD) are well-established and can be computed via state-of-the-art algorithms, it is not commonly mentioned that there is an intrinsic sign indeterminac
cPMsuanf
- 关键路径通常是在拓扑排序的基础上求得的。本文算法中设计了一些独特的数据结构，在算法运行的整个 过程中，求发点(源点)到收点(终点)的关键路径的过程(入栈、出栈等操作)实际只进行一遍，不需要进行拓扑排序，算法的时间 复杂度为O(n+e)，较传统的算法效率更高-Critical path is usually calculated based on the topological sort of. This algorithm designed some unique data struct
subimage
- Subimage.m is a MATLAB function that extracts a part of the image specified by its parameters. The image should be a binary image (e.g. not color image).Function elements: f-binary image m,n-dimension of extracted image rx,cy- starting point of
2
- 有一只电子老鼠被困在如下图所示的迷宫中。这是一个12*12单元的正方形迷宫，蓝色部分表示建筑物，白色部分是路。电子老鼠可以在路上向上、下、左、右行走，每一步走一个格子。现给定一个起点S和一个终点T，求出电子老鼠最少要几步从起点走到终点-Have an electronic mouse trapped in the maze as shown below. This is a square of 12* 12 unit maze, the blue part of that building, t
b
- ：DBSCAN是一个基于密度的聚类算法。该算法将具有足够高密度的区域划分为簇，并可以在带有“噪声”的空间数 据库中发现任意形状的聚类。但DtLqCAN算法没有考虑非空间属性，且DBSCAN算法需扫描空间数据库中每个点的e一 邻域来寻找聚类，这使得DBSCAN算法的应用受到了一定的局限。文中提出了一种基于DBSCAN的算法，可以处理非空 间属性，同时又可以加快聚类的速度。-: DBSCAN is a density-based clustering algorithm. The alg
(Dijkstra)-a-shortest-path-algorithm
- 大概流程如下： 初始对每个点e，令v[e]=0，dis[e]=inf 令起点dis[s]=0 每次找出p，使得v[p]=0，并且dis[p]最小 令v[p]=1 对每个和p相邻的q，用dis[p]+distance[p,q]去更新dis[q] 直到找不到v[p]=0-Probably process is as follows: For every dot e, initial [e] to v = 0, dis [e] = inf Make starting
six
- 抛物型方程的有限差分法——六点对称格式，即Crank-Nicolson格式-Parabolic finite difference method- six point symmetric form,i.e.Crank-Nicolson Form
OFDM_rece_matlab
- 一个OFDM符号128个有效符号，插入128个虚拟子载波 符号率（即有效数据率）fsymbol，而发送速率（需要包括虚拟子载波）2fsymbol 输入的数据需要2倍的发送数据率，以便进行内插，实现位定时跟踪，即4倍fsymbol采样率的调制信号 OFDM symbol Nfft=128 points 一个OFDM符号数据点 Nfft*2 = 256 ， Guard Interval点 ＝Ng*2=64 - a OFDM symbol 128 effective s
six
- 简单六杆机构的matlab编程实例，可求出六杆中各杆的角位移，角速度，角加速度和e点的速度与加速度，并绘制图像。-Simple six institutions Matlab programming examples, can be obtained the rod angular displacement, angular velocity, angular acceleration, and e point in six velocity and acceleration, and draw