第二次检索课实习答案

此次第二次计算机检索实习题目

本次实习目的是使学生对以下三个外文数据库：美国EI COMPENDEX数据库、荷兰SDOS 数据库、德国Springer数据库的使用方法有所了解。通过题目，使学生分别掌握每个数据库所提供的各种获取文献的方法，包括浏览和检索的方法，并通过各种算符的组配，以达到获取正确检索结果的目的。

”）

一、EI COMPENDEX 数据库检索题目

题目1检索2000以前的有关“计算机网络”方面的文献，检索要求：

（1）文献类型为会议，文献处理类型为理论，语种为英文。

（2）记下检索到的数量及第一条记录的篇名、作者、刊名、年、卷、期，出版地、出版社等。

（3）并分别将该篇文章三种显示格式复制下来。

答：共25篇。Fault-tolerant analysis of the spiral computer network topology

Mitchell, 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, 1989

1. Fault-tolerant analysis of the spiral computer network topology

Mitchell, Tony L.1; Nilsson, Arne A.1

Source: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 - 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 IEEE

Author affiliation:

1 USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USA

Abstract:

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)

Controlled terms: - Data Transmission - Electric

Uncontrolled terms: - Decision Delays - Self Routing Algorithm - Spiral Topology - Store and Forward Transmissions

Treatment: Theoretical (THR)

Database: Compendex

Full-text and Local Holdings Links

Check record to add to Selected Records

Accession number: 1990035210067

1.

Title: Fault-tolerant analysis of the spiral computer network

topology

Authors: Mitchell, Tony L.1; Nilsson, Arne A.1

Author affiliation: 1 USAF Acad, Dep of Math Sci, Colorado, Springs, CO, USA Corresponding author: Mitchell, Tony L.

Source title: Conference Record - International Conference on Communications Abbreviated source title: Conf Rec Int Conf Commun

Volume: 1

Issue date: 1989

Publication year: 1989

Pages: 363-367

Language: English

ISSN: 05361486

CODEN: CICCDV

Document type: Conference article (CA)

Conference name: IEEE International Conference on Communications - ICC'89

Conference date: June 11, 1989 - June 14, 1989

Conference location: Boston, MA, USA

Conference code: 12791

Sponsor: IEEE, Communication Soc, New York, NY, USA; IEEE, Boston

Section, Boston, MA, USA

Publisher: Publ by IEEE, Piscataway, NJ, United States

Abstract: 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