已解决,删了

已解决,删了,谢谢各位的回复!

An important object of study of this project is small-world networks. In network theory, the small-world network is a special kind of complex network structure, in which the majority of nodes in the network are not connected to each other, but most made several nodes only need to reach through. Graph theory in mathematical language, is a small world network composed by a large diagram point, wherein the average path length between any two points is much smaller than the number of vertices. Use Chua oscillator, for example, through the MATLAB simulation algorithm, the small-world network connections with examples Chua oscillator simulated, while three states but also a good amount of characterization system synchronization, this is the main subject of this Research methods
Specific steps:

  1. Chua’s oscillator assignment of each component,
    R = 1.3Ω, R0 = 0.0011Ω, C1 = 0.1096F, C2 = 1F, L = 0.068H, Ga1 = -1.1384s, Gb1 = 0.7225s, the coupling strength c = 0.01, control gain d = 0.3, R1 = 0.3 Ω.
  2. Create a full-N * N 0 initial matrix established by the rules of the ring, the node network with N nodes, each node to its neighboring nodes m connected to the side, near the matrix is ​​obtained;
  3. Counterclockwise side rewiring, from junction to N-m-1
  4. Choose a number r = rank (1);
    Removing the adjacency matrix of non-zero elements of the position, If r <= p, unconect = find (A (i,) == 0;
    Obtaining a non-zero number of elements: M = length (unconect);
    Forward rounding: r1 = ceil (M * rand (1));
    The connection point to construct small-world network SW:
    if r1> = 1,
    A (i, unconect (r1)) = 1;
    A (unconect (r1), i) = 1;
    Matrix (i, j) = 0, matrix (j, i) = 0;
  5. Rehabilitation of small world network connection adjacency matrix: for k = 1: n
  6. remove the ring formed by the junction itself: A (k, k) = 0;
  7. connection matrix assignment:
    am = A;
    am = diag (sum (am`)) + am;
  8. Define the rest of the system parameters, conclusion.

(Preparation stage): large number of documents, the various components of Chua’s oscillator assignment system in each variable assignment;
(Experimental and modeling stage): Create a full 0 N * N matrix to establish the initial rules of annular network node network with N nodes, each node to its neighboring nodes m connected to the rim, Nearby determined matrix. SW configuration algorithm using small-world networks; rehabilitation of small world network connection adjacency matrix, remove the node itself to form a ring; according to the data obtained coupling strength, and define the rest of the system parameters.
(Concluding phase): Experiments show that due to the complex network interposed between the rules and characteristics of random network, small world networks contain control effect, and the small-world network between any two points there is a continuous probability is very much tied in order to find the two critical values ​​of A and B (A> B). When the probability p <B, the entire network can be controlled by a node; when the probability value p> When A, can not pass a node to control the entire network.

楼上 google翻译?。。。

非常感谢你的帮助?

不太懂,帮你顶帖

谢谢你的回复!你是学计算机的吗?我不要求语言上perfect,只要意思上表达到了就行了。

谢谢谢谢!

2 楼的认真哦

不懂帮顶吧

budong ye

帮你把第一段润色了下 原文前面翻译的很好 后面稍微有点机器翻译的感觉 {:5_137:}

An important object of study of this project is small-world networks. In network theory, the small-world network is a special kind of complex network structure, in which the majority of nodes in the network are not directly connected to each other, but most pairs of nodes are connected via a relatively short path. In the language of graph theory of mathematics, a small world network is composed of a large number of nodes, where the average path length between any two nodes is much smaller than the number of vertices. The main research method of this study is: using Chua’s oscillator as an example, applying the MATLAB simulation algorithm, to simulate the small-world network connections with instances of Chua’s oscillator, to show that the system’s synchronization is well defined by the three status variables.

不用了,已经解决了,不过还是谢谢了!