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

International Conference on Intelligent Human-Machine Systems and Cybernetics

作者： Yao, Lu Cao, Wei Li, Zongzhe Wang, Yongxian Wang, Zhenghua National Key Lab. for Parallel and Distributed Processing National Univ. of Defense Technology Changsha China

ISBN: (纸本)9780769541518

The independent set ordering algorithm is a heuristic algorithm based on finding maximal independent sets of vertices in the matrix adjacency graph, which is commonly used for parallel matrix factorization. However, Disadvantages appear when it is applied to large-scale sparse linear systems. In this paper, we propose an improved algorithm by finding an optimal size of independent set in each elimination step rather than find a maximal independent set, which is proved to be effective by both theoretical analysis and parallel implementation. © 2010 IEEE.

关键词： Lower-upper decomposition

来源：评论

学校读者我要写书评

暂无评论

Modeling organization structure of multi-agent system

Modeling organization structure of multi-agent system

引用

2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology

作者： Xinjun, Mao Ji, Wang Jiajia, Chen National Laboratory for Parallel and Distributed Processing 300 Lichen Road Changsha Hunan Province 410073 China

ISBN: (纸本)0769524168

Organization concepts can act as abstractions to analyze and design multi-agent system (MAS). Organizational structure is such an abstraction used to describe the overall architecture of MAS and therefore to design AOSE methodology. The paper investigates how to model and analyze the organization structure in different development phases and abstract levels when developing MAS. A visual modeling language and a development process are presented. Various structural relationships are identified and defined. An information system example is also illustrated. © 2005 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Effective Anomaly Detection Based on Reinforcement Learning in Network Traffic Data 27

Effective Anomaly Detection Based on Reinforcement Learning ...

引用

27th IEEE International Conference on parallel and distributed Systems, ICPADS 2021

作者： Wang, Zhongyang Wang, Yijie Xu, Hongzuo Wang, Yongjun National University of Defense Technology Science and Technology on Parallel Distributed Processing Laboratory College of Computer China

ISBN: (纸本)9781665408783

Mixed-type data with both categorical and numerical features are ubiquitous in network security, but the existing methods are minimal to deal with them. Existing methods usually process mixed-type data through feature conversion, whereas their performance is downgraded by information loss and noise caused by the transformation. Meanwhile, existing methods usually superimpose domain knowledge and machine learning in which fixed thresholds are used. It cannot dynamically adjust the anomaly threshold to the actual scenario, resulting in inaccurate anomalies obtained, which results in poor performance. To address these issues, this paper proposes a novel Anomaly Detection method based on Reinforcement Learning, termed ADRL, which uses reinforcement learning to dynamically search for thresholds and accurately obtain anomaly candidate sets, fusing domain knowledge and machine learning fully and promoting each other. Specifically, ADRL uses prior domain knowledge to label known anomalies and uses entropy and deep autoencoder in the categorical and numerical feature spaces, respectively, to obtain anomaly scores combining with known anomaly information, which are integrated to get the overall anomaly scores via a dynamic integration strategy. To obtain accurate anomaly candidate sets, ADRL uses reinforcement learning to search for the best threshold. Detailedly, it initializes the anomaly threshold to get the initial anomaly candidate set and carries on the frequent rule mining to the anomaly candidate set to form the new knowledge. Then, ADRL uses the obtained knowledge to adjust the anomaly score and get the score modification rate. According to the modification rate, different threshold modification strategies are executed, and the best threshold, that is, the threshold under the maximum modification rate, is finally obtained, and the modified anomaly scores are obtained. The scores are used to re-carry out machine learning to improve the algorithm's accuracy for anomalo

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Fault tolerant Lu factorization in transactional memory system

Fault tolerant Lu factorization in transactional memory syst...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

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

ISBN: (纸本)9781479916603

With the popularization of multi-core processors, transaction memory, as a concurrent control mechanism with easy programing and high scalability, has attracted more and more attention. As a result, the reliability problems of transactional memory become a concerning issue. This paper addresses a transactional implementation of the Lu benchmark of SPLASH-2, and proposes a fault-tolerant Lu algorithm for this transactionalize Lu algorithm. The fault-tolerant Lu uses the data-versioning mechanism of the transactional memory system, detects errors based on transactions and recovers the error by rolling back the error transaction. The experiments show that the fault-tolerant Lu can get a better fault tolerance effect under a smaller cost. © 2013 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Versionized process based on non-volatile random-access memory for fine-grained fault tolerance

引用

Frontiers of Information Technology & Electronic Engineering 2018年第2期19卷 192-205页

