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

A Real-Time Lightweight Perceptron for Cloud–Edge Collaborative Predictive Maintenance of Online Service Systems

IEEE Internet of Things Journal 2025年第9期12卷 12640-12657页

作者： Zhang, Linzi Shi, Yong Wang, Donghan Communication University of China School of Economics and Management Beijing100024 China Chinese Academy of Sciences Research Center on Fictitious Economy and Data Science Key Laboratory of Big Data Mining and Knowledge Management Beijing100190 China

In the era of expanding cloud–edge online service systems, predictive maintenance (PdM) based on key performance indicators (KPIs), such as CPU utilization, response rate, and network bandwidth, is essential for system operational reliability and security. Traditional data-driven PdM approaches for cloud–edge services often monitor individual indicators in isolation, neglecting their interrelationships. Although convolutional modules have been utilized for collaborative representation learning of localized high-dimensional KPIs, the high-computational complexity of CNNs and the limited kernel size hinder their efficacy in modeling high-dimensional, time-sensitive KPIs. To address these challenges, we propose a lightweight multichannel multilayer perceptron (MCMLP) framework for collaborative PdM. This framework enables efficient pointwise manipulation to capture inner-indicator hidden patterns within KPIs sequences without relying on grid-based convolution. Our MCMLP enhances locality through a two-stage dual-channel feature extraction process that captures spatial and temporal dependencies, integrating inner-indicator and cross-timeline features. The proposed MCMLP can also be easily plugged into existing CNN-based detectors as a substitute, offering a computationally economical alternative. Empirical results in real-world KPI data from various cloud–edge service scenarios demonstrate that MCMLP significantly outperforms traditional CNN-based methods, with a roughly 22% reduction in training time at a 95% confidence level (α = 0.05 ). This study also provides actionable insights for deploying MCMLP in cloud–edge service systems. © 2014 IEEE.

关键词： Predictive maintenance

来源：评论

学校读者我要写书评

暂无评论

Digitizing Highways:Unleashing Potential Through data Element Circulation for Safety,Cost Efficiency,and Environmental Impact Optimization

引用

Journal of Systems Science and Information 2025年第1期13卷 23-60页

作者： Yanyan JIA Wen LONG Yingjie TIAN School of Economics and Management University of Chinese Academy of SciencesBeijing 100190China Research Center on Fictitious Economy and Data Science Chinese Academy of SciencesBeijing 100190China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of SciencesBeijing 100190China

As the era of large-scale highway maintenance arrives,the maintenance strategies have transitioned to a holistic approach that prioritizes safety,economic feasibility,and environmental *** research introduces a multi-objective optimization model for highway maintenance that incorporates the interplay of decision-maker preferences across three key objectives:Highway safety performance,maintenance engineering cost,and carbon *** study employs a large-sample data analysis on a subset of the Lianhuo Highway network,which includes 2,842 pavement *** approach mitigates the impact of outliers,ensuring a substantial data buffer that fortifies the model’s capacity for generalization and bolsters its *** findings reveal a Pareto-optimal relationship among the three scrutinized variables.A particularly noteworthy observation is the M-shaped trajectory of carbon emissions,which initially rise,then decline,and ultimately rebound,contingent upon the selected maintenance ***,an examination of the relationship between maintenance costs and safety performance discloses a trend of diminishing marginal returns,illustrating that the incremental gains in safety performance attenuate as maintenance investment escalates.

关键词： data element circulation highway maintenance multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy

引用

Computers, Materials & Continua 2025年第1期82卷 997-1026页

作者： Li Ma Cai Dai Xingsi Xue Cheng Peng School of Computer Science Shaanxi Normal UniversityXi’an710119China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Information Construction and Management Center and Institute of Artificial Intelligence and Educational New Productivity Ningxia Normal UniversityGuyuan756099China

The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization *** the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search ***,two update strategies based on decomposition are used to update the evolving population and external archive,***,a multiselection strategy is *** first strategy is for the subspace without a non-dominated *** the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global *** second strategy is for the subspace with a non-dominated *** the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local *** third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated *** the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to ***,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search ***,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test *** results show that the proposed algorithm has better performance.

关键词： Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy

来源：评论

学校读者我要写书评

暂无评论

