9111f3ce

使用模拟退火算法求解单机调度问题，并提供了三种模拟退火的相关算法的分析情况(The simulated annealing algorithm is used to solve the single machine scheduling problem)

说明：  目标跟踪中各种基础的点迹航迹数据关联算法matlab代码(Matlab code for various basic data association algorithms)

数字信号处理 理论算法与实现 胡广书 第二版(Digital signal processing algorithms and implementation theory HU-book second edition)

集成的代码，可以用各种基础分类器集成，随机抽样本和随机抽特征，或者对样本或特征加权集成(The integrated code can be integrated with various basic classifiers, random samples and random features, or weighted samples or features.)

收音机控制程序，主要完成频率的读取，lcd的显示控制（运行环境ADS）-Radio control program, mainly to complete the reading frequency, lcd display control (operating environment ADS)

Guide to FORTRAN 2008 Programming

事故树分析软件，虽然不算是源码，但是它的功能还是很好的，而且网络上也比较流传的。对从事安全相关工作的人事有用。(Fault tree analysis software, although not a source, but its function is still very good, but the network also circulating. Engaged in security-related personnel useful work.)

输入栅格文件和掩膜矢量，进行批量裁剪.python的版本为2.7，需要导入arcpy模块(batch clip rasters under python2.7 programm)

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )

说明：  本书示例丰富,图文并茂,以简明易懂的方式阐释了算法,旨在帮助程序员在日常项目中更好地利用 算法为软件开发助力。前三章介绍算法基础,包括二分查找、大 O 表示法、两种基本的数据结构以及递归 等。余下的篇幅将主要介绍应用广泛的算法,具体内容包括 :面对具体问题时的解决技巧,比如何时采用 贪婪算法或动态规划 ;散列表的应用 ;图算法 ;K 最近邻算法。 本书适合所有程序员、计算机专业相关师生以及对算法感兴趣的读者(This book is rich in examples and illustrates algorithms in a concise and easy-to-understand way. It aims to help programmers make better use of algorithms in daily projects to help software development. The first three chapters introduce the basic algorithms, including binary search, large O representation, two basic data structures and recursion. The rest of the paper will focus on the widely used algorithms, including: when to use greedy algorithm or dynamic programming, hash table application, graph algorithm, K nearest neighbor algorithm when facing specific problems. This book is suitable for all programmers, computer-related teachers and students, and readers interested in algorithms.)