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

IEEE Transactions on Nanobioscience 2025年 PP卷 PP页

作者： Liu, Zhenlu Cao, Ben Shao, Qi Zheng, Yanfen Wang, Bin Zhou, Shihua Zheng, Pan Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China University of Canterbury Upper Riccarton Department of Accounting and Information Systems Christchurch8140 New Zealand

Deoxyribonucleic acid (DNA) has become an ideal medium for long-term storage and retrieval due to its extremely high storage density and long-term stability. But access efficiency is an existing bottleneck in DNA storage, especially the lack of high-quality random access address sequences. Therefore, in this paper, we report a series of approaches based on k-weakly mutually uncorrelated (k-WMU) codes to design the address sequence to improve the access efficiency of DNA storage. To address the problem of DNA sequences that are poorly scalable at the base level, we propose a 0-m-ruling coding scheme combined with k-WMU codes that can make address sequences avoid generating secondary structure with stem lengths ranging from 3 to 9. Based on the decoupled structure, We further extend the k-WMU codes with error correction function while satisfying combinatorial biological constraints. In order to investigate the performance of the designed address sequences for real-world applications, we perform simulation experiments based on thermodynamic properties and error correction capability as well as compared the minimum free energy (MFE), melting temperature (TM), and average decoding success rate (ADSR) with previous work. The results show that designed address sequences have a high MFE value and ADSR and a substantial reduction in TM-variance while satisfying the combinatorial biological constraints. As the quality of address sequences improves, this will help to achieve accurate random access as well as enhance the robustness of the DNA storage system. © 2002-2011 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

Hidden high-risky states identification from routine urban traffic

arXiv

引用

arXiv 2024年

作者： Liu, Shiyan Bai, Mingyang Guo, Shengmin Gao, Jianxi Sun, Huijun Gao, Ziyou Li, Daqing School of Reliability and Systems Engineering Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China Department of Computer Science Rensselaer Polytechnic Institute TroyNY12180 United States School of Systems Science Beijing Jiaotong University Beijing100044 China

One of the core risk management tasks is to identify hidden high-risky states that may lead to system breakdown, which can provide valuable early warning knowledge. However, due to high dimensionality and nonlinear interaction embedded in large-scale complex systems like urban traffic, it remains challenging to identify hidden high-risky states from huge system state space where over 99% of possible system states are not yet visited in empirical data. Based on maximum entropy model, we infer the underlying interaction network from complicated dynamical processes of urban traffic, and construct system energy landscape. In this way, we can locate hidden high-risky states that have never been observed from real data. These states can serve as risk signals with high probability of entering hazardous minima in energy landscape, which lead to huge recovery cost. Our finding might provide insights for complex system risk management. Significance Statement Hidden high-risky states are lethal system states with catastrophic consequences for large-scale complex systems. Existing methods for identifying hidden high-risky states face challenges in routine urban traffic, where over 99% of possible system states are not yet visited in empirical data. Based on large-scale traffic-speed data, we build a least-structured network entropy model that captures intricate traffic interactions. This model can generate the entire state space and help the identification of hidden high-risky states that may lead to extreme events. Our results suggest a new way to provide reliable early warning signals for system breakdown based on critical risk scenarios. Copyright © 2024, The Authors. All rights reserved.

关键词： Large scale systems

来源：评论

学校读者我要写书评

暂无评论

Correction to: A comprehensive performance evaluation of container migration strategies

引用

Computing 2025年第4期107卷 1-2页

作者： Feitosa, Leonel Barbosa, Vandirleya Sabino, Arthur Lima, Luiz Nelson Fé, Iure Silva, Luis Guilherme Callou, Gustavo Carvalho, Juliana Leão, Erico Nguyen, Tuan Anh Rego, Paulo Silva, Francisco Airton Laboratory of Applied Research to Distributed Systems (PASID) Federal University of Piauí (UFPI) Picos Brazil Department of Computing Federal Rural University of Pernambuco (UFRPE) Recife Brazil Department of Software Engineering Faculty of Information Technology University of Industry and Trade (HUIT) Ho Chi Minh City Vietnam Department of Computer Science Federal University of Ceará (UFC) Fortaleza Brazil

来源：评论

学校读者我要写书评

暂无评论

F2A2: flexible fully-decentralized approximate actor-critic for cooperative multi-agent reinforcement learning

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2023年第1期24卷 8447-8521页

作者： Wenhao Li Bo Jin Xiangfeng Wang Junchi Yan Hongyuan Zha School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of Software Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China School of Computer Science and Technology Key Laboratory of Mathematics and Engineering Applications Ministry of Education East China Normal University Shanghai China Department of Computer Science and Engineering Key Laboratory of Artificial Intelligence Ministry of Education Shanghai Jiao Tong University Shanghai China

