| slovo | definícia |
redundancy
(encz) | redundancy,nadbytečnost n: IvČa |
redundancy
(encz) | redundancy,nadbytek n: Zdeněk Brož |
redundancy
(encz) | redundancy,propouštění n: jak168 |
Redundancy
(gcide) | Redundance \Re*dun"dance\ (r?*d?n"dans), Redundancy
\Re*dun"dan*cy\ (-dan*s?), n. [L. redundantia: cf. F.
redondance.]
[1913 Webster]
1. The quality or state of being redundant; superfluity;
superabundance; excess.
[1913 Webster]
2. That which is redundant or in excess; anything superfluous
or superabundant.
[1913 Webster]
Labor . . . throws off redundacies. --Addison.
[1913 Webster]
3. (Law) Surplusage inserted in a pleading which may be
rejected by the court without impairing the validity of
what remains.
[1913 Webster] |
redundancy
(wn) | redundancy
n 1: repetition of messages to reduce the probability of errors
in transmission
2: the attribute of being superfluous and unneeded; "the use of
industrial robots created redundancy among workers" [syn:
redundancy, redundance]
3: (electronics) a system design that duplicates components to
provide alternatives in case one component fails
4: repetition of an act needlessly |
redundancy
(foldoc) | redundancy
1. The provision of multiple
interchangeable components to perform a single function in
order to provide resilience (to cope with failures and
errors). Redundancy normally applies primarily to hardware.
For example, a cluster may contain two or three computers
doing the same job. They could all be active all the time
thus giving extra performance through parallel processing
and load balancing; one could be active and the others
simply monitoring its activity so as to be ready to take over
if it failed ("warm standby"); the "spares" could be kept
turned off and only switched on when needed ("cold standby").
Another common form of hardware redundancy is {disk
mirroring}.
2. data redundancy.
(1995-05-09)
|
REDUNDANCY
(bouvier) | REDUNDANCY. Matter introduced in an answer, or pleading, which is foreign to
the bill or articles.
2. In the case of Dysart v. Dysart, 3 Curt. Ecc. R. 543, in giving the
judgment of the court, Dr. Lushington says: "It may not, perhaps, be easy to
define the meaning of this term [redundant] in a short sentence, but the
true meaning I take to be this: the respondent is not to insert in his
answer any matter foreign to the articles he is called upon to answer,
although such matter may be admissible in a plea; but he may, in his answer,
plead matter by way of explanation pertinent to the articles, even if such
matter shall be solely in his own knowledge and to such extent incapable of
proof; or he may state matter which can be substantiated by witnesses; but
in this latter instance, if such matter be introduced into the answer and
not afterwards put in the plea or proved, the court will give no weight or
credence to such part of the answer."
3. A material distinction is to be observed between redundancy in the
allegation and redundancy in the proof. In the former case, a variance
between the allegation and the proof will be fatal if the redundant
allegations are descriptive of that which is essential. But in the latter
case, redundancy cannot vitiate, because more is proved than is alleged,
unless the matter superfluously proved goes to contradict some essential
part of the allegation. 1 Greenl. Ev. Sec. 67; 1 Stark. Ev. 401.
|
| | podobné slovo | definícia |
compulsory redundancy
(encz) | compulsory redundancy,vynucené ukončení pracovního poměru jak168 |
cyclic redundancy check
(encz) | cyclic redundancy check, n: |
Redundancy
(gcide) | Redundance \Re*dun"dance\ (r?*d?n"dans), Redundancy
\Re*dun"dan*cy\ (-dan*s?), n. [L. redundantia: cf. F.
redondance.]
[1913 Webster]
1. The quality or state of being redundant; superfluity;
superabundance; excess.
[1913 Webster]
2. That which is redundant or in excess; anything superfluous
or superabundant.
[1913 Webster]
Labor . . . throws off redundacies. --Addison.
[1913 Webster]
3. (Law) Surplusage inserted in a pleading which may be
rejected by the court without impairing the validity of
what remains.
[1913 Webster] |
cyclic redundancy check
(wn) | cyclic redundancy check
n 1: an error correction code that is recorded in each sector of
a magnetic disk and used to catch errors in the data |
redundancy check
(wn) | redundancy check
n 1: a system of checking for errors in computer functioning
[syn: parity check, redundancy check, odd-even check] |
block redundancy check
(foldoc) | Longitudinal Redundancy Check
Block Redundancy Check
LRC
(LRC, Block Redundancy Check) An
error checking method that generates a longitudinal parity
byte from a specified string or block of bytes on a
longitudinal track.
The longitudinal parity byte is created by placing individual
bytes of a string in a two-dimensional array and performing
a Vertical Redundancy Check vertically and horizontally on
the array, creating an extra byte. This is an improvement
over the VRC because it will catch two errors in the
individual characters of the string, beyond the odd errors.
(2004-01-26)
|
cyclic redundancy check
(foldoc) | cyclic redundancy check
CRC
cyclic redundancy code
(CRC or "cyclic redundancy code") A number derived
from, and stored or transmitted with, a block of data in order
to detect corruption. By recalculating the CRC and comparing
it to the value originally transmitted, the receiver can
detect some types of transmission errors.
A CRC is more complicated than a checksum. It is calculated
using division either using shifts and exclusive ORs or
table lookup (modulo 256 or 65536).
The CRC is "redundant" in that it adds no information. A
single corrupted bit in the data will result in a one bit
change in the calculated CRC but multiple corrupted bits may
cancel each other out.
CRCs treat blocks of input bits as coefficient-sets for
polynomials. E.g., binary 10100000 implies the polynomial:
1*x^7 + 0*x^6 + 1*x^5 + 0*x^4 + 0*x^3 + 0*x^2 + 0*x^1 + 0*x^0.
This is the "message polynomial". A second polynomial, with
constant coefficients, is called the "generator polynomial".
This is divided into the message polynomial, giving a quotient
and remainder. The coefficients of the remainder form the
bits of the final CRC. So, an order-33 generator polynomial
is necessary to generate a 32-bit CRC. The exact bit-set used
for the generator polynomial will naturally affect the CRC
that is computed.
Most CRC implementations seem to operate 8 bits at a time by
building a table of 256 entries, representing all 256 possible
8-bit byte combinations, and determining the effect that each
byte will have. CRCs are then computed using an input byte to
select a 16- or 32-bit value from the table. This value is
then used to update the CRC.
Ethernet packets have a 32-bit CRC. Many disk formats
include a CRC at some level.
(1997-08-02)
|
cyclic redundancy code
(foldoc) | cyclic redundancy check
CRC
cyclic redundancy code
(CRC or "cyclic redundancy code") A number derived
from, and stored or transmitted with, a block of data in order
to detect corruption. By recalculating the CRC and comparing
it to the value originally transmitted, the receiver can
detect some types of transmission errors.
A CRC is more complicated than a checksum. It is calculated
using division either using shifts and exclusive ORs or
table lookup (modulo 256 or 65536).
The CRC is "redundant" in that it adds no information. A
single corrupted bit in the data will result in a one bit
change in the calculated CRC but multiple corrupted bits may
cancel each other out.
CRCs treat blocks of input bits as coefficient-sets for
polynomials. E.g., binary 10100000 implies the polynomial:
1*x^7 + 0*x^6 + 1*x^5 + 0*x^4 + 0*x^3 + 0*x^2 + 0*x^1 + 0*x^0.
This is the "message polynomial". A second polynomial, with
constant coefficients, is called the "generator polynomial".
This is divided into the message polynomial, giving a quotient
and remainder. The coefficients of the remainder form the
bits of the final CRC. So, an order-33 generator polynomial
is necessary to generate a 32-bit CRC. The exact bit-set used
for the generator polynomial will naturally affect the CRC
that is computed.
Most CRC implementations seem to operate 8 bits at a time by
building a table of 256 entries, representing all 256 possible
8-bit byte combinations, and determining the effect that each
byte will have. CRCs are then computed using an input byte to
select a 16- or 32-bit value from the table. This value is
then used to update the CRC.
Ethernet packets have a 32-bit CRC. Many disk formats
include a CRC at some level.
(1997-08-02)
|
data redundancy
(foldoc) | data redundancy
Any technique that stores or
transmits extra, derived data that can be used to detect or
repair errors, either in hardware or software. Examples are
parity bits and the cyclic redundancy check.
If the cost of errors is high enough, e.g. in a
safety-critical system, redundancy may be used in both
hardware AND software with three separate computers programmed
by three separate teams ("triple redundancy") and some system
to check that they all produce the same answer, or some kind
of majority voting system.
The term is not typically used for other, less beneficial,
duplication of data.
2. The proportion of a message's gross
information content that can be eliminated without losing
essential information.
Technically, redundancy is one minus the ratio of the actual
uncertainty to the maximum uncertainty. This is the fraction
of the structure of the message which is determined not by the
choice of the sender, but rather by the accepted statistical
rules governing the choice of the symbols in question.
[Shannon and Weaver, 1948, p. l3]
(2010-02-04)
|
longitudinal redundancy check
(foldoc) | Longitudinal Redundancy Check
Block Redundancy Check
LRC
(LRC, Block Redundancy Check) An
error checking method that generates a longitudinal parity
byte from a specified string or block of bytes on a
longitudinal track.
The longitudinal parity byte is created by placing individual
bytes of a string in a two-dimensional array and performing
a Vertical Redundancy Check vertically and horizontally on
the array, creating an extra byte. This is an improvement
over the VRC because it will catch two errors in the
individual characters of the string, beyond the odd errors.
(2004-01-26)
|
vertical redundancy check
(foldoc) | Vertical Redundancy Check
VRC
(VRC) An error checking method
performed on one 8-bit ASCII character, where the 8th bit is
used as the parity bit.
The resulting parity bit is constructed by XORing the
word. The result is a "1" if there is an odd number of 1s,
and a "0" if there is an even number of 1s in the word. This
method is unreliable because if an odd number of bits are
distorted, the check will not detect the error. The
Longitudinal Redundancy Check is an improvement.
(2001-04-28)
|
REDUNDANCY
(bouvier) | REDUNDANCY. Matter introduced in an answer, or pleading, which is foreign to
the bill or articles.
2. In the case of Dysart v. Dysart, 3 Curt. Ecc. R. 543, in giving the
judgment of the court, Dr. Lushington says: "It may not, perhaps, be easy to
define the meaning of this term [redundant] in a short sentence, but the
true meaning I take to be this: the respondent is not to insert in his
answer any matter foreign to the articles he is called upon to answer,
although such matter may be admissible in a plea; but he may, in his answer,
plead matter by way of explanation pertinent to the articles, even if such
matter shall be solely in his own knowledge and to such extent incapable of
proof; or he may state matter which can be substantiated by witnesses; but
in this latter instance, if such matter be introduced into the answer and
not afterwards put in the plea or proved, the court will give no weight or
credence to such part of the answer."
3. A material distinction is to be observed between redundancy in the
allegation and redundancy in the proof. In the former case, a variance
between the allegation and the proof will be fatal if the redundant
allegations are descriptive of that which is essential. But in the latter
case, redundancy cannot vitiate, because more is proved than is alleged,
unless the matter superfluously proved goes to contradict some essential
part of the allegation. 1 Greenl. Ev. Sec. 67; 1 Stark. Ev. 401.
|
|