文献检索 第二次上机作业

第二次计算机检索实习题目 本次实习目的是使学生对以下三个外文数据库：美国EI COMPENDEX数据库、荷兰SDOS数据库、德国Springer数据库的使用方法有所了解。通过题目，使学生分别掌握每个数据库所提供的各种获取文献的方法，包括浏览和检索的方法，并通过各种算符的组配，以达到获取正确检索结果的目的。（注：有不明白的地方可参照每道题给出的“检索指导”）一、EI COMPENDEX 数据库检索题目题目1 检索2000以前的有关“计算机网络”方面的文献，检索要求：（1）文献类型为会议，文献处理类型为理论，语种为英文。 （2）记下检索到的数量及第一条记录的篇名、作者、刊名、年、卷、期，出版地、出版社等。（3）并分别将该篇文章三种显示格式复制下来。检索指导检索到的数量：31931；第1条 记录的篇名：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 L.1; Nilsson, Arne A.1Source: Conference Record - International Conference on Communications, v 1, p 363-367, 1989; ISSN: 05361486; DOI: 10.1109/ICC.1989.49722; Conference: IEEE International Conference on Communications - ICC89, 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第三种详细格式：Accession number:1990035210067Title:Fault-tolerant analysis of the spiral computer network topologyAuthors:Mitchell, Tony L.1; Nilsson, Arne A.1Author affiliation:1USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USACorresponding author:Mitchell, Tony L.Source title:Conference Record - International Conference on CommunicationsAbbreviated source title:Conf Rec Int Conf CommunVolume:1Issue date:1989Publication year:1989Pages:363-367Language:EnglishISSN:05361486CODEN:CICCDVDocument type:Conference article (CA)Conference name:IEEE International Conference on Communications - ICC89Conference date:June 11, 1989 - June 14, 1989Conference location:Boston, MA, USAConference code:12791Sponsor:IEEE, Communication Soc, New York, NY, USA; IEEE, Boston Section, Boston, MA, USAPublisher:Publ by IEEE, Piscataway, NJ, United StatesAbstract: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.Number of references:4Main 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)DOI:10.1109/ICC.1989.49722Database:CompendexCompilation and indexing terms, 2012 Elsevier Inc.题目2 在EI快速检索的“题名字段”查找“计算机软件”方面的文献，记录检索总条数。(系统默认年代) 在EI快速检索中“题名字段”查找“安全设计”方面的文献，记录检索总条数。 将、两题在检索历史中进行合并检索，记录检索总条数及第一条记录的篇名。并说明检索历史检索历史中E-mail Alert即电子邮件专题服务的功能是什么？检索指导检索总条数：74200；检索总条数：577；检索总条数：3；第一篇记录的篇名：Fault-tolerant analysis of the spiral computer network topology；检索历史中E-mail即电子邮件专题服务的功能是：在用户设定好一个检索后，所选择的数据库在每次更新时将自动检索出用户设定好的内容，并通过电子邮件（E-mail）发送给用户。在每次电子邮件（E-mail）专题服务中可最多发送25条记录，如果在更新中检索到超过25条记录，在电子邮件（E-mail）专题服务中将出现一个超级连接，点击它将连接到Engineering Village 2，就可查看所检索的全部新记录。题目3有一位老师想查电器传感器方面的文献（电器传感器的英文为：POWER INDUCTORS），只需要电器传感器“试验”方面的文献，年代为2000-2005，请你利用浏览检索（Browse Indexes）中的“Controlled term” 检索方式，再限定一下文献的处理类型，看看能查到多少篇文献？得到结果后，利用精确检索栏(Refine Results)统计：检索结果中有几种文献类型，且每种文献的检索结果篇数是多少；并将检索结果中的“期刊论文”单独检索出，随后按照“出版商”排序，记录第一篇文章题名。 检索指导文献篇数：114；文献类型：2种；Conference article 66篇；Journal article 48篇；第一篇篇名：Inductive electronic load for testing of magnet power supplies in particle accelerators题目4 检索2002年，发表在“ACM TRANSACTIONS ON COMPUTER SYSTEMS”期刊里的文章，检索结果按相关度排序，记下第一篇文献的篇名。检索指导Practical Byzantine Fault Tolerance and Proactive Recovery题目5利用浏览索引中的“Controlled term”方式 检索1998-2000,关于 “COMPUTER AIDED ANALYSIS ”方面的文献，语言为Turkish。请回答查到的第一篇文献的篇名？检索指导Effect of the foundation and floor rigidity on the shear walls of buildings which are constructed by using tunnel forms题目6 回答：EI数据库有哪几种输出方式？ 个人帐户最多能建立几个文件夹，每个文件夹最多能保存多少条记录？高级检索中有多少个检索入口；在高级检索方式中，字段检索用什么形式？若要检索所有字段，用什么形式表示？ 检索指导输出方式: view（浏览）, e-mail（电子邮件传送）, print（打印）, download（下载）, save（保存）个人帐户最多能建立3个文件夹，每个文件夹最多能保存50条记录有22个检索入口，检索字段及其代码如下表：FieldCodeFieldCodeAll fieldsALLDocument typeDTAbstractABISBNBNAccession numberANISSNSNAuthorAULanguageLAAffiliationAFEi main headingMHClassification codeCLPublisherPNCODENCNSerial titleSTConference codeCCSubject/Title/AbstractKYConference informationCFTitleTIControlled termCVTreatment typeTRCountry of originCOUncontrolled termFL在高级检索方式中，若要检索所有字段，表示方法：检索词 WN ALL。二、SDOS数据库检索题目题目1（SDOS）利用SDOS数据库检索2000年以来“磁悬浮系统的控制”，给出检索式、检中的篇数及相关度最高的1篇文献的题录格式即可。检索指导Stability and Hopf Bifurcation of the Maglev System with Delayed Speed Feedback Control 题目2（SDOS）查找“Torsten. Eymann”发表在“Advanced Engineering Informatics”期刊中的文献，记下论文的篇名。检索指导A hayekian self-organization approach to service all