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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

849 篇 会议
290 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

723 篇 工学
- 568 篇 计算机科学与技术...
- 415 篇 软件工程
- 132 篇 信息与通信工程
- 80 篇 电子科学与技术（可...
- 76 篇 控制科学与工程
- 54 篇 生物工程
- 53 篇 机械工程
- 40 篇 电气工程
- 25 篇 动力工程及工程热...
- 24 篇 仪器科学与技术
- 21 篇 化学工程与技术
- 18 篇 材料科学与工程（可...
- 15 篇 网络空间安全
- 14 篇 土木工程
- 13 篇 建筑学
- 12 篇 力学（可授工学、理...
- 12 篇 农业工程
- 11 篇 交通运输工程
- 11 篇 环境科学与工程（可...
276 篇 理学
- 174 篇 数学
- 57 篇 生物学
- 47 篇 物理学
- 38 篇 系统科学
- 38 篇 统计学（可授理学、...
- 22 篇 化学
182 篇 管理学
- 124 篇 管理科学与工程(可...
- 61 篇 图书情报与档案管...
- 37 篇 工商管理
18 篇 法学
- 15 篇 社会学
17 篇 经济学
- 17 篇 应用经济学
13 篇 农学
9 篇 教育学
7 篇 医学
3 篇 文学
3 篇 军事学
2 篇 艺术学

主题

46 篇 distributed proc...
44 篇 laboratories
42 篇 computational mo...
31 篇 kernel
29 篇 algorithm design...
28 篇 concurrent compu...
28 篇 computer archite...
27 篇 graphics process...
27 篇 benchmark testin...
25 篇 fault tolerance
25 篇 hardware
24 篇 feature extracti...
23 篇 throughput
23 篇 semantics
22 篇 servers
22 篇 cloud computing
21 篇 parallel process...
21 篇 protocols
21 篇 training
20 篇 deep learning

机构

168 篇 national laborat...
134 篇 science and tech...
102 篇 college of compu...
88 篇 national laborat...
79 篇 national laborat...
37 篇 school of comput...
37 篇 national laborat...
28 篇 national key lab...
24 篇 national key lab...
22 篇 science and tech...
21 篇 national key lab...
18 篇 national laborat...
17 篇 laboratory of di...
16 篇 national laborat...
15 篇 national univers...
14 篇 national laborat...
14 篇 national key lab...
13 篇 national key lab...
13 篇 college of compu...
13 篇 school of comput...

作者

44 篇 yong dou
42 篇 wang huaimin
40 篇 li dongsheng
39 篇 dongsheng li
39 篇 dou yong
39 篇 liu jie
36 篇 wang ji
36 篇 huaimin wang
35 篇 ji wang
31 篇 xiaodong wang
31 篇 jie liu
30 篇 yijie wang
28 篇 wang yijie
26 篇 peng yuxing
26 篇 yin gang
25 篇 yuxing peng
25 篇 gang yin
22 篇 tao wang
21 篇 zhigang luo
21 篇 xicheng lu

语言

1,030 篇 英文
56 篇 其他
56 篇 中文

检索条件"机构=National Key Laboratory for Parallel and Distributed Processing"

共 1142 条记录，以下是1021-1030 订阅

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

详细简洁

排序：

Automating Software FMEA via Formal Analysis of Dependence Relations

Automating Software FMEA via Formal Analysis of Dependence R...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Wei Dong Ji Wang Changzhi Zhao Xian Zhang Jie Tian School of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing China

The paper presents the ongoing work of studying FMEA method for embedded safely critical software via formal analysis of various dependence relations among software elements, which can fairly improve the automation and precision of both system level and detailed level FMEA. These dependence relations are depicted by the formal models abstracted from software design and implementation, and the FMEA processes for both structural and object-oriented software are proposed respectively. The initial result of case study shows the effectiveness of the approach.

关键词： Software Unified modeling language Safety Aircraft Object oriented modeling Atmospheric modeling Software reliability

来源：评论

学校读者我要写书评

暂无评论

An Efficient Algorithm for the Least Areas Path Problem

An Efficient Algorithm for the Least Areas Path Problem

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Gaojun Fan Shiyao Jin Ational Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

The goal of the least areas path problem (LAPP) is to find a path traversing through a given region covered by a set of areas with any arbitrary shape, between a given pair of points and with the property that each point on the path is covered by the least areas. Different the weighted region optimal path problem, the LAPP asks for the cost of each step in path is as low as possible. Based on the relationship between boundaries of sub-regions and the least areas path, we can transform this continuous-domain problem to a discrete one by calculating the coverage of curves of sub-regionspsila boundaries. Depending on binary-search and breadth-first-search, an efficient and fast algorithm was devised for solving the LAPP.

关键词： Algorithm design and analysis Ad hoc networks Approximation algorithms Complexity theory Strontium Approximation methods Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Compiler-Assisted Application-Level Checkpointing for MPI Programs

Compiler-Assisted Application-Level Checkpointing for MPI Pr...

引用

IEEE International Conference on distributed Computing Systems

作者： Xuejun Yang Panfeng Wang Hongyi Fu Yunfei Du Zhiyuan Wang Jia Jia National Laboratory for Parallel & Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781424431748

Application-level checkpointing can decrease the overhead of fault tolerance by minimizing the amount of checkpoint data. However this technique requires the programmer to manually choose the critical data that should be saved. In this paper, we firstly propose a live-variable analysis method for MPI programs. Then, we provide an optimization method of data saving for application-level check-pointing based on the analysis method. Based on the theoretical foundation, we implement a source-to-source pre-compiler (ALEC) to automate application-level checkpointing. Finally, we evaluate the performance of five FOR-TRAN/MPI programs which are transformed and integrated checkpointing features by ALEC on a 512-CPU cluster system. The experimental results show that i)the application-level checkpointing based on live-variable analysis for MPI programs can efficiently reduce the amount of checkpoint data, thereby decrease the overhead of checkpoint and restart;ii)ALEC is capable of automating application-level checkpointing correctly and effectively.

