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

Task Prioritization in Multiagent Environments: A Novel Approach Using Nash Q-Learning

IEEE Transactions on Consumer Electronics 2025年

作者： Li, Kexin Hu, Yu Wang, Jielei Li, Lin Zhang, Shuyuan Luo, Guangchun Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China College of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

—With the rapid proliferation of smartphones and various terminal devices, edge computing has gained increasing importance in overcoming computational limitations and enhancing service quality through task offloading. However, most existing approaches handle tasks on a first-come, first-served basis, neglecting task prioritization, which is critical in real-world scenarios where tasks have different levels of urgency and resource requirements. This paper addresses the challenge of effective task prioritization in multi-agent task offloading by proposing a Nash Q-learning-based strategy. Our methodology involves optimizing task allocation decisions using Nash Q-learning to integrate Nash equilibrium principles, thereby enhancing adaptability and dynamic decision-making capabilities within a multi-agent environment. The proposed algorithm is evaluated through extensive simulations, comparing total delay, resource utilization, and task success rates across various task offloading strategies. The results demonstrate that our Nash Q-learning approach outperforms conventional techniques by dramatically lowering overall latency, optimizing resource allocation, and maintaining high task success rates. This work demonstrates the efficacy of Nash Q-learning for dynamically setting priorities for tasks in multi-agent edge computing environments, providing a robust framework for effective resource management and collaborative task completion. And also highlight the potential of Nash Q-learning in advancing intelligent task management in edge computing, suggesting its applicability in real-world, resource-constrained environments. © 2025 IEEE. All rights reserved,

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

WMAJL: Watcher-Mediated Attention Joint Learning Model for Multimodal Relation Extraction

WMAJL: Watcher-Mediated Attention Joint Learning Model for M...

引用

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

作者： Yunrui Dong Guiduo Duan Tianxi Huang Yunhao Li School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China Chengdu China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu China Chengdu Textile College College of Humanities and General Education Chengdu China School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In the domain of Multimodal Relation Extraction (MRE), we present the $\color{Red}{\text{W}}$atcher-$\color{Red}{\text{M}}$ediated $\color{Red}{\text{A}}$ttention $\color{Red}{\text{J}}$oint $\color{Red}{\text{L}}$earning Model ($\color{Red}{\text{WMAJL}}$), a novel approach addressing the challenges of modality alignment noise, cross-modal fusion disparity, preservation of textual relative position information, and the distinctiveness of classification labels. WMAJL employs an integrative framework leveraging contrastive learning and variational autoencoder constraints to mitigate modality alignment noise by prioritizing relevant semantic data and effectively reducing extraneous noise that does not contribute to the task. The model’s innovative architecture includes a mediator watcher, which facilitates enhanced cross-modal fusion by enabling nuanced information exchange between textual and visual modalities while preserving the unique characteristics of each modality. Additionally, the design of auxiliary tasks, such as Named Entity Recognition (NER), and output supervision constructs loss functions that preserve relative position information, ensuring a precise depiction of entity relationships throughout the multilayer encoding processes. A key differentiator of WMAJL is its label-centric self-information loss technique, inspired by InfoNCE, which trains the model to cluster similar relation labels in semantically coherent areas, thereby optimizing classification label uniqueness by discerning subtle differences among relation types. The synergistic application of these strategies has led to a significant enhancement of WMAJL’s performance, as evidenced by its state-of-the-art F1 score of $\color{Red}{84.93\%}$ on the MNRE dataset. This achievement surpasses existing benchmarks and sets a new standard for multimodal knowledge extraction, underscoring WMAJL’s potential to revolutionize the MRE landscape.

关键词： Resistance Visualization Technological innovation Noise Autoencoders Semantics Contrastive learning Nonhomogeneous media Speech processing Standards

来源：评论

学校读者我要写书评

暂无评论

Multi-DAGs Scheduling Integrating with Security and Availability in cloud Environment

引用

Chinese Journal of Electronics 2015年第4期24卷 709-716页

作者： LIU Yaqiu SHAO Hongrun JING Weipeng QIU Zhaowen The College of Information and Computer Engineering Northeast Forestry University Heilongjiang Province Engineering Technology Research Centre for Forestry Ecological Big Data Storage and High Performance (Cloud) Computing

In view of the issue concerns multiple Directed acyclic graphs(DAGs) scheduling in multi-tenant cloud computing environment, a scheduling strategy that integrate security and availability is proposed to satisfy the tenants’ requirements for resource security and availability, as thus it can not only protect the users’ privacy and data security but also advance the success rate. The proposal assesses resource reputation to ensure jobs can be scheduled onto relatively security nodes; during task scheduling, it classifies the DAGs to achieve fairness; in the process of resources allocation, the objective function would maximize the user’s security satisfaction and minimize the deviation of availability; meanwhile, it takes advantage of "time chips" flexibly to promote resource utilization rate; afterwards, we present a Greedy algorithm integrating with security and availability(GISA) to implement the strategy. The experimental results show the correctness and superior of the novel strategy.

