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

The Temporal Structural Pattern in Scientific Collaborative Behavior from the Perspective of Complex Network 23rd

学校读者我要写书评

暂无评论

The Temporal Structural Pattern in Scientific Collaborative...

23rd International Symposium on Knowledge and Systems Sciences, KSS 2024

作者： Zholdoshbaeva, Elina Zhang, Shuang Liu, Feifan Xia, Haoxiang Institute of Systems Engineering Dalian University of Technology No. 2 Linggong Road Liaoning Dalian116024 China Center for Big Data and Intelligent Decision-Making Dalian University of Technology Linggong Road Liaoning Dalian116024 China School of Business East China University of Science and Technology 130 Meilong Road Xuhui District Shanghai200237 China Institute for Advanced Intelligence Dalian University of Technology Linggong Road Liaoning Dalian116024 China Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education of China Linggong Road Liaoning Dalian116024 China

ISBN: (纸本)9789819601776

The rapid advancement of science has underscored the importance of collaboration among scientists. While many studies have explored the structure of collaboration networks, there is a lack of comprehensive quantitative research on the temporal patterns of these collaborations. This study addresses this gap by analyzing temporal scientific collaboration networks in physics, spanning from 1960 to 2021, using complex network theories and methods. By constructing five-year temporal collaborative networks and employing metrics such as network diameter, shortest path, and clustering coefficient, this research reveals an increase in connectivity and small-world characteristics over time. Additionally, community detection highlights a shift towards specialized collaboration patterns and increased cross-community interactions. The study also uncovers growing centrality and social stratification within the research system, with the "rich club" phenomenon indicating strong and dynamic collaborations among highly connected scientists. Temporal analysis shows that while ultra-high connectivity scientists engage in fluctuating relationships, medium-high connectivity scientists maintain more stable collaborations. These findings provide insights into the evolution of collaborative behaviors and inform science policy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Collaborative learning

Tensor completion via Tucker decomposition with Correlated Total Variation regularization on factor matrices

学校读者我要写书评

暂无评论

Signal Processing 2026年 238卷

作者： Min Wang Zhuying Chen Qiang Wu Liang Zhong School of Computing and Artificial Intelligence Jiangxi Provincial Key Laboratory of Multimedia Intelligent Processing Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China School of Electrical and Data Engineering Global Big Data Technologies Centre University of Technology Sydney Ultimo 2007 NSW Australia

Multidimensional data, such as color images and videos, often exhibit inherent low-rank and local smoothness properties, with temporal and spatial correlations playing a crucial role in data recovery. While most existing methods focus on modeling these properties independently, they often overlook their coupled correlation in the factor space derived during tensor decomposition. In this study, we propose a novel Matrix Correlated Total Variation (MCTV) regularizer to explicitly model the coupled correlation between low-rankness and smoothness within Tucker decomposition. Unlike traditional methods, MCTV propagates the low-rankness of factor matrices to the Tucker rank, eliminating the need to predefine the core tensor size. It also preserves temporal and spatial smoothness correlations across all tensor modes through operations on smooth factor matrices. By integrating MCTV into a Tucker-based tensor completion model, we remove the dependence on hyperparameters like the Tucker rank and tradeoff parameters, creating a unified framework for capturing these coupled correlations. To optimize the proposed model, we design an efficient Alternating Direction Method of Multipliers (ADMM) algorithm. Experimental results on benchmark datasets demonstrate the superiority of our method in recovering multidimensional data by effectively modeling the synergy between low-rankness and smoothness.

关键词： Tucker decomposition Total variation Low-rankness Smoothness Tensor completion

Dual-View Pyramid Pooling in Deep Neural Networks for Improved Medical Image Classification and Confidence Calibration

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Xiaoqing Nie, Qiushi Xiao, Zunjie Zhao, Jilu Wu, Xiao Guo, Pengxin Li, Runzhi Liu, Jin Wei, Yanjie Pan, Yi Center for High Performance Computing Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Shenzhen518055 China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Department of Statistics and Actuarial Science The University of Hong Kong 999077 Hong Kong Cooperative Innovation Center of Internet Healthcare Zhengzhou University Zhengzhou450001 China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha410083 China Xinjiang Engineering Research Center of Big Data and Intelligent Software School of software Xinjiang University Wulumuqi830046 China Faculty of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen China

