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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是2501-2510 订阅

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

详细简洁

排序：

Sharing and multiplexing of downlink traffic resources in mobile packet data networks

Sharing and multiplexing of downlink traffic resources in mo...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Chen-Nien Tsai Institute of Computer Science and Information Engineering National Taipei University of Technology

this paper studies the radio resource allocation for GPRS (general packet radio service) and GSM (global systems for mobile communications) on downlink traffic. We proposed an allocation strategy with partial time-slot sharing and complete radio-block sharing simultaneously. the radio-block based allocation strategy can characterize the practical multiplexing scheme for GPRS. We assumed that the system supports two classes of GPRS mobile terminals with different bandwidth requirements. We also assumed that the system can handle both new call and handover call for GSM requests. By both theoretical analysis and through computer simulation, the result showed that the proposed time-slot and radio-block based resource allocation strategy offers high utilization as well as low blocking probability to GPRS users under various traffic loadings.

关键词： Downlink Telecommunication traffic Intelligent networks Ground penetrating radar GSM Resource management Time division multiple access Mobile computing Computer science Data engineering

来源：评论

学校读者我要写书评

暂无评论

An application-level multicast framework for large scale VOD services

An application-level multicast framework for large scale VOD...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Chen-Lung Chan Shih-Yu Huang Hung-Hsuan Chen Wei-Hao Tung Jia-Shung Wang Department of Computer Science National Tsing Hua University Taiwan Department of Computer Science and Information Engineering Ming Chuan University Taiwan

this paper proposes an application-level multicast framework based on peer-to-peer communications to improve performance of large scale VOD services. Since the deployment of multicast-enabled network is still not popular nowadays, developing an application-level multicast infrastructure to support multicast delivery would be a good alternative. We address the problems associated with heterogeneous clients and formulate the model of multicast streaming in a VOD service. the proposed multicast framework takes these results into account to reduce server load and network bandwidth. the simulation results demonstrate that our framework can satisfy at lest 40,000 viewers concurrently by utilizing only 70 MB of buffer on each peer node.

关键词： Large-scale systems Peer to peer computing Streaming media Network servers Delay Computer science Bandwidth System performance Performance analysis Web server

来源：评论

学校读者我要写书评

暂无评论

Peer Collaboration Modes and Private Room Services in TOMSCOP

Peer Collaboration Modes and Private Room Services in TOMSCO...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： K. Nakanishi T. Aonuma Jianhua Ma Jeneung Lee Faculty of Computer and Information Sciences Hosei University Tokyo Japan

this paper presents the implementation of peer group management services in a pure P2P groupware framework called TOMSCOP (technology of multiuser synchronous collaboration platform). To support a variety of computer-based collaborative activities and styles, a user in a group can be assigned a role or identity such as a discusser peer, a chair peer, a presenter peer, a player peer, or an observer peer-Based on the above identities and their control service, we developed three collaboration modes, i.e., discussion mode, presentation mode and rotation mode, for smoothly manipulating shared applications in their different usages. Moreover we designed and implemented the public and private room services for users to create suitable collaboration rooms that match theirs privacy requirements. these modes and services not only provide more functions to TOMSCOP users, but also support software developers for easily and flexibly making P2P shared applications with different purposes

关键词： Collaboration Topology Collaborative software Peer to peer computing Collaborative work Collaborative tools Application software Technology management Privacy Message passing

来源：评论

学校读者我要写书评

暂无评论

An on-line page-structure approximation scheme for Web proxies

An on-line page-structure approximation scheme for Web proxi...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Jiunn-Jye Lee Pan-Lung Tsai Chin-Laung Lei Department of Electrical Engineering National Taiwan University Taiwan

To render a Web page, a browser must first download an HTML document, parse it, and then issue a sequence of additional requests to fetch the embedded objects according to the content of the HTML document. therefore, it should be straightforward for Web proxies to accurately predict future client requests by considering the characteristics of such regular behavior. However, the strong bindings between embedded objects and their containing documents are often ignored by modern Web proxies because there still exists no efficient solution for Web proxies to obtain the knowledge of page structures without performing the computation-intensive operations of HTML parsing. In this paper, we propose an effective and low-overhead scheme for Web proxies to approximate page structures and refine the approximation as new client requests arrive. the results of simulation show that the approximation converges quickly and reaches high accuracy after a relatively small number of incoming requests have been processed.

