-
lvboqi
几种滤波器：hamming窗口的低通滤波器，给定技术指标的模拟巴特沃兹低通滤波器，kaiser窗口的带阻滤波器，blackman窗口的带通滤波器，Kaiser 窗低通滤波器
(Several filters: hamming window low-pass filter, given specifications of the analog Butterworth low-pass filter, kaiser window band stop filter, blackman window bandpass filters, Kaiser window low-pass filter)
- 2010-08-05 19:36:19下载
- 积分：1
-
tanhuang-mode
弹簧粒子模型定位算法，根据上海大学硕士论文编写。(Spring particle model localization algorithm，according to the Shanghai university master s thesis writing.
)
- 2014-11-04 21:26:18下载
- 积分：1
-
678c317fbe3e
this is saple program for file system implementtion in purebasic
- 2014-12-05 17:41:07下载
- 积分：1
-
Power-communication-reliability-
通信系统链路可靠性和节点可靠性的计算并将两者综合(Communication link reliability and node computing system reliability and a combination of both)
- 2013-12-01 10:13:58下载
- 积分：1
-
DoubleBinaryTurbo
采用 DVB反向链路（DVB-RCS）标准中的双二元Turbo码matlab仿真程序和仿真结果。支持1/2和1/3码率。支持MAP，LOG-MAP解码算法。(The use of DVB reverse link (DVB-RCS) standard double-binary Turbo code matlab simulation program and simulation results. Support for 1/2 and 1/3 rate. Support MAP, LOG-MAP decoding algorithm.)
- 2007-07-11 19:55:09下载
- 积分：1
-
kmeans
K means code for k means algorithm
- 2013-08-05 12:44:42下载
- 积分：1
-
Directional-patterns
This MATLAB M-file will produce the FDTD solution
of a sectoral (2-D) Perfectly Electric Conducting
(PEC) horn antenna excited by a sinusoidal voltage
in a TEz computational domain.(This MATLAB M-file will produce the FDTD solution of a sectoral (2-D) Perfectly Electric Conducting (PEC) horn antenna excited by a sinusoidal voltage in a TEz computational domain.)
- 2013-11-24 23:30:57下载
- 积分：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
-
face_recog
face recognition by using principle component analysis
- 2012-05-15 04:38:32下载
- 积分：1
-
simulation
对美国由次贷危机引起的金融风暴进行了研究，分别建立了次贷危机产生机理的模型和金融风暴的判定模型，并用计算机对模型进行了仿真。通过仿真分析得出了利率和房价的变动是形成次贷危机的直接原因，而信心指数却是形成危机的根本原因的结论。况，实现城市平面十字路口的微观仿真，通过仿真得到信号灯的最佳控制方式与这一控制方式下的交通拥堵情况。然后在取消左转的条件下从路网的角度分析道路交通流，通过对路网模型的分析，针对其较大的复杂度和边界缺陷，我们建立了其等效模型。改变进入系统的车流的性质仍然在单个十字路口建立模型进行仿真。经过两个模型的对比，我们得出“取消左转”这一方式有利于改善道路交通拥堵问题。最后提出其他可行的“无左转”交通流组织形式，并进行简单分析。(Subprime mortgage crisis matlab simulation)
- 2012-06-14 18:47:40下载
- 积分：1
