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

MR-IDPSO: A Novel Algorithm for Large-Scale Dynamic Service Composition

Tsinghua Science and Technology 2015年第6期20卷 602-612页

作者： Yanping Zhang Zihui Jing Yiwen Zhang School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal ProcessingMinistry of EducationAnhui University

In the era of big data, data intensive applications have posed new challenges to the field of service composition. How to select the optimal composited service from thousands of functionally equivalent services but different Quality of Service(Qo S) attributes has become a hot research in service computing. As a consequence,in this paper, we propose a novel algorithm MR-IDPSO(Map Reduce based on Improved Discrete Particle Swarm Optimization), which makes use of the improved discrete Particle Swarm Optimization(PSO) with the Map Reduce to solve large-scale dynamic service composition. Experiments show that our algorithm outperforms the parallel genetic algorithm in terms of solution quality and is efficient for large-scale dynamic service composition. In addition,the experimental results also demonstrate that the performance of MR-IDPSO becomes more better with increasing number of candidate services.

关键词： Map Reduce service composition Quality of Service(

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-aware Superpoint Graph Transformer for Weakly Supervised 3D Semantic Segmentation

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Fan, Yan Wang, Yu Zhu, Pengfei Hui, Le Xie, Jin Hu, Qinghua Tianjin University College of Intelligence and Computing Tianjin300350 China Ministry of Education of the People's Republic of China Engineering Research Center of City Intelligence and Digital Governance China Haihe Laboratory of Itai Tianjin China Northwestern Polytechnical University School of Electronics and Information Shaanxi Key Laboratory of Information Acquisition and Processing China Nanjing University of Science and Technology Pca Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Nanjing University State Key Laboratory for Novel Software Technology Nanjing China

Weakly supervised 3D semantic segmentation has successfully mitigated the labor-intensive and time-consuming task of annotating 3D point clouds. However, reliably utilizing the minimal point-wise annotations for unlabeled data in complex and large-scale scenes is still challenging, such as only 20 points labeled in 2 million points. To tackle this challenge, we propose a new Uncertainty-aware Superpoint Graph Transformer (UaSGT) framework that utilizes minimal annotations for unlabeled data learning through reliable long-range supervision propagation from labeled superpoints to unlabeled superpoints. First, we propose a superpoint graph transformer to achieve long-range supervision propagation along the attention-based fuzzy subsets defined on superpoints. The attention-based fuzzy subset measures the membership of unlabeled superpoints to clusters centered on labeled superpoints. Second, we employ an uncertainty-aware membership rectification technique on the fuzzy subset to ensure reliable propagation among superpoints within the same category. This technique integrates an uncertainty prediction module to mask the influence of unreliable membership and a spatial prior refinement module to reduce uncertainty in intra-class membership degrees. Finally, experimental results on two large-scale benchmarks S3DIS and ScanNet-V2 demonstrate the superiority of our approach compared to the state-of-the-art with at least 90% annotation reduction, and our method also achieves comparable performance to fully supervised methods with less than 0.1% labeled points. Our code is available at https://***/fanyan0411/UaSGT. © 2025 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

D-FGNAE: Decentralized Federated Graph Normalized AutoEncoder 19th

D-FGNAE: Decentralized Federated Graph Normalized AutoEncode...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Liang, Yuting Cai, Weixin Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Graphs widely exist in real-world, and Graph Neural Networks (GNNs) have exhibited exceptional efficacy in graph learning in diverse fields. With the strengthening of data privacy protection worldwide in recent years, Federated graph neural networks (FedGNNs) have gained increasing attention in academia and industry owing to their ability to train the model in a collaborative manner while complying with the privacy protection regulations. However, in federated learning, the non-independent and identically distributed (non-IID) problem of local data possessed by multiple participants can significantly undermine model accuracy. We propose a new Decentralized Federated Graph Normalized AutoEncoder (D-FGNAE). First, the model is designed as a decentralized federated learning framework with dynamically assigned tripartite roles. This design eliminates the fixed server role found in traditional federated learning, enhances system fault tolerance, avoids single points of failure, and protects model privacy. Second, the splitting and correcting of calculation by layer in the model, along with the special design of the normalization layer, effectively tackle the non-IID problem in both the structural and attribute aspects. Experimental results on real-world networks demonstrate the effectiveness of D-FGNAE, which can achieve nearly the same accuracy as the centralized model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Li, Xinying Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

UGCM-LU: A Unified Stream and Batch Graph computing Model with Local Update for Community Detection 19th

UGCM-LU: A Unified Stream and Batch Graph Computing Model w...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Li, Hong Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Unified stream and batch computing (USBC) aims to incorporate stream and batch computation into a unified framework, thereby enabling the development of a one-stop solution for stream and batch data processing and enhancing the generalization of the framework. However, research on unified graph computing models (UGCMs) faces several challenges. First, existing UGCMs need to consider all graph information in the cache during the incremental update phase, thus leading to decreased execution efficiency. Second, existing UGCMs use fixed bytes to store nodes without considering the actual space occupied by nodes resulting in wasted memory when dealing with large graphs. This paper proposes a UGCM with Local Updates for community detection (UGCM-LU). We first implement a local update strategy to consider partial information of the graph to achieve incremental updates. Secondly, we also designed a byte-compression-based module to store graph data according to the space occupied by nodes. The experimental results show the effectiveness and efficiency of the model in real-world and artificial networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lutetium alloys

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Zhang, Yunan Wang, Chaohui Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

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

引用

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

作者： Panpan Xu Huan Chang Fei Wang Ran Gao Dong Guo Lei Zhu Zhipei Li Sitong Zhou Qi Xu Jing Chen Xiangjun Xin School of Information and Electronics Beijing Institute of Technology (BIT) Beijing 100081 China National Key Laboratory of Science and Technology on Space-Born Intelligent Information Processing Beijing China School of Electronic Engineering Beijing University of Posts and Telecommunications (BUPT) Beijing 100876 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 $C_{n}^2=1 \times 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.

关键词： Adaptive optics Bit error rate Neural networks Optical wireless communication Polarization division multiplexing Space division multiplexing

来源：评论

学校读者我要写书评

暂无评论

Shape Recognition and Retrieval Based on Edit Distance and Dynamic Programming

引用

Tsinghua Science and Technology 2009年第6期14卷 739-745页

作者：潘鸿飞梁栋唐俊王年李薇 Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University

An important aim in pattern recognition is to cluster the given shapes. This paper presents a shape recognition and retrieval algorithm. The algorithm first extracts the skeletal features using the medial axis transform. Then, the features are transformed into a string of symbols with the similarity among those symbols computed based on the edit distance. Finally, the shapes are identified using dynamic programming. Two public datasets are analyzed to demonstrate that the present approach is better than previous approaches.

关键词： skeletal features medial axis transform edit distance dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Simplicial complexes graph convolution networks with higher-order features learning for limited samples diagnosis

引用

Control Engineering Practice 2025年 162卷

作者： Xian-Jie Zhang Hai-Feng Zhang Kai Zhong Xiao-Ming Zhang The Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education School of Mathematical Science Anhui University Hefei 230601 Anhui China The Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei 230601 Anhui China

With the advancement of industrial automation, there is an increasing focus on research concerning limited fault samples. Although meta-learning and other methods can address this issue, they often necessitate the incorporation of additional data and are unable to directly diagnose faults using only unlabeled data along with a small amount of labeled data. In response, this article proposes the use of simplicial complexes graph convolutional networks for fault diagnosis, which simultaneously account for both higher-order and lower-order topological structures among samples. This approach effectively addresses the challenge of limited samples by extracting relevant information from unlabeled data without the need to introduce new knowledge. Initially, simplices of varying dimensions are employed within a constructed simple graph to represent different relationships among samples. Subsequently, the simplicial complexes convolutional network is introduced to capture the higher-order information, while the graph convolutional network is utilized to obtain the lower-order information. The combined feature information is then input into a classifier for fault diagnosis. Finally, experiments conducted on two datasets characterized by small sample sizes or imbalanced samples demonstrate the method’s commendable diagnostic performance, as well as its robustness and practicality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Human-like conceptual representations emerge from language prediction

arXiv

引用

arXiv 2025年

作者： Xu, Ningyu Zhang, Qi Du, Chao Luo, Qiang Qiu, Xipeng Huang, Xuanjing Zhang, Menghan School of Computer Science Fudan University Shanghai China Institute of Modern Languages and Linguistics Fudan University Shanghai China Shanghai Key Laboratory of Intelligent Information Processing Shanghai China Research Institute of Intelligent Complex Systems Fudan University Shanghai China Shanghai Collaborative Innovation Center of Intelligent Visual Computing Shanghai China Ministry of Education Key Laboratory of Contemporary Anthropology Fudan University Shanghai China

People acquire concepts through rich physical and social experiences and use them to understand the world. In contrast, large language models (LLMs), trained exclusively through next-token prediction over language data, exhibit remarkably human-like behaviors. Are these models developing concepts akin to humans, and if so, how are such concepts represented and organized? To address these questions, we reframed the classic reverse dictionary task to simulate human concept inference in context and investigated the emergence of human-like conceptual representations within LLMs. Our results demonstrate that LLMs can flexibly derive concepts from linguistic descriptions in relation to contextual cues about other concepts. The derived representations converged towards a shared, context-independent structure that effectively predicted human behavior across key psychological phenomena, including computation of similarities, categories and semantic scales. Moreover, these representations aligned well with neural activity patterns in the human brain, even in response to visual rather than linguistic stimuli, providing evidence for biological plausibility. These findings establish that structured, human-like conceptual representations can naturally emerge from language prediction without real-world grounding. More broadly, our work positions LLMs as promising computational tools for understanding complex human cognition and paves the way for better alignment between artificial and human intelligence. Copyright © 2025, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：