A soil gas measurement method developed earlier, [Nucl Tracks Radiat Meas, 22(1-4) (1993) 468] was applied to boreholes drilled to below foundation depth. Radon concentration and permeability were measured at 50-cm intervals. In radon prone areas, permeability showed an increase with depth over several orders of magnitude, indicating a low permeability top layer with a thickness of 0.5 m and mo...

Local scouring around bridge piers is a natural phenomenon caused by the erosive process of flowing stream on alluvial beds. The 3D flow field around bridge piers interacting with the bed materials increases complexity of local scour process. The local scour depth develops in accelerated flows and if it is not predicted correctly, the bottom level of local scour hole will exceed the original le...

the construction of underground tunnel plays a more and more important role in the development of big cities. one of the most important problems caused by the construction of the tunnel is that underground excavation will cause large settlement of the ground and buildings. previous studied showed the difference between numerical and experimental results. in this study the case study of niyayesh...

failure of the quay walls due to earthquakes results in severe economic loss. because of hazards threatening such inexpensive nodes of national and international transportation networks, seismic design of quay walls is still an evolving topic in marine structural engineering. this study investigates the sensitivity of the gravity-type quay wall stability respect to uncertain soil and seismic pr...

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...

A computable complexity measure analogous to computational depth is developed using the Lempel-Ziv compression algorithm. This complexity measure, which we call compression depth, is then applied to the computational output of cellular automata. We nd that compression depth captures the complexity found in Wolfram Class III celluar automata, and is in good agreement with his classi cation schem...