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

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yawen Liu Yiwen Chen Shanling Nie Hai Yang Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai China Center for Continuing and Lifelong Education National University of Singapore Faculty of Engineering The University of Sydney Australia

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

With the ongoing advancements in science and technology and the increasing research focus on cancer-related issues, there has been a proliferation of omics-related resources for in-depth analysis and exploration. This burgeoning volume and complexity of biological data have fostered the integration of machine-learning techniques into biology. As a result, numerous machine-learning strategies have been established to identify driver mutations. Yet, many of these strategies produce complex models, complicating comprehension and thereby clouding the impact of input features on the resulting predictions. Our analysis presented the CIXG framework, which integrates a driver gene prediction module using XGBoost with a causality interpretation module anchored on CXPlain. This architecture enables quantifying each input feature’s contribution to the prediction outcome and ensures precise predictions of driver genes. When benchmarked against the state-of-the-art (SOTA) method, CIXG demonstrated superior accuracy in pinpointing driver genes across pan-cancer studies and within the 32 specific cancer types. Importantly, our results underscored that mutation features chiefly influence CIXG’s predictive prowess, with additional support from other omics features.

关键词： Accuracy Biological system modeling Cause effect analysis Machine learning Predictive models Benchmark testing Complexity theory Bioinformatics Cancer

来源：评论

学校读者我要写书评

暂无评论

GIRP: Energy-Efficient QoS-Oriented Microservice Resource Provisioning via Multi-Objective Multi-Task Reinforcement Learning

引用

IEEE Transactions on Mobile Computing 2025年

作者： Yuan, Honggang Wang, Ting Fu, Min Shi, Yuanming East China Normal University MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Microservice architecture has revolutionized web service development by facilitating loosely coupled and independently developable components distributed as containers or virtual machines. While existing studies emphasize end-to-end latency, this paper investigates energy-efficient quality-of-service (QoS)-oriented microservice provisioning, focusing on both QoS satisfaction and power consumption (PC) conservation. We propose the Green and Intelligent Resource Provision (GIRP) architecture, integrating a data-driven energy-latency-aware resource allocation and scheduling manager to balance latency and PC. To reconcile the trade-offs involved, a dual-objective optimization problem is formulated to minimize latency and energy use by selecting proper servers, allocating CPU cores, and determining service replicas. To address challenges with discrete variables, dual objectives, and implicit mappings, we leverage a model-free deep deterministic policy gradient-based reinforcement learning algorithm. Specifically, we develop a multi-task agent via the Multi-gate Mixture-of-Experts model to simultaneously make two separate actions regarding CPU core numbers and service replica numbers, followed by a single-task agent to determine service scheduling. Extensive experiments on the DeathStarBenchmark testbed validate GIRP's effectiveness, demonstrating approximately 52% resource savings and a 43% reduction in PC compared to leading methods like Sinan, Firm, and heuristic-based algorithms. These results highlight GIRP's capability to optimize microservice orchestration by balancing end-to-end latency and power efficiency. © 2025 IEEE. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

PE: A Poincare Explanation Method for Fast Text Hierarchy Generation

arXiv

引用

arXiv 2024年

作者： Chen, Qian Li, Dongyang He, Xiaofeng Li, Hongzhao Yi, Hongyu School of Computer Science and Technology East China Normal University Shanghai China NPPA Key Laboratory of Publishing Integration Development ECNUP Shanghai China Sichuan Caizi Software Information Network Co. Ltd China

The black-box nature of deep learning models in NLP hinders their widespread application. The research focus has shifted to Hierarchical Attribution (HA) for its ability to model feature interactions. Recent works model non-contiguous combinations with a time-costly greedy search in Eculidean spaces, neglecting underlying linguistic information in feature representations. In this work, we introduce a novel method, namely Poincare Explanation (PE), for modeling feature interactions with hyperbolic spaces in a time efficient manner. Specifically, we take building text hierarchies as finding spanning trees in hyperbolic spaces. First we project the embeddings into hyperbolic spaces to elicit inherit semantic and syntax hierarchical structures. Then we propose a simple yet effective strategy to calculate Shapley score. Finally we build the the hierarchy with proving the constructing process in the projected space could be viewed as building a minimum spanning tree and introduce a time efficient building algorithm. Experimental results demonstrate the effectiveness of our approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A-VMD: Adaptive Variational Mode Decomposition Scheme for Noise Reduction in Sensor-Cloud 2nd

A-VMD: Adaptive Variational Mode Decomposition Scheme for No...

引用

2nd International Conference on Ubiquitous Security, UbiSec 2022

