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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,624 篇 会议
13 篇 期刊文献
9 册 图书

馆藏范围

1,646 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

916 篇 工学
- 838 篇 计算机科学与技术...
- 323 篇 软件工程
- 211 篇 信息与通信工程
- 133 篇 电气工程
- 63 篇 控制科学与工程
- 31 篇 生物工程
- 22 篇 生物医学工程（可授...
- 17 篇 电子科学与技术（可...
- 15 篇 动力工程及工程热...
- 15 篇 安全科学与工程
- 14 篇 网络空间安全
- 13 篇 建筑学
- 12 篇 土木工程
- 10 篇 仪器科学与技术
- 10 篇 交通运输工程
- 9 篇 机械工程
- 9 篇 材料科学与工程（可...
- 8 篇 化学工程与技术
183 篇 理学
- 89 篇 数学
- 68 篇 物理学
- 33 篇 生物学
- 19 篇 系统科学
- 18 篇 统计学（可授理学、...
134 篇 管理学
- 94 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 57 篇 工商管理
20 篇 法学
- 16 篇 社会学
17 篇 经济学
- 15 篇 应用经济学
17 篇 医学
- 16 篇 临床医学
- 14 篇 基础医学(可授医学...
2 篇 农学
1 篇 教育学
1 篇 文学
1 篇 军事学
1 篇 艺术学

主题

156 篇 distributed comp...
113 篇 cloud computing
78 篇 peer to peer com...
74 篇 application soft...
67 篇 protocols
67 篇 computer network...
64 篇 computational mo...
63 篇 mobile computing
56 篇 computer science
56 篇 computer archite...
49 篇 high performance...
47 篇 routing
46 篇 bandwidth
45 篇 internet
45 篇 middleware
43 篇 privacy
40 篇 costs
39 篇 resource managem...
39 篇 distributed comp...
38 篇 social networkin...

机构

14 篇 state key labora...
10 篇 gansu provincial...
9 篇 beijing universi...
7 篇 institute of com...
7 篇 cern geneva
6 篇 college of compu...
6 篇 shenzhen institu...
6 篇 tokyo denki univ...
5 篇 department of ph...
5 篇 dept. of astrono...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 iii. physikalisc...
5 篇 erlangen centre ...
5 篇 département de p...
5 篇 school of physic...
5 篇 dept. of physics...
5 篇 dept. of physics...
5 篇 department of ph...
5 篇 institut für phy...

作者

8 篇 takizawa makoto
6 篇 huang lican
6 篇 enokido tomoya
6 篇 makoto takizawa
5 篇 de ridder s.
5 篇 choi k.
5 篇 an r.
5 篇 haungs a.
5 篇 fürst p.
5 篇 cross r.
5 篇 bradascio f.
5 篇 fan k.l.
5 篇 bourbeau e.
5 篇 fritz a.
5 篇 bastian b.
5 篇 gündüz m.
5 篇 dvorak e.
5 篇 halve l.
5 篇 gonzalez j.g.
5 篇 de clercq c.

语言

1,636 篇 英文
8 篇 中文
5 篇 其他

检索条件"任意字段=Proceedings of the 22nd International Conference on Distributed Computing and Networking"

共 1646 条记录，以下是1521-1530 订阅

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

详细简洁

排序：

U-P2P: a peer-to-peer system for description and discovery of resource-sharing communities

U-P2P: a peer-to-peer system for description and discovery o...

引用

international conference on distributed computing Systems Workshop

作者： A. Mukherjee B. Esfandiari N. Arthorne Carleton University Ottawa Ontario Canada Carleton University Ottawa ON CA Carleton Univ. Ottawa Ont. Canada

A simple method is proposed for peer-to-peer description and discovery of resource-sharing communities as well as the resources themselves. An XML Schema document describes a shared resource. By applying transformations, specified in XSL, the schema is used to generate an application with the ability to publish and search for the defined object. Meta-data is indexed and searchable allowing complex objects to be discovered. We propose to solve the problem of discovery for resource-sharing communities by treating a community as a shared resource. An XML Schema description of resource-sharing communities is used to generate a P2P system for community discovery.

关键词： Peer to peer computing XML Application software Digital audio players Robustness Standards development Bandwidth Design engineering Knowledge engineering Systems engineering and theory

来源：评论

学校读者我要写书评

暂无评论

Overlook: scalable name service on an overlay network

Overlook: scalable name service on an overlay network

引用

international conference on distributed computing Systems

作者： M. Theimer M.B. Jones Microsoft Research Microsoft Corporation Redmond WA USA

This paper indicates that a scalable fault-tolerant name service can be provided utilizing an overlay network and that such a name service can scale along a number of dimensions: it can be sized to support a large number of clients, it can allow large numbers of concurrent lookups on the same name or sets of names, and it can provide name lookup latencies measured in seconds. Furthermore, it can enable updates to be made pervasively visible in times typically measured in seconds for update rates of up to hundreds per second. We explain how many of these scaling properties for the name service are obtained by reusing some of the same mechanisms that allowed the underlying overlay network to scale. Finally, we observe that the overlay network is sensitive to bandwidth and CPU limitations.

关键词： Peer to peer computing Routing Web and internet services Scalability Adaptive systems Fault tolerant systems Delay Size measurement Mechanical factors Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Dynamic replica control based on fairly assigned variation of data with weak consistency for loosely coupled distributed systems

Dynamic replica control based on fairly assigned variation o...

引用

international conference on distributed computing Systems

作者： T. Yamashita Nippon Telegraph and Telephone Corporation Musashino Tokyo Japan

This paper proposes a replica control method based on a fairly assigned variation of numerical data that has weak consistency for loosely coupled systems managed or used by different organizations. This method dynamically distributes the variation of numerical data to replicas according to their demands while achieving fairness among them. By assigning the variation, a replica can determine the possibility that processed update transactions will be aborted and can notify a client of the possibility even when network partitioning happens. In addition, fairly, assigning the variation of data to replicas enables the disadvantage among replicas caused by asynchronous update to be balanced among replicas. Fairness control for assigning the variation of data is performed by averaging the demands in the variation that are requested by the replicas. Simulation showed that our system can achieve extremely high fairness while processing update transactions at the maximum rate.

关键词： Control systems Availability Scalability Database systems Delay Telegraphy Telephony Computational modeling Computer networks Humans

来源：评论

学校读者我要写书评

暂无评论

Separating the navigational aspect

Separating the navigational aspect

引用

international conference on distributed computing Systems Workshop

作者： A.M.R. Quintero J.T. Valderrama Languages and Computing Systems Department University of Seville Seville Spain

The first step given to separate concepts in web environments has been to take apart presentation from data. This split has been gotten due to the appearance of the Extensible Mark-up Language (XML) and the application of style sheets. The new ideas from the advanced separation concern community and the new abstractions like aspects make us think this original division isn't rich enough. There are important concepts of Internet applications that should be defined separately. If we look at new web design methodologies, we can realize that one of these aspects is navigation. Following the way started by XML, we propose the use of the XML Linking Language (XLink) as a first stage to obtain the separation of the navigational aspect.

关键词： Navigation XML Web design Web pages Joining processes Space technology Internet Software engineering Scattering Cascading style sheets

来源：评论

学校读者我要写书评

暂无评论

Event systems. How to have your cake and eat it too

Event systems. How to have your cake and eat it too

引用

international conference on distributed computing Systems Workshop

作者： P.Th. Eugster P. Felber R. Guerraoui S.B. Handurukande Distributed Programming Laboratory Swiss Federal Institute of Technology Lausanne Switzerland Bell Labs. Lucent Technologies Inc. Murray Hill NJ USA

This paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing interests in events), and event safety (ensuring encapsulation and type-safe interaction with polymorphic events). We point out some ramifications underlying these tradeoffs and we propose a pragmatic approach to handle them. We achieve scalability using a multi-stage filtering strategy that combines approximate and perfect matching techniques for the purpose of event routing and filtering. We achieve expressiveness and event safety by viewing events as objects, i.e., instances of application-defined abstract types.

