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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

857 篇 会议
255 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

697 篇 工学
- 555 篇 计算机科学与技术...
- 401 篇 软件工程
- 125 篇 信息与通信工程
- 69 篇 控制科学与工程
- 67 篇 电子科学与技术（可...
- 51 篇 生物工程
- 45 篇 机械工程
- 36 篇 电气工程
- 23 篇 仪器科学与技术
- 21 篇 动力工程及工程热...
- 18 篇 化学工程与技术
- 15 篇 材料科学与工程（可...
- 15 篇 网络空间安全
- 14 篇 土木工程
- 13 篇 环境科学与工程（可...
- 11 篇 力学（可授工学、理...
- 11 篇 建筑学
- 11 篇 农业工程
- 11 篇 生物医学工程（可授...
270 篇 理学
- 179 篇 数学
- 56 篇 生物学
- 38 篇 统计学（可授理学、...
- 36 篇 系统科学
- 35 篇 物理学
- 21 篇 化学
177 篇 管理学
- 117 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 38 篇 工商管理
20 篇 法学
- 17 篇 社会学
12 篇 经济学
- 12 篇 应用经济学
12 篇 农学
9 篇 教育学
6 篇 文学
5 篇 医学
3 篇 军事学
2 篇 艺术学

主题

51 篇 distributed proc...
49 篇 laboratories
40 篇 computational mo...
38 篇 concurrent compu...
33 篇 algorithm design...
30 篇 distributed comp...
29 篇 computer archite...
29 篇 benchmark testin...
29 篇 kernel
27 篇 hardware
26 篇 parallel process...
26 篇 fault tolerance
26 篇 graphics process...
22 篇 servers
22 篇 feature extracti...
22 篇 cloud computing
22 篇 training
21 篇 throughput
21 篇 bandwidth
21 篇 protocols

机构

169 篇 national laborat...
134 篇 science and tech...
93 篇 college of compu...
88 篇 national laborat...
81 篇 national laborat...
38 篇 national laborat...
35 篇 school of comput...
29 篇 national key lab...
22 篇 science and tech...
22 篇 national key lab...
18 篇 national laborat...
16 篇 science and tech...
16 篇 national laborat...
14 篇 national laborat...
13 篇 national key lab...
13 篇 school of comput...
12 篇 national laborat...
12 篇 national key lab...
10 篇 parallel and dis...
10 篇 national laborat...

作者

40 篇 wang huaimin
37 篇 wang ji
37 篇 yong dou
36 篇 ji wang
35 篇 liu jie
32 篇 jie liu
29 篇 huaimin wang
28 篇 dou yong
27 篇 dongsheng li
27 篇 xiaodong wang
26 篇 peng yuxing
26 篇 yin gang
25 篇 yuxing peng
25 篇 li dongsheng
24 篇 yijie wang
23 篇 wang yijie
21 篇 xicheng lu
21 篇 li kuan-ching
21 篇 xingming zhou
20 篇 gang yin

语言

1,043 篇 英文
63 篇 中文
9 篇 其他

检索条件"机构=Parallel Distributed Processing Laboratory"

共 1115 条记录，以下是851-860 订阅

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

详细简洁

排序：

Providing responsiveness requirement based consistency in DVE

Providing responsiveness requirement based consistency in DV...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Zhang, Wei Zhou, Hangjun Peng, Yuxing Li, Sikun National Laboratory for Parallel and Distributed Processing School of Computer Science ChangSha 410073 China

ISBN: (纸本)9780769539003

Consistency and responsiveness are two important factors in providing the sense of reality in distributed Virtual Environment (DVE). However, it is not easy to optimize both aspects because of the trade-off between these two factors. As a result, most existing consistency maintenance methods ignored the responsiveness requirements, or just assumed a simple responsiveness requirement model which cannot meet the real need of DVE systems. In this paper, we first present a new responsiveness requirement model. The model can describe requirement satisfaction situation of each node. Base on this model, we propose a responsiveness requirement based consistency method. The method can adjust the utilization of time resource according to the requirements of different nodes and improve the overall responsiveness performance by at least 20%. Therefore, it provides a good support to increase the applicability of DVE systems. © 2009 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Jammer localization in wireless sensor networks

Jammer localization in wireless sensor networks

引用

5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009

作者： Yanqiang, Sun Xiaodong, Wang National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9781424436934

Jamming style Denial-of-Service attack is the transmission of radio signals that disrupt communications by decreasing the signal to noise ratio. This kind of attack can be easily launched by jammer through either bypassing MAC-layer protocols or emitting a radio signal targeted at blocking a particular channel. In this paper, we consider the item of localizing a jammer in which little work has been done. First we explored the existing localization algorithms that have been used in wireless sensor networks. We then proposed a Geometry-Covering based Localization (GCL) algorithm, which utilizes the knowledge of computing geometry, especially the convex hull. Simulation results showed that GCL is able to achieve higher accuracy than Centroid Localization, and has the time complexity of O (nlogn) , which is proper to sensor networks. ©2009 IEEE.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Fine-grained parallel application specific computing for RNA secondary structure prediction using SCFGS on FPGA

