Stiffness of sands through a laboratory test database

Deformations of sandy soils around geotechnical structures generally involve strains in the range small (0·01%) to medium (0·5%). In this strain range the soil exhibits non-linear stress-strain behaviour, which should be incorporated in any deformation analysis. In order to capture the possible variability in the non-linear behaviour of various sands, a database was constructed including the secant shear modulus degradation curves of 454 tests from the literature. By obtaining a unique S-shaped curve of shear modulus degradation, a modified hyperbolic relationship was fitted. The three curve-fitting parameters are: an elastic threshold strain γe, up to which the elastic shear modulus is effectively constant at G0; a reference strain γr, defined as the shear strain at which the secant modulus has reduced to 0·5G0; and a curvature parameter a, which controls the rate of modulus reduction. The two characteristic strains γe and γr were found to vary with sand type (i.e. uniformity coefficient), soil state (i.e. void ratio, relative density) and mean effective stress. The new empirical expression for shear modulus reduction G/G0 is shown to make predictions that are accurate within a factor of 1·13 for one standard deviation of random error, as determined from 3860 data points. The initial elastic shear modulus, G0, should always be measured if possible, but a new empirical relation is shown to provide estimates within a factor of 1·6 for one standard deviation of random error, as determined from 379 tests. The new expressions for non-linear deformation are easy to apply in practice, and should be useful in the analysis of geotechnical structures under static loading.

Beyond 2D-grids: A dependence maximization view on image browsing

Ideally, one would like to perform image search using an intuitive and friendly approach. Many existing image search engines, however, present users with sets of images arranged in some default order on the screen, typically the relevance to a query, only. While this certainly has its advantages, arguably, a more flexible and intuitive way would be to sort images into arbitrary structures such as grids, hierarchies, or spheres so that images that are visually or semantically alike are placed together. This paper focuses on designing such a navigation system for image browsers. This is a challenging task because arbitrary layout structure makes it difficult - if not impossible - to compute cross-similarities between images and structure coordinates, the main ingredient of traditional layouting approaches. For this reason, we resort to a recently developed machine learning technique: kernelized sorting. It is a general technique for matching pairs of objects from different domains without requiring cross-domain similarity measures and hence elegantly allows sorting images into arbitrary structures. Moreover, we extend it so that some images can be preselected for instance forming the tip of the hierarchy allowing to subsequently navigate through the search results in the lower levels in an intuitive way. Copyright 2010 ACM.