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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,388 篇 工学
- 1,272 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
101 篇 distributed comp...
74 篇 parallel process...
59 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 distributed data...
37 篇 parallel program...
37 篇 grid computing
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
10 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,730 篇 英文
56 篇 其他
15 篇 中文
10 篇 俄文

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1804 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

DCF/USDMA: Enhanced DCF for uplink SDMA transmissions in WLANs

DCF/USDMA: Enhanced DCF for uplink SDMA transmissions in WLA...

引用

international Wireless Communications and Mobile computing conference, IWCMC

作者： Ruizhi Liao Boris Bellalta Miquel Oliver NeTS Research Group Department of Information and Communication Technologies Universitat Pompeu Fabra Barcelona Spain

the traditional IEEE 802.11 DCF allows only one node to access the channel each time. In order to take the benefit of multiple simultaneous uplink transmissions when the AP is equipped with multiple antennas, a new MAC protocol called DCF/USDMA is presented in this paper. DCF/USDMA extends the IEEE 802.11 distributed Coordination Function (DCF) by introducing a second contention round, which is used to accommodate the multiple simultaneous transmissions from multiple stations. Results show that the DCF/USDMA protocol is able to achieve a significant performance gain compared to that of the conventional DCF, the analysis of which also provides some insights about how the different parameters that control the DCF/USDMA operation can be optimized.

关键词： Wireless communication Loaded antennas throughput IEEE 802.11 Standards Transmitting antennas

来源：评论

学校读者我要写书评

暂无评论

Electing a leader in multi-hop radio networks

Electing a leader in multi-hop radio networks

引用

16th international conference on Principles of distributed Systems, OPODIS 2012

作者： Chlebus, Bogdan S. Kowalski, Dariusz R. Pelc, Andrzej Department of Computer Science and Engineering University of Colorado Denver Denver CO 80217 United States Department of Computer Science University of Liverpool Liverpool L69 3BX United Kingdom Département d'Informatique Université du Québec en Outaouais Gatineau QC J8X 3X7 Canada

ISBN: (纸本)9783642354755

We consider the task of electing a leader in a distributed manner in ad hoc multi-hop radio networks. Radio networks represent the class of wireless networks in which one frequency is used for transmissions, network's topology can be represented by a simple undirected graph with some n nodes, and there is no collision detection. We give a randomized algorithm electing a leader in O(n) expected time and prove that this time bound is optimal. We give a deterministic algorithm electing a leader in O(n log3/2 n √log log n) time. By way of application, we show how to perform gossiping with combined messages in O(n log3/2 n√log log n) time by a deterministic algorithm, and in O(n) expected time by a randomized algorithm. © 2012 Springer-Verlag.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional Markov model for throughput analysis of IEEE 802.11 distributed Coordination Function in non ideal channel with capture effects

Two-dimensional Markov model for throughput analysis of IEEE...

引用

international Wireless Communications and Mobile computing conference, IWCMC

作者： Nesreen Alsbou Hazem Refai Department of Electrical and Computer Engineering University of Oklahama Norman OK USA

Wireless technologies are emerging as an important component of our daily life. distributed Coordination Function (DCF) is the basis of IEEE 802.11 WLAN MAC protocol, which uses Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol and binary slotted exponential back-off scheme. DCF implementation specified by the IEEE 802.11 standard reset the contention window (CW) to minimum value upon a successful transmission. Although the newCW is minimal the congestion level goes gradually to minimum, causing the node to probably waste time and channel bandwidth going through several collisions and retransmissions before reaching a CW value corresponds to the congestion level. this paper modifies the implementation to reduce the window to half its size after a successful transmission. the paper uses analytical and simulation analysis to show throughput improvements under ideal and non-ideal channel with channel induced errors and capture effect. When compared to the standard implementation, throughput has improved for both ideal and non ideal channel.

关键词： throughput Mathematical model Markov processes IEEE 802.11 Standards Equations Analytical models Payloads

来源：评论

学校读者我要写书评

暂无评论

Revisiting Multi-channel Communication to Mitigate Interference and Link Dynamics in Wireless Sensor Networks

Revisiting Multi-channel Communication to Mitigate Interfere...

引用

international conference on distributed computing in Sensor Systems (DCOSS)

作者： Antonio Gonga Olaf Landsiedel Pablo Soldati Mikael Johansson KTH Royal Institute of Technology Sweden Chalmers University of Technology Sweden Huawei Technologies Sweden AB Sweden

