-
21 check
проверка, контроль (см. тж test); сличение || проверять; контролировать; сличать- check against- check for instructions
- check on accuracy
- check the figures
- accounting check
- arithmetical check
- arithmetic check
- automatic check
- bias check
- block check
- bounds check
- brush-compare check
- built-in check
- bus-out check
- card check
- casting-out-nines check
- check by resubstitution
- compile-time check
- composition check
- consistency check
- continuity check
- control totals check
- copy check
- cross check
- current check
- cycle check
- cyclic check - data-type check
- desk check
- diagnostic check
- differencing check
- digit check
- divide check
- dump check
- duplicate-process check
- duplication check
- echo check
- error check
- even-old check
- even-parity check
- exceed capacity check
- false-code check
- flag check
- forbidden-combination check
- forbidden-digit check
- functional check
- hardware check
- high-low bias check
- hole count check
- horizontal check
- illegal-command check
- imparity check
- improper-command check
- inadmissible character check
- in-line check
- line-by-line check
- logical check
- longitudinal check
- loop check
- machine check
- marginal check
- mod N check
- module-parity check
- modulo N check
- naught check
- negative check
- nondestructive check
- nonexistence code check
- not-null check
- odd-even check
- odd-parity check
- overflow check
- page check
- parity check
- peek-a-boo check
- photocell light check
- postmortem check
- privacy check
- program check
- programmed check
- programming check
- punching check
- punch check
- range check
- read-after-write check
- read-back check
- reasonability check
- reasonableness check
- redundancy error check
- redundancy check
- redundant-data check
- redundant check
- residue check
- reversal check
- rights check
- routine check
- running check
- run-time check
- selection check
- sequence check
- sight check
- sign check
- spacing check
- static check
- sum check
- summation check
- system check
- testability check
- total check
- transfer check
- transverse check
- twin check
- type check
- unallowable code check
- validity check
- vertical check
- wired-in checkEnglish-Russian dictionary of computer science and programming > check
-
22 group
1) группа, ансамбль || групповой- roughing mill group2) совокупность; комплект3) группировка || группировать(ся)5) класс; категория || классифицировать; категоризировать6) хим. остаток7) сгусток; скопление8) узел9) матем. группа- absolute free group - absolute homotopy group - absolutely irreducible group - absolutely simple group - additively written group - adele group - adelic group - algebraically compact group - algebraically simple group - almost connected group - almost cyclic group - almost ordered group - almost periodic group - almost simple group - alternating form group - cancellative group - cellular homology group - characteristically simple group - complementing group - completely anisotropic group - completely discontinuous group - completely divisible group - completely indecomposable group - completely integrally closed group - deficient group - direct homology group - direct indecomposable group - doubly transitive group - finitely defined group - finitely generated group - finitely presented group - finitely related group - first homology group - first homotopy group - freely generated group - full linear group - full orthogonal group - full rotation group - full symmetric group - full unimodular group - group of classes of algebras - group of covering transformations - group of finite rank - group of infinite order - group of infinite rank - group of inner automorphisms - group of linear equivalence - group of linear forms - group of linear manifold - group of principal ideles - group of real line - group of recursive permutations - group of right quotients - idele class group - linearly ordered group - linearly transitive group - locally bicompact group - locally closed group - locally compact group - locally connected group - locally cyclic group - locally defined group - locally embeddable group - locally finite group - locally free group - locally infinite group - locally nilpotent group - locally normal group - locally solvable group - multiply primitive group - multiply transitive group - nonsolvable group - n-th homotopy group - ordered pair group - principal congruence group - properly orthogonal group - properly unimodular group - pure projective group - pure rotation group - pure simple group - quasipure projective group - quotient divisible group - residually nilpotent group - restricted holonomy group - sharply transitive group - simply ordered group - simply reducible group - simply transitive group - singular cogomology group - singular homology group - solvable group - stable group - strictly transitive group - strongly polycyclic group - subsolvable group - supersolvable group - totally ordered group - totally projective group - totally reducible group - triply transitive group - unitary symmetry group - unitary transformation group - value group - weak homology group - weakly mixing groupgroup with multiple operators — группа с многоместными операторами, мультиоператорная группа
-
23 sum
1) сумма; итог || суммировать, складывать; подводить итог3) резюмировать•sum over sum — мат. сумма вдоль подпространства
sum taken over — сумма, взятая по…
to sum up — резюмировать, суммировать
to sum with respect to — суммировать по...
- free sum- rank sum- regression sum of squares- risk sum- row sum- sum of squares for contrasts- unit sum
- 1
- 2
См. также в других словарях:
Modulo-N code — is a lossy compression algorithm used to compress correlated data sources using modulo arithmetic. Contents 1 Compression 2 Decompression 3 Example 3.1 See also … Wikipedia
Modulo operation — Quotient (red) and remainder (green) functions using different algorithms. In computing, the modulo operation finds the remainder of division of one number by another. Given two positive numbers, a (the dividend) and n (the divisor), a modulo n… … Wikipedia
Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… … Wikipedia
Modulo (jargon) — The word modulo (Latin, with respect to a modulus of ) is the Latin ablative of modulus which itself means a small measure. It was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801. Ever since,… … Wikipedia
Modulo — In the mathematical community, the word modulo is often used informally. Generally, to say A is the same as B modulo C means, more or less, A and B are the same except for differences accounted for or explained by C . In the various branches of… … Wikipedia
Arithmetic of abelian varieties — In mathematics, the arithmetic of abelian varieties is the study of the number theory of an abelian variety, or family of those. It goes back to the studies of Fermat on what are now recognised as elliptic curves; and has become a very… … Wikipedia
Modular arithmetic — In mathematics, modular arithmetic (sometimes called clock arithmetic) is a system of arithmetic for integers, where numbers wrap around after they reach a certain value the modulus. The Swiss mathematician Leonhard Euler pioneered the modern… … Wikipedia
modular arithmetic — arithmetic in which numbers that are congruent modulo a given number are treated as the same. Cf. congruence (def. 2), modulo, modulus (def. 2b). [1955 60] * * * sometimes referred to as modulus arithmetic or clock arithmetic in its… … Universalium
Finite field arithmetic — Arithmetic in a finite field is different from standard integer arithmetic. There are a limited number of elements in the finite field; all operations performed in the finite field result in an element within that field.While each finite field is … Wikipedia
Glossary of arithmetic and Diophantine geometry — This is a glossary of arithmetic and Diophantine geometry in mathematics, areas growing out of the traditional study of Diophantine equations to encompass large parts of number theory and algebraic geometry. Much of the theory is in the form of… … Wikipedia
Dirichlet's theorem on arithmetic progressions — In number theory, Dirichlet s theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n ≥ 0. In other… … Wikipedia