Examples of using Intermediate values in English and their translations into Russian
{-}
-
Official
-
Colloquial
Displays for intermediate values 11 Main display.
On the other hand, the high bit depth LUT can use additional intermediate values.
In addition, all intermediate values are displayed as well.
In the tables reproduced in Articles 15a.07 to 15a.12 and 15a.14,possible intermediate values shall be interpolated.
Furthermore, intermediate values are introduced, such as.
Therefore when inserted into an algorithm, go continually in error,due to the recursion and intermediate values that differ.
Other markings show intermediate values of 6, 10 and 14 kg.
For intermediate values, the preview size is 2 and 4 times smaller than the original image.
Specifies a function to define how intermediate values for properties are computed.
For intermediate values of thickness in the interval between 3 mm and 6 mm the height of drop shall be interpolated.
A- 6.8 In the tables reproduced in sections 15a- 7to 15a- 12 and 15a- 14, possible intermediate values shall be interpolated.
Intermediate values of rev/stroke are rounded up to the next incremental value e.g. for 30 rev/ stroke, the incremental value 36 has to be set.
The fragments with smaller x/y values can have a wide variety of y/z values and can be box-like(when theyhave smaller y/z values), needle-shaped(when they have larger y/z values) and plate-like when they have intermediate values of y/z.
As we shall see,the solution for intermediate values of λ behaves as a superposition of screened(or damped) 1/r functions, with λ behaving as the strength of the screening.
For CFV flow-meters only, CfCFV is derived from the following table based on values for β(ratio of venturi throat to inlet diameters) and γ(ratio of specific heats of the gas mixture),using linear interpolation to find intermediate values.
Intermediate values of rev/stroke or travel(mm) or degrees are rounded up to the next incremental value e.g. for 30 rev/stroke, the incremental value 36 has to be set.
Differential power analysis(DPA) is a more advancedform of power analysis, which can allow an attacker to compute the intermediate values within cryptographic computations through statistical analysis of data collected from multiple cryptographic operations.
To handle strings or other types of variable-length keys,it is possible to compose a simpler universal hashing technique that maps the keys to intermediate values and a higher quality(5-independent or tabulation) hash function that maps the intermediate values to hash table indices.
In a MITM attack, the keybits K 1{\displaystyle K_{1}} and K 2{\displaystyle K_{2}}, belonging to the first and second subcipher, need to be independent; that is, they need to be independent of each other,else the matched intermediate values for the plain- and ciphertext cannot be computed independently in the MITM attack there are variants of MITM attacks, where the blocks can have shared key-bits.
It is reminiscent of the intermediate value theorem for continuous functions.
A setting of 0 prevents rotation, a setting of 10 authorizes it, and an intermediate value indicates a preference for/against rotation.
A model is first fitted to the data to estimate an intermediate value of the variable to be matched.
The aliased edge simply rounds up or down with no intermediate value, whereas the anti-aliased edge gives a value proportional to how much of the edge was within each pixel.
This has the advantage of only using integers for each intermediate value, thus making the use of floating point representations of large numbers unnecessary.
A value of 0 makes rotation impossible,10 allows it completely, and any intermediate value represents a limited rotation.
Then a distance function is used to locate a range of possible observations from the donor set which most closely resembles the intermediate value, with a value for imputation selected from that set.
The De Bruijn-Erdős theorem may also be used to answer a question of Fred Galvin concerning an intermediate value theorem for graph chromatic numbers: for every two finite numbers j< k, and every graph G with chromatic number k, there is a subgraph of G with chromatic number j.