河工大第二次文獻(xiàn)檢索作業(yè)

1、 第二次計(jì)算機(jī)檢索作業(yè) 一、COMPENDEX 數(shù)據(jù)庫(kù)檢索指導(dǎo)題目1 檢索2000以前的有關(guān)“計(jì)算機(jī)網(wǎng)絡(luò)”方面的文獻(xiàn)，檢索要求：（1）文獻(xiàn)類型為會(huì)議，文獻(xiàn)處理類型為理論，語(yǔ)種為英文。（2）記下檢索到的數(shù)量及第一條記錄的篇名、作者、刊名、年、卷、期，出版地、出版社等。（3）并分別將該篇文章三種顯示格式復(fù)制下來(lái)。答：（2）、數(shù)量：31913 ；第一條紀(jì)錄的篇名：Fault-tolerant analysis of the spiral computernetwork topology ；作者：Mitchell, Tony L. ， Nilsson, Arne A. ；刊名：Conference R

2、ecord - International Conference on Communications；年卷期：v 1, p 363-367, 1989；出版地： Piscataway, NJ, United States；出版社：IEEE,（3） 、摘要格式：Check record to add to Selected Records 1. Add to selected recordsFault-tolerant analysis of the spiral computer network topologyMitchell, Tony L.; Nilsson, Arne A.Source

3、: Conference Record - International Conference on Communications, v 1, p 363-36705361486; DOI:10.1109/ICC.1989.49722; Conference: IEEE International C Communications - ICC'89, June 11, 1989 - June 14, 1989; Sponsor:IEEE, CommunicationNY, USA; IEEE, Boston Section, Boston, MA, USA; Publisher: Pub

4、l by IEEE Author affiliation:USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USAAbstract:Results are presented from the analysis of a computer network topology that has the potenstandard in future years. The scheme is named the spiral topology because the architecturemodules of four computer node

5、s each, connected by top and bottom spirals. The spiral topsimple internal self-routing algorithm that adapts quickly and automatically to failed computeThe six most important direct consequences of the network architecture are (1) ease of expsecurity, (5) potential for the total elimination of stor

6、e and forward transmissions due to delays, and (6) rendering the maximum-path-length issue moot.(4 refs) Main heading: Computer Networks Controlled terms:on-the-fly self-routing, (3) extremely high tolerance to failed network nodes or links, (4) incComputer Programming-Algorithms - Data Transmission

7、 - Electric Networks-TopoloUncontrolled terms:Computer Network Topology - Computer Nodes - Decision Delays - Self RoutiSpiral Topology - Store and Forward Transmissions Treatment: Theoretical (THR)Database: Compendex詳細(xì)格式：Record 1 from Compendex for: (computer network) WN KY), Conference article only

8、,Theoretical only, English only, 1969-2000 Check record to add to Selected Records1. Add to selected recordsAccession 1990035210067 number:Title: Fault-tolerant analysis of the spiral computer network topology Authors: Mitchell, Tony L.; Nilsson, Arne A.Author USAF Acad, Dep of Math Sci, Colorado, S

9、prings, CO, USA affiliation:Corresponding Mitchell, Tony L.author:Source title: Conference Record - International Conference on Communications Abbreviated Conf Rec Int Conf Commun source title:Volume: 1 Issue date: 1989 Publication 1989year:Pages: 363-367 Language: EnglishISSN: 05361486 CODEN: CICCD

10、VDocument type: Conference article (CA)Conference IEEE International Conference on Communications - ICC'89name:Conference June 11, 1989 - June 14, 1989date:Conference Boston, MA, USA location:Conference 12791code:Sponsor: IEEE, Communication Soc, New York, NY, USA; IEEE, Boston Section, Boston,

11、MA, USA Publisher: Publ by IEEE, Piscataway, NJ, United StatesAbstract: Results are presented from the analysis of a computer network topology that has the potential tois named the spiral topology because the architecture is built around modules of fourcomputer nThe spiral topology features a simple

