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

Tensor Graph Convolutional Network for Dynamic Graph Representation Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Ling Yuan, Ye The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

Dynamic graphs (DG) describe dynamic interactions between entities in many practical scenarios. Most existing DG representation learning models combine graph convolutional network and sequence neural network, which model spatial-temporal dependencies through two different types of neural networks. However, this hybrid design cannot well capture the spatial-temporal continuity of a DG. In this paper, we propose a tensor graph convolutional network to learn DG representations in one convolution framework based on the tensor product with the following two-fold ideas: a) representing the information of DG by tensor form;b) adopting tensor product to design a tensor graph convolutional network modeling spatial-temporal feature simultaneously. Experiments on real-world DG datasets demonstrate that our model obtains state-of-the-art performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

A Node-collaboration-informed Graph Convolutional Network for Precise Representation to Undirected Weighted Graphs

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wang, Ying Yuan, Ye Luo, Xin The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China The College of Computer and Information Science Southwest University Chongqing400715 China

An undirected weighted graph (UWG) is frequently adopted to describe the interactions among a solo set of nodes from real applications, such as the user contact frequency from a social network services system. A graph convolutional network (GCN) is widely adopted to perform representation learning to a UWG for subsequent pattern analysis tasks such as clustering or missing data estimation. However, existing GCNs mostly neglects the latent collaborative information hidden in its connected node pairs. To address this issue, this study proposes to model the node collaborations via a symmetric latent factor analysis model, and then regards it as a node-collaboration module for supplementing the collaboration loss in a GCN. Based on this idea, a Node-collaboration-informed Graph Convolutional Network (NGCN) is proposed with three-fold ideas: a) Learning latent collaborative information from the interaction of node pairs via a node-collaboration module;b) Building the residual connection and weighted representation propagation to obtain high representation capacity;and c) Implementing the model optimization in an end-to-end fashion to achieve precise representation to the target UWG. Empirical studies on UWGs emerging from real applications demonstrate that owing to its efficient incorporation of node-collaborations, the proposed NGCN significantly outperforms state-of-the-art GCNs in addressing the task of missing weight estimation. Meanwhile, its good scalability ensures its compatibility with more advanced GCN extensions, which will be further investigated in our future studies. Copyright © 2022, The Authors. All rights reserved.

关键词： Convolution

Dfier: A Directed Vulnerability Verifier for Ethereum Smart Contracts

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Wang, Zeli Dai, Weiqi Li, Ming Choo, Kim-Kwang Raymond Zou, Deqing Chongqing Key Laboratory of Computational Intelligence Key Laboratory of Big Data Intelligent Computing Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing40065 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio United States

Existing smart contract vulnerability identification approaches mainly focus on complete program detection. Consequently, lots of known potentially vulnerable locations need manual verification, which is energy-exhaustive and error-prone. Fuzzing is an effective way to detect vulnerabilities. However, current fuzzers cannot effectively probe these suspicious targets because they overlook two key factors: exploring all paths toward the targets and providing high-quality directed seed inputs. This paper presents a Directed vulnerability veriFier (DFier), elaborating effective transaction sequences with directed inputs for the fuzzer, to focus on analyzing target paths and automatically detect whether the given locations are vulnerable. Specifically, DFier fuses the effectiveness of static analysis and the efficiency of fuzzing. The static analysis helps locate target paths and generate directed inputs for the fuzzer under three heuristic strategies. The first prefers inputs with the larger possibility of triggering potential vulnerabilities based on target features. The second guides the value mutation to satisfy the path constraints. The third adequately leverages execution information to help find exploits faster. Extensive experiments demonstrate that DFier is effective in verifying contract security, compared with three existing contract fuzzers (i.e., contractFuzzer, sFuzz, and conFuzzius). And the performance losses are in an acceptable range. © 2023, The Authors. All rights reserved.

关键词： Smart contract