Less is More: Token Context-aware Learning for Object Tracking

arXiv

引用

arXiv 2025年

作者： Xu, Chenlong Zhong, Bineng Liang, Qihua Zheng, Yaozong Li, Guorong Song, Shuxiang Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China

Recently, several studies have shown that utilizing contextual information to perceive target states is crucial for object tracking. They typically capture context by incorporating multiple video frames. However, these naive frame-context methods fail to consider the importance of each patch within a reference frame, making them susceptible to noise and redundant tokens, which deteriorates tracking performance. To address this challenge, we propose a new token context-aware tracking pipeline named LMTrack, designed to automatically learn high-quality reference tokens for efficient visual tracking. Embracing the principle of Less is More, the core idea of LMTrack is to analyze the importance distribution of all reference tokens, where important tokens are collected, continually attended to, and updated. Specifically, a novel Token Context Memory module is designed to dynamically collect high-quality spatio-temporal information of a target in an autoregressive manner, eliminating redundant background tokens from the reference frames. Furthermore, an effective Unidirectional Token Attention mechanism is designed to establish dependencies between reference tokens and search frame, enabling robust cross-frame association and target localization. Extensive experiments demonstrate the superiority of our tracker, achieving state-of-the-art results on tracking benchmarks such as GOT-10K, TrackingNet, and LaSOT. Code and models are available at https://***/XuChenLong/LMTrack. Copyright © 2025, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Subpart Suppression Network for Few-Shot Object Counting

Subpart Suppression Network for Few-Shot Object Counting

引用

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

作者： Lanxin Liu Xinyan Liu Guorong Li School of Computer Science and Technology Key Lab of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences School of Computer Science and Technology Harbin Institute of Technology (Weihai)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Few-shot object counting and detection aim to count objects along with their bounding boxes specified by exemplar bounding boxes. Current mainstream methods predict density maps by applying similarity between exemplar and image features to get counting results and detecting peak points from the density map as the positions of objects. However, the sub-parts of objects can also have high similarity to the exemplars, harming the counting and detection performance. To address these issues, we propose a two-stage Subpart Suppression Network (SSN), consisting of a Subpart Suppression Density map Predictor (SSDP), which enforces the model focus on whole objects rather than subparts, and a SAM-based Detector and Verifier, which refines the final prediction by a clustering method. Extensive experiments on two popular datasets show an advantage in performance over the state-of-the-art methods and prove the components’ effectiveness.

关键词： Accuracy Filtering Convolution Clustering methods Detectors Predictive models Feature extraction Acoustics Speech processing Kernel

来源：评论

学校读者我要写书评

暂无评论

Phasmatodea Population Evolution Algorithm Based on Spiral Mechanism and Its Application to data Clustering

引用

Computers, Materials & Continua 2025年第4期83卷 475-496页

作者： Jeng-Shyang Pan Mengfei Zhang Shu-Chuan Chu Xingsi Xue Václav Snášel College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266590China School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210044China Department of Information Management Chaoyang University of TechnologyTaichung41349TaiwanChina Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Faculty of Electrical Engineering and Computer Science VŠB-Technical University of OstravaOstrava70833Czech Republic

data clustering is an essential technique for analyzing complex datasets and continues to be a central research topic in data *** clustering algorithms,such as K-means,are widely used due to their simplicity and *** paper proposes a novel Spiral Mechanism-Optimized Phasmatodea Population Evolution Algorithm(SPPE)to improve clustering *** SPPE algorithm introduces several enhancements to the standard Phasmatodea Population Evolution(PPE)***,a Variable Neighborhood Search(VNS)factor is incorporated to strengthen the local search capability and foster population ***,a position update model,incorporating a spiral mechanism,is designed to improve the algorithm’s global exploration and convergence ***,a dynamic balancing factor,guided by fitness values,adjusts the search process to balance exploration and exploitation *** performance of SPPE is first validated on CEC2013 benchmark functions,where it demonstrates excellent convergence speed and superior optimization results compared to several state-of-the-art metaheuristic *** further verify its practical applicability,SPPE is combined with the K-means algorithm for data clustering and tested on seven *** results show that SPPE-K-means improves clustering accuracy,reduces dependency on initialization,and outperforms other clustering *** study highlights SPPE’s robustness and efficiency in solving both optimization and clustering challenges,making it a promising tool for complex data analysis tasks.

