Search - iteration

Search - iteration - List

[Other] Patternmatching4 DL : 0: 结合分级关键点互相关迭代法与搜索空间标记法,设计了一种有效提高图像相关匹配速度的算法。其中分级关键点互相关迭代算法快速实现了由重要到不重要像素点的逐级迭代互相关匹配计算,算法在保证精度的前提下可以随时结束并输出相关匹配值而搜索空间标记法则能快速排除掉大量参数空间内不可能匹配的点。实验证明,这种算法能在正确配准图像的前提下大幅度提高匹配速度。-Combination of inter-related key points classification iteration method with search space notation, design an effective image correlation matching to improve the speed of the algorithm. One key point grading iterative cross-correlation algorithm for the rapid realization of important to unimportant by pixel matching level iterative cross-correlation calculation, the algorithm to ensure the accuracy of the premise can be concluded and the output value of the relevant search space matching tag rules quickly ruled out a large number of parameter space points can not be matched. Experiments show that this algorithm can be in the right image registration under the premise of substantial increase in matching speed.
Date : 2025-12-31 Size : 97kb User : 李锋
[Other] 10implementation DL : 0: 10个重要的算法C语言实现源代码 10个重要的算法C语言实现源代码：拉格朗日，牛顿插值，高斯，龙贝格，牛顿迭代，牛顿-科特斯，雅克比，秦九昭，幂法，高斯塞德尔-10 Key C language implementation of the algorithm source code 10 Key C language implementation of the algorithm source code: Lagrange, Newton interpolation, Gaussian, Romberg, Newton iteration, Newton- Cortes, Jacobian, 9 Chin-chao, power law, high斯塞德尔
Date : 2025-12-31 Size : 319kb User : 张松宝
[Other] 0750677295 DL : 6: In this communication we review some recent advances in aggregate-functions approaches, that are based on the construction of efficient MoM basis functions by suitably grouping standard (e.g. Rao-Wilton-Glisson, RWG) functions. The application domains, objectives and related means of achieving them can be significantly different for the various embodiments of the aggregate-functions concept. Compressive approaches can reduce the degrees of freedom of the problem up to allowing a direct, iteration-free solution non-compressive multiscale approaches can act as effective pre-conditioners for iterative methods. For this reason aggregate-functions are well suited to solve antenna, EMC and scattering problems involving large and complex objects.-In this communication we review some recent advances in aggregate-functions approaches, that are based on the construction of efficient MoM basis functions by suitably grouping standard (e.g. Rao-Wilton-Glisson, RWG) functions. The application domains, objectives and related means of achieving them can be significantly different for the various embodiments of the aggregate-functions concept. Compressive approaches can reduce the degrees of freedom of the problem up to allowing a direct, iteration-free solution non-compressive multiscale approaches can act as effective pre-conditioners for iterative methods. For this reason aggregate-functions are well suited to solve antenna, EMC and scattering problems involving large and complex objects.
Date : 2025-12-31 Size : 5.79mb User : Duc Long
[Other] BS_LMS DL : 0: lms algorithm, simple example to implement the LMS algorithm, it s suitable for the beginner to understand the operation principle-I was trying out modifications of the LMS algorithm so that it will converge faster and the mean square error will also be smaller. Getting to one of the drawbacks of LMS, that it has only one controllable parameter "mu", the selection of whose value will be the most critical from design point of view w.r.t. convergence. So, I wanted to implement LMS in such a way that the step-size adapts to the error occurring in each iteration.
Date : 2025-12-31 Size : 36kb User : Jack
[Other] paikepdf2 DL : 0: 本文将排课五要素绑定、封装成课元、课栈两个向量，并以二维权值矩阵描述课元和课栈之间的关联系。提出了最佳匹配和遗传算法的排课算法，以随机生成的二维数字矩阵来反映课元和课栈的关联权重，对数字矩阵组处理和最佳匹配得到的匹配偶图组为遗传算法的初始种群，以排课各种原则的加权和为目标函数，在遗传算子控制下迭代来寻求更优的匹配结果即使目标函数最小的偶图匹配结构，进而得到满意的排课结果。提出了关联匹配和禁忌搜索的排课算法，以随机二维数字矩阵描述课元和课栈之问的关联权重，按照重权优先并根据正确性原则进行约简，获得课元和课栈之间的匹配偶图。在此基础上，引入禁忌搜索算法，以排课的完备性原则、合理性原则和人性化原则的加权和为目标函数，以随机二维权值矩阵生成的匹配偶图为初始解，对二维权值矩阵进行扰动构成搜索邻域，以生成的匹配偶图为禁忌对象，采用全局藐视准则，获得最优的排课方案。以Matlab为平台，利用Excd数据库和Mallab的互联实现数据交换，编写了两套算法的应用程序，通过实例来验证两套排课算法，结果表明两套算法是可行的。-Arranging the five elements of this paper, binding, packaging into a class element, class stack of two vectors and matrices described by two classes per Rights And the relationship between class stack link. Offers the best match and Genetic Algorithm Platoon algorithm to randomly generated two-dimensional figures to reflect the class element and matrix Class stack associated with weight, the digital matrix group received treatment and the best matching group bipartite graph matching the initial kind of genetic algorithm Group to the weighted course arrangement of principles and the objective function, under the control of the genetic operator iteration to seek the better match Results Results even if the objective function structure of the smallest bipartite graph matching, and then Timetabling satisfactory results. Match the proposed association Timetabling algorithm and tabu search, a random two-dimensional digital matrix element and the class description class stack of Q
Date : 2025-12-31 Size : 1.73mb User : 张林杰
[Other] Beginning.DX11.Game.Programming DL : 0: DirectX.11游戏编程的入门书籍，英文文字版，适合DirectX游戏编程爱好者。-This book is the follow-up edition to Wend y Jones’ s Beginning DirectX 10 Game Programming boo k. In this book, we teach you the basics of getting started with game graphics using the latest iteration of Direct3D: Direct3D 11. The goal of this book is to teach you the various aspects of DirectX 11. The target audience for this text is beginning/inter mediate C++ programmers with little to no experience with Direc tX. Although past DirectX or OpenGL experience can be useful, it is not required.
Date : 2025-12-31 Size : 2.57mb User : 爱吃菜
[Other] lamdaiteration DL : 0: power systems-lamda iteration
Date : 2025-12-31 Size : 2.49mb User : santhosh kumar
[Other] Foundation.HTML5.with.CSS3.2012 DL : 0: This book will show you how to create your own documents so you can share them on the Web. You’ll become intimately familiar with the rules and constructs of HyperText Markup Language (HTML), the computer language on which the Web is built. It’s a simple language, and the basic rules are easy to pick up and put to use. HTML is a tool, and once you know how to use it, you’re limited only by your imagination. Like any other language, HTML has changed and evolved over time. New features are added, existing features are redefined, and outdated features are removed. The latest iteration of HTML is HTML5— ostensibly the fifth version of the language—and it’s quite an evolutionary leap indeed. HTML5 incorporates a wide range of new features and introduces new types of functionality far beyond the humble text document.include Source code
Date : 2025-12-31 Size : 33.26mb User : Robin_le
[Other] Programming-Challenges DL : 0: We kick off this book with a collection of relatively elementary programming problems, none of which require ideas more advanced than arrays and iteration. Elementary does not necessarily mean easy, however! These problems provide a good introduction to the demanding nature of the robot judge, and the need to read carefully and understand specifications. They also provide an opportunity to discuss programming styles best suited to getting the job done. To help you get started, we begin with a description of the robot judges and their idiosyncrasies. We follow with a discussion of basic programming style and data structures before introducing our first set of problems. As in all chapters in this book, we follow with hints for selected problems and notes for further study.
Date : 2025-12-31 Size : 1.51mb User : m7md_3cs_fci
[Other] Component-Pruning-in-Gaussian DL : 0: 针对概率假设密度 (Probability hypothesis density, PHD) 高斯混合实现算法中的分量删减问题, 提出了基于 Dirichlet 分布的分量删减算法以改进概率假设密度高斯混合实现算法的性能. 算法采用极大后验准则估计混合参数, 采用仅依赖于混合权重的负指数 Dirichlet 分布作为混合参数的先验分布, 利用拉格朗日乘子推导了混合权重的更新公式. 算法利用负指数 Dirichlet 分布的不稳定性, 在极大后验迭代过程中驱使与目标强度不相关的分量消亡. 该不稳定性还能够解决多个相近分量共同描述一个强度峰值的问题-As far as component pruning in Gaussian mixture (GM) implementation of probability hypothesis density (PHD) is concerned, a component pruning algorithm based on Dirichlet distribution is proposed to improve the performance of Gaussian mixture implementation of probability hypothesis density. The maximum a posterior criterion is adopted for estimation of mixing parameters. Dirichlet distribution with negative exponent parameters, which only depends on mixing weights, is adopted as the prior distribution of mixing parameters. The update formulation of mixing weight is derived by Lagrange multiplier. The instability of Dirichlet distribution with negative exponent parameters is applied to driving the components irrelevant with target intensity to extinction during the maximum a posterior iteration. Besides, the problem that one peak of intensity is presented by several proximate mixing component
Date : 2025-12-31 Size : 1.23mb User : 正东
[Other] Multi_targetstat-sisdensityfilter DL : 0: 利用拉格朗日乘子推导了混合权重的更新公式. 算法利用负指数 Dirichlet 分布的不稳定性, 在极大后验迭代过程中驱使与目标强度不相关的分量消亡. 该不稳定性还能够解决多个相近分量共同描述一个强度峰值的问题, 有利于后续多目标状态的提取. 仿真结果表明, 基于 Dirichlet 分布的分量删减算法优于典型高斯混合实现中的删减算法-The update formulation of mixing weight is derived by Lagrange multiplier. The instability of Dirichlet distribution with negative exponent parameters is applied to driving the components irrelevant with target intensity to extinction during the maximum a posterior iteration. Besides, the problem that one peak of intensity is presented by several proximate mixing component, can be solved by this instability. It is useful for the following state extraction. Simulation results show that the component pruning algorithm based on Dirichlet distribution is superior to that of typical Gaussian mixture implementation
Date : 2025-12-31 Size : 685kb User : 正东
[Other] eld-lamda DL : 0: Economic load dispatch solution using lamda-iteration method without losses
Date : 2025-12-31 Size : 1kb User : priyanka_26