关键词： Safety Scalability Subscriptions Encapsulation Routing Matched filters Laboratories Equations Information filtering Information filters

来源：评论

学校读者我要写书评

暂无评论

Improving search in peer-to-peer networks

Improving search in peer-to-peer networks

引用

international conference on distributed computing Systems

作者： B. Yang H. Garcia-Molina Computer Science Department University of Stanford USA

Peer-to-peer systems have emerged as a popular way to share huge volumes of data. The usability of these systems depends on effective techniques to find and retrieve data; however current techniques used in existing P2P systems are often very inefficient. We present three techniques for efficient search in P2P systems. We present the design of these techniques, and then evaluate them using a combination of analysis and experiments over Gnutella, the largest open P2P system in operation. We show that while our techniques maintain the same quality of results as currently used techniques, they use up to 5 times fewer resources. In addition, we designed our techniques to be simple, so that they can be easily incorporated into existing systems for immediate impact.

关键词： Intelligent networks Peer to peer computing Usability Information retrieval Computer science Multimedia systems Costs Bandwidth Fault tolerant systems Network topology

来源：评论

学校读者我要写书评

暂无评论

Progressive HTML for proximate and automatic interactions

Progressive HTML for proximate and automatic interactions

引用

international conference on distributed computing Systems Workshop

