concave function
101Carpus — For other uses, see Carpus (disambiguation). Bone: Carpals BONES OF (right) HAND Proximal: A=Scaphoid, B=Lunate, C=Triquetrum, D=Pisiform Distal: E=Trapezium, F=Trapezoid, G=Capitate, H …
102Kite (geometry) — Kite A kite showing its equal sides and its inscribed circle. Type Quadrilateral Edges and vertices 4 Symmetry group D1 (*) In Euclid …
103Production-possibility frontier — In economics, a production possibility frontier (PPF) or “transformation curve” is a graph that shows the different rates of production of two goods that an economy (or agent) could efficiently produce with limited productive resources. Points… …
104Corannulene — IUPAC name …
105microscope — /muy kreuh skohp /, n. 1. an optical instrument having a magnifying lens or a combination of lenses for inspecting objects too small to be seen or too small to be seen distinctly and in detail by the unaided eye. 2. (cap.) Astron. the… …
106art and architecture, Oceanic — ▪ visual arts Introduction the visual art (art) and architecture of native Oceania, including media such as sculpture, pottery, rock art, basketry, masks, painting, and personal decoration. In these cultures, art and architecture have often …
107Life Sciences — ▪ 2009 Introduction Zoology In 2008 several zoological studies provided new insights into how species life history traits (such as the timing of reproduction or the length of life of adult individuals) are derived in part as responses to… …
108Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… …
109Quadrilateral — This article is about four sided mathematical shapes. For other uses, see Quadrilateral (disambiguation). Quadrilateral Six different types of quadrilaterals Edges and vertices 4 …
110Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …
