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

5th IEEE International Conference on Data Science in Cyberspace, DSC 2020

作者： Li, Chenchen Li, Aiping Tu, Hongkui Wang, Ye Wang, Changhai National University of Defense Technology College of Computer ChangSha China National University of Defense Technology College of Computer Science and Technology on Parallel and Distributed Processing Laboratory ChangSha China

ISBN: (数字)9781728195582

ISBN: (纸本)9781728195582

As the basis of many knowledge graph completion tasks, the embedding representation of entities and relations in knowledge graph (KG) is an important task in the fields of Natural Language processing (NLP) and Artificial Intelligence (AI). While most of the existing knowledge graph embedding (KGE) models based on convolutional neural network (CNN) can obtain abundant feature embedding, they may ignore an important fact that the triples in the KG come from the text, as they simply learn about the feature embedding of entities and relations without considering contextual information. Therefore, in this paper, we propose an effective KGE model based on neural network. First of all, we convert the triple (h, r, t) of the KG into a sentence [h r t]. Then, the LSTM neural network is used to learn the long-term dependence of sentences from the input feature vectors. Then, on this basis, the two-layer convolutional neural network with several different filters is used to extract different local features. Finally, the obtained feature vectors are connected together, and the inner product is carried out with the weight vectors to obtain the score of the triple, so as to judge the validity of the given triple. We evaluate our model on two benchmark datasets FB15k-237 and WN18RR, the experimental results show that the model can effectively improve the accuracy of link prediction, achieving better results compared with other baseline models. © 2020 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Deep learning for social network information cascade analysis: A survey 5

Deep learning for social network information cascade analysi...

引用

5th IEEE International Conference on Data Science in Cyberspace, DSC 2020

作者： Gao, Liqun Zhou, Bin Jia, Yan Tu, Hongkui Wang, Ye Chen, Chenguang Wang, Haiyang Zhuang, Hongwu National University of Defense Technology College of Computer ChangSha China National University of Defense Technology Science and Technology on Parallel and Distributed Processing Laboratory ChangSha China

ISBN: (纸本)9781728195582

The phenomenon of information dissemination in social networks is widespread, and Social Network Information Cascade Analysis (SNICA) aims to acquire valuable knowledge in the process of information dissemination in social networks. As the number, volume, and resolution of social network data increase rapidly, traditional social network data analysis methods, especially the analysis method of social network graph (SNG) data becoming overwhelmed in SNICA. Recently, deep learning models have changed this situation, and it has achieved success in SNICA with its powerful implicit feature extraction capabilities. In this paper, we provide a comprehensive survey of recent progress in applying deep learning techniques for SNICA. We first introduce related concepts and summarize the advantages of deep learning technology in SNICA. Then, we propose a general framework for deep learning technology, which applies to SNICA. Then, different SNICA application scenarios in the framework are classified and discussed according to user behavior analysis, information cascade analysis, rumor detection, and social network event analysis. Finally, we discuss the limitations of current work and suggest future directions. © 2020 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

A survey on approaches and applications of knowledge representation learning 5

A survey on approaches and applications of knowledge represe...

引用

5th IEEE International Conference on Data Science in Cyberspace, DSC 2020

作者： Li, Chenchen Li, Aiping Wang, Ye Tu, Hongkui Song, Yichen National University of Defense Technology College of Computer ChangSha China National University of Defense Technology College of Computer Science and Technology on Parallel and Distributed Processing Laboratory ChangSha China

ISBN: (纸本)9781728195582

Knowledge representation learning (KRL) is one of the important research topics in artificial intelligence and Natural language processing. It can efficiently calculate the semantics of entities and relations in a low-dimensional space, and effectively solve the problem of data sparsity, which significantly improve the performance of knowledge acquisition, fusion and reasoning and so on. Starting from the five perspectives of distance-based, semantic matching, bilinear-based, neural network model and additional information model, this paper first introduces the overall framework and specific model design, and then correspondingly introduces the experimental evaluation tasks, metrics and benchmark datasets of each model. On this basis, how to apply KRL to various downstream tasks is summarized. © 2020 IEEE.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

DRAM failure prediction in AIOps: Empirical evaluation, challenges and opportunities

arXiv

引用

arXiv 2021年

作者： Wu, Zhiyue Xu, Hongzuo Pang, Guansong Yu, Fengyuan Wang, Yijie Jian, Songlei Wang, Yongjun Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology China University of Adelaide Australia

DRAM failure prediction is a vital task in AIOps, which is crucial to maintain the reliability and sustainable service of large-scale data centers. However, limited work has been done on DRAM failure prediction mainly due to the lack of public available datasets. This paper presents a comprehensive empirical evaluation of diverse machine learning techniques for DRAM failure prediction using a large-scale multi-source dataset, including more than three millions of records of kernel, address, and mcelog data, provided by Alibaba Cloud through PAKDD 2021 competition. Particularly, we first formulate the problem as a multi-class classification task and exhaustively evaluate seven popular/state-of-the-art classifiers on both the individual and multiple data sources. We then formulate the problem as an unsupervised anomaly detection task and evaluate three state-of-the-art anomaly detectors. Further, based on the empirical results and our experience of attending this competition, we discuss major challenges and present future research opportunities in this task. © 2021, CC BY.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

JointCloud Cross-chain Verification Model of Decentralized Identifiers

JointCloud Cross-chain Verification Model of Decentralized I...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Tao Zhong Peichang Shi Junsheng Chang Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Institute of Computer Technology College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665443326

When multiple entities communicate or collaborate in JointCloud, identities are the very prior basis to build trust with each other. Decentralized identifier (DID) can provide a trusted identity with blockchain technology and a complete method of identity verification based on verifiable credentials, which solves problems of conventional centralized identity. However, current DIDs can only conduct verification within a single blockchain, which limits the interoperability of DIDs on different blockchains. Network isolation hinders the verification of DIDs on different blockchains and thus there is a need to break the barrier between blockchains. In this paper, we propose a model to conduct cross-chain verification of DIDs. We build a system of credit evaluation to describe the credibility of DIDs in a unified way and deploy smart contracts to implement cross-chain verification of DIDs. Experimental results verifies the feasibility of the model, which realizes cross-chain verification of DIDs in the networks of blockchain.

关键词： Couplings Computational modeling Scalability Conferences Smart contracts Prototypes Data structures

来源：评论

学校读者我要写书评

暂无评论

A Retina-LGN-V1 Structure-like Spiking Neuron Network for Image Feature Extraction 21

A Retina-LGN-V1 Structure-like Spiking Neuron Network for Im...

引用

Proceedings of the 2021 5th International Conference on Video and Image processing

作者： Sheng Ji Qijun Gu Ye Yuan Peng Zhao Tao Fang Hong Huo Xin Niu Department of Automation_School of Electronic Information and Electrical Engineering_Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University China College of Computer Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology China

ISBN: (纸本)9781450385893

SNNs have achieved great attention in recent years as they contain neurons more like those in the brain and use spikes to encode and transmit information efficiently among neurons with lower energy consumption. A Retina-LGN-V1 structure-like spiking neuron network (RLVSL-SNN) is proposed in this paper. It is inspired by the structure of mammalian primary visual pathway, and simulates different biological structures of Retina, LGN and V1. Noise reduction circuit and light adaptation circuit are also simulated for enhancing the robustness of its extracted features. RLVSL-SNN is a bio-plausible neuron network as it has firing rates of neurons in each layer that are similar to those of biological experiments. Besides, a full-connected SNN (FC SNN) is implemented following RLVSL-SNN for classification to evaluate the extracted features. The additive spiking timing dependent plasticity (STDP) learning rules and the ANN-to-SNN conversion method are utilized to train RLVSL-SNN and FC SNN, respectively. The experiments on MNIST dataset have verified that RLVSL-SNN is comparable to AlexNet for classification by features from spikes.

关键词： Additive Spiking Timing Dependent Plasticity Learning Primary Visual Pathway Image Classification Spiking Neural Network

来源：评论

学校读者我要写书评

暂无评论

A field-based service management and discovery method in multiple clouds context

引用

Frontiers of computer Science 2019年第5期13卷 976-995页

作者： Shuai ZHANG Xinjun MAO Fu HOU Peini LIU College of Computer National University of Defense Technology Changsha 410073 China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

In diverse and self-governed multiple clouds context, the service management and discovery are greatly challenged by the dynamic and evolving features of services. How to manage the features of cloud services and support accurate and efficient service discovery has becomean open problem in the area of cloud computing. This paper proposes a field model of multiple cloud services and corresponding service discovery method to address the issue. Different from existing researches, our approach is inspired by Bohr atom model. We use the abstraction of energy level and jumping mechanism to describe services status and variations, and thereby to support the service demarcation and discovery. The contributions of this paper are threefold. First, we propose the abstraction of service energy level to represent the status of services, and service jumping mechanism to investigate the dynamic and evolving features as the variations and re-demarcation of cloud services according to their energy levels. Second, we present user acceptable service region to describe the services satisfying users' requests and corresponding service discovery method, which can significantly decrease services search scope and improve the speed and precision of service discovery. Third, a series of algorithms are designed to implement the generation of field model, user acceptable service regions, service jumping mechanism, and user-oriented service discovery. We have conducted an extensive experiments on QWS dataset to validate and evaluate our proposed models and algorithms. The results show that field model can well support the representation of dynamic and evolving aspects of services in multiple clouds context and the algorithms can improve the accuracy and efficiency of service discovery.

关键词： service field service energy level service jumping service management service discovery multiple clouds

来源：评论

学校读者我要写书评

暂无评论

FAAD:an unsupervised fast and accurate anomaly detection method for a multi-dimensional sequence over data stream

引用

Frontiers of Information Technology & Electronic Engineering 2019年第3期20卷 388-404页

作者： Bin LI Yi-jie WANG Dong-sheng YANG Yong-mou LI Xing-kong MA Science and Technology on Parallel and Distributed Processing Laboratory College of ComputerNational University of Defense Technology Block Chain Research Institute of LianLian Pay

