The class of componentwise concave copulas is considered, with particular emphasis on its closure under some constructions of copulas (e. g., ordinal sum) and its relations with other classes of copulas characterized by some notions of concavity and/or convexity. Then, a sharp upper bound is given for the L ∞-measure of non-exchangeability for copulas belonging to this class.

We model agents’ preferences by cash-invariant concave functionals defined on L∞, and formulate the optimal risk allocation problem as their infimal-convolution. We study the case of agents whose choice functionals are law-invariant with respect to different probability measures and show how, in this case, the value function preserves a desirable dual representation (equivalent to the Fatou pro...

In this note we prove the non-existence of local smoothing in the sense of L 2 for oscillatory integrals with concave phase. We use integration by parts to control remainder terms and use the oscillation at innnity of Bessel functions to reduce the higher dimensional problem to the one-dimensional.

We consider the generalized Lorentz space L ;q dened via a continuous and concave function Fourier series of with respect to an unbounded orthonormal system. Some new Jackson-Nikol'skii type inequalities in this frame are stated, proved discussed. In particular, derived results generalize unify several well-known but also some applications pointed out.

A: Patient with little effort. Top: Volume Controlled Ventilation: airway pressure in cmH2O yellow, constant flow L/min pink. Middle: Pressure controlled ventilation: decelerating Bottom: Esophageal cmH2O. B: high convex negative deflection during trigger and first half of inspiration (blue arrow). the (yellow arrow) slight (green arrow), concave (orange Convex esophageal (grey

Complex surface structures have stimulated a great deal of interests due to many potential applications in surface devices. However, in the fabrication of complex surface micro-/nanostructures, there are always great challenges in precise design, or good controllability, or low cost, or high throughput. Here, we present a route for the accurate design and highly controllable fabrication of surf...

If E = {ei} and F = {fi} are two 1-unconditional basic sequences in L1 with E r-concave and F p-convex, for some 1 ≤ r < p ≤ 2, then the space of matrices {ai,j} with norm ∥{ai,j}∥E(F ) = ∥∥∑ k ∥ ∑ l ak,lfl∥ek ∥∥ embeds into L1. This generalizes a recent result of Prochno and Schütt.

We study the minimum concave cost flow problem over a two-dimensional grid network (CFG), where one dimension represents time periods and the other dimension represents echelons. The concave function over each arc is given by a value oracle. We give a characterization of the computational complexity of CFG based on the grid size (T periods and L echelons), the distribution of sources and sinks ...

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

Compare with traditional way of numerical simulation by establishing the mathematical model through geometry optic, we design a TracePro model to analyze the sensing process of reflective intensitymodulated fiber optic sensor base on ray tracing. This type of sensor has advantages over other fiber optic sensor, including simple structure, flexible design, reliable perform, low cost etc. In this...