关键词： Multi-DAGs scheduling Security Availability Resource utilization

来源：评论

学校读者我要写书评

暂无评论

Performance sensitivity of Operating System parameters in Microservice environments 9

Performance sensitivity of Operating System parameters in Mi...

引用

9th IEEE International Conference on cloud computing in Emerging Markets, CCEM 2020

作者： Goutham, K S Kempaiah, Bharani Ujjaini Mampilli, Ruben John Kalambur, Subramaniam Centre for Cloud Computing and Big Data Computer Science and Engineering Pes University Bangalore India

ISBN: (纸本)9781728195766

cloud services are undergoing a major shift from monolithic applications to graphs of hundreds of loosely-coupled microservices. Microservice architecture presents both opportunities and challenges while optimizing for system characterization and resource utilization. In this study, we characterize the performance sensitivity of Operating System parameters for two academic microservice benchmarks with respect to their thread scheduling, disk writes, and the TCP buffer. We demonstrate that through simple affinitization of kernel threads to cores of a Non-Uniform Memory Access processor and disk buffer configurations, there is a 26% and 19% decrease in Average Latency accompanied by a 27% decrease in 99% Tail latency for the benchmarks under consideration. While performance improvements can be gained, we also show that alternate nonoptimal configurations of the system parameters degrade the performance substantially. © 2020 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Unsupervised feature selection based on Markov blanket and particle swarm optimization

引用

Journal of Systems engineering and Electronics 2017年第1期28卷 151-161页

作者： Yintong Wang Jiandong Wang Hao Liao Haiyan Chen College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Key Laboratory of Trusted Cloud Computing and Big Data Analysis Nanjing Xiaozhuang University College of Computer Science and Software Engineering Shenzhen University

Feature selection plays an important role in data mining and recognition, especially in the large scale text, image and biological data. Specifically, the class label information is unavailable to guide the selection of minimal feature subset in unsupervised feature selection, which is challenging and interesting. An unsupervised feature selection based on Markov blanket and particle swarm optimization is proposed named as UFSMB-PSO. The proposed method seeks to find the high-quality feature subset through multi-particles' cooperation of particle swarm optimization without using any learning algorithms. Moreover, the features' relevance will be computed based on an information metric of relevance gain, which provides an information theoretical foundation for finding the minimization of the redundancy between features. Our results on several benchmark datasets demonstrate that UFSMB-PSO can achieve significant improvement over state of the art unsupervised methods. © 1990-2011 Beijing Institute of Aerospace Information.

关键词： Character recognition data mining Feature extraction Information theory

来源：评论

学校读者我要写书评

暂无评论

Facial expression recognition via weighted group sparsity

引用

Frontiers of computer science 2017年第2期11卷 266-275页

作者： Hao ZHENG Xin GENG Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information Engineering Nanjing Xiaozhuang University Nanjing 211171 China School of Computer Science and Engineering Southeast University Nanjing 211189 China

Considering the distinctiveness of different group features in the sparse representation, a novel joint multi- task and weighted group sparsity （JMT-WGS） method is pro- posed. By weighting popular group sparsity, not only the rep- resentation coefficients from the same class over their asso- ciate dictionaries may share some similarity, but also the rep- resentation coefficients from different classes have enough di- versity. The proposed method is cast into a multi-task frame- work with two-stage iteration. In the first stage, representa- tion coefficient can be optimized by accelerated proximal gra- dient method when the weights are fixed. In the second stage, the weights are computed via the prior information about their entropy. The experimental results on three facial expres- sion databases show that the proposed algorithm outperforms other state-of-the-art algorithms and demonstrate the promis- ing performance of the proposed algorithm.

关键词： facial expression recognition multi-task learning group sparsity

来源：评论

学校读者我要写书评

暂无评论

Pipelining acoustic model training for speech recognition using storm

Pipelining acoustic model training for speech recognition us...

引用

2013 5th International Conference on Computational Intelligence, Modelling and Simulation, CIMSim 2013

作者： Sitaram, Dinkar Srinivasaraghavan, Haripriya Agarwal, Kapish Agrawal, Amritanshu Joshi, Neha Ray, Debraj Centre for Cloud Computing and Big Data Computer Science Department PES Institute of Technology Bangalore India

ISBN: (纸本)9780769551555

