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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Grouping Strategy-Based Progressive Fusion network for Hyperspectral Image Super-Resolution

A Grouping Strategy-Based Progressive Fusion Network for Hyp...

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Guohua Lv Baodong Zhang Yongbiao Gao Guixin Zhao Guotao Wang Juncan Wang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Shandong Key Laboratory of Ubiquitous Intelligent Computing Jinan China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application (Southeast University) Ministry of Education China Beihang University Beijing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Hyperspectral super-resolution involves combining low-resolution hyperspectral images with high-resolution multispectral images to produce a high-resolution hyperspectral image. Recently, although many methods for hyperspectral image super-resolution have been proposed, they often fail to fully utilize the high similarity among adjacent bands to enhance fusion performance. Therefore, we propose a grouping strategy-based progressive fusion network (GPFNet) for hyperspectral super-resolution. The core of GPFNet is the grouping strategy fusion block (GPF block), in which grouping-based spatial-spectral information fusion and spatial information refinement are performed. We design the spatial-spectral information fusion module (SSIFM) based on grouped convolutions to capture the feature differences from adjacent bands. To refine spatial details, we develop the spatial information enhancement module (SpaEM), which leverages the hierarchical features extracted by the multi-scale feature extraction module (MIEM). Additionally, a progressive fusion strategy, which involves using multiple upsampled hyperspectral images and downsampled multispectral images, further preserves spectral integrity and spatial details. Extensive experiments show that GPFNet outperforms state-of-the-art methods both qualitatively and quantitatively.

关键词： Convolution Superresolution Feature extraction Acoustics Data mining Speech processing Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

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

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan 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 Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Lifetime Prediction of Topcon Modules Based on Accelerated Damp Heat Life Tests

SSRN

引用

SSRN 2025年

作者： Ren, Xingang Duan, Junwei Yang, Lixia Xu, Tao Yu, Yuanjie Chen, Zhiliang Lv, Ruirui Ye, Feihong Wang, Gang Ahmed, Rida Jiang, Hao Yang, Lixia Huang, Zhixiang Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei230601 China Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei230601 China CSI Cells Co. Ltd. Suzhou215129 China Anhui University of Chinese Medicine China Hong Kong Polytechnic University Hong Kong

Tunnel Oxide Passivation Contacts (TOPCon) solar cells have achieved high efficiency and become mainstream product in the global photovoltaic (PV) market. However, their long-term reliability, especially under high-temperature and high-humidity conditions, lacks sufficient field validation, and there is a lack of lifetime prediction models for TOPCon modules. To address this, we developed a robust accelerated aging model by integrating an improved Peck model with a sigmoidal degradation function, incorporating internal humidity and temperature as critical factors. The model employs a particle swarm optimization (PSO) algorithm to calibrate activation energy and humidity sensitivity parameters, enabling precise degradation trajectory simulation. Validated through a "fitting + testing" framework, the model achieves high accuracy (RMSE = 0.7%) in predicting power degradation under Damp Heat (DH), Highly Accelerated Stress Test (HAST), and modified Pressure Cooker Test (mPCT) conditions. Accelerated aging tests reveal that DH-induced degradation primarily reduces fill factor (FF) due to finger corrosion, with minimal impact on Voc and Isc. Experimental validation using a non-commercial corrosion-sensitive BOM combination shows that polyolefin elastomer (POE)-encapsulated modules exhibit superior corrosion resistance, projecting a service lifetime 23 years longer than EVA/EVA encapsulation in high-humidity regions like Hainan. This work bridges the gap in TOPCon module lifetime prediction under extreme environments, offering actionable insights for optimizing encapsulation materials and enhancing reliability. The model provides a scalable framework for evaluating module performance under site-specific climatic conditions, accelerating the development of durable PV technologies. © 2025, The Authors. All rights reserved.

关键词： Corrosion resistance

来源：评论

学校读者我要写书评

暂无评论

EDA: Enhanced Domain-Adversarial Training for Anatomical Landmark Detection

EDA: Enhanced Domain-Adversarial Training for Anatomical Lan...

引用

IEEE International Symposium on Biomedical Imaging

作者： Fan Yang S. Kevin Zhou School of Biomedical Engineering Division of Life Sciences and Medicine University of Science and Technology of China Hefei Anhui China Center for Medical Imaging Robotics Analytic Computing & Learning (MIRACLE) Suzhou Institute for Advanced Research University of Science and Technology of China Suzhou Jiangsu China Key Laboratory of Precision and Intelligent Chemistry USTC Hefei Anhui China Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Beijing China

ISBN: (数字)9798331520526

ISBN: (纸本)9798331520533

Manually annotating anatomical landmarks in medical images requires experienced clinicians and is a labor-intensive process. However, recent AI-assisted methods for landmark detection often rely on the training and test data originating from the same domain. This work introduces a novel unsupervised domain adaptation (UDA) framework aimed at anatomical landmark detection from a medical image, designed to bridge the gap between a source domain with labels and an unlabeled target domain. Specifically, we have developed a new Domain-Adversarial network that incorporates skip connections to transfer and fuse high-resolution feature maps. Additionally, we proposed Dynamic Gaussian Learning, which allows the model to escape from local error regions. We carry out experiments on landmark detection for both head and chest, and the results demonstrate that our method achieves state-of-the-art performances in each experiment.

关键词： Training Measurement Adaptation models Three-dimensional displays Smoothing methods Head Kernel Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Enhanced Practical Byzantine Fault Tolerance for Service Function Chain Deployment: Advancing Big Data Intelligence in Control Systems

引用

Computers, Materials and Continua 2025年第3期83卷 4393-4409页

作者： Peiying Zhang Yihong Yu Jing Liu Chong Lv Lizhuang Tan Yulin Zhang Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software Qingdao 266580 China Library of Shanghai Lixin University of Accounting and Finance Shanghai 201209 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250014 China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan 250014 China Key Laboratory of Ethnic Language Intelligent Analysis and Security Governance of MOE Minzu University of China Beijing 100081 China Key Laboratory of Intelligent Game Yangtze River Delta Research Institute of NPU Taicang 215400 China Key Laboratory of Education Informatization for Nationalities (Yunnan Normal University) Ministry of Education Kunming 650092 China

As Internet of Things (IoT) technologies continue to evolve at an unprecedented pace, intelligent big data control and information systems have become critical enablers for organizational digital transformation, facilitating data-driven decision making, fostering innovation ecosystems, and maintaining operational stability. In this study, we propose an advanced deployment algorithm for Service Function Chaining (SFC) that leverages an enhanced Practical Byzantine Fault Tolerance (PBFT) mechanism. The main goal is to tackle the issues of security and resource efficiency in SFC implementation across diverse network settings. By integrating blockchain technology and Deep Reinforcement Learning (DRL), our algorithm not only optimizes resource utilization and quality of service but also ensures robust security during SFC deployment. Specifically, the enhanced PBFT consensus mechanism (VRPBFT) significantly reduces consensus latency and improves Byzantine node detection through the introduction of a Verifiable Random Function (VRF) and a node reputation grading model. Experimental results demonstrate that compared to traditional PBFT, the proposed VRPBFT algorithm reduces consensus latency by approximately 30% and decreases the proportion of Byzantine nodes by 40% after 100 rounds of consensus. Furthermore, the DRL-based SFC deployment algorithm (SDRL) exhibits rapid convergence during training, with improvements in long-term average revenue, request acceptance rate, and revenue/cost ratio of 17%, 14.49%, and 20.35%, respectively, over existing algorithms. Additionally, the CPU resource utilization of the SDRL algorithm reaches up to 42%, which is 27.96% higher than other algorithms. These findings indicate that the proposed algorithm substantially enhances resource utilization efficiency, service quality, and security in SFC deployment.

关键词： Big data intelligent transformation heterogeneous networks service function chain blockchain deep reinforcement learning trusted deployment

来源：评论

学校读者我要写书评

暂无评论

A Bi-selection Method Based on Consistent Matrix for Large-Scale Datasets

引用

IEEE Transactions on Fuzzy Systems 2025年

作者： Quan, Jinsheng Qiao, Fengcai Yang, Tian Shen, Shuo Qian, Yuhua Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Institute of Interdisciplinary Studies Changsha410081 China National University of Defense Technology College of Advanced Interdisciplinary Studies Changsha410081 China Shanxi University Institute of Big Data Science and Industry Taiyuan030006 China

