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

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Deng, Weihao Han, Fei Ling, Qinghua Liu, Qing Han, Henry School of Computer Science and Communication Engineering JiangSu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China School of Computer Jiangsu University of Science and Technology China School of Electronic and Information Engineering West Anhui University China School of Engineering and Computer Science Baylor University United States

ISBN: (纸本)9798350368741

Deep learning advances neural decoding in functional magnetic resonance imaging (fMRI) tasks with convolution and attention-based methods. However, these methods struggle with capturing global spatiotemporal information due to high dimensionality, noise and inter-individual difference of fMRI, which also increase computational complexity and prior bias. To this end, a novel causal state space model, Causal fMRI-Mamba, is proposed for neural decoding and task state mapping. It effectively captures global spatiotemporal information via eliminating local redundancies and capturing long-distance dependencies. Meanwhile, a causal representation framework is designed to extract invariant high-order features and disentangle related causal features, enhancing model performance. Furthermore, a dense connection module is expanded to prevent significant causal information loss in hidden states of inter layers. On the HCP brain task state classification task, Causal fMRI-Mamba achieves better performance and generalization than comparison methods. © 2025 IEEE.

关键词： causal representation learning Neuro-decoding state space model task-based fMRI

来源：评论

学校读者我要写书评

暂无评论

SymILO: a symmetry-aware learning framework for integer linear optimization 24

SymILO: a symmetry-aware learning framework for integer line...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Qian Chen Tianjian Zhang Linxin Yang Qingyu Han Akang Wang Ruoyu Sun Xiaodong Luo Tsung-Hui Chang School of Science and Engineering The Chinese University of Hong Kong Shenzhen China and Shenzhen Research Institute of Big Data China Shenzhen Research Institute of Big Data China and School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Research Institute of Big Data China School of Data Science The Chinese University of Hong Kong Shenzhen China and Shenzhen International Center For Industrial And Applied Mathematics Shenzhen Research Institute of Big Data China

ISBN: (纸本)9798331314385

Integer linear programs (ILPs) are commonly employed to model diverse practical problems such as scheduling and planning. Recently, machine learning techniques have been utilized to solve ILPs. A straightforward idea is to train a model via supervised learning, with an ILP as the input and an optimal solution as the label. An ILP is symmetric if its variables can be permuted without changing the problem structure, resulting in numerous equivalent and optimal solutions. Randomly selecting an optimal solution as the label can introduce variability in the training data, which may hinder the model from learning stable patterns. In this work, we incorporate the intrinsic symmetry of ILPs and propose a novel training framework called SymILO. Specifically, we modify the learning task by introducing solution permutation along with neural network weights as learnable parameters and then design an alternating algorithm to jointly optimize the loss function. We conduct extensive experiments on ILPs involving different symmetries and the computational results demonstrate that our symmetry-aware approach significantly outperforms three existing methods—achieving 50.3%, 66.5%, and 45.4% average improvements, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Caching and Pricing Strategy for Information-Centric Networking with Advertisers’Participation

引用

China Communications 2024年第3期21卷 283-295页

作者： Zheng Quan Yan Wenliang Wu Rong Tan Xiaobin Yang Jian Yuan Liu Xu Zhenghuan Laboratory for Future Networks Department of AutomationUniversity of Science and Technology of ChinaHefei 230026China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei 230088China Institute of Advanced Technology University of Science and Technology of ChinaHefei 230088China Suzhou Nuclear Power Research Institute Suzhou 215004China National Engineering Laboratory for Public Safety Risk Perception and Control by Big Data(NEL-PSRPC) China Academy of Electronics and Information Technology of CETCBeijing 100041China

As users’access to the network has evolved into the acquisition of mass contents instead of IP addresses,the IP network architecture based on end-to-end communication cannot meet users’***,the Information-Centric Networking(ICN)came into *** a technical point of view,ICN is a promising future network *** and customizing a reasonable pricing mechanism plays a positive role in promoting the deployment of *** current research on ICN pricing mechanism is focused on paid ***,we study an ICN pricing model for free content,which uses game theory based on Nash equilibrium to *** this work,advertisers are considered,and an advertiser model is established to describe the economic interaction between advertisers and ICN *** solution can formulate the best pricing strategy for all ICN entities and maximize the benefits of each *** extensive analysis and numerical results show that the proposed pricing framework is significantly better than existing solutions when it comes to free content.

