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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

115 篇 会议
56 篇 期刊文献
2 册 图书

馆藏范围

173 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

101 篇 工学
- 89 篇 计算机科学与技术...
- 67 篇 软件工程
- 11 篇 信息与通信工程
- 11 篇 控制科学与工程
- 10 篇 电子科学与技术（可...
- 9 篇 生物工程
- 7 篇 机械工程
- 7 篇 电气工程
- 6 篇 化学工程与技术
- 4 篇 动力工程及工程热...
- 3 篇 网络空间安全
- 2 篇 材料科学与工程（可...
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 农业工程
- 2 篇 安全科学与工程
41 篇 理学
- 23 篇 数学
- 9 篇 生物学
- 7 篇 化学
- 6 篇 物理学
- 5 篇 统计学（可授理学、...
- 4 篇 系统科学
35 篇 管理学
- 20 篇 管理科学与工程(可...
- 15 篇 图书情报与档案管...
- 7 篇 工商管理
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 农学
- 2 篇 作物学
2 篇 医学
- 2 篇 公共卫生与预防医...
1 篇 教育学
- 1 篇 教育学

主题

8 篇 data models
7 篇 laboratories
7 篇 distributed comp...
6 篇 semantics
6 篇 distributed proc...
5 篇 concurrent compu...
5 篇 anomaly detectio...
5 篇 computational mo...
5 篇 accuracy
4 篇 deep learning
4 篇 application soft...
4 篇 feature extracti...
4 篇 training
3 篇 knowledge based ...
3 篇 parallel process...
3 篇 routing
3 篇 programming
3 篇 self-supervised ...
3 篇 speech processin...
3 篇 neural networks

机构

24 篇 national key lab...
14 篇 college of compu...
13 篇 national laborat...
12 篇 national laborat...
12 篇 national key lab...
10 篇 national key lab...
8 篇 laboratory of di...
7 篇 college of compu...
7 篇 science and tech...
6 篇 key laboratory o...
6 篇 national univers...
4 篇 department of co...
4 篇 department of co...
4 篇 school of automa...
4 篇 department of co...
4 篇 college of compu...
4 篇 key laboratory o...
4 篇 sino-german coll...
4 篇 jiangnan institu...
4 篇 nuclear power in...

作者

15 篇 li dongsheng
12 篇 dongsheng li
11 篇 huaimin wang
10 篇 dou yong
9 篇 gang yin
9 篇 ji wang
9 篇 tao wang
8 篇 qiao peng
8 篇 yue yu
7 篇 wang yijie
7 篇 lai zhiquan
7 篇 huang zhen
7 篇 yong dou
6 篇 yijie wang
5 篇 peng qiao
5 篇 liu jie
5 篇 wang wei
5 篇 zhiquan lai
5 篇 wang ji
5 篇 qiang fan

语言

146 篇 英文
22 篇 其他
5 篇 中文

检索条件"机构=National Laboratory of Parallel and Distributed Computing"

共 173 条记录，以下是141-150 订阅

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

详细简洁

排序：

Towards building efficient content-based publish/subscribe systems over structured P2P overlays

Towards building efficient content-based publish/subscribe s...

引用

International Conference on parallel Processing

作者： Zhang, Shengdong Wang, Ji Shen, Rui Xu, Jie National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China School of Computing University of Leeds Leeds LS2 9JT United Kingdom

ISBN: (纸本)9780769541563

In this paper, we introduce a generic model to deal with the event matching problem of content-based publish/ subscribe systems over structured P2P overlays. In this model, we claim that there are three methods (eventoriented, subscription-oriented and hybrid) to make all the matched pairs (event, subscription) meet in a system. By theoretically analyzing the inherent problem of both eventoriented and subscription-oriented methods, we propose PEM (Popularity-based Event Matching), a variant of hybrid method. PEM can achieve better trade-off between event processing load and subscription storage load of a system. PEM has been verified through both mathematical and simulation-based evaluation. © 2010 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

2010 IEEE 18th International Workshop on Quality of Service, IWQoS 2010

作者： Chen, Fajun Liu, Jiangchuan Li, Zongpeng Wang, Yijie Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer National University of Defense Technology China School of Computing Science Simon Fraser University Canada Department of Computer Science University of Caglary Canada

ISBN: (纸本)9781424459889

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP) [1]. Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51:15∼73:02%) and improvement on packet delivery ratio (99:76%) are observed.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Towards Building Efficient Content-Based Publish/Subscribe Systems over Structured P2P Overlays

