Перевод: с английского на все языки

со всех языков на английский

boolean+encoding

  • 1 Boolean encoding

    Сетевые технологии: булево кодирование

    Универсальный англо-русский словарь > Boolean encoding

  • 2 Boolean encoding

    English-Russian information technology > Boolean encoding

  • 3 Shannon, Claude Elwood

    [br]
    b. 30 April 1916 Gaylord, Michigan, USA
    [br]
    American mathematician, creator of information theory.
    [br]
    As a child, Shannon tinkered with radio kits and enjoyed solving puzzles, particularly crypto-graphic ones. He graduated from the University of Michigan in 1936 with a Bachelor of Science in mathematics and electrical engineering, and earned his Master's degree from the Massachusetts Institute of Technology (MIT) in 1937. His thesis on applying Boolean algebra to switching circuits has since been acclaimed as possibly the most significant this century. Shannon earned his PhD in mathematics from MIT in 1940 with a dissertation on the mathematics of genetic transmission.
    Shannon spent a year at the Institute for Advanced Study in Princeton, then in 1941 joined Bell Telephone Laboratories, where he began studying the relative efficiency of alternative transmission systems. Work on digital encryption systems during the Second World War led him to think that just as ciphers hide information from the enemy, "encoding" information could also protect it from noise. About 1948, he decided that the amount of information was best expressed quantitatively in a two-value number system, using only the digits 0 and 1. John Tukey, a Princeton colleague, named these units "binary digits" (or, for short, "bits"). Almost all digital computers and communications systems use such on-off, or two-state logic as their basis of operation.
    Also in the 1940s, building on the work of H. Nyquist and R.V.L. Hartley, Shannon proved that there was an upper limit to the amount of information that could be transmitted through a communications channel in a unit of time, which could be approached but never reached because real transmissions are subject to interference (noise). This was the beginning of information theory, which has been used by others in attempts to quantify many sciences and technologies, as well as subjects in the humanities, but with mixed results. Before 1970, when integrated circuits were developed, Shannon's theory was not the preferred circuit-and-transmission design tool it has since become.
    Shannon was also a pioneer in the field of artificial intelligence, claiming that computing machines could be used to manipulate symbols as well as do calculations. His 1953 paper on computers and automata proposed that digital computers were capable of tasks then thought exclusively the province of living organisms. In 1956 he left Bell Laboratories to join the MIT faculty as Professor of Communications Science.
    On the lighter side, Shannon has built many devices that play games, and in particular has made a scientific study of juggling.
    [br]
    Principal Honours and Distinctions
    National Medal of Science. Institute of Electrical and Electronics Engineers Medal of Honor, Kyoto Prize.
    Bibliography
    His seminal paper (on what has subsequently become known as information theory) was entitled "The mathematical theory of communications", first published in Bell System Technical Journal in 1948; it is also available in a monograph (written with Warren Weaver) published by the University of Illinois Press in 1949, and in Key Papers in the Development of Information Theory, ed. David Slepian, IEEE Press, 1974, 1988. For readers who want all of Shannon's works, see N.J.A.Sloane and A.D.Wyner, 1992, The
    Collected Papers of Claude E.Shannon.
    HO

    Biographical history of technology > Shannon, Claude Elwood

См. также в других словарях:

  • Encoding Control Notation — The Encoding Control Notation (ECN) is a standardized formal language that is part of the Abstract Syntax Notation One (ASN.1) family of international standards [cite web url=http://www.itu.int/rec/T REC X.680 200203 I/en title=ITU T Rec. X.680 / …   Wikipedia

  • Church encoding — In mathematics, Church encoding is a means of embedding data and operators into the lambda calculus, the most familiar form being the Church numerals, a representation of the natural numbers using lambda notation. The method is named for Alonzo… …   Wikipedia

  • Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… …   Wikipedia

  • Distinguished Encoding Rules — (DER), is a message transfer syntax specified by the ITU in X.690. The Distinguished Encoding Rules of ASN.1 is an International Standard drawn from the constraints placed on basic encoding rules (BER) encodings by X.509. DER encodings are valid… …   Wikipedia

  • Distinguished Encoding Rules — Die Abstract Syntax Notation One (ASN.1) ist eine Beschreibungssprache zur Definition von Datenstrukturen sowie Festlegungen zur Umsetzung von Datenstrukturen und Elementen in ein netzeinheitliches Format. Sie ist gemeinsamer Standard der ITU T… …   Deutsch Wikipedia

  • Chen–Ho encoding — Chen Ho encoding is an alternate system of binary encoding for decimal digits. The traditional system of binary encoding for decimal digits, known as Binary coded decimal (BCD), uses four bits to encode each digit, resulting in significant… …   Wikipedia

  • Chen-Ho encoding — is an alternate system of binary encoding for decimal digits.The traditional system of binary encoding for decimal digits, known as Binary coded decimal (BCD), uses four bits to encode each digit, resulting in significant wastage of binary data… …   Wikipedia

  • Mogensen–Scott encoding — In computer science, Scott encoding is a way to embed inductive datatypes in the lambda calculus. Mogensen–Scott encoding extends and slightly modifies this to an embedding of all terms of the untyped lambda calculus. Contents 1 Definition 1.1… …   Wikipedia

  • Mogensen-Scott encoding — In computer science, Scott encoding is a way to embed inductive datatypes in the lambda calculus. Mogensen Scott encoding extends and slightly modifies this to an embedding of all terms of the untyped lambda calculus.DefinitionLet D be a datatype …   Wikipedia

  • Uclid — (pronounced IPA|/ˈjuklɪd/, the same as Euclid ) is a decision procedure for CLU logic and can be used as a tool for bounded model checking of infinite state systems.Decision Procedure and Verification ToolUCLID is a tool for verifying models of… …   Wikipedia

  • Comparison of data serialization formats — This is a comparison of data serialization formats, different ways to convert complex objects to sequences of bits. It does not include markup languages used exclusively as document file formats. Contents 1 Overview 2 Syntax comparison of human… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
… Нажмите правой клавишей мыши и выберите «Копировать ссылку»