-
21 информация
ж. information; data, intelligenceвыдавать информацию в виде … — display information as …
передавать информацию — transmit information; transfer information
представлять информацию — present information ; display information
Синонимический ряд:сообщение (сущ.) извещение; оповещение; сообщение; уведомление -
22 клавиатура
ж. вчт. keyboardввод с клавиатуры, клавиатурный ввод — direct keyboard input
-
23 кодирующее устройство
1. code device2. coding device3. encipherer4. cipherer5. coderкод устройства; адрес устройства — device code
6. encoder7. encoding deviceРусско-английский большой базовый словарь > кодирующее устройство
-
24 символ
1. cipher2. token3. emblem4. digit5. icon6. letter7. sign8. symbolic unit9. badge10. char11. character12. symbolsсимвол входа; имя входа — entry symbol
13. trappings14. symbol -
25 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 DistinctionsNational Medal of Science. Institute of Electrical and Electronics Engineers Medal of Honor, Kyoto Prize.BibliographyHis 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, TheCollected Papers of Claude E.Shannon.HO -
26 принципиальная схема
1. key diagram[lang name="Russian"]алгоритмическая схема; схема алгоритма — algorithmic diagram
2. schematic diagram3. elementary diagram[lang name="Russian"]схематическая диаграмма ; общая схема — skeleton diagram
[lang name="Russian"]схема соединений; коммутационная схема — cording diagram
-
27 прекурсор
- 1
- 2
См. также в других словарях:
Binary decision diagram — In the field of computer science, a binary decision diagram (BDD) or branching program, like a negation normal form (NNF) or a propositional directed acyclic graph (PDAG), is a data structure that is used to represent a Boolean function. On a… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Binary form — This article is about the musical form. For other uses, see Binary form (disambiguation). Binary form is a musical form in two related sections, both of which are usually repeated. Binary is also a structure used to choreograph dance. Binary form … Wikipedia
binary form — a basic musical form having two closely related sections. [1870 75] * * * ▪ music in music, the structural pattern of many songs and instrumental pieces, primarily from the 17th to the 19th century, characterized by two complementary,… … Universalium
Binary prefix — Prefixes for bit and byte multiples Decimal Value SI 1000 k kilo 10002 M mega … Wikipedia
Binary File Descriptor library — The BFD, or Binary File Descriptor library, is the GNU Project s main mechanism for the portable manipulation of object files in a variety of formats. As of 2003, it supports approximately 50 file formats for some 25 processor architectures.BFD… … Wikipedia
Key space — In cryptography, an algorithm s key space refers to the set of all possible keys that can be used to initialize it. For example, if an algorithm works using a key that is a string of 10 bits, then its key space is the set of all binary strings of … Wikipedia
binary cut key — n. a key whose combination only allows for two possibilities in each bitting position: cut/no cut … Locksmith dictionary
binary form — /ˈbaɪnəri fɔm/ (say buynuhree fawm) noun a musical form founded on two themes, or on two balancing or answering sections or phrases, especially with each one in a different key …
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
Uniform binary search — is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth s The Art of Computer Programming . It uses a lookup table to update a single array index, rather than taking the midpoint of an upper and a… … Wikipedia
