Condensation technique of degree of freedom is first proposed to improve the computational efficiency of meshfree method with Galerkin weak form for elastic dy- namic analysis. In the present method, scattered nodes w...Condensation technique of degree of freedom is first proposed to improve the computational efficiency of meshfree method with Galerkin weak form for elastic dy- namic analysis. In the present method, scattered nodes with- out connectivity are divided into several subsets by cells with arbitrary shape. Local discrete equation is established over each cell by using moving Kriging interpolation, in which the nodes that located in the cell are used for approxima- tion. Then local discrete equations can be simplified by con- densation of degree of freedom, which transfers equations of inner nodes to equations of boundary nodes based on cells. The global dynamic system equations are obtained by as- sembling all local discrete equations and are solved by using the standard implicit Newmark＇s time integration scheme. In the scheme of present method, the calculation of each cell is carried out by meshfree method, and local search is imple- mented in interpolation. Numerical examples show that the present method has high computational efficiency and good accuracy in solving elastic dynamic problems.展开更多
Let n 〉 r, let lr --- （dl,d2,-,dn） be a non-increasing sequence of nonnegative integers and let Kr＋l - e be the graph obtained from Kr＋l by deleting one edge. If zr has a realization G containing Kr＋l - e as a s...Let n 〉 r, let lr --- （dl,d2,-,dn） be a non-increasing sequence of nonnegative integers and let Kr＋l - e be the graph obtained from Kr＋l by deleting one edge. If zr has a realization G containing Kr＋l - e as a subgraph, then r is said to be potentially Kr＋l - e-graphic. In this paper, we give a characterization for a sequence π to be potentially Kr＋l - e-graphic.展开更多
In order to supply better accordance for mod eling and simulation of complex networks, a new degree dependence entropy （DDE） descriptor is proposed to describe the degree dependence relationship and corre sponding c...In order to supply better accordance for mod eling and simulation of complex networks, a new degree dependence entropy （DDE） descriptor is proposed to describe the degree dependence relationship and corre sponding characteristic in this paper. First of all, degrees of vertices and the shortest path lengths between all pairs of ,ertices are computed. Then the degree dependence matrices under different shortest path lengths are con structed. At last the DDEs are extracted from the degree dependence matrices. Simulation results show that the DDE descriptor can reflect the complexity of degree dependence relationship in complex networks; high DDE indicates complex degree dependence relationship; low DDE indicates the opposite one. The DDE can be seen as a quantitative statistical characteristic, which is meaningful for networked modeling and simulation.展开更多
基金supported by the National Natural Science Founda-tion of China(11272118)Open Found of State Key Laboratory of Explosion Science and Technology(KFJJ12-5M)
文摘Condensation technique of degree of freedom is first proposed to improve the computational efficiency of meshfree method with Galerkin weak form for elastic dy- namic analysis. In the present method, scattered nodes with- out connectivity are divided into several subsets by cells with arbitrary shape. Local discrete equation is established over each cell by using moving Kriging interpolation, in which the nodes that located in the cell are used for approxima- tion. Then local discrete equations can be simplified by con- densation of degree of freedom, which transfers equations of inner nodes to equations of boundary nodes based on cells. The global dynamic system equations are obtained by as- sembling all local discrete equations and are solved by using the standard implicit Newmark＇s time integration scheme. In the scheme of present method, the calculation of each cell is carried out by meshfree method, and local search is imple- mented in interpolation. Numerical examples show that the present method has high computational efficiency and good accuracy in solving elastic dynamic problems.
基金Supported by National Natural Science Foundation of China(Nos.11161016 and 10861006)
文摘Let n 〉 r, let lr --- （dl,d2,-,dn） be a non-increasing sequence of nonnegative integers and let Kr＋l - e be the graph obtained from Kr＋l by deleting one edge. If zr has a realization G containing Kr＋l - e as a subgraph, then r is said to be potentially Kr＋l - e-graphic. In this paper, we give a characterization for a sequence π to be potentially Kr＋l - e-graphic.
基金supported by the National Natural Science Foundation of China(Grants Nos.61174156,61273189,71073172,61174035,61203140)
文摘In order to supply better accordance for mod eling and simulation of complex networks, a new degree dependence entropy （DDE） descriptor is proposed to describe the degree dependence relationship and corre sponding characteristic in this paper. First of all, degrees of vertices and the shortest path lengths between all pairs of ,ertices are computed. Then the degree dependence matrices under different shortest path lengths are con structed. At last the DDEs are extracted from the degree dependence matrices. Simulation results show that the DDE descriptor can reflect the complexity of degree dependence relationship in complex networks; high DDE indicates complex degree dependence relationship; low DDE indicates the opposite one. The DDE can be seen as a quantitative statistical characteristic, which is meaningful for networked modeling and simulation.
