-
lianxi
用来实验验证c转换为汇编的效率，本代码为一个简单的小延时，通过不同德c代码，转换成汇编，看他们的大小，和执行效率(C is used to convert the experimental verification of the efficiency of assembly, the code for a simple little delay, through different de c code into assembly, to see their size, and efficiency)
- 2011-01-13 09:46:33下载
- 积分：1
-
boost_close_loop
simulink model of dc to dc boost converter. the important thing it is in closed loop using p i controller. it is for study purpose..
- 2011-09-22 21:53:13下载
- 积分：1
-
my_matlab
由于遗传算法较以往传统的搜索算法具有使用方便、鲁棒性强、便于并行处理等特点，因而广泛应用于组合优化、结构设计、人工智能等领域。(Than in the past due to genetic algorithms traditional search algorithms with easy to use, robustness, ease of parallel processing, etc., which are widely used in combinatorial optimization, structural design, artificial intelligence and other fields.)
- 2014-01-07 20:04:51下载
- 积分：1
-
MATLAB_Programming_for_egineers(2001)
工程人员matlab编程的教材，外文的参考文献，感兴趣的可以了解下(Engineering staff matlab programming teaching materials, foreign language references, interested to learn under the)
- 2009-11-09 21:32:42下载
- 积分：1
-
qpso
说明： k-中心与qpso算法的结合，从文档中读取对象数据，没有维限制。需要设定类别数，先由k-中心计算出各类中心，然后由qpso优化，得到聚类结果，并保存聚类信息。(algorithm for k-medians and qpso combination of object data read from the document, there is no dimension restrictions. Need to set the number of categories, first calculate the k-medians types of center, and then optimized by qpso obtained clustering results, and save the clustering of information.)
- 2010-03-24 14:10:48下载
- 积分：1
-
music4
voltage flicker estimation using ESPRIT
- 2014-01-06 07:24:50下载
- 积分：1
-
zcgzxl
最长公共子序列的 c代码，可以直接运行获得结果。(C code for the longest common subsequence can be run directly.)
- 2013-12-04 16:13:33下载
- 积分：1
-
An-Introduction-to-Programming-and-Numerical-Metho
An Introduction to Programming and Numerical Methods in MATLAB.pdf
- 2009-02-28 12:57:48下载
- 积分：1
-
truemm
利用MATLAB计算GPS运动方程的一个子程序(GPS calculations the equations of motion)
- 2009-10-06 11:43:00下载
- 积分：1
-
Tues-A17_01-Beatty-Gridding
In this session, I will focus on the gridding method for fast image reconstruction from non-
Cartesian data [1-5]. While gridding is not the only game in town, it is the reconstruction of
choice when reconstruction time is an issue. Other reconstruction techniques include rBURS
[6] and non-Cartesian iterative methods [7,8]. Non-Cartesian iterative methods generally use
gridding and inverse gridding as their core operation, so even when gridding is not the right
solution for an application, an understanding of gridding can be useful.
I will cover the main steps of the gridding algorithm and then discuss some implementation tips
that can signicantly reduce the computation time. Finally, I will present some illustrations and
viewpoints that I have found to aid in an intuitive understanding of the gridding method, which
can be helpful when designing the density compensation function and judging the appropriateness
of gridding as a solution for a particular application.
- 2012-05-27 18:19:18下载
- 积分：1