关键词： Phasmatodea population evolution algorithm data clustering meta-heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Subpart Suppression Network for Few-Shot Object Counting

Subpart Suppression Network for Few-Shot Object Counting

引用

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

作者： Liu, Lanxin Liu, Xinyan Li, Guorong School of Computer Science and Technology Key Lab of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences China School of Computer Science and Technology Harbin Institute of Technology Weihai China

ISBN: (纸本)9798350368741

关键词： Counting Detection Few-Shot Localization

来源：评论

学校读者我要写书评

暂无评论

Gupacker: Generalized Unpacking Framework for Android Malware

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 4338-4352页

作者： Zheng, Tao Hou, Qiyu Chen, Xingshu Ren, Hao Li, Meng Li, Hongwei Shen, Changxiang Sichuan University School of Cyber Science and Engineering Chengdu610065 China Cyber Science Research Institute Sichuan University China Ministry of Education Key Laboratory of Data Protection and Intelligent Management Sichuan University Chengdu610065 China Ministry of Education Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China Hefei University of Technology School of Computer Science and Information Engineering China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China University of Padua Department of Mathematics HIT Center Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China

Android malware authors often use packers to evade analysis. Although many unpacking tools have been proposed, they face two significant challenges: 1) They are easily impeded by anti-analysis techniques employed by packers, preventing efficient collection of hidden Dex data. 2) They are typically designed to unpack a specific packer and cannot handle malware packed with mixed packers. Consequently, many packed malware samples evade detection. To bridge this gap, we propose Gupacker, a novel generalized unpacking framework. Gupacker offers a generic solution for first-generation holistic packer by customizing the Android system source code. It identifies the type of packer and selects an appropriate unpacking function, constructs a deeper active call chain to achieve generic unpacking of second-generation function extraction packers, and uses JNI function and instruction monitoring to handle third-generation virtual obfuscation packer. On this basis, we counteract a diverse array of anti-analysis techniques. We conduct extensive experiments on 5K packed Android malware samples, comparing Gupacker with 2 commercial and 4 state-of-the-art academic unpacking tools. The results demonstrate that Gupacker significantly improves the efficiency of Android malware unpacking with acceptable system overhead. We analyze real packed applications based on Gupacker and found several are second-packed by attackers, including WPS for Android, with tens of millions of users. We receive and responsibly report 13 0day vulnerabilities and also assist in the remediation of all vulnerabilities. © 2005-2012 IEEE.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Predicting microRNA-Disease Associations Through Multi-View Feature Fusion and Matrix Completion on Graph Convolutional Networks

IEEE Transactions on Computational Biology and Bioinformatic...

引用

IEEE Transactions on Computational Biology and Bioinformatics 2025年第1期22卷 151-159页

作者： Shifei Ding Chuangui Cao Fan Sun Xuan Li Xindong Wu School of Computer Science and Technology China University of Mining and Technology Xuzhou China Mine Digitization Engineering Research Center of Ministry of Education Xuzhou China Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China

Since the regulatory roles of microRNAs in complex human diseases have been gradually demonstrated, more and more enlightening models were developed for predicting microRNA-disease associations. These models can inform bio-logical studies on the differential expression of microRNAs. In this paper, a graph convolutional network-based model using multi-view feature fusion and matrix completion, FMCGCN for brevity, is proposed. First of all, graph autoencoders are used to learn multiple embeddings from different networks. For convenience, attention mechanisms are used to fuse them. As a result, multi-view features constructed from different perspectives are aggregated. Then, the fused embedding is fed into the graph convolutional network to aggregate local information. This fused embedding is thought to facilitate feature extraction for graph convolutional networks. Finally, feature and nuclear norm minimization, a method for matrix completion, is used to obtain the prediction matrix. Additionally, evaluation results under 5-fold cross-validation prove that FMCGCN outperforms current models in several metrics. Furthermore, case studies for esophageal neoplasms and pancreatic neoplasms also demonstrate the validity of our model.

关键词： Diseases Semantics Predictive models Kernel Topology Graph convolutional networks Feature extraction Learning systems Biological system modeling Reliability

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/Patternmining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：