期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
3D Simulation of Flow with Free Surface Based on Adaptive Octree Mesh System 被引量:1
1
作者 李绍武 庄茜 +1 位作者 黄筱云 王东 《Transactions of Tianjin University》 EI CAS 2015年第1期32-40,共9页
The technique of adaptive tree mesh is an effective way to reduce computational cost through automatic adjustment of cell size according to necessity. In the present study, the 2D numerical N-S solver based on the ada... The technique of adaptive tree mesh is an effective way to reduce computational cost through automatic adjustment of cell size according to necessity. In the present study, the 2D numerical N-S solver based on the adaptive quadtree mesh system was extended to a 3D one, in which a spatially adaptive oetree mesh system and multiple particle level set method were adopted for the convenience to deal with the air-water-structure multiple-medium coexisting domain. The stretching process of a dumbbell was simulated and the results indicate that the meshes are well adaptable to the free surface. The collapsing process of water column impinging a circle cylinder was simulated and from the results, it can be seen that the processes of fluid splitting and merging are properly simulated. The interaction of second-order Stokes waves with a square cylinder was simulated and the obtained drag force is consistent with the result by the Morison's wave force formula with the coefficient values of the stable drag component and the inertial force component bein~ set as 2.54. 展开更多
关键词 adaptive octree mesh 3D numerical flume spatially adaptive multiple particle level set
下载PDF
Hybrid tri-memristor hyperchaotic map and application in Wasserstein Generative Adversarial Nets
2
作者 GU Yang BAO Han +3 位作者 YU XiHong HUA ZhongYun BAO BoCheng XU Quan 《Science China(Technological Sciences)》 SCIE EI CAS CSCD 2024年第6期1855-1865,共11页
Inspired by basic circuit connection methods,memristors can also be utilized in the construction of complex discrete chaotic systems.To investigate the dynamical effects of hybrid memristors,we propose two hybrid tri-... Inspired by basic circuit connection methods,memristors can also be utilized in the construction of complex discrete chaotic systems.To investigate the dynamical effects of hybrid memristors,we propose two hybrid tri-memristor hyperchaotic(HTMH)mapping structures based on the hybrid parallel/cascade and cascade/parallel operations,respectively.Taking the HTMH mapping structure with hybrid parallel/cascade operation as an example,this map possesses a spatial invariant set whose stability is closely related to the initial states of the memristors.Dynamics distributions and bifurcation behaviours dependent on the control parameters are explored with numerical tools.Specifically,the memristor initial offset-boosting mechanism is theoretically demonstrated,and memristor initial offset-boosting behaviours are numerically verified.The results clarify that the HTMH map can exhibit hyperchaotic behaviours and extreme multistability with homogeneous coexisting infinite attractors.In addition,an FPGA hardware platform is fabricated to implement the HTMH map and generate pseudorandom numbers(PRNs)with high randomness.Notably,the generated PRNs can be applied in Wasserstein generative adversarial nets(WGANs)to enhance training stability and generation capability. 展开更多
关键词 memristor hybrid tri-memristor map spatial invariant set HYPERCHAOS extreme multistability generative adversarial nets
原文传递
Top-k probabilistic prevalent co-location mining in spatially uncertain data sets 被引量:5
3
作者 Lizhen WANG Jun HAN +1 位作者 Hongmei CHEN Junli LU 《Frontiers of Computer Science》 SCIE EI CSCD 2016年第3期488-503,共16页
A co-location pattern is a set of spatial features whose instances frequently appear in a spatial neighborhood. This paper efficiently mines the top-k probabilistic prevalent co-locations over spatially uncertain data... A co-location pattern is a set of spatial features whose instances frequently appear in a spatial neighborhood. This paper efficiently mines the top-k probabilistic prevalent co-locations over spatially uncertain data sets and makes the following contributions: 1) the concept of the top-k prob- abilistic prevalent co-locations based on a possible world model is defined; 2) a framework for discovering the top- k probabilistic prevalent co-locations is set up; 3) a matrix method is proposed to improve the computation of the preva- lence probability of a top-k candidate, and two pruning rules of the matrix block are given to accelerate the search for ex- act solutions; 4) a polynomial matrix is developed to further speed up the top-k candidate refinement process; 5) an ap- proximate algorithm with compensation factor is introduced so that relatively large quantity of data can be processed quickly. The efficiency of our proposed algorithms as well as the accuracy of the approximation algorithms is evaluated with an extensive set of experiments using both synthetic and real uncertain data sets. 展开更多
关键词 spatial co-location mining top-k probabilistic prevalent co-location mining spatially uncertain data sets matrix methods
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部