Abstract John’s fundamental theorem characterizing the largest volume ellipsoid contained in a convex body $K$ $\mathbb{R}^{d}$ has seen several generalizations and extensions. One direction, initiated by V. Milman is to replace ellipsoids positions (affine images) of another $L$. Another, more recent direction consider logarithmically concave functions on instead bodies: we designate some spec...

We prove that for all 1 ≤ p ≤ ∞, p 6= 2, the Lp spaces associated to two von Neumann algebrasM, N are isometrically isomorphic if and only if M and N are Jordan *-isomorphic. This follows from a noncommutative Lp Banach-Stone theorem: a specific decomposition for surjective isometries of noncommutative Lp spaces.

based on a complete heyting algebra, we modify the definition oflattice-valued fuzzifying convergence space using fuzzy inclusionorder and construct in this way a cartesian-closed category, calledthe category of $l-$ordered fuzzifying convergence spaces, in whichthe category of $l-$fuzzifying topological spaces can be embedded.in addition, two new categories are introduced, which are called the...

Abstract: This paper analyzes the organizational structure of the Global Manufacturing Virtual Network (GMVN) and the material flow relationship between its members. In this paper we utilize an input-output model to describe the supply network of the GMVN. In addition to this, we discuss the manufacturing costs of in-theplan and out-of the-plan for short life-cycle products. Based on the aforem...

R d is log-concave if p = e where φ :Rd → [−∞,∞) is concave. We denote the class of all such densities p on R by Pd,0. Log-concave densities are always unimodal and have convex level sets. Furthermore, log-concavity is preserved under marginalization and convolution. Thus, the classes of log-concave densities can be viewed as natural nonparametric extensions of the class of Gaussian densities. ...

This paper proposes a method based on linear programming techniques to treat quasi-concave and non-concave fuzzy multi-objective programming (FMOP) problems. The proposed method initially presents a piecewise linear expression to interpreting a quasi-concave membership function. Then we 7nd the convex-type break points and transform all quasiconcave membership functions into concave functions. ...

A function F defined on all subsets of a finite ground set E is quasiconcave if F (X∪Y ) ≥ min{F (X), F (Y )} for all X, Y ⊂ E. Quasi-concave functions arise in many fields of mathematics and computer science such as social choice, theory of graph, data mining, clustering and other fields. The maximization of quasi-concave function takes, in general, exponential time. However, if a quasi-concav...

inf u 6 Ttu(x) 6 u(x) 6 Ťtu(x) 6 supu for each t > 0 and each x ∈ H. A function u : H −→ R is called k-semi-concave, k > 0, if the function x −→ u(x)−‖x‖2/k is concave. The function u is called k-semi-convex if −u is k-semiconcave. A bounded function u is t-semi-concave if and only if it belongs to the image of the operator Tt, this follows from Lemma 1 and Lemma 3 below. A function is called s...

Improvement of light extraction efficiency of InGaN light emitting diodes (LEDs) using polydimethylsiloxane (PDMS) concave microstructures arrays was demonstrated. The size effect of the concave microstructures on the light extraction efficiency of III-Nitride LEDs was studied. Depending on the size of the concave microstructures, ray tracing simulations show that the use of PDMS concave micros...