OpenViewer: Openness-Aware Multi-View Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Du, Shide Fang, Zihan Tan, Yanchao Wang, Changwei Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology Jinan China

Multi-view learning methods leverage multiple data sources to enhance perception by mining correlations across views, typically relying on predefined categories. However, deploying these models in real-world scenarios presents two primary openness challenges. 1) Lack of Interpretability: The integration mechanisms of multi-view data in existing black-box models remain poorly explained;2) Insufficient Generalization: Most models are not adapted to multi-view scenarios involving unknown categories. To address these challenges, we propose OpenViewer, an openness-aware multi-view learning framework with theoretical support. This framework begins with a Pseudo-Unknown Sample Generation Mechanism to efficiently simulate open multi-view environments and previously adapt to potential unknown samples. Subsequently, we introduce an Expression-Enhanced Deep Unfolding Network to intuitively promote interpretability by systematically constructing functional prior-mapping modules and effectively providing a more transparent integration mechanism for multi-view data. Additionally, we establish a Perception-Augmented Open-Set Training Regime to significantly enhance generalization by precisely boosting confidences for known categories and carefully suppressing inappropriate confidences for unknown ones. Experimental results demonstrate that OpenViewer effectively addresses openness challenges while ensuring recognition performance for both known and unknown samples. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

A Comprehensive Capability Analysis of GPT-3 and GPT-3.5 Series Models

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ye, Junjie Chen, Xuanting Xu, Nuo Zu, Can Shao, Zekai Liu, Shichun Cui, Yuhan Zhou, Zeyang Gong, Chao Shen, Yang Zhou, Jie Chen, Siming Gui, Tao Zhang, Qi Huang, Xuanjing School of Computer Science Fudan University Shanghai China School of Data Science Fudan University Shanghai China Institute of Modern Languages and Linguistics Fudan University Shanghai China Shanghai Collaborative Innovation Center of Intelligent Visual Computing Fudan University China

GPT series models, such as GPT-3, CodeX, InstructGPT, ChatGPT, and so on, have gained considerable attention due to their exceptional natural language processing capabilities. However, despite the abundance of research on the difference in capabilities between GPT series models and fine-tuned models, there has been limited attention given to the evolution of GPT series models’ capabilities over time. To conduct a comprehensive analysis of the capabilities of GPT series models, we select six representative models, comprising two GPT-3 series models (i.e., davinci and text-davinci-001) and four GPT-3.5 series models (i.e., code-davinci-002, text-davinci-002, text-davinci-003, and gpt-3.5-turbo). We evaluate their performance on nine natural language understanding (NLU) tasks using 21 datasets. In particular, we compare the performance and robustness of different models for each task under zero-shot and few-shot scenarios. Our extensive experiments reveal that the overall ability of GPT series models on NLU tasks does not increase gradually as the models evolve, especially with the introduction of the RLHF training strategy. While this strategy enhances the models’ ability to generate human-like responses, it also compromises their ability to solve some tasks. Furthermore, our findings indicate that there is still room for improvement in areas such as model robustness. Copyright © 2023, The Authors. All rights reserved.

关键词： Natural language processing systems

Non-invasive biopsy diagnosis of diabetic kidney disease via deep learning applied to retinal images: a population-based study

学校读者我要写书评

暂无评论

The Lancet Digital Health 2025年第5期7卷 100868页

