基于区域的立体匹配算法-0812.1340.pdf

基于区域的立体匹配算法-0812.1340.pdf 为了执行的立体视差估计算法的区域匹配方法由全局最小的平滑误差能量函数 B. B. Alagoz, Obtaining Depth Maps From Color Images By Region Based Stereo Matching Algorithms,OncuBilim Algorithm And Systems Labs. Vol.08, Art.No:04, B. B. Alagoz, Obtaining Depth Maps From Color Images By Region Based Stereo Matching Algorithms,arXiv:0812.1340v1, 下面文章的代码： 文章： 0812.1340.pdf 代码： StereoRegion.rar 截图： 1.jpg 3Dview.jpg

求解非线性方程组的BFGS差分进化算法_刘利斌.pdf

摘要：针对差分进化算法进化后期收敛缓慢和稳定性不强的缺陷,将BFGS算法插入差分进化算法当中,提出了一种BFGS差分进化算法,用来求解非线性方程组。通过5个非线性方程组和一个工程实例的实验,说明:算法收敛精度较高、收敛速度较快、鲁棒性强、收敛成功率高,是一种较好的解决非线性方程组的方法。 基金：国家自然科学基金重大研究计划(No.90715029)； 国家自然科学基金(No.60603053)~~；

算法导论答案.pdf

第一版答案。。。英文版，不过凑合看吧。 Solutions for Introduction to algorithms second edition Philip Bille The author of this document takes absolutely no responsibility for the contents. This is merely a vague suggestion to a solution to some of the exercises posed in the book Introduction to algorithms by Cormen, Leiserson and Rivest. It is very likely that there are many errors and that the solutions are wrong. If you have found an error, have a better solution or wish to contribute in some constructive way please send a message to beetle@it.dk. It is important that you try hard to solve the exercises on your own. Use this document only as a last resort or to check if your instructor got it all wrong. Please note that the document is under construction and is updated only sporadically. Have fun with your algorithms. Best regards, Philip Bille

论文研究-和NO.pdf

MCNP（Monte Carlo N-Particle Code）是基于Monte-Carlo方法的一个粒子输运计算程序。其输出数据信息量大，难以快速筛选处理有效数据。在分析MCNP输出数据主要内容的基础，设计了MCNP结果数据提取算法，采用VC 与Matlab COM混合编程技术，实现了一个MCNP输出数据分析与可视化软件。应用结果表明，该软件满足了MCNP使用人员对MCNP输出数据快速分析与可视化的迫切需求。

基于区域的立体匹配算法-StereoRegion.rar

基于区域的立体匹配算法-StereoRegion.rar 为了执行的立体视差估计算法的区域匹配方法由全局最小的平滑误差能量函数 B. B. Alagoz, Obtaining Depth Maps From Color Images By Region Based Stereo Matching Algorithms,OncuBilim Algorithm And Systems Labs. Vol.08, Art.No:04, B. B. Alagoz, Obtaining Depth Maps From Color Images By Region Based Stereo Matching Algorithms,arXiv:0812.1340v1, 下面文章的代码： 文章： 0812.1340.pdf 代码： StereoRegion.rar 截图： 1.jpg 3Dview.jpg

论文研究-民航NOSHOW预测及强因子关联分析.pdf

在民航业务中，旅客订座后却不能如期登机（NOSHOW）一直是航空公司收益亏损的未解之题，为了解决该问题，提出了一种民航NOSHOW预测及强因子关联分析方法。首先利用优化C5.0算法进行NOSHOW决策树建模，得到了NOSHOW相关因子的量化结果，然后通过Apriori算法对NOSHOW强因子进行关联规则挖掘。实验构建了准确率为99.75%的NOSHOW决策树模型，得到了139条置信度在80.054%以上、支持度在10.021%以上的因子关联规则，进一步揭示了NOSHOW强因子之间的隐含关联关系，为各大航空公司实现准确的NOSHOW预测及收益提升管理提供了有效的决策依据。

头条面试-算法.pdf

算法参考

论文研究-行路由PEA广度贪心调度映射算法.pdf

粗粒度可重构单元阵列硬件任务的贪心映射是可重构计算要解决的核心问题。不同的阵列具有不同的硬件约束条件，针对行路由粗粒度可重构单元阵列提出一种广度贪心映射算法BGMA（Breadth Greedy Mapping Algorithm）。该算法首先从第一个节点开始依次扫描，如果节点满足条件则将其映射到PEA上，当遇到不满足映射条件的节点时，该算法将跳过该节点继续寻找满足约束条件的节点进行映射，通过与广度不贪心映射算法BNGMA（Breadth No Greedy Mapping Algorithm）相比较，BGMA的[N1]平均减少了35.1%（PEA6×6）和54.8%（PEA8×8），[N2]平均减少了35.6%（PEA6×6）和54.6%（PEA8×8），[CCON]平均减少了15.7%（PEA6×6）和26.2%（PEA8×8），[TTOTAL]平均减少了20.2%（PEA6×6）和32.1%（PEA8×8）。实验结果表明了贪心策略在映射算法中的重要性。

