mk

This code allows you to draw either a square or a rectangle with matlab

3D方式演示欧拉角 通过鼠标就可以更改欧拉角的方位，其中代码适用于欧拉角方向余弦矩阵的转换。(findEulerAngs generates Euler angle sets and animates rotations in response to user manipulation of a 3D rigid body (a box). Use the mouse to change the orientation of the box. A wireframe of the original box position will appear. The Euler Axis button animates the rotation about the Euler Axis between the original and new box positions. The Rotate button calculates a set of Euler angles for the rotation type currently selected ( Body or Space ) and the axis set selected in the dropdown menu to orient the axes to the new box position. Derotate reverses this process and brings the axes back to their previous position. Once the axes have been rotated, subsequent rotations are calculated from this new orientation. This means that Space rotations use the coordinate system associated with the previous cube orientation (i.e. the axes of the wireframe cube). Axes DCM is the direction cosine matrix of the current axes orientation in the unrotated inertial frame. Box DCM (in)

OEO混沌产生，研究反馈强度对混沌性质的影响(generate OEO chaos to study the influence of feedback strength on chaotic properties)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

用矩量法计算线天线的电磁场（MATLAB编程）(using the moment method of calculation of electromagnetic wire antenna (MATLAB))

pear1.5的安装包，解压到smarty的目录基本就可以使用了。(pear1.5 installation kits, smarty extract the basic directory can use it.)

Two-Quadrant Chopper DC Drive for matlab simulink

说明：  阵列信号处理中谱估计AR模型的matlab程序(Array Signal Processing AR model spectrum estimation matlab program)

bpsk编码很适合出学者,已经经过调试 加了个 升余弦滤波(BPSK encoding is very suitable for the academics, have been debug plus a raised cosine filter)

trisurf画一个三维球，并进行着色。(To figure a colored sphere in matlab function trisurf)