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

JDC-GCN: joint diversity and consistency graph convolutional network

Neural computing and Applications 2025年 1-17页

作者： Lin, Renjie Yao, Jie Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

In real-world scenarios, multi-view data comprises heterogeneous features, with each feature corresponding to a specific view. The objective of multi-view semi-supervised classification is to enhance classification performance by leveraging the inherent complementary and consistent information present within diverse views. Nevertheless, many existing frameworks primarily focus on assigning suitable weights to different views while neglecting the importance of consistent information. In this paper, a multi-view semi-supervised classification framework called joint diversity and consistency graph convolutional network (JDC-GCN) is proposed. Firstly, the structure of graph convolutional network is introduced to the multi-view semi-supervised classification, capable of propagating the label information over the topological structure of multi-view data. Secondly, the proposed JDC-GCN captures the complementary and consistent information from multiple views through two indispensable sub-modules, Diversity-GCN and Consistency-GCN, respectively. Finally, the attention mechanism is leveraged to dynamically adjust the weights of various views, allowing us to measure the significance of heterogeneous features and the consistent graph without introducing additional parameters. Comprehensive experiments on eight multi-view datasets are conducted to validate the effectiveness of the JDC-GCN algorithm. The results show that the proposed method exhibits superior classification performance compared to other state-of-the-art methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Review of Human Mesh Reconstruction: Beyond 2D Video Object Segmentation 16th

A Review of Human Mesh Reconstruction: Beyond 2D Video Obje...

引用

16th International Conference on Social Robotics, ICSR + InnoBiz 2024

作者： Wu, Peng Wang, Zhicheng Pan, Feiyu Li, Fangkai Hu, Hao Lu, Xiankai Guo, Yiyou School of Software Shandong University Shandong Jinan250000 China School of Mathematics and Computer Science Fujian Provincial Key Laboratory of Data-Intensive Computing Fujian University Laboratory of Intelligent Computing and Information Processing Quanzhou Normal University Quanzhou China

ISBN: (纸本)9789819611508

Video object segmentation aims to extract 2D object masks by segmenting video frames into multiple objects, which is crucial in various practical applications such as medical imaging, etc.. However, traditional video object segmentation methods produce 2D masks, which are not suitable for 3D scenarios where depth information is essential, such as in robotic grasping, virtual reality, and autonomous driving, etc.. In this paper, we present a comprehensive review of 3D human mesh reconstruction (HMR) as an extension beyond 2D video object segmentation. We begin by reviewing the mainstream video object segmentation methods, then transition from 2D video object segmentation to 3D HMR. We further categorize recent HMR methods based on key characteristics that define this research field, including the type of model input and the use of statistical models. Finally, we provide detailed information on HMR datasets and evaluation metrics. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

引用

Digital Communications and networks 2025年第2期11卷 473-481页

作者： Qi Li Gaozhan Liu Qianqian Zhang Lidong Han Wei Chen Rui Li Jinbo Xiong School of Computer Science Nanjing University of Posts and Telecommunications Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal University Tongda College of Nanjing University of Posts and Telecommunications Henan Key Laboratory of Network Cryptography Technology School of Computer Science and Technology Xidian University State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal University Faculty of Software Fujian Normal University

Ciphertext-Policy Attribute-Based Encryption(CP-ABE) enables fine-grained access control on ciphertexts, making it a promising approach for managing data stored in the cloud-enabled Internet of Things. But existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute content. Additionally, resource-constrained IoT devices, especially those adopting wireless communication, frequently encounter affordability issues regarding decryption costs. In this paper, we propose an efficient and fine-grained access control scheme with fully hidden policies(named FHAC). FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them. A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access policy. Dictionary attacks are thwarted by providing unauthorized users with invalid values. The heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud servers. Additionally, users can verify the correctness of multiple outsourced decryption results simultaneously. Security analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption.

关键词： Access control Policy hiding Verifiable outsourced computation Cloud IoT

来源：评论

学校读者我要写书评

暂无评论

High-precision end-to-end adaptive optics aided orbital angular momentum wireless communication with XFTC-Net

引用

Optics Letters 2025年第10期50卷 3265-3268页

作者： Xu, Panpan Chang, Huan Wang, Fei Gao, Ran Guo, Dong Zhu, Lei Li, Zhipei Zhou, Sitong Xu, Qi Chen, Jing Xin, Xiangjun Beijing100081 China National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China Beijing100876 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology 250353 China