关键词： Web server Web pages HTML Pattern matching Uniform resource locators Containers Predictive models Embedded computing Computational modeling Content based retrieval

来源：评论

学校读者我要写书评

暂无评论

I/O processor allocation for mesh cluster computers

I/O processor allocation for mesh cluster computers

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Pangfeng Liu Chun-Chen Hsu Jan-Jan Wu Department of Computer Science and Information Engineering National Taiwan University Taiwan Institute of Information Science Academia Sinica Taiwan

As cluster systems become increasingly popular, more and more parallel applications require need not only computing power but also significant I/O performance. However, the I/O subsystem has become the bottleneck of the overall system performance for years due to slower improvement of the second storage devices. In recent years parallel I/O has drawn an increasing attention as a promising approach to eliminate this bottleneck. To improve I/O efficiency of a cluster system computation tasks must be carefully assigned to processors, so that the communication overheads within the group the processors of the task, and those I/O traffics that connect processors of the task to I/O system are both optimized. Earlier processor allocation strategies considered the optimization of communication traffic or I/O traffic only. Since both the communication and I/O traffic can cause network contention, we develop a set of binary tree based algorithms to address the issues of both communication and I/O traffics simultaneously. the experimental results indicate that for tasks that have different mixture of communication and I/O traffics, our algorithms have very good performance in terms of overall parallel I/O efficiency. We also developed two mathematical evaluating criteria - "compactness" and "spatial compactness", to determine the fitness of allocation algorithms in terms of geometrical adjacency of processors.

关键词： Telecommunication traffic Computer networks Power engineering computing Computer science Power engineering and energy Information science Application software Concurrent computing System performance Binary trees

来源：评论

学校读者我要写书评

暂无评论

An efficient placement and routing technique for fault-tolerant distributed embedded computing

An efficient placement and routing technique for fault-toler...

引用

IEEE international conference on Embedded and Real-Time computing Systems and Applications (RTCSA)

作者： R. Jafari F. Dabiri M. Sarrafzadeh Computer Science Department University of California Los Angeles CA USA

this paper presents an efficient technique for placement and routing of sensors/actuators and processing units in a grid network. the driver application that we present is a medical jacket which requires an extremely high level of robustness and fault tolerance. the power consumption of such jacket is another key technological constraint. Our proposed interconnection network is a mesh of wires. A jacket made of fabric and wires would be susceptible to accidental damage via tears. By modeling the tears, we evaluate the probability of having failures on every segment of wires in our mesh interconnection network. then we study two problems of placement and routing in the sensor networks such that the fault tolerance is maximized while the power consumption is minimized. We develop efficient integer linear programming (ILP) formulations to address these problems and perform both placement and routing simultaneously. this ensures that the solution is a lower bound for both problems. We evaluate the effectiveness of our proposed techniques on a variety of benchmarks.

关键词： Routing Fault tolerance Embedded computing Wires Energy consumption Multiprocessor interconnection networks Actuators Robustness Fabrics Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multiple Sequence Alignment on an FPGA

Multiple Sequence Alignment on an FPGA

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： T. Oliver B. Schmidt D. Maskell D. Nathan R. Clemens School of Computer Engineering Nanyang Technological University Singapore Project Proteus School of Engineering Ngee Ann Polytechnic Singapore

Molecular biologists frequently compute multiple sequence alignments (MSAs) to identify similar regions in protein families. Progressive alignment is a widely used approach to compute MSAs. However, aligning a few hundred sequences by popular progressive alignment tools requires several hours on sequential computers. Due to the rapid growth of biological sequence databases biologists have to compute MSAs in a far shorter time. In this paper we present a new approach to MSA on reconfigurable hardware platforms to gain high performance at low cost. To derive an efficient mapping onto this type of architecture, fine-grained parallel processing elements (PEs) have been designed. Using this PE design as a building block we have constructed a linear systolic array to perform a pairwise sequence distance computation using dynamic programming. this results in an implementation with significant runtime savings on a standard off-the-shelf FPGA

