期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Fast and accurate calculation of seismic wave travel time in 3D TTI media 被引量:1
1
作者 Mao Yuan-Tong Zhao Ai-Hua 《Applied Geophysics》 SCIE CSCD 2021年第4期545-556,594,595,共14页
The Tilted tilted transversely isotropic(TTI)media,a kind of anisotropic medium,widely exists within the earth.For faster calculation of travel times in the TTI anisotropic media,we modifi ed a minimum traveltime tree... The Tilted tilted transversely isotropic(TTI)media,a kind of anisotropic medium,widely exists within the earth.For faster calculation of travel times in the TTI anisotropic media,we modifi ed a minimum traveltime tree algorithm with high effi ciency by dynamical modifi cation of the secondary wave propagation region during the spread of seismic waves.To manage the wavefront points in the modified version,we used a novel minimum heap sorting technique to reduce the time spent on selecting secondary waves points.In this study,seismic group velocities were obtained from analytical solutions in terms of phase angle,and the corresponding phase angles were determined by binary search rather than approximate equations for weakly anisotropic media.For the most time-consuming part of the secondary wave traveltime calculation,the parallel computation was initially performed using multiple cores and threads.Numerical examples showed that the improved method can calculate seismic travel times and ray paths faster and accurately in a 3D TTI medium.For four cores and eight threads,the computing speed increased by six times when compared to the conventional method. 展开更多
关键词 TTI media ray tracing minimum traveltime tree algorithm minimum heap sorting parallel computation
在线阅读 下载PDF
A new polynomial algorithm for a parallelidentical scheduling problem
2
作者 Yumei LI Hongxing LI Vincent C. YEN 《控制理论与应用(英文版)》 EI 2007年第4期345-350,共6页
A precedence order is defined based on the release dates of jobs' direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel schedulin... A precedence order is defined based on the release dates of jobs' direct successors. Using the defined precedence order and Heap Sort, a new polynomial algorithm is provided which aims to solve the parallel scheduling problem P|pj = 1, r j, outtree| ∑Cj Cj. The new algorithm is shown to be more compact and easier to implement. 展开更多
关键词 Scheduling problem Precedence order heap sort ALGORITHM
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部