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

IEEE International Conference on Data science in Cyberspace (DSC)

作者： Yalong Xie Aiping Li Ziniu Liu Kai Chen Hongkui Tu College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665418164

China is a big agricultural county with more than 500 million rural population. In China, farmers usually loan from rural commercial banks or rural credit cooperatives. It is crucial for the national economic development and the improvement of people's standard of living that how to reasonably use funds to subsidize the agricultural population and reduce the risk of rural loans. At present, credit risk prediction of farmers mainly depends on the experience of experts in the business field, and there is little published research on using artificial intelligence methods to solve this problem. This paper presents a complete set of methods, including data collection, feature selection, etc. We propose a novel deep neural network model named DNN-CRP for credit risk prediction of Chinese framers. Experiments on an actual credit loan dataset of Chinese farmers are presented, and experimental results show that the comprehensive performance of the DNN-CRP model is better than current state-of-the-art models. It is believed that the DNN-CRP model proposed in this paper can help banks improve the efficiency of the credit loan business of farmers and reduce credit risks.

关键词： Deep learning Sensitivity Neural networks Sociology Predictive models Data collection Data models

来源：评论

学校读者我要写书评

暂无评论

OpenMedIA: Open-Source Medical Image Analysis Toolbox and Benchmark under Heterogeneous AI Computing Platforms

arXiv

引用

arXiv 2022年

作者： Zhuang, Jia-Xin Huang, Xiansong Yang, Yang Chen, Jiancong Yu, Yue Gao, Wei Li, Ge Chen, Jie Zhang, Tong Peng Cheng Laboratory Shenzhen China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China School of Electronic and Computer Engineering Peking University China National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

In this paper, we present OpenMedIA, an open-source toolbox library containing a rich set of deep learning methods for medical image analysis under heterogeneous Artificial Intelligence (AI) computing platforms. Various medical image analysis methods, including 2D/3D medical image classification, segmentation, localisation, and detection, have been included in the toolbox with PyTorch and/or MindSpore implementations under heterogeneous NVIDIA and Huawei Ascend computing systems. To our best knowledge, OpenMedIA is the first open-source algorithm library providing compared PyTorch and MindSpore implementations and results on several benchmark datasets. The source codes and models are available at https://***/ OpenMedIA. © 2022, CC BY-NC-SA.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

PPSS: A Privacy-Preserving Supervision Scheme Based on Blockchain

PPSS: A Privacy-Preserving Supervision Scheme Based on Block...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Ming Chen Peichang Shi Xiang Fu Feng Jiang Fei Gao Penghui Ma Jinzhu Kong National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Kylin Software Co.LTD Changsha China Zhejiang Lab Hangzhou China

In JointCloud Computing, multi-party participation introduces complexity and uncertainty. For all participants in JointCloud Computing, both continuous supervision and necessary privacy protection are required. Traditional supervision methods usually adopt the centralized information interaction mode, which has such defects as collusion of interests, single point of failure, privacy disclosure, etc. Building a decentralized supervision mechanism has become a new research direction. In this paper, we propose PPSS, a privacy-preserving supervision scheme based on blockchain, which decentralizes the supervision of the participants in JointCloud Computing, and combines the “double encryptions” and “threshold encryption” technologies to provide privacy protection. While making full use of the decentralization of the blockchain, a committee is established to carry out the analysis and decision-making tasks in terms of supervision and privacy protection. Experimental results indicate that PPSS can balance performance and security by reasonably configuring the committee.

关键词： Privacy Uncertainty Decision making Buildings Reliability engineering Blockchains Complexity theory

来源：评论

学校读者我要写书评

暂无评论

MixedCache: Enabling Flow Directed Rule-Caching Scheme based on Heterogeneous Cache for OpenFlow 3

MixedCache: Enabling Flow Directed Rule-Caching Scheme based...

引用

2020 3rd International Conference on computer Information science and Artificial Intelligence, CISAI 2020

作者： Yang, Jialun Yang, Yi Liu, Jiahao Liu, Rulin Qiao, Peng Wang, Baosheng College of Computer Science and Technology National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups. Many increased flow tables are rapidly exhausting these hardware storage resources, which makes the switches have to balance high-speed search and massive storage. The rule-caching scheme is a popular method to solve this problem, which caches the most commonly used rules into hardware storage resources. The existing rule-caching schemes are based on single hardware storage resources, and they cannot flexibly adjust the caching strategy according to the traffic characteristics. Simultaneously, the deployed commodity switches face the problem of difficulty in changing the size of SRAM and TCAM. This paper innovatively proposes the MixedCache scheme, which makes full use of the hardware storage resources in the switch according to the skewed characteristics of network traffic. MixedCache stores the large flows in SRAM by exact match and stores the small flows in the TCAM by wildcard match. MixedCache does not need to change the size of the deployed switch hardware storage resources, but makes full use of existing resources. Compared with the rule-caching scheme based on the exact match, the cache hit rate can increase by up to 15.61%. Compared with the rule-caching scheme based on the wildcard match, the cache hit rate can increase by up to 29.69%. © Published under licence by IOP Publishing Ltd.

关键词： Static random access storage

来源：评论

学校读者我要写书评

暂无评论

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for Highly-Effective Drug-Protein Interaction Representation

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yanlong Qiu Siqi Wang Xi Yang Xinyuan Qiu Chengkun Wu Yingbo Cui Canqun Yang Institute for Quantum Information & State Key Laboratory of High-Performance Computing College of Computer Science National University of Defense Technology Changsha P. R. China National Supercomputer Center in Tianjin Tianjin P. R. China National Key Laboratory of Parallel and Distributed Computing College of Computer Science National University of Defense Technology Changsha P. R. China Department of Biology and Chemistry College of Science National University of Defense Technology Changsha P. R. China

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词：

来源：评论

学校读者我要写书评

暂无评论

Toward Wisdom-Evolutionary and Primitive-Concise 6G:A New Paradigm of Semantic Communication Networks

引用

Engineering 2022年第1期8卷 60-73页

作者： Ping Zhang Wenjun Xu Hui Gao Kai Niu Xiaodong Xu Xiaoqi Qin Caixia Yuan Zhijin Qin Haitao Zhao Jibo Wei Fangwei Zhang State Key Laboratory of Networking and Switching Technology Beijing University of Posts and TelecommunicationsBeijing 100876China Peng Cheng Laboratory Shenzhen 518066China Key Laboratory of Universal Wireless Communications Ministry of EducationBeijing University of Posts and TelecommunicationsBeijing 100876China Key Laboratory of Trustworthy Distributed Computing and Service Ministry of EducationBeijing University of Posts and TelecommunicationsBeijing 100876China School of Artificial Intelligence Beijing University of Posts and TelecommunicationsBeijing 100876China The School of Electronic Engineering and Computer Science Queen Mary University of LondonLondon E14NSUK College of Electronic Science and Technology National University of Defense TechnologyChangsha 410073China School of Humanities Beijing University of Posts and TelecommunicationsBeijing 100876China

The sixth generation(6G)mobile networks will reshape the world by offering instant,efficient,and intelligent hyper-connectivity,as envisioned by the previously proposed Ubiquitous-X 6G *** hyper-massive and global connectivity will introduce tremendous challenges into the operation and management of 6G networks,calling for revolutionary theories and technological *** this end,we propose a new route to boost network capabilities toward a wisdom-evolutionary and primitive-concise network(WePCN)vision for the Ubiquitous-X 6G *** particular,we aim to concretize the evolution path toward the WePCN by first conceiving a new semantic representation framework,namely semantic base,and then establishing an intelligent and efficient semantic communication(IE-SC)network *** the IE-SC architecture,a semantic intelligence plane is employed to interconnect the semantic-empowered physical-bearing layer,network protocol layer,and application-intent layer via semantic information *** proposed architecture integrates artificial intelligence and network technologies to enable intelligent interactions among various communication objects in *** features a lower bandwidth requirement,less redundancy,and more accurate intent *** also present a brief review of recent advances in semantic communications and highlight potential use cases,complemented by a range of open challenges for 6G.

关键词： 6G Semantic information Semantic communication Intelligent communication

来源：评论

学校读者我要写书评

暂无评论

NH-CIL: A Nested Hierarchy Algorithm for Class Incremental Learning

NH-CIL: A Nested Hierarchy Algorithm for Class Incremental L...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Mingyu Liu Yijie Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R.China

ISBN: (纸本)9781728165981