论文研究-）强化学习算法.pdf

针对以时间表长最小为目标函数的无等待流水车间（No-Wait Flow Shop，NWFS）调度问题，提出了一个混合禁忌搜索算法（Hybrid Taboo Search，HTS），以启发式算法产生的解作为初始解，通过禁忌搜索进一步提高解的质量。大量随机产生实例的实验结果表明：提出的HTS算法在总体性能上优于经典的RAJ、VNS和GASA算法，因此该算法具有可行性和优越性。

论文研究-一种用于求解带平衡约束不等圆形Packing考题的基于NFP的启发式算法 .pdf

一种用于求解带平衡约束不等圆形Packing考题的基于NFP的启发式算法，陈旺，陈羽，本文针对一类特殊的已知全部最优解的带平衡约束的圆形Packing考题求解，报告了一种基于不适合多边形(No-Fit-Polygon, NFP)的确定性启发式��

支付宝网上支付接口开发文档及其代码实例

《支付宝网上支付接口（即时到账接口开发文档及其代码实例）》 警告：本资源仅用于开发学习交流使用。版权支付宝所有。 提供最全的支付宝即时到账接口开发文档及其代码实例，里面包含了ASP,PHP(GBK和UTF-8两个版本),.NET(GBK和UTF-8两个版本)，JAVA(GBK和UTF-8两个版本)，共计7个版本的接口实例。 附带两个PDF： 一个PDF是图解操作支付宝操作（下载接口，如何签约你的账号，以及配置和测试等）。 另一个PDF是支付宝标准快速付款接口文档 《支付宝接口集成指南.pdf》目录： 支付宝接口集成指南 .................................................................................................................................. 1 一、 下载接口案例 ............................................................................................................................... 2 二、 查询您签约的账号使用权限信息 ............................................................................................... 3 三、 按照使用说明文件中的说明配置 ............................................................................................... 4 四、 在对应的开发环境中进行接口单独测试 ................................................................................... 4 1. 创建请求命令: .................................................................................................................................... 4 2. 验证返回信息： .................................................................................................................................. 4 五、 收银台的显示界面 ....................................................................................................................... 5 1. 标准双接口.......................................................................................................................................... 5 2. 即时到账接口 ...................................................................................................................................... 5 3. 担保交易接口 ...................................................................................................................................... 6 六、 整合到自己的网站平台上。 ....................................................................................................... 7 七、 在B2C 网站开发和C2C 网站开发中针对支付宝接口如何设计？ ....................................... 7 1、 B2C 模式： ...............................................

CAD可听化数据映射算法及其应用研究.pdf

33 9 2007 5 Vol.33 No.9 Computer Engineering May 2007 10003428(2007)09023104 A TP311 CAD 1 2 3 (1. 310023 2. 321007 3. 310015) CAD CAD CAD CAD Research of Data Mapping Arithmetic and Application of S

speex回声消除算法

The echo canceller is based on the MDF algorithm described in: J. S. Soo, K. K. Pang Multidelay block frequency adaptive filter, IEEE Trans. Acoust. Speech Signal Process., Vol. ASSP-38, No. 2, February 1990. We use the Alternatively Updated MDF (AUMDF) variant. Robustness to double-talk is achieved using a variable learning rate as described in: Valin, J.-M., On Adjusting the Learning Rate in Frequency Domain Echo Cancellation With Double-Talk. IEEE Transactions on Audio, Speech and Language Processing, Vol. 15, No. 3, pp. 1030-1034, 2007. http://people.xiph.org/~jm/papers/valin_taslp2006.pdf There is no explicit double-talk detection, but a continuous variation in the learning rate based on residual echo, double-talk and background noise. About the fixed-point version: All the signals are represented with 16-bit words. The filter weights are represented with 32-bit words, but only the top 16 bits are used in most cases. The lower 16 bits are completely unreliable (due to the fact that the update is done only on the top bits), but help in the adaptation -- probably by removing a "threshold effect" due to quantization (rounding going to zero) when the gradient is small. Another kludge that seems to work good: when performing the weight update, we only move half the way toward the "goal" this seems to reduce the effect of quantization noise in the update phase. This can be seen as applying a gradient descent on a "soft constraint" instead of having a hard constraint.

