任意相互不捕捉皇后生成源程序（类似相互不捕捉八皇后）

几个数值算法，二分法、分段线性插值、复合梯形法-several numerical algorithm dichotomy, piecewise linear interpolation, composite trapezoidal method

旅行家问题 一个旅行家想驾驶汽车以最少的费yi 用从一个城市到另一个城市（假设出发时油箱是空的）。给定两个城市之间的距离为D1、汽车油箱的容量为C(以升为单位），每升汽油能行驶的距离为 D2，出发点每升汽油价格P和沿途油站数N（N可以为零），油站i离出发点距离Di,每升汽油价格Pi(i=1,2...N)。计算结果四舍五入至小数点后两位。 如果无法到达目的地，则输出“No Solution"。-issue a travel home to travel home to drive a car with the minimum of cost yi used from one city to another city (assuming starting at the fuel tank was empty). Given the two cities for the distance between D1, car fuel tank capacity of the C (in liters) per liter petrol traveling distance to the D2, the starting point liter gasoline prices P and several petrol stations along the N (N can be zero), PFS i distance from the starting point Di per liter Steam oil prices Pi (i = 1,2 ... N). Calculation results rounded to two decimal places. If unable to reach their destination, the export of "No Solution."

资源描述本文基于面阵提出一种UNITARY-ESPRIT算法解决非相干信源的二维DOA估计问题，利用酉变换把复值导向矩阵和复协方差矩阵转换为实值计算，因此特征值分解或者奇异值分解仅在实数域下进行，大大降低运算复杂度，而且估计性能优于传统的ESPRIT算法。

利用快速傅立叶变换间接计算的Hilbert变换。程序已测试，效果很好-The use of Fast Fourier Transform Hilbert transform calculated indirectly. Procedures have been tested, the effect of good

分数阶傅里叶变换计算方面的文章，另附程序清单-Fractional Fourier transform calculation of the article, followed the list of procedures

对贪吃蛇游戏用VC++进行实现，包含了游戏里的主要功能，加入了关卡设置。

多元数组得各类运算-multiple arrays in various operations

一个简单的银行系统C语言代码，包含排序，线性搜索等算法功能-Banking system, a simple C language code, including sorting, search algorithms such as linear functions

隐马尔可夫模型，C语言编写，重要的是里面附带有隐马尔可夫模型原理介绍的ppt，可以对应学习-HMM, C language, it is important that they are incidental tenets of Hidden Markov Models introduced ppt, can learn from counterparts

这是肾结石的分割算法。它是非常高效的算法，结果给出明确的肾结石。欢迎大家下载、试用。谢谢大家的支持！