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

PROM: A persistent routing optimization method based on supervised learning

Journal of Network and Computer Applications 2025年 242卷

作者： Yingya Guo Zebo Huang Mingjie Ding Bin Lin Huan Luo College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China

Traditional Traffic Engineering (TE) typically improves network performance by formulating and solving routing optimization problems based on measured or predicted Traffic Matrices (TMs). However, since network traffic is dynamic, routing strategies optimized for the current measured TMs may not be suitable for future traffic patterns. To adapt to dynamic traffic, one possible solution is to perform more frequent routing updates, but this may lead to service disruptions. Another approach is the two-step method of prediction followed by optimization, which could lead to degraded performance of routing strategies due to inaccuracies in traffic prediction. Additionally, existing approaches focus solely on either distributed or centralized networks, lacking flexibility to adapt to different network architectures. To address these challenges, we propose PROM, a Machine Learning (ML)-based routing optimization model that directly predicts an effective routing strategy in an end-to-end manner based on historical traffic. This routing strategy is applicable across multiple future TMs, thereby reducing the need for frequent routing updates. Furthermore, PROM can be easily extended from a centralized implementation to a distributed one, adapting to different network architectures. To enhance model performance, we have also designed a custom loss function for routing optimization scenarios to avoid overfitting. Extensive simulation results demonstrate that PROM can predict high-quality routing strategies in future unknown traffic scenarios and is adaptable to both centralized and distributed network architectures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stand-in Backdoor: A Stealthy and Powerful Backdoor Attack

Stand-in Backdoor: A Stealthy and Powerful Backdoor Attack

引用

2021 IEEE Global Communications Conference (GLOBECOM)

作者： Shuang Li Hongwei Li Hanxiao Chen School of Computer Science and Engineering University of Electronic Science and Technology of China China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

ISBN: (纸本)9781728181059

Lack of transparency in deep learning models makes them vulnerable to backdoor attack, which can cause severe security consequences. For a backdoored model, the specific inputs can trigger misclassification rules while it performs normal behaviors on clean data. Existing backdoor attacks usually generate poisoned data by adding an obvious trigger to the original data and mislabeling them, which suffers from poor invisibility and hence can be easily detected. In this paper, we propose Stand-in Backdoor, a more stealthy and powerful backdoor attack, which can completely hide the trigger while maintaining correct labels of poisoned data. Specifically, we design a novel optimization strategy to transform triggers into imperceptible perturbation in the feature space. Furthermore, utilizing the transferability of feature perturbation, we fine-tune the victim model with well-constructed poisoned data that are correctly labeled. Extensive experiments conducted on various image classification tasks demonstrate that our attack outperforms the state-of-the-art work in terms of backdoor stealth and attack performance, without sacrificing the model's utility.

关键词： Perturbation methods Transforms Resists Manuals Inspection data models Security

来源：评论

学校读者我要写书评

暂无评论

Digital Mahjong System: Towards Precise Cognitive Assessment with IoT Technologies 1

引用

24th International Conference on Human-Computer Interaction, HCII 2022

作者： An, Ning Hu, Enze Guo, Yanrui Yang, Jiaoyun Au, Rhoda Ding, Huitong School of Computer Science and Information Engineering Hefei University of Technology Hefei China Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Shenzhen Corecloud Innovation Technology Co. Ltd. Shenzhen China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China Department of Anatomy and Neurobiology Neurology and Framingham Heart Study Boston University School of Medicine Boston United States Department of Epidemiology Boston University School of Public Health Boston United States

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

