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

A Stepwise Path Selection Scheme Based on Multiple QoS Parameters Evaluation in SDN 17th

A Stepwise Path Selection Scheme Based on Multiple QoS Param...

17th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Lin Zhou, Jian-Tao Xing, Hai-Feng Guo, Xiao-Yong College of Computer Science Ecological Big Data Engineering Research Center of the Ministry of Education Cloud Computing and Service Software Engineering Laboratory of Inner Mongolia Autonomous Region National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Social Computing and Data Processing Key Laboratory of Inner Mongolia Autonomous Region Big Data Analysis Technology Engineering Research Center of Inner Mongolia Autonomous Region Inner Mongolia University Inner Mongolia Hohhot China College of Computer Science and Technology Inner Mongolia Normal University Inner Mongolia Hohhot China College of Computer Information and Management Inner Mongolia University of Finance and Economics Inner Mongolia Hohhot China

ISBN: (纸本)9783030926342

Nowadays, the best-effort service can not guarantee the quality of service (QoS) for all kinds of services. QoS routing is an important method to guarantee QoS requirements. It involves path selection for flows based on the current network status and the performance criteria of the service requirements. However, it is difficult for proposed solutions to obtain all the available paths owing to not fully considering all the QoS parameters of paths. In this paper, we propose SWQoS, a novel, universal, and stepwise QoS guarantee scheme based on multiple QoS parameter evaluation for selecting the available paths including preferred paths, satisfied paths and reluctant paths in SDN. The experiments show that SWQoS can select all the available paths that meet the performance criteria of the service requirements and have better QoS parameter performance compared with other path selection methods. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Motif-preserving temporal network embedding 29

Motif-preserving temporal network embedding

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Huang, Hong Fang, Zixuan Wang, Xiao Miao, Youshan Jin, Hai National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory School of Computer Science and Technology Huazhong University of Science and Technology China Beijing University of Posts and Telecommunications China Microsoft Research Asia

ISBN: (纸本)9780999241165

Network embedding, mapping nodes in a network to a low-dimensional space, achieves powerful performance. An increasing number of works focus on static network embedding, however, seldom attention has been paid to temporal network embedding, especially without considering the effect of mesoscopic dynamics when the network evolves. In light of this, we concentrate on a particular motif - triad - and its temporal dynamics, to study the temporal network embedding. Specifically, we propose MTNE, a novel embedding model for temporal networks. MTNE not only integrates the Hawkes process to stimulate the triad evolution process that preserves motif-aware high-order proximities, but also combines attention mechanism to distinguish the importance of different types of triads better. Experiments on various real-world temporal networks demonstrate that, compared with several state-of-the-art methods, our model achieves the best performance in both static and dynamic tasks, including node classification, link prediction, and link recommendation. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Network embeddings

来源：评论

学校读者我要写书评

暂无评论

Active Legibility in Multiagent Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Liu, Yanyu Pan, Yinghui Zeng, Yifeng Ma, Biyang Prashant, Doshi School of Automation Central South University No.605 South Lushan Road Hunan Changsha410083 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle United Kingdom School of Computer Science Minnan Normal University Fujian Zhangzhou China Department of Computer Science University of Georgia AthensGA United States

A multiagent sequential decision problem has been seen in many critical applications including urban transportation, autonomous driving cars, military operations, etc. Its widely known solution, namely multiagent reinforcement learning, has evolved tremendously in recent years. Among them, the solution paradigm of modeling other agents attracts our interest, which is different from traditional value decomposition or communication mechanisms. It enables agents to understand and anticipate others’ behaviors and facilitates their collaboration. Inspired by recent research on the legibility that allows agents to reveal their intentions through their behavior, we propose a multiagent active legibility framework to improve their performance. The legibility-oriented framework allows agents to conduct legible actions so as to help others optimise their behaviors. In addition, we design a series of problem domains that emulate a common scenario and best characterize the legibility in multiagent reinforcement learning. The experimental results demonstrate that the new framework is more efficient and costs less training time compared to several multiagent reinforcement learning algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning

arXiv

引用

arXiv 2024年

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3DAD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. Copyright © 2024, The Authors. All rights reserved.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Vflh: A Following-the-Leader-History Based Algorithm for Adaptive Online Convex Optimization with Stochastic Constraints

SSRN

引用

SSRN 2022年

