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

A Point Cloud Completion Method for Industrial Component Based on Multiple Encoders

学校读者我要写书评

暂无评论

A Point Cloud Completion Method for Industrial Component Bas...

Chinese Automation Congress (CAC)

作者： Lei Wang Ran Chen Wei Huang Yiping Chen Jun Yin School of Computer Nanjing University of Posts and Telecommunications Nanjing P. R. China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing P. R. China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing P. R. China

In real-world scenarios, laser-scanned point clouds often suffer from missing data points due to occlusion and other factors, significantly impacting subsequent tasks. We propose a novel point cloud completion method based on self-attention mechanisms and multi-layer perceptrons to address this issue, building upon the PCN model. Our experimental evaluations on the PCN dataset demonstrate notable enhancements in the completion effectiveness and evaluation metrics compared to the baseline model. Additionally, focusing on the point cloud completion context for industrial components, we introduce an approach for constructing an industrial component point cloud dataset. This method leverages 3D mesh models to swiftly generate complete point clouds with uniform distribution and devoid of noise while simulating the incomplete point clouds obtained from real-world scanning scenarios. The final results fully exhibit the feasibility of this scheme, which is a strong candidate for future industrial component point cloud completion.

关键词：

A Low-rank Matching Attention based Cross-modal Feature Fusion Method for Conversational Emotion Recognition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Shou, Yuntao Liu, Huan Cao, Xiangyong Meng, Deyu Dong, Bo School of Computer Science and Technology The Ministry of Education Key Laboratory for Intelligent Networks and Network Security The Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong Shaanxi Xi’an710049 China School of Computer Science and Technology Xi’an Jiaotong Shaanxi Xi’an710049 China The BigKE Joint Innovation Center SHMEEA Shanghai China School of Mathematics and Statistics Xi’an Jiaotong University Xi’an China

Conversational emotion recognition (CER) is an important research topic in human-computer interactions. Although recent advancements in transformer-based cross-modal fusion methods have shown promise in CER tasks, they tend to overlook the crucial intra-modal and inter-modal emotional interaction or suffer from high computational complexity. To address this, we introduce a novel and lightweight cross-modal feature fusion method called Low-Rank Matching Attention Method (LMAM). LMAM effectively captures contextual emotional semantic information in conversations while mitigating the quadratic complexity issue caused by the self-attention mechanism. Specifically, by setting a matching weight and calculating inter-modal features attention scores row by row, LMAM requires only one-third of the parameters of self-attention methods. We also employ the low-rank decomposition method on the weights to further reduce the number of parameters in LMAM. As a result, LMAM offers a lightweight model while avoiding overfitting problems caused by a large number of parameters. Moreover, LMAM is able to fully exploit the intra-modal emotional contextual information within each modality and integrates complementary emotional semantic information across modalities by computing and fusing similarities of intra-modal and inter-modal features simultaneously. Experimental results verify the superiority of LMAM compared with other popular cross-modal fusion methods on the premise of being more lightweight. Also, LMAM can be embedded into any existing state-of-the-art CER methods in a plug-and-play manner, and can be applied to other multi-modal recognition tasks, e.g., session recommendation and humour detection, demonstrating its remarkable generalization ability. Copyright © 2023, The Authors. All rights reserved.

关键词： Semantics

The Security and Privacy of Mobile Edge Computing: An Artificial Intelligence Perspective

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Cheng Yuan, Zenghui Zhou, Pan Xu, Zichuan Li, Ruixuan Wu, Dapeng Oliver Hubei Engineering Research Center on Big Data Security Key Laboratory of Distributed System Security of Hubei Province School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Software The Key Laboratory for Ubiquitous Network Service Software of Liaoning Province Dalian University of Technology Dalian116024 China Intelligent and Distributed Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science City University of Hong Kong Kowloon999077 Hong Kong

Mobile Edge Computing (MEC) is a new computing paradigm that enables cloud computing and information technology (IT) services to be delivered at the network’s edge. By shifting the load of cloud computing to individual local servers, MEC helps meet the requirements of ultralow latency, localized data processing, and extends the potential of Internet of Things (IoT) for end-users. However, the crosscutting nature of MEC and the multidisciplinary components necessary for its deployment have presented additional security and privacy concerns. Fortunately, Artificial Intelligence (AI) algorithms can cope with excessively unpredictable and complex data, which offers a distinct advantage in dealing with sophisticated and developing adversaries in the security industry. Hence, in this paper we comprehensively provide a survey of security and privacy in MEC from the perspective of AI. On the one hand, we use European Telecommunications Standards Institute (ETSI) MEC reference architecture as our based framework while merging the Software Defined Network (SDN) and Network Function Virtualization (NFV) to better illustrate a serviceable platform of MEC. On the other hand, we focus on new security and privacy issues, as well as potential solutions from the viewpoints of AI. Finally, we comprehensively discuss the opportunities and challenges associated with applying AI to MEC security and privacy as possible future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Network security

