河北工业大学 文献检索上机作业 最新 下载本文

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

一、COMPENDEX 数据库检索题目

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

(1)文献类型为会议,文献处理类型为理论,语种为英文。

(2)记下检索到的数量及第一条记录的篇名、作者、刊名、年、卷、期,出版

地、出版社等。

(3)并分别将该篇文章三种显示格式复制下来。 答:

检索结果: Quick Search

32137 articles found in Compendex for 1969-2000: ((computer network) WN

KY), Conference article only, Theoretical only, English only 题录格式: 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 Database: Compendex

摘要格式:

Fault-tolerant analysis of the spiral computer network topology Mitchell, Tony L.; Nilsson, Arne A. Source:

1

1

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) Main heading: Computer Networks Controlled terms: Computer

Programming--Algorithms

-

Data

Transmission - Electric Networks--Topology Uncontrolled terms:

Computer Network Topology - Computer Nodes - Decision

Delays Treatment: Theoretical (THR) Database: Compendex

Full-text and Local Holdings Links

-

Self

Routing

Algorithm

-

Spiral

Topology - Store and Forward Transmissions

详细格式:

Accession number: Title:

1990035210067

Fault-tolerant analysis of the

spiral computer network topology

Authors:

Author affiliation:

Mitchell, Tony L.; Nilsson,

Arne A.

1

1

1

USAF Acad, Dep of Math Sci,

Colorado, Springs, CO, USA

Corresponding author: Source title:

Mitchell, Tony L. Conference

Record

- on

International Conference Communications

Abbreviated source title: Volume: Issue date: Publication year: Pages: Language:

Conf Rec IntConfCommun 1 1989 1989 363-367 English

ISSN: CODEN:

Document type: Conference name:

Conference date: Conference location: Conference code: Sponsor:

Publisher: Abstract:

05361486 CICCDV

Conference article (CA) IEEE International Conference

on

Communications

-

ICC'89

June 11, 1989 - June 14, 1989 Boston, MA, USA 12791

IEEE, Communication Soc, New

York, NY, USA; IEEE, Boston Section, Boston, MA, USA

Publ by IEEE, Piscataway, NJ,

United States

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 delays, rendering

maximum-path-length issue moot.

Number of references: Main heading: Controlled terms:

4

ComputerNetworksComputer

Programming--Algorithms - Data Transmission - Electric

Networks--Topology

Uncontrolled terms:

Computer Network Topology -

Computer Routing and

Transmissions

Treatment: DOI: Database:

Theoretical (THR) 10.1109/ICC.1989.49722 Compendex Compilation

Inc.

and

indexing

terms, ? 2015 Elsevier

Nodes Algorithm

- -

Decision Delays - Self Spiral Topology - Store

Forward

transmissions and

(6) the

due to routing decision

题目2 ① 在EI快速检索的“题名字段”查找“计算机软件”方面的文献,记录检索总

条数。(系统默认年代) 答:Quick Search

97618 articles found in Compendex for 1969-2016: ((software) WN TI)

② 在EI快速检索中“题名字段”查找“安全设计”方面的文献,记录检索总条数。

Quick Search

777 articles found in Compendex for 1969-2016: ((safe design) WN TI)