论文研究-改进细菌觅食算法解决零空闲流水线调度问题.pdf

针对零空闲流水线调度问题，建立以最大完成时间为目标的数学模型，并提出了解决问题的改进细菌觅食优化算法。在标准细菌觅食优化算法的基础上，引入了交叉优化算子、混合复制策略以及一种基于健康度和适应度共同控制的自适应迁徙概率，以加速算法的收敛过程，并有效抑制精英个体的逃逸，防止解发生退化。采用路径编码方式，通过MATLAB算例试验，表明了改进细菌觅食优化算法在求解零空闲流水线调度问题上的可行性和有效性;同时，运用两种方式产生初始解：随机方式和NEH方法，进一步验证算法的鲁棒性。

MasteringCAlgorithms code 算法精解：C语言描述 源代码及示例

算法精解：C语言描述 源代码及示例 README Mastering Algorithms with C ------------------------------------------------------------------------------ This disk contains all of the code from the book "Mastering Algorithms with C" plus several examples illustrating how to use it. All of the code was written to be platform independent, with a few minor exceptions. It has been compiled and tested on the platforms listed below, but it should work on others with little or no modification. HP-UX 10.20 SunOs 5.6 Linux 5.1 DOS/Windows NT/95/98 (1, 2) (1) The files huffman.c and lz77.c use byte-flipping macros provided by the UNIX socket interface for convenience; therefore, these files will not compile under Windows without similar support. The file transfer.c also uses two functions which are part of this interface. (2) The file directls.c implements a function for sorted directory listings in UNIX; consequently, it makes a few calls that are not typically sup- ported under Windows. The source code on this disk can be freely used, adapted, and redistributed in source or binary form, so long as an acknowledgment appears in derived source files. The citation should list that the code comes from the book "Mastering Algorithms with C" by Kyle Loudon, published by O'Reilly & Associates. This code is under copyright and cannot be included in any other book, publication, or educational product without permission from O'Reilly & Associates. No warranty is attached; we cannot take responsibility for errors or fitness for use. The disk is organized into three directories: header files, source files, and examples. This organization is outlined below along with a description of what each directory contains. include This directory contains all of the header files contained and referenced in the book. Every file is named the same as in the book. source This directory contains all of the source files found in the book. Every file is named the same as in the book. examples This directory contains source code not found in the book. This code may be useful for experimenting with the book's code. The directory contains a number of subdirectories, each addressing a specific topic. Each topic has one or more examples (called ex-1.c, ex-2.c, etc.). Each example has a makefile named according to the topic addressed by the executable that the makefile builds. Note that small changes to a makefile may be needed to account for compiler differences, the make variant being applied, and other idiosyncracies on some systems; makefiles are provided mainly as a reference for which source files must be compiled and which objects must be linked in order to make use of certain data structures or algorithms, etc. For UNIX users, it should be relatively simple to work with the makefiles that have been distributed on this disk. Assuming the directory structure described above, define the environment variable ALGOWC_TOPDIR to the path at which the directory structure begins. It may also be necessary to change the name of the compiler or linker each makefile calls, or in a few isolated cases, adjust the list of libraries linked with certain executables.

算法设计与分析（第2版）吕国英主编

算法设计与分析（第2版）吕国英主编 练习题

论文研究-随机漂移粒子群算法的RZWQM替代模型参数优化.pdf

根区水质量模型（Root Zone Water Quality Model，RZWQM）被广泛应用于刻画土壤水文循环过程对作物生长的影响，并通过模型率定模拟指导农业生产管理。然而RZWQM模型的一次率定需要较长时间，在可接受时间范围内找到一组合适的模型参数是一件较困难的工作；同时传统的模型参数试错法依赖于使用者的专业知识和经验，也需要多次尝试才能达到较满意的模拟效果。提出使用稀疏网格方法建立RZWQM模型的近似替代模型，并使用随机漂移粒子群优化算法对替代模型进行自动参数优化，将优化后的参数用于RZWQM模型的实际应用模拟。替代模型近似精度高，率定速度快，大大节省了模型参数优化的计算开销。最后将提出的稀疏网格近似替代模型方法结合随机漂移粒子群优化算法使用美国爱荷华州5年玉米-大豆间中的作物产量、排水流量、[NO-3]-N流失量田间实测数据进行了验证分析。结果显示该方法能够极大地提高模型参数优化效率和节省人力；同时，通过模型性能评价指标PBIAS、NSE和RSR的数值比较也表明该方法优化后的RZWQM模型性能要好于传统试错法的模型性能。