Results 221 to 230 of about 19,688 (266)

Reconstruction and Microstructure Characterization of Tailings Materials with Varying Particle Sizes. [PDF]

Materials (Basel)
Pan Z, Xu M, Liu T, Huang J, Li X, Zhang C.   +5 more
europepmc   +1 more source

Stitch-Less Lithography Empowered by Multi-Dimensional Holography. [PDF]

Nanomaterials (Basel)
Huang HH, Mu H, Puig Vilardell E, Anand V, Gailevičius D, Juodkazis S.   +5 more
europepmc   +1 more source

Cover-free families on hypergraphs and combinatorial group testing. [PDF]

J Comb Optim
Idalino TB, Moura L.
europepmc   +1 more source

Crystal structures of PCNA1 and PCNA2 from Aeropyrum pernix: implications for a distorted heterotrimeric sliding clamp. [PDF]

Acta Crystallogr F Struct Biol Commun
Wang T, Ishino S, Ishino Y, Oyama T.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Packing Measure and Dimension

Series on Advances in Mathematics for Applied Sciences, 2022
exaly   +2 more sources

Packing dimensions of projections and dimension profiles

Mathematical Proceedings of the Cambridge Philosophical Society, 1997
Let \(E\subset\mathbb{R}^n\) be an analytic set and \(\mu\in{\mathfrak M}^+_c(E)\) a finite Borel measure on \(E\) with compact support. For a real number \(s\) with \(0\leq s\leq n\) put \[ F^\mu_s(x,r)= \int_{\mathbb{R}^n}\min\{1,r^s|y-x|^{-s}\}d\mu(y).
Falconer, K. J., Howroyd, J. D.
openaire   +1 more source

The Hausdorf dimension of the Apollonian packing of circles

Journal of Physics A: Mathematical and General, 1994
Summary: We formulate the problem of determining the Hausdorff dimension, \(d_f\), of the Apollonian packing of circles as an eigenvalue problem of a linear integral equation. We show that solving a finite-dimensional approximation to this infinite-order matrix equation and extrapolating the results provides a fast algorithm for obtaining high ...
Thomas, Peter B., Dhar, Deepak
openaire   +1 more source

Packing Measure and Dimension of Random Fractals

Journal of Theoretical Probability, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berlinkov, Artemi, Mauldin, R. Daniel
openaire   +2 more sources

Bin-packing in 1.5 dimension

1988
We propose and motivate a new variant of the wellknown two-dimensional binpacking problem (orthogonal and oriented rectangle packing). In our model, we are allowed to cut a rectangle and move the parts horizontally. We describe two relatively simple algorithms for this problem and determine their asymptotic performance ratios.
openaire   +1 more source

Box and packing dimensions of projections and dimension profiles

Mathematical Proceedings of the Cambridge Philosophical Society, 2001
For E a subset of ℝn and s ∈ [0, n] we define upper and lower box dimension profiles, B-dimsE and B-dimsE respectively, that are closely related to the box dimensions of the orthogonal projections of E onto subspaces of ℝn. In particular, the projection of E onto almost all m-dimensional subspaces has upper box dimension B-dimmE and lower box ...
openaire   +2 more sources