作者： Meng, Ziyao Guan, Zhouyu Yu, Shujie Wu, Yilan Zhao, Yaoning Shen, Jie Lim, Cynthia Ciwei Chen, Tingli Yang, Dawei Ran, An Ran He, Feng Hamzah, Haslina Singh, Sarkaaj Abd Raof, Anis Syazwani Lee-Boey, Jian Wen Samuel Lim, Soo-Kun Sun, Xufang Ge, Shuwang Xu, Gang Su, Hua Cheng, Yang Lu, Feng Liao, Xiaofei Jin, Hai Deng, Chenxin Ruan, Lei Zhang, Cuntai Wu, Chan Dai, Rongping Jin, Yixiao Wang, Wenxiao Li, Tingyao Liu, Ruhan Li, Jiajia Shu, Jia Lu, Yuwei Wang, Xiangning Wu, Qiang Qin, Yiming Tang, Jin Sheng, Xiaohua Jiao, Qiong Yang, Xiaokang Guo, Minyi McKay, Gareth J Hogg, Ruth E Liew, Gerald Chee, Evelyn Yi Lyn Hsu, Wynne Lee, Mong Li Szeto, Simon Luk, Andrea O Y Chan, Juliana C N Cheung, Carol Y Tan, Gavin Siew Wei Tham, Yih-Chung Cheng, Ching-Yu Sabanayagam, Charumathi Lim, Lee-Ling Jia, Weiping Li, Huating Sheng, Bin Wong, Tien Yin Shanghai Belt and Road International Joint Laboratory of Intelligent Prevention and Treatment for Metabolic Diseases Department of Computer Science and Engineering School of Electronic Information and Electrical Engineering Institute for Proactive Healthcare Shanghai Jiao Tong University Department of Endocrinology and Metabolism Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai Diabetes Institute Shanghai Clinical Centre for Diabetes Shanghai Key Laboratory of Diabetes Mellitus Shanghai China MOE Key Laboratory of AI School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China Beijing Tsinghua Changgung Hospital Eye Center School of Clinical Medicine Tsinghua Medicine Tsinghua University Beijing China Medical Records and Statistics Office Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of Medicine Shanghai China Department of Renal Medicine Singapore General Hospital SingHealth-Duke Academic Medical Centre Singapore Singapore Department of Ophthalmology Shanghai Health and Medical Center Wuxi China Department of Ophthalmology and Visual Sciences The Chinese University of Hong Kong Hong Kong Special Administrative Region China Singapore Eye Research Institute Singapore National Eye Centre Singapore Department of Medicine Faculty of Medicine Universiti Malaya Kuala Lumpur Malaysia Department of Ophthalmology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Hubei Wuhan China Department of Nephrology Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Nephrology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China Department of Ophthalmology Union Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China National Engineering Research Centre for Big Dat

Background: Improving the accessibility of screening diabetic kidney disease (DKD) and differentiating isolated diabetic nephropathy from non-diabetic kidney disease (NDKD) are two major challenges in the field of diabetes care. We aimed to develop and validate an artificial intelligence (AI) deep learning system to detect DKD and isolated diabetic nephropathy from retinal fundus images. Methods: In this population-based study, we developed a retinal image-based AI-deep learning system, DeepDKD, pretrained using 734 084 retinal fundus images. First, for DKD detection, we used 486 312 retinal images from 121 578 participants in the Shanghai Integrated Diabetes Prevention and Care System for development and internal validation, and ten multi-ethnic datasets from China, Singapore, Malaysia, Australia, and the UK (65 406 participants) for external validation. Second, to differentiate isolated diabetic nephropathy from NDKD, we used 1068 retinal images from 267 participants for development and internal validation, and three multi-ethnic datasets from China, Malaysia, and the UK (244 participants) for external validation. Finally, we conducted two proof-of-concept studies: a prospective real-world study with 3 months' follow-up to evaluate the effectiveness of DeepDKD in screening DKD;and a longitudinal analysis of the effectiveness of DeepDKD in differentiating isolated diabetic nephropathy from NDKD on renal function changes with 4·6 years' follow-up. Findings: For detecting DKD, DeepDKD achieved an area under the receiver operating characteristic curve (AUC) of 0·842 (95% CI 0·838–0·846) on the internal validation dataset and AUCs of 0·791–0·826 across external validation datasets. For differentiating isolated diabetic nephropathy from NDKD, DeepDKD achieved an AUC of 0·906 (0·825–0·966) on the internal validation dataset and AUCs of 0·733–0·844 across external validation datasets. In the prospective study, compared with the metadata model, DeepDKD could detect DKD wit