Multichannel communication has been proposed as alternative to adaptive (single-channel) routing protocols for mitigating the impact of interference and link dynamics in wireless sensor networks. While several studies have advocated features of both techniques (not without running up against contradicting arguments) a comprehensive study that aligns these results is still lacking. this paper aims at filling this gap. We present an experimental test bed setup used to perform extensive measurements for both single-channel and multichannel communication. We first analyze single-channel and multichannel communication over a single-hop in terms of packet reception ratio, maximum burst loss, temporal correlation of losses, and loss correlations across channels. Results show that multichannel communication with channel hopping significantly reduces link burstiness and packet loss correlation. For multi-hop networks, multi-channel communication and adaptive routing show similar end-to-end reliability in dense topologies, while multichannel communication can outperform adaptive routing in sparse networks with bursty links.

关键词： Correlation Interference Routing IEEE 802.11 Standards Measurement Reliability

来源：评论

学校读者我要写书评

暂无评论

An Improvement of OpenMP Pipeline parallelism with the BatchQueue Algorithm

An Improvement of OpenMP Pipeline Parallelism with the Batch...

引用

international conference on parallel and distributed Systems (ICPADS)

作者： thomas Preud'Homme Julien Sopena Gaël thomas Bertil Folliot LIP6 Paris France

In the context of multicore programming, pipeline parallelism is a solution to easily transform a sequential program into a parallel one without requiring a whole rewriting of the code. the OpenMP stream-computing extension presented by Pop and Cohen proposes an extension of OpenMP to handle pipeline parallelism. However, their communication algorithm relies on Multiple-producer-Multiple-Consumer queues, while pipelined applications mostly deal with linear chains of communication, i.e., with only a single producer and a single consumer. To improve the performance of the OpenMP stream-extension, we propose to add a more specialized Single-Producer-Single-Consumer communication algorithm called Batch Queue and to select it for one-to-one communication. Our evaluation shows that Batch Queue is then able to improve the throughput up to a factor 2 on an 8-core machine both for example application and real applications. Our study shows therefore that using specialized and efficient communication algorithms can have a significant impact on the overall performance of pipelined applications.

关键词： parallel processing Pipelines throughput Benchmark testing Synchronization Multicore processing Scalability

来源：评论

学校读者我要写书评

暂无评论

A Multi-Hash Based Signature Allocation Method in Wireless Network

A Multi-Hash Based Signature Allocation Method in Wireless N...

引用

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

作者： Xuan Dong Xiaodong Wang Shaohe Lv Quan Liu Hu Shen Wenping Liu Xingming Zhou National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781612846842

Wireless interference does not necessarily result in the lost of all the information of the desired signal. In this paper, we study the signature allocation in wireless networks by exploiting the retained signal feature under interference. the commonly used node signature includes MAC address and PN sequence. However, both of them take a lot of time to identify the signature when the network scale is large. We propose a novel signature allocation method based on a multi-hash policy, using a set of hash functions and a mapping-table to identify the signature. the proposed method decreases significantly both the signature identification complexity and the signature conflict probability. We implement the algorithm in GNU Radio and evaluate the performance in a testbed of three USRP nodes. the result shows that, under typical settings,

关键词： Wireless networks Interference Media Access Protocol Resource management Heuristic algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Cloud statistical significance estimation for optimal local alignment of huge DNA sequences

Cloud statistical significance estimation for optimal local ...

引用

the international conference on Informatics and Systems (INFOS)

作者： Ahmad M. Hosny Howida A. Shedeed Ashraf S. Hussein Mohamed F. Tolba Department of Scientific Computing Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

Confidence in a pairwise local sequence alignment is a fundamental problem in bioinformatics. For huge DNA sequences, this problem is highly compute-intensive because it involves evaluating thousands of local alignments to construct an empirical score distribution. Recent parallel solutions support only small sequence sizes and/or are based on sophisticated infrastructures that are not available for most research labs. this paper presents an efficient parallel solution for evaluating the statistical significance for a pair of huge DNA sequences using cloud infrastructures. this solution can receive requests from various researchers via web-portal and allocate resources according to the demand. As it is cloud-based solution, it improves robustness, scalability and performance. the fundamental innovation in this research work is proposing an efficient solution that utilizes both shared and distributed memory architectures using the cloud technology to enhance the performance of evaluating the statistical significance for pair of DNA sequences. In this manner, the condition of the sequence size is released to be in megabyte-scale, which was not supported before. the present solution was verified against other recent parallel solutions, and the performance evaluation was carried out on Microsoft's Cloud. the results show that the performance scales with relatively linear speedup, as the number of instances increases.

