中缀表达求后缀表达式及其值

列选主元 数值代数-out how the main element numerical algebra

是《计算机常用数值计算算法与程序 C++版》一书的配套代码，每个源程序文件的文件扩展名都使用.cpp形式。这些C++程序已经在微软公司Windows 平台下的Virsual C++ 6.0环境下通过-is "commonly used computer numerical algorithms and procedures C version," a book supporting code, each source document file extensions are used. Cpp form. These procedures have been in C Microsoft Windows platform under the Virsual C 6.0 environment through

均值比率 试图生成速度快、 内存效率的 K-均值程序。 安装 gem来源-http://rubygems.org sudo gem安装 k_means 如何使用 需要 "rubygems" 要求 "k_means" 数据 = [[1，1]、 [1，2]，[1，1]，[1000年、 1000年]，[500、 500]] kmeans = KMeans.new （数据，： 质心 = > 2） kmeans.inspect # 使用 kmeans.view 拿到未检查数组 = > [[3，4]，[0，1，2]] 自定义的质心 需要 "rubygems" 要求 "k_means" # 您自定义的质心需要有 #position 和 #reposition 的方法 类 CustomCentroid attr_acces

pdnMesh is an automatic mesh generator and solver for Finite Element problems. It will also do post-processing to generate contour plots and Postscript printouts. GUI support using GTK or MFC (Win32) is available. The problem definition can be done in any form and given to pdnMesh as an input data file. Drawing Exchange Format (DXF) files can be directly imported to pdnmesh. The quality and the coarseness of the mesh can be controlled by giving input parameters.

FORTRAN编写的差分程序，用于计算偏微分方程，有用。-FORTRAN differential preparation procedures used to calculate the partial differential equations, useful.

本算法为机械优化设计中的一维黄金搜索算法，可以求取方程的极值。-This programm realizes the golden section search method for machanical one-dimesion optimum designing ,you can use it to get the mimimax solution

用fortran语言编写的程序，这样可以在fortran系统中直接运行，为大家提供点方便。-using FORTRAN language of the procedure so in FORTRAN operating system directly, to provide a convenient point.

分别采用背景差分和三帧差分的方法分割视频，采用经典光流法跟踪视频中运动的物体，通过角点检测相结合得到运动物体精细的轮廓

A program to find frequent itemsets (also closed and maximal) with the eclat algorithm ,which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. -A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists.

bm算法的delphi实现-bm algorithm to achieve the delphi