gaosi

《MATLAB R2008图形与动画编程实例教程》的源代码--第五章(" MATLAB R2008 examples of graphics and animation programming tutorial" source code- Chapter V)

摘要：本文基于Matlab对约瑟夫森结（Josephson Junction）RCSJ模型的交直流I-V特性及非线性混沌现象进行数值模拟。通过计算机数值模拟得到该模型的非线性微分方程数值解，研究了RCSJ模型中各参量对约瑟夫森结的影响，进而简要分析其I-V特性和非线性混沌现象的产生机理，绘制出约瑟夫森结的交直流I-V特性曲线、非线性微分方程的相图及因其高度非线性而引起的通过倍周期分岔和阵发性原理进入混沌状态的分岔图。 关键词：超导器件 隧道效应 约瑟夫森结 弱耦合 倍周期分岔 庞加莱截面 混沌 (Abstract: Matlab-based Josephson junction on the (Josephson Junction) RCSJ model AC and DC IV characteristics and non-linear numerical simulation of chaotic phenomena. Through computer simulation model by the numerical solution of nonlinear differential equations to study the RCSJ model parameters on the impact of Josephson junction, and a brief analysis of the IV characteristics and the emergence of the phenomenon of non-linear chaotic mechanism, drawn Josephson junction IV characteristic curve of AC-DC, non-linear differential equations and the phase diagram because of its highly nonlinear arising through period-doubling bifurcation and chaotic state of paroxysmal principle of access to the bifurcation diagram. Key words: superconducting devices tunnel effect Josephson junction weakly coupled period-doubling bifurcation chaotic Poincare section)

neural network for approximation some 1-D function

FCM fuzzy C-MEAns in MATLABn

介绍MATLAB中的小波分析工具箱，包括一些常用的小波基函数、连续小波、离散小波以及小波包变换等(Introduction MATLAB wavelet analysis toolbox, including some commonly used wavelet basis function, continuous wavelet, discrete wavelet transform and wavelet packet)

DDE服务器编写例程，实用DDEML类库实现，简单易用。(DDE server to prepare routines, practical implementation DDEML class, easy to use.)

Physical Modeling in MATLAB R Copyright 2007, 2008 Allen B. Downey(国外学者写的 利用MATLAB 编写各种物理模型的书 是英文的 可能读起来要花时间 但例子多 内容丰富有 书中有代码例子)

数值计算算法，包含各种算法和程序，主要包含Dijkstra、Dynamic_pro、Floyd等算法(Numerical algorithms)

costas环的matlab实现，该实现能够完成相位锁定，频率估计等动能(costas loop matlab implementation that can complete phase-locked, frequency estimation of the kinetic energy)

最大流问题，一种组合最优化问题，就是要讨论如何充分利用装置的能力，使得运输的流量最大，以取得最好的效果。求最大流的标号算法最早由福特和福克逊于1956年提出，20世纪50年代福特、福克逊建立的“网络流理论”，是网络应用的重要组成成分。(Maximum flow problem, a combinatorial optimization problem, is to discuss how to make full use of the capacity of the device to maximize the flow of transport in order to achieve the best results. The labeling algorithm for maximum flow was first proposed by Ford and Fulkerson in 1956. The network flow theory established by Ford and Fulkerson in 1950s is an important component of network application.)