作者： Yang, Yifan Chen, Lin Zhou, Pan Ding, Xiaofeng Department of Computer Science University of California Santa BarbaraCA93106 United States National Engineering Research Center for Big Data Technology and System Lab Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan430072 China

This paper considers online convex optimization (OCO) with generated i.i.d. stochastic constraints, where the distribution of environment is changing and the performance is measured by \textit{adaptive regret}. The stochastic constraints are disclosed at each round to the learner after the decision is made. Different from the previous non-adaptive constrained OCO algorithm which is generalized based on the traditional online gradient descent algorithm, we propose a novel \textit{Virtual queue based Following-the-Leader-History} (VFLH) strategy to make the constrained OCO algorithm adaptive and design the VFLH algorithm. In this setting, the algorithm firstly generalizes all the experts in the specified time interval, then decides the optimal decision with each expert and gives out the final choice by combining the predictions of active experts. In terms of the algorithm performance, there are two performance metrics to be evaluated, i.e., the bounds of constraint violation and regret. For the constraint violation, we bring in the multi-objective drift analysis approach to deal with the constraints via a virtual queue which provides a new method to bound the constraints violations. For the regret, we give out its upper bound and then achieve a corresponding lower bound that proves the upper bound is sufficiently tight. Finally, we provide some numerical experiments to validate the feasibility of our algorithm. © 2022, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

EdgeDis: Enabling Fast, Economical, and Reliable data Dissemination for Mobile Edge computing

arXiv

引用

arXiv 2023年

作者： Li, Bo He, Qiang Chen, Feifei Lyu, Lingjuan Bouguettaya, Athman Yang, Yun The College of Arts Business Law Education and Information Technology Victoria University MelbourneVIC3122 Australia The National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China The Department of Computing Technologies Swinburne University of Technology MelbourneVIC3122 Australia The School of Information Technology Deakin University Geelong Australia SONY AI Inc. Tokyo108-0075 Japan The School of Computer Science University of Sydney CamperdownNSW2006 Australia

Mobile edge computing (MEC) enables web data caching in close geographic proximity to end users. Popular data can be cached on edge servers located less than hundreds of meters away from end users. This ensures bounded latency guarantees for various latency-sensitive web applications. However, transmitting a large volume of data out of the cloud onto many geographically-distributed web servers individually can be expensive. In addition, web content dissemination may be interrupted by various intentional and accidental events in the volatile MEC environment, which undermines dissemination efficiency and subsequently incurs extra transmission costs. To tackle the above challenges, we present a novel scheme named EdgeDis that coordinates data dissemination by distributed consensus among those servers. We analyze EdgeDis’s validity theoretically and evaluate its performance experimentally. Results demonstrate that compared with baseline and state-of-the-art schemes, EdgeDis: 1) is 5.97x - 7.52x faster;2) reduces dissemination costs by 48.21% to 91.87%;and 3) reduces performance loss caused by dissemination failures by up to 97.30% in time and 96.35% in costs. © 2023, CC BY-NC-SA.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Demand Response Scheme: Achieving Sustainability in Distributed data Processing

Demand Response Scheme: Achieving Sustainability in Distribu...

引用

IEEE International Conference on data Science in Cyberspace (DSC)

作者： Xueying Zhai Yunfeng Peng Xiuping Guo Liang Zhang Wei Zhang School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China School of Economics and Management Beijing University of Posts and Telecommunications Beijing China Guizhou Key Laboratory of Electric Power Big Data Guizhou Institute of Technology Guizhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China

ISBN: (数字)9798350391367

ISBN: (纸本)9798350391374

The rapid development of Internet of Things (IoT) technology has driven the intelligent transformation of various industries, including manufacturing, agriculture, and healthcare, etc., significantly enhancing their management capabilities and decision-making efficiency. data analysis is crucial, serving as both the core technology of this transformation and a major driving force for advancing industry intelligence. However, the increasing volume of data has led to high energy consumption during data analysis, posing significant challenges to environmental and economic sustainability. Integrating renewable energy sources (RESs) is an effective way to reduce greenhouse gas emissions due to their low-carbon and renewable nature. Additionally, the spatiotemporal variability and complementarity of RES generation and grid electricity prices provide favorable conditions for distributed data processing. Therefore, a two-stage demand response scheme is proposed to reduce carbon emissions and electricity costs by prioritizing data processing in data centers (DCs) where RES is abundant or electricity prices are low, based on RES generation and electricity price signals. Simulation results show that the proposed scheme reduces 36.37% carbon emissions and 20.49% electricity costs compared to the benchmark algorithm, indicating its potential for both environmental and economic optimization.

