Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

1. Basic convexity 2. Boundary structure 3. Minkowski addition 4. Curvature measure and quermass integrals 5. Mixed volumes 6. Inequalities for mixed volumes 7. Selected applications Appendix.

/pdf/convex-bodies-the-brunn-minkowski-theory-3raynvod45.pdf

Convex bodies : the Brunn-Minkowski theory

비만아 부모의 돌봄 경험: q 방법론

Convex bodies: the brunn–minkowski theory

A variety of nonlinear, including semidefinite, relaxations have been developed in recent years for nonconvex optimization problems. Their potential can be realized only if they can be solved with sufficient speed and reliability. Unfortunately, state-of-the-art nonlinear programming codes are significantly slower and numerically unstable compared to linear programming software.In this paper, we facilitate the reliable use of nonlinear convex relaxations in global optimization via a polyhedral branch-and-cut approach. Our algorithm exploits convexity, either identified automatically or supplied through a suitable modeling language construct, in order to generate polyhedral cutting planes and relaxations for multivariate nonconvex problems. We prove that, if the convexity of a univariate or multivariate function is apparent by decomposing it into convex subexpressions, our relaxation constructor automatically exploits this convexity in a manner that is much superior to developing polyhedral outer approximators for the original function. The convexity of functional expressions that are composed to form nonconvex expressions is also automatically exploited.Root-node relaxations are computed for 87 problems from globallib and minlplib, and detailed computational results are presented for globally solving 26 of these problems with BARON 7.2, which implements the proposed techniques. The use of cutting planes for these problems reduces root-node relaxation gaps by up to 100% and expedites the solution process, often by several orders of magnitude.

/pdf/a-polyhedral-branch-and-cut-approach-to-global-optimization-3yut5edcbr.pdf

A polyhedral branch-and-cut approach to global optimization

In analogy with the classical Minkowski problem, necessary and sufficient conditions are given to assure that a given measure on the unit sphere is the cone-volume measure of the unit ball of a finite dimensional Banach space.

/pdf/the-logarithmic-minkowski-problem-1w7h7l38j7.pdf

The logarithmic Minkowski problem

The log-Brunn-Minkowski inequality

Packing of spheres in spaces of constant curvature

Finite arrangements of convex bodies were intensively investigated in the second half of the twentieth century. Connections to many other subjects were made, including crystallography, the local theory of Banach spaces, and combinatorial optimisation. This book, the first one dedicated solely to the subject, provides an in-depth state-of-the-art discussion of the theory of finite packings and coverings by convex bodies. It contains various new results and arguments, besides collecting those scattered around in the literature, and provides a comprehensive treatment of problems whose interplay was not clearly understood before. In order to make the material more accessible, each chapter is essentially independent, and two-dimensional and higher-dimensional arrangements are discussed separately. Arrangements of congruent convex bodies in Euclidean space are discussed, and the density of finite packing and covering by balls in Euclidean, spherical and hyperbolic spaces is considered.

Finite Packing and Covering

A new sufficient condition for the existence of a solution for the logarithmic Minkowski problem is established. This new condition contains the one established by Zhu [70] and the discrete case established by Boroczky et al. [7] as two important special cases. © The Author(s) 2015. Published by Oxford University Press. All rights reserved.

/pdf/on-the-discrete-logarithmic-minkowski-problem-6fkbhtsbb9.pdf

Károly J. Böröczky

Papers

The logarithmic Minkowski problem

The log-Brunn-Minkowski inequality

Packing of spheres in spaces of constant curvature

Finite Packing and Covering

On the Discrete Logarithmic Minkowski Problem