假近邻法(False Nearest Neighbor, FNN)计算嵌入维的Matlab程序 文件夹说明： Main_FNN.m - 程序主函数，直接运行此文件即可 LorenzData.dll - 产生Lorenz时间序列 PhaSpaRecon.m - 相空间重构 fnn_luzhenbo.dll - 假近邻计算主函数 SearchNN.dll - 近邻点搜索 buffer_SearchNN_1.dll - 近邻点搜索缓存1 buffer_SearchNN_2.dll - 近邻点搜索缓存2 参考文献： M.B.Kennel, R.Brown, H.D.I.Abarbanel. Determining embedding dimension for phase-space reconstruction using a geometrical construction[J]. Phys. Rev. A 1992,45:3403.
标签： Main_FNN Neighbor Nearest Matlab
上传时间： 2013-12-10
上传用户：songnanhua
1问题描述： 设计一个实现稀疏多项式乘法的程序 2需求分析： 编程实现两个一元多项式相乘，要求： 2.1输入并建立多项式； 2.2输出多项式，输出形式为整数序列：n,c1,e1,c2,e2``````,cn.,en,其中n是多项式的系数，ci和ei分别是第i项的系数和指数，序列按指数降序排列。 2.3多项式a和b相乘，建立结果多项式a*b
上传时间： 2015-08-15
上传用户：zhangliming420
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
标签： introduction the contains intended
上传时间： 2013-12-23
上传用户：liansi
by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) the text of Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon
标签： L. published Schwartz Edition
上传时间： 2014-11-29
上传用户：kr770906
by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon
标签： L. published Schwartz Edition
上传时间： 2015-09-03
上传用户：lifangyuan12
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
BNB20 Finds the constrained minimum of a function of several possibly integer variables. ％ Usage: [errmsg,Z,X,t,c,fail] = ％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) ％ ％ BNB solves problems of the form: ％ Minimize F(x) subject to: xlb <= x0 <=xub ％ A*x <= B Aeq*x=Beq ％ C(x)<=0 Ceq(x)=0 ％ x(i) is continuous for xstatus(i)=0 ％ x(i) integer for xstatus(i)= 1 ％ x(i) fixed for xstatus(i)=2 ％
标签： constrained variables function possibly
上传时间： 2014-01-13
上传用户：youth25
假定已经有许多应用采用了程序1 - 1 5中所定义的C u r r e n c y类，现在我们想要对C u r r e n c y类 的描述进行修改，使其应用频率最高的两个函数A d d和I n c r e m e n t可以运行得更快，从而提高应 用程序的执行速度。由于用户仅能通过p u b l i c部分所提供的接口与C u r r e n c y类进行交互，
上传时间： 2015-10-11
上传用户：BIBI
TLV1544与TMS320VC5402通过串行口连接，此时，A／D转换芯片作为从设备，DSP提供帧同步和输入／输出时钟信号。TLV1544与DSP之间数据交换的时序图如图3所示。 开始时， 为高电平（芯片处于非激活状态），DATA IN和I/OCLK无效，DATAOUT处于高阻状态。当串行接口使CS变低（激活），芯片开始工作，I／OCLK和DATAIN能使DATA OUT不再处于高阻状态。DSP通过I／OCLK引脚提供输入／输出时钟8序列，当由DSP提供的帧同步脉冲到来后，芯片从DATA IN接收4 b通道选择地址，同时从DATAOUT送出的前一次转换的结果，由DSP串行接收。I／OCLK接收DSP送出的输入序列长度为10～16个时钟周期。前4个有效时钟周期，将从DATAIN输入的4 b输入数据装载到输入数据寄存器，选择所需的模拟通道。接下来的6个时钟周期提供模拟输入采样的控制时间。模拟输入的采样在前10个I／O时钟序列后停止。第10个时钟沿（确切的I／O时钟边缘，即上升沿或下降沿，取决于操作的模式选择）将EOC变低，转换开始。
上传时间： 2014-12-05
上传用户：yepeng139
C++Primer中文版 第三版 深入系列 Primer 第三版 著 中中文文版版潘爱民张丽译 Addison-Wesley 中国电力出版社 www.infopower.com.cn Stanley B Lippman J o s é e L a j o i e
标签： Primer Addison-Wesley infopower www
上传时间： 2014-01-14
上传用户：myworkpost
