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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

分类表

所选分类

>> <<

限定检索结果

标题

标题
作者
主题词
出版物名称
出版社
机构
学科分类号
摘要
ISBN
ISSN
基金资助
索书号

作者

作者
标题
主题词
出版物名称
出版社
机构
学科分类号
摘要
ISBN
ISSN
基金资助
索书号

文献类型

368 篇 会议
158 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

320 篇 工学
- 256 篇 计算机科学与技术...
- 197 篇 软件工程
- 55 篇 信息与通信工程
- 39 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 30 篇 生物工程
- 24 篇 电气工程
- 21 篇 机械工程
- 12 篇 仪器科学与技术
- 11 篇 动力工程及工程热...
- 9 篇 网络空间安全
- 8 篇 化学工程与技术
- 6 篇 材料科学与工程（可...
- 6 篇 环境科学与工程（可...
- 6 篇 生物医学工程（可授...
- 5 篇 光学工程
- 5 篇 农业工程
- 4 篇 冶金工程
133 篇 理学
- 77 篇 数学
- 31 篇 生物学
- 21 篇 系统科学
- 20 篇 物理学
- 19 篇 统计学（可授理学、...
- 15 篇 化学
80 篇 管理学
- 48 篇 管理科学与工程(可...
- 34 篇 图书情报与档案管...
- 16 篇 工商管理
12 篇 法学
- 9 篇 社会学
11 篇 经济学
- 11 篇 应用经济学
7 篇 农学
- 6 篇 作物学
4 篇 医学
3 篇 教育学
2 篇 军事学
1 篇 文学

主题

26 篇 computational mo...
16 篇 concurrent compu...
14 篇 distributed proc...
12 篇 fault tolerance
12 篇 computer archite...
12 篇 laboratories
11 篇 scalability
11 篇 application soft...
11 篇 graphics process...
11 篇 semantics
11 篇 kernel
11 篇 delay
10 篇 analytical model...
10 篇 feature extracti...
10 篇 distributed comp...
10 篇 training
9 篇 parallel process...
9 篇 deep learning
9 篇 servers
9 篇 cloud computing

机构

81 篇 national laborat...
36 篇 school of comput...
33 篇 school of cyber ...
32 篇 school of comput...
26 篇 science and tech...
23 篇 national laborat...
22 篇 national enginee...
22 篇 national key lab...
21 篇 hubei key labora...
21 篇 hubei engineerin...
21 篇 cluster and grid...
20 篇 college of compu...
20 篇 services computi...
16 篇 national laborat...
14 篇 school of softwa...
14 篇 national laborat...
13 篇 school of comput...
13 篇 school of inform...
12 篇 national key lab...
12 篇 national laborat...

作者

25 篇 jin hai
20 篇 hai jin
15 篇 hu shengshan
15 篇 wang yijie
14 篇 dongsheng li
14 篇 peng yuxing
12 篇 yijie wang
12 篇 huaimin wang
12 篇 wang huaimin
11 篇 li dongsheng
11 篇 zhang leo yu
11 篇 li minghui
10 篇 wang huai-min
9 篇 liu jie
9 篇 wang ji
9 篇 zhou ziqi
9 篇 xu xinhai
8 篇 yuxing peng
8 篇 dou yong
8 篇 guibin wang

语言

496 篇 英文
28 篇 中文
5 篇 其他

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

共 529 条记录，以下是81-90 订阅

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

详细简洁

排序：

相关度排序

相关度排序
时效性降序
时效性升序

SemanticCast: Content-based data distribution over self-organizing semantic overlay networks

SemanticCast: Content-based data distribution over self-orga...

引用

11th International Conference on parallel and distributed computing, Applications and Technologies, PDCAT 2010

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

ISBN: (纸本)9780769542874

Many applications demand distributing data with different contents efficiently in the network environment with unreliable links and a high node churn. Existing approaches mostly focus on optimizing either efficiency or robustness of data distribution, and fail to ensure both of them simultaneously. In this paper, we propose SemanticCast - a content-based data distribution approach over self-organizing semantic overlay networks. SemanticCast maintains a self-organizing semantic overlay based on view exchange (called Crowd). In Crowd, each node seeks neighbors with more similar interests by periodically exchanging its neighbor list (called view) with a chosen neighbor. Through these nodes' self-organizing behavior, various interest communities emerge in the overlay. For data distribution over Crowd, SemanticCast adopts random walk to route data between interest communities, and adopts flooding to disseminate data inside the interested communities. The experimental results show that compared to existing approaches, SemanticCast can support efficient content-based data distribution in the unreliable and highly dynamic network environment. © 2010 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

SMP-SIM: An event-driven performance simulator for SMP

SMP-SIM: An event-driven performance simulator for SMP

引用

2012 International Conference on Systems and Informatics, ICSAI 2012

作者： Zhang, Xin Tang, Yuhua Lin, Yufei Xu, Xinhai Guo, Xiaowei Ren, Xiaoguang National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467301992

Performance prediction for the high performance computer system is of great importance for designing, implementing, and optimizing system. As a widely used technique for predicting performance, simulation method attracts more and more attention from the research community. Based on analyzing the problems in the current performance simulation techniques, we present a key idea of the performance simulator for SMP system based on event-driven. We propose the framework of SMP-SIM and implement it based on MPICH2. The simulation results show that, our simulation technique has the advantages of high accuracy and simulation performance. © 2012 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A programming language approach to internet-based virtual environment computing

A programming language approach to internet-based virtual en...

引用

作者： Ji, Wang Shen, Rui Wang, Huai-Min National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

There is an increasing need to build scalable distributed systems over the Internet infrastructure. However, the development of distributed scalable applications suffers from lack of a wide accepted virtual computing environment. Users have to take great efforts on the management and sharing of the involved resources over Internet, whose characteristics are intrinsic growth, autonomy and diversity. To deal with this challenge, Internet-based Virtual computing Environment (iVCE) is proposed and developed to serve as a platform for distributed scalable applications over the open infrastructure, whose kernel mechanisms are on-demand aggregation and autonomic collaboration of resources. In this paper, we present a programming language for iVCE named Owlet. Owlet conforms with the conceptual model of iVCE, and exposes the iVCE to application developers. As an interaction language based on peer-to-peer content-based publish/subscribe scheme, Owlet abstracts the Internet as an environment for the roles to interact, and uses roles to build a relatively stable view of resources for the on-demand resource aggregation. It provides language constructs to use 1) distributed event driven rules to describe interaction protocols among different roles, 2) conversations to correlate events and rules into a common context, and 3) resource pooling to do fault tolerance and load balancing among networked nodes. We have implemented an Owlet compiler and its runtime environment according to the architecture of iVCE, and built several Owlet applications, including a peer-to-peer file sharing application. Experimental results show that, with iVCE, the separation of resource aggregation logic and business logic significantly eases the process of building scalable distributed applications. © 2011 Springer Science+Business Media, LLC & Science Press, China.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Kernel fusion: An effective method for better power efficiency on multithreaded GPU