关键词： Field programmable gate arrays Biology computing Proteins Databases Hardware Performance gain Costs Computer architecture Parallel processing Systolic arrays

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Node Degree Management Scheme for Energy-efficient Routing Protocols in Wireless Ad Hoc Networks

A Dynamic Node Degree Management Scheme for Energy-efficient...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： Yi-Cheng Huang Sheng-Yan Chuang Sheng-De Wang Department of Electrical Engineering National Taiwan University Taipei Taiwan

In mobile devices, the battery-based power is a precious resource. To maximize the network lifetime becomes a challenge issue in MANETs. We found that transmission collision is a problem which affects the energy saving much. If we can reduce the numbers of the transmission collision, we save more power. In this paper, we propose a new mechanism to address this problem and hence prolong network lifetime. Our approach, based on relative neighborhood graph (RNG), adjusts the transmission range according to the degree of the node which is only based on local information. We also suggest appropriate transmission power ranges to some routing protocols such as AODV, DSR and BELLMAN-FORD. Simulation results show that a great improvement of the energy saving for those routing protocols when comparing with the performance of those protocols without applying our mechanism

关键词： Energy management Energy efficiency Routing protocols Intelligent networks Ad hoc networks Energy consumption Broadcasting Peer to peer computing Mobile ad hoc networks Batteries

来源：评论

学校读者我要写书评

暂无评论

P-Hera: scalable fine-grained access control for P2P infrastructures

P-Hera: scalable fine-grained access control for P2P infrast...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： B. Crispo S. Sivasubramanian P. Mazzoleni E. Bertino Department of Computer Science Vrije Universiteit Amsterdam Netherlands Department of Computer Science University of Milan Italy Department of Computer Science Purdue University and Cerias USA

In this paper, we present P-Hera, a peer-to-peer (P2P) infrastructure for scalable and secure content hosting. P-Hera allows the users and content owners to dynamically establish trust using fine-grained access control. In P-Hera, resource owners can specify fine-grained restrictions on who can access their resources and which user can access which part of data. We differentiate our work with traditional works of fine-grained access control on Web services, as our system in addition to handling access constraints of the service provider (which is the case in Web services), it also handles security constraints regarding actions performed on data: replication and modification. We believe this is of immense significance for wide-range of applications such as data grids, information grids and Web content delivery networks. In addition to presenting the overall system architecture, we also study the problem of evaluating these fine-grained access policies in depth and propose a novel means of organizing these policies that can result in faster evaluation. We demonstrate the effectiveness of our approach using prototype implementation.

关键词： Access control Computer science Peer to peer computing Grid computing Web services Information security Carbon capture and storage Data security Organizing Prototypes

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Flooding in MANETs in the Presence of Multi-Broadcast Traffic

Performance Evaluation of Flooding in MANETs in the Presence...

引用

international conference on Parallel and distributed Systems (ICPADS)

作者： M.B. Yassein M. Ould-Khaoua S. Papanastasiou Department of Computing Science University of Glasgow Glasgow Glasgow UK University of Glasgow Glasgow Glasgow GB

Broadcasting has many important uses and several mobile ad hoc networks (MANETs) protocols assume the availability of an underlying broadcast service. Applications, which make use of broadcasting, include LAN emulation, paging a particular node. However, broadcasting induces what is known as the "broadcast storm problem" which causes severe degradation in network performance, due to excessive redundant retransmission, collision, and contention. Although probabilistic flooding has been one of the earliest suggested approaches to broadcasting. there has not been so far any attempt to analyse its performance behaviour in MANETs. this paper investigates using extensive ns-2 simulations the effects of a number of important parameters in a MANET, including node speed, pause time and, traffic load, on the performance of probabilistic flooding. the results reveal that while these parameters have a critical impact on the reachability achieved by probabilistic flooding, they have relatively a lower effect on the number of saved rebroadcast packets

关键词： Mobile ad hoc networks Broadcasting Telecommunication traffic Storms Routing protocols Computer networks Availability LAN emulation Degradation Performance analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共276页 << < 247 248 249 250 251 252 253 254 255 256 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：