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

2024 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2024

作者： Ishimizu, Yusei Li, Jialong Yamauchi, Takuto Chen, Sinan Cai, Jinyu Hirano, Takanori Tei, Kenji School of Computing Tokyo Institute of Technology Tokyo Japan Waseda University Department of Computer Science and Engineering Tokyo Japan Kobe University Center of Mathematical and Data Sciences Kobe Japan

ISBN: (纸本)9798331530839

Discrete Controller Synthesis (DCS) is an automated generation technique to generate controllers from environment models and requirements. The time and space complexities of DCS are critical because they directly govern the feasibility of using DCS for real-time generation of controllers to cope with environmental changes. Stepwise DCS is considered a promising approach to prevent the construction of ineffective state spaces in the subsequent analysis of the full controller by analyzing sub-controllers that meet part of the requirements at an early stage. However, constructing a stepwise policy is a challenge, as the current methods often require domain experts to manually build it by understanding and reasoning the semantics of each sub-environment model and sub-requirement. To reduce the effort of manual construction, this paper introduces a method that leverages large language models (LLMs) to automate the generation of stepwise policies by utilizing the LLM's ability to understand and reason about the semantics of state machines. The evaluation using GPT-4 on a drone control scenario demonstrates the effectiveness of our method, with an average reduction of 82.2% in states and 91.2% in transitions. © 2024 IEEE.

关键词： Control system synthesis

来源：评论

学校读者我要写书评

暂无评论

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

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 5793-5807页

作者： 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

来源：评论

学校读者我要写书评

暂无评论

QoS-aware Dynamic Service Caching and Updating in Cost-efficient Multi-Access Edge computing 22

QoS-aware Dynamic Service Caching and Updating in Cost-effic...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Lu, Shuaibing Jin, Xin Wu, Jie Zhou, Shuyang Wu, Shen Yang, Jackson Yan, Ran Beijing University of Technology College of Computer Science Beijing China Temple University Center for Networked Computing United States Beijing Jiaotong University School of Software Engineering Beijing China

ISBN: (纸本)9798331509712

In the context of mobile edge computing, achieving dynamic service caching and updating to guarantee the QoS of users and reduce system costs is a challenging problem. However, existing research still has certain deficiencies in considering the dynamic behavior of users and the limited storage resources of edge servers. To address this problem, this paper proposes three novel strategies for the different stages of service caching and updating to jointly optimize the delay and cost. At the initial service caching stage, we propose a caching strategy based on dynamic programming, taking into account the constraint of limited memory resources. Given the dynamic behavior of users, we formulate the joint optimization problem as a Markov Decision Process (MDP) and design a service extension strategy based on Q-learning at the service updating decision-making stage and a replacement strategy taking both the distribution of service replications and service access frequency into account at the service updating replacement stage to guarantee the QoS of users. We effectively tackle the challenges arising from the dynamic behavior of users and limited storage resources. Through extensive comparative experiments, our approach outperforms traditional strategies by significantly reducing user latency and system cost. © 2024 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

Task Separation and Knowledge Sharing for Class Incremental Learning 5

Task Separation and Knowledge Sharing for Class Incremental ...

引用

5th International Conference on Intelligent computing and Human-computer Interaction, ICHCI 2024

作者： Zhang, Jiali Qiao, Xiaoyan School of Computer Science and Technology Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China School of Mathematics and Information Science Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China

ISBN: (纸本)9798350368284

Methods based on dynamically expanding architectures can effectively mitigate catastrophic forgetting in class incremental learning (CIL), but they often overlook information sharing and integration between subnetworks, leading to performance degradation and increased parameter count and memory consumption as the network expands. To address these complex issues, we introduce a new method called Task Separation and Knowledge Sharing (TSKS), which transfers knowledge at both the logical and feature levels through Hybrid Knowledge Distillation (HKD). In logical distillation, we combine Global Knowledge Distillation (GKD) and Task Knowledge Distillation (TKD) to establish connections between tasks. To prevent the model from favoring new classes, we design an Attention- Based Feature Fusion (ABFF) mechanism to capture important features. Additionally, we introduce a Soft-Margin Auxiliary Loss (SMAL) to help the model learn new concepts. Extensive experiments show that TSKS outperforms existing models on CIFAR100 and ImageNet100, regardless of whether memory samples are used. Notably, TSKS demonstrates superior performance in memory-free settings, indicating a reduced reliance on rehearsal memory. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Sentiment classification of MOOC courses by merging local context focus and Bi-directional gated recurrent unit 4