Spatial pooling (SP) and cross-channel pooling (CCP) operators have been applied to aggregate spatial features and pixel-wise features from feature maps in deep neural networks (DNNs), respectively. Their main goal is to reduce computation and memory overhead without visibly weakening the performance of DNNs. However, SP often faces the problem of losing the subtle feature representations, while CCP has a high possibility of ignoring salient feature representations, which may lead to both miscalibration of confidence issues and suboptimal medical classification results. To address these problems, we propose a novel dual-view framework, the first to systematically investigate the relative roles of SP and CCP by analyzing the difference between spatial features and pixel-wise features. Based on this framework, we propose a new pooling method, termed dual-view pyramid pooling (DVPP), to aggregate multi-scale dual-view features. DVPP aims to boost both medical image classification and confidence calibration performance by fully leveraging the merits of SP and CCP operators from a dual-axis perspective. Additionally, we discuss how to fulfill DVPP with five parameter-free implementations. Extensive experiments on six 2D/3D medical image classification tasks show that our DVPP surpasses state-of-the-art pooling methods in terms of medical image classification results and confidence calibration across different DNNs. © 2024, CC BY.

关键词： Deep neural networks

Sample hardness based gradient loss for long-tailed cervical cell detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Liu, Minmin Li, Xuechen Gao, Xiangbo Chen, Junliang Shen, Linlin Wu, Huisi Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China University of California Irvine United States

Due to the difficulty of cancer samples collection and annotation, cervical cancer datasets usually exhibit a long-tailed data distribution. When training a detector to detect the cancer cells in a WSI (Whole Slice Image) image captured from the TCT (Thinprep Cytology Test) specimen, head categories (e.g. normal cells and inflammatory cells) typically have a much larger number of samples than tail categories (e.g. cancer cells). Most existing state-of-the-art long-tailed learning methods in object detection focus on category distribution statistics to solve the problem in the long-tailed scenario, without considering the "hardness" of each sample. To address this problem, in this work we propose a Grad-Libra Loss that leverages the gradients to dynamically calibrate the degree of hardness of each sample for different categories, and re-balance the gradients of positive and negative samples. Our loss can thus help the detector to put more emphasis on those hard samples in both head and tail categories. Extensive experiments on a long-tailed TCT WSI image dataset show that the mainstream detectors, e.g. RepPoints, FCOS, ATSS, YOLOF, etc. trained using our proposed Gradient-Libra Loss, achieved much higher (7.8%) mAP than that trained using cross-entropy classification loss. Copyright © 2022, The Authors. All rights reserved.

关键词： Cytology

Artificial intelligence-assisted niacin skin flush screening in early psychosis identification and prediction

学校读者我要写书评

暂无评论

General Psychiatry 2022年第2期35卷 76-78页

作者： Tao Chen Haichun Liu Renfang Tian Ranpiao Gan Wenzuo Xu Tianhong Zhang Jijun Wang Department of Economics University of WaterlooWaterlooOntarioCanada Depatment of Statistics and Actuarial Science(Cross Appointed) University of Waterloo WaterlooOntarioCanada Big Data Research Lab Universty of WaterlooWaterlooOntarioCanada Shanghai Niacin Tech Co. LtdShanghal China Labor and Worklife Program Harvard UniversityCambridgeMassachusettsUSA Department of Automation Shanghai Jao Tong UniversityShanghaiChina Ningbo Artificial Intelligent Institute Shanghai Jiao Tong UniversityNingboChina School of Management Economicsand MathematicsKing's University CollegeLondon0ntarioCanada Shanghai Intelligent Psychological Evaluaton and Intervention Engineering Technology Research Center Shanghai Key Laboratory of Psychotic DisordersShanghai Mental Health CenterShanghai Jiao Tong University School of MedicineShanghaiChina Bio-X Institutes Key Laboratory for the Genetics of Developmental and Neuropsychiatric Disorders(Ministry of Education)ShanghaiChina CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of SciencesShanghaiChina Institute of Psychology and Behavioral Science Shanghai Jiao Tong UniversiyShanghaiChina

Schizophrenia is a devastating mental disorder affecting 20 million people *** diagnosis is crucial for disease management and improvement in prognosis,and diagnostic biomarkerscan serveasobjective indicators for the early screening of the *** on the observation of diminished flush responses to niacin in patients with schizophrenia Horrobin proposed anoninvasive niacin skin flush screening for schizophrenia.

关键词： diagnosis prognosis prediction

Towards Lightweight and Efficient Distributed Intrusion Detection Framework

学校读者我要写书评

暂无评论

Towards Lightweight and Efficient Distributed Intrusion Dete...

2021 IEEE Global Communications Conference (GLOBECOM)