关键词： checkpointing message passing mannose phosphate isomerase remote procedure calls artificial lung expanding compound optimization method Checkpoints Computer personnel Fault tolerance application layer

来源：评论

学校读者我要写书评

暂无评论

Optimal Placement of Application-Level Checkpoints

Optimal Placement of Application-Level Checkpoints

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Panfeng Wang Zhiyuan Wang Yunfei Du Xuejun Yang Haifang Zhou National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

One of the basic problems related to the efficient application-level checkpointing is the placement of checkpoints in the source codes. In this paper we discuss two common questions with a source-to-source precompiler ALEC: 1) if there are N checkpoints in the application's source code, how to pick M checkpoints out of them minimizing the total amount of checkpoint data? 2) if there are no checkpoint in the application's source code, how to insert a set of checkpoints minimizing the amount of checkpoint data? We reveal that these two questions can both be abstracted as a mathematic model which is similar to the 0-1 integer programming model, and the model can be solved using implicit enumeration method. The solving methods proposed in the paper have been implemented and integrated into ALEC. Experimental results show that the method is efficient.

关键词： Checkpointing Fault tolerance Fault tolerant systems Program processors Computers Flow graphs Data structures

来源：评论

学校读者我要写书评

暂无评论

Static Analysis for Application-Level Checkpointing of MPI Programs

Static Analysis for Application-Level Checkpointing of MPI P...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Panfeng Wang Yunfei Du Hongyi Fu Xuejun Yang Haifang Zhou National Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha Hunan China

Application-level checkpointing is a promising technology in the domain of large-scale scientific computing. The consistency of global checkpoint must be carefully guaranteed in order to correctly restore the computation. Usually, some complex coordinated protocols are employed to ensure the consistency of global checkpoint, which require logging orphan or in-transit messages during checkpointing. These protocols complicate the recovery of the computation and increase the checkpoint overhead due to logging message. In this paper, a new method which ensures the consistency of global checkpoint by static analysis is proposed. The method identifies the safe checkpointing regions in MPI programs, where the global checkpoint is always strongly consistent. All checkpoints are located in those safe checkpoint regions. During checkpointing, the method will not log any messages and introduce no extra overhead. The method was implemented and integrated into ALEC, which is a source-to-source precompiler for automating application-level checkpointing. The experimental results show that our method is effective.

