parallel communications link
51education — /ej oo kay sheuhn/, n. 1. the act or process of imparting or acquiring general knowledge, developing the powers of reasoning and judgment, and generally of preparing oneself or others intellectually for mature life. 2. the act or process of… …
52Egypt — /ee jipt/, n. 1. Arab Republic of. a republic in NE Africa. 64,791,891; 386,198 sq. mi. (1,000,252 sq. km). Cap.: Cairo. Arabic, Misr. Formerly (1958 71), United Arab Republic. 2. an ancient kingdom in NE Africa: divided into the Nile Delta… …
53computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… …
54Data transmission — Data transmission, digital transmission, or digital communications is the physical transfer of data (a digital bit stream) over a point to point or point to multipoint communication channel. Examples of such channels are copper wires, optical… …
55Korean War — Part of the Cold War …
56Transputer — A transputer was a pioneering concurrent computing microprocessor design of the 1980s from INMOS, a British semiconductor company based in Bristol. [ Allen Kent, James G. Williams (eds.) (1998) Encyclopedia of Computer Science and Technology ,… …
57List of computer science conferences — This is a list of academic conferences in computer science. Most of these academic conferences are annual or bi annual events.The order with which the conferences are listed in their respective fields corresponds to a rough and non authoritative… …
58IEEE 1394 — Firewire redirects here. For other uses, see Firewire (disambiguation). IEEE 1394 Interface Type Serial Production history Designer …
59Ontario Highway 401 — Highway 401 redirects here. For other uses, see List of highways numbered 401 …
60Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
