In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have disc...In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have discussed the vector bond graph representation of finite elementmethod in detail,there are:(1)the transformation of reference systems,(2)the transformation ofinertia matrices,stiffness matrices and vectors of joint force,(3)verctor bond graph representationof Lagrangian dynamic equation of structure.展开更多
For any group G, denote by πe (G) the set of orders of elements in G. Given a finite group G, let h(πe(G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G ...For any group G, denote by πe (G) the set of orders of elements in G. Given a finite group G, let h(πe(G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called κ-recognizable if h(πe(G)) =κ<∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3<q≡±2 (mod 5) and (6,(q- 1)/2)= 1, are recognizable.展开更多
We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the ...We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the parallel model,in which computation speed is a big concern.The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains,minimizing the sum weight of edges between different sub-domains.Multilevel schemes for graph partitioning are divided into three phases:coarsening,partitioning,and uncoarsening.In the uncoarsening phase,many refinement algorithms have been proposed previously,such as KL,Greedy,and Boundary refinements.In this study,we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay.Compared with original partitioning algorithm in previous models,the N-Best algorithm can speed up the computation by 1.9 times,and the simulation results are in a good match with the in-situ data.展开更多
针对当前空间信息网络(Spatial Information Network,SIN)地面数据处理模式中存在的高传输时延问题,提出了基于算力路由的低时延在轨协同计算策略。考虑到卫星网络的动态变化及卫星计算资源的异构性,提出了要素时空扩展图模型,以实现在...针对当前空间信息网络(Spatial Information Network,SIN)地面数据处理模式中存在的高传输时延问题,提出了基于算力路由的低时延在轨协同计算策略。考虑到卫星网络的动态变化及卫星计算资源的异构性,提出了要素时空扩展图模型,以实现在屏蔽SIN动态性的同时对星上资源进行精确表征。在此基础上,构建基于算力路由的多星在轨协同计算数学模型,提出时延优化问题,并利用改进的异构最早完成时间(Heterogeneous Earliest Finish Time,HEFT)算法进行求解。仿真结果表明:卫星在轨协同计算可有效降低卫星数据的任务处理时延;同时,本文所提的改进HEFT算法以较小且可接受的收敛性能为代价,换取了业务处理时延的大幅度降低。展开更多
文摘In this paper we have shown that the invariance of energy(kinetic energy,potential energy)and virtual work is the common feature of vector bond graph and finite element method in struc-tural dynamics.Then we have discussed the vector bond graph representation of finite elementmethod in detail,there are:(1)the transformation of reference systems,(2)the transformation ofinertia matrices,stiffness matrices and vectors of joint force,(3)verctor bond graph representationof Lagrangian dynamic equation of structure.
基金This work has been supported by the Research Institute for Fundamental Sciences Tabriz,Iran.
文摘For any group G, denote by πe (G) the set of orders of elements in G. Given a finite group G, let h(πe(G)) be the number of isomorphism classes of finite groups with the same set πe(G) of element orders. A group G is called κ-recognizable if h(πe(G)) =κ<∞, otherwise G is called non-recognizable. Also a 1-recognizable group is called a recognizable (or characterizable) group. In this paper the authors show that the simple groups PSL(3,q), where 3<q≡±2 (mod 5) and (6,(q- 1)/2)= 1, are recognizable.
基金Supported by the National Natural Science Foundation of China (Nos. 40406005,41076001,40440420596)
文摘We enhance a robust parallel finite element model for coasts and estuaries cases with the use of N-Best refinement algorithms,in multilevel partitioning scheme.Graph partitioning is an important step to construct the parallel model,in which computation speed is a big concern.The partitioning strategy includes the division of the research domain into several semi-equal-sized sub-domains,minimizing the sum weight of edges between different sub-domains.Multilevel schemes for graph partitioning are divided into three phases:coarsening,partitioning,and uncoarsening.In the uncoarsening phase,many refinement algorithms have been proposed previously,such as KL,Greedy,and Boundary refinements.In this study,we propose an N-Best refinement algorithm and show its advantages in our case study of Xiamen Bay.Compared with original partitioning algorithm in previous models,the N-Best algorithm can speed up the computation by 1.9 times,and the simulation results are in a good match with the in-situ data.
