-
1 булева система обозначений
Русско-английский научно-технический словарь Масловского > булева система обозначений
-
2 основы булевой алгебры
основы булевой алгебры
булева система обозначений
—
[Л.Г.Суменко. Англо-русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.]Тематики
Синонимы
EN
Русско-английский словарь нормативно-технической терминологии > основы булевой алгебры
-
3 булева запись
Mathematics: Boolean notation -
4 анализ дерева отказов (в информационных технологиях)
анализ дерева отказов
FTA
(ITIL Service Design)
(ITIL Continual Service Improvement)
Техника, которая может использоваться для определения цепочки событий, которые привели к инциденту. Анализ дерева отказов, используя Булеву нотацию, представляет цепь событий в виде диаграммы.
[Словарь терминов ITIL версия 1.0, 29 июля 2011 г.]EN
fault tree analysis
FTA
(ITIL Continual Service Improvement)
(ITIL Service Design)
A technique that can be used to determine a chain of events that has caused an incident, or may cause an incident in the future. Fault tree analysis represents a chain of events using Boolean notation in a diagram.
[Словарь терминов ITIL версия 1.0, 29 июля 2011 г.]Тематики
Синонимы
EN
Русско-английский словарь нормативно-технической терминологии > анализ дерева отказов (в информационных технологиях)
См. также в других словарях:
Boolean logic — is a complete system for logical operations. It was named after George Boole, who first defined an algebraic system of logic in the mid 19th century. Boolean logic has many applications in electronics, computer hardware and software, and is the… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Boolean — ► ADJECTIVE ▪ denoting a system of notation used to represent logical propositions by means of the binary digits 0 (false) and 1 (true), especially in computing and electronics. ORIGIN named after the English mathematician George Boole (1815 64) … English terms dictionary
Boolean ring — In mathematics, a Boolean ring R is a ring (with identity) for which x 2 = x for all x in R ; that is, R consists only of idempotent elements.Boolean rings are automatically commutative and of characteristic 2 (see below for proof). A Boolean… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
Notation hongroise — En programmation, la notation hongroise est une convention de nommage qui met en avant soit l usage d une variable, soit son type. Par exemple la variable booléenne danger est préfixée par un b pour indiquer un type booléen : bDanger. Autre… … Wikipédia en Français
Boolean — adj. denoting a system of algebraic notation to represent logical propositions. Phrases and idioms: Boolean logic the use of the logical operators and , or , and not in retrieving information from a computer database. Etymology: G. Boole, Engl.… … Useful english dictionary
Boolean — [ bu:lɪən] adjective denoting a system of algebraic notation used to represent logical propositions by means of the binary digits 0 (false) and 1 (true), especially in computing and electronics. noun Computing a binary variable with these… … English new terms dictionary
History of mathematical notation — Mathematical notation comprises the symbols used to write mathematical equations and formulas. It includes Hindu Arabic numerals, letters from the Roman, Greek, Hebrew, and German alphabets, and a host of symbols invented by mathematicians over… … Wikipedia
Hungarian notation — is a naming convention in computer programming, in which the name of a variable indicates its type or intended use. There are two types of Hungarian notation: Systems Hungarian notation and Apps Hungarian notation .Hungarian notation was designed … Wikipedia
Two-element Boolean algebra — In mathematics and abstract algebra, the two element Boolean algebra is the Boolean algebra whose underlying set (or universe or carrier ) B is the Boolean domain. The elements of the Boolean domain are 1 and 0 by convention, so that B ={0,1}.… … Wikipedia