Given two quasi-Banach ideals A and B we investigate the regular hull of their composition (A ◦ B). In concrete situations this regular hull appears more often than the composition itself. As a first example we obtain a description for the regular hull of the nuclear operators which is a ”reflected” Grothendieck representation: N reg 1 = I ◦W (theorem 2.1). Further we recognize that the class o...

If the condom doesn't fit, you must resize it Michael Cecil⁎, Anita L. Nelson, James Trussell, Robert Hatcher TheyFit Covington, GA 30014, USA David Geffen School of Medicine at UCLA, Torrance, CA 90502-2910, USA Office of Population Research, Princeton University, Princeton, NJ 08540, USA The Hull York Medical School, University of Hull, Hull HU6 7RX, England Emory University School of Medicin...

In this paper, the behavior of the pseudopolynomial numerical hull of a square complex matrix with respect to structured perturbations and its radius is investigated.

Abstract Autonomous materials discovery with desired properties is one of the ultimate goals for science, and current studies have been focusing mostly on high-throughput screening based density functional theory calculations forward modeling physical using machine learning. Applying deep learning techniques, we developed a generative model, which can predict distinct stable crystal structures ...

Classic convexity can be extended to graphs in a natural way by considering shortest paths, also called geodesics: a set S of vertices of a graph is convex if it contains all the vertices lying in some geodesic with endpoints in S and the convex hull of a set S of vertices is the minimum convex set containing S. Farber and Jamison [9] characterized the graphs such that every convex set is the c...

Consider a set of d-dimensional points where the existence or the location of each point is determined by a probability distribution. The convex hull of this set is a random variable distributed over exponentially many choices. We are interested in finding the most likely convex hull, namely, the one with the maximum probability of occurrence. We investigate this problem under two natural model...

We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let P be a set of n points in R. A point lies on the convex hull of a point set S if it lies on the boundary of the minimum convex polygon formed by S. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in P that also fal...

After McCallum and Avis [4] showed that the convex hull of a simple polygon P with n vertices can be constructed in O(n) time, several authors [1,2,3] devised simplified algorithms for this problem. Graham and Yao [2] presented a particularly simple and elegant one. After finding two points of the convex hull, their algorithm generated all other hull vertices using only one stack for intermedia...

To determine the antioxidant effects of rice hull extract exposed to far-infrared radiation, the added extracts were compared with sesamol in cooked turkey breast. Rice hull extract showed antioxidant properties in cooked turkey breast by reducing lipid oxidation and volatile aldehydes. Far-infrared radiation increased significantly the antioxidant activities of rice hull extracts. Rice hull ex...