In this paper,a flexible modular“Tetris”microsatellite platform is studied to implement the rapid integration and assembly of microsatellites.The proposed microsatellite platform is fulfilled based on a sandwich ass...In this paper,a flexible modular“Tetris”microsatellite platform is studied to implement the rapid integration and assembly of microsatellites.The proposed microsatellite platform is fulfilled based on a sandwich assembly mode which consists of the isomorphic module structure and the standard mechanical-electric-data-thermal interfaces.The advantages of the sandwich assembly mode include flexible reconfiguration and efficient assembly.The prototype of the sandwich assembly mode is built for verifying the performance and the feasibility of the proposed mechanical-electric-data-thermal interfaces.Finally,an assembly case is accomplished to demonstrate the validity and advantages of the proposed“Tetris”microsatellite platform.展开更多
Erdosa and Sós conjectured in 1963 that if G is a graph o ofof ordeq >1/2p(k - 1), then G contains every tree of size k. It is shown in this paper that the conjecture is true if the complement G of G contains ...Erdosa and Sós conjectured in 1963 that if G is a graph o ofof ordeq >1/2p(k - 1), then G contains every tree of size k. It is shown in this paper that the conjecture is true if the complement G of G contains no a copy of K3 as an induced subgraph of G.展开更多
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annea...Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.展开更多
A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves ...A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.展开更多
In nature, iron cations in magnetite are usually isomorphically substituted by divalent (Co, Ni, Zn, Cu, Mn, etc.), trivalent (Al, V, Cr, etc.) and tetravalent (Ti) cations while maintaining the spinel structure. Some...In nature, iron cations in magnetite are usually isomorphically substituted by divalent (Co, Ni, Zn, Cu, Mn, etc.), trivalent (Al, V, Cr, etc.) and tetravalent (Ti) cations while maintaining the spinel structure. Some of the substituting cations, e.g. Cr3+, V3+ and Mn2+, improve the catalytic activity of magnetite in heterogeneous Fenton reaction through the enhancement of hydroxyl radical OH production and the pollutant adsorption.展开更多
基金supported by the National Natural Science Foundation of China(6210333962073261)+1 种基金Shaanxi Natural Science Basic Research Program(2023-JC-YB-569)the Fundamental Research Funds for the Central Universities。
文摘In this paper,a flexible modular“Tetris”microsatellite platform is studied to implement the rapid integration and assembly of microsatellites.The proposed microsatellite platform is fulfilled based on a sandwich assembly mode which consists of the isomorphic module structure and the standard mechanical-electric-data-thermal interfaces.The advantages of the sandwich assembly mode include flexible reconfiguration and efficient assembly.The prototype of the sandwich assembly mode is built for verifying the performance and the feasibility of the proposed mechanical-electric-data-thermal interfaces.Finally,an assembly case is accomplished to demonstrate the validity and advantages of the proposed“Tetris”microsatellite platform.
文摘Erdosa and Sós conjectured in 1963 that if G is a graph o ofof ordeq >1/2p(k - 1), then G contains every tree of size k. It is shown in this paper that the conjecture is true if the complement G of G contains no a copy of K3 as an induced subgraph of G.
基金the National Natural Science Foundation of China (60373089, 60674106, and 60533010)the National High Technology Research and Development "863" Program (2006AA01Z104)
文摘Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.
基金Projects(61272142,61103082,61003075,61170261,61103193)supported by the National Natural Science Foundation of ChinaProject supported by Funds for New Century Excellent Talents in University of ChinaProjects(2012AA01A301,2012AA010901)supported by the National High Technology Research and Development Program of China
文摘A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.
文摘In nature, iron cations in magnetite are usually isomorphically substituted by divalent (Co, Ni, Zn, Cu, Mn, etc.), trivalent (Al, V, Cr, etc.) and tetravalent (Ti) cations while maintaining the spinel structure. Some of the substituting cations, e.g. Cr3+, V3+ and Mn2+, improve the catalytic activity of magnetite in heterogeneous Fenton reaction through the enhancement of hydroxyl radical OH production and the pollutant adsorption.
