cyclic check

  • 71Циклическая проверка на чётность — Алгоритм вычисления контрольной суммы (англ. Cyclic redundancy code, CRC  циклический избыточный код)  способ цифровой идентификации некоторой последовательности данных, который заключается в вычислении контрольного значения её циклического… …

    Википедия

  • 72Циклическая проверка на четность — Алгоритм вычисления контрольной суммы (англ. Cyclic redundancy code, CRC  циклический избыточный код)  способ цифровой идентификации некоторой последовательности данных, который заключается в вычислении контрольного значения её циклического… …

    Википедия

  • 73Quotient group — In mathematics, given a group G and a normal subgroup N of G , the quotient group, or factor group, of G over N is intuitively a group that collapses the normal subgroup N to the identity element. The quotient group is written G / N and is… …

    Wikipedia

  • 74BCH code — In coding theory the BCH codes form a class of parameterised error correcting codes which have been the subject of much academic attention in the last fifty years. BCH codes were invented in 1959 by Hocquenghem, and independently in 1960 by Bose… …

    Wikipedia

  • 75Strength of materials — Internal force lines are denser near the hole, a common stress concentration In materials science, the strength of a material is its ability to withstand an applied stress without failure. The applied stress may be tensile, compressive, or shear …

    Wikipedia

  • 76climate change — Introduction  periodic modification of Earth s climate brought about as a result of changes in the atmosphere as well as interactions between the atmosphere and various other geologic, chemical, biological, and geographic factors within the Earth …

    Universalium

  • 77Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …

    Wikipedia

  • 78N-group (finite group theory) — In mathematical finite group theory, an N group is a group all of whose local subgroups (that is, the normalizers of nontrivial p subgroups) are solvable groups. The non solvable ones were classified by Thompson during his work on finding all the …

    Wikipedia

  • 79Database — A database is an organized collection of data for one or more purposes, usually in digital form. The data are typically organized to model relevant aspects of reality (for example, the availability of rooms in hotels), in a way that supports… …

    Wikipedia

  • 80Covering space — A covering map satisfies the local triviality condition. Intuitively, such maps locally project a stack of pancakes above an open region, U, onto U. In mathematics, more specifically algebraic topology, a covering map is a continuous surjective… …

    Wikipedia