关键词： Renewable energy sources Energy consumption Costs Electricity Simulation Carbon dioxide Spatiotemporal phenomena Internet of Things Sustainable development Optimization

来源：评论

学校读者我要写书评

暂无评论

Survey on Large Language Model-Enhanced Reinforcement Learning: Concept, Taxonomy, and Methods

引用

IEEE Transactions on Neural Networks and Learning systems 2024年第6期36卷 9737-9757页

作者： Yuji Cao Huan Zhao Yuheng Cheng Ting Shu Yue Chen Guolong Liu Gaoqi Liang Junhua Zhao Jinyue Yan Yun Li Department of Mechanical and Automation Engineering The Chinese University of Hong Kong Hong Kong SAR China Department of Building Environment and Energy Engineering The Hong Kong Polytechnic University Hong Kong China School of Science and Engineering The Chinese University of Hong Kong Shenzhen China Center for Crowd Intelligence Shenzhen Institute of Artificial Intelligence and Robotics for Society (AIRS) Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Electrical and Electronic Engineering Nanyang Technological University Jurong West Singapore School of Mechanical Engineering and Automation Harbin Institute of Technology Shenzhen China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen China i4AI Ltd. London U.K.

With extensive pretrained knowledge and high-level general capabilities, large language models (LLMs) emerge as a promising avenue to augment reinforcement learning (RL) in aspects, such as multitask learning, sample efficiency, and high-level task planning. In this survey, we provide a comprehensive review of the existing literature in LLM-enhanced RL and summarize its characteristics compared with conventional RL methods, aiming to clarify the research scope and directions for future studies. Utilizing the classical agent-environment interaction paradigm, we propose a structured taxonomy to systematically categorize LLMs’ functionalities in RL, including four roles: information processor, reward designer, decision-maker, and generator. For each role, we summarize the methodologies, analyze the specific RL challenges that are mitigated and provide insights into future directions. Finally, the comparative analysis of each role, potential applications, prospective opportunities, and challenges of the LLM-enhanced RL are discussed. By proposing this taxonomy, we aim to provide a framework for researchers to effectively leverage LLMs in the RL field, potentially accelerating RL applications in complex applications, such as robotics, autonomous driving, and energy systems.

关键词： Taxonomy Surveys Visualization Reviews Planning Reinforcement learning Games Transformers Natural language processing Large language models

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

Stvanet: A Spatio-Temporal Visual Attention Framework with Large Kernel Attention Mechanism for Citywide Traffic Dynamics Prediction

SSRN

引用

SSRN 2023年

作者： Yang, Hongtai Jiang, Junbo Zhao, Zhan Pan, Renbin School of Transportation and Logistics National Engineering Laboratory of Integrated Transportation Big Data Application Technology National United Engineering Laboratory of Integrated and Intelligent Transportation Institute of System Science and Engineering Southwest Jiaotong University Chengdu611756 China Department of Urban Planning and Design The University of Hong Kong Hong Kong Special Administrative Region Hong Kong School of Business Administration Southwestern University of Finance and Economics Chengdu611130 China

Enhancing the efficiency and safety of the Intelligent Transportation system requires effective modeling and prediction of citywide traffic dynamics. Most studies employ convolutional neural networks (CNNs) with a 3D convolutional structure or spatio-temporal models with self-attention mechanisms to capture the spatio-temporal information of traffic distribution. Although 3D CNNs excel at capturing local contextual information, they are computationally complex due to the large number of parameters and cannot capture long-range dependence. By contrast, although self-attention mechanisms originally designed to address challenges in natural language processing can capture long-range dependence, their application to 2D image structures requires breaking down the inherent 2D context into a 1D sequence, increasing the computational complexity and neglecting the adaptability between local contextual information and channels. Accordingly, we propose a spatio-temporal visual attention neural network (STVANet), a novel spatio-temporal visual attention 2D CNN, which integrates a unique visual attention module with a large kernel attention (LKA) mechanism and a feedforward component to capture long-range dependence and channel information in urban traffic data while preserving the 2D image structure. LKA-based spatio-temporal attention networks extract spatial and temporal features from weekly, daily, and recent hourly periods, and aggregate them with weighted consideration of external features to make predictions. Evaluation of real-world datasets demonstrates STVANet’s superiority over baseline models, showcasing its potential in citywide traffic prediction. © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：