12、 internal self-routing algorithm that adapts quickly and autosix most important direct consequences of the network architecture are (1) ease of expansion, (due to routing decision delays, and (6) rendering the maximum-path-length issue moot.Number of 4 references:Main heading: Computer NetworksContr

13、olled Computer Programming-Algorithms - Data Transmission - Electric Networks-Topologyterms:tolerance to failed network nodes or links, (4) increased network security, (5) potential for the totUncontrolled Computer Network Topology - Computer Nodes - Decision Delays - Self Routing Algoterms: Transmi

14、ssionsTreatment: Theoretical (THR)DOI: 10.1109/ICC.1989.49722 Database: CompendexCompilation and indexing terms, ? 2013 Elsevier Inc.題目2 在EI快速檢索的“題名字段”查找“計(jì)算機(jī)軟件”方面的文獻(xiàn)，記錄檢索總條數(shù)。(系統(tǒng)默認(rèn)年代) 在EI快速檢索中“題名字段”查找“安全設(shè)計(jì)”方面的文獻(xiàn)，記錄檢索總條數(shù)。 將、兩題在檢索歷史中進(jìn)行合并檢索，記錄檢索總條數(shù)及第一條記錄的篇名。 并說(shuō)明檢索歷史檢索歷史中E-mail Alert即電子郵件專題服務(wù)的功能是什么？ 答：（1

15、）82888 （2）644 （3）8 ，第一篇篇名：Software development for specific geometry and safe design of isotropic material multicell beams ；電子郵件專題服務(wù)功能：把當(dāng)前顯示格式E-mail到指定的郵箱。題目3有一位老師想查電器傳感器方面的文獻(xiàn)（電器傳感器的英文為：POWER INDUCTORS），只需要電器傳感器“試驗(yàn)”方面的文獻(xiàn)，年代為2000-2005，請(qǐng)你利用瀏覽檢索（Browse Indexes）中的“Controlled term” 檢索方式，再限定一下文獻(xiàn)的處理類型，看看能查

16、到多少篇文獻(xiàn)？得到結(jié)果后，利用精確檢索欄(Refine Results)統(tǒng)計(jì)：檢索結(jié)果中有幾種文獻(xiàn)類型，且每種文獻(xiàn)的檢索結(jié)果篇數(shù)是多少；并將檢索結(jié)果中的“期刊論文”單獨(dú)檢索出，隨后按照“出版商”排序，記錄第一篇文章題名。答：114 篇文獻(xiàn)；2種文獻(xiàn)類型；數(shù)量分別為括弧里的數(shù)字；第一篇文章題名：Inductive electronic load for testing of magnet power supplies in particle accelerators題目4 檢索2002年，發(fā)表在“ACM TRANSACTIONS ON COMPUTER SYSTEMS”期刊里的文章，檢索結(jié)果按相

17、關(guān)度排序，記下第一篇文獻(xiàn)的篇名。答：第一篇文獻(xiàn)的篇名：Cellular disco: Resource management using virtual clusters onshared-memory multiprocessors題目5利用瀏覽索引中的“Controlled term”方式 檢索1998-2000,關(guān)于 “COMPUTER AIDED ANALYSIS ”方面的文獻(xiàn)，語(yǔ)言為T(mén)urkish。請(qǐng)回答查到的第一篇文獻(xiàn)的篇名？答：無(wú)結(jié)果題目6 回答：高級(jí)檢索中有多少個(gè)檢索入口；在高級(jí)檢索方式中，字段檢索用什么形式？若要檢索所有字段，用什么形式表示？答： 表示方法：檢索詞 WN AL

18、L二、SDOS數(shù)據(jù)庫(kù)檢索題目題目1（SDOS）利用SDOS數(shù)據(jù)庫(kù)檢索2000年以來(lái)“磁懸浮系統(tǒng)的控制”，給出檢索式、檢中的篇數(shù)及相關(guān)度最高的1篇文獻(xiàn)的題錄格式即可。答：數(shù)目：31題錄格式：Hopf bifurcation of time-delayed feedback control for maglev system with flexible題目2（SDOS）查找“Torsten. Eymann”發(fā)表在“Advanced Engineering Informatics”期刊中的文獻(xiàn)，記下論文的篇名。答：結(jié)果篇名為A hayekian self-organization approach to serviceallocation in co