Fine-grained parallel application specific computing for RNA...

引用

Embedded Systems Week 2009, ESWEEK 2009 - 2009 International Conference on Compilers, Architecture, and Synthesis for Embedded Systems, CASES'09

作者： Dou, Yong Xia, Fei Jiang, Jingfei National Laboratory for Parallel and Distributed Processing National University of Defence Technology 410073 ChangSha China

ISBN: (纸本)9781605586267

In the field of RNA secondary structure prediction, the CYK (Coche-Younger-Kasami) algorithm is a most popular methods using SCFG (stochastic context-free grammars) model. However, general purpose parallel computers including SMP multiprocessors or cluster systems exhibit low parallel efficiency and they are too expensive to be used easily for many research institutes. FPGA chips provide a new approach to accelerate the CYK algorithm by exploiting fine-grained custom design. The CYK algorithm shows complicated data dependence, in which the dependence distance is variable, and the dependence direction is also across two dimensions. We propose a systolic array structure including one master PE and multiple slave PEs for fine grain hardware implementation on FPGA. We partition tasks by columns and assign tasks to PEs for load balance. We exploit data reuse schemes to reduce the need to load matrix from external memory. To our knowledge, our implementation with 16 PEs is the only FPGA accelerator implementing the complete CYK/inside algorithm. The experimental results show a factor of more than 14 speedup over the Infernal-0.55 software running on a PC platform with Pentium 4 2.66GHz CPU. The computational power of our platform with FPGA accelerator is comparable to a PC cluster consisting of 20 Intel-Xeon CPUs for RNA secondary structure prediction using SCFGs, but the hardware cost and power consumption is only about 15% and 10% of the latter respectively. Copyright 2009 ACM.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

A peer-to-peer media streaming system based on the iVCE platform

A peer-to-peer media streaming system based on the iVCE plat...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Wu, Jiqing Peng, Yuxing Shen, Rui National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769539003

With the advancement of peer-to-peer technology, media streaming applications become more and more popular in the Internet. However, the traditional development methods for this kind of applications need developers not only to consider the application logic but also to manage the dynamics of Internet resources, thus increasing the difficulty of development and limiting the deployment of personal video distribution applications. In this paper, we design and implement a peer-to-peer streaming system in a much easier way. In this way we can concentrate on the application itself without distraction from the dynamics of Internet resources. Such simplification owes to the Internet-based Virtual Computing Environment (iVCE), which provides programming abstractions and runtime utilities that can encapsulate the complexity of managing transient resources into the platform, thus facilitating the construction of Internet applications. When we build our streaming application based on the iVCE, we only need to define the interaction protocols among distributed nodes with the Owlet programming language. Also, we implement a JavaBean, which can be used by the Owlet program, to assist the transfering and rendering of the content. Our implementation shows that peer-to-peer applications such as media streaming, can be elegantly built using the iVCE platform, and it can serve as a reference implementation for developing similar applications. © 2009 IEEE.

关键词： Media streaming

来源：评论

学校读者我要写书评

暂无评论

A two-phase mapping method for parallel applications simulation

A two-phase mapping method for parallel applications simulat...

引用

2009 International Conference on Computational Intelligence and Software Engineering, CiSE 2009

作者： Fang, Jianbin Xu, Chuanfu Che, Yonggang Weng, Yufen Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424445073

Efficient mapping of logical processes to physical processes is one of key technologies to accelerate parallel performance simulation. Aiming at minimizing the communications between SMP nodes and between host physical processes, this paper presents a novel method named TPsmp-LP3M. It automatically extracts communication pattern of logical processes from trace and then generates a two-phase mapping from logical processes to SMP clusters. Experimental results show that TPsmp-LP3M can outperform the regular mapping method by up to 20.2%. ©2009 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

HyperSpring: Accurate and stable latency estimation in the hyperbolic space

HyperSpring: Accurate and stable latency estimation in the h...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

ISBN: (纸本)9780769539003

Predicting network latencies between Internet hosts can efficiently support large-scale Internet applications, e.g., file sharing service and the overlay construction. Several study use the Hyperbolic space to model the Internet densecore and many-tendril structure. However, existing Hyperbolic space based embedding approaches are not designed for accurate latency estimation in the distributed context. We present HyperSpring, which estimates latency by modelling a mass spring system in the Hyperbolic similar with Vivaldi. HyperSpring adopts coordinate initialization to speed up the convergence of coordinate computation, uses multiple-round symmetric updates to escape from bad local minima, and stabilizes coordinates by compensating RTT measurements to reduce the coordinate drifts. Evaluation results based on a network trace of 226 PlanetLab nodes indicate that, compared to Euclidean-space based Vivaldi, HyperSpring provides performance improvements for most nodes, and incurs slightly higher distortions for a small number of nodes. © 2009 IEEE.

