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

arXiv 2023年

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

Graph Structure Learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure Learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Towards a Deep Learning Pain-Level Detection Deployment at UAE for Patient-Centric-Pain Management and Diagnosis Support: Framework and Performance Evaluation

arXiv

引用

arXiv 2023年

作者： Ismail, Leila Waseem, Muhammad Danish Lab School of Computing and Information Systems Faculty of Engineering and Information Technology The University of Melbourne Australia Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University United Arab Emirates National Water and Energy Center United Arab Emirates University United Arab Emirates

The outbreak of the COVID-19 pandemic revealed the criticality of timely intervention in a situation exacerbated by a shortage in medical staff and equipment. Pain-level screening is the initial step toward identifying the severity of patient conditions. Automatic recognition of state and feelings help in identifying patient symptoms to take immediate adequate action and providing a patient-centric medical plan tailored to a patient's state. In this paper, we propose a framework for pain-level detection for deployment in the United Arab Emirates and assess its performance using the most used approaches in the literature. Our results show that a deployment of a pain-level deep learning detection framework is promising in identifying the pain level *** Codes 68T07 © 2023, CC BY-NC-ND.

关键词： eHealth

来源：评论

学校读者我要写书评

暂无评论

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Learning

Depth-Aware Multi-Modal Fusion for Generalized Zero-Shot Lea...

引用

IEEE International Conference on Industrial Informatics (INDIN)

作者： Weipeng Cao Xuyang Yao Zhiwu Xu Yinghui Pan Yixuan Sun Dachuan Li Bohua Qiu Muheng Wei Guangdong Laboratory of Artificial Intelligence and Digital Economy (Shenzhen) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Stony Brook University New York United States Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China ZhenDui Industry Artificial Intelligence Co. Ltd Shenzhen China Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China

ISBN: (数字)9798331527471

ISBN: (纸本)9798331527488

Realizing Generalized Zero-Shot Learning (GZSL) based on large models is emerging as a prevailing trend. However, most existing methods merely regard large models as black boxes, solely leveraging the features output by the final layer while disregarding potential performance enhancements from other layers. Indeed, numerous researchers have visually depicted variations in the features learned across different layers of neural networks. Motivated by this observation, we propose a Vision Transformer (ViT)-based GZSL method named Depth-Aware Multi-Modal ViT (DAM2ViT), which exploits multi-level features of ViT. DAM2ViT incorporates a multi-modal interaction block to align semantic information of categories across multiple layers, thereby augmenting the model's capacity to learn associations between visual and semantic spaces. Extensive experiments conducted on three benchmark datasets (i.e., CUB, SUN, AWA2) have showcased that DAM2ViT achieves competitive results compared to state-of-the-art methods.

关键词： Visualization Adaptation models Semantics Zero shot learning Neural networks Termination of employment Transformers Market research Sun Optimization

来源：评论

学校读者我要写书评

暂无评论

Graph Confidence Intercalibration Network for Intracranial Aneurysm Lesion Instance Segmentation in Dsa

SSRN

引用

SSRN 2024年

作者： Ye, Haili Mo, Yancheng Tang, Chen Liao, Mingqian Zhang, Xiaoqing Dai, Limeng Li, Baihua Liu, Jiang Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Department of Computer Science Loughborough University LoughboroughLE11 3TU United Kingdom School of Ophthalmology and Optometry Eye Hospital Wenzhou Medical University Wenzhou325027 China Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Shenzhen People’s Hospital Neurosurgery Department Shenzhen518020 China China

Intracranial aneurysm (IA) lesion segmentation is significant for its treatment and prognosis. Although exiting deep network-based instance methods have good IA lesion segmentation results based on digital subtraction angiography (DSA) images, they still face great challenges with instance confidence bias and imprecise boundary segmentation, which may negatively affect IA diagnosis. To tackle these problems, this paper proposes a novel graph confidence intercalibration network (GCINet) to automatically segment IA lesions from DSA images. To be specific, we design a graph confidence intercalibration (GCI) module to mitigate instance confidence bias by dynamically adjusting their confidence distributions. At the same time, we propose an edge space perception (ESP) module to correct ambiguous segmentation boundaries. Extensive experiments on a clinical IA-DSA and a publicly available LiTS dataset demonstrate that our GCINet outperforms state-of-the-art methods. Additionally, visual analysis and ablation studies are provided to verify the effectiveness of each module in GCINet. © 2024, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A Constraint Dissolving Approach for Nonsmooth Optimization over the Stiefel Manifold

