ZDLX_KCSJ_4_34

Simulink engineer orchard

SVM Training using matlab

Rotman lens S-parameters matrix calculation

实现图像的降维处理,可以缩短大量的计算时间。(Dimensionality reduction of image processing, a lot of computation time can be shortened.)

说明：  实现求圆形、三角形、矩形的面积和周长。要求和说明如下： (一) 定义接口sharp接口 (二) 通过实现接口定义Rect、Triangle、Circle的类，并且一个构造方法，并实现求面积和周长的方法（其中三角形斜边的计算公式c=Math.sqrt (width * width + height * height ) ） (Seeking to achieve circular, triangular, rectangular area and perimeter. Requirements and are described as follows: (a) define the interface sharp interfaces (two) by implementing the interface definition Rect, Triangle, Circle of class and a constructor method, and implement methods for the area and perimeter (where the hypotenuse of the triangle formula c = Math.sqrt (width* width+ height* height) ))

DCT域QIM音频隐藏技术的实现——信息隐藏技术 (QIM realize DCT domain audio hiding techniques- Information Hiding)

ekf和ukf的程序的对比，主要应用于目标跟踪方面(ekfVSukf s programme ,it s fitted to track traget.)

一种基于AODV路由协议的分簇算法研究是无线传感网络现今发展的重要算法(AODV routing protocol based on clustering algorithm 搜索)

DQM法matlab代码，用于求解输液管道的失稳问题，在边界弹簧刚度变化的情况下，给出了临界失稳流速。(DQM method matlab code for solving the instability problem pipes conveying fluid, the spring stiffness in the border cases, given the critical buckling velocity.)

旅行商问题（Travelling Salesman Problem, 简记TSP):假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 此处使用蚁群算法求解TSP问题(Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.Here,we use the procedure of ant colony algorithm to work out the TSP.)