sjcz

SMT算法的求解器程序，用来计算光纤模式等，十分好用(The program is used to calculate the fiber mode. )

平面桁架和刚架的有限元计算程序，能计算指定个数的桁架和刚架(Plane truss and frame of the finite element program, to calculate the number of truss and frame specified)

在MATLAB中模拟ENVI中2 线性拉伸；增强对比度。(This method is dedicated to simulate then function in ENVI(2 liner strenching),Which can improve the effect Contrast)

mo phong ve ber cua mang 2 chang voi nut chuyen tiep af co dinh hop tac

read and process xtf format multibeam data

遗传算法 量子遗传算法 模拟退火 粒子群算法 代码很规范(several algorithm （GA QGA SA ）)

MATLAB GUI设计学习手记（第二版）源程序 第3章 本书推荐的学习方法： 1）若您是一个MATLAB初学者，且有充裕的时间来学习GUI设计，您可以从本书的第1章开始循序渐进地学习。 2）若您是一位MATLAB初学者，且时间非常紧迫，建议您先学好第1章，然后依次学习第4章、第5章和第6章，其他章节请根据项目需要有选择性地学习。 3）若您已经掌握了MATLAB的基础语法知识，有一定的MATLAB编程基础，也请浏览一下第1章的内容，尤其是专题分析部分。然后先学习本书第4、5和6章，其他章节请根据项目需要有选择性地学习。 4）若您是一位MATLAB GUI方面的专家或老师，您可以将本书作为一本教学的参考书，本书内容全面、讲解详实、代码精炼，是不可多得的GUI宝典。 (MATLAB GUI design learning Hearts (second edition) source Chapter 3 the learning methods recommended in this book: 1) If you are a MATLAB beginners, and have plenty of time to learn GUI design, you can start from Chapter 1 of the book The step-by-step learning. 2) If you are a MATLAB beginners, and the time is very tight, it is recommended that you first learn to Chapter 1, followed by learning Chapter 4, Chapter 5 and Chapter 6, in other sections based on project needs selective learning . 3) If you have mastered the basic grammar of the MATLAB, the MATLAB Programming Fundamentals, please visit the Chapter 1, in particular thematic analysis section. First learning book chapters 4, 5 and 6, then the other chapters selective learning based on project needs. 4) If you are an expert or teacher of a MATLAB GUI, you can book as a teaching reference books, the book is comprehensive, explain the detailed, refined code, is a rare GUI canon.)

mcma vs dd blind equalization comparation

creation d un programme su labview pour déterminer les caractéristique d un PV

旅行商问题，即TSP问题（Travelling Salesman Problem）又译为旅行推销员问题、货郎担问题，是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路径的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。(Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) also translated as the traveling salesman problem, traveling salesman problem is one of the well-known problems in the field of mathematics. Suppose you have a travel business to visit n cities, he must choose which path to go, limiting the path is to visit each city only once, and the last to return to the original departure city. Select the destination path is the requirement for the minimum distance path was among all paths.)