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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,698 篇 会议
32 篇 期刊文献
25 册 图书

馆藏范围

2,755 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,681 篇 工学
- 1,476 篇 计算机科学与技术...
- 671 篇 软件工程
- 489 篇 信息与通信工程
- 354 篇 电气工程
- 93 篇 控制科学与工程
- 82 篇 网络空间安全
- 65 篇 生物工程
- 56 篇 电子科学与技术（可...
- 42 篇 动力工程及工程热...
- 39 篇 仪器科学与技术
- 33 篇 机械工程
- 28 篇 建筑学
- 26 篇 交通运输工程
- 26 篇 安全科学与工程
- 25 篇 环境科学与工程（可...
- 24 篇 光学工程
- 20 篇 生物医学工程（可授...
- 17 篇 材料科学与工程（可...
322 篇 理学
- 191 篇 数学
- 67 篇 生物学
- 46 篇 系统科学
- 45 篇 统计学（可授理学、...
- 44 篇 物理学
216 篇 管理学
- 143 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 73 篇 工商管理
50 篇 法学
- 34 篇 社会学
28 篇 医学
- 21 篇 临床医学
- 17 篇 基础医学(可授医学...
23 篇 经济学
- 20 篇 应用经济学
14 篇 教育学
11 篇 农学
6 篇 文学
3 篇 军事学
2 篇 艺术学

主题

285 篇 distributed comp...
267 篇 cloud computing
135 篇 social networkin...
103 篇 computer archite...
93 篇 protocols
91 篇 computer network...
88 篇 computer science
87 篇 peer to peer com...
82 篇 computational mo...
75 篇 security
69 篇 mobile computing
66 篇 routing
66 篇 servers
61 篇 resource managem...
60 篇 peer-to-peer com...
59 篇 internet of thin...
59 篇 grid computing
57 篇 application soft...
56 篇 quality of servi...
51 篇 software enginee...

机构

29 篇 daffodil interna...
21 篇 beijing univ pos...
13 篇 state key labora...
12 篇 daffodil interna...
10 篇 daffodil interna...
10 篇 shandong provinc...
8 篇 institute of com...
8 篇 school of inform...
5 篇 shenyang institu...
5 篇 tokyo denki univ...
5 篇 rissho universit...
5 篇 department of co...
4 篇 univ chinese aca...
4 篇 nokia research c...
4 篇 beijing univ pos...
4 篇 center for compu...
4 篇 university of ch...
4 篇 hosei univ
4 篇 department of co...
4 篇 department of co...

作者

12 篇 abujar sheikh
12 篇 hossain syed akh...
12 篇 sheikh abujar
11 篇 syed akhter hoss...
8 篇 masum abu kaisar...
8 篇 abu kaisar moham...
7 篇 wehrle klaus
7 篇 dustdar schahram
7 篇 kao odej
7 篇 buyya rajkumar
6 篇 m. takizawa
6 篇 yang yang
6 篇 t. enokido
6 篇 wang ying
6 篇 rothermel kurt
5 篇 wu budan
5 篇 wirtz hanno
5 篇 truong hong-linh
5 篇 ramachandran k.i...
5 篇 bhuiyan md. rafi...

语言

2,731 篇 英文
17 篇 其他
5 篇 中文
2 篇 法文

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

共 2755 条记录，以下是2581-2590 订阅

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

详细简洁

排序：

Mobile distributed information retrieval for highly-partitioned networks

Mobile distributed information retrieval for highly-partitio...

引用

international conference on Network Protocols

作者： K.M. Hanna B.N. Levine R. Manmatha Department of Computer Science University of Massachusetts Amherst MA USA

We propose and evaluate a mobile, peer-to-peer information retrieval system. Such a system can, for example, support medical care in a disaster by allowing access to a large collections of medical literature. In our system, documents in a collection are replicated in an overlapping manner at mobile peers. this provides resilience in the face of node failures, malicious attacks, and network partitions. We show that our design manages the randomness of node mobility. Although nodes contact only direct neighbors (who change frequently) and do not use any ad hoc routing, the system maintains good IR performance. this makes our design applicable to mobility situations where routing partitions are common. Our evaluation shows that our scheme provides significant savings in network costs, and increased access to information over ad-hoc routing-based approaches; nodes in our system require only a modest amount of additional storage on average.

关键词： Information retrieval Peer to peer computing Routing protocols Mobile computing Mobile communication Network servers Computer networks Robustness Computer science Resilience

来源：评论

学校读者我要写书评

暂无评论

Ulysses: a robust, low-diameter, low-latency peer-to-peer network

Ulysses: a robust, low-diameter, low-latency peer-to-peer ne...

引用

international conference on Network Protocols

作者： A. Kumar S. Merugu Jun Xu Xingxing Yu College of Computing Georgia Institute of Technology USA School of Mathematics Georgia Institute of Technology USA

A number of distributed hash table (DHT)-based protocols have been proposed to address the issue of scalability in peer-to-peer networks. In this paper, we present Ulysses, a peer-to-peer network based on the butterfly topology that achieves the theoretical lower bound of (log n)/(log log n)on network diameter when the average routing table size at nodes is no more than log n. Compared to existing DHT-based schemes with similar routing table size, Ulysses reduces the network diameter by a factor of log log n. which is 2-4 for typical configurations. this translates into the same amount of reduction on query latency and average traffic per link/node. In addition, Ulysses maintains the same level of robustness in terms of routing in the face of faults and recovering from graceful/ungraceful joins and departures, as provided by existing DHT-based schemes. the performance of the protocol has been evaluated using both analysis and simulation.

关键词： Robustness Peer to peer computing Routing Protocols Scalability Network topology Delay Telecommunication traffic Traffic control Performance analysis

来源：评论

学校读者我要写书评

暂无评论

On the topology of overlay-networks

On the topology of overlay-networks

引用

IEEE international conference on Networks

作者： T. Fuhrmann Institut für Telematik Universität Karlsruhe Germany

Random-graph models are about to become an important tool in the study of wireless ad-hoc and sensor-networks, peer-to-peer networks, and, generally, overlay-networks. Such models provide a theoretical basis to assess the capabilities of certain networks, and guide the design of new protocols. Especially the recently proposed models for so-called small-world networks receive much attention from the networking community. this paper proposes the use of two more mathematical concepts for the analysis of network topologies, dimension and curvature. these concepts can intuitively be applied to, e.g., sensor-networks. But they can also be sensibly defined for certain other random-graph models. the latter is non-trivial since such models may describe purely virtual networks that do not inherit properties from an underlying physical world. Analysis of a random-graph model for Gnutella-like overlay-networks yields strong indications that such networks might be characterized as a sphere with fractal dimension.

关键词： Network topology Peer to peer computing Wireless sensor networks Protocols IP networks Performance analysis Fractals Resilience Communication networks Power generation economics

来源：评论

学校读者我要写书评

暂无评论

Evaluation of content-access QoS for various dissemination strategies in peer to peer networks

Evaluation of content-access QoS for various dissemination s...

引用

IEEE international conference on Networks

作者： L. Lancerica L. Dairaine J. Lacan Ecole Nationale Supérieure dIngénieurs de Construction Aéronautique ENSICA Toulouse France

ISBN: (纸本)0780377885

Peer to peer (P2P) Network is a high level logical network architecture build over end-user nodes interconnected by a physical network infrastructure. the main interest of their distributed structure is to avoid any centralized point. However, this structure makes difficult the evaluation of the global properties of the network. In the present effort, we propose a method to evaluate quality of service (QoS) for the content access in P2P networks. this method, based on bandwidth distribution evaluation, allows determining statistical content-access QoS guarantees in function of both the level of content replication in the network and the strategies of file dissemination. An implementation of this model, based on real bandwidth measurements on the Gnutella network, is proposed. three dissemination strategies are evaluated: simple file replication, block file replication, and erasure-encoded (often called forward error correction (FEC) code) block replication. the results shows that statistical QoS guarantees can be provided by controlling the various dissemination parameters, and illustrates the interest of the FEC-based strategy. A simple application in the context of media streaming is finally proposed.

关键词： Intelligent networks Peer to peer computing Quality of service Bandwidth Network servers Forward error correction Streaming media Computer networks Routing Memory

来源：评论

学校读者我要写书评

暂无评论

On the utility of distributed cryptography in P2P and MANETs: the case of membership control

On the utility of distributed cryptography in P2P and MANETs...

引用

international conference on Network Protocols

作者： M. Narasimha G. Tsudik Jeong Hyun Yi School of Information and Computer Science University of California Irvine USA

Peer-to-peer systems enable efficient resource aggregation and are inherently scalable since they do not depend on any centralized authority. However, lack of a centralized authority prompts many security-related challenges. Providing efficient security services in these systems is an active research topic which is receiving much attention in the security research community. In this paper, we explore the use of threshold cryptography in peer-to-peer settings (both Internet- and MANET-based) to provide, in a robust and fault tolerant fashion, security services such as authentication, certificate issuance and access control. threshold cryptography provides high availability by distributing trust throughout the group and is, therefore, an attractive solution for secure peer-groups. Our work investigates the applicability of threshold cryptography for membership control in peer-to-peer systems. In the process, we discover that one interesting proposed scheme contains an unfortunate (yet serious) flaw. We then present an alternative solution and its performance measurements. More importantly, our preliminary work casts a certain degree of skepticism on the practicality and even viability of using (seemingly attractive) threshold cryptography in certain peer-to-peer settings.

关键词： Cryptography Peer to peer computing Security Web and internet services Robust control Fault tolerance Authentication Access control Availability Control systems

来源：评论

学校读者我要写书评

暂无评论

Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach

Establishing pairwise keys for secure communication in ad ho...

引用

international conference on Network Protocols

作者： Sencun Zhu Shouhuai Xu Sanjeev Setia Sushil Jajodia Center for Secure Information Systems George Mason University Fairfax VA USA Department of Computer Science University of Texas San Antonio San Antonio TX USA University of California Irvine USA

ISBN: (纸本)0769520243

A prerequisite for a secure communication between two nodes in an ad hoc network is that the nodes share a key to bootstrap their trust relationship. In this paper, we present a scalable and distributed protocol that enables two nodes to establish a pairwise shared key on the fly, without requiring the use of any on-line key distribution center. the design of our protocol is based on a novel combination of two techniques - probabilistic key sharing and threshold secret sharing. Our protocol is scalable since every node only needs to possess a small number of keys, independent of the network size, and it is computationally efficient because it only relies on symmetric key cryptography based operations. We show that a pairwise key established between two nodes using our protocol is secure against a collusion attack by up to a certain number of compromised nodes. We also show through a set of simulations that our protocol can be parameterized to meet the desired levels of performance, security and storage for the application under consideration.

关键词： Intelligent networks Ad hoc networks Peer to peer computing Cryptographic protocols Public key cryptography Network servers Computer science Computer networks Secure storage Information systems

来源：评论

学校读者我要写书评

暂无评论

A comparison of TCP automatic tuning techniques for distributed computing

A comparison of TCP automatic tuning techniques for distribu...

引用

11th IEEE international Symposium on High Performance distributed computing (HPDC-11)

作者： Weigle, E Feng, WC Los Alamos Natl Lab Comp & Computat Sci Div Los Alamos NM 87545 USA

ISBN: (纸本)0769516866

Rather than painful, manual, static, per-connection optimization of TCP buffer sizes simply to achieve acceptable performance for distributed applications [8, 10], many researchers have proposed techniques to perform this tuning automatically [4, 7, 9, 11, 12, 14]. this paper first discusses the relative merits of the various approaches in theory, and then provides substantial experimental data concerning two competing implementations - the buffer autotuning already present in Linux 2.4.x and "Dynamic Right-Sizing." this paper reveals heretofore unknown aspects of the problem and current solutions, provides insight into the proper approach for different circumstances, and points toward ways to further improve performance.

关键词： dynamic right-sizing autotuning high-performance networking TCP flow control wide-area network

来源：评论

学校读者我要写书评

暂无评论

Dynamic right-sizing in FTP (drsFTP): Enhancing grid performance in user-space 11

Dynamic right-sizing in FTP (drsFTP): Enhancing grid perform...

引用

11th IEEE international Symposium on High Performance distributed computing (HPDC-11)

作者： Gardner, MK Feng, WC Fisk, M Los Alamos Natl Lab Comp & Comp Sci Div Res & Dev Adv Network Technol Los Alamos NM 87545 USA

ISBN: (纸本)0769516866

With the advent of computational grids, networking performance over the wide-area network (WAN) has become a critical component in the grid infrastructure. Unfortunately, many, high-performance grid applications only use a small raction of the available bandwidth because operating systems and their associated protocol stacks are still tuned for yesterday's WAN speeds. As a result, network gurus undertake the tedious process of manually tuning system buffers to allow TCP flow control to scale to today's WAN grid environments. Although recent research has shown how to set the size of these system buffers automatically at connection set-up, the buffer sizes are only appropriate at the beginning of the connection's lifetime. To address these problems, we describe an automated and scalable technique called dynamic right-sizing. We implement this technique in user space (in particular for bulk-data transfer) so that end users do not have to modify the kernel to achieve a significant increase in throughput.

关键词： Automatic control Bandwidth Computer networks Control systems Grid computing Kernel Operating systems Protocols throughput Wide area networks

来源：评论

学校读者我要写书评

暂无评论

Multigrain parallelism for eigenvalue computations on networks of clusters 11

Multigrain parallelism for eigenvalue computations on networ...

引用

11th IEEE international Symposium on High Performance distributed computing (HPDC-11)

作者： McCombs, JR Stathopoulos, A Coll William & Mary Dept Comp Sci Williamsburg VA 23187 USA

ISBN: (纸本)0769516866

Clusters of workstations have become a cost-effective means of performing scientific computations. However, large network latencies, resource sharing, and heterogeneity found in networks of clusters and Grids can impede the performance of applications not specifically tailored for use in such environments. A typical example is the traditional fine grain implementations of Krylov-like iterative methods, a central component in many scientific applications. To exploit the potential of these environments, advances in networking technology must be complemented by advances in parallel algorithmic design. In this paper we present an algorithmic technique that increases the granularity of parallel, block iterative methods by inducing additional work during the preconditioning (inexact solution) phase of the iteration. During this phase, each vector in the block is preconditioned by a different subgroup of processors, yielding a much coarser granularity the rest of the method comprises a small portion of the total time and is still implemented in fine grain. We call this combination of fine an coarse grain parallelism multigrain. We apply this idea to the block Jacobi-Davidson eigensolver and present experimental data that shows the significant reduction of latency effects on networks of clusters of roughly equal capacity and size. We conclude with a discussion on how multigrain can be applied dynamically based on runtime network performance monitoring.

关键词： Computer networks Concurrent computing Delay Eigenvalues and eigenfunctions Impedance Iterative algorithms Iterative methods Parallel processing Resource management Workstations

来源：评论

学校读者我要写书评

暂无评论

Protecting electronic commerce from distributed denial-of-service attacks 02

Protecting electronic commerce from distributed denial-of-se...

引用

11th international conference on World Wide Web, WWW '02

作者： Brustoloni, José Networking Software Research Department Bell Laboratories Lucent Technologies 101 Crawfords Corner Rd. Holmdel NJ 07733 United States

ISBN: (纸本)1581134495

It is widely recognized that distributed denial-of-service (DDoS) attacks can disrupt electronic commerce and cause large revenue losses. However, effective defenses continue to be mostly unavailable. We describe and evaluate VIPnet, a novel value-added network service for protecting e-commerce and other transaction-based sites from DDoS attacks. In VIPnet, e-merchants pay Internet Service Providers (ISPs) to carry the packets of the e-merchants' best clients (called VIPs) in a privileged class of service (CoS), protected from congestion, whether malicious or not, in the regular CoS. VIPnet rewards VIPs with not only better quality of service, but also greater availability. Because VIP rights are client- and server-specific, cannot be forged, are usage-limited, and are only replenished after successful client transactions (e.g., purchases), it is impractical for attackers to mount and sustain DDoS attacks against an e-merchant's VIPs. VIPnet can be deployed incrementally and does not require universal adoption. Experiments demonstrate VIPnet's benefits.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 255 256 257 258 259 260 261 262 263 264 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：