-
1 pulse
12 nCOMP&DP, ELEC impulso mELECTRON impulso m, pulso m, impulso electrónico de microsegundos mFOOD legumbre fOPT, PHYS pulso mSPACE communications alteración en el valor de una variable f, impulso m, vibración f, ritmo m, señal de duración muy corta f, impulso electrónico de microsegundos mTV pulso mWAVE PHYS pulso m, impulso m, vibración f, emisión f3
См. также в других словарях:
Counting sort — In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an integer sorting algorithm. It operates by counting the number of objects that have each distinct… … Wikipedia
Counting-out game — A counting out game is a simple game intended to select a person to be it , often for the purpose of playing another game. These games usually require no materials, and are played with spoken words or hand gestures. Many such games involve one… … Wikipedia
Sequence space — In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers. Equivalently, it is a function space whose elements are functions from the natural… … Wikipedia
Prime-counting function — In mathematics, the prime counting function is the function counting the number of prime numbers less than or equal to some real number x cite book |first=Eric |last=Bach |coauthors=Shallit, Jeffrey |year=1996 |title=Algorithmic Number Theory… … Wikipedia
Rainflow-counting algorithm — The rainflow counting algorithm (also known as the rain flow counting method ) is used in the analysis of fatigue data in order to reduce a spectrum of varying stress into a set of simple stress reversals. Its importance is that it allows the… … Wikipedia
Double counting (proof technique) — In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which… … Wikipedia
Constraint counting — In mathematics, constraint counting is a crude but often useful way of counting the number of free functions needed to specify a solution to a partial differential equation. Contents 1 Einstein strength 1.1 Linear equations 1.2 General solution… … Wikipedia
Thue–Morse sequence — See also: Prouhet–Thue–Morse constant 5 logical matrices that give the beginning of the T. M. sequence, when read line by line Either in set A (vertical index) … Wikipedia
De Bruijn sequence — A diagram showing the De Bruijn sequence where k=2 and n=2 In combinatorial mathematics, a k ary De Bruijn sequence B(k, n) of order n, named after the Dutch mathematician Nicolaas Govert de Bruijn, is a cyclic sequence of a given alphabet A … Wikipedia
Look-and-say sequence — The lines show the growth of the numbers of digits in the look and say sequences with starting points 23 (red), 1 (blue), 13 (violet), 312 (green). These lines (when represented in a logarithmic scale) tend to straight lines whose slopes coincide … Wikipedia
Consensus sequence — In molecular biology and bioinformatics, consensus sequence refers to the most common nucleotide or amino acid at a particular position after multiple sequences are aligned. A consensus sequence is a way of representing the results of a multiple… … Wikipedia