Class incremental learning is widely applied in the classification scenarios as the number of classes is usually dynamically changing. However, the existing algorithms increase computational cost to implement class incremental learning in order to increase classification quality. In this paper, we propose a nested hierarchy algorithm based on OCSVM for class incremental learning, called NH-CIL. We reuse support vectors to eliminate redundant instances and catch the key ones to replace the whole model because of the generalization ability of OCSVM. When a new class arrives, NH-CIL adopts OCSVM on the new class and the old classes respectively to get the corresponding sketching supports vectors. Then NH-CIL reuses these two kinds of sketching support vectors to build a binary sub-classifier. These two steps are repeatedly nested to form a hierarchy classification model in a bottom-up manner while the number of classes increases. On the contrary, the testing phase is in a top-down manner. NH-CIL can be used as a flexible approach in the classification scenarios during the collaborative information processing. We conduct the experiments on 8 real-world benchmark datasets to compare NH-CIL with some other class incremental learning algorithms, e.g. SD-CIL, HS-CIL and OP-CIL. The experiment results show that NH-CIL averagely achieves more than 5.1%, 8.6% and 11.6% accuracy improvement and 39.8%, 24.7% and 12.6% efficiency improvement over SD-CIL, HS-CIL and OP-CIL, respectively.

关键词： Machine learning algorithms Computational modeling Heuristic algorithms Conferences Support vector machine classification Information processing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Modeling Full Information with Graph Network for Joint Entity-Relation Extraction 21

Modeling Full Information with Graph Network for Joint Entit...

引用

Proceedings of the 2021 4th International Conference on Algorithms, Computing and Artificial Intelligence

作者： Qian Wan Luona Wei Xinhai Chen Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology China College of Systems Engineering National University of Defense Technology China Laboratory of Software Engineering for Complex Systems National University of Defense Technology China

ISBN: (纸本)9781450385053

Fully capturing contextual information and analyzing the association between entity semantics and type is helpful for joint extraction task: 1) The context can reflect the part of speech and semantics of entity. 2) The entity type is closely related to the relation between entities. Previous research used to simply embed the contextual information into shallow layer of the model, ignoring the association between entity semantics and type. In this paper, we propose a graph network with full-information modeling to explicitly model different-level information in the text. The contextual information of entity is dynamically embedded in each span representation to improve the reasoning ability. To capture the fine-grained association between the semantics and type of entity, the graph network uses the feature of entity types to generate edge information between different nodes. Experimental results show that our model outperforms previous models on the CoNLL04 dataset and obtains competitive results on the SciERC dataset in both entity recognition and relation extraction. Extensive additional experiments further verify the effectiveness of the model.

关键词： Natural Language Processing Named Entity Recognition Graph Network Deep Learning Relation Extraction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Bidirectional Representation Recommendation Based On Relevance Information Enhancement To Solve User Interest Drift

A Bidirectional Representation Recommendation Based On Relev...

引用

IEEE International Conference on Web Services (ICWS)

作者： Nan Wang Kun Li Xuefeng Jiang Jinbao Li College of Computer Science and Technology Heilongjiang University Key Laboratory of Database and Parallel Computing Heilongjiang University Harbin China Shandong Artificial Intelligence Institute School of Mathematics and Statistics Qilu University of Technology Jinan China

The phenomenon that user interests change dynamically over time is called user interest drift, which makes it difficult for recommendation systems to obtain users’ real interests. In order to better provide users with personalized services, it is very important to study recommendation methods that can be applied to user interest drift. However, the new interests of users are often very different from the interests that users have interacted with historically. It makes the correlation between the original user’s historical interaction and the user’s new interest very weak. Meanwhile, the information contained in user’s sessions is not enough to support the inference of the new interest, resulting in a serious decrease in model performance. To alleviate the above problem, we propose a bidirectional representation recommendation based on relevance information enhancement to solve user interest drift (RA-Bert). The model is based on Bert and uses bidirectional self-attention mechanism to represent user sessions. In this model, we design a relevance information enhancement module to adaptively capture the information associated with the user’s new interest from neighbors’ sessions. Then, we integrate the relevance information into user’s history sessions, which can effectively enhance the correlation between user’s history sessions and the new interest. Further, in order to effectively supplement the missing relevance information in users’ sessions, we design a new attention unit, which explicitly models the difference information between users and neighbors. Extensive experiments have demonstrated the effectiveness of our approach. Our code is publicly available at the link: https://***/LucasZen/paper_code.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：