作者： Huo, Zhenru Jia, Guoqing Fang, Weidong Chen, Wei Zhang, Wuxiong School of Physics and Electronic Information Engineering Qinghai Minzu University Xining810007 China Science and Technology On Micro-System Laboratory Shanghai Institute of Micro-System and Information Technology Chinese Academy of Sciences Shanghai201899 China University of Chinese Academy of Sciences Beijing100049 China Shanghai Research and Development Center for Micro-Nano Electronics Shanghai201210 China School of Mechanical Electronic and Information Engineering China University of Mining and Technology-Beijing Beijing100083 China School of Computer Science and Technology China University of Mining and Technology Xuzhou221116 China

ISBN: (纸本)9789819902712

Digital signal processing is critical during the use of sensor-clouds, and the data information acquired by sensors is inevitably noisy. The Variational Mode Decomposition (VMD) algorithm can be used to reduce noise on the signal. The selection of the modal decomposition number of the VMD algorithm and the selection of the modal components of the reconstructed signal affect the effect of signal noise reduction. In this paper, an adaptive variational mode decomposition scheme is proposed. It adaptively selects the modal decomposition number through the established modal decomposition number and the input signal sample entropy model, selects the optimal modal component according to the sample entropy threshold, and reconstructs the signal after the selected modal component is processed by data smoothing. The results show that compared with traditional variational mode decomposition, empirical mode decomposition algorithms, and other algorithms, the effect of adaptive variational mode decomposition in filtering out signal noise is analyzed. The proposed adaptive VMD (A-VMD) algorithm can effectively filter out the noise of the signal obtained by the sensor. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Variational mode decomposition

来源：评论

学校读者我要写书评

暂无评论

User-level failure detection and auto-recovery of parallel programs in HPC systems

引用

Frontiers of computer Science 2021年第6期15卷 31-42页

作者： Guozhen ZHANG Yi LIU Hailong YANG Jun XU Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China Sino-German Joint Software Institute Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China Science and Technology on Space System Simulation Laboratory Beijing Simulation Center Beijing 100854China

As the mean-time-between-failures(MTBF)continues to decline with the increasing number of components on large-scale high performance computing(HPC)systems,program failures might occur during the execution period with high *** successful execution of the HPC programs has become an issue that the unprivileged users should be *** the user perspective,if the program failure cannot be detected and handled in time,it would waste resources and delay the progress of program ***,the unprivileged users are unable to perform program state checking due to execution control by the job management system as well as the limited ***,automated tools for supporting user-level failure detection and autorecovery of parallel programs in HPC systems are *** paper proposes an innovative method for the unprivileged user to achieve failure detection of job execution and automatic resubmission of failed *** state checker in our method is encapsulated as an independent job to reduce interference with the user *** addition,we propose a dual-checker mechanism to improve the robustness of our *** implement the proposed method as a tool named automatic re-launcher(ARL)and evaluate it on the Tianhe-2 *** results show that ARL can detect the execution failures effectively on Tianhe-2 *** addition,the communication and performance overhead caused by ARL is *** good scalability of ARL makes it applicable for large-scale HPC systems.

关键词： high performance computing parallel program failure detection failure auto-recovery

来源：评论

学校读者我要写书评

暂无评论

AGDB: A Dictionary-based Malicious Domain Detection Method based on Representation Fusion 7

AGDB: A Dictionary-based Malicious Domain Detection Method b...

引用

7th IEEE International Conference on Data Science in Cyberspace, DSC 2022

作者： Zhai, You Dong, Hao Li, Zhoujun Yang, Liqun He, Longtao Beihang University State Key Lab of Software Development Environment China Beihang University School of Cyber Science and Technology China National Computer Network Emergency Response Technical Team Coordination Center of China China

ISBN: (数字)9781665474801

ISBN: (纸本)9781665474801

Botnets are starting to use domain generation algorithms (DGAs) extensively to enhance the stealth of command and control (C&C) communications between C&C servers and bots. Domains generated by DGAs are called algorithmically generated domains (AGDs), which also known as malicious domains. Detection of AGDs is a crucial element for fighting botnets and security researchers have proposed a variety of DGA detection methods. In order to avoid the detection of DGA detectors, various types of DGAs are continuously updated. Among them, the dictionary-based malicious domain, with strong camouflage, is the most advanced DGA representative and the previous detection methods are very ineffective on this type of malicious domain. To solve this problem, we explore the dictionary-based malicious domain generation algorithm, and propose, AGDB, a dictionary-based malicious domain detection method based on representation fusion, which combines features extracted from the context-based malicious domain detection model with features extracted from the graph-based malicious domain detection model. The experimental results show that the detection method based on representation fusion significantly outperforms the existing methods in terms of precision and recall. © 2022 IEEE.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

EFMLP: A Novel Model for Web Service QoS Prediction 16th

EFMLP: A Novel Model for Web Service QoS Prediction

引用

16th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Ye, Kailing Yu, Huiqun Fan, Guisheng Chen, Liqiong Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai201112 China Shanghai Engineering Research Center of Smart Energy Shanghai China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai201418 China

ISBN: (纸本)9783030675394