Recently, sequence anomaly detection has been widely used in many fields. Sequence data in these fields are usually multi-dimensional over the data stream. It is a challenge to design an anomaly detection method for a multi-dimensional sequence over the data stream to satisfy the requirements of accuracy and high speed. It is because:(1) Redundant dimensions in sequence data and large state space lead to a poor ability for sequence modeling;(2) Anomaly detection cannot adapt to the high-speed nature of the data stream, especially when concept drift occurs, and it will reduce the detection rate. On one hand, most existing methods of sequence anomaly detection focus on the single-dimension sequence. On the other hand, some studies concerning multi-dimensional sequence concentrate mainly on the static database rather than the data stream. To improve the performance of anomaly detection for a multi-dimensional sequence over the data stream, we propose a novel unsupervised fast and accurate anomaly detection(FAAD) method which includes three algorithms. First, a method called "information calculation and minimum spanning tree cluster" is adopted to reduce redundant dimensions. Second, to speed up model construction and ensure the detection rate for the sequence over the data stream, we propose a method called"random sampling and subsequence partitioning based on the index probabilistic suffix tree." Last, the method called "anomaly buffer based on model dynamic adjustment" dramatically reduces the effects of concept drift in the data stream. FAAD is implemented on the streaming platform Storm to detect multi-dimensional log audit *** with the existing anomaly detection methods, FAAD has a good performance in detection rate and speed without being affected by concept drift.

关键词： Data stream Multi-dimensional sequence Anomaly detection Concept drift Feature selection

来源：评论

学校读者我要写书评

暂无评论

A Complexity-Reduced Block-Selective Algebraic Multigrid Method for Implicitly Coupled Velocity-Pressure System on High Performance computers

SSRN

引用

SSRN 2023年

作者： Liang, Yuechao Guo, Xiao-Wei Li, Chao Yuan, Fan Song, Min Zhang, Qingyang Chen, Xinhai Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Mathematics and Computational Sciences Xiangtan University Xiangtan411105 China College of Computer Science and Technology National University of Defense Technology Changsha410073 China

The implicitly coupled pressure-based algorithm is widely acknowledged for its superior convergence and robustness in solving incompressible flow problems. However, the increased expansion scale of equations and difficulty in solving the resulting equation system has limited the widespread use of the coupling algorithm. This paper presents an optimized block-SAMG method, referred to as Red-SAMG, to significantly reduce computational complexity and memory consumption. Our approach employs a parallel modified independent set algorithm, allowing each process to perform matrix coarsening individually. An aggressive coarsening strategy further reduces complexity to address larger-scale problems. We conducted numerical experiments on a serial two-dimensional backward-facing step case and a parallel three-dimensional tunnel between rod bundles in the reactor core problem. The results demonstrate that the Red-SAMG method with aggressive coarsening reduces solution time by 12\% on the backward-facing step case. For large-scale three-dimensional problems under the same parallel conditions, the Red-SAMG method shortens the solution time by 14\% compared to the existing SAMG method. The Red-SAMG method with aggressive coarsening further reduces solution time by 49\%. Our optimized Red-SAMG method effectively reduces the complexity of the linear system arising from the implicitly coupled algorithm. The aggressive coarsening strategy also represents a significant advancement in improving the computational efficiency of the SAMG method. © 2023, The Authors. All rights reserved.

关键词： Coarsening

来源：评论

学校读者我要写书评

暂无评论

RoSAS: Deep Semi-supervised Anomaly Detection with Contamination-resilient Continuous Supervision

arXiv

引用

arXiv 2023年

作者： Xu, Hongzuo Wang, Yijie Pang, Guansong Jian, Songlei Liu, Ning Wang, Yongjun National Key Laboratory of Parallel and Distributed Computing China College of Computer National University of Defense Technology Hunan Changsha410073 China School of Computing and Information Systems Singapore Management University Singapore178902 Singapore College of Information and Communications National University of Defense Technology Hubei Wuhan430010 China

Semi-supervised anomaly detection methods leverage a few anomaly examples to yield drastically improved performance compared to unsupervised models. However, they still suffer from two limitations: 1) unlabeled anomalies (i.e., anomaly contamination) may mislead the learning process when all the unlabeled data are employed as inliers for model training;2) only discrete supervision information (such as binary or ordinal data labels) is exploited, which leads to suboptimal learning of anomaly scores that essentially take on a continuous distribution. Therefore, this paper proposes a novel semi-supervised anomaly detection method, which devises contamination-resilient continuous supervisory signals. Specifically, we propose a mass interpolation method to diffuse the abnormality of labeled anomalies, thereby creating new data samples labeled with continuous abnormal degrees. Meanwhile, the contaminated area can be covered by new data samples generated via combinations of data with correct labels. A feature learning-based objective is added to serve as an optimization constraint to regularize the network and further enhance the robustness w.r.t. anomaly contamination. Extensive experiments on 11 real-world datasets show that our approach significantly outperforms state-of-the-art competitors by 20%-30% in AUC-PR and obtains more robust and superior performance in settings with different anomaly contamination levels and varying numbers of labeled anomalies. The source code is available at https://***/xuhongzuo/rosas/. © 2023, CC BY.

关键词： Contamination

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：