quxian

线性代数实践及MATLAB入门 本书是根据“用软件工具推向线性代数教学”的指导思想，参照美国1992-1997国家科学基金项目ATLAST的思路，编写成的线性代数补充教材，其目的是补充我国现有教材的的缺陷。它分为两篇，第一篇介绍线件代数所用的软件工具MATLAB语言，第二篇介绍线性代数实践。本书可作为大学本科线性代数的配套教材，也可作为广大理工、经管领域教师、工程师和研究生的参考读物。(Introduction to Linear Algebra practice and matlab This book is based on the guiding ideology"use of software tools into the teaching of linear algebra," , with reference to the ATLAST ideas of U.S. National Science Foundation(1992-1997) , written as a linear algebra supplementary materials, the purpose is to supplement our existing materials defects. It is divided into two parts, the first introduces line of pieces of software tools used in algebraic MATLAB, the second introduces linear algebra practice. )

INTERNET CONNECTIVITY FOR MOBILE AD HOC NETWORKS

MATLAB常用的例子，这里举了100个常用的，目录已经单独传上，这是一部分例题!(MATLAB common examples cited here of the 100 commonly used, the directory has a separate mass, which is part of sample questions!)

说明：  人脸识别PCA方法特征脸的建立与人脸重建(PCA method for face recognition features of the establishment and face reconstruction)

文本分类用数据 20字 分类算法 毕业设计(Text classification data 20 words or classification algorithm design)

Hysteresis Current Control in Inverter

1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始：考虑一个含有N个点的最近邻耦合网络，它们围成一个环，其中每个节点都与它左右相邻的各K/2节点相连，K是偶数。 2、随机化重连：以概率p随机地从新连接网络中的每个边，即将边的一个端点保持不变，而另一个端点取为网络中随机选择的一个节点。其中规定，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。 (In 1998, Watts and Strogatz proposed the concept of the small world network, and the establishment of the WS model. The empirical results show that most real networks have small world (the smaller the shortest path) and clustering properties (high clustering coefficient). WS small-world model construction algorithm 1, from the rules FIG: consider a nearest neighbor coupling network with N points, they are surrounded by a ring, wherein each node and its left and right adjacent to each of K/2 connected to the node, K is an even number. The 2 randomized reconnection: randomly with probability p from the new connection on each side of the network, coming section of one of the endpoints remain unchanged, while the other endpoint is taken as the random selection of a node in the network. Which states that between any two different nodes can have at most one edge, and each node can not be connected to its own side.)

一种实现复矩阵的SVD分解的算法，使用Matlab进行仿真，亲测可用。(SVD decomposition algorithm to achieve complex matrix, using Matlab to simulate pro-test is available.)

基于Wolf方法计算Lyapunov指数，直接运行文件Wolf_3DLyapunov.m(Wolf calculated based on the Lyapunov exponent, Run the file directly Wolf_3DLyapunov.m)

2. 要求： ① 收集资料，全面分析课题，分解问题，形成整体编程思路； ② 深入分析各个小问题，编写各部分程序模块； ③ 对于设计中用到的关键函数，要联系问题进行具体介绍； ④ 上机调试，确保程序能正确运行； ⑤ 完成设计报告，并进行答辩。(2. Requirements: ① the collection of information, a comprehensive analysis of topics, decomposition problem, the formation of the overall programming ideas ②-depth analysis of various minor problems, the preparation of the various parts of program modules ③ used for the design of the key function, it is necessary to link the issue of details ④ debugging on the machine to ensure that procedures are functioning correctly ⑤ complete the design report and to respond.)