confidence interval associated procedures

用java编写的一个跳棋游戏程序，jdk1.5以上即可运行，并附有源代码,游戏界面很美观，是用来学习Java的不错的例子！界面比较美观，完全解压后才能运行，有利于菜鸟自学啦……望资源上传者能够更多地价格自己的资源进行分享，以及交流讨论！

建立了SAR回波信号模型以及Chirp Scaling算法模型，对SAR回波信号进行CS成像处理，并分析了成像处理后的图像数据的频谱和相位特性。

This OpenNL, a library to easily construct and solve sparse linear systems. * OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradient,BICGSTAB, GMRes) and preconditioners (Jacobi, SSOR). * OpenNL can also use other solvers (SuperLU 3.0 is supported as an OpenNL extension,MUMPS will be supported in a future version)-This is OpenNL. a library to easily construct and solve sparse l inear systems.* OpenNL is supplied with a set of built-in iterative solvers (Conjugate gradie nt, Application of BICGSTAB. GMRes) and preconditioners (Jacobi, SSOR).* OpenNL can also use other solvers (Super rLU 3.0 is supported as an OpenNL extension, MUMPS will be supported in a future version)

单纯形法解决线性规划问题!!! 有过程！-Simplex method to solve linear programming problems!!! A process!

使用matlab进行实现的kmeans算法。数据集。-use Matlab for achieving the kmeans algorithm. Data sets.

c语言编的万年历源程序,可显示年份从1980-2099年,是个很实用的工具-hefty almanac series of the source, can show that the years from 1980-2099, is a very useful tool!

这是一个关于fuzzy的很好的代码文件，包含程序及其说明，可进行仿真，并有较好的效果。它包含模糊文件的建立，模糊规则的建立，模糊变量的建立，并选择合适的隶属度函数，并且对仿真结果进行解释说明。

C语言作的四色验证1．需求分析问题描述：证明了可以用不多于4种颜色对n个区域着色，而满足相邻的区域具有不同的颜色输入形式 ： 暂定最多50个区域，如需证明更多区域，修改#define S 50 即可；以整形形式输入（取值范围1-32767）用户需要证明的区域数目，相联的一对矩阵； 输出形式：以0和1输出关联矩阵，和以blue yellow orange pink形式输出每个区域相对应证明出的颜色；-C language does four colors confirm 1. demands analyses question description: Had proven may use not to be many to 4 kind of colors to n region coloration, but satisfies the neighboring region to have the different color input form: Establishes provisionally more than 50 regions, if must prove more regions, revise#define S 50 then; Region number (value scope 1-32767) the user needs to prove which by the reshaping form input, unites a pair of matrix; Output form: By 0 and 1 output incidence matrixs, with form outputs the color by blue yellow orange the pink which each region corresponds proves;

A * 使用最好先搜索并且发现从给定的初始费用最少的路径节点一个目标节点（一个或多个可能的目标输出）。由于 A * 遍历图，它如下路径的预计总成本最低或距离，保持排序 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报