Results Consequently, the imposed convex-wise, asymmetrically concentrated cyclical loads on the adjacent immature vertebral end plates and posterior elements of the spine lead to asymmetrical vertebral growth. More specifically the loading on the two facet-joins asymmetrically increases during the day, as the wedged disc space narrows due to expelled water and it asymmetrically decreases durin...

This paper addresses the problem of contact detection in discrete element multibody dynamic simulations. This paper presents an overview of the problem and a detail description of a new object representation scheme called the discrete function representation (DFR). This representation is designed to reduce the computational cost of both contact detection and the more diicult problem of contact ...

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...

Lasserre [32] proved that for every compact set K⊂Rn and even number d there exists a unique homogeneous polynomial g0 of degree with K⊂G1(g0)={x∈Rn:g0(x)≤1} minimizing |G1(g)| among all such polynomials g fulfilling the condition K⊂G1(g). This result extends notion Löwner ellipsoid, not only from convex bodies to arbitrary sets (which was immediate if d=2 by taking hulls), but also ellipsoids ...

Five disproportionate, short-limbed, short-trunked (dwarf) Great Pyrenees pups were examined. The mode of inheritance was compatible with a simple autosomal recessive trait, and skeletal radiography revealed flaring of the metaphyses of all long bones and the costochondral junctions of the ribs. Vertebral bodies were poorly ossified and short, and had a beak-like extension on the caudal metaphy...