- Packing unit
- Упаковочная секция.
Краткий толковый словарь по полиграфии. 2010.
Краткий толковый словарь по полиграфии. 2010.
Packing problem — Part of a series on Puzzles … Wikipedia
unit of account — The type or size of packing in which the goods are sold, for example packets of 20 cigarettes. HM Customs & Revenue Glossary * * * unit of account ˌunit of acˈcount noun units of account PLURALFORM [countable] 1. ACCOUNTING the unit of money used … Financial and business terms
Unit Load Device — A unit load device, or ULD, is a pallet or container used to load luggage, freight, and mail on wide body aircraft and specific narrow body aircraft. It allows a large quantity of cargo to be bundled into a large unit. Since this leads to fewer… … Wikipedia
packing density — Amount of storage area per unit length, unit area, or unit volume (e.g., number of bits per inch stored on magnetic tape) … IT glossary of terms, acronyms and abbreviations
packing density — noun Computing the density of stored information in terms of bits per unit occupied of its storage medium … English new terms dictionary
Circle packing in a circle — is a two dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Minimum solutions:[1] Number of unit circles Enclosing circle radius Density Optimality Diagram 1 1 1.0000 Trivially optimal … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Follicular unit transplantation — is a modern hair restoration technique where the hair is transplanted in groups of 1 4 hairs – exactly as it grows in nature. It is a major advance over the older hair transplantation procedures that used larger grafts and often produced a pluggy … Wikipedia
Circle packing in a square — is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square for the greatest minimal separation, dn, between points.[1] To… … Wikipedia
Close-packing of spheres — hcp and fcc close packing of spheres In geometry, close packing of spheres is a dense arrangement of equal spheres in an infinite, regular arrangement (or lattice). Carl Friedrich Gauss proved that the highest average density – that is, the… … Wikipedia