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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

451 篇 会议
207 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

418 篇 工学
- 322 篇 计算机科学与技术...
- 250 篇 软件工程
- 85 篇 信息与通信工程
- 56 篇 控制科学与工程
- 43 篇 电子科学与技术（可...
- 43 篇 生物工程
- 32 篇 机械工程
- 26 篇 电气工程
- 18 篇 动力工程及工程热...
- 14 篇 仪器科学与技术
- 14 篇 化学工程与技术
- 11 篇 交通运输工程
- 11 篇 网络空间安全
- 9 篇 光学工程
- 9 篇 土木工程
- 8 篇 材料科学与工程（可...
- 8 篇 环境科学与工程（可...
- 8 篇 生物医学工程（可授...
- 7 篇 农业工程
170 篇 理学
- 94 篇 数学
- 43 篇 生物学
- 29 篇 物理学
- 25 篇 统计学（可授理学、...
- 24 篇 系统科学
- 18 篇 化学
114 篇 管理学
- 81 篇 管理科学与工程(可...
- 37 篇 图书情报与档案管...
- 25 篇 工商管理
17 篇 法学
- 13 篇 社会学
12 篇 经济学
- 12 篇 应用经济学
8 篇 农学
7 篇 医学
6 篇 教育学
3 篇 文学
2 篇 军事学
1 篇 艺术学

主题

26 篇 training
25 篇 computational mo...
24 篇 feature extracti...
19 篇 deep learning
18 篇 cloud computing
15 篇 machine learning
14 篇 benchmark testin...
14 篇 hardware
14 篇 accuracy
12 篇 task analysis
12 篇 computer archite...
12 篇 neural networks
12 篇 educational inst...
12 篇 convolution
12 篇 algorithm design...
12 篇 kernel
12 篇 distributed data...
11 篇 servers
11 篇 data models
10 篇 quality of servi...

机构

111 篇 college of compu...
77 篇 science and tech...
41 篇 national laborat...
26 篇 college of compu...
22 篇 science and tech...
21 篇 key laboratory o...
18 篇 national laborat...
16 篇 science and tech...
14 篇 science and tech...
14 篇 national laborat...
13 篇 school of comput...
12 篇 college of compu...
12 篇 national key lab...
11 篇 national key lab...
11 篇 national key lab...
10 篇 national key lab...
10 篇 national key lab...
10 篇 national laborat...
9 篇 college of compu...
9 篇 national key lab...

作者

28 篇 dongsheng li
24 篇 yijie wang
23 篇 li dongsheng
23 篇 wang huaimin
20 篇 zhigang luo
20 篇 wang yijie
20 篇 huaimin wang
18 篇 naiyang guan
18 篇 lu jun
17 篇 jun lu
16 篇 liu jie
16 篇 peng yuxing
14 篇 dou yong
13 篇 yuxing peng
13 篇 qiao peng
13 篇 jie liu
12 篇 xiang zhang
12 篇 lai zhiquan
12 篇 yin gang
11 篇 ding bo

语言

626 篇 英文
26 篇 中文
11 篇 其他

检索条件"机构=Science and Technology on Parallel and Distributed Laboratory College of Computer"

共 663 条记录，以下是561-570 订阅

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

详细简洁

排序：

Research on online failure prediction model and status pretreatment method for exascale system

Research on online failure prediction model and status pretr...

引用

3rd International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2011

作者： Zhou, Hao Jiang, Yanhuang National Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769545578

The reliability issue of Exascale system is extremely serious. Traditional passive fault-tolerant methods, such as rollback-recovery, can not fully guarantee system reliability any more because of their large executing overhead and long recovering duration. Active fault tolerance is expected to become another important fault-tolerant approach for Exascale system. Focusing on system failure prediction, which is one key step of active fault tolerance, we construct online failure prediction model and research on the effective method of system status pretreatment. In order to improve the accuracy and real-time feature of current methods, the proposed Improved Adaptive Semantic Filter (IASF) method processes the latest system logs regularly, filtering useless information out of them according to their semantics. Adopting the main idea of Vector Space Model (VSM), IASF method creates Event Vector corresponding to each log record. By calculating the cosine of vectorial angle, it evaluates the semantics correlation between different log records, and then executes temporal and spatial redundant filter considering the burst feature of log records. IASF method is insensitive to the type of system log and does not introduce any expert system or domain knowledge. The experiment result shows that system can eliminate about 99.6% of useless log records after executing IASF method. © 2011 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Global EDF-based online, energy-efficient real-time scheduling in multi-core platform

Global EDF-based online, energy-efficient real-time scheduli...

引用

IEEE International Conference on computer science and Automation Engineering

作者： Zhang, Dongsong Chen, Fangyuan Jin, Shiyao National Laboratory of Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781424487257

As the energy consumption becomes increasingly prominent, how to meet time constraints while reducing the energy consumption as much as possible is a fundamental problem of the real-time scheduling in multi-core systems. Most of the existing energy-efficient scheduling approaches make assumptions on the properties of the scheduled tasks. In general, the properties of a task are unknown in advance until the task arrives. Thus, these approaches for deterministic tasks are not suitable to the general tasks. To schedule general tasks without prior knowledge of their properties, we propose an online and energy-efficient scheduling algorithm, based on Global Earliest Deadline First, for hard real-time tasks in multi-core processor platform. We propose a novel approach to decrease the execution frequency of tasks, and achieve a reasonable compromise between the time constraint and saved energy. This is ensured by utilizing the slack time of tasks and the dynamic voltage/frequency scaling techniques. The evaluation results show that our algorithm is well applied to the two types of dynamic voltage/frequency scaling techniques, and out-performs the Global EDF algorithm in terms of the saved energy. Specifically, our algorithm improves the saved energy of the Global EDF algorithm by at most 10% to 15% under real discrete dynamic voltage/frequency scaling levels. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

An efficient two-level bitmap index for cloud data management

An efficient two-level bitmap index for cloud data managemen...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011

作者： Bin, Huang Yu-Xing, Peng School of Computer Science Wuhan University Wuhan China National Laboratory of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9781612844855

A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. To fully harness the power of the Cloud, efficient data management is needed to handle huge volumes of data and support a large number of concurrent end users. To achieve that, a scalable and high-throughput indexing scheme is generally required. Such an indexing scheme must support parallel search to improve scalability. In this paper, we present a bitmap based indexing scheme for efficient data processing in the Cloud. Our approach can be summarized as follows. First, we build a local bitmap index for each compute node which only indexes data residing on the node. Second, we organize the compute nodes as a structured overlay and each node maintains a portion of the global index for the whole different data. The global index is also bitmap index to indicate the node each data resides in. Third, all bitmaps are compressed by adopting run-length coding for reducing storage requirement. We conduct extensive experiments on a LAN, and the results demonstrate that our indexing scheme is dynamic, efficient and scalable. © 2011 IEEE.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Efficient approach for repeated patterns mining based on indent shape of HTML documents

Efficient approach for repeated patterns mining based on ind...

引用

3rd International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC 2011

作者： Zhu, Yanxu Yin, Gang Wang, Huaimin Shi, Dianxi Rao, Xiang Yuan, Lin School of Computer National Laboratory for Parallel and Distributed Processing National University of Defense Technology 410073 Changsha Hunan China College of Electronic Technology Information Engineering University 450004 Zhengzhou Henan China

ISBN: (纸本)9780769545578

Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches. © 2011 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

A wikipedia based semantic graph model for topic tracking in blogosphere

A wikipedia based semantic graph model for topic tracking in...

引用

22nd International Joint Conference on Artificial Intelligence, IJCAI 2011

作者： Tang, Jintao Wang, Ting Lu, Qin Wang, Ji Li, Wenjie College of Computer National University of Defense Technology Changsha China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong National Laboratory for Parallel and Distributed Processing Changsha China

ISBN: (纸本)9781577355120

There are two key issues for information diffusion in blogosphere: (1) blog posts are usually short, noisy and contain multiple themes, (2) information diffusion through blogosphere is primarily driven by the "word-of- mouth" effect, thus making topics evolve very fast. This paper presents a novel topic tracking approach to deal with these issues by modeling a topic as a semantic graph, in which the semantic relatedness between terms are learned from Wikipedia. For a given topic/post, the name entities, Wikipedia concepts, and the semantic relatedness are extracted to generate the graph model. Noises are filtered out through the graph clustering algorithm. To handle topic evolution, the topic model is enriched by using Wikipedia as background knowledge. Furthermore, graph edit distance is used to measure the similarity between a topic and its posts. The proposed method is tested by using the real-world blog data. Experimental results show the advantage of the proposed method on tracking the topic in short, noisy texts.

关键词： Blogs

来源：评论

学校读者我要写书评

暂无评论

Toward optimal deployment of communication-intensive cloud applications

Toward optimal deployment of communication-intensive cloud a...

引用

International Conference on Cloud Computing

作者： Fan, Pei Wang, Ji Zheng, Zibin Lyu, Michael R. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780769544601

Strongly promoted by the leading industrial companies, cloud computing becomes increasingly popular in recent years. The growth rate of cloud computing surpasses even the most optimistic predictions. A cloud application is a large-scale distributed system that consist a lot of distributed cloud nodes. How to make optimal deployment of cloud applications is a challenging research problem. When deploying a cloud application to the cloud environment, cloud node ranking is one of the most important approaches for selecting optimal cloud nodes for the cloud application. Traditional ranking methods usually rank the cloud nodes based on their QoS values, without considering the communication performance between cloud nodes. However, such kind of node relationship is very important for the communication-intensive cloud applications (e.g., Message Passing Interface (MPI) programs), which have a lot of communications between the selected cloud nodes. In this paper, we propose a novel clustering-based method for selecting optimal cloud nodes for deploying communication-intensive applications to the cloud environment. Our method not only takes into account the cloud node qualities, but also the communication performance between different nodes. We deploy several well-known MPI programs on a real-world cloud and compare our method with other methods. The experimental results show the effectiveness of our cluster-based method. © 2011 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Research on Online Failure Prediction Model and Status Pretreatment Method for Exascale System

Research on Online Failure Prediction Model and Status Pretr...

引用

International Conference on Cyber-Enabled distributed Computing and Knowledge Discovery, CyberC

作者： Hao Zhou Yanhuang Jiang National Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China

关键词： Fault tolerance Fault tolerant systems Vectors Correlation Information filters Predictive models

来源：评论

学校读者我要写书评

暂无评论

不确定数据流上的并行Skyline查询算法

不确定数据流上的并行Skyline查询算法

引用

第29届中国数据库学术会议

作者： WANG Guangdong 王广东 WANG Yijie 王意洁 LI Xiaoyong 李小勇 WANG Yuan 王媛 National Key Laboratory for Parallel and Distributed Processing College of Computer Science Nation 国防科技大学计算机学院并行与分布处理国家重点实验室长沙410073

不确定数据流上的Skyline查询技术逐步引起研究者的关注，传统的集中式流处理算法难以满足海量数据的查询需求，并且云计算所提供的海量计算资源和有效的存储管理模式，为研究并行Skyline查询技术提供了充足的条件。基于上述事实，提出... 详细信息

不确定数据流上的Skyline查询技术逐步引起研究者的关注，传统的集中式流处理算法难以满足海量数据的查询需求，并且云计算所提供的海量计算资源和有效的存储管理模式，为研究并行Skyline查询技术提供了充足的条件。基于上述事实，提出了一种不确定数据流上的并行Skyline查询算法(PSUDS)。该算法通过交叉划分滑动窗口的方式，将集中式流查询转化为并行处理，以并行执行的方式来解决集中式算法处理性能不足的问题。大量实验结果表明，该算法具有较好的并行可扩展性。

关键词：不确定数据流云计算并行处理查询算法性能测试

来源：评论

学校读者我要写书评

暂无评论

基于物理轨迹数据和社会网络的泛化行程推荐

基于物理轨迹数据和社会网络的泛化行程推荐

引用

第六届中国传感器网络学术会议(CWSN 2012)

作者： MENG Xiang-Xu 孟祥旭 WANG Xiao-Dong 王晓东 ZHOU Xing-Ming 周兴铭 National Key Laboratory of Parallel and Distributed Processing(College of Computer Science National 并行与分布处理国家重点实验室(国防科学技术大学计算机学院) 湖南长沙410073

人类活动行程的制定往往基于宽泛的最初意向，通过综合考虑各种约束条件加以优化而完成。当前，基于位置点名称查找的行程制定方法，不支持用户一次性提交多个具有时序关系的宽泛出行意向，更不能同时为多个地理位置点提供详细的最优驾... 详细信息

人类活动行程的制定往往基于宽泛的最初意向，通过综合考虑各种约束条件加以优化而完成。当前，基于位置点名称查找的行程制定方法，不支持用户一次性提交多个具有时序关系的宽泛出行意向，更不能同时为多个地理位置点提供详细的最优驾车方案。基于位置社交网络信息和车辆历史轨迹数据，探索了支持用户多个模糊意向输入的泛化行程推荐框架，主要工作包括：(1)对泛化的行程推荐问题进行建模;(2)设计并实现了基于分类树的地理位置点(POI)查询策略和算法;(3)提出了基于Voronoi图的GPS轨迹分析模型，并实现了任意两个位置点间最优行驶路径计算方法;(4)联合社会网络和语义交通信息图，基于蚁群算法进行行程的推荐，并实现了原型系统。实验及问卷调查结果表明，推荐结果的用户满意度可达80％。

关键词：行程规划泛化模型优化设计物理轨迹数据社会网络

来源：评论

学校读者我要写书评

暂无评论

An effective control scheme to ensure real-time causal order in large-scale distributed interactive simulations

An effective control scheme to ensure real-time causal order...

引用

2011 IEEE 3rd International Conference on Communication Software and Networks, ICCSN 2011

作者： Zhou, Hangjun Fu, Sha Department of Information Management Hunan University of Finance and Economics Chang Sha Hu Nan China Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing School of Computer Science National University of Defense Technology Chang Sha Hu Nan China

ISBN: (纸本)9781612844855

When a large-scale distributed interactive simulation system is running on WAN, the sites usually disperse over a wide area in geography, which results in the simulation clock of each site is hardly to be accurately synchronized with that of other sites. The asynchronous clocks and large transmission latency on WAN bring on a problem for the large-scale simulations to preserve the real-time causal order delivery of received events at each site. In this article, we analyze the indirect way to compare the values of asynchronous simulation clocks at first, and then propose a novel scheme which can select the reconstructible causal control information for each message so as to ensure the causal ordering of events in real time. Experiments demonstrate that the scheme can weaken the effect of network latency, reduce the overhead of the transmission amount of control information and improve the causal order consistency in asynchronous distributed simulations. © 2011 IEEE.

关键词： Real time control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共67页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：