Kernel fusion: An effective method for better power efficien...

引用

2010 IEEE/ACM International Conference on Green computing and Communications, GreenCom 2010, 2010 IEEE/ACM International Conference on Cyber, Physical and Social computing, CPSCom 2010

作者： Wang, Guibin Lin, YiSong Yi, Wei National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9780769543314

As one of the most popular accelerators, Graphics Processing Unit (GPU) has demonstrated high computing power in several application fields. On the other hand, GPU also produces high power consumption and has been one of the most largest power consumers in desktop and supercomputer systems. However, software power optimization method targeted for GPU has not been well studied. In this work, we propose kernel fusion method to reduce energy consumption and improve power efficiency on GPU architecture. Through fusing two or more independent kernels, kernel fusion method achieves higher utilization and much more balanced demand for hardware resources, which provides much more potential for power optimization, such as dynamic voltage and frequency scaling (DVFS). Basing on the CUDA programming model, this paper also gives several different fusion methods targeted for different situations. In order to make judicious fusion strategy, we deduce the process of fusing multiple independent kernels as a dynamic programming problem, which could be well solved with many existing tools and be simply embedded into compiler or runtime system. To reduce the overhead introduced by kernel fusion, we also propose effective method to reduce the usage of shared memory and coordinate the thread space of the kernels to be fused. Detailed experimental evaluation validates that the proposed kernel fusion method could reduce energy consumption without performance loss for several typical kernels. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

FedEAE: Federated Learning Based Privacy-Preserving Event Argument Extraction 12th

FedEAE: Federated Learning Based Privacy-Preserving Event Ar...

引用

12th national CCF Conference on Natural Language Processing and Chinese computing, NLPCC 2023

作者： Hu, Fei Dong, Shenpo Chang, Tao Zhou, Jie Li, Haili Wang, Jingnan Chen, Rui Liu, Haijiao Wang, Xiaodong National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783031446955