arXiv

引用

arXiv 2022年

作者： Hu, Xiaoyin Xiao, Nachuan Liu, Xin Toh, Kim-Chuan School of Computer and Computing Science Hangzhou City University Hangzhou310015 China The Institute of Operations Research and Analytics National University of Singapore Singapore State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences University of Chinese Academy of Sciences China Department of Mathematics Institute of Operations Research and Analytics National University of Singapore Singapore119076 Singapore

This paper focus on the minimization of a possibly nonsmooth objective function over the Stiefel manifold. The existing approaches either lack efficiency or can only tackle prox-friendly objective functions. We propose a constraint dissolving function named NCDF and show that it has the same first-order stationary points and local minimizers as the original problem in a neighborhood of the Stiefel manifold. Furthermore, we show that the Clarke subdifferential of NCDF is easy to achieve from the Clarke subdifferential of the objective function. Therefore, various existing approaches for unconstrained nonsmooth optimization can be directly applied to nonsmooth optimization problems over the Stiefel manifold. We propose a framework for developing subgradient-based methods and establish their convergence properties based on prior works. Furthermore, based on our proposed framework, we can develop efficient approaches for optimization over the Stiefel manifold. Preliminary numerical experiments further highlight that the proposed constraint dissolving approach yields efficient and direct implementations of various unconstrained approaches to nonsmooth optimization problems over the Stiefel manifold. Copyright © 2022, The Authors. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

A Survey of Recent Advances in Optimization Methods for Wireless Communications

arXiv

引用

arXiv 2024年

作者： Liu, Ya-Feng Chang, Tsung-Hui Hong, Mingyi Wu, Zheyu So, Anthony Man-Cho Jorswieck, Eduard A. Yu, Wei The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The School of Science and Engineering The Chinese University of Hong Kong Shenzhen Shenzhen China Shenzhen Research Institute of Big Data China The Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States The Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong The Institute for Communication Technology Technische Universitat Braunschweig Germany The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto TorontoONM5S 3G4 Canada

Mathematical optimization is now widely regarded as an indispensable modeling and solution tool for the design of wireless communications systems. While optimization has played a significant role in the revolutionary progress in wireless communication and networking technologies from 1G to 5G and onto the future 6G, the innovations in wireless technologies have also substantially transformed the nature of the underlying mathematical optimization problems upon which the system designs are based and have sparked significant innovations in the development of methodologies to understand, to analyze, and to solve those problems. In this paper, we provide a comprehensive survey of recent advances in mathematical optimization theory and algorithms for wireless communication system design. We begin by illustrating common features of mathematical optimization problems arising in wireless communication system design. We discuss various scenarios and use cases and their associated mathematical structures from an optimization perspective. We then provide an overview of recently developed optimization techniques in areas ranging from nonconvex optimization, global optimization, and integer programming, to distributed optimization and learning-based optimization. The key to successful solution of mathematical optimization problems is in carefully choosing or developing suitable algorithms (or neural network architectures) that can exploit the underlying problem structure. We conclude the paper by identifying several open research challenges and outlining future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

TLSTMF-YOLO: Transfer Learning and Feature Fusion Network for Earthquake-Induced Landslide Detection in Remote Sensing Images

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Meng, Shaoqiang Shi, Zhenming Pirasteh, Saied Liberata Ullo, Silvia Peng, Ming Zhou, Changshi Nunes Goncalves, Wesley Zhang, Limin Tongji University Shanghai Research Institute for Intelligent Autonomous Systems Key Laboratory of Geotechnical and Underground Engineering Ministry of Education Shanghai200092 China Institute of Artificial Intelligence Shaoxing University Zhejiang Shaoxing312000 China Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Department of Geotechnics and Geomatics Tamil Nadu Chennai600 077 India University of Sannio Department of Engineering Benevento82100 Italy Tongji University Shanghai Research Institute for Intelligent Autonomous Systems Shanghai200092 China Federal University of Mato Grosso do Sul Faculty of Computing Campo Grande79070-900 Brazil The Hong Kong University of Science and Technology Department of Civil and Environmental Engineering Hong Kong Hong Kong

