搜索资源列表
checkbounds
- ％CHECKBOUNDS Move the initial point within the (valid) bounds. ％ [X,LB,UB,X,FLAG] = CHECKBOUNDS(X0,LB,UB,nvars) ％ checks that the upper and lower ％ bounds are valid (LB <= UB) and the same length as X (pad with -inf/inf ％ if necessary) wa
DEFINEV
- ％DEFINEV Scaling vector and derivative ％ ％ [v,dv]= DEFINEV(g,x,l,u) returns v, distances to the ％ bounds corresponding to the sign of the gradient g, where ％ l is the vector of lower bounds, u is the vector of upper ％ bounds. Vector dv is
Statistics-ROC-0.04.tar
- A Perl module implementing receiver-operator-characteristic (ROC) curves with nonparametric confidence bounds
matlabdrawing
- 1) 已知x=[1:15], y=[12 34 56 78 99 123 165 198 243 277 353 345 303 288 275], 用多项式进行拟合，给出拟合多项式，(所选拟合多项式阶数不同，拟合结果不同，请你选择适当的阶数进行拟合)，并绘出原始数据点、拟合曲线和95％置信区间（confidence bounds）的图形 . 2) 根据下面数学模型建立仿真模型，并在一个示波器中把它们的波形仿真出来。
flexible
- Flexible Vector and Matrix Classes enable to use vectors and matrixes with arbitrary bounds. Content. 1. Algorithm 2. Classes 3. Program Files 4. Tests 5. Compiling 6. Running (Log File) 7. Download
IGA
- 一种基于免疫原理的遗传算法 unction [bestever,endAnti,bPop,traceInfo,memory,Found]=ia(memory,popsize,bounds,evalFN,evalOps,... maxgen,precision,pcross,pmutation,maxmemnum,selectOps)
GaTest
- 这是一个非常简单的遗传算法测试源代码，用户只需改变常数的定义并且定义“评价函数”即可。 要求输入的文件应该命名为‘gadata.txt’；系统产生的输出文件为‘galog.txt’。 输入的文件由几行组成：数目对应于变量数。且每一行提供次序——对应于变量的上下界。 如第一行为第一个变量提供上下界，第二行为第二个变量提供上下界，等等。-This is a very simple genetic algorithm to test the source code, users only
superlu_3.1.tar
- SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perf
matlab
- matlab环境下目标函数为求最大值，且解非负整数解 ％bounds 边界约束 ％Myfun 为目标函数 ％num 初始种群数 ％N 最大迭代次数 ％CP 交叉概率 ％P 突变概率 ％f 目标最优解 ％x 最优解向量-matlab environment for the sake of the objective function value, and the solution of non-negative integer solutions％ bounds b
optimal-decision
- 最优决策——用几个matlab编程的实例阐述分支定界法的思想是：首先确定目标值的上下界-Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds
SGA
- 代码没有任何图形，甚至也没有屏幕输出，主要是保证在平台之间的高可移植性。要求输入的文件应该命名为‘gadata.txt’；系统产生的输出文件为‘galog.txt’。输入的文件由几行组成：数目对应于变量数。且每一行提供次序——对应于变量的上下界。如第一行为第一个变量提供上下界，第二行为第二个变量提供上下界，等等。 -Code without any graphics, or even no screen output, mainly to ensure a high portability
CRB_final
- This the CRB caculated for an OFDM system to compair belind channel estimation. CRB is Cramer Rao bound and it is the lowest bound for analyzing the devlopement of algorithms of channel estimation. -This is the CRB caculated for an OFDM system to c
STRSCNE
- 给出变量的上下边界、初值和代价函数，能够搜索代价函数最小值时的变量取值。属于带约束的优化算法，可以用来求算非线性方程组。-STRSCNE is a Matlab code for constrained nonlinear systems of equations F(x)=0 l<=x<=u where F: R^n--> R^n, l and u a
3
- 实现二分法求解方程。编写并使用以下函数： double SolveRoot(double(*pf)(double x),double a,double b,int n) 这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a<=x<=b)， n是循环次数。例如，如果f(x)=x*x-2，则SolveRoot (f,1,2,100)将返回1.414213562373095， 即方程为x*x=2的解。二分法的原理是反复地把区间分为两个
graphy_theory
- 关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配，弦图判定，一般图最大匹配，有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed
flow
- 上下界的最大最小流合成模板 高效率算法 网络流-Bounds of the maximum and minimum flow of synthetic template efficient network flow algorithm
NumericalMethods7.1
- Numerical analysis continues this long tradition of practical mathematical calculations. Much like the Babylonian approximation of \sqrt{2}, modern numerical analysis does not seek exact answers, because exact answers are often impossible to obtain i
thetabounds
- For a given array of angles, determines which are within the bounds, accounting for wrap around
fminsearchbnd
- Fminsearch不承认的约束限制。 不过简单的转换方法存在 转换成一个绑定的约束问题 无约束问题。 Fminsearchbnd用于酷似fminsearch， 除了边界应用到变量。 应用于国内的界限，利用 改造中的变量。 （二次型 单式，双罪恶界（十）。） 具有包容性的不平等的界限，它承认 边界值本身，但不准 在所有函数之外的范围评估。 请注意，fminsearchbnd允许用户准确地固定在某个给定值通过设置一个变量的确切
Error-bounds-for-compressed-sensing-algorithms-wi
- Error bounds for compressed sensing algorithms with group sparsity A unified approach