Benefiting from Pre-trained Language Model (PLM), Event Argument Extraction (EAE) methods have achieved SOTA performance in general scenarios of Event Extraction (EE). However, with increasing concerns and regulations on data privacy, aggregating distributed data among different institutions in some privacy-sensitive territories (e.g., medical record analysis, financial statement analysis, etc.) becomes very difficult, and it’s hard to train an accurate EAE model with limited local data. Federated Learning (FL) provides promising methods for a large number of clients to collaboratively learn a shared global model without the need to exchange privacy-sensitive data. Therefore, we propose a privacy-preserving EAE method named FedEAE based on FL to solve the current difficulties. To better adapt to federated scenarios, we design a dataset named FedACE generated from the ACE2005 dataset under IID and Non-IID for our experiments. Extensive experiments show that FedEAE achieves promising performance compared to existing baselines, thus validates the effectiveness of our method. To the best of our knowledge, FedEAE is the first to apply FL in the EAE task. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Checkpoint selection in fault recovery based on byzantine fault model 4th

Checkpoint selection in fault recovery based on byzantine fa...

引用

4th International Conference on Computational Intelligence and Communication Networks, CICN 2012

作者： Xu, Xinhai Lin, Yufei National Laboratory for Parallel and Distributed Processing Computer School National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781467329811

Nowadays, with the growth of the performance, the reliability problem of supercomputers becomes more and more serious. In order to complete an application with small fault recovery overhead, Checkpoint/Restart(C/R) methods are widely used. So far, the mainstream C/R methods are either based on Fail-Stop fault model or making the system(or program) do error detection before storing checkpoints, so they can ensure the correctness of every checkpoint. However, the faults occurring in the systems in real world are more accordant with the Byzantine fault model, and in order to pursue the higher practical performance, neither the system nor the program implements any fault detection mechanism. Consequently, there may be errors in the checkpoints. This paper studies the checkpoint selection problem that which checkpoint should be selected as the object of rolling back after system occurring failure, based on Byzantine fault model. We design a framework of checkpoint selection, and then, based on it, propose three checkpoint selection strategies: conservative strategy, aggressive strategy and statistical strategy. The simulation results show that: the conservative strategy shows its superiority when the error latent period is long, while the aggressive strategy behaves oppositely, the statistical strategy has a stable efficiency, only 50% more overhead compared to the ideal checkpoint selection when the checkpoint period is the half of mean time between faults. © 2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Detecting null dereference with a game

Detecting null dereference with a game

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

作者： Chen, Jie National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9783642345302

As one of the most dangerous and common software vulnerabilities, null dereference often leads to program crashes. In this chapter we propose a human computation method to detect null dereference in a "frog and bug" game. The purpose of the game is to utilize the rich distributed human resource to do the complex science work in a simple and pleasant way. Programs are transformed into visual puzzles first, and then the server collects information from the people playing the game. Finally the recorded metadata is translated back into the positions in the programs where null dereference may happen. The game has shown to be effective. © 2013 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

CANSE: A churn adaptive approach to network size estimation

CANSE: A churn adaptive approach to network size estimation

引用

16th IEEE International Conference on parallel and distributed Systems, ICPADS 2010

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

ISBN: (纸本)9780769543079

Network size is one of the fundamental information of distributed applications. The approach to estimate network size must feature both high accuracy and robustness in order to adapt to the dynamic environment in different topologies. However, existing approaches fail to guarantee accuracy and robustness simultaneously in dynamic topologies due to the randomness of nodes sampled. In this paper, we propose a churn adaptive approach to network size estimation - CANSE, which collects closest nodes in identification to each node's identification by sampling nodes periodically. Each node collects closest identifications by two schemes. One scheme is sampling random nodes from random walks along the topology. The other one is exchanging the closest identifications with other nodes. Finally, each node calculates the average spacing of the closest identifications collected to estimate network size. Compared with existing approaches, extensive experiments show that CANSE provides accurate estimation values quickly in various dynamic topologies. © 2010 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Delayed switch: Cloud service upgrade with low availability and capacity loss 5

Delayed switch: Cloud service upgrade with low availability ...

引用

2014 5th IEEE International Conference on Software Engineering and Service Science, ICSESS 2014

作者： Ouyang, Xue Ding, Bo Wang, Huaimin Parallel and Distributed Laboratory School of Computer Science National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781479932788

Cloud services must upgrade continuously in order to maintain competitive. However, a large body of empirical evidence suggests that, upgrade procedures used in practice are failure-prone and often cause planned or unplanned downtime. In this paper, we first define what is cloud service online upgrade, and then we analyze the shortcomings of current mainstream cloud service online upgrade mechanisms. In particular, the mixed version problem along with rolling upgrade and the capacity loss problem brought by split mode upgrade have been discussed. After that, we propose a solution called Delayed Switch, which can conduct cloud service upgrade with lower loss of availability and capacity in contrast with existing approaches. We prove the performance of delayed switch in theory and develop a prototype system applying this method. And by conducting experiments with a typical e-commerce service named Rubis, we validate the effectiveness and efficiency of our approach. © 2014 IEEE.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共53页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：