关键词： advertisers cache free content Information-Centric Networking pricing strategy

来源：评论

学校读者我要写书评

暂无评论

Tensor and Minimum Connected Dominating Set based Confident Information Coverage Reliability Evaluation for IoT

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable Computing 2024年第3期10卷 547-561页

作者： Xiao, Ziheng Zhu, Chenlu Feng, Wei Liu, Shenghao Deng, Xianjun Lu, Hongwei Yang, Laurence T. Park, Jong Hyuk Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430074 China Artificial Intelligence and Intelligent Transportation Joint Technical Center of HUST and Hubei Chutian Intelligent Transportation Company Ltd United States Network and Industrial Control Information Security Technology Department China Nuclear Power Operation Technology Company Ltd. 1011 Xiongchu Avenue Hubei Wuhan430070 China The Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul01811 Korea Republic of

Internet of Things (IoT) reliability evaluation contributes to the sustainable computing and enhanced stability of the network. Previous algorithms usually evaluate the reliability of IoT by enumenating the states of nodes and networks, which are difficult to handle IoT with hundreds of nodes because the computational cost. In this paper, a novel algorithm, TMCRA, is proposed to evaluate the reliability of IoT in complex network environment, which consider both coverage and connectivity. For coverage, TMCRA employs the Confident Information Coverage (CIC) model to divide the target area into independent grids and calculates the coverage rate. In terms of connectivity, TMCRA forming the Virtual Backbone Network (VBN) based on two proposed methods: TMA and MGIN, and evaluate connectivity by analyzing the VBN rather than the whole network. The TMA and MGIN are two algorithms for constructing Minimum Connected Dominant Sets (MCDS), which are suitable for different scale networks. Finally, based on the data of coverage and connectivity, TMCRA utilizes tensors for the unified modeling and representation of network structure, and calculates IoT reliability based on the tensors. Simulations are carried out for various sizes of IoT to show the advantages and effectiveness of the proposed approach in reliability evaluation. © 2016 IEEE.

关键词： data reliability

来源：评论

学校读者我要写书评

暂无评论

Accelerating Parallel Sampling of Diffusion Models 41

Accelerating Parallel Sampling of Diffusion Models

引用

41st International Conference on Machine Learning, ICML 2024

作者： Tang, Zhiwei Tang, Jiasheng Luo, Hao Wang, Fan Chang, Tsung-Hui School of Science and Engineering The Chinese University of Hong Kong Shenzhen China DAMO Academy Alibaba Group China Hupan Lab Zhejiang Province China Shenzhen Research Institute of Big Data Shenzhen China

Diffusion models have emerged as state-of-the-art generative models for image generation. However, sampling from diffusion models is usually time-consuming due to the inherent autoregressive nature of their sampling process. In this work, we propose a novel approach that accelerates the sampling of diffusion models by parallelizing the autoregressive process. Specifically, we reformulate the sampling process as solving a system of triangular nonlinear equations through fixed-point iteration. With this innovative formulation, we explore several systematic techniques to further reduce the iteration steps required by the solving process. Applying these techniques, we introduce ParaTAA, a universal and training-free parallel sampling algorithm that can leverage extra computational and memory resources to increase the sampling speed. Our experiments demonstrate that ParaTAA can decrease the inference steps required by common sequential sampling algorithms such as DDIM and DDPM by a factor of 4∼14 times. Notably, when applying ParaTAA with 100 steps DDIM for Stable Diffusion, a widely-used text-to-image diffusion model, it can produce the same images as the sequential sampling in only 7 inference steps. The code is available at https://***/TZW1998/ParaTAA-Diffusion. Copyright 2024 by the author(s)

关键词： Nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Unleashing the Power of Federated Learning in Fragmented Digital Healthcare Systems: A Visionary Perspective 15

Unleashing the Power of Federated Learning in Fragmented Dig...

引用

15th International Conference on Software, Knowledge, Information Management and Applications, SKIMA 2023

作者： Tania, Marzia Hoque Clifton, David A. University of New South Wales Centre for Big Data Research in Health Sydney Australia Institute of Biomedical Engineering University of Oxford Department of Engineering Science Oxford United Kingdom Suzhou China

ISBN: (纸本)9798350316551