Sentiment classification of MOOC courses by merging local co...

引用

4th International Conference on computer Vision, Application, and Algorithm, CVAA 2024

作者： Jin, Jiayong Dong, Yongquan He, Bugui Zhou, Nan Yan, Linke School of Computer Science and Technology Jiangsu Normal University Jiangsu Xuzhou221116 China Xuzhou Cloud Computing Engineering Technology Research Center Jiangsu Xuzhou221116 China Jiangsu Engineering Technology Research Center of ICT in Education Jiangsu Xuzhou221116 China

ISBN: (数字)9781510687622

ISBN: (纸本)9781510687615

Existing MOOC review sentiment classification methods do not fully utilize the local context information associated with aspect, and they ignore the connection between local and global contexts, while resulting in modeled features that lack the information connection between aspect and contexts. In this paper, we propose a model that incorporates Local Context Focus (LCF) and Bi-Directional Gated Recurrent Unit (Bi-GRU). First, the BERT model is used to dynamically encode course reviews. Then, global semantic features are extracted using the Bi-GRU model to strengthen the connection between the preceding and following texts. Then, the LCF model based on multi-head self-attention is used to obtain local contextual features and splice them with global semantic features. Finally, the Softmax function is utilized to output the classification results. The experimental accuracies of the proposed model on the three MOOC course review datasets reach 97.96%, 96.76%, and 94.16%, respectively, which are improved by 0.70%, 0.42%, and 0.03% over the suboptimal baseline model. The proposed model significantly improves the effectiveness of MOOC course review sentiment classification, and provides a useful reference for the optimization and improvement of MOOC courses. © 2025 SPIE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Continuous Verification of Catastrophic Recalling in Machine Unlearning via Adversarial Testing 9

Continuous Verification of Catastrophic Recalling in Machine...

引用

9th IEEE International Conference on Data science in Cyberspace, DSC 2024

作者： Qu, Y. Neil Ji, Zonghao Cui, Lei Zhang, Chong Liu, Lei Tian, Zhiyi Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250031 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250031 China Deakin University School of IT VIC3125 Australia Xidian University Guangzhou Institute of Technology Guangzhou510555 China University of Technology School of Computer Science SydneyNSW2007 Australia

ISBN: (纸本)9798350391367

Throughout the process of machine unlearning, in order to fulfill the requirements of machine unlearning and to comply with the rules of the right to be forgotten, it is natural to verify whether the unlearning model actually removes data points. Therefore, machine unlearning verification plays a crucial role. However, existing validation methods only perform one validation, and it is still challenging to determine whether subsequent updates of the model still maintain the unlearning effect. To address this challenge, we propose a novel continuous verification of catastrophic recalling in machine unlearning framework that aims to continuously evaluate whether a machine learning model effectively forgets specified data after an update. In this work, we first introduce adversarial testing as a crucial part of the overall framework. Verification then continues as the unlearned model is updated (adding or continuing to forget data points). We also analyzed the possibility that learning new data after unlearning may diminish the effect. Overall, our continuous unlearning verification framework provides a proactive approach to protecting individual privacy in the machine learning domain, thus facilitating the generation of more robust unlearning algorithms. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Aggregation of Antagonistic Contingent Preferences: When Is It Possible?

arXiv

引用

arXiv 2024年

作者： Deng, Xiaotie Tao, Biaoshuai Wang, Ying Center on Frontiers of Computing Studies School of Computer Science Peking University Beijing China John Hopcroft Center for Computer Science School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai China

We study a two-alternative voting game where voters’ preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can collaborate in a group and have antagonistic preferences—given the revealed world state, voters will support different alternatives. We identify sharp thresholds for the fraction of the majority-type voters necessary for preference aggregation. We specifically examine the majority vote mechanism (where each voter has one vote, and the alternative with more votes wins) and pinpoint a critical threshold, denoted as θmaj, for the majority-type proportion. When the fraction of majority-type voters surpasses θmaj, there is a symmetric strategy for the majority-type that leads to strategic equilibria favoring informed majority decisions. Conversely, when the majority-type proportion falls below θmaj, equilibrium does not exist, rendering the aggregation of informed majority decisions impossible. Additionally, we propose an easy-to-implement mechanism that establishes a lower threshold θ∗ (with θ∗ ≤ θmaj) for both equilibria and informed majority decision aggregation. We demonstrate that θ∗ is optimal by proving a general impossibility result: if the majority-type proportion is below θ∗, with mild assumptions, no mechanism can aggregate the preferences, meaning that no equilibrium leads to the informed majority decision for any mechanism. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Leveraging Deep Learning for Precise Chronic Bronchitis Identification in X-Ray Modalities

引用

computers, Materials & Continua 2025年第4期83卷 381-405页

作者： Fahad Ahmad Saad Awadh Alanazi Kashaf Junaid Maryam Shabbir Asim Ali School of Computing Faculty of TechnologyUniversity of PortsmouthWinston Churchill Ave SouthseaPortsmouthPO12UPUK Portsmouth Artificial Intelligence and Data Science Center University of PortsmouthWinston Churchill AveSouthseaPortsmouthPO12UPUK Department of Computer Science College of Computer and Information SciencesJouf UniversitySakakaAljouf72341Saudi Arabia School of Biological and Behavioural Sciences Queen Mary University of LondonLondonE14NSUK Department of Computer Sciences Bahria UniversityLahorePunjab54700Pakistan

Image processing plays a vital role in various fields such as autonomous systems,healthcare,and cataloging,especially when integrated with deep learning(DL).It is crucial in medical diagnostics,including the early detection of diseases like chronic obstructive pulmonary disease(COPD),which claimed 3.2 million lives in ***,a life-threatening condition often caused by prolonged exposure to lung irritants and smoking,progresses through *** diagnosis through image processing can significantly improve survival *** encompasses chronic bronchitis(CB)and emphysema;CB particularly increases in smokers and generally affects individuals between 50 and 70 years *** damages the lungs’air sacs,reducing oxygen transport and causing symptoms like coughing and shortness of *** such as beta-agonists and inhaled steroids are used to manage symptoms and prolong lung ***,COVID-19 poses an additional risk to individuals with CB due to its impact on the respiratory *** proposed system utilizes convolutional neural networks(CNN)to diagnose *** this system,CNN extracts essential and significant features from X-ray modalities,which are then fed into the neural *** network undergoes training to recognize patterns and make accurate predictions based on the learned *** leveraging DL techniques,the system aims to enhance the precision and reliability of CB *** research specifically focuses on a subset of 189 lung disease images,carefully selected for model *** further refine the training process,various data augmentation and noise removal techniques are *** techniques significantly enhance the quality of the training data,improving the model’s robustness and *** a result,the diagnostic accuracy has improved from 98.6%to 99.2%.This advancement not only validates the efficacy of our proposed model but also represents a significant improvement over existing *** h

关键词： Deep learning chronic obstructive pulmonary disease chronic bronchitis convolutional neural network X-ray images

来源：评论

学校读者我要写书评

暂无评论

Cluster-Phys: Facial Clues Clustering Towards Efficient Remote Physiological Measurement 24

Cluster-Phys: Facial Clues Clustering Towards Efficient Remo...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Qia, Nwei Li, Kun Guo, Dan Hu, Bin Wang, Meng School of Computer Science and Information Engineering School of Artificial Intelligence Hefei University of Technology Hefei China CCAI Zhejiang University Hangzhou China Hefei Comprehensive National Science Center Hefei China Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China

ISBN: (纸本)9798400706868

Remote photoplethysmography (rPPG) measurement aims to estimate physiological signals by analyzing subtle skin color changes induced by heartbeats in facial videos. Existing methods primarily rely on the fundamental video frame features or vanilla facial ROI (region of interest) features. Recognizing the varying light absorption and reactions of different facial regions over time, we adopt a new perspective to conduct a more fine-grained exploration of the key clues present in different facial regions within each frame and across temporal frames. Concretely, we propose a novel clustering-driven remote physiological measurement framework called Cluster-Phys, which employs a facial ROI prototypical clustering module to adaptively cluster the representative facial ROI features as facial prototypes and then update facial prototypes with highly semantic correlated base ROI features. In this way, our approach can mine facial clues from a more compact and informative prototype level rather than the conventional video/ROI level. Furthermore, we also propose a spatial-temporal prototype interaction module to learn facial prototype correlation from both spatial (across prototypes) and temporal (within prototype) perspectives. Extensive experiments are conducted on both intra-dataset and cross-dataset tests. The results show that our Cluster-Phys achieves significant performance improvement with less computation consumption. The source code will be available at https://***/VUT-HFUT/ClusterPhys. © 2024 ACM.

关键词： Photoplethysmography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：