Detecting earthquake-induced landslides in remote sensing images is challenging due to the varying sizes of landslides, uneven distribution, and the prevalence of small targets. This study proposes a novel approach, the TLSTMF-YOLO model, which combines a C3-Swin-Transformer and multiscale feature fusion techniques to enhance detection accuracy and efficiency. Key innovations include the use of a convolutional block attention module (CBAM) to improve feature representation, and a bidirectional feature pyramid network (BiFPN) for optimized cross-scale feature fusion. To address data scarcity, a transfer learning strategy is applied, supported by an AdamW optimizer and cosine learning rate strategy for faster convergence. Evaluations on the Jiuzhaigou and Luding landslide datasets demonstrate the model's effectiveness, achieving precision, recall, and mean average precision (mAP)@0.5 of 95.7%, 89.9%, and 90.5% on the Jiuzhaigou dataset, and 96.0%, 90.9%, and 94.5% on the Luding dataset, respectively. In addition, the model processes frames efficiently, with times of 6.61 and 12.2 ms on the two datasets. These results confirm the model's capability for accurate and efficient landslide detection, highlighting its potential for real-world applications. © 1980-2012 IEEE.

关键词： Earthquakes

来源：评论

学校读者我要写书评

暂无评论

Clustering by orthogonal NMF model and non-convex penalty optimization

Clustering by orthogonal NMF model and non-convex penalty op...

引用

作者： Wang, Shuai Chang, Tsung-Hui Cui, Ying Pang, Jong-Shi Shenzhen Research Institute of Big Data and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing and School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China Department of Industrial and Systems Engineering University of Minnesota MinneapolisMN55455 United States Department of Industrial and Systems Engineering University of Southern California Los AngelesCA90089 United States

The non-negative matrix factorization (NMF) model with an additional orthogonality constraint on one of the factor matrices, called the orthogonal NMF (ONMF), has been found a promising clustering model and can outperform the classical K-means. However, solving the ONMF model is a challenging optimization problem because the coupling of the orthogonality and non-negativity constraints introduces a mixed combinatorial aspect into the problem due to the determination of the correct status of the variables (positive or zero). Most of the existing methods directly deal with the orthogonality constraint in its original form via various optimization techniques, but are not scalable for large-scale problems. In this paper, we propose a new ONMF based clustering formulation that equivalently transforms the orthogonality constraint into a set of norm-based non-convex equality constraints. We then apply a non-convex penalty (NCP) approach to add them to the objective as penalty terms, leading to a problem that is efficiently solvable. One smooth penalty formulation and one non-smooth penalty formulation are respectively studied. We build theoretical conditions for the penalized problems to provide feasible stationary solutions to the ONMF based clustering problem, as well as proposing efficient algorithms for solving the penalized problems of the two NCP methods. Experimental results based on both synthetic and real datasets are presented to show that the proposed NCP methods are computationally time efficient, and either match or outperform the existing K-means and ONMF based methods in terms of the clustering performance. © 1991-2012 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

computing Power in the Sky: Digital Twin-assisted Collaborative computing with Multi-UAV Networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Chao Han, Yu Zhang, Long Jia, Ziye Zhang, Hongliang Hong, Choong Seon Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Jiangsu Nanjing211111 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Kyung Hee University Department of Computer Science and Engineering Gyeonggi-do Yongin-si17104 Korea Republic of University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The collaboration of computing powers (CPs) among unmanned aerial vehicles (UAVs)-mounted edge servers is essential to handle data-intensive tasks of user equipments (UEs). This paper presents a multi-UAV computing power network (CPN) that orchestrates the CP resources of edge servers to cooperatively process tasks through collaborative computing. Due to the frequent interactions among edge servers and the increased complexities for large-scale task executions, we propose a digital twin (DT)-driven multi-UAV CPN framework, where the aerial DT network is created as a digital replica of the multi-UAV network to assist collaborative computing. A joint optimization problem of the service association, offloading power control, task partitions, CP allocation, and UAV trajectory design is formulated to minimize the long-term average delay of UEs. We use the Lyapunov technique to tackle the long-term energy constraint, forming a tractable optimization problem, which is modeled as a Markov decision process to balance the UAV's deficit queue stability and the UE's task completion delay. A hybrid soft actor-critic based deep reinforcement learning algorithm is developed to optimize the joint design by sampling the hybrid action from the Gumbel and Gaussian distributions. Simulation results verify that the multi-UAV CPN contributes to significant performance gains when supported by DTs. © 2025 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