关键词： Hyperbolic space Latency estimation Mass spring field

来源：评论

学校读者我要写书评

暂无评论

iRank: Supporting proximity ranking for peer-to-peer applications

iRank: Supporting proximity ranking for peer-to-peer applica...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology China

ISBN: (纸本)9780769539003

Proximity ranking according to end-to-end network distances (e.g., Round-Trip Time, RTT) can reveal detailed proximity information, which is important in network management and performance diagnosis in distributed systems. However, to the best of our knowledge, there has been no similar work on this subject in the P2P computing field. We present a distributed rating method iRank, that enables proximity rankings by providing discrete ratings in a distributed manner. It formulates the proximity ranking as a rating problem that faithfully captures the proximity based on noisy distance measurements scalably and practically. The primary challenge in inferring proximity rankings is enforcing distributed ratings with complex rating policies. Our solution is based on reconstructing ratings by decomposing a centralized rating method Maximum Margin Matrix Factorization (MMMF) into independent sub-problems, that can be efficiently solved in a decentralized manner. By relaxing the dependence on infrastructure nodes that are a single point of failure and limit scalability, iRank can gracefully handle network churns. Through real network latency data sets, we demonstrate that iRank can predict ratings with low distortion, which are smaller than 20 percentage worse than the centralized method, in the context of synthetic complex rating policies. © 2009 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Anadem: A hybrid overlay network for content-based data distribution

Anadem: A hybrid overlay network for content-based data dist...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Zheng, Zhong Wang, Yi-Jie National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9780769539003

As an infrastructure for data distribution, overlay networks have to feature efficient routing and adequate robustness to achieve fast and accurate data distribution in the environment with node churn. Considering that the existing overlay networks mostly focus on single optimization objective and fail to ensure routing efficiency and robustness simultaneously, a hybrid overlay network for content-based data distribution - Anadem is proposed in this paper. Anadem achieves a better compromise between routing efficiency and robustness by combining the intercluster multiple structured topologies with the intra-cluster unstructured topologies. Anadem also provides mechanisms for dynamic concurrent cluster creation, cluster departure and load balance to make data distribution more adaptive to the dynamic network environment. Experimental results reveal that compared with existing overlay networks, Anadem can support fast and accurate content-based data distribution even when large amount of nodes fail in the system. © 2009 IEEE.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Program optimization of array-intensive SPEC2k benchmarks on multithreaded GPU using CUDA and brook+

Program optimization of array-intensive SPEC2k benchmarks on...

引用

15th International Conference on parallel and distributed Systems, ICPADS '09

作者： Wang, Guibin Tang, Tao Fang, Xudong Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769539003

Graphic processing Unit (GPU), with many lightweight data-parallel cores, can provide substantial parallel computing power to accelerate several general purpose applications. Both the AMD and NVIDIA corps provide their specific high performance GPUs and software platforms. As the floating-point computing capacity increases continually, the problem of "memory-wall" becomes more serious, especially for array-intensive applications. In this paper, we optimize and implement two SPEC2k benchmarks mgrid and swim on multithreaded GPU using CUDA and Brook+. In order to reduce the pressure on off-hip memory, we make use of data locality in multi-level memory hierarchies and hide long memory access latency via double-buffers. To balance inter-thread parallelism and intra-hread locality, we further tune thread granularity for each kernel and empirically study the best equilibrium point for this problem. Flow control instruction can significantly impact the effective instruction throughput. Oriented to this problem, we introduce a diverge elimination technology to convert condition expression into computing operation. Through all the optimizations, we gain the speedup of 10x-34x to the CPU implementation on the GPUs of AMD and NVIDIA respectively. Finally, we summarize and compares the GPUs from AMD and NVIDIA in hardware and software. © 2009 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Model-directed multi-level parallelization for multi-task programs on the Cell BE

Model-directed multi-level parallelization for multi-task pr...

引用

2009 2nd International Conference on Computer Science and Its Applications, CSA 2009

作者： Wang, Miao Benoit, Nicolas Bodin, François National Laboratory for Parallel and Distributed Processing NUDT Changsha 410073 China University of Rennes 1 Rennes 35000 France

ISBN: (纸本)9781424449460

Multi-core architectures can deliver high processing power if the multiple levels of parallelism they expose are exploited. However, it is non-trivial to orchestrate the computational and memory resources allocation. Furthermore, when dealing with distributed memory architectures, data distribution adds another level of complexity. This paper presents a modeldriven technique for mapping multi-task parallel programs onto multi-core platforms. The resource allocation configurations are expressed within a three-dimensional optimization space which affects task-level and data-level parallelism, and communication. Then, the performance of any valid parallelization scheme is estimated statically, taking into account both computation and communication costs. We prototyped our approach on the Cell BE with an image processing application. Experiments show that our model can correctly predict the overall performance and highlight the most efficient parallelization schemes. © 2009 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共112页 << < 82 83 84 85 86 87 88 89 90 91 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：