Traditional centralized multi-agent reinforcement learning (MARL) algorithms are sometimes unpractical in complicated applications due to non-interactivity between agents, the curse of dimensionality, and computation complexity. Hence, several decentralized MARL algorithms are motivated. However, existing decentralized methods only handle the fully cooperative setting where massive information needs to be transmitted in training. The block coordinate gradient descent scheme they used for successive independent actor and critic steps can simplify the calculation, but it causes serious bias. This paper proposes a exible fully decentralized actor-critic MARL framework, which can combine most of the actor-critic methods and handle large-scale general cooperative multi-agent settings. A primal-dual hybrid gradient descent type algorithm framework is designed to learn individual agents separately for decentralization. From the perspective of each agent, policy improvement and value evaluation are jointly optimized, which can stabilize multi-agent policy learning. Furthermore, the proposed framework can achieve scalability and stability for the large-scale environment. This framework also reduces information transmission by the parameter sharing mechanism and novel modeling-other-agents methods based on theory-of-mind and online supervised learning. Sufficient experiments in cooperative Multi-agent Particle Environment and StarCraft II show that the proposed decentralized MARL instantiation algorithms perform competitively against conventional centralized and decentralized methods.

关键词： cooperative MARL decentralized actor-critic primal-dual method

来源：评论

学校读者我要写书评

暂无评论

Robust Generalization Against Photon-Limited Corruptions via Worst-Case Sharpness Minimization

Robust Generalization Against Photon-Limited Corruptions via...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhuo Huang Miaoxi Zhu Xiaobo Xia Li Shen Jun Yu Chen Gong Bo Han Bo Du Tongliang Liu Sydney AI Centre The University of Sydney National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University JD Explore Academy Department of Automation University of Science and Technology of China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Department of Computer Science Hong Kong Baptist University

Robust generalization aims to tackle the most challenging data distributions which are rare in the training set and contain severe noises, i.e., photon-limited corruptions. Common solutions such as distributionally robust optimization (DRO) focus on the worst-case empirical risk to ensure low training error on the uncommon noisy distributions. However, due to the over-parameterized model being optimized on scarce worst-case data, DRO fails to produce a smooth loss landscape, thus struggling on generalizing well to the test set. Therefore, instead of focusing on the worst-case risk minimization, we propose SharpDRO by penalizing the sharpness of the worst-case distribution, which measures the loss changes around the neighbor of learning parameters. Through worst-case sharpness minimization, the proposed method successfully produces a flat loss curve on the corrupted distributions, thus achieving robust generalization. Moreover, by considering whether the distribution annotation is available, we apply SharpDRO to two problem settings and design a worst-case selection process for robust generalization. Theoretically, we show that SharpDRO has a great convergence guarantee. Experimentally, we simulate photon-limited corruptions using CIFAR10/100 and ImageNet30 datasets and show that SharpDRO exhibits a strong generalization ability against severe corruptions and exceeds well-known baseline methods with large performance gains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards a Deep Learning Pain-Level Detection Deployment at UAE for Patient-Centric-Pain Management and Diagnosis Support: Framework and Performance Evaluation

引用

Procedia computer science 2023年 220卷 339-347页

作者： Leila Ismail Muhammad Danish Waseem Clouds and Distributed Computing and Systems (CLOUDS) Lab School of Computing and Information Systems Faculty of Engineering and Information Technology The University of Melbourne Australia. Intelligent Distributed Computing and Systems (INDUCE) Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University UAE. National Water and Energy Center United Arab Emirates University UAE.

The outbreak of the COVID-19 pandemic revealed the criticality of timely intervention in a situation exacerbated by a shortage in medical staff and equipment. Pain-level screening is the initial step toward identifying the severity of patient conditions. Automatic recognition of state and feelings help in identifying patient symptoms to take immediate adequate action and providing a patient-centric medical plan tailored to a patient's state. In this paper, we propose a framework for pain-level detection for deployment in the United Arab Emirates and assess its performance using the most used approaches in the literature. Our results show that a deployment of a pain-level deep learning detection framework is promising in identifying the pain level accurately.

关键词： computer Vision Deep Learning Image Processing Machine Learning Pain Detection Patient-Centric Smart healthcare eHealth

来源：评论

学校读者我要写书评

暂无评论

Adaptive Student Inference Network for Efficient Single Image Super-Resolution

Adaptive Student Inference Network for Efficient Single Imag...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Kang Miao Zhao Zhang Jiahuan Ren Mingbo Zhao Haijun Zhang Richang Hong School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Yunnan Key Laboratory of Software Engineering Kunming China School of Information Science and Technology Donghua University Shanghai China Department of Computer Science Harbin Institute of Technology (Shenzhen) Shenzhen China

