11.07.2015 Views

Encyclopedia of Computer Science and Technology

Encyclopedia of Computer Science and Technology

Encyclopedia of Computer Science and Technology

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

266 knowledge representationattended the Bronx High School <strong>of</strong> <strong>Science</strong>, home <strong>of</strong> many<strong>of</strong> the nation’s top future engineers. However, when it cametime for college, the family had no money to pay for hishigher education, so he attended night courses at the CityCollege <strong>of</strong> New York while working as an electronics technician<strong>and</strong> later as an engineer. Kleinrock graduated first inhis class in 1957 <strong>and</strong> earned a fully paid fellowship to theMassachusetts Institute <strong>of</strong> <strong>Technology</strong>.At MIT Kleinrock became interested in finding ways forcomputers <strong>and</strong> their users to communicate with each other.The idea <strong>of</strong> computer networking was in its infancy, but hesubmitted a proposal in 1959 for Ph.D. research in networkdesign.In 1961 Kleinrock published his first paper, “InformationFlow in Large Communication Nets.” Existing telephonesystems did what was called “circuit switching”: Toestablish a conversation, the caller’s line is connected to thereceiver’s, forming a circuit that existed for the duration<strong>of</strong> the call. This also meant that the circuit would not beavailable to anyone else, <strong>and</strong> that if something was wrongwith the connection there was no way to route around theproblem.Kleinrock’s basic idea was to set up data connectionsthat would be shared among many users as needed. Instead<strong>of</strong> the whole call (or data transmission) being assigned to aparticular circuit, it would be broken up into packets thatcould be sent along whatever circuit was the most direct.If there was a problem, the packet could be resent on analternative route. This form <strong>of</strong> “packet switching” providedgreat flexibility as well as more efficient use <strong>of</strong> the availablecircuits. Kleinrock further elaborated his ideas in hisdissertation, for which he was awarded his Ph.D. in 1963.The following year MIT published his book CommunicationsNets, the first full treatment <strong>of</strong> the subject.Kleinrock joined the faculty at the University <strong>of</strong> California,Los Angeles. In 1968 the Defense Department’sAdvanced Research Projects Agency (ARPA) asked him todesign a packet-switched network that would be known asARPANET. The computers on the network would be connectedusing special devices called Interface Message Processors(IMPs). The overall project was under the guidance<strong>and</strong> supervision <strong>of</strong> one <strong>of</strong> Kleinrock’s MIT <strong>of</strong>fice mates,Lawrence Roberts.On October 29, 1969, Kleinrock <strong>and</strong> his assistants sentthe first data packets between UCLA <strong>and</strong> Stanford overphone lines. Their message, the word “login,” was hardly asdramatic as Alex<strong>and</strong>er Graham Bell’s “Watson, come here,I need you!” Nevertheless, a form <strong>of</strong> communication hadbeen created that in a few decades would change the worldas much as the telephone had done a century earlier.The idea <strong>of</strong> computer networking did not catch on immediately,however. Besides requiring a new way <strong>of</strong> thinkingabout the use <strong>of</strong> computers, many computer administratorswere concerned that their computers might be swampedwith users from other institutions, or that they might ultimatelylose control over the use <strong>of</strong> their machines. Kleinrockworked tirelessly to convince institutions to join thenascent network. By the end <strong>of</strong> 1969 there were just fourARPANET “nodes”: UCLA, the Stanford Research Institute,UC Santa Barbara, <strong>and</strong> the University <strong>of</strong> Utah. By the followingsummer, there were ten.During the 1970s Kleinrock trained many <strong>of</strong> theresearchers who would advance the technology <strong>of</strong> networking.While Kleinrock’s first network was not the Internet weknow today, it was an essential step in its development. Insuccessfully establishing communication using the packetswitchedARPANET, Kleinrock showed that such a networkwas practicable.By the early 1990s Kleinrock was looking toward a futurewhere most network connections were wireless <strong>and</strong> accessiblethrough a variety <strong>of</strong> computerlike devices such as h<strong>and</strong>held“palmtop” computers, cell phones, <strong>and</strong> others not yetimagined. In such a network the intelligence or capability isdistributed throughout, with devices communicating seamlesslyso the user no longer need be concerned about whatparticular gadget he or she is using. By the middle <strong>of</strong> the followingdecade, much <strong>of</strong> this vision had become reality.Although his name is not well known to the generalpublic, Kleinrock has won considerable recognition withinthe technical community. This includes Sweden’s L. M.Ericsson Prize (1982), the Marconi Award (1986), <strong>and</strong> theNational Academy <strong>of</strong> Engineering Charles Stark DraperPrize (2001).Further ReadingHafner, Katie, <strong>and</strong> Matthew Lyon. Where Wizards Stay Up Late: TheOrigins <strong>of</strong> the Internet. New York: Simon <strong>and</strong> Schuster, 1996.Kleinrock, Leonard. “Information Flow in Large CommunicationNets.” Available online. URL: http://www.lk.cs.ucla.edu/LK/Bib/REPORT/PhD/proposal.html. Accessed May 3, 2007.“Leonard Kleinrock’s Home Page.” Available online. URL: http://www.lk.cs.ucla.edu/. Accessed May 3, 2007.knowledge representationThe earliest concern <strong>of</strong> computer science was the representation<strong>of</strong> “raw” data such as numbers in programs (see datatypes). Such data can be used in calculations, <strong>and</strong> actionstaken based on tests <strong>of</strong> data values, using branching (IF) orlooping structures.However, facts are more than data. A fact is an assertion,for example about a relationship, as in “Joe is a son <strong>of</strong>Mike,” <strong>of</strong>ten expressed in a form such as son (Joe, Mike).Implications can also be defined as proceeding from facts,such asson (Joe, Mike) implies father (Mike, Joe) orson (Joe, Mike) <strong>and</strong> son (Mike, Phil) impliesgr<strong>and</strong>son (Joe, Phil)While it can be expressed in a variety <strong>of</strong> different forms<strong>of</strong> notation, this predicate calculus forms the basis formany automated reasoning systems that can operate on a“knowledge base” <strong>of</strong> assertions, prove the validity <strong>of</strong> a givenassertion, <strong>and</strong> even generate new conclusions based uponexisting knowledge (see also expert systems).An alternative form <strong>of</strong> knowledge representation usedin artificial intelligence programs is based on the idea <strong>of</strong>frames. A frame is a structure that lists various character-

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!