第二次计算机检索实习题目本次实习目的是使学生对以下三个外文数据库：美国EI COMPENDEX数据库、荷兰SDOS 数据库、德国Springer数据库的使用方法有所了解。
通过题目，使学生分别掌握每个数据库所提供的各种获取文献的方法，包括浏览和检索的方法，并通过各种算符的组配，以达到获取正确检索结果的目的。
”）一、EI COMPENDEX 数据库检索题目题目1检索2000以前的有关“计算机网络”方面的文献，检索要求：（1）文献类型为会议，文献处理类型为理论，语种为英文。
（2）记下检索到的数量及第一条记录的篇名、作者、刊名、年、卷、期，出版地、出版社等。
（3检索到的数量：31931；第一条记录的篇名：Fault-tolerant analysis of the spiral computer network topology；作者：Mitchell, Tony L.、Nilsson, Arne A.；刊名：Conference Record - International Conference on Communications；年：1989；卷：1；期：1989出版地：Boston, MA, USA；出版社：Publ by IEEE, Piscataway, NJ, United States；该篇文章三种显示格式：第一种题录格式：Fault-tolerant analysis of the spiral computer network topologyMitchell, Tony L. (USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USA); Nilsson, Arne A. Source: Conference Record - International Conference on Communications, v 1, p 363-367, 1989Database: Compendex第二种摘要格式：Fault-tolerant analysis of the spiral computer network topologyMitchell, Tony ; Nilsson, ArneSource: Conference Record - International Conference on Communications, v 1, p 363-367, 1989; ISSN: 05361486; DOI: Conference: IEEE International Conference on Communications - ICC'89, June 11, 1989 - June 14, 1989; Sponsor: IEEE, Communication Soc, New York, NY, USA; IEEE, Boston Section, Boston, MA, USA; Publisher: Publ by IEEEAuthor affiliation:1 USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USAAbstract:Results are presented from the analysis of a computer network topology that has the potential to become a standard in future years. The scheme is named the spiral topology because the architecture is built around modules of four computer nodes each, connected by top and bottom spirals. The spiral topology features a simple internal self-routing algorithm that adapts quickly and automatically to failed computer nodes or links. The six most important direct consequences of the network architecture are (1) ease of expansion, (2) fast, on-the-fly self-routing, (3) extremely high tolerance to failed network nodes or links, (4) increased network security, (5) potential for the total elimination of store and forward transmissions due to routing decision delays, and (6) rendering the maximum-path-length issue moot.(4 refs)Main heading: Computer NetworksControlled terms: Computer Programming--Algorithms - Data Transmission - Electric Networks--TopologyUncontrolled terms: Computer Network Topology - Computer Nodes - Decision Delays - Self Routing Algorithm - Spiral Topology - Store and Forward TransmissionsTreatment:Theoretical (THR)Database:Compendex第三种详细格式：Accessionnumber:Title:Fault-tolerant analysis of the spiralcomputer network topologyAuthors:Mitchell, Tony ; Nilsson, ArneAuthor affiliation :1USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USACorrespondingauthor:Mitchell, Tony L.Source title:Conference Record - International Conference on CommunicationsAbbreviated sourcetitle:Conf Rec Int Conf CommunVolume:1Issuedate:1989Publication year:1989Pages:363-367Language:EnglishISSN:05361486CODEN:CICCDVDocumen Conference article (CA)t type:Confere nce name:IEEE International Conference on Communications - ICC'89Conference date:June 11, 1989 - June 14, 1989Conferencelocation:Boston, MA, USAConference code:12791Sponsor :IEEE, Communication Soc, New York, NY, USA; IEEE, Boston Section, Boston, MA, USAPublish er:Publ by IEEE, Piscataway, NJ, United StatesAbstrac t:Results are presented from the analysis of a computer network topology that has the potential to become a standard in future years. The scheme is named the spiral topology because the architecture is built around modules of four computer nodes each, connected by top and bottom spirals. The spiral topology features a simple internal self-routing algorithm that adapts quickly and automatically to failed computer nodes or links. The six most important direct consequences of the network architecture are (1) ease of expansion, (2) fast, on-the-flyself-routing, (3) extremely high tolerance to failed network nodes or links, (4) increased network security, (5) potential for the total elimination of store and forward transmissions due to routing decision delays, and (6) rendering the maximum-path-length issue moot.Number 4ofreferences:Mainheading:Computer NetworksControl led terms:Computer Programming--Algorithms- Data Transmission - Electric Networks--TopologyUncontr olled terms:Computer Network Topology- Computer Nodes - Decision Delays - Self Routing Algorithm - Spiral Topology - Store and Forward TransmissionsTreatment:Theoretical (THR)DOI:and indexing terms, © 2012 ElsevierInc.题目2①在EI快速检索的“题名字段”查找“计算机软件”方面的文献，记录检索总条数。