sift算法源代码

主要用于高层建筑的减振设计,根据线性振动理论,用matlab高级语言编写而成,由一个主程序和四个子程序组成-mainly for high-rise building design of the vibration, linear vibration theory, use the advanced language Matlab has been prepared by a main program and four subroutine composition

程序动画Delphi

Huffman编码1． 给出信源符号的一阶概率分布，并计算信源符号熵和单字符Huffman码表。2． 计算每信源的平均字长，并与信源符号熵比较。3． 比较压缩效果。-Huffman coding 1. Source symbols are given first-order probability distribution, and calculate the entropy source and single-character symbols Huffman code table. 2. Calculated the average per source word length, and entropy source comparison symbols. 3. Comparison of the effect of compression.

实现组合C(M,N)运算,程序结构简单鲜明,运用递归算法,取代流行的数组方式储存,实现组合运算-achieve portfolio C (M, N) Operational procedures simple structure distinctive, using recursive algorithm to replace the popular approach to storage arrays to achieve portfolio Operational .......................

是一种利用互联网或移动互联网实现通讯录信息同步更新和备份的应用/服务。你可以在个人电脑、掌上电脑、移动电话等任何联网设备上录入你的联系人的手机电话号码、Email、QQ、MSN、通信地址等通讯录信息，或对以前的信息进行分组、管理和更新，在你的许可下，该联系人可以看到他所在组内的其他联系人信息，从而实现通讯录共享，如果该联系人更新自己的联系信息，你的通讯录会自动更新，实现同步通讯录，并留下旧版本的通讯录信息。

资源描述做如下两个模型的石子合并，如下模型石子都不能移动出列，且合并都仅发生在相邻两堆石子中： （1）第一个模型：一行排列且相邻合并 有n堆石子A1,A2,...,An形成一行，每堆石头个数记为ai(1

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.

此应用程序不仅演示使用 Microsoft 基础类的基本知识，也是您编写应用程序的起始点。 此文件包含的什么你会发现在每个文件，让您的广告特设模拟的应用程序的摘要。

应用背景一个小的井字脚趾由我´游戏。例： ；#包括

用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关，迭代次数越多，精度越高。本例子中精确到小数点后4位。要提高迭代次数，还得把增加1QN格式的位数，比如32位long，程序多处需要修改，有需要的话自己改吧。 -CORDIC algorithm with the two parameters arc tangent. And the accuracy of the CORDIC iteration number, the more the number of iteration, the higher the accuracy. This case accurate to four decimal places. To raise the number of iterations, it has to the increase in a 2:30 format of the median, such as 32 long, multiple procedures need to change, the need to reform it themselves.