SYNAPSE: An international roadmap to large brain imaging

引用

Physics Reports 2023年第1期999卷 1-60页

作者： Stampfl, Anton P.J. Liu, Zhongdong Hu, Jun Sawada, Kei Takano, H. Kohmura, Yoshiki Ishikawa, Tetsuya Lim, Jae-Hong Je, Jung-Ho Low, Chian-Ming Teo, Alvin Tok, Eng Soon Tan, Tin Wee Ban, Kenneth Libedinsky, Camilo Tan, Francis Chee Kuan Chen, Kuan-Peng Yang, An-Cheng Chuang, Chao-Chun Chen, Nan-Yow Shih, Chi-Tin Lee, Ting-Kuo Yang, De-Nian Lai, Hsu-Chao Shuai, Hong-Han Cheng, Chang-Chieh Ching, Yu-Tai Li, Chia-Wei Charng, Ching-Che Lo, Chung-Chuan Chiang, Ann-Shyn Recur, Benoit Petibois, Cyril Cheng, Chia-Liang Chen, Hsiang-Hsin Yang, Shun-Min Hwu, Yeukuang Rojviriya, Catleya Rugmai, Supagorn Rujirawat, Saroj Margaritondo, Giorgio Australian Nuclear Science and Technology Organization Lucas Heights 2234 NSW Australia Henan university of Technology Zhengzhou China Shanghai Institute of Applied Physics Chinese Academy of Science Shanghai China RIKEN SPring-8 Center Hyogo 679-5148 Japan Pohang Accelerator Laboratory Pohang University of Science and Technology Pohang Gyeongbuk 37673 South Korea Department of Materials Science and Engineering Pohang University of Science and Technology Gyeongbuk Pohang 37673 South Korea Department of Pharmacology Department of Anaesthesia and Healthy Longevity Research Programme Yong Loo Lin School of Medicine National University of Singapore Singapore School of Chemical and Life Sciences Nanyang Polytechnic Singapore eMaGIC-Lab Department of Physics National University of Singapore Singapore National Supercomputing Center Singapore Department of Psychology The N1 Institute for Health National University of Singapore Singapore Institute of Molecular and Cell Biology A*STAR Singapore Department of Anaesthesia National University Hospital National University Health System Singapore National Center for High-Performance Computing Hsinchu Taiwan Department of Physics Tunghai University Taichung Taiwan Department of Physics National Tsing Hua University Hsinchu Taiwan Institute of Information Science Academia Sinica Taipei Taiwan Department of Computer Science National Yang Ming Chiao Tung University Hsinchu Taiwan Department of Electronics and Electrical Engineering National Yang Ming Chiao Tung University Hsinchu Taiwan Information Technology Service Center National Yang Ming Chiao Tung University Hsinchu Taiwan National Yang Ming Chiao Tung University Hsinchu Taiwan Department of Life Science National Tsing Hua University Hsinchu Taiwan Institute of Systems Neuroscience and Brain Research Center National Tsing Hua University Hsinchu Taiwan Institute of Physics Academia Sinica Taipei Taiwan Department of Physics National Dong Hwa University

Since 2020, synchrotron radiation facilities in several Asia-Pacific countries have been collaborating in a major project called “SYNAPSE” (Synchrotrons for Neuroscience: an Asia-Pacific Scientific Enterprise). They use x-ray imaging to attack in a coordinated fashion one of the major issues in modern science: the structure of animal and human brains, including neurons and connections. The objective is to develop Google-like maps also including detailed structural and functional information for selected regions of interest. The sheer mass of data needed for the objective poses huge problems for the acquisition, processing, storage and use of images. In order to complete the task within a reasonable time, the key element of the SYNAPSE strategy is the parallel and coordinated work of several facilities on the same specimens. This article reviews different aspects of the enterprise, including the foundations of synchrotron radiation, coherence and of its role in advanced imaging, electron accelerators, x-ray optics and detectors. This will provide the foundation for an extensive presentation of the different components of SYNAPSE, with an overview of results already obtained within the consortium. © 2022

关键词： Brain mapping Phase contrast Radiology Supercomputing Synchrotron X-rays

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：