The porosity of porous media is a key factor affecting cement slurry diffusion. In this paper, theoretical model diffusion in considering the variation proposed. validated through comparison with experimental results literature. influence injection parameters (i.e., water–cement ratio and pore fractal dimension) on strength analyzed. indicate that: under same dimension, specimen increases gradu...

[1] The generalized radial flow approach to hydraulic test interpretation uses the flow dimension to describe the change in flow area versus radial distance from the borehole. The flow dimension of a hydraulic test may reflect several characteristics of the hydrogeologic system, including heterogeneity, boundaries, and leakage. We show that a radial flow system with a linear, constant-head boun...

We present a comprehensive analysis of the contributions to K → πνν̄ decays not described by the leading dimension-six effective Hamiltonian. These include both dimensioneight four-fermion operators generated at the charm scale, and genuine long-distance contributions which can be described within the framework of chiral perturbation theory. We show that a consistent treatment of the latter cont...

In high-dimension, low-sample size (HDLSS) data, it is not always true that closeness of two objects reflects a hidden cluster structure. We point out the important fact that it is not the closeness, but the “values” of distance that contain information of the cluster structure in highdimensional space. Based on this fact, we propose an efficient and simple clustering approach, called distance ...

A simple graph G is representable in a real vector space of dimension m if there is an embedding of the vertex set in the vector space such that the Euclidean distance between any two vertices is one of only two distinct values a or b, with distance a if the vertices are adjacent and distance b otherwise. The Euclidean representation number of G is the smallest dimension in which G is represent...

We study the chamfer distance transformations of binary digital images and corresponding Lipschitz covers of grayscale images. Validity of the double scan algorithm in arbitrary dimension is proved.

New spherical codes called laminated spherical codes are constructed in dimensions 2–49 using a technique similar to the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension. Laminated spherical codes outperform the best known spherical codes in the minimum distance sense for many code sizes. The density of a lam...

Distance geometry is a branch of geometry which puts the concept of distance at its core. The fundamental problem of distance geometry asks to find a realization of a finite, but partially specified, metric space in a Euclidean space of given dimension. An associated problem asks the same question in a Euclidean space of any dimension. Both problems have many applications to science and enginee...

The square C of a linear error correcting code C is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in C. Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications one is concerned about some of the parameters (dimension, minimum distance) of both C and C. In th...

In general, the clustering problem is NP–hard, and global optimality cannot be established for non–trivial instances. For high–dimensional data, distance–based methods for clustering or classification face an additional difficulty, the unreliability of distances in very high–dimensional spaces. We propose a distance–based iterative method for clustering data in very high–dimensional space, usin...