关键词： Cloud computing Computer architecture DNA Estimation Bioinformatics Computers parallel processing

来源：评论

学校读者我要写书评

暂无评论

A Reconfigurable Multi-core computing Platform for Robotics and e-Health applications

A Reconfigurable Multi-core Computing Platform for Robotics ...

引用

international conference on Computer and Information Science (ACIS)

作者： Dennis Majoe Lars Widmer Liu Ling Jim Chih-Chen Kao Jurg Gutknecht MA Systems and Control Limited UK ETH Zürich Switzerland

Increasingly embedded devices are turning to two technologies to achieve high performance and enable efficient programmability as well as product usability. the first is multi-core processing on FPGA devices in which the multi-core architecture allows software to map application-level parallelism to inherent parallel fabric to offer better performance, the re-configurability leads to flexible and adaptive designs. the second is wireless communications that allow sensors to be distributed flexibly across a structure for example in the case of a body area network. this paper describes the ongoing design of a multi RF channel, multi-core embedded design which will be used as a generic FPGA solution to meet the requirements of both e-health applications as well as robotics applications.

关键词： Field programmable gate arrays Robots Program processors Sensors Electroencephalography Hardware parallel processing

来源：评论

学校读者我要写书评

暂无评论

Data-intensive computing with map-reduce and hadoop

Data-intensive computing with map-reduce and hadoop

引用

international conference on Application of Information and Communication technologies (AICT)

作者： Shamil Humbetov Department of Computer Engineering Qafqaz University Azerbaijan Azerbaijan

Every day, we create 2.5 quintillion bytes of data - so much that 90% of the data in the world today has been created in the last two years alone. this data comes from everywhere: sensors used to gather climate information, posts to social media sites, digital pictures and videos, purchase transaction records, and cell phone GPS signals to name a few. the IDC sizing of the digital universe - information that is either created or captured in digital form and then replicated in 2006 - is 161 Exabyte, growing to 988 Exabyte in 2010, representing a compound annual growth rate (CAGR) of 57%. A variety of system architectures have been implemented for data-intensive computing and large-scale data analysis applications including parallel and distributed relational database management systems which have been available to run on shared nothing clusters of processing nodes for more than two decades. However most data growth is with data in unstructured form and new processing paradigms with more flexible data models were needed. Several solutions have emerged including the MapReduce architecture pioneered by Google and now available in an open-source implementation called Hadoop used by Yahoo, Facebook, and others. 20% of the world's servers go into huge data centers by the “Big 5” - Google, Microsoft, Yahoo, Amazon, eBay [1].

关键词： File systems Google Computers Data processing distributed databases Computational modeling Servers

来源：评论

学校读者我要写书评

暂无评论

Moving the mobile Evolved Packet Core to the cloud

Moving the mobile Evolved Packet Core to the cloud

引用

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

作者： James Kempf Bengt Johansson Sten Pettersson Harald Lüning Tord Nilsson Packet Technologies Research Ericsson Research Silicon Valley San Jose CA USA Ericsson PDU/PC Goteborg Sweden

In this paper, we describe an evolution of the mobile Evolved Packet Core (EPC) utilizing Software Defined Networking (SDN) that allows the EPC control plane to be moved into a data center. the EPC is a mobile aggregation network standardized by 3GPP for deployment of fixed and 4G mobile broadband services, having interoperability features for 3G and 2G mobile services. While mobile networks already deploy a considerable amount of software control, the ability of OpenFlow to decouple the control and data planes for IP routing provides the opportunity to simplify the configuration and maintenance of mobile aggregation networks by eliminating the distributed IP routing control plane. We extend OpenFlow 1.2 with two vendor extensions, one defining virtual ports to allow encapsulation and decapsulation and another to allow flow routing using the GTP Tunnel Endpoint Identifier (TEID). the result enables an architecture where the GTP control plane can be lifted up out of network elements such as the Serving Gateway and the Packet Data Network Gateway (PDN Gateway) and moved into a controller running in a virtual machine in a data center. the EPC network elements then run a simplified OpenFlow control plane, enhanced with GTP TEID routing extensions. We discuss a few new features that are enabled with GTP TEID routing and the status of a prototype.

关键词： Logic gates IP networks Routing Mobile communication Mobile computing Control systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：