In this Letter, we demonstrate high-precision end-to-end adaptive optics (AO) technique based on the X-Shape Fusion Transformer-convolutional neural network (XFTC-Net) without an additional probe path to compensate for distortions caused by atmospheric turbulence (AT) in orbital angular momentum (OAM) optical wireless communication links. The experimental results show that the XFTC-Net effectively extracts the intensity distribution features of distorted OAM beams, predicting AT phase screens and identifying OAM modes. After XFTC-Net-aided AO compensation, the bit error rate of the OAM optical communication system remains below 3.8 × 10−3, staying within Cn2 = 1 × 10−15–1 × 10−13 m−2/3. Moreover, the optical power with l= 3 increases from 5.08 dBm to 8.23 dBm at a transmission distance of 800 m. These experimental results indicate that the proposed XFTC-Net AO technique effectively compensates for OAM beam distortion in both single- and multiplexed-channel OAM links, which effectively balances the system complexity and transmission performance of OAM-based free space optical (FSO) communication systems, opening up new avenues for enhancing the performances of high-capacity optical communication. © 2025 Optica Publishing Group. All rights, including for text and data mining (TDM), Artificial Intelligence (AI) training, and similar technologies, are reserved.

关键词： Fiber to the x

来源：评论

学校读者我要写书评

暂无评论

Cross-Modal Haptic Compression Inspired by Embodied AI for Haptic Communications

引用

IEEE Transactions on Multimedia 2025年

作者： Lu, Hang Tan, Xinmeng Chen, Mingkai Zhang, Zhe Zhang, Xuguang Chen, Jianxin Wei, Xin Zhao, Tiesong Nanjing University of Posts and Telecommunications Key Laboratory of Broadband Wireless Communication and Sensor Network Technology China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Science & Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China

Haptic data compression has gradually become a key issue for emerging real-time haptic communications in Tactile Internet (TI). However, it is challenging to achieve a tradeoff between high perceptual quality and compression ratio in haptic data compression scheme. Inspired by the perspective of embodied AI, we propose a cross-modal haptic compression scheme for haptic communications to improve the perception quality on TI devices in this paper. Since multimodal fusion is routinely employed to improve the ability of system in cognition, we assume that haptic codec is guided by visual semantics to optimize parameter settings in the coding process. We first design a multi-dimensional tactile feature fusion network (MTFFN) relying on multi-head attention mechanism. The MTFFN extracts the multi-dimensional features from the material surface and maps them to infer the coding parameters. Secondly, we provide second-order difference and linear interpolation to establish an criterion for the determination of optimal codec parameters, which are customized by the material categories so as to give high robustness. Finally, the simulation results reveal that our compression scheme can efficiently make a personalized codec procedure for different materials, obtaining more than 17% improvement in terms of compression ratio with high perceptual quality at the same time. © 2025 IEEE.

关键词： Data compression ratio

来源：评论

学校读者我要写书评

暂无评论

Any-Angle Routing Algorithm for Microfluidic Biochips Driven by Flow Path

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 978-988页

作者： Youlin, Pan Shuai, Guo Xing, Huang Genggeng, Liu College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

Continuous-flow microfluidic biochips (CFMBs) have become a hot research topic in recent years due to their ability to perform biochemical assays automatically and efficiently. For the first time, PathDriver+ takes the requirements of the actual fluid transportation into account in the design process of CFMBs and implements the actual fluid transport and removal, and plans separate flow paths for each transport task, which have been neglected in previous work. However, PathDriver+ does not take full advantage of the flexibility of CFMBs routing because it only considers the optimization of flow channel length for the global routing in the mesh model, except for the detailed routing. In addition, PathDriver+ only considers the X architecture, while the existing work shows that the any-angle routing can utilize the routing resources more efficiently and shorten the flow channel length. To address the above issues, we propose a flow path-driven arbitrary angle routing algorithm, which can improve the utilization of routing resources and reduce the flow channel length while considering the actual fluid transportation requirements. The proposed algorithm constructs a search graph based on constrained Delaunay triangulation to improve the search efficiency of routing solutions while ensuring the routing quality. Then, a Dijkstra-based flow path routing method is used on the constructed search graph to generate a routing result with a short channel length quickly. In addition, in the routing process, channel reuse strategy and intersection optimization strategy are proposed for the flow path reuse and intersection number optimization problems, respectively, to further improve the quality of routing results. The experimental results show that compared with the latest work PathDriver+, the length of channels, the number of ports used, and the number of channel intersections are significantly reduced by 33.21%, 11.04%, and 44.79%, respectively, and the channel reuse rate is i

关键词： High level synthesis

来源：评论

学校读者我要写书评

暂无评论

Control Logic Routing for Continuous-Flow Microfluidic Biochips Based on Deep Reinforcement Learning

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2025年第4期62卷 950-962页

作者： Cai, Huayang Huang, Xing Liu, Genggeng College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Fuzhou University Ministry of Education Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China School of Computer Science Northwestern Polytechnical University Xi’an710072 China