作者： Shuai Yuan Hongwei Li Rui Zhang Meng Hao Yiran Li Rongxing Lu School of Computer Science and Engineering University of Electronic Science and Technology of China China Chinese Academy of Sciences Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chongqing China Faculty of Computer Science University of New Brunswick Canada

ISBN: (纸本)9781728181059

Federated learning (FL), as a promising distributed learning paradigm, has put many efforts into distributed intrusion detection systems (IDS), for defending against various malicious attacks, such as SQL injection and DDoS attacks. Compared with traditional IDS based on centralized deep learning (DL), FL-based solutions require not to share users' raw data while yielding better detection performance. However, state-of-the-art FL-based methods still suffer from two key limitations: 1) insufficient detection performance on non-independent and identically distributed (non-IID) data, and 2) high communication and computational overheads due to the utilization of large-scale neural network models. In this paper, we propose a lightweight collaborative intrusion detection framework, called CoLGBM, the first of its kind in the regime of decentralized IDS, where decision tree and light gradient boosting machine (LGBM) are combined for constructing the detection scheme. The main insight is that through combining user-trained decision trees (each user's decision tree is derived from its own data with unique distribution), our framework can perform effectively on non-IID data while working efficiently for handling enormous samples. Compared with the current FL-based methods, our CoLGBM achieves higher accuracy and lower overhead on both IID and non-IID data. Extensive experiment results demonstrate our scheme with high-level performance.

关键词： Deep learning Distance learning Neural networks Intrusion detection Distributed databases SQL injection Boosting

Improving Incremental Learning: A Closer Look at the Softmax Function

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Zhai, Zheng Zhang, Jiali Wang, Haiyu Wu, Mingxin Yang, Keshun Qiao, Xiaoyan Sun, Qiang Beijing Normal University No.18 Jinfeng Road Guangdong Zhuhai519087 China Shandong Technology and Business University Shandong Yantai China Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Shandong China Immersion Technology and Evaluation Shandong Engineering Research Center Shandong China School of Mathematics Sichuan University Chengdu China College of Liberal Arts and Sciences University of Illinois Urbana-Champaign IL United States Department of Statistical Sciences University of Toronto ON Canada Department of Computer Science University of Toronto ON Canada Department of Statistics and Data Science MBZUAI Abu Dhabi United Arab Emirates

This paper investigates the limitations of the widely adopted softmax cross-entropy loss in incremental learning problems. Specifically, we highlight how the shift-invariant property of this loss function can lead to multiple optimal solutions and imbalanced weights across different tasks, which exacerbates catastrophic forgetting. To address these issues, we propose two key modifications to the objective function: (1) regularizing or replacing the original joint distillation loss with a summation of task-specific distillation losses, and/or (2) utilizing a shift-sensitive prediction loss function, such as the binary cross-entropy loss. Numerical experiments validate the effectiveness of these proposals, demonstrating improved prediction accuracy and a significant reduction in forgetting. © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

Robust Optimization for Quantum Reinforcement Learning Control using Partial Observations

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jiang, Chen Pan, Yu Wu, Zheng-Guang Gao, Qing Dong, Daoyi State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control College of Control Science and Engineering Zhejiang University Hangzhou310027 China The School of Automation Science and Electrical Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China The School of Engineering and Information Technology University of New South Wales CanberraACT2600 Australia

The current quantum reinforcement learning control models often assume that the quantum states are known a priori for control optimization. However, full observation of quantum state is experimentally infeasible due to the exponential scaling of the number of required quantum measurements on the number of qubits. In this paper, we investigate a robust reinforcement learning method using partial observations to overcome this difficulty. This control scheme is compatible with near-term quantum devices, where the noise is prevalent and predetermining the dynamics of quantum state is practically impossible. We show that this simplified control scheme can achieve similar or even better performance when compared to the conventional methods relying on full observation. We demonstrate the effectiveness of this scheme on examples of quantum state control and quantum approximate optimization algorithm. It has been shown that high-fidelity state control can be achieved even if the noise amplitude is at the same level as the control amplitude. Besides, an acceptable level of optimization accuracy can be achieved for QAOA with noisy control Hamiltonian. This robust control optimization model can be trained to compensate the uncertainties in practical quantum computing. © 2022, CC BY.

关键词： Robust control

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan College of Computer and Data Science Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Ministry of Education Fujian Key Laboratory of Network Fuzhou350002 China Computing and Intelligent Information Processing [Fuzhou University Fuzhou350116 China Department of Computer Science Faculty of Environment Science and Economy University of Exeter ExeterEX4 4QF United Kingdom School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Department of Informatics University of Oslo Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization