-
matlab_codes
1)program for GPS week num. and time of week into year/month/day/hour/minute/second format.
2)programs for various data formats into matlab format such as Kp, Solar Flux, Bz, Dst etc.
- 2013-01-22 20:25:18下载
- 积分：1
-
[_ENIGMA_R1869373292005
enigma machine simulator
- 2014-11-05 14:58:54下载
- 积分：1
-
RD
说明： RD算法作为SAR处理中最重要的处理算法，在远场近似的条件下，可将二维处理分离为两个一维处理，降低了运算量，成像效果良好。(RD算法作为SAR处理中最重要的处理算法，在远场近似的条件下，可将二维处理分离为两个一维处理，降低了运算量，成像效果良好。
RD algorithm is the most important processing algorithm in processing SAR, in the far field approximation, the two-dimensional separation into two one-dimensional processing, reduces the amount of computation, good imaging effect.
)
- 2013-12-04 16:38:24下载
- 积分：1
-
azimuthTDOA.m
A sound source can be localized in a two dimensional plane using the audio recorded at three known microphone locations. Much like a GPS system, Time Difference of Arrival algorithms can be used to determine the difference in time and distance of a sound source to other microphones. With that information a Chan algorithm can be used to determine the X Y coordinates of the originating sound source. To do so, however, you must first provide the XY coordinates of each of the 3 microphones. Note that for faster and simpler calculation one of the microphones should be placed at the origin (0, 0) of you XY plane.
- 2014-01-26 03:12:04下载
- 积分：1
-
分支定界法
说明： 分支定界法（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.)
- 2021-04-26 12:21:14下载
- 积分：1
-
m472
单变量控制 PID控制 智能控制 徐丽娜(Single-variable control PID control intelligent control)
- 2012-05-27 10:45:19下载
- 积分：1
-
video
number of frames in a video for different scales
- 2012-06-10 19:58:55下载
- 积分：1
-
MATRIX
Matlab的精华在于其丰富的矩阵运算，本文结合《矩阵论》的相关知识，较为详尽地介绍了大量矩阵运算的matlab实现。(Matlab essence lies in its rich matrix operations, this paper " Matrix theory," the relevant knowledge, a more detailed introduction to the large number of matrix operations matlab.)
- 2013-06-01 18:44:21下载
- 积分：1
-
CORF
contour operator for image processing and computer vision
- 2015-06-30 04:43:22下载
- 积分：1
-
bridge
bridge rectifier simulation in matlab for the display how the harmonics are produced in ac system
- 2012-02-09 02:55:50下载
- 积分：1