Understanding and Detecting Privacy Leakage Vulnerabilities in Hyperledger Fabric Chaincodes

学校读者我要写书评

暂无评论

Understanding and Detecting Privacy Leakage Vulnerabilities ...

International Symposium on Software Reliability Engineering (ISSRE)

作者： Ziming Chen Yue Li Jianbo Gao Jiashuo Zhang Ke Wang Jianbin Hu Zhi Guan Zhong Chen School of Computer Science Peking University Beijing China College of Computer Science and Technology Taiyuan University of Technology Taiyuan China Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing Jiaotong University Beijing China Peking University Chongqing Research Institute of Big Data Chongqing China National Engineering Research Center for Software Engineering Peking University Beijing China

ISBN: (数字)9798350353884

ISBN: (纸本)9798350353891

The application on a blockchain cannot maintain secrecy because its data is replicated across all peers in the network. To remedy this problem, Hyperledger Fabric introduces private data collection (PDC) into its smart contract (i.e. chaincode) to facilitate applications that require privacy. However, recent studies have revealed that PDC is too complex for chaincode developers to fully understand and use correctly, leading to privacy leaks vulnerabilities. In this paper, we present an empirical study on the prevalence of PDC misuse in chaincodes by extracting privacy leakage cases from StackOverflow posts and Hyperledger Fabric repositories on GitHub. Subsequently, we systematically categorize the misuse of PDC into three categories of vulnerabilities resulting in the leakage of private data and provide formal definitions for them. Furthermore, we develop PDChecker, an automated security analysis framework for identifying the privacy and security vulnerabilities in Fabric chaincodes. We evaluated PDChecker on 956 real-world chaincodes applying PDC and found that 67.78% of them contain at least one privacy leakage vulnerability. In addition, PDChecker uncovered 10 zero-day vulnerabilities documented by the China National Vulnerability database.

关键词： Privacy data privacy Distributed ledger databases Smart contracts Fabrics Blockchains Software reliability Security Software development management

Agentic Knowledgeable Self-awareness

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Qiao, Shuofei Qiu, Zhisong Ren, Baochang Wang, Xiaobin Ru, Xiangyuan Zhang, Ningyu Chen, Xiang Jiang, Yong Xie, Pengjun Huang, Fei Chen, Huajun Zhejiang University China Alibaba Group China Nanjing University of Aeronautics and Astronautics China Zhejiang Key Laboratory of Big Data Intelligent Computing China

Large Language Models (LLMs) have achieved considerable performance across various agentic planning tasks. However, traditional agent planning approaches adopt a "flood irrigation" methodology that indiscriminately injects gold trajectories, external feedback, and domain knowledge into agent models. This practice overlooks the fundamental human cognitive principle of situational self-awareness during decision-making—the ability to dynamically assess situational demands and strategically employ resources during decision-making. We propose agentic knowledgeable self-awareness to address this gap, a novel paradigm enabling LLM-based agents to autonomously regulate knowledge utilization. Specifically, we propose KnowSelf, a data-centric approach that applies agents with knowledgeable self-awareness like humans. Concretely, we devise a heuristic situation judgement criterion to mark special tokens on the agent’s self-explored trajectories for collecting training data. Through a two-stage training process, the agent model can switch between different situations by generating specific special tokens, achieving optimal planning effects with minimal costs. Our experiments demonstrate that KnowSelf can outperform various strong baselines on different tasks and models with minimal use of external knowledge1 Copyright © 2025, The Authors. All rights reserved.

关键词： Risk perception

Meta-Path Based Graph Contrastive Learning for Micro-Video Recommendation

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： He, Ying Wu, Gongqing Cai, Desheng Hu, Xuegang Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei230009 China