To the best of our knowledge, this paper is the first to apply IoT technologies to transform the popular Mahjong game into a Digital Mahjong System (DMS) for digitally performing cognitive assessments. People have started exploring digital cognitive assessment tools for better objectivity and simplification. However, most of these tools are not friendly for older adults. This paper aims to address this issue by integrating IoT technologies with Mahjong to make cognitive assessment simpler and more engaging for older adults. DMS has the following features: 1) integrating motion tracking devices into Mahjong tiles and transferring them into Digital Mahjong Tiles (DMTs), which can precisely capture their moving trajectory during the assessment, 2) using a Near Field Communication reader to configure DMT’s primary data, 3) supporting Over-The-Air Device Firmware Update that can be done remotely via Bluetooth, and 4) developing a charging base that can charge 16 DMTs simultaneously using Qi wireless charging standard. With further testing, the DMS has the potential to become a digital platform to implement and test various cognitive assessment tools integrating Mahjong elements. © 2022, Springer Nature Switzerland AG.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Adaptive Latent Factor Analysis via Generalized Momentum-Incorporated Particle Swarm Optimization

Adaptive Latent Factor Analysis via Generalized Momentum-Inc...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Jiufang Chen Ye Yuan School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China Chongqing School University of Chinese Academy of Sciences Chongqing China College of Computer and Information Science Southwest University Chongqing China

ISBN: (纸本)9781665472449

Stochastic gradient descent (SGD) algorithm is an effective learning strategy to build a latent factor analysis (LFA) model on a high-dimensional and incomplete (HDI) matrix. A particle swarm optimization (PSO) algorithm is commonly adopted to make an SGD-based LFA model's hyper-parameters, i.e., learning rate and regularization coefficient, self-adaptation. However, a standard PSO algorithm may suffer from accuracy loss caused by premature convergence. To address this issue, this paper incorporates more historical information into each particle's evolutionary process for avoiding premature convergence following the principle of a generalized-momentum (GM) method, thereby innovatively achieving a novel GM-incorporated PSO (GM-PSO). With it, a GM-PSO-based LFA (GMPL) model is further achieved to implement efficient self-adaptation of hyper-parameters. The experimental results on three HDI matrices demonstrate that the GMPL model achieves a higher prediction accuracy for missing data estimation in industrial applications.

关键词： Adaptation models Analytical models Tensors Computational modeling Predictive models Prediction algorithms Time complexity

来源：评论

学校读者我要写书评

暂无评论

Size-invariance matters: rethinking metrics and losses for imbalanced multi-object salient object detection 24

Size-invariance matters: rethinking metrics and losses for i...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Feiran Li Qianqian Xu Shilong Bao Zhiyong Yang Runmin Cong xiaochun Cao Qingming Huang Institute of Information Engineering Chinese Academy of Sciences Beijing China and School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Science Beijing Jiaotong University Beijing China and School of Control Science and Engineering Shandong University Jinan China and Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Cyber Science and Tech. Shenzhen Campus Sun Yat-sen University School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China and Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China and Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

This paper explores the size-invariance of evaluation metrics in Salient Object Detection (SOD), especially when multiple targets of diverse sizes co-exist in the same image. We observe that current metrics are size-sensitive, where larger objects are focused, and smaller ones tend to be ignored. We argue that the evaluation should be size-invariant because bias based on size is unjustified without additional semantic information. In pursuit of this, we propose a generic approach that evaluates each salient object separately and then combines the results, effectively alleviating the imbalance. We further develop an optimization framework tailored to this goal, achieving considerable improvements in detecting objects of different sizes. Theoretically, we provide evidence supporting the validity of our new metrics and present the generalization analysis of SOD. Extensive experiments demonstrate the effectiveness of our method. The code is available at https://***/Ferry-Li/SI-SOD.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Siamese Generative Adversarial Predicting Network for Extremely Sparse data in Recommendation System

Siamese Generative Adversarial Predicting Network for Extrem...

引用

IEEE International Conference on big data and Cloud computing (BdCloud)

作者： Qingxian Wang Renjian Zhang Kangkang Ma Bo Chen Jiufang Chen xiaoyu Shi School of Computer Science and Engineering University of Electronic Science and Technology of China (UESTC) Chengdu China Intelligent Terminal Key Laboratory of SiChuan Province Yibin China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

