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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

389 篇 会议
137 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

328 篇 工学
- 251 篇 计算机科学与技术...
- 187 篇 软件工程
- 65 篇 信息与通信工程
- 35 篇 电子科学与技术（可...
- 33 篇 控制科学与工程
- 25 篇 电气工程
- 21 篇 机械工程
- 20 篇 生物工程
- 15 篇 仪器科学与技术
- 15 篇 动力工程及工程热...
- 8 篇 环境科学与工程（可...
- 7 篇 农业工程
- 6 篇 土木工程
- 6 篇 化学工程与技术
- 6 篇 网络空间安全
- 5 篇 力学（可授工学、理...
- 5 篇 材料科学与工程（可...
- 5 篇 冶金工程
137 篇 理学
- 91 篇 数学
- 27 篇 系统科学
- 21 篇 生物学
- 18 篇 物理学
- 18 篇 统计学（可授理学、...
- 8 篇 化学
85 篇 管理学
- 52 篇 管理科学与工程(可...
- 36 篇 图书情报与档案管...
- 15 篇 工商管理
11 篇 经济学
- 11 篇 应用经济学
10 篇 法学
- 9 篇 社会学
8 篇 农学
- 7 篇 作物学
3 篇 文学
3 篇 医学
3 篇 军事学
1 篇 教育学
1 篇 艺术学

主题

29 篇 computational mo...
18 篇 benchmark testin...
18 篇 distributed proc...
17 篇 concurrent compu...
17 篇 laboratories
15 篇 algorithm design...
14 篇 fault tolerance
14 篇 computer archite...
13 篇 deep learning
13 篇 feature extracti...
13 篇 kernel
13 篇 training
12 篇 computer science
12 篇 parallel process...
12 篇 cloud computing
11 篇 application soft...
11 篇 graphics process...
11 篇 servers
11 篇 semantics
11 篇 hardware

机构

81 篇 national laborat...
78 篇 science and tech...
52 篇 college of compu...
35 篇 school of comput...
25 篇 national laborat...
22 篇 science and tech...
22 篇 national key lab...
20 篇 national laborat...
16 篇 national laborat...
15 篇 school of comput...
14 篇 science and tech...
14 篇 national laborat...
12 篇 national key lab...
9 篇 national key lab...
8 篇 national key lab...
7 篇 department of co...
7 篇 national laborat...
7 篇 college of compu...
6 篇 college of compu...
6 篇 college of compu...

作者

20 篇 yijie wang
19 篇 wang yijie
15 篇 zhigang luo
15 篇 peng yuxing
15 篇 wang huaimin
14 篇 ji wang
13 篇 naiyang guan
12 篇 dongsheng li
12 篇 liu jie
12 篇 huaimin wang
12 篇 jie liu
11 篇 wang ji
10 篇 wang huai-min
10 篇 fu yongquan
9 篇 yuxing peng
9 篇 peichang shi
9 篇 guibin wang
9 篇 xuhui huang
9 篇 xu xinhai
9 篇 kai lu

语言

497 篇 英文
30 篇 中文
1 篇 其他

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

共 528 条记录，以下是231-240 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Correntropy Supervised Non-negative Matrix Factorization

Correntropy Supervised Non-negative Matrix Factorization

引用

International Joint Conference on Neural Networks

作者： Wenju Zhang Naiyang Guan Dacheng Tao Bin Mao Xuhui Huang Zhigang Luo Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan China 410073 Center for Quantum Computation and Intelligent Systems FEIT University of Technology Sydney Sydney NSW 2007 Australia College of Science National University of Defense Technology Changsha Hunan China 410073 Department of Computer Science and Technology College of Computer National University of Defense Technology Changsha Hunan China 410073

ISBN: (纸本)9781479919611

Non-negative matrix factorization (NMF) is a powerful dimension reduction method and has been widely used in many pattern recognition and computer vision problems. However, conventional NMF methods are neither robust enough as their loss functions are sensitive to outliers, nor discriminative because they completely ignore labels in a dataset. In this paper, we proposed a correntropy supervised NMF (CSNMF) to simultaneously overcome aforementioned deficiencies. In particular, CSNMF maximizes the correntropy between the data matrix and its reconstruction in low-dimensional space to inhibit outliers during learning the subspace, and narrows the minimizes the distances between coefficients of any two samples with the same class labels to enhance the subsequent classification performance. To solve CSNMF, we developed a multiplicative update rules and theoretically proved its convergence. Experimental results on popular face image datasets verify the effectiveness of CSNMF comparing with NMF, its supervised variants, and its robustified variants.

关键词： NMF subsequent classification NMF protocol matrix decomposition outliers Nonnegative LOSS FUNCTION images REDUCTION METHODS Dataset computer vision

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving for network coding in smart grid 15th

Privacy preserving for network coding in smart grid

引用

15th International Conference on Algorithms and Architectures for parallel processing, ICA3PP 2015

作者： He, Shiming Zeng, Weini Xie, Kun Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication Engineering Hunan Province Engineering Research Center of Electric Transportation and Smart Distributed Network Changsha University of Science and Technology Changsha410114 China The 716th Research Institute China Shipbuilding Industry Corporation Lianyungang222061 China College of Computer Science and Electronics Engineering Hunan University Changsha410082 China Department of Electrical and Computer Engineering State University of New York at Stony Brook New York United States

ISBN: (纸本)9783319271361

In smart grid, privacy implications to individuals and their family is an important issue, due to the fine-grained usage data collection. Wireless communications are considered by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, Network Coding introduces new challenge for privacy preserving due to the encoding of packet in forwarder nodes. We propose a distributed privacy preserving scheme for network coding in smart grid, which considers the converged flows character of smart grid and exploits a homomorphic encryption function to decrease the complex in forwarder node. The message content of packet is encrypted and the tag of packet is encrypted by homomorphic encryption function. Then the forwarder node linear random codes the encrypted message contents and directly processes the tags cryptotext based on the homomorphism feature. It offers message content confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme. © Springer International Publishing Switzerland 2015.

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

AUModel: A conceptual model for adaptive software 5

AUModel: A conceptual model for adaptive software

引用

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

作者： Liu, Hui Ding, Bo Shi, Dianxi Wang, Huaimin National Key Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha Hunan410073 China

ISBN: (纸本)9781479932788

Pervasive software should be able to adapt itself to the changing environments and user requirements. Obviously, it will bring great challenges to the software engineering practice. This paper proposes AUModel, a conceptual model for adaptive software, which takes adaptability as an inherent feature and can act as the foundation of the engineering process. By introducing AUModel, the reuse of software adaptation infrastructure as well as the separation of adaptation concerns are enabled, which can facilitate both the development and maintenance of adaptive software. This paper also presents our initial attempts to realize this model, including a middleware prototype to support this model and an application to validate its effectiveness. © 2014 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Synchronization error detection of MPI programs by symbolic execution 21

Synchronization error detection of MPI programs by symbolic ...

引用

21st Asia-Pacific Software Engineering Conference, APSEC 2014

作者： Fu, Xianjin Chen, Zhenbang Huang, Chun Dong, Wei Wang, Ji Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781479974252

Asynchrony based overlapping of computation and communication is commonly used in MPI applications. However, this overlapping introduces synchronization errors frequently in asynchronous MPI programming. In this paper, we propose a symbolic execution based method for detecting input-related synchronization errors. The path space of an MPI program is systematically explored, and the related operations of the synchronization errors in the program are checked specifically. In addition, two optimizations are proposed to improve the efficiency. We have implemented our method as a prototype tool based on the symbolic executor Cloud9. The results of the extensive experiments indicate the effectiveness of our method. © 2014 IEEE.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers 14

Efficient deterministic multithreading without global barrie...

引用

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

作者： Lu, Kai Zhou, Xu Bergan, Tom Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China University of Washington Computer Science and Engineering United States

ISBN: (纸本)9781450326568

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 17 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. Copyright © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers

Efficient deterministic multithreading without global barrie...

引用

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 16 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

VAWS: Constructing trusted open computing system of mapreduce with verified participants

VAWS: Constructing trusted open computing system of mapreduc...

引用

作者： Ding, Yan Wang, Huaimin Wei, Lifeng Chen, Songzheng Fu, Hongyi Xu, Xinhai School of Computer National University of Defense Technology Changsha HN China National Laboratory for Parallel and Distributed Processing National Univ. of Defense Technology Changsha HN China

MapReduce is commonly used as a parallel massive data processing model. When deploying it as a service over the open systems, the computational integrity of the participants is becoming an important issue due to the untrustworthy workers. Current duplication-based solutions can effectively solve non-collusive attacks, yet most of them require a centralized worker to re-compute additional sampled tasks to defend collusive attacks, which makes the worker a bottleneck. In this paper, we try to explore a trusted worker scheduling framework, named VAWS, to detect collusive attackers and assure the integrity of data processing without extra re-computation. Based on the historical results of verification, we construct an Integrity Attestation Graph (IAG) in VAWS to identify malicious mappers and remove them from the framework. To further improve the efficiency of identification, a verification-couple selection method with the IAG guidance is introduced to detect the potential accomplices of the confirmed malicious worker. We have proven the effectiveness of our proposed method on the improvement of system performance in theoretical analysis. Intensive experiments show the accuracy of VAWS is over 97% and the overhead of computation is closed to the ideal value of 2 with the increasing of the number of map tasks in our scheme. Copyright © 2014 The Institute of Electronics, Information and Communication Engineers.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Location-Aware Multi-user Resource Allocation in distributed Clouds

Location-Aware Multi-user Resource Allocation in Distributed...

引用

10th Annual Conference of Advanced computer Architecture, ACA 2014

作者： Li, Jiaxin Li, Dongsheng Zheng, Jing Quan, Yong National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Information Center of Logistics Department Beijing China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

Resource allocation for multi-user across multiple data centers is an important problem in cloud computing environments. Many geographically-distributed users may request virtualized resources simultaneously. And the distances from users to allocated resources have much impact on the quality of service (QoS) in multiple data centers environment. Most existing methods do not take all these factors into account when allocating resources. They usually result in poor runtime performance of users' virtual computing environment and the remarkable difference of users' QoS. In this paper, we propose RAMD, a resource allocation algorithm based on multi-stage decision in multiple data centers. The RAMD algorithm allocate VMs to users, taking into account the correlation and interaction between multiple users, so as to minimize the sum of all users' service distances (i.e. determined by user location and network distance of virtual machines). Experimental results show that the algorithm can effectively deal with the cloud resource allocation for multi-user across multiple data centers. It can improve the runtime performance of users' virtualized resources and reduce the difference of QoS. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

IWFR:Exploiting Full-duplex in Wireless Relay Networks

IWFR:Exploiting Full-duplex in Wireless Relay Networks

引用

2014 4th IEEE International Conference on Information science and technology

作者： Yong Lu Shaohe Lv Xiaodong Wang Xingming Zhou National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology

Traditional wireless relay networks have large endto-end time delay and low throughput because of the limit that it can't receive and forward at the same *** this paper,we proposed IWFR:Immediate Wireless Full-Duplex Relay which exploits the advantages of full-duplex to shorten the end-to-end time delay and improve the *** the same time,we designed a new implicit acknowledgement mechanism,which can eliminate the ACK overheads and evidently improve the throughput of the *** implement IWFR,we also modified the full-duplex node architecture to make it support for immediate *** shows that IWFR shortens the end-to-end time delay by 60%on average and improves the throughput to 240%of the original relay.

关键词： Relay IWFR:Exploiting Full-duplex in Wireless Relay Networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共53页 << < 20 21 22 23 24 25 26 27 28 29 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：