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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,021 篇 会议
92 篇 期刊文献
52 册 图书

馆藏范围

7,165 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,954 篇 工学
- 3,402 篇 计算机科学与技术...
- 1,562 篇 信息与通信工程
- 1,421 篇 软件工程
- 1,051 篇 电气工程
- 241 篇 控制科学与工程
- 123 篇 电子科学与技术（可...
- 91 篇 网络空间安全
- 76 篇 动力工程及工程热...
- 74 篇 仪器科学与技术
- 64 篇 生物工程
- 52 篇 机械工程
- 35 篇 安全科学与工程
- 34 篇 建筑学
- 34 篇 土木工程
- 33 篇 测绘科学与技术
- 31 篇 生物医学工程（可授...
- 30 篇 交通运输工程
560 篇 管理学
- 412 篇 管理科学与工程(可...
- 186 篇 图书情报与档案管...
- 141 篇 工商管理
517 篇 理学
- 314 篇 数学
- 94 篇 物理学
- 73 篇 生物学
- 71 篇 系统科学
- 66 篇 统计学（可授理学、...
100 篇 法学
- 52 篇 社会学
- 49 篇 法学
63 篇 医学
- 37 篇 基础医学(可授医学...
- 31 篇 公共卫生与预防医...
42 篇 经济学
- 41 篇 应用经济学
26 篇 文学
23 篇 教育学
12 篇 农学
6 篇 军事学
2 篇 艺术学

主题

1,159 篇 distributed comp...
419 篇 software enginee...
363 篇 cloud computing
361 篇 artificial intel...
312 篇 computer archite...
306 篇 computer network...
274 篇 social networkin...
270 篇 protocols
247 篇 computer science
231 篇 computational mo...
221 篇 wireless sensor ...
210 篇 scalability
205 篇 peer to peer com...
204 篇 resource managem...
195 篇 routing
190 篇 bandwidth
189 篇 servers
188 篇 application soft...
181 篇 distributed data...
166 篇 grid computing

机构

110 篇 beijing univ pos...
88 篇 state key labora...
12 篇 department of co...
11 篇 college of compu...
10 篇 tsinghua univers...
10 篇 poznan supercomp...
10 篇 school of comput...
10 篇 department of co...
10 篇 beijing universi...
9 篇 inria
9 篇 beijing universi...
9 篇 research institu...
9 篇 rissho universit...
9 篇 tsinghua univ pe...
9 篇 institute of net...
9 篇 school of cyber ...
9 篇 institute of com...
8 篇 georgia inst tec...
8 篇 department of co...
8 篇 institute of net...

作者

25 篇 yang yang
16 篇 huang lican
16 篇 lican huang
14 篇 wehrle klaus
13 篇 gao zhipeng
12 篇 dustdar schahram
12 篇 buyya rajkumar
12 篇 rothermel kurt
11 篇 duerr frank
11 篇 wu jan-jan
11 篇 rajkumar buyya
11 篇 wang wei
11 篇 liu pangfeng
11 篇 teruhisa hochin
11 篇 qi qi
10 篇 ming chen
10 篇 hoefler torsten
10 篇 m. takizawa
10 篇 cheng shiduan
10 篇 schahram dustdar

语言

7,086 篇 英文
47 篇 中文
35 篇 其他

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

共 7165 条记录，以下是4851-4860 订阅

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

详细简洁

排序：

Self-Adaptable and Intrusion Tolerant Certificate Authority for Mobile Ad Hoc Networks

Self-Adaptable and Intrusion Tolerant Certificate Authority ...

引用

international conference on Advanced Information networking and Applications (AINA)

作者： Fernando Carlos Pereira Joni da Silva Fraga Ricardo Felipe Custódio Departamento de Automacçãoe Sistemas Universidade Federal de Santa Catarina Brazil Laboratório de Seguranc-a em Computação Universidade Federal de Santa Catarina Brazil

Dynamic distributed systems like peer-to-peer systems, overlay networks and mobile ad hoc networks must execute their applications using distributed resources and in a decentralized way. The structure (composition and topology) of these systems changes frequently due to nodes joining or leaving the network, or due to mobility, faults and networks partitions. distributed algorithms projected to this class of systems must be able to deal with the occurrence of these events and to self-adapt dynamically the application according to changes in its execution environment. In this paper, we propose a dynamic, self-adaptable and intrusion tolerant certificate authority (CA) designed to operate in mobile ad hoc networks. This CA is composed by a set of mobile devices present in the network, which forms a group of servers that supports CA functions. This architecture is based on a dynamic systems model and was conceived to manage changes in the membership of the servers group. This paper introduces an algorithmic base that allows the CA to reconfigure itself, guaranteeing the availability and the inviolability of the certification service.

关键词： Mobile ad hoc networks Peer to peer computing Certification Mobile computing distributed computing distributed algorithms Network servers Cryptography Computer networks Network topology

来源：评论

学校读者我要写书评

暂无评论

A Fully distributed P2P Communications Architecture for Network Virtual Environments

A Fully Distributed P2P Communications Architecture for Netw...

引用

international conference on Wireless Communications, networking and Mobile computing (WiCom)

作者： Yan Wang ZhaoKui Li Weijia Zhang College of Computer Science Shenyang AeroSpace University Shenyang China College of Resources and Environment North China University of Water Resources and Electric Power Zhengzhou China

distributed Network Virtual Environments (NVEs) are becoming more and more popular in today's computing and communications. The scalability of NVEs is an important problem, and faces many challenges. Voronoi-based Overlay Network (VON) has been proposed that promises to maintain the P2P topology in a fully-distributed, low-latency, and message-efficient manner. However, since node heterogeneity in VON does not be considered, communication and message exchange cannot be regulated properly. Additionally, as nodes need to connect to all of their AOI neighbors directly, if there are too many AOI neighbors the transmission size will be too big to transfer in time. Even packet loss can generate in certain some nodes. To these problems, a fully distributed P2P communications architecture for Network Virtual Environments is presented. The architecture calculates optimal AOI-radii according to node ability, and the node crowding may be avoided to a great extent. In constructing multicast tree, node's fan-out is selected based on node's degree in theory which can be calculated by node ability. The child node degrees can be adjusted dynamically in system, and the nodes can balance message load independently based node load. The simulation results show that the algorithm gains a greater improvement on multicast efficiency, and achieves better scalability.

关键词： Peer to peer computing Bandwidth Virtual environments Neodymium Scalability Educational institutions Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Attack-resistant techniques in P2P reputation systems

Attack-resistant techniques in P2P reputation systems

引用

international conference on networking and Digital Society, ICNDS

作者： Xiaoning Jiang Lingxiao Ye Information and Electronic Engineering Institute Zhejiang Gongshang University Hangzhou China

ISBN: (纸本)9781424451623;9781424451616

The success of a reputation system depends on accurately calculated reputations that predict the quality of future interactions. In the peer-to-peer (P2P) networks, the scores are distributed by each peer locally or managed by the server/super-nodes. Similar to all other security mechanisms, reputation systems in P2P networks can be under attacks. Some attacks may attempt to exploit the system to its own benefits by deceiving or misleading. This paper focuses on trust model based on both direct and indirect feedbacks. The attacks-defense mechanisms by the trust model with credibility and community context factors are also explored.

关键词： Peer to peer computing Feedback Network servers Access protocols Electronic mail Communication system security distributed computing Context modeling Content management Product development

来源：评论

学校读者我要写书评

暂无评论

Increasing Awareness in Collaborative Authoring through Edit Profiling

Increasing Awareness in Collaborative Authoring through Edit...

引用

international conference on Collaborative computing: networking, Applications and Worksharing (CollaborateCom)

作者： S. Papadopoulou C. Ignat G. Oster M. Norrie Department of Computer Science ETH Zurich Switzerland

Awareness of the activities of other users and also document evolution is an important part of collaborative authoring. We introduce the concept of an editing profile that can be used to maintain and visualise measures of the changes made across a document by different users in both synchronous and asynchronous collaborative editing. It provides a simple means of making users aware of "hot areas" and also who is or has been active in various parts of the document, as well as a quick access point into parts of the document that have been changed. The profile can be adapted to display the most relevant information based on both user preference and situation

关键词： Collaboration Collaborative work Visualization Computer science Displays Authoring systems distributed computing Usability Radar Merging

来源：评论

学校读者我要写书评

暂无评论

An investigation of network support for grid middleware and applications

An investigation of network support for grid middleware and ...

引用

international conference on Information, Communications and Signal Processing

作者： Y.F. Wong C.Y. Wong L.H. Ngoh W.C. Wong Computer Center National University of Singapore Singapore Institute for Infocomm Research Singapore

Owing to the rapidly growing interests and excitement in distributed computing and grid-enabled applications, the facilitating middleware layer has become a center of attention in recent years. At the same time, rapid advances in networking technologies such as the resilient packet ring (RPR) have evolved to carry all kinds of information including data, voice, multimedia and now, grid applications. However, little studies have been made to discover the interactions between grid middleware and the network layer. This paper therefore investigates the degree of which grid middleware design takes advantage of the underlying networking resources and features.

关键词： Middleware Testing Application software Grid computing Linux distributed computing Ethernet networks Optical fiber networks Delay effects Throughput

来源：评论

学校读者我要写书评

暂无评论

Operator placement for efficient distributed complex event processing in MANETs

Operator placement for efficient distributed complex event p...

引用

IEEE international conference on Wireless and Mobile computing, networking And Communications (WiMob)

作者： Fabrice Starks Thomas Peter Plagemann Department of Informatics University of Oslo Oslo Norway

Complex Event Processing (CEP) and Mobile Adhoc networks (MANETs) are two technologies that can be used to enable monitoring applications for Emergency and Rescue missions (ER). MANETs are characterized by energy limitations, and in-network processing or distributed CEP is one possible solution. Operator placement mechanism for distributed CEP has a direct impact on energy consumption. Existing operator placement mechanisms focus on static network topologies and are therefore inappropriate for MANETs scenarios. We propose a novel energy efficient decentralized distributed placement mechanism, designed to achieve fast convergence with minimal data transmission cost while achieving a near optimal placement assignment. We compare our decentralized placement mechanism with a centralized approach under different mobility scenarios. Furthermore, we evaluate the distributed CEP under different workload scenarios in order to gain additional insight into different performance characteristics of the system. Finally, we measure the impact of a simple placement replication scheme on the overall system performance in terms of delay and message overhead. Our decentralized placement mechanism achieves up to almost 50% lower message overhead compared to the centralized approach, and it has lower message overhead across different mobility scenarios compared to the centralized approach. The placement replication scheme achieves up to 51% lower delay compared to the decentralized placement mechanism with no replication.

关键词： Mobile computing Ad hoc networks Relays Erbium Network topology Mobile nodes

来源：评论

学校读者我要写书评

暂无评论

Request distribution with pre-learning for distributed SSL reverse proxies

Request distribution with pre-learning for distributed SSL r...

引用

ACIS international conference on Software Engineering, Artificial Intelligence, networking, and Parallel/distributed computing (SNPD)

作者： Haitao Dong Jun Yang Yiqiang Sheng Key Laboratory of Noise and Vibration Research Institute of Acoustics Chinese Academy of Sciences Beijing China National Network New Media Engineering Research Center Chinese Academy of Sciences Beijing China

As network data security becoming more and more universalized, distributed Secure Sockets Layer (SSL) reverse proxies are often used in Web systems to offload CPU exhausting SSL operations from Web servers and improve the execution performance of the SSL protocol. The distribution strategy of user requests to the SSL reverse proxies is a significant factor affecting the system's performance in processing SSL operations. Aiming at improving the quality of request distribution decisions, this paper proposes a new approach for SSL reverse proxy load estimation, i.e. the family of algorithms called Load Estimation with Pre-Learning (LEPL), which estimates load using pre-learned machine learning models. Using LEPL, high accuracy of load estimation can be achieved, so that better request distribution decisions can be made. Our experimental results show that by using pre-learning, the SSL reverse proxy system's average response time can be shortened by about 30% - 50%.

关键词： Estimation Load modeling Algorithm design and analysis Machine learning algorithms Real-time systems Decision trees Training

来源：评论

学校读者我要写书评

暂无评论

Data Structures for Routing Table of the distributed Key-Value Store Based on Order Preserving Linear Hashing and Skip Graph with the Load Balancing Method

Data Structures for Routing Table of the Distributed Key-Val...

引用

Summer Virtual conference on Software Engineering, Artificial Intelligence, networking and Parallel/distributed computing (SNPD-Summer), ACIS international

作者： Ken Higuchi Ami Miyazaki Kenya Hasegawa Tatsuo Tsuji Center for Data Science and Artificial Intelligence University of Fukui Fkui Japan School of Engineering University of Fukui Fkui Japan

ISBN: (纸本)9798350396386

In this paper, data structures for reducing redundancy of routing information on the distributed key-value store based on order preserving linear hashing and Skip Graph with the load balancing method are proposed and evaluated. In this system, data are divided by order preserving linear hashing and Skip Graph is used for overlay network. For load balancing, by storing many Skip Graph nodes in one physical node, any highest-load Skip Graph can be divided. By this method, load balancing can be done. But the number of Skip Graph nodes becomes very many and redundant routing information exists. But this redundant routing information has regularity. In this paper, two types of data structure for reducing redundant routing elements are proposed. They are tree structure and array structure. By calculating space for them and searching time, the proposed data structures are experimentally evaluated.

关键词： Overlay networks Redundancy Routing Load management Arrays Artificial intelligence Software engineering

来源：评论

学校读者我要写书评

暂无评论

How to survive and thrive in a private bittorrent community

How to survive and thrive in a private bittorrent community

引用

14th international conference on distributed computing and networking, ICDCN 2013

作者： Jia, Adele Lu Chen, Xiaowei Chu, Xiaowen Pouwelse, Johan A. Epema, Dick H. J. Department of Computer Science Delft University of Technology Netherlands Department of Computer Science Hong Kong Baptist University Hong Kong

ISBN: (纸本)9783642356674

Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute. It has been demonstrated that communities that adopt SRE are greatly oversupplied, i.e., they have much higher seeder-to-leecher ratios than communities in which SRE is not employed. Most previous studies focus on showing the positive effect of SRE in achieving high downloading speed. However, in this paper we show through measurements that SRE also induces severe side-effects. Under SRE, users are forced to seed for excessively long times to maintain adequate sharing ratios to be able to start new downloads, though most of the time their seedings are not very productive (in terms of low upload speed). We also observe that many users who seed for very long times still have low sharing ratios. We find that this is due to the counter-intuitive phenomenon that long seeding times do not necessarily lead to large upload amounts. Based on these observations, we discuss possible strategies for users to gain sharing ratios efficiently, which help them to survive and thrive in private communities. © Springer-Verlag 2013.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Session: distributed computing and networking 3

Session: Distributed computing and networking 3

引用

IEEE international conference on Intelligent Computer Communication and Processing (ICCP)

Start of the above-titled section of the conference proceedings record.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 482 483 484 485 486 487 488 489 490 491 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：