Nowadays, micro-video sharing platforms have become popular tools for people creating and viewing micro-videos in daily life. Micro-video recommendation task has attracted significant attention from researchers, recently. The key to a high-quality micro-video recommendation system is learning meaningful user and micro-video representations. Recently, many graph neural networks (GNNs) are proposed to learn node representations in graphs, which could be useful for recommendation tasks. However, we argue that directly utilizing existing GNNs in micro-video recommendations is ill-posed. The reasons are: (1) most previous GNNs fail to capture the heterogeneity of heterogeneous graphs since they are designed for homogeneous graphs;(2) they overemphasize node proximity and could hurt the robustness of node embeddings. In contrast to previous work, we propose a meta-path-based graph contrastive learning network (MPGCL) that learns more meaningful user and video embeddings for recommendation. Specifically, we yield homogeneous graphs for user type and video type to better capture heterogeneity based on a well-designed meta-path-based random walk strategy. Furthermore, to learn more robust node embeddings that are less sensitive to noise, we propose a graph contrastive learning network on different types of homogeneous graphs, which maximizes the consistency between graph representations with different views. We do extensive experiments on three real-world datasets and the results show that our model can learn more meaningful embeddings for user and micro-videos and outperforms the strong baselines. © 2022, The Authors. All rights reserved.

关键词： Graph neural networks

学校读者我要写书评

暂无评论

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

Physical Information Neural Networks for Solving High-index Differential-algebraic Equation Systems Based on Radau Methods

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Jiasheng Tang, Juan Yan, Ming Lai, Shuai Liang, Kun Lu, Jianguang Yang, Wenqiang Institute of Computing Science and Technology Guangzhou University Guangzhou China School of Computer Science and Cyber Engineering Guangzhou University Guangzhou China Singapore Singapore State Key Laboratory of Public Big Data Guizhou University Guiyang China Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

As is well known, differential algebraic equations (DAEs), which are able to describe dynamic changes and underlying constraints, have been widely applied in engineering fields such as fluid dynamics, multi-body dynamics, mechanical systems and control theory. In practical physical modeling within these domains, the systems often generate high-index DAEs. Classical implicit numerical methods typically result in varying order reduction of numerical accuracy when solving high-index systems. Recently, the physics-informed neural network (PINN) has gained attention for solving DAE systems. However, it faces challenges like the inability to directly solve high-index systems, lower predictive accuracy, and weaker generalization capabilities. In this paper, we propose a PINN computational framework, combined Radau IIA numerical method with a neural network structure via the attention mechanisms, to directly solve high-index DAEs. Furthermore, we employ a domain decomposition strategy to enhance solution accuracy. We conduct numerical experiments with two classical high-index systems as illustrative examples, investigating how different orders of the Radau IIA method affect the accuracy of neural network solutions. The experimental results demonstrate that the PINN based on a 5th-order Radau IIA method achieves the highest level of system accuracy. Specifically, the absolute errors for all differential variables remains as low as 10−6, and the absolute errors for algebraic variables is maintained at 10−5, surpassing the results found in existing literature. Therefore, our method exhibits excellent computational accuracy and strong generalization capabilities, providing a feasible approach for the high-precision solution of larger-scale DAEs with higher indices or challenging high-dimensional partial differential algebraic equation systems. Copyright © 2023, The Authors. All rights reserved.

关键词： Numerical methods

Complex Substation Scene Segmentation Method Based on Optimized Straight Line Detection

学校读者我要写书评

暂无评论

Complex Substation Scene Segmentation Method Based on Optimi...

Chinese Automation Congress (CAC)

作者： Lei Wang Wei Huang Yiping Chen Hao Chen Chuang Liu Jun Yin School of Computer Nanjing University of Posts and Telecommunications Nanjing P. R. China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing P. R. China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing P. R. China

This paper proposes a scene segmentation method based on optimized line detection to address the difficulty of segmenting spatially independent equipment in complex substation scenes. The method first employs the RANSAC method to simulate the ground plane and extract the ground point cloud. Then, it projects the 3D point cloud scene onto a 2D plane to obtain a 2D image of the substation. Straight line segments of the power line are extracted from the image using the edge detection algorithm and an improved line detection algorithm. The straight line segments that do not belong to the power line are filtered out using the surrounding features of the 3D point corresponding to the 2D point on the line. The power line's straight line segment is extended using the region-growing algorithm. Finally, the power line clustering is completed using European clustering based on the three-dimensional coordinates of the two ends of the power line, thereby completing the scene segmentation. Experimental results show that the proposed method can effectively segment substation equipment. Compared to traditional segmentation methods, this method has an average power line identification accuracy of 14% higher.

关键词：