作者： A. Troel M. Banatre F. Weis IRISA/INRIA Rennes France IRISA/University Rennes Rennes France

Development and projections in the field of PDAs and wireless communication architectures let us consider new applications which exploit short range and direct exchanges. In a close future we may imagine mobile users equipped with wireless PDAs dynamically and spontaneously exchanging rich information in an ad hoc manner In such a context, a connection between two PDAs may be broken at any time because of the short communication range and the unconstrained mobility of the users. Thus, such spontaneous data exchanges become a real challenge. To perform spontaneous and relevant transmissions compatible with these volatile connections, we propose a method that progressively downloads information according to its importance. Then, we show an implementation of such a mechanism in a Web context by extending the actual browsers capabilities.

关键词： HTML Personal digital assistants Internet Bandwidth Wireless communication Mobile communication Web pages Context Web server Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Routing indices for peer-to-peer systems

Routing indices for peer-to-peer systems

引用

international conference on distributed computing Systems

作者： A. Crespo H. Garcia-Molina University of Stanford USA

Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. We introduce the concept of routing indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot answer a query, it forwards the query to a subset of its neighbors, based on its local RI, rather than by selecting neighbors at random or by flooding the network by forwarding the query to all neighbors. We present three RI schemes: the compound, the hop-count, and the exponential routing indices. We evaluate their performance via simulations, and find that RIs can improve performance by one or two orders of magnitude vs. a flooding-based system, and by up to 100% vs. a random forwarding system. We also discuss the tradeoffs between the different RI schemes and highlight the effects of key design variables on system performance.

关键词： Routing Peer to peer computing System performance distributed computing Robustness Costs Web search Search engines Computer hacking

来源：评论

学校读者我要写书评

暂无评论

A new document placement scheme for cooperative caching on the Internet

A new document placement scheme for cooperative caching on t...

引用

international conference on distributed computing Systems

作者： L. Ramaswamy Ling Liu College of Computing Georgia Institute of Technology Atlanta USA

Most existing work on cooperative caching has been-focused on serving misses collaboratively. Very few have studied the effect of cooperation on document placement schemes and its potential enhancements on cache hit ratio and latency reduction. In this paper we propose a new document placement scheme, called the Expiration Age based scheme (EA scheme), which takes into account the contentions at individual caches in order to limit the replication of documents within a cache group and increase document hit ratio. The main idea of this new scheme is to view the aggregate disk space of the cache group as a global resource of the group, and uses the concept of cache expiration age to measure the contention of individual caches. The decision of whether to cache a document at a proxy is made collectively, among the caches that already have a copy of this document. The experiments show that the EA scheme yields higher hit rates and better response times compared to the existing document placement schemes used in most of the caching proxies.

关键词： Cooperative caching Internet Delay Aggregates Protocols Educational institutions Collaborative work Telecommunication traffic distributed computing

来源：评论

学校读者我要写书评

暂无评论

Enhancing the security of block ciphers with the aid of parallel substitution box construction

Enhancing the security of block ciphers with the aid of para...

引用

international conference on distributed computing Systems Workshop

作者： P. Nastou Y.C. Stamatiou Atmel Hellas S.A. Athens Greece Department of Computer Engineering and Informatics University of Patras Patras Greece

When considering block cipher designs, one feature that is seemingly not related to their robustness of a design is algorithmic variability, i.e. the ability to effect changes on a design that essentially leave its structure unchanged while they modify its functional characteristics. This feature, however, is related to robustness as there are situations where a specific algorithm is either suspected to be under cryptanalytic attack or it is not considered secure any more due to a discovered weakness. The easiest action would be to change the characteristics of the algorithm in a way that obscures the cryptanalytic attack or that eliminates the cipher's weaknesses. Our focus is on this kind of changes, using as a specific case the CAST-128 cipher The changes we consider refer to the algorithm's substitution boxes and since the creation of good substitution boxes is a highly time consuming process, we also provide a parallel algorithm for completing this task quickly.

关键词： Cryptography Concurrent computing Algorithm design and analysis Parallel algorithms distributed computing Design engineering Electronic mail Robustness Field programmable gate arrays Computer security

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共165页 << < 149 150 151 152 153 154 155 156 157 158 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：