With the advancement of electronic design automation, continuous-flow microfluidic biochips have become one of the most promising platforms for biochemical experiments. This chip manipulates fluid samples in milliliters or nanoliters by utilizing internal microvalves and microchannels, and thus automatically performs basic biochemical experiments, such as mixing and detection. To achieve the correct bioassay function, the microvalves deployed inside the chip are usually managed by a multiplexer-based control logic, and valves receive control signals from a core input through the control channel for accurate switching. Since biochemical reactions typically require high sensitivity, the length of control paths connecting each valve needs to be reduced to ensure immediate signal propagation, and thus to reduce the signal propagation delay. In addition, to reduce the fabrication cost of chips, a vital issue to be addressed in the logic architecture design is how to effectively reduce the total channel length within the control logic. To address the above issues, we propose a deep reinforcement learning-based control logic routing algorithm to minimize the signal propagation delay and total control channel length, thereby automatically constructing an efficient control channel network. The algorithm employs the dueling deep Q-network architecture as the agent of the deep reinforcement learning framework to evaluate the tradeoff between signal propagation delay and total channel length. Besides, the diagonal channel routing is implemented for the first time for control logic, thus fundamentally improving the efficiency of valve switching operations and reducing the fabrication cost of the chip. The experimental results demonstrate that the proposed algorithm can effectively construct a high-performance and low-cost control logic architecture. © 2025 Science Press. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient Personalized Distributed Learning with Data and Node Heterogeneity

引用

IEEE Transactions on Cognitive Communications and networking 2025年

作者： Tian, Zhuojun Zhang, Zhaoyang Li, Yiwei Bennis, Mehdi Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China University of Oulu Center for Wireless Communications Oulu90014 Finland State Key Laboratory of Industrial Control Technology Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multimodal Communication Networks and Intelligent Information Processing Hangzhou310027 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China

To jointly tackle the challenges of data and node heterogeneity in decentralized learning, we propose a distributed strong lottery ticket hypothesis (DSLTH), based on which a communication-efficient personalized learning algorithm is developed. In the proposed method, each local model is represented as the ‌Hadamard product of global real-valued parameters and a personalized binary mask for pruning. The local model is learned by updating and fusing the personalized binary masks while the real-valued parameters are fixed among different agents. To further reduce the complexity of hardware implementation, we incorporate a group sparse regularization term in the loss function, enabling the learned local model to achieve structured sparsity. Then, a binary mask aggregation algorithm is designed by introducing an intermediate aggregation tensor and adding a personalized fine-tuning step in each iteration, which constrains model updates towards the local data distribution. The proposed method effectively leverages the relativity among agents while meeting personalized requirements in heterogeneous node conditions. We also provide a theoretical proof for the DSLTH, establishing it as the foundation of the proposed method. Numerical simulations confirm the validity of the DSLTH and demonstrate the effectiveness of the proposed algorithm. © 2015 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

MEFA-Net: A mask enhanced feature aggregation network for polyp segmentation

引用

Computers in Biology and Medicine 2025年 186卷 109601-109601页

作者： Ke, Xiao Chen, Guanhong Liu, Hao Guo, Wenzhong Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350116 China

Accurate polyp segmentation is crucial for early diagnosis and treatment of colorectal cancer. This is a challenging task for three main reasons: (i) the problem of model overfitting and weak generalization due to the multi-center distribution of data;(ii) the problem of interclass ambiguity caused by motion blur and overexposure to endoscopic light;and (iii) the problem of intraclass inconsistency caused by the variety of morphologies and sizes of the same type of polyps. To address these challenges, we propose a new high-precision polyp segmentation framework, MEFA-Net, which consists of three modules, including the plug-and-play Mask Enhancement Module (MEG), Separable Path Attention Enhancement Module (SPAE), and Dynamic Global Attention Pool Module (DGAP). Specifically, firstly, the MEG module regionally masks the high-energy regions of the environment and polyps through a mask, which guides the model to rely on only a small amount of information to distinguish between polyps and background features, avoiding the model from overfitting the environmental information, and improving the robustness of the model. At the same time, this module can effectively counteract the "dark corner phenomenon" in the dataset and further improve the generalization performance of the model. Next, the SPAE module can effectively alleviate the inter-class fuzzy problem by strengthening the feature expression. Then, the DGAP module solves the intra-class inconsistency problem by extracting the invariance of scale, shape and position. Finally, we propose a new evaluation metric, MultiColoScore, for comprehensively evaluating the segmentation performance of the model on five datasets with different domains. We evaluated the new method quantitatively and qualitatively on five datasets using four metrics. Experimental results show that MEFA-Net significantly improves the accuracy of polyp segmentation and outperforms current state-of-the-art algorithms. Code posted on https://***/

关键词： Endoscopy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：