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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

762 篇 会议
239 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

642 篇 工学
- 506 篇 计算机科学与技术...
- 363 篇 软件工程
- 112 篇 信息与通信工程
- 66 篇 电子科学与技术（可...
- 63 篇 控制科学与工程
- 45 篇 生物工程
- 43 篇 机械工程
- 32 篇 电气工程
- 23 篇 仪器科学与技术
- 21 篇 动力工程及工程热...
- 15 篇 材料科学与工程（可...
- 15 篇 化学工程与技术
- 14 篇 网络空间安全
- 13 篇 土木工程
- 11 篇 力学（可授工学、理...
- 11 篇 农业工程
- 11 篇 环境科学与工程（可...
- 10 篇 建筑学
- 10 篇 交通运输工程
246 篇 理学
- 161 篇 数学
- 48 篇 生物学
- 36 篇 系统科学
- 35 篇 统计学（可授理学、...
- 34 篇 物理学
- 17 篇 化学
158 篇 管理学
- 106 篇 管理科学与工程(可...
- 55 篇 图书情报与档案管...
- 29 篇 工商管理
18 篇 法学
- 15 篇 社会学
12 篇 农学
11 篇 经济学
- 11 篇 应用经济学
8 篇 教育学
4 篇 医学
3 篇 文学
3 篇 军事学
2 篇 艺术学

主题

42 篇 distributed proc...
41 篇 laboratories
37 篇 computational mo...
29 篇 kernel
28 篇 concurrent compu...
28 篇 algorithm design...
27 篇 benchmark testin...
25 篇 fault tolerance
25 篇 computer archite...
25 篇 graphics process...
24 篇 hardware
22 篇 feature extracti...
22 篇 cloud computing
21 篇 servers
21 篇 protocols
20 篇 parallel process...
20 篇 throughput
20 篇 semantics
19 篇 distributed comp...
18 篇 bandwidth

机构

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 篇 national laborat...
14 篇 national laborat...
13 篇 national key lab...
13 篇 school of comput...
12 篇 national laborat...
12 篇 national key lab...
10 篇 national laborat...
10 篇 national key lab...
10 篇 national univers...

作者

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

语言

935 篇 英文
62 篇 中文
7 篇 其他

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

共 1004 条记录，以下是551-560 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Invalid pointer dereferences detection for CPS software based on extended pointer structures

Invalid pointer dereferences detection for CPS software base...

引用

2012 IEEE 6th International Conference on Software Security and Reliability Companion, SERE-C 2012

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

ISBN: (纸本)9780769547435

Invalid pointer dereferences, such as null pointer dereferences, dangling pointer dereferences and double frees, are a prevalent source of software bugs in CPS software, due to flexible dereferencing pointers along various pointer fields. Existing tools have high overhead or are incomplete, thereby limiting their efficiency in checking the kind of CPS software with shared and mutable memory. In this paper, we present a novel extended pointer structure for detecting all invalid pointer dereferences in this kind of CPS software. We propose an invalid pointer dereferences detection algorithm based on the uniform transformation of abstract heap states. Experimental evaluation about a set of large C benchmark programs shows that the proposed approach is sufficiently efficient in detecting invalid pointer dereferences of CPS software with shared and mutable memory. © 2012 IEEE.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Precise pointer analysis for list-manipulating programs based on quantitative separation logic

Precise pointer analysis for list-manipulating programs base...

引用

2012 IEEE International Conference on Information Science and Technology, ICIST 2012

作者： Dong, Longming Chen, Liqian Liu, Jiangchao Li, Renjian National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781457703454

Full precise pointer analysis has been a challenging problem, especially when dealing with dynamically-allocated memory. Separation logic can describe pointer alias formally, but cannot describe the quantitative reachability between pointers. In this paper, we present a symbolic framework for analyzing the reachability between pointers in list-manipulating programs. The precise points-to relations of pointers in lists are described by formulae of quantitative separation logic (QSL), and the analysis framework is based on the operational and rearrangement rules about the assignments of pointers. The fixpoint calculus and the counter symbolic abstraction are used to find loop invariants. We can get precise relations between pointers at each point of list-manipulating programs. In the end, several initial examples about list-manipulating programs are given to show that the approach can get precise pointer analysis for list-manipulating programs. © 2012 IEEE.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Bodhi: Detecting buffer overflows with a game

Bodhi: Detecting buffer overflows with a game

引用

2012 IEEE 6th International Conference on Software Security and Reliability Companion, SERE-C 2012

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

ISBN: (纸本)9780769547435

Buffer overflow is one of the most dangerous and common vulnerabilities in CPS software. Despite static and dynamic analysis, manual analysis is still heavily used which is useful but costly. Human computation harness humans' time and energy in a way of playing games to solve computational problems. In this paper we propose a human computation method to detect buffer overflows that does not ask a person whether there is a potential vulnerability, but rather a random person's idea. We implement this method as a game called Bodhi in which each player is shown a piece of code snippet and asked to choose whether their partner would think there is a buffer overflow vulnerability at a given position in the code. The purpose of the game is to make use of the rich distributed human resource to increase effectiveness of manual detection for buffer overflows. The game has been proven to be efficient and enjoyable in practice. © 2012 IEEE.

关键词： Buffer storage

来源：评论

学校读者我要写书评

暂无评论

Providing information services for wireless sensor networks through cloud computing

Providing information services for wireless sensor networks ...

引用

2012 7th IEEE Asia-Pacific Services Computing Conference, APSCC 2012

作者： You, Pengfei Peng, Yuxing Gao, Hang National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769548975

Wireless sensor networks (WSN) is a critical technology for information gathering covering many areas, including health-care, transportation, air traffic control and environment monitoring. Despite wide use, the fast increasing data emanating from WSN is not fully utilized due to the limitation for structure of WSN itself. Along with the further development of WSN, the data form which is not be efficiently managed and applied to supply information services for users. As the emerging IT technology, cloud computing supplies powerful utilization ability for IT resources, which makes many traditional applications migrate to cloud computing. In this paper, we propose a framework integrating cloud computing paradigm and WSN, which fully uses data process ability and service model for cloud computing. In the framework, data form WSN are efficiently utilized and managed, depending on which, information services for WSN are well provided to users. © 2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Research of context situation awareness technology

Research of context situation awareness technology

引用

作者： Shi, Dianxi Wu, Zhendong Ding, Bo Yan, Huining National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546698

Context situation, which means a snapshot of the status of the real world, is formed by integrating a large amount of contexts collected from various resources. How to get the context situation and use the situation to provide better services is a challenging issue. In this paper, we focused on this challenge on the basis of the mobile cloud computing architecture. An abstract model is proposed in this paper to uniformly collect the context and send them to cloud. A rule-based large-scale context aggregation algorithm is also proposed which utilizes the MapReduce computing paradigm. Finally, a large-scale context management framework based on the abstract model and the context aggregation algorithm is proposed, and a real-time traffic demo is implemented to verify the validity of the framework. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

On the feasibility of common-friend measurements for the distributed online social networks

On the feasibility of common-friend measurements for the dis...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed social networks have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose FDist, a distributed common-friend estimation scheme that estimates the number of common-friends between any pair of users without disclosing the friends' information. FDist uses privacy-preserving common-friend measurements to collect a small number of common-friend samples, and uses low-dimensional coordinates to estimate the number of common friends to other users. Simulation results on real-world social networks confirm that FDist is both scalable and accurate. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

BCE: A privacy-preserving common-friend estimation method for distributed online social networks without cryptography

BCE: A privacy-preserving common-friend estimation method fo...

引用

2012 7th International ICST Conference on Communications and Networking in China, CHINACOM 2012

作者： Fu, Yongquan Wang, Yijie National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Hunan province 410073 China

ISBN: (纸本)9781467326995

distributed online social networks (DOSN) have emerged recently. Nevertheless, recommending friends in the distributed social networks has not been exploited fully. We propose BCE (Bloom Filter based Common-Friend Estimation), a scalable and privacy-preserving common-friend estimation scheme that estimates the set of common friends without the need of cryptography techniques. First, BCE denotes each user using the identifiers created by the Peer-to-Peer underlay that are robust against the dictionary attacks. Second, BCE uses a Bloom filter to represent a friend list for scalability. Third, BCE estimates common friends of two users using the intersection of Bloom filters computed by one of their common friends, which ensures the privacy of friend lists against unknown users. Our privacy analysis shows that BCE hides the privacy of each user with a high probability. Simulations over real-world social-network data sets confirms that BCE is both accurate and scalable. © 2012 IEEE.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

DMSS: A dynamic memory scheduling system in server consolidation environments

DMSS: A dynamic memory scheduling system in server consolida...

引用

作者： Liu, Lanzheng Chu, Rui Zhu, Yongchun Zhang, Pengfei Wang, Liufeng National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Systems and Technology Group IBM China Beijing China

ISBN: (纸本)9780769546698

As the foundation of cloud computing, Server consolidation allows multiple computer infrastructures running as virtual machines in a single physical node. It improves the utilization of most kinds of resource but memory under x86 architecture. Because of inaccurate memory usage estimate and the lack of memory resource management, there is much service performance degradation in data centers, even though they have occupied a large amount of memory. Furthermore, memory becomes insufficient for a physical server when a lot of virtual machines depend on it. In order to improve this, we present a dynamic memory scheduling system called DMSS, which can manage memory resources in server consolidation environments and allocate memory among virtual machines on demand. We have designed and implemented the corresponding memory scheduling policy based on Xen virtualization platform to enhance memory efficiency and achieve service level agreement. The benchmark shows that DMSS can make an accurate and rapid response to memory changes and save more than 30% physical memory with less than 5% performance degradation. DMSS actually brings in economic benefits to cloud service providers because more virtual machines can be accommodated at lower costs. © 2012 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Failure-divergence semantics and refinement of long running transactions

Failure-divergence semantics and refinement of long running ...

引用

作者： Chen, Zhenbang Liu, Zhiming Wang, Ji National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China UNU-IIST P.O. Box 3058 China

Compensating CSP (cCSP) models long-running transactions. It can be used to specify service orchestrations written in programming languages like WS-BPEL. However, the original cCSP does not allow to model internal (non-deterministic) choice, synchronized parallel composition, hiding or recursion. In this paper, we introduce these operators and define for the extended language a failure-divergence (FD) semantics to allow reasoning about non-determinism, deadlock and livelock. Furthermore, we develop a refinement calculus that allows us to compare the level of non-determinism between long running transactions, and transform specifications for design and analysis. © 2012 Elsevier B.V. All rights reserved.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共101页 << < 52 53 54 55 56 57 58 59 60 61 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：