搜索资源列表
qiege_new
- //多边形切割 //可用于半平面交 //将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-/ / polygon cutting / / can be used for half-plane AC / / will polygon along l1, l2 determined by the straight line cutting in the side cutting side, ensuring l1, l2, side not collinea
qie_ge_new
- 将多边形沿l1,l2确定的直线切割在side侧切割,保证l1,l2,side不共线-will polygon along l1, l2 cutting straight to determine the lateral side of the cutting, guaranteed l1, l2, side is not collinear
Lyapunov_Terra
- 当计算混沌系统Lyapunov指数时，gs.m代码实现正交化 直接运行L2.m，可计算出Lyapunov指数（该代码是基于奇异值分解计算Lyapunov指数的） -chaotic system when calculating Lyapunov exponent, gs.m code directly Orthogonalization L2.m operation, translate into Lyapunov exponent (The code is based on the
111
- 快速可靠的GPS (全球定位系统)系统仿真可对双频GPS 接收机的设计、接收算法的研究 提供有效的帮助。文中详细介绍了在MatLab/Simulink 环境下GPS 系统仿真平台构建的基本方法。 首先分析了GPS 系统的各个环节，说明了各模型在仿真中的实现方法；然后给出了完整的系统仿 真框图，并在此平台上实现了GPS L2 载波相位跟踪的仿真。结果表明该仿真平台有效、可靠
linear_system_identification.tar
- The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is
MAIN 3-DIMENSIONAL CFD-PROGRAM
- #//u(i,j) x方向的速度u;或者θ方向速度uθ #//u(i,j) y方向的速度v;或者径向速度ur'h\K #//pc(i,j) 压力修正 p'[OS #//p(i,j) 压力p-=5-+ #//p(i,j)
TwIST_v2
- % demo_l2_l1 - This demo illustrates the TwIST % algorithm in the l2-l1 optimization problem % % xe = arg min 0.5*||A x-y||^2 + tau ||x||_1 % x % % where A is a generic matrix and ||.||_1 is the l1 norm. % After obtaining the solution we implement a
hkbu2005.rar
- 介绍了构造均匀设计表的好格子点算法与生成原理，以中心化偏差为均匀性测度，使用MATLAB编写了生成中心化偏差值最小的均匀设计表的计算机通用程序，通过与文献比较，验证了程序的正确性，得到了更多的均匀设计表,The principle and good lattice points designing uniform design table are introduced，the general MATLAB programs for uniform design table are propose
TV算法 L2 Total Variation
- L2 Total Variation 算法
tvt
- Code for L2-optimal three view triangulation based on calculation of stationary points
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op
Narama-L2
- 介绍基于神经网络的反馈线性化控制过程。反馈线性就是利用反馈的控制手段来消除系统中的非线性，以使的其闭环系统的动力学方程是线性的。-Introduced based on neural network feedback linearization control process. Feedback linearization is to use feedback control to eliminate the non-linear system, so that its closed-loop
libsvm-2.89
- 是一種線性方成的分類器。SVM透過統計的方式將雜亂的資料以NN的方式分成兩類，以便處理。LIBLINEAR is a linear classifier for data with millions of instances and features. It supports L2-regularized logistic regression (LR), L2-loss linear SVM, and L1-loss linear SVM. -Main features of LIBLINEA
Errest
- 关于有限元的数字计算误差，分别有L2误差和H1误差-On the number of finite element calculation error, respectively, L2 and H1 error error
chi_square_distance
- C++ and Matlab work togather to compute the distance between to sets of vectors or matrix (chi-suare, X2, L2 and etc.)
ROF
- ti is TV-L2 model for deblurring image
SHAOXIANGBAIFO
- 1、指标信号，仅当参考；理解理念，才更重要！指标中大阳支撑的理念，请大家适当参考；其余提示信号，均可只当戏玩，不可生搬硬套！ 2、【烧香拜佛】指标极其简单，不可单独使用，请结合盘面热点、板块龙头等情况，综合考虑目标的机会。 3、该指标对于进入主升浪、台阶式上涨的目标，最为有效！ 下面给出大智慧L2、飞狐、通达信三种常用软件的版本源码，请需要的朋友适当参考。 -1, indicator signal, only when the reference understand the co
HUFMM
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路长度记为WPL=(W1*L1+W2*L2+W3*L3+…+Wn*Ln)，N个权值Wi(i=1,2,…n)构成一棵N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,…n)。可以证明哈夫曼树WPL是最小的。-Huffman tree is also called the optimal bina
BIHT-l2
- 为了解决二进制CS而编写的算法，使用了用l2范数最小化-an algorithm for binary CS,using l2 norm
changed-BIHT-l2-1
- 改进了BIHT l2 中的观测矩阵，实验结果证明，误差更小了-change BIHT l2 ，perform better