Towards Building Efficient Content-Based Publish/Subscribe S...

引用

International Conference on parallel Processing (ICPP)

作者： Shengdong Zhang Ji Wang Rui Shen Jie Xu National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computing University of Leeds Leeds UK

In this paper, we introduce a generic model to deal with the event matching problem of content-based publish/subscribe systems over structured P2P overlays. In this model, we claim that there are three methods (event-oriented, subscription-oriented and hybrid) to make all the matched pairs (event, subscription) meet in a system. By theoretically analyzing the inherent problem of both event-oriented and subscription-oriented methods, we propose PEM (Popularity-based Event Matching), a variant of hybrid method. PEM can achieve better trade-off between event processing load and subscription storage load of a system. PEM has been verified through both mathematical and simulation-based evaluation.

关键词： Subscriptions Decision support systems Publishing Load modeling Mathematical model Bandwidth Routing

来源：评论

学校读者我要写书评

暂无评论

High performance and memory efficient implementation of matrix multiplication on FPGAs

High performance and memory efficient implementation of matr...

引用

IEEE International Conference on Field-Programmable Technology (FPT)

作者： Guiming Wu Yong Dou Miao Wang National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China Jiangnan Institute of Computing Technology Wuxi China

We present a high performance and memory efficient hardware implementation of matrix multiplication for dense matrices of any size on the FPGA devices. By applying a series of transformations and optimizations on the original serial algorithm, we can obtain an I/O and memory optimized block algorithm for matrix multiplication on FPGAs. A linear array of processing elements (PEs) is proposed to implement this block algorithm. We show significant reduction in hardware resources consuming compared to the related work while increasing clock frequency. Moreover, the memory requirement can be reduced to O(S) from O(S 2 ), where S is the block size. Therefore, more PEs can be integrated into the same FPGA devices.

关键词： Field programmable gate arrays Arrays Random access memory Algorithm design and analysis Hardware Memory management Optimization

来源：评论

学校读者我要写书评

暂无评论

Automatic synthesis of processor arrays with local memories on FPGAs

Automatic synthesis of processor arrays with local memories ...

引用

IEEE International Conference on Field-Programmable Technology (FPT)

In this paper, we present an automatic synthesis framework to map loop nests to processor arrays with local memories on FPGAs. An affine transformation approach is firstly proposed to address space-time mapping problem. Then a data-driven architecture model is introduced to enable automatic generation of processor arrays by extracting this data-driven architecture model from transformed loop nests. Some techniques including memory allocation, communication generation and control generation are presented. Synthesizable RTL codes can be easily generated from the architecture model built by these techniques. A preliminary synthesis tool is implemented based on PLUTO, an automatic polyhedral source-to-source transformation and parallelization framework.

关键词： parallel processing Registers Field programmable gate arrays Radiation detectors Arrays Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Routing with uncertainty in wireless mesh networks

Routing with uncertainty in wireless mesh networks

引用

International Workshop on Quality of Service

作者： Fajun Chen Jiangchuan Liu Zongpeng Li Yijie Wang Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defense Technology China School of Computing Science Simon Fraser University Department of Computer Science University of Caglary

Existing routing protocols for Wireless Mesh Networks (WMNs) are generally optimized with statistical link measures, while not addressing on the intrinsic uncertainty of wireless links. We show evidence that, with the transient link uncertainties at PHY and MAC layers, a pseudo-deterministic routing protocol that relies on average or historic statistics can hardly explore the full potentials of a multi-hop wireless mesh. We study optimal WMN routing using probing-based online anypath forwarding, with explicit consideration of transient link uncertainties. We show the underlying connection between WMN routing and the classic Canadian Traveller Problem (CTP). Inspired by a stochastic recoverable version of CTP (SRCTP), we develop a practical SRCTP-based online routing algorithm under link uncertainties. We study how dynamic next hop selection can be done with low cost, and derive a systematic selection order for minimizing transmission delay. We conduct simulation studies to verify the effectiveness of the SRCTP algorithms under diverse network configurations. In particular, compared to deterministic routing, reduction of end-to-end delay (51.15~73.02%) and improvement on packet delivery ratio (99.76%) are observed.