关键词： Checkpointing Algorithms Flow graphs Protocols Fault tolerance Fault tolerant systems parallel machines

来源：评论

学校读者我要写书评

暂无评论

Load scheduling: Reducing Pressure on distributed Register files for free 08

Load scheduling: Reducing Pressure on Distributed Register f...

引用

2008 Asia and South Pacific Design Automation Conference (ASP-DAC 2008), part 1

作者： Mei Wen Nan Wu Maolin Guan Chunyuan Zhang National Laboratory for Parallel & Distributed Processing Chang Sha Hu Nan P.R. of China

ISBN: (纸本)9781424419227

In this paper we describe load scheduling, a novel method that balances load among register files by residual resources. Load scheduling can reduce register pressure for clustered VLIW processors with distributed register files while not increasing VLIW scheduling length. We have implemented load scheduling in compiler for Imagine and FT64 stream processors. The result shows that the proposed technique effectively reduces the number of variables spilled to memory, and can even eliminate it. The algorithm presented in this paper is extremely efficient in embedded processor with limited register resource because it can improve registers utilization instead of increasing the requirement for the number of registers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modelling with relational calculus of object and component systems - RCOS

Modelling with relational calculus of object and component s...

引用

作者： Chen, Zhenbang Hannousse, Abdel Hakim Van Hung, Dang Knoll, Istvan Li, Xiaoshan Liu, Zhiming Liu, Yang Nan, Qu Okika, Joseph C. Ravn, Anders P. Stolz, Volker Yang, Lu Zhan, Naijun International Institute for Software Technology United Nations University China Faculty of Science and Technology University of Macau Department of Computer Science Aalborg University Denmark Lab. of Computer Science Institute of Software CAS China National Laboratory for Parallel and Distributed Processing China

ISBN: (纸本)3540852883

This chapter presents a formalization of functional and behavioural requirements, and a refinement of requirements to a design for CoCoME using the Relational Calculus of Object and Component Systems (rCOS). We give a model of requirements based on an abstraction of the use cases described in Chapter 3.2. Then the refinement calculus of rCOS is used to derive design models corresponding to the top level designs of Chapter 3.4. We demonstrate how rCOS supports modelling different views and their relationships of the system and the separation of concerns in the development. © 2008 Springer-Verlag Berlin Heidelberg.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approximation for Weapon-Target Assignment

An Efficient Approximation for Weapon-Target Assignment

引用

ISECS International Colloquium on Computing, Communication, Control, and Management, CCCM

作者： Lina Chen ChuanJun Ren Su Deng C4ISR Technology National Defense Science and Technology Key Laboratory National University of Defense Technology Changsha Hunan China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha Hunan China

The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. We present firstly a technique founded on the use weapon cell, which enables one-to-many mapping about weapon-target to become one-to-one mapping. Next, we introduce a framework of solving the WTA problem. Based on this framework, an approximation algorithm that is grounded on the rules about weapon cells and targets is proposed. Finally, the simulative results show that the proposed algorithm indeed is very efficient.

关键词： Weapons Heuristic algorithms Algorithm design and analysis Resource management Artificial neural networks Genetic algorithms Operations research

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Flexible Routing in Grouped DHTs

Flexible Routing in Grouped DHTs

引用

International Conference on Peer-to-Peer Computing

作者： Yiming Zhang Dongsheng Li Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve this, in this paper we present grouped tapestry (GTap), a novel tapestry-based DHT that supports organizing nodes into groups and allows flexible DHT routing. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.

关键词： Routing Fingers Peer to peer computing Maintenance engineering Security Availability Data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共115页 << < 99 100 101 102 103 104 105 106 107 108 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：