Recent advances in single image super-resolution (SISR) have achieved remarkable performance through deep learning. However, the high computational cost hinders the deployment of SISR models on edge devices. Instead of proposing new SISR models, a new trend is emerging to improve network efficiency by reducing parameters, FLOPs, and inference time through slight modifications to the original models. However, recent methods usually focus on reducing only one of three metrics, i.e., FLOPs, parameters and inference time, which inevitably increases the other two metrics. In this paper, we propose a novel Adaptive Student Inference Network (ASIN) on popular SISR models, which aims at reducing FLOPs and inference time while maintaining the number of parameters and restoring clearer high-resolution images. Specifically, our ASIN divides a SISR model into three components (head, body and tail) and adopts various strategies for each part. For head and tail parts, to ensure the restored images contain more detailed information, a novel auxiliary Enhanced Teacher Network (ETNet) is designed, which is trained with the ground-truth images to obtain more prior knowledge to guide student network to extract more accurate textures using a new knowledge distillation method. For the body part, owing to the varying difficulties of the reconstructions in different regions, we propose an Adaptive Depth Predicted Module (ADPM) to dynamically shorten average depth of network to reduce the computational cost of overall network. Extensive experiments on two datasets demonstrate the effectiveness and state-of-the-art performance of our ASIN compared to its counterparts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Training Approaches for Performance Anomaly Detection Models in Edge Computing Environments

arXiv

引用

arXiv 2024年

作者： Fernando, Duneesha Rodriguez, Maria A. Arroba, Patricia Ismail, Leila Buyya, Rajkumar Laboratory School of Computing and Information Systems The University of Melbourne Parkville Australia The CCS Center for Computational Simulation Universidad Politécnica de Madrid Madrid Spain Lab Department of Computer Science and Software Engineering United Arab Emirates University United Arab Emirates

Microservice architectures are increasingly used to modularize IoT applications and deploy them in distributed and heterogeneous edge computing environments. Over time, these microservice-based IoT applications are susceptible to performance anomalies caused by resource hogging (e.g., CPU or memory), resource contention, etc., which can negatively impact their Quality of Service and violate their Service Level Agreements. Existing research on performance anomaly detection for edge computing environments focuses on model training approaches that either achieve high accuracy at the expense of a time-consuming and resource-intensive training process or prioritize training efficiency at the cost of lower accuracy. To address this gap, while considering the resource constraints and the large number of devices in modern edge platforms, we propose two clustering-based model training approaches: (1) intra-cluster parameter transfer learning-based model training (ICPTL) and (2) cluster-level model training (CM). These approaches aim to find a trade-off between the training efficiency of anomaly detection models and their accuracy. We compared the models trained under ICPTL and CM to models trained for specific devices (most accurate, least efficient) and a single general model trained for all devices (least accurate, most efficient). Our findings show that ICPTL's model accuracy is comparable to that of the model per device approach while requiring only 40% of the training time. In addition, CM further improves training efficiency by requiring 23% less training time and reducing the number of trained models by approximately 66% compared to ICPTL, yet achieving a higher accuracy than a single general model. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning for Sleep Control in 5G and Beyond Radio Access Networks: An Overview

Deep Reinforcement Learning for Sleep Control in 5G and Beyo...

引用

International Wireless Communications and Mobile Computing Conference, IWCMC

作者： Nessrine Trabelsi Rihab Maaloul Lamia Chaari Fourati Wael Jaafar Laboratory of Signals systeMs aRtificial intelligence and neTworkS – Digital Research Center of Sfax Sfax Tunisia Higher Institute of Computer Science of Mahdia (ISIMa) University of Monastir Tunisia Higher Institute of Computer Science and Multimedia in Sfax (ISIMS) University of Sfax Tunisia Department of Software and IT Engineering École de technologies supérieure (ÉTS) Montreal Canada

ISBN: (数字)9798350361261

ISBN: (纸本)9798350361278

The advent of 5G and beyond networks is envisioned to support lower latency, higher data rates, and wider connectivity than previous cellular network generations. However, given the denser deployment of base stations (BSs) to accommodate such improvements, this results inevitably in a significant and unsustainable increase in the network’s energy consumption. Sleep Control (SC), which allows switching off some BS hardware components during light-traffic time, is considered a viable solution for greener and more energy-efficient Radio Access Networks (RAN). However, the optimization of SC is a highly challenging large-scale network combinatorial problem that depends on dynamic wireless channel conditions and varying traffic demands with stringent Quality-of-Service (QoS) requirements. Driven by the benefits and efficiency of Deep Reinforcement Learning (DRL), which has been successfully applied to multiple wireless network optimization problems, this paper investigates DRL approaches addressing sleep control in 5G and beyond RAN. To this end, we propose a taxonomy to classify the related literature. Then, we provide an overview of the different components of the Markov Decision Process (MDP) modeling the sequential decision-making of sleep control and the applied DRL algorithms. Finally, we highlight the main challenges in existing works and suggest novel strategies to address them.

关键词： 5G mobile communication Wireless networks Taxonomy Decision making Quality of service Switches Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：