关键词： Uncertainty Wireless mesh networks Delay Routing protocols Physical layer Statistics Stochastic processes Relays Computer networks Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A framework for constructing peer-to-peer overlay networks in java 09

A framework for constructing peer-to-peer overlay networks i...

引用

7th International Conference on Principles and Practice of Programming in Java, PPPJ 2009

作者： Rui, Shen Ji, Wang Shengdong, Zhang Siqi, Shen Pei, Fan National Laboratory for Parallel and Distributed Processing Changsha 410073 China School of Computing University of Leeds Leeds LS2 9JT United Kingdom

ISBN: (纸本)9781605585987

Peer-to-peer emerges as a better way for building applications on the Internet that require high scalability and availability. Peer-to-peer systems are usually organized into structured overlay networks, which provide key-based routing capabilities to eliminate flooding in unstructured ones. Many overlay network protocols have been proposed to organize peers into various topologies with emphasis on different networking properties. However, applications are often stuck to a specific peer-to-peer overlay network implementation, because different overlay implementations usually provide very different interfaces and messaging mechanisms. In this paper, we present a framework for constructing peer-to-peer overlay networks in Java. First, networking is abstracted by the interfaces that use URIs to uniformly address peers on different underlying or overlay networks. Then, asynchronous and synchronous messaging support is built upon these interfaces. Finally, overlay networking interfaces are sketched to handle specific issues in overlay networks. We have constructed several overlay networks in this framework, and built peer-to-peer applications which are independent of overlay implementations. Copyright 2009 ACM.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

distributed Line Graphs: A Universal Framework for Building DHTs Based on Arbitrary Constant-Degree Graphs

Distributed Line Graphs: A Universal Framework for Building ...

引用

International Conference on distributed computing Systems

作者： Yiming Zhang Ling Liu Dongsheng Li Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Georgia Institute of Technology College of Computing Georgia Institute of Technology Atlanta USA

ISBN: (纸本)9781424431748

Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG), a universal framework for building DHTs based on arbitrary constant-degree graphs. We prove that in a DLG-enabled, N-node DHT, the out-degree is d, the in-degree is between 1 and 2d, and the diameter is less than 2(log d N-log d N 0 +D 0 +1), where d, D 0 and N 0 represent the degree, diameter and number of nodes of the initial graph, respectively. The maintenance cost of DLG-enabled DHTs is O(log d N). We show the power of DLG technique by applying it to Kautz graphs to propose a new DHT scheme.

关键词： Routing Maintenance engineering Buildings Distance measurement Topology Industries Construction industry

来源：评论

学校读者我要写书评

暂无评论

An experimental study of the emergent behaviors of self-organized agent communities

An experimental study of the emergent behaviors of self-orga...

引用

Congress on Evolutionary Computation

作者： Shufeng Wang Hong Zhu National Laboratory for Parallel and Distributed Processing Changsha China Department of Computing Oxford Brookes University Oxford UK

Emergent behavior is an essential feature in multi-agent systems and plays a significant role in the applications of agent technology. Because of the huge gap between individual agents' behaviors and those of the whole system, specifying and reasoning about emergent behaviors are notoriously difficult. Simulation has been the essential method to study emergent behaviors in multi-agent systems. In this paper, we report an experimental study of the emergent behaviors of self-organized agent communities, in which emergent behaviors play a crucial role. The experiments confirmed the results of a theoretical analysis of agent communities using a formal theory called scenario calculus. It further provided insight into the dynamic features of the system that were very difficult to obtain by using formal logic, such as the speed of convergence to the emergent states and the relationships between the convergence time and various parameters of self-organized agent communities systems.

关键词： Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Research on the weighted reconstruction of metabolic networks

Research on the weighted reconstruction of metabolic network...

引用

第五届中国蛋白质组学大会暨首届粤港蛋白质组学学术交流会

作者： Zhou Tingting Wang Zhenghua Chan, K.C.C. Beijing Proteome Research Center BeijingP.R.China102206 National Laboratory for Parallel & Distributed ProcessingNational University of Deference and TechnologyChangshaP.R.China 410073 Department of computingthe HongKong Polytechnic UniversityHonghumHongkong Department of computing the HongKong Polytechnic UniversityHonghumHongkong National Laboratory for Parallel & Distributed Processing National University of Deference and TechnologyChangshaP.R.China 410073

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：