With the emergence of service-oriented architecture, quality of service (QoS) has become a crucial factor in describing the non-functional characteristics of Web services. In the real world, the user only requests limited Web services, the QoS record of Web services is sparsity. In this paper, we propose an approach named factorization machine and multi-layer perceptron model based on embedding technology (EFMLP) to solve the problem of sparsity and high dimension. First, the input data will be sent to embedding layer to reduce the data dimension. Then, the embedded feature vector will send to the factorization machine. After that, the first-order and second-order weights of the factorization machine are used as the initial weights of the first layer of the multi-layer perceptron. And the multi-layer perceptron is trained to adjust the weights. Finally, 1,974,675 pieces of data from an open dataset is used as experiment data to validate the model, and the result shows that our EFMLP model can predict QoS value accurately on the client side. © 2021, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Code Prediction Based on Graph Embedding Model 16th

Code Prediction Based on Graph Embedding Model

引用

16th EAI International Conference on Collaborative Computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Yang, Kang Yu, Huiqun Fan, Guisheng Yang, Xingguang Chen, Liqiong Department of Computer Science and Engineering East China University of Science and Technology Shanghai China Shanghai Key Laboratory of Computer Software Evaluating and Testing China Shanghai China Shanghai Engineering Research Center of Smart Energy Shanghai China Department of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai200235 China

ISBN: (纸本)9783030675394

Code prediction aims to accelerate the efficiency of programmer development. However, its prediction accuracy is still a great challenge. To facilitate the interpretability of the code prediction model and improve the accuracy of prediction. In this paper, the source code’s Abstract Syntax Tree (AST) is used to extract relevant structural paths between nodes and convert them into training graphs. The embedded model can convert the feature of the node sequence in the training graph into a vector that is convenient for quantization. We calculate the similarity between the candidate value and the parent node vector of the predicted path to obtain the predicted value. Experiments show that by using prediction data to increase the weight of related nodes in the graph, the model can extract more useful structural features, especially in Value prediction tasks. Adjusting the parameters embedded in the graph can improve the accuracy of the model. © 2021, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

PVBF: A Framework for Mitigating Parameter Variation Imbalance in Online Continual Learning

arXiv

引用

arXiv 2025年

作者： Tao, Zelin Deng, Hao Liu, Mingqing Zhang, Lijun Zhao, Shengjie School of Computer Science and Technology Tongji University Shanghai201804 China College of Electronic and Information Engineering Tongji University Shanghai201804 China National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai201804 China

Online continual learning (OCL), which enables AI systems to adaptively learn from non-stationary data streams, is commonly achieved using experience replay (ER)-based methods that retain knowledge by replaying stored past during training. However, these methods face challenges of prediction bias, stemming from deviations in parameter update directions during task transitions. This paper identifies parameter variation imbalance as a critical factor contributing to prediction bias in ER-based OCL. Specifically, using the proposed parameter variation evaluation method, we highlight two types of imbalance: correlation-induced imbalance, where certain parameters are disproportionately updated across tasks, and layer-wise imbalance, where output layer parameters update faster than those in preceding layers. To mitigate the above imbalances, we propose the Parameter Variation Balancing Framework (PVBF), which incorporates: 1) a novel method to compute parameter correlations with previous tasks based on parameter variations, 2) an encourage-and-consolidate (E&C) method utilizing parameter correlations to perform gradient adjustments across all parameters during training, 3) a dual-layer copy weights with reinit (D-CWR) strategy to slowly update output layer parameters for frequently occuring sample categories. Experiments on short and long task sequences demonstrate that PVBF significantly reduces prediction bias and improves OCL performance, achieving up to 47% higher accuracy compared to existing ER-based methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Research on Recognition Method of Floating Objects on Water Surface Based on improved ResNet 22

Research on Recognition Method of Floating Objects on Water ...

引用

Proceedings of the 2022 6th International Conference on Electronic Information technology and computer Engineering

作者： Haonan Guo Yangyi Ma Lei Hua Dingsheng Wan College of Computer and Information Hohai University China Software Development Center Bank of Communications China School of Management Tianjin University of Technology China

ISBN: (纸本)9781450397148

With the continuous population growth and rapid economic development, problems such as scarcity and pollution of freshwater resources are increasingly emerging. Floating objects on the water surface are one of the causes of water pollution, so the research on the identification algorithm of floating objects is of great significance. To further improve the accuracy of the identification of floating objects on the water surface, this paper proposes a DS-ResNet model based on the improved ResNet. Compared to previous work, DS-ResNet employs several innovations to improve training and testing speed while also increasing recognition accuracy. We established an actual data sample set in the field of rivers and lakes, and a modified ResNet model was constructed by Tensorflow for training. The experimental results show that the training cycle time of DS-ResNet is reduced by about 7% compared with the traditional ResNet, and the recognition accuracy of common targets reaches 98%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：