| podobné slovo | definícia |
research, development, test, and evaluation
(msas) | Research, Development, Test, and Evaluation
- RDT&E |
research, development, test, and evaluation
(msasasci) | Research, Development, Test, and Evaluation
- RDT&E |
competitive devaluation
(encz) | competitive devaluation, |
cost of revaluation of securities and derivatives
(encz) | cost of revaluation of securities and derivatives,náklady z přecenění
cenných papírů a derivátů [ekon.] výkaz zisku a ztrát=profit/loss
account Ivan Masár |
country evaluation system
(encz) | country evaluation system, |
devaluation
(encz) | devaluation,devalvace n: Pavel Machek; Gizadevaluation,znehodnocení n: RNDr. Pavel Piskač |
diferences from revaluation in tranformation of companies
(encz) | diferences from revaluation in tranformation of companies,oceňovací
rozdíly z přecenění při přeměnách [ekon.] rozvaha/balance sheet Ivan
Masár |
diferences from revaluation of assets and liabilities
(encz) | diferences from revaluation of assets and liabilities,oceňovací rozdíly
z přecenění majetku a závazků [ekon.] rozvaha/balance sheet Ivan Masár |
discrete devaluation
(encz) | discrete devaluation, |
environmental performance evaluation
(encz) | environmental performance evaluation,hodnocení environmentálního
profilu [eko.] RNDr. Pavel Piskač |
evaluation meth. of pestic. toxic. with group of individuals
(encz) | evaluation meth. of pestic. toxic. with group of individuals,metoda
hodnocení toxicity pesticidu na souboru jedinců [eko.] RNDr. Pavel
Piskač |
evaluation method of pesticide toxicity
(encz) | evaluation method of pesticide toxicity,metoda hodnocení toxicity
pesticidu [eko.] RNDr. Pavel Piskač |
evaluation method of pesticide toxicity with individual
(encz) | evaluation method of pesticide toxicity with individual,metoda hodnocení
toxicity pesticidu na jedinci [eko.] RNDr. Pavel Piskač |
evaluation office
(encz) | Evaluation Office, |
evaluations
(encz) | evaluations,evakuace pl. Zdeněk Broževaluations,odsuny n: pl. Zdeněk Brož |
exposure evaluation
(encz) | exposure evaluation,vyhodnocení expozice [eko.] Složka hodnocení rizika
sestávající z charakteristiky dané skupiny populace a velikosti
expoziční dávky (koncentrace), a frekvence resp. trvání expozice. Může
se zabývat expozicí již skončenou, trvající, či předpokládanou v delším
časovém úseku. RNDr. Pavel Piskač |
land evaluation
(encz) | land evaluation,bonitace půdy [eko.] RNDr. Pavel Piskač |
overt devaluation
(encz) | overt devaluation, |
performance evaluation
(encz) | performance evaluation, |
pesticide evaluation test object
(encz) | pesticide evaluation test object,testovací objekt k hodnocení
pesticidu [eko.] RNDr. Pavel Piskač |
re-evaluation
(encz) | re-evaluation,přehodnocení n: Zdeněk Brož |
reevaluation
(encz) | reevaluation,přehodnocení n: Zdeněk Brož |
revaluation
(encz) | revaluation,přehodnocení n: Zdeněk Brožrevaluation,revalvace Mgr. Dita Gálová |
revaluation changes
(encz) | revaluation changes, |
revaluation counterpart
(encz) | revaluation counterpart, |
revenues from revaluation of securities and derivatives
(encz) | revenues from revaluation of securities and derivatives,výnosy z
přecenění cenných papírů a derivátů [ekon.] výkaz zisku a
ztrát=profit/loss account Ivan Masár |
step devaluation
(encz) | step devaluation, |
underevaluation
(encz) | underevaluation, n: |
blade life analysis and design evaluation for gas turbines
(czen) | Blade Life Analysis and Design Evaluation for Gas
Turbines,BLADE-GT[zkr.] [voj.] Zdeněk Brož a automatický překlad |
modular algorithm concept evaluation tool
(czen) | Modular Algorithm Concept Evaluation Tool,MACET[zkr.] [voj.] Zdeněk
Brož a automatický překlad |
navigational test and evaluation laboratory
(czen) | Navigational Test and Evaluation Laboratory,NavTEL[zkr.] [voj.] Zdeněk
Brož a automatický překlad |
non-destructive evaluation
(czen) | Non-Destructive Evaluation,NDE[zkr.] [voj.] Zdeněk Brož a automatický
překlad |
non-destructive inspection/evaluation
(czen) | Non-Destructive Inspection/Evaluation,NDI/E[zkr.] [voj.] Zdeněk Brož a
automatický překlad |
operational test and evaluation
(czen) | Operational Test and Evaluation,OT&E[zkr.] [voj.] Zdeněk Brož a
automatický překlad |
program assessment and evaluation
(czen) | Program Assessment and Evaluation,PA&E[zkr.] [voj.] Zdeněk Brož a
automatický překlad |
test and evaluation
(czen) | Test and Evaluation,T&E[zkr.] [voj.] Zdeněk Brož a automatický překlad |
Evaluation
(gcide) | Evaluation \E*val`u*a"tion\, n. [Cf. F. ['e]valuation, LL.
evaluatio.]
Valuation; appraisement. --J. S. Mill.
[1913 Webster] |
Revaluation
(gcide) | Revaluation \Re*val`u*a"tion\, n.
A second or new valuation.
[1913 Webster] |
devaluation
(wn) | devaluation
n 1: an official lowering of a nation's currency; a decrease in
the value of a country's currency relative to that of
foreign countries
2: the reduction of something's value or worth |
reevaluation
(wn) | reevaluation
n 1: the evaluation of something a second time (or more) |
revaluation
(wn) | revaluation
n 1: a new appraisal or evaluation [syn: reappraisal,
revaluation, review, reassessment] |
underevaluation
(wn) | underevaluation
n 1: an appraisal that underestimates the value of something |
conservative evaluation
(foldoc) | conservative evaluation
Under this parallel evaluation strategy, no
evaluation is started unless it is known to be needed. The
opposite of conservative evaluation is speculative evaluation.
(2014-06-21)
|
developmental test and evaluation
(foldoc) | Developmental Test and Evaluation
DT&E
(DT&E) Activity which focuses on the
technological and engineering aspects of a system or piece of
equipment.
(1996-05-13)
|
eager evaluation
(foldoc) | eager evaluation
Any evaluation strategy where evaluation of some or all
function arguments is started before their value is required.
A typical example is call-by-value, where all arguments are
passed evaluated. The opposite of eager evaluation is
call-by-need where evaluation of an argument is only started
when it is required.
The term "speculative evaluation" is very close in meaning
to eager evaluation but is applied mostly to parallel
architectures whereas eager evaluation is used of both
sequential and parallel evaluators.
Eager evaluation does not specify exactly when argument
evaluation takes place - it might be done fully speculatively
(all redexes in the program reduced in parallel) or may be
done by the caller just before the function is entered.
The term "eager evaluation" was invented by Carl Hewitt and
Henry Baker and used in their paper ["The
Incremental Garbage Collection of Processes", Sigplan Notices,
Aug 1977.
(ftp://ftp.netcom.com/pub/hb/hbaker/Futures.html)]. It was
named after their "eager beaver" evaluator.
See also conservative evaluation, lenient evaluation,
strict evaluation.
(1994-12-22)
|
evaluation strategy
(foldoc) | reduction strategy
evaluation strategy
An algorithm for deciding which redex(es) to
reduce next. Different strategies have different termination
properties in the presence of recursive functions or values.
See string reduction, normal order reduction, {applicative
order reduction}, parallel reduction
(1995-05-09)
|
initial operational test and evaluation
(foldoc) | Initial Operational Test and Evaluation
IOT&E
(IOT&E) The first phase of operational test and
evaluation conducted on pre-protectional items,
prototypes, or pilot production items and normally completed
prior to the first major production decision. Conducted to
provide a valid estimate of expected system operational
effectiveness and suitability.
(1996-12-27)
|
lazy evaluation
(foldoc) | lazy evaluation
laziness
An evaluation strategy combining {normal order
evaluation} with updating. Under normal order evaluation
(outermost or call-by-name evaluation) an expression is
evaluated only when its value is needed in order for the
program to return (the next part of) its result. Updating
means that if an expression's value is needed more than once
(i.e. it is shared), the result of the first evaluation is
remembered and subsequent requests for it will return the
remembered value immediately without further evaluation. This
is often implemented by graph reduction. An unevaluated
expression is represented as a closure - a data structure
containing all the information required to evaluate the
expression.
Lazy evaluation is one evaluation strategy used to implement
non-strict functions. Function arguments may be infinite
data structures (especially lists) of values, the components
of which are evaluated as needed.
According to Phil Wadler the term was invented by Jim Morris.
Opposite: eager evaluation.
A partial kind of lazy evaluation implements lazy data
structures or especially lazy lists where function arguments
are passed evaluated but the arguments of data constructors
are not evaluated.
Full laziness is a program transformation which aims to
optimise lazy evaluation by ensuring that all subexpressions
in a function body which do not depend on the function's
arguments are only evaluated once.
(1994-12-14)
|
lenient evaluation
(foldoc) | lenient evaluation
An evaluation strategy, described in [Traub,
FPCA 89], under which all redexes are evaluated in parallel
except inside the arms of conditionals and inside {lambda
abstractions}. Lenient evaluation is an example of an eager
evaluation strategy.
(2004-01-22)
|
operational test and evaluation
(foldoc) | operational test and evaluation
OT&E
(OT&E) Formal testing conducted prior to deployment
to evaluate the operational effectiveness and suitability of
the system with respect to its mission.
(1997-01-07)
|
partial evaluation
(foldoc) | partial evaluation
(Or "specialisation") An optimisation
technique where the compiler evaluates some subexpressions
at compile-time. For example,
pow x 0 = 1
pow x n = if even n
then pxn2 * pxn2
else x * pow x (n-1)
where pxn2 = pow x (n/2)
f x = pow x 5
Since n is known we can specialise pow in its second argument
and unfold the recursive calls:
pow5 x = x * x4 where x4 = x2 * x2
x2 = x * x
f x = pow5 x
pow5 is known as the residual. We could now also unfold pow5
giving:
f x = x * x4 where x4 = x2 * x2
x2 = x * x
It is important that the partial evaluation algorithm should
terminate. This is not guaranteed in the presence of
recursive function definitions. For example, if partial
evaluation were applied to the right hand side of the second
clause for pow above, it would never terminate because the
value of n is not known.
Partial evaluation might change the termination properties of
the program if, for example, the expression (x * 0) was
reduced to 0 it would terminate even if x (and thus x * 0) did
not.
It may be necessary to reorder an expression to partially
evaluate it, e.g.
f x y = (x + y) + 1
g z = f 3 z
If we rewrite f:
f x y = (x + 1) + y
then the expression x+1 becomes a constant for the function g
and we can say
g z = f 3 z = (3 + 1) + z = 4 + z
Partial evaluation of built-in functions applied to constant
arguments is known as constant folding.
See also full laziness.
(1999-05-25)
|
program evaluation and review technique
(foldoc) | Program Evaluation and Review Technique
PERT
(PERT) A method used to size a software product
and calculate the Standard Deviation (SD) for risk assessment.
The PERT equation (beta distribution) estimates the Equivalent
Delivered Source Instructions (EDSIs) and the SD based on
the analyst's estimates of the lowest possible size, the most
likely size, and the highest possible size of each computer
program component (CPC).
(1996-05-29)
|
speculative evaluation
(foldoc) | speculative evaluation
A technique used in parallel processing where
some evaluation may be started before it is known whether it
is needed (Eager evaluation). This may result in some wasted
processing and may introduce unnecessary non-terminating
processes but it can reduce the overall run time by making
some needed results available earlier than they would be
otherwise.
Opposite: conservative evaluation.
(1995-05-05)
|
strict evaluation
(foldoc) | strict evaluation
Call-by-value evaluation order is sometimes called "strict
evaluation" because, in a sequential system, it makes
functions behave as though they were strict, in the sense
that evaluation of a function application cannot terminate
before evaluation of the argument. Similarly, languages are
called strict if they use call-by-value argument passing.
Compare eager evaluation, lazy evaluation.
(1994-12-21)
|