期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Experimental investigation on static and dynamic resilient moduli of compacted fine soil 被引量:1
1
作者 Qiu Bo Yan Feng Zhang +2 位作者 Kang Wei Tang shu juan wang Yan Liu 《Research in Cold and Arid Regions》 CSCD 2017年第3期297-306,共10页
To investigate the static and dynamic resilient modulus of fine soil,and adapting to the new design code and maintenance system of highway subgrade in China,a series of static and dynamic tests were carried out accord... To investigate the static and dynamic resilient modulus of fine soil,and adapting to the new design code and maintenance system of highway subgrade in China,a series of static and dynamic tests were carried out according to the standard laboratory test methods(JTG E40-2007 and JTG D30-2015,respectively).The effects of initial water content,compactness and freeze-thaw cycles on the static and dynamic resilient moduli of fine soil were investigated and analyzed.Experimental test results show that with increasing water content,dry density and freeze-thaw cycles,the static moduli reduces about10.2%~40.0%,14.4%~45.5%,and 24.0%~50.3%,and dynamic moduli reduces about 10.9%~90.8%,2.5%~38.4%,and0.0%~46.0%,respectively.Then,the empirical mathematical relationship between static and dynamic resilient moduli was established under different water content,dry density and freeze-thaw cycles.The investigation results can be used to determine the dynamic modulus of fine soil by widely used static modulus,which could meet the requirement of adopting dynamic modulus index in new specification. 展开更多
关键词 FINE SOIL static MODULUS dynamic MODULUS FREEZE-THAW cycle mathematical relationship
下载PDF
The Vertex Euclidean Properties of Graphs
2
作者 Zhen Bin GAO Meng wang +2 位作者 Sin Min LEE Harris KWONG shu juan wang 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2022年第7期1185-1202,共18页
A simple graph G=(V,E)is said to be vertex Euclidean if there exists a bijection f from V to{1,2,...,|V|}such that f(u)+f(v)>f(w)for each C3 subgraph with vertex set{u,v,w},where f(u)<f(v)<f(w).The vertex Euc... A simple graph G=(V,E)is said to be vertex Euclidean if there exists a bijection f from V to{1,2,...,|V|}such that f(u)+f(v)>f(w)for each C3 subgraph with vertex set{u,v,w},where f(u)<f(v)<f(w).The vertex Euclidean deficiency of a graph G,denotedμv Euclid(G),is the smallest positive integer n such that G∪N_(n) is vertex Euclidean.In this paper,we introduce some methods for deriving the vertex Euclidean properties of some simple graphs. 展开更多
关键词 Vertex Euclidean graph vertex Euclidean deficiency total graph of simple graph Zykov graph
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部