In the recommendation system, user-item preferences are described by a High-Dimensional and Sparse (HiDS) matrix. Collaborative Filtering (CF)-based models have been widely adopted to solve unknown entries estimation. However, a CF-based model does not take the data distribution characteristic of an HiDS matrix into account, thereby its representation ability limited. To address this issue, this paper proposes to build a Siamese Generative Adversarial Predicting Network (SGAPN) to estimate the unknown entries in an HiDS matrix. Firstly, we build a model to learn the data distribution characteristic of an HiDS matrix. Secondly, based on the learned data distribution and observed entries, we build a model to estimate the unknown entries. Compared with the CF-based model, our model takes the data distribution of an HiDS matrix into account to address the unknown entries estimation. Experimental results over four HiDS matrices generated by industrial applications demonstrate that compared with several state-of-the-art models, the proposed model achieves competitive prediction accuracy.

关键词： Training Collaborative filtering Estimation Predictive models data models Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Time-aware bike flow prediction framework with dynamic edge fusion and memory integration

引用

Knowledge-Based Systems 2025年 322卷

作者： M.Rajeh, Taha Li, Tianrui Luo, Zhpeng Javed, Muhammad Hafeez Alhaek, Fares School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China Stirling College Chengdu University Chengdu610106 China Computing Science Faculty of Natural Sciences University of Stirling StirlingFK9 4LA United Kingdom

Bike-Sharing Systems (BSSs) have become a popular solution to urban sustainability concerns, providing affordable and environmentally friendly transportation. However, modeling and predicting shared-bike flow patterns are essential for developing intelligent transportation systems and facilitating city management. Despite the existence of several inflow and outflow prediction models, certain unresolved issues remain, including the inability to differentiate and capture heterogeneous dynamic relationships within daily flows, and the suboptimal utilization of historical flow data for forecasting. To address these limitations, we propose MVRC (Multi-View Relational Framework based on Clustering), a novel deep-learning framework for precise inflow and outflow prediction. The MVRC framework models three types of heterogeneous dynamic flow relationships during different periods of the day. Initially, we introduce a novel clustering method to group nearby stations exhibiting similar patterns, followed by creating a dynamic memory module to store and update edge attributes based on the time of day. Furthermore, the dynamic edge fusion mechanism effectively integrates heterogeneous, time-evolving flow features, capturing their varying impacts. To further enhance the model's capabilities, an offline component that leverages historical data is incorporated, improving performance during testing. Extensive experiments conducted on real datasets from New York City and Washington, D.C., demonstrate the superior prediction efficiency and framework effectiveness of the MVRC framework compared to existing state-of-the-art techniques. These results highlight the practicality and efficacy of MVRC in terms of prediction accuracy and stability. © 2025

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

A Recommender System Based on Model Regularization Wasserstein Generative Adversarial Network*

A Recommender System Based on Model Regularization Wasserste...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Qingxian Wang Qing Huang Kangkang Ma Xuerui Zhang School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

ISBN: (纸本)9781665442084

A recommender system (RS) commonly adopts a High-dimensional and sparse (HiDS) matrix to describe user-item preferences. Collaborative Filtering (CF)-based models have been widely adopted to address such an HiDS matrix. However, a CF-based model is unable to learn the property distribution characteristic of user’s preference from an HiDS matrix, thereby its representation ability is limited. To address this issue, this paper proposes a Model Regularization Wasserstein GAN(MRWGAN) to extract the distribution of user’s preferences. Its main ideas are two-fold: a) adopting an auto-encoder to implement the generator model of GAN; b) proposing a model-regularized Wasserstein distance as an objective function to training a GAN model. Empirical studies on four HiDS matrices from industrial applications demonstrate that compared with state-of-the-art models, the proposed model achieves higher prediction accuracy for missing data of an HiDS matrix.

关键词： Training Analytical models Predictive models Generative adversarial networks Linear programming data models Sparse matrices

来源：评论

学校读者我要写书评

暂无评论

A method for detecting floating objects on water based on edge computing

A method for detecting floating objects on water based on ed...

引用

IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB)