关键词： Deep learning

A Spectral Bipartite Analogue of the Erdős-Sós Conjecture

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Geng, Xianya Wei, Wei Feng, Zhiming Center of Intelligent Computing and Applied Statistics School of Mathematics Physics and Statistics Shanghai University of Engineering Science Shanghai China School of Mathematics and Big Data Anhui University of Science & Technology Huainan China School of Mathematics and Statistics Xinyang Normal University Xinyang China

A well-known conjecture of Erdős and Sós states that each graph on ν vertices with size more than ν(t2−1) contains every tree with order t + 1 as a subgraph. In 2010, Nikiforov presented the spectral Erdős-Sós conjecture: Let G be a graph with sufficiently large order ν and spectral radius λ(G), and let t ≥ 2 be an integer, (i) if λ(G) ≥ λ(Kt ∨ Kν−t), then G contains all trees of order 2t + 2 unless G ∼= Kt ∨ Kν−t;(ii) if λ(G) ≥ λ(Kt ∨ (Kν−t−2 ∪ K2)), then G contains all trees of order 2t + 3 unless G ∼= Kt ∨ (Kν−t−2 ∪ K2). Recently, this conjecture was confirmed by Cioabă, Desai and Tait (2022). In this contribution, we resolve the spectral bipartite analogue of the Erdős-Sós conjecture. For sufficiently large ν and positive integer t ≥ 2, we show that the complete bipartite graph Kt,ν−t uniquely maximizes the spectral radius over the set of ν-vertex bipartite graphs each of which does not contain some trees with order 2t + 2 (resp. 2t + 3) as subgraphs. Our proof technique is mainly based on the Zarankiewicz number of a tree, and with the aid of the eigenvector method from Cioabă, Desai and Tait (2022). Some problems are proposed in the end for future research. © 2024, The Authors. All rights reserved.

关键词： Eigenvalues and eigenfunctions

BMDP:Blockchain-Based Multi-Cloud Storage data Provenance

学校读者我要写书评

暂无评论

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

International Conference on Computer Supported Cooperative Work in Design

作者： Feiyu Wang Jian-Tao Zhou Xu Guo College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

In a multi-cloud storage system, provenance data records all operations and ownership during its lifecycle, which is critical for data security and audibility. However, recording provenance data also poses some challenging security and storage issues. In this paper, we present a secure and efficient multi-cloud storage data source scheme, BMDP. We use blockchain technology to ensure the secure storage of provenance data and design a smart contract to utilize the provenance data to ensure the proper operation of the multi-cloud storage system. Finally, we analyze the scheme’s safety and do simulation experiments to show that the scheme has practicality.

关键词：

Blockchain-Based Multi-Cloud data Storage System Disaster Recovery

学校读者我要写书评

暂无评论

Blockchain-Based Multi-Cloud Data Storage System Disaster Re...

IEEE International Conference on Systems, Man and Cybernetics

作者： Feiyu Wang Jian-tao Zhou College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

Cloud storage services have been used by most businesses and individual users. However, data loss, service interruptions and cyber attacks often lead to cloud storage services not being provided properly, and these incidents have caused financial losses to users. Second, traditional and single-cloud model disaster recovery services are no longer suitable for the current complex cloud storage systems. Therefore, a scheme to provide disaster recovery for cloud storage services in a multi-cloud storage environment is needed in real production. In this paper, we propose a disaster recovery scheme based on blockchain technology. The proposed scheme outlined in this study aims to address the issue of data availability within the cloud storage landscape. The proposed scheme achieves this goal by dividing data into hot and cold categories, verifying the integrity of copy data via blockchain technology, and utilizing blockchain networks to manage multi-cloud storage systems. Experimental findings demonstrate that the proposed scheme yields superior results in terms of computation and time overheads.

关键词：