The teleseismic receiver functions of 48 stations belonging to the CCDSN are used to invert the crustal structure beneath each station with the neighborhood algorithm. Thin layers with low velocity have been found ben...The teleseismic receiver functions of 48 stations belonging to the CCDSN are used to invert the crustal structure beneath each station with the neighborhood algorithm. Thin layers with low velocity have been found beneath eight stations with ＂abnormal＂ observed receiver functions. Unreasonable results of few stations have been adjusted lightly with the trial-and-error method. The final result indicates that the crust in the western China is relatively thicker than the eastern China. The crust thickness beneath the Tibetan plateau is very large, which reaches 84 km at the station LSA. Double-crust structure exists below the stations LSA and CAD in Tibet, which might imply the collision between the Indian and Eurasian plates. A pronounced low velocity zone in the lower crust beneath the station TNC of Yunnan province might relate to the high temperature or emergence of partially molten material caused by Quaternary volcano, magma and geothermal activities in this area. The Moho is a transitional zone made up of thin layers instead of simple sharp discontinuity beneath several stations. The Conrad discontinuity is clearly identified beneath 20 stations mainly in the southeastern China, whereas it is blurry beneath 14 stations and uncertain beneath remaining stations.展开更多
This paper discusses the function class Hβ(a) of the from f(z)=z+∑k=(n+1)^+∞, which satisfies the conditon Re[f'(Z)+βzf″(z)]＞a, (0≤a＜1) in |z|＜1, with its inclusion relation ,neighborhood properties and t...This paper discusses the function class Hβ(a) of the from f(z)=z+∑k=(n+1)^+∞, which satisfies the conditon Re[f'(Z)+βzf″(z)]＞a, (0≤a＜1) in |z|＜1, with its inclusion relation ,neighborhood properties and the deviation theorem ,convolution properties in the case when f(z) has negative coefficients.展开更多
针对传统蚁群算法在机器人路径规划中路径不是最短距离、运行时间长以及收敛速度慢等问题,提出多邻域蚁群算法(multi-neighborhood ant colony algorithm,ACO-MN)。为了解决路径不是最短距离的问题,引入多邻域搜索,使得搜索邻域扩大,机...针对传统蚁群算法在机器人路径规划中路径不是最短距离、运行时间长以及收敛速度慢等问题,提出多邻域蚁群算法(multi-neighborhood ant colony algorithm,ACO-MN)。为了解决路径不是最短距离的问题,引入多邻域搜索,使得搜索邻域扩大,机器人的路径距离减小;为了解决运行时间长的问题,在快速判断的基础上运用象限概率和象限概率控制参数,使得算法运行加快;为了解决收敛速度慢的问题,结合步长和邻域夹角改进启发函数,使得算法在后期的收敛速度加快。最后,在不同大小、不同复杂程度的栅格地图下,将ACO-MN与传统蚁群算法和其他改进算法进行仿真对比实验。实验表明,在小规模简单环境下ACO-MN的收敛速度相比于传统蚁群算法加快了76.19%,在大规模复杂环境下ACO-MN的运行时间相比于其他改进算法缩短了49.84%,最短路径缩短了5.6%,验证了该算法的有效性和优越性。展开更多
基金supported by the basic research and development fund from Institute of Earthquake Science,China Earthquake Administration(grant No.2011IESLZ05)the National Natural Science Foundation of China(grant Nos.40374009and 40904014)
文摘The teleseismic receiver functions of 48 stations belonging to the CCDSN are used to invert the crustal structure beneath each station with the neighborhood algorithm. Thin layers with low velocity have been found beneath eight stations with ＂abnormal＂ observed receiver functions. Unreasonable results of few stations have been adjusted lightly with the trial-and-error method. The final result indicates that the crust in the western China is relatively thicker than the eastern China. The crust thickness beneath the Tibetan plateau is very large, which reaches 84 km at the station LSA. Double-crust structure exists below the stations LSA and CAD in Tibet, which might imply the collision between the Indian and Eurasian plates. A pronounced low velocity zone in the lower crust beneath the station TNC of Yunnan province might relate to the high temperature or emergence of partially molten material caused by Quaternary volcano, magma and geothermal activities in this area. The Moho is a transitional zone made up of thin layers instead of simple sharp discontinuity beneath several stations. The Conrad discontinuity is clearly identified beneath 20 stations mainly in the southeastern China, whereas it is blurry beneath 14 stations and uncertain beneath remaining stations.
文摘This paper discusses the function class Hβ(a) of the from f(z)=z+∑k=(n+1)^+∞, which satisfies the conditon Re[f'(Z)+βzf″(z)]＞a, (0≤a＜1) in |z|＜1, with its inclusion relation ,neighborhood properties and the deviation theorem ,convolution properties in the case when f(z) has negative coefficients.
文摘针对传统蚁群算法在机器人路径规划中路径不是最短距离、运行时间长以及收敛速度慢等问题,提出多邻域蚁群算法(multi-neighborhood ant colony algorithm,ACO-MN)。为了解决路径不是最短距离的问题,引入多邻域搜索,使得搜索邻域扩大,机器人的路径距离减小;为了解决运行时间长的问题,在快速判断的基础上运用象限概率和象限概率控制参数,使得算法运行加快;为了解决收敛速度慢的问题,结合步长和邻域夹角改进启发函数,使得算法在后期的收敛速度加快。最后,在不同大小、不同复杂程度的栅格地图下,将ACO-MN与传统蚁群算法和其他改进算法进行仿真对比实验。实验表明,在小规模简单环境下ACO-MN的收敛速度相比于传统蚁群算法加快了76.19%,在大规模复杂环境下ACO-MN的运行时间相比于其他改进算法缩短了49.84%,最短路径缩短了5.6%,验证了该算法的有效性和优越性。
