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

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

来源：评论

学校读者我要写书评

暂无评论

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 Sichuan University School of Cyber Science and Engineering Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province School of Computer Science and Information Engineering Hefei230002 China University of Padua Department of Mathematics HIT Center Padua35131 Italy University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China Sichuan University Cyber Science Research Institute Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Information content and sentiment: the role of environmental disclosure in stock price crash risk

引用

International Review of Financial Analysis 2025年 104卷

作者： Long, Wen Ma, Ruiqi Guo, Man School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China Sino-Danish College University of Chinese Academy of Sciences Beijing 100190 China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining & Knowledge Management Chinese Academy of Sciences Beijing 100190 China

Environmental disclosure is a topic of global importance. When negative environmental news emerges and is eventually revealed, it can influence investor decisions and lead to significant stock price movements, potentially resulting in stock price crashes. Therefore, using a sample of A-share listed companies on the Shanghai and Shenzhen Stock Exchanges from 2017 to 2022, we construct an environmental sentiment dictionary, establish an environmental disclosure content index system, and explore the influence mechanism of environmental disclosure on stock price crash risk. Findings show that increased environmental disclosure sentiment intensity can boost stock price crash risk, whereas greater environmental disclosure content can significantly reduce it. Furthermore, we identify a significant threshold effect related to the sentiment intensity of environmental disclosure. Notably, in environmental disclosure, sentiment tends to have a stronger impact than content. Mechanism analysis reveals that environmental disclosure content is influenced by external disclosure sources, the tone of internal annual reports, and internal control mechanisms. Meanwhile, environmental disclosure sentiment intensity is driven by earnings management and investor risk perception. This study develops a more comprehensive method for measuring environmental information disclosure and offers important insights for improving environmental management among listed companies. © 2025

关键词： Environmental information disclosure Sentiment analysis Stock price crash risk

来源：评论

学校读者我要写书评

暂无评论

Sample selection for noisy partial label learning with interactive contrastive learning

引用

Pattern Recognition 2025年 166卷

作者： Yu, Xiaotong Sun, Shiding Tian, Yingjie School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China China Aerospace Science & Industry Corp Defense Technology R&T Center Beijing100854 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at UCAS Beijing100190 China China Unicom Research Institute Beijing100176 China

In the context of weakly supervised learning, partial label learning (PLL) addresses situations where each training instance is associated with a set of partial labels, with only one being accurate. However, in complex realworld tasks, the restrictive assumption may be invalid which means the ground-truth may be outside the candidate label set. In this work, we loose the constraints and address the noisy label problem for PLL. First, we introduce a selection strategy, which enables deep models to select clean samples via the loss values of flipped and original images. Besides, we progressively identify the true labels of the selected samples and ensemble two models to acquire the knowledge of unselected samples. To extract better feature representations, we introduce pseudo-labeled interactive contrastive learning to aggregate cross-network information of all samples. Experimental results verify that our approach surpasses baseline methods on noisy PLL task with different levels of label noise. © 2025 Elsevier Ltd

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Detecting Difference Between Coefficients in Linear Model Using Jackknife Empirical Likelihood

引用

Journal of Systems Science & Complexity 2016年第2期29卷 542-556页

作者： WU Xinqi ZHANG Qingzhao ZHANG Sanguo School of Mathematical Sciences University of Chinese Academy of Sciences Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences

Empirical likelihood has been found very useful in many different occasions. It usually runs into serious computational difficulties while jackknife empirical likelihood （JEL） is shown to be effective when applied to some complicated statistics. In this paper, to test the difference between coefficients of two linear regression models, the authors apply JEL to construct the confidence regions. Based on the 3EL ratio test, a version of Wilks＇ theorem is developed. Furthermore, to improve the coverage accuracy of confidence regions, a Bartlett correction is applied. Simulation studies are carried out to show the effectiveness of the proposed method in aspects of coverage accuracy. A real data set is analyzed with the proposed method as an example.

关键词： Bartlett correction coverage accuracy Jackknife empirical likelihood linear regression model.

来源：评论

学校读者我要写书评

暂无评论

Exploring big data Analysis: Fundamental Scientific Problems

引用

Annals of data Science 2015年第4期2卷 363-372页

作者： Xu, Zongben Shi, Yong Department of Mathematics Xi’an Jiaotong University Xi’an China The Key Research Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

Although big data has been one of most popular topics since last several years, how to effectively conduct big data analysis is a big challenge for every field. This paper tries to address some fundamental scientific problems in big data analysis, such as opportunities, challenges, and difficulties encountered in the analysis. The challenges rise from multiple domains that include how management Science influences data acquisition and data management, Information Science for data access and processing, Mathematics and Statistics for data understanding and Engineering for data applications. The paper outlines six open research problems on big data. It also reports some advances on current big data research, particularly in high-dimensional data and non-structured data processing. Finally, remarks on how to develop a big data algorithm are provided. © 2016, Springer-Verlag Berlin Heidelberg.

关键词： big data

来源：评论

学校读者我要写书评

暂无评论

A Triple Structure of Rough Sets Based on Selection Function

引用

Annals of data Science 2015年第3期2卷 245-259页

作者： Wang, Bo Shi, Yong Tian, Yingjie Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

Different from rough sets in Pawlak’s sense, which is a binary approximation operations based structure, in this paper, we propose a new rough equivalence relation based on triple approximation operations induced by selection function. The same as traditional rough sets research, we consider the algebra issue of new rough sets system and construct lattice structure in an algebraic fashion. An isomorphic relationship is studied between proposed rough sets algebra structure and that in Pawlak’s sense. In addition, some examples are shown and studied in order to indicate the effectiveness of new equivalence relation in distinguishing and describing subsets of universe. Besides, we also study restriction of selection congruence on subalgebra built by covering of universe. Finally, conclusion on the axioms of middle approximation operation are shown to clarify properties of new structure. © 2015, Springer-Verlag Berlin Heidelberg.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：