Speech recognition has been increasingly used on mobile devices, which has in turn increased the need for creation of new acoustic models for various languages, dialects, accents, speakers and environmental conditions. This involves training and adapting a huge number of acoustic models, some of them in real-time. Training acoustic models is thus essential for speech recognition because these models determine the accuracy and quality of the recognition process. This paper, discusses the use of Storm, a distributed real time computational system, to pipeline the creation of acoustic models by CMU Sphinx, an open-source software project for speech recognition and training. Software pipelining reduces the time required for training and optimizes system resource utilization, thus enabling huge amounts of data to be trained in considerably less amount of time than taken by the conventional sequential process. Pipelining is achieved by grouping the stages of the training process into a set of five stages, and running each stage on individual nodes in a Storm cluster. Thus acoustic models are created by training multiple streams of speech samples using the same SphinxTrain setup, also resulting in improvement of training time and throughput. © 2013 IEEE.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

Energy efficient VM scheduling in Reservation supported cloud data Centers under availability constraints

Energy efficient VM scheduling in Reservation supported Clou...

引用

2021 International Conference on Intelligent Technologies, CONIT 2021

作者： Charan, Bhavya Goutham, K S Mampilli, Ruben John Kempaiah, Bharani Ujjaini Phalachandra, H L PES University Center for Cloud Computing and Big Data Dept of Computer Science and Engineering Bangalore India

ISBN: (纸本)9781728185835

The exponential surge in digital usage is resulting in a significant need for computational resources. This has led to businesses migrating to the cloud for benefits like usage of resources as a service, scalability, etc. Infrastructures supporting these businesses will need to conserve energy in the context of the ever-increasing size of the data centers and provide a highly available environment with mechanisms for business continuity, disaster recovery, etc. These would need to be supported at minimal costs while meeting the expected performance along with conformance to the SLAs. This paper considers a cost-efficient resource reservation based environment and evolves an approach to perform energy-efficient VM scheduling with migrations, while factoring in the network Overheads, having Availability as a constraint, and orchestrating the devices in terms of Dynamic Voltage Frequency Scaling, for optimal energy usage. Two novel algorithms are proposed: the Power and Availability Aware Best Fit Decreasing (PAABFD) allocation policy and the Power Availability Network DVFS Aware (PANDA) migration policy, when combined achieving up to 82.35% improvement in data center energy while offering an availability of 99.999% when compared with other scheduling policies. © 2021 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Plausible Heterogeneous Graph k-Anonymization for Social Networks

引用

Tsinghua science and Technology 2022年第6期27卷 912-924页

作者： Kaiyang Li Ling Tian Xu Zheng Bei Hui School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China School of Information and Software Engineering University of Electronic Science and Technology of ChinaChengdu 610054China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu 610000China

The inefficient utilization of ubiquitous graph data with combinatorial structures necessitates graph embedding methods,aiming at learning a continuous vector space for the graph which is amenable to be adopted in traditional machine learning algorithms in favor of vector *** embedding methods build an important bridge between social network analysis and data analytics as social networks naturally generate an unprecedented volume of graph data *** social network data not only bring benefit for public health,disaster response,commercial promotion,and many other applications,but also give birth to threats that jeopardize each individual’s privacy and ***,most existing works in publishing social graph embedding data only focus on preserving social graph structure with less attention paid to the privacy issues inherited from social *** be specific,attackers can infer the presence of a sensitive relationship between two individuals by training a predictive model with the exposed social network *** this paper,we propose a novel link-privacy preserved graph embedding framework using adversarial learning,which can reduce adversary’s prediction accuracy on sensitive links while persevering sufficient non-sensitive information such as graph topology and node attributes in graph *** experiments are conducted to evaluate the proposed framework using ground truth social network datasets.

关键词： social network graph embedding privacy preservation adversarial learning

来源：评论

学校读者我要写书评

暂无评论

A Reduced State Space Generation Method for Concurrent Systems Based on CPN-PR Model

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2328-2342页

作者： Zhong, Wenjie Sun, Tao Zhou, Jian-Tao Wang, Zhuowei Song, Xiaoyu Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot010000 China Guangdong University of Technology School of Computer Science and Technology Guangzhou China Portland State University Department of Electrical and Computer Engineering PortlandOR97207 United States

Colored Petri Nets (CPNs) provide descriptions of the concurrent behaviors for software and hardware. Model checking based on CPNs is an effective method to simulate and verify the concurrent behavior in system design. However, the model checking method traverses the full state space, which suffers from the state space explosion problem. A reduced state space generation method related to the property of concurrent systems is proposed. Specifically, we extend CPNs to define a property-related model (CPN-PR) and give a property-related analysis method whose results can be used to generate the CPN-PR model. A reduced state space generation method is developed based on enabled binding element filtering rules. The stutter trace equivalence between the state spaces of CPN and CPN-PR has been proven by showing that the reduced state space may not change the model checking result. A comparison experiment is conducted to demonstrate the effectiveness of our method. © 1982-2012 IEEE.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：