Results 271 to 280 of about 310,826 (318)

Generalized Legendre Transforms Have Roots in Information Geometry. [PDF]

Entropy (Basel)
Nielsen F.
europepmc   +1 more source

Explaining the universality of biological thermal responses. [PDF]

Proc Natl Acad Sci U S A
Arroyo JI, Kempes C, West G, Marquet PA.
europepmc   +1 more source

Successful Mediastinal Cryobiopsy Using the Slim UCP190F EBUS Bronchoscope and a 25G Needle: Demonstrating the Efficacy of the Ariza-Pallares Approach. [PDF]

Respirol Case Rep
Onyancha S, Rohde G.
europepmc   +1 more source

mTOR signalling mediates the spinal osteoblast pathotype at the curve apex in adolescent idiopathic scoliosis

Northall EH, Nicholson TA, Hazeldine J, Grover LM, McGettrick HM, Ede MN, Naylor AJ, Jones SW.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Convex and anti-convex languages

International Journal of Computer Mathematics, 1998
We define here the counterpart of Jensen convex and anti-convex sets of real numbers for the case of languages. We investigate the existence of languages consisting only of strings in which a set of symbols is convex or anti-convex, as well as the place of such languages in Chomsky hierarchy. Local convexity is also briefly investigated.
Jürgen Dassow, Solomon Marcus, Gheorghe Paun   +2 more
openaire   +1 more source

A Convexity Inequality

The American Mathematical Monthly, 2002
(2002). A Convexity Inequality. The American Mathematical Monthly: Vol. 109, No. 1, pp. 64-70.
ROSELLI, PAOLO, Willem, M.
openaire   +4 more sources

Convex approximation to convex data [PDF]

, 1990
Summary: In the present paper we consider a problem of convexity (or concavity) preserving approximation of plane convex (or concave) data by use of simple rational splines of continuity class \(C^ 2\).
TOGASHI, Akira, SAKAI, Manabu
openaire   +1 more source

Digital Convexity, Straightness, and Convex Polygons

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1982
New schemes for digitizing regions and arcs are introduced. It is then shown that under these schemes, Sklansky's definition of digital convexity is equivalent to other definitions. Digital convex polygons of n vertices are defined and characterized in terms of geometric properties of digital line segments.
openaire   +3 more sources