作者： He Li Shuaipeng Yang Jinjiang Liu Honglin Fang Zhumu Fu Rui Zhang Huimei Jia Lianmeng Lv Henan Costar Group Co. Ltd Nanyang Henan China College of Information Engineering Henan University of Science and Technology Luoyang Henan China Henan Engineering Research Center of Intelligent Processing for Big Data of Digital Image School of Computer Science and Technology Nanyang Normal University Nanyang China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunication Beijing China Xi'an Hengpin Electronic Technology Co. Ltd Xi’an China

With the development and application of computer vision, many target detection networks are applied to the detection of floating objects in rivers. For the detection problems such as small targets easily missed and misdetected in water surface floating object detection tasks and difficult to deploy models. An edge computing-oriented approach to river floater detection is proposed. First, a four-fold down-sampling feature layer is added to the YOLOv5 network which enhances more target detail features and improves the detection capability of small objects. Second, CA (Coordinate Attention) is added to the Backbone to suppress background noise interference, and different pooling is used to accommodate different hierarchical features. Then, a bilinear interpolation method is adopted for up-sampling to avoid the loss of small object features. Design a data enhancement algorithm for small targets based on Mosaic to increase the number of small objects and enrich the training background. Finally, for the edge computing architecture platform, the channel pruning algorithm is used to prune and compress the model structure to adapt to the computing capability of edge devices. The experimental results show that the method can effectively improve the detection capability of the network for floating objects on the water surface. The detection accuracy can reach 93.6%, and the detection speed can be maintained at 36 frames per second, which can achieve high-precision real-time detection of floating objects on the water surface.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep learning radiomics model related with genomics phenotypes for pathological complete response prediction in locally advanced rectal cancer under neoadjuvant chemoradiotherapy

Deep learning radiomics model related with genomics phenotyp...

引用

IEEE International Symposium on Information (IT) in Medicine and Education, ITME

作者： Ye Wang Zhen Pan Lanyan Lin Huajun Cai Feng Ding Chaojun Tan Dingyuan Zheng Yajun xie Guoxian Guan Department of Colorectal Surgery The First Affiliated Hospital of Fujian Medical University Fuzhou China Department of Geriatric Medicine Fujian Key Laboratory of Geriatrics Diseases Fujian Provincial Center for Geriatrics Fuzhou University Affiliated Provincial Hospital Shengli Clinical Medical College of Fujian Medical University Fuzhou China Fujian Huaye Information Technology Co. Ltd China School of Big Data \& Key Laboratory of Data Science and Intelligent Computing Fuzhou University of International Studies and Trade Fuzhou China Department of Colorectal Surgery The First Affiliated Hospital of Fujian Medical University National Regional Medical Center Binhai Campus of the First Affiliated Hospital Fuzhou China

ISBN: (数字)9798350356670

ISBN: (纸本)9798350356687

Background: Developing a treatment strategy after neoadjuvant chemoradiotherapy (nCRT) based on accurate pathological complete response (pCR) predictions is crucial for locally advanced rectal cancer (LARC).Objective: To determine the effectiveness of a radiomics model using diffusion-weighted imaging (DWI) and T2-weighted in predicting post-nCRT pCR efficacy after ***: This study enrolled 237 LARC patients who had radical surgery under nCRT between February 2020 and August 2023. Tumor tissues from 54 patients were RNA sequenced. Radiomics features from preoperative MRI data were used to develop a model for deep learning via the LASSO algorithm. ROC curves were used to assess the model performance. Following Spearman's correlation, analyses of transcriptomic data were conducted to identify the genes correlated with the DPL ***: The DPL model, incorporating 7 features and 5 machine-learning algorithms, was used to create risk assessment models. The RF model excelled in predicting pCR, achieving an AUC of 0.91, accuracy of 0.88, and F1 score of 0.89. Furthermore, catabolic processes and pathways related to immunity were associated with selected DPL ***: The modified MRI-based radiomics model shows good predictive efficacy in predicting pCR after nCRT in LARC patients. Additionally, we investigated the genomic phenotypes associated with DPL.

关键词： Deep learning Support vector machines Pathology Analytical models Transcriptomics Predictive models data models Random forests Radiomics Cancer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：