检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

2,680 篇 会议
40 篇 期刊文献
14 册 图书

馆藏范围

2,733 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,879 篇 工学
- 1,599 篇 计算机科学与技术...
- 778 篇 软件工程
- 500 篇 信息与通信工程
- 388 篇 电气工程
- 171 篇 控制科学与工程
- 67 篇 生物工程
- 60 篇 电子科学与技术（可...
- 48 篇 仪器科学与技术
- 46 篇 机械工程
- 41 篇 动力工程及工程热...
- 34 篇 安全科学与工程
- 31 篇 网络空间安全
- 27 篇 环境科学与工程（可...
- 25 篇 建筑学
- 22 篇 生物医学工程（可授...
- 20 篇 土木工程
- 19 篇 交通运输工程
363 篇 理学
- 219 篇 数学
- 80 篇 生物学
- 60 篇 物理学
- 49 篇 统计学（可授理学、...
- 40 篇 系统科学
306 篇 管理学
- 213 篇 管理科学与工程(可...
- 117 篇 图书情报与档案管...
- 96 篇 工商管理
43 篇 医学
- 28 篇 临床医学
- 26 篇 基础医学(可授医学...
- 18 篇 公共卫生与预防医...
40 篇 法学
- 28 篇 社会学
39 篇 经济学
- 39 篇 应用经济学
12 篇 农学
11 篇 教育学
9 篇 文学
3 篇 军事学

主题

239 篇 cloud computing
171 篇 distributed comp...
154 篇 social networkin...
80 篇 protocols
79 篇 computational mo...
76 篇 computer archite...
68 篇 servers
66 篇 mobile computing
57 篇 wireless sensor ...
53 篇 internet of thin...
53 篇 distributed data...
50 篇 resource managem...
49 篇 security
48 篇 computer network...
47 篇 distributed comp...
44 篇 peer to peer com...
43 篇 bandwidth
43 篇 mobile communica...
42 篇 edge computing
42 篇 ubiquitous compu...

机构

36 篇 state key labora...
14 篇 saint petersburg...
11 篇 beijing univ pos...
9 篇 institute of com...
8 篇 beijing universi...
8 篇 lakhshya cyber s...
8 篇 amrita vishwa vi...
8 篇 lakhshya cyber s...
8 篇 tu wien distribu...
6 篇 center for compu...
6 篇 school of comput...
6 篇 plekhanov russia...
6 篇 institute of inf...
5 篇 department of ph...
5 篇 dept. of astrono...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 columbia astroph...
5 篇 iii. physikalisc...
5 篇 dept. of physics...

作者

11 篇 dustdar schahram
10 篇 yang yang
9 篇 soman k. p.
9 篇 vinayakumar r.
8 篇 bandyopadhyay su...
8 篇 bogdanov alexand...
8 篇 pradeep menon
8 篇 menon pradeep
7 篇 r vinayakumar
7 篇 zomaya albert y.
7 篇 kp soman
7 篇 korkhov vladimir
6 篇 calton pu
6 篇 jaekel arunita
6 篇 li jinglin
6 篇 degtyarev alexan...
6 篇 taheri javid
5 篇 huang tao
5 篇 haungs a.
5 篇 fürst p.

语言

2,685 篇 英文
32 篇 中文
17 篇 其他
4 篇 俄文

检索条件"任意字段=9th International Conference on Distributed Computing and Networking"

共 2734 条记录，以下是2721-2730 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Fast Ring: a distributed architecture and protocol for local area distributed processing

Fast Ring: a distributed architecture and protocol for local...

引用

international conference on distributed computing Systems

作者： S.R. Koppolu S. thanawastien R.R. Henry The Center for Advanced Computer Studies University of Southwestern Louisiana Lafayette LA USA

A ring-based media access control protocol and architecture, Fast Ring, which combines the best features of the token ring and contention ring, is proposed. For this protocol, a free token circulates on the ring when the ring is idle. A ready station can transmit either by capturing the token or sensing the ring idle. the protocol works in such a way that the ready node which captures the free token, before or while transmitting, is able to continue transmission. All the other contending nodes have to stop their transmissions and then send the abort signal when they receive the upstream transmission. After its transmission, the successful station puts a free token on the ring and the protocol enters the token mode. It behaves like the token ring protocol until the ring becomes idle again when all the ready nodes complete their transmissions. Comparison of the performance of Fast Ring with those of contention ring, token ring, and carrier-sense multiaccess with collision detection protocols shows that the Fast Ring outperforms all these local area network protocols over the whole throughput range at all transmission rates.< >

关键词： distributed processing Token networks Access protocols throughput Delay Computer architecture Media Access Protocol Degradation Ethernet networks distributed computing

来源：评论

学校读者我要写书评

暂无评论

A high performance virtual token-passing multiple-access method for multiple-bus local networks

A high performance virtual token-passing multiple-access met...

引用

international conference on distributed computing Systems

作者： V.V. Karmarkar J.G. Kuhl AT&T Bell Labaratories Columbus OH USA Department of Electrical and Computer Engineering University of Iowa Iowa IA USA

A new integrated demand-assignment multiple-access (DAMA) method for multiple-bus local networks (MBLNs) is proposed and evaluated. the performance of this method is shown to be superior to independent token-passing as well as to previously proposed integrated access schemes. V-STIA, a virtual token-passing extension of a modified explicit token-passing scheme called single-token integrated access (STIA), delivers the best overall performance at medium to heavy loads while achieving good light-load performance without collision detection. Consequently, V-STIA makes the fewest possible demands on interface capabilities for DAMA support in MBLNs. Additionally, V-STIA implementation does not require simultaneous transmit capability for correct operation and greatly reduces design complexity. Performance advantages of MBLNs over an equivalent bandwidth single-bus DAMA system are established.< >

关键词： Bandwidth Costs distributed computing Application software Propagation delay Stability Computer networks Network topology Aggregates Redundancy

来源：评论

学校读者我要写书评

暂无评论

A flexible algorithm for replicated directory management

A flexible algorithm for replicated directory management

引用

international conference on distributed computing Systems

作者： S. Sarin R. Floyd N. Phadnis Xerox Advanced Information Technology Four Cambridge Center Cambridge MA USA BBN Systems and Technologies Corporation Cambridge MA USA

A replicated directory management algorithm is presented that supports full location-transparency by allowing migration and reconfiguration at the granularity of individual names. Initially, all names in a directory (including names not yet in use) are controlled by the same set of sites, but control over any individual name (or range of names) can be migrated, e.g. to the set of sites that control the data object associated with the name. the method is based on a directory replication algorithm of J.J. Bloch et al. (1987), incorporating two extensions: (1) allowing control over individual names in a directory to migrate independently; and (2) allowing the definition of relationships among names, such that if control over a given name migrates, then those names that depend on it are automatically migrated as well. Finally, it is stated that the major cost of the algorithm, compared to simpler approaches that do not provide the same degree of location transparency, is the additional complexity and difficulty of obtaining a consistent view of the entire directory.< >

关键词： distributed computing File systems Database systems Automatic control Technology management Information technology Contracts Control systems Partitioning algorithms Voting

来源：评论

学校读者我要写书评

暂无评论

Application of Petri net models for the evaluation of fault-tolerant techniques in distributed systems

Application of Petri net models for the evaluation of fault-...

引用

international conference on distributed computing Systems

作者： Y.-B. Shieh D. Ghosal P.R. Chintamaneni S.K. Tripathi Department of Computer Science University of Maryland Baltimore MD USA Department of Computer Science and Institute for Advanced Computer Studies University of Maryland College Park MD USA

Analytical models are presented that use Petri nets for fault-tolerant schemes used in distributed systems. these models are used in the quantitative evaluation and selection of good fault-tolerant schemes for specific system configurations. Several different fault-tolerant schemes that can be modeled using Petri nets are discussed in detail. these schemes include rollback recovery with checkpointing, recovery blocks, N-version programming, and conversations. After a brief review of Petri net models, extension of the Petri net models to incorporate fault-tolerant schemes is considered. A methodology for evaluating a fault-tolerant scheme for a specific system configuration and the steps involved in building a Petri net model of a fault-tolerant system are described. the subnet primitives involved in building these models are identified and an algorithm for building the models automatically is described. Examples illustrating this extended Petri net model are discussed and numerical results are presented to show the applicability of the models.< >

关键词： Fault tolerance Fault tolerant systems Computer science Petri nets Educational institutions Checkpointing Hardware Application software distributed computing Analytical models

来源：评论

学校读者我要写书评

暂无评论

Generating a fault tolerant global clock in a high speed distributed system

Generating a fault tolerant global clock in a high speed dis...

引用

international conference on distributed computing Systems

作者： Y. Ofek IBM Thomas J. Watson Research Center Yorktown Heights NY USA

A technique is described for constructing a fault-tolerant global clock in a point-to-point distributed system with an arbitrary topology, which constitutes a wide-area network. It is assumed that the network is constructed of optical links with very high transmission rates. the approach used is to generate a global clock from the ensemble of the local transmission clocks, and not to synchronize these high-speed clocks directly. the steady-state algorithm which generates the global system clock is executed in hardware by the network interface of each node. As a result, it is possible to estimate accurately intermodal delays and thereby to achieve a much tighter synchronization than with other methods. the basic synchronization time step is proportional to the error or uncertainty in the measurement of the end-to-end network delay rather than to the actual value of the end-to-end network delay. Node and network models are presented, and the synchronization condition is defined. the synchronization algorithm, its bound, and its correctness proof are presented. A procedure is described for detecting and isolating a faulty component, while maintaining the integrity of the global clock.< >

关键词： Fault tolerance Clocks Synchronization Delay estimation Delay effects Fault tolerant systems Network topology Optical fiber communication Steady-state Hardware

来源：评论

学校读者我要写书评

暂无评论

Missing-partition dynamic voting scheme for replicated database systems

Missing-partition dynamic voting scheme for replicated datab...

引用

international conference on distributed computing Systems

作者： C.-L. Huang V.O.K. Li Department of Electrical Engineering University of Southern California Los Angeles CA USA

A replication control protocol utilizing dynamic voting is presented for ensuring database correctness so that the system behaves like a one-copy database to the users. the protocol dynamically adjusts vote assignment of data items in response to failures and recoveries, thus maintaining higher data availability than static voting schemes in the event of network partitioning. Unlike existing dynamic voting schemes, it supports inexpensive read operations which access one copy, rather than all copies, of each data item read. Since read operations outnumber write operations in most applications, this protocol enjoys better performance. With this protocol, transactions run in one of three modes: normal mode, missing-partition mode, or pseudo-normal mode. Because a partition number and a last current copy cardinality are associated with each copy, read operations only require one copy of a data item when run in the normal mode.< >

关键词： Voting Database systems distributed databases Control systems Access protocols Communication system control Concurrency control Partitioning algorithms Availability Transaction databases

来源：评论

学校读者我要写书评

暂无评论

Immediate ordered service in distributed systems

Immediate ordered service in distributed systems

引用

international conference on distributed computing Systems

作者： P. Kearns B. Koodalattupuram Department of Computer Science The College of William and Mary Williamsburg VA USA Department of Computer Science University of Pittsburgh Pittsburgh PA USA

A technique is presented by which a centralized service facility in a distributed system can honor client requests in the global order in which those requests were made. Unlike traditional approaches to this problem, the server provides immediate service to its clients. Immediate service requires that, upon receipt of a request which is the oldest unserved message, the server must grant the service immediately. No additional message passing may be used by the server in order to serve that request. the approach requires that certain information be appended to every message in the system. this piggybacked information allows the server to infer the order in which service should be granted to arriving request messages. Increased message length is thus explicitly traded for fewer messages and faster response to requests at the server. that overhead is proportional to the number of processors in the system. In time-critical distributed applications immediate service offers a means by which service response time can be substantially reduced. It is argued that, under certain reasonable assumptions about the network and process behavior, immediate service can outperform the logical timestamp approach for very large systems (and certainly for small systems).< >

关键词： Computer science Weapons Educational institutions Message passing Resource management Aerospace electronics Research and development NASA Actuators Displays

来源：评论

学校读者我要写书评

暂无评论

A design of a distributed full text retrieval system 86

引用

9th Annual international ACM SIGIR conference on Research and Development in Information Retrieval, SIGIR 1986

作者： Martin, Patrick Macleod, Ian A. Nordin, Brent Deprtment of Computing Information Science Queen's Unlversity KingstonONK7L 3N6 Canada

ISBN: (纸本)0897911873

thii paper describes the design of a distributed information system for full text retrieval Tbc system is similar in functionality to STAIRS and is being developed on a network of .PC's interconnected by PC Network. the implementation is built on a generalisation of the remote procedure call concept. Communications are based upon the recent CCITT X.400 standard Examples are given of the design strategy for a subset of the STAIRS system. © Organization of the 1986-ACM conference on Research and Development in Information Retrievel.

关键词： Stairs

来源：评论

学校读者我要写书评

暂无评论

CHARACTERIZING FINEPARTICLE IMAGES BY distributed computing.

CHARACTERIZING FINEPARTICLE IMAGES BY DISTRIBUTED COMPUTING.

引用

9th Annual Powder & Bulk Solids conference/Exhibition, Proceedings of the Technical Program - Powder and Bulk Solids Handling and Processing.

作者： Kaye, B.H. Kaye, A.D. MacLeod, D.R. Laurentian Univ Sudbury Ont Can Laurentian Univ Sudbury Ont Can

the Fineparticle Group at Laurentian University is currently exploring the ergonomic structure and task allocation of a distributed computing system for evaluating fineparticles collected in routine monitoring of air pollution problems and industrial hygiene samples. In this presentation the characterization of asbestos fibers and silica fineparticles by the distributing computing system is presented.

关键词： POWDERS

来源：评论

学校读者我要写书评

暂无评论

ASPECTS OF distributed computing SYSTEMS 9

ASPECTS OF DISTRIBUTED COMPUTING SYSTEMS

引用

9th international Computer Measurement Group conference, CMG 1983

作者： Lorin, Harold IBM Systems Research Institute

this paper describes Aspects of distributed Computer Systems by Harold Lorin. the book was published by John Wiley and Sons in 1980. "Aspects" undertakes to discuss issues in the design and the management of distributed Systems. It is written primarily for the professional who must straddle technology and organizational issues in information planning. It has been successfully used as a text book at the graduate and undergraduate levels in business and information systems curricula. © 1983 by the Computer Measurement Group, Inc.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共274页 << < 265 266 267 268 269 270 271 272 273 274 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：