Biselection (feature and sample selection) enhances the efficiency and accuracy of machine learning models when handling large-scale data. Fuzzy rough sets, an uncertainty mathematics model known for its excellent interpretability, are widely used in machine learning, particularly for feature selection. While the consistent matrix has significantly improved the computational efficiency and scalability of feature selection, like most fuzzy rough set-based methods, it focuses only on feature selection and seldom incorporates sample selection. This feature-centric approach can limit classification performance, particularly in noisy and large-scale datasets where both features and samples require judicious selection. To overcome these limitations, this article explores the integration of sample selection with feature selection. First, we introduce a β-consistent granulation method to generate more accurate and concise fuzzy information granules, reducing the impact of noisy samples. In addition, a novel membership function is employed to distinguish noise while simultaneously evaluating both features and samples. As a result, a biselection algorithm with linear computation complexity is proposed to select high-quality features and samples. Numerical experiments demonstrate that, compared to eleven representative algorithms, our proposed method achieves an average accuracy improvement of 9.66% and a 933-fold increase in efficiency. © 2025 IEEE.

关键词： Biselection consistent matrix (CM) fuzzy sets granular computing rough sets

来源：评论

学校读者我要写书评

暂无评论

Efficient numerical methods for computing stationary states of spherical Landau-Brazovskii model

arXiv

引用

arXiv 2025年

作者： Qiu, Qun Si, Wei Ji, Guanghua Jiang, Kai School of Mathematical Sciences Beijing Normal University Beijing100875 China School of Mathematics Sciences Peking University Beijing100871 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan Xiangtan411105 China

In this paper, we develop a set of efficient methods to compute stationary states of the spherical Landau-Brazovskii (LB) model in a discretization-then-optimization way. First, we discretize the spherical LB energy functional into a finite-dimensional energy function by the spherical harmonic expansion. Then five optimization methods are developed to compute stationary states of the discretized energy function, including the accelerated adaptive Bregman proximal gradient, Nesterov, adaptive Nesterov, adaptive nonlinear conjugate gradient and adaptive gradient descent methods. To speed up the convergence, we propose a principal mode analysis (PMA) method to estimate good initial configurations and sphere radius. The PMA method also reveals the relationship between the optimal sphere radius and the dominant degree of spherical harmonics. Numerical experiments show that our approaches significantly reduce the number of iterations and the computational time. Copyright © 2025, The Authors. All rights reserved.

关键词： Conjugate gradient method

来源：评论

学校读者我要写书评

暂无评论

Reliable Multi-Modal Object Re-Identification via Modality-Aware Graph Reasoning

arXiv

引用

arXiv 2025年

作者： Wan, Xixi Zheng, Aihua Wang, Zi Jiang, Bo Tang, Jin Ma, Jixin Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University Hefei230601 China School of Biomedical Engineering Anhui Medical University Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China School of Computing and Mathematical Sciences University of Greenwich LondonSE10 9LS United Kingdom

Multi-modal data provides abundant and diverse object information, crucial for effective modal interactions in Re-Identification (ReID) tasks. However, existing approaches often overlook the quality variations in local features and fail to fully leverage the complementary information across modalities, particularly in the case of low-quality features. In this paper, we propose to address this issue by leveraging a novel graph reasoning model, termed the Modality-aware Graph Reasoning network (MGRNet). Specifically, we first construct modality-aware graphs to enhance the extraction of fine-grained local details by effectively capturing and modeling the relationships between patches. Subsequently, the selective graph nodes swap operation is employed to alleviate the adverse effects of low-quality local features by considering both local and global information, enhancing the representation of discriminative information. Finally, the swapped modality-aware graphs are fed into the local-aware graph reasoning module, which propagates multimodal information to yield a reliable feature representation. Another advantage of the proposed graph reasoning approach is its ability to reconstruct missing modal information by exploiting inherent structural relationships, thereby minimizing disparities between different modalities. Experimental results on four benchmarks (RGBNT201, Market1501-MM, RGBNT100, MSVR310) indicate that the proposed method achieves state-of-the-art performance in multi-modal object ReID. The code for our method will be available upon acceptance. Copyright © 2025, The Authors. All rights reserved.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：