作者： Wen-zhe ZHANG Kai LU Xiao-ping WANG Science and Technology on Parallel and Distributed Processing Laboratory College of ComputerNational University of Defense Technology

Non-volatile random-access memory（NVRAM） technology is maturing rapidly and its byte-persistence feature allows the design of new and efficient fault tolerance mechanisms. In this paper we propose the versionized process（Ver P）, a new process model based on NVRAM that is natively non-volatile and fault tolerant. We introduce an intermediate software layer that allows us to run a process directly on NVRAM and to put all the process states into NVRAM, and then propose a mechanism to versionize all the process data. Each piece of the process data is given a special version number, which increases with the modification of that piece of data. The version number can effectively help us trace the modification of any data and recover it to a consistent state after a system *** with traditional checkpoint methods, our work can achieve fine-grained fault tolerance at very little cost.

关键词： Non-volatile memory Byte-persistence Versionized process Version number

来源：评论

学校读者我要写书评

暂无评论

Automatic Data Distribution for Improving Data Locality on the Cell BE Architecture

Automatic Data Distribution for Improving Data Locality on t...

引用

22nd International Workshop on Languages and Compilers for parallel Computing

作者： Wang, Miao Bodin, Francois Matz, Sebastien National Laboratory for Parallel and Distributed Processing NUDT China CAPS Entreprise Rennes France University of Rennes 1 Rennes France

ISBN: (纸本)9783642133732

Multicore systems provide potential to improve the performance of the applications. However, substantial programming effort is required to exploit the power of the parallelism. This paper presents a single source compiler to map the data-parallel programs onto Cell Broadband Engine. Based on the distributed memory model, the compiler performs automatic data distribution and generates SPMD programs with message-passing primitives for Cell. We evaluate our compiler using a range of computation intensive benchmarks, high performance is achieved on Cell platform. In contrast to OpenMP, our method can fully exploit data locality through managing the shared data using inter-processor communication instead of accessing main memory, which significantly reduces the off-chip memory access overhead.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Exploring the patterns of social behavior in Github 1

Exploring the patterns of social behavior in Github

引用

1st International Workshop on Crowd-Based Software Development Methods and Technologies, CrowdSoft 2014

作者： Yu, Yue Yin, Gang Wang, Huaimin Wang, Tao National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450332248

Social coding paradigm is reshaping the distributed soft- ware development with a surprising speed in recent years. Github, a remarkable social coding community, attracts a huge number of developers in a short time. Various kinds of social networks are formed based on social activities among developers. Why this new paradigm can achieve such a great success in attracting external developers, and how they are connected in such a massive community, are interesting questions for revealing power of social coding paradigm. In this paper, we firstly compare the growth curves of project and user in GitHub with three traditional open source software communities to explore differences of their growth modes. We find an explosive growth of the users in GitHub and introduce the Diffusion of Innovation theory to illustrate intrinsic sociological basis of this phenomenon. Secondly, we construct follow-networks according to the follow behaviors among developers in GitHub. Finally, we present four typical social behavior patterns by mining follow-networks containing independence-pattern, group-pattern, star-pattern and hub-pattern. This study can provide several instructions of crowd collaboration to newcomers. According to the typical behavior patterns, the community manager could design corresponding assistive tools for developers. Copyright 2014 ACM.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RScam: Cloud-based anti-malware via reversible sketch 11th

RScam: Cloud-based anti-malware via reversible sketch

引用

11th International Conference Security and Privacy in Communication Networks, SecureComm 2015

作者： Sun, Hao Wang, Xiaofeng Su, Jinshu Chen, Peixin College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9783319288642

Cybercrime caused by malware becomes a persistent and damaging threat which makes the trusted security solution urgently demanded, especially for resource-constrained ends. The existing industry and academic approaches provide available anti-malware systems based on different perspectives. However, it is hard to achieve high performance detection and data privacy protection simultaneously. This paper proposes a cloud-based anti-malware system, called RScam, which provides fast and trusted security service for the resource-constrained ends. In RScam, we present suspicious bucket filtering, a novel signature-based detection mechanism based on the reversible sketch structure, which provides retrospective and accurate orientations of malicious signature fragments. Then we design a lightweight client which utilizes the digest of signature fragments to sharply reduce detection range. Finally, we design balanced interaction mechanism, which transmits sketch coordinates of suspicious file fragments and transformation of malicious signature fragments between the client and cloud server to protect data privacy and reduce traffic volume. We evaluate the performance of RScam with campus suspicious traffic and normal files. The results demonstrate validity and veracity of the proposed mechanism. Our system can outperform other existing systems with less time and traffic consumption. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2015.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：