基于信号强度的垂直切换

FDS为火灾动力学模拟软件源代码,该软件为开源项目,代码语言主要为FORTRAN,可在WINDOWS和LINUX下编译运行,详细说明可参考http://fire.nist.gov/fds/官方网址-FDS for the fire dynamics simulation software source code, the software for the open source project, code language primarily for FORTRAN, can be compiled under WINDOWS and LINUX operation, a detailed description may refer to the official web site http://fire.nist.gov/fds/

JAVA制作的fifa2004，可在手机上运行，模拟比赛双方的完整算法，真实还原比赛过程。

用克里格法计算地图值的程序，输入文件为“PISO”_数据.TXT“输出文件是”顺序文件". 使用IMSL功能。

Multiband_Kamath.m Description: Multiband spectral subtraction as proposed by Kamath 2002. Uses adjusts the subtraction coefficient with the frequency as well as the SNR. note that the first 0.25sec of your signal is used to model the noise. License: Shareware Related: sec, Signal, Model, Noise, Frequency, coefficient, subtraction, Spectral, proposed O/S: BSD, Linux, Solaris, Mac OS X

1引言  这是一种快速Galois域的库，并且所有的源文件是自由软件;这个库有一些显著的不同与以往的Galios场库进行比较。  1）这个库可以使用在Windows平台和Linux平台，C和C++的支持。  2）与以往的研究相比，在这一块的代码非常简洁，代码量小于150线为1/3-1/5以前的作品。  3）所有的Galois域的功能的操作与宏实现的，所以计算速度是非常快的。  2如何使用它。&nbs

/****************************************************************************  NJU Magic.  Copyright (c) 2007.  All Rights Reserved.                -------------------------------------------------------------------- Permission to use, copy, or modify this software and its documentation for educational and research purposes only and without fee is hereby granted, provided that this copyright notice appear on all copies and supporting documentation.  For any other uses of this software, in original or modified form, i

经典的C++编写的堆栈式汉诺塔的求解-classic preparation of the C-stack HANOR Solution

C++Bulider与Matlab的混合编程中的用C++Bulider来实现Matlab的技术文章-Bulider C and Matlab programming mixed with the C Bulider to achieve Ma tlab technical articles

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.

计算方法经典算法(弦截法二分法牛顿迭代法龙贝格算法)-classic calculation algorithm (xianjie Act dichotomy Newton Romberg algorithm)