时域差分法计算一维光子晶体反射率和透射率

用MATLAB开发,一个界面还可以的计算器-MATLAB development, an interface can also calculator

此程序用于道路放样的曲线要素的计算简单而方便-This procedure for setting-out the curve of the road element of the calculation is simple and convenient

应用背景JPHide 和JPSeek 的源代码！JPHide&JPSeek是一个JPEG图像的信息隐藏软件！-JPHide and JPSeek source code! JPHide & JPSeek is a JPEG image information hidden software!关键技术JPHIDE and JPSEEK are programs which allow you to hide a file in a jpeg visual image. There are lots of versions of similar programs available on the internet but JPHIDE and JPSEEK are rather special. The design objective was not simply to hide a file but rather to do this in such a way that it is impossible to prove that the host file contains a hidden file. Given a typical visual image, a low insertion rate (under 5%) and the absence of the original file, it is not possible to conclude with any worthwhile certainty that the host file contains inserted data. As the insertion percentage increases the statistical nature of the jpeg coefficients differs from "normal" to the extent that it raises suspicion. Above 15% the e

数学建模的经验之谈，对准备参赛及已经参赛的队员有一定的指导意义。对参加工作的科研人员也有一定借鉴作用。-Mathematical Modeling of experiences, the preparation team and have team members have a certain significance. For participating in the work of researchers also have some reference.

在模式识别中，尤其需要对一些样本进行分类，聚类分析是常用的方法，本程序基于最小最大距离的聚类原则实现对样本的聚类-At pattern recognition, in particular a number of samples required for classification, clustering analysis is a commonly used method, the procedure based on the smallest maximum distance of the cluster principle implementation on sample clustering

资源描述OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别OCR字符识别

#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END#! JMP 04@JSR 20 83 89 12#! LOP#! END

用matlab编写的基于轮廓最大互信息图像配准算法

货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration

用户输入了一个单词。这时分成两种情况：拼写正确，或者拼写不正确。我们把拼写正确的情况记做c（代表correct），拼写错误的情况记做w（代表wrong）。 所谓"拼写检查"，就是在发生w的情况下，试图推断出c。从概率论的角度看，就是已知w，然后在若干个备选方案中，找出可能性最大的那个c，也就是求下面这个式子的最大值。 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报