Digital healthcare landscape, including infrastructure, governance, interoperability, and user adoption, are continuously evolving, some taking more centralised approach, while others with higher degree of fragmentation. Attitude towards centralised healthcare systems in affluent countries are primarily influenced by historical development, infrastructure investments, and regulatory frameworks, which offers advantages with respect to standardised practises, centralised decision making, and economies of scale. In contrast, complexities due to diverse stakeholders, interoperability challenges, privacy and security concerns often pose challenges in achieving a completely centralised healthcare system even in high income countries such as the United Kingdom or in federal systems such as the United States. Moreover, decentralised healthcare systems are more prevalent in resource-poor countries. This paper presents our viewpoint and perspectives on the potential of federated learning in decentralised healthcare systems, especially in countries with infrastructure constraints and discusses its advantages, privacy and security concerns, and challenges. As data-hungry artificial intelligence-enabled systems are gradually changing the healthcare ecosystem, federated learning presents an opportunity for distributing the machine learning training process across multiple decentralised edge devices with reduced data transfer. Therefore, the decentralised digital healthcare system can leverage the collaborative model training while protecting highly sensitive and personal health information. However, challenges related to data heterogeneity, communication latency, and model aggregation need to be addressed for successful implementation of such systems. Adapting the federated learning framework to the specific needs and constraints of low and middle-income countries is crucial to unlock its potential in improving healthcare outcomes. © 2023 IEEE.

关键词： data transfer

来源：评论

学校读者我要写书评

暂无评论

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

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6315-6332页

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

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

HUSS:A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

引用

data Intelligence 2023年第3期5卷 537-559页

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S.Sheng Key Laboratory of Knowledge Engineering with Big Data(the Ministry of Education of China) Hefei University of TechnologyChinaSchool of Computer Science and Information EngineeringHefei University of TechnologyHefeiChina Research Institute of Artificial Intelligence Zhejiang LabHangzhouChina Department of Computer Science Texas Tech UniversityLubbockTX 79409USA

Spreadsheets contain a lot of valuable data and have many practical *** key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets,e.g.,identifying cell function types and discovering relationships between cell *** existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells.A few studies do,but they ignore the layout structure information of spreadsheets,which affects the performance of cell function classification and the discovery of different relationship types of cell *** this paper,we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets(HUSS).Specifically,for improving the cell function classification,we propose an error correction mechanism(ECM)based on an existing cell function classification model[11]and the layout features of *** improving the table structure analysis,we propose five types of heuristic rules to extract four different types of cell pairs,based on the cell style and spatial location *** experimental results on five real-world datasets demonstrate that HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Spreadsheet semantic structure Information extraction Heuristics Cell function analysis Table structure analysis

来源：评论

学校读者我要写书评

暂无评论

Multi-scale cyclical similarity prototype refinement for few-shot breast ultrasound image segmentation 17

Multi-scale cyclical similarity prototype refinement for few...

引用

17th IEEE International Conference on Signal Processing, ICSP 2024

作者： Ou, Yingfeng Yang, Xing Zhang, Jian Jian, Caiqing Wang, Lihui College of Computer Science and Technology Guizhou University Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data Engineering Research Center of Text Computing Ministry of Education Guiyang China

ISBN: (纸本)9798350387384

Few-shot learning based methods can address the reliance on large-scale labeled samples in current breast tumor segmentation. However, previous methods typically rely on a few support samples to extract abstract, coarse-grained semantic prototypes, without considering the interaction between support and query data. In this study, we aim to provide each query image with relevant and information-rich support information. By integrating the difficult point selection module and the multi-scale cyclical prototype refinement module, we progressively refine coarse-grained support prototypes into more informative, fine-grained class prototypes, thereby better matching the highly variable breast ultrasound query data. Experiments on two datasets demonstrate that our proposed multi-scale cyclical similarity prototype refinement network (CSPRNet) achieves remarkable improvements compared to previous state-of-the-art methods. Specifically, using ResNet50 as the backbone, we achieve 57.93%/57.92% and 57.58%/59.24% mIoU for 1-shot and 5-shot segmentation, respectively, on public and private datasets, outperforming the suboptimal method by 8.18%/2.55% and 2.77%/4.48%. © 2024 IEEE.

关键词： Ultrasonic imaging

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional data Anomaly Detection Method Based on Extended Isolation Forest 26

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Liu, Hanlin Zhou, Jiantao Li, Hua Inner Mongolia University College of Computer Science Hohhot China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：