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

ILRM: Imitation Learning-Based Resource Management for Integrated CPU–GPU Edge Systems With Renewable Energy Sources

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第6期44卷 2392-2397页

作者： Hou, Xiangpeng Zhou, Junlong Li, Liying Zhao, Mingzhou Cong, Peijin Wu, Zebin Hu, Shiyan Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China Southeast University National Mobile Communications Research Laboratory Nanjing211111 China University of Hong Kong Department of Data and Systems Engineering Hong Kong Hong Kong

This letter focuses on integrated CPU-GPU edge systems with renewable energy sources and studies the resource management problem to minimize the energy consumption of real-time tasks while ensuring temperature and reliability constraints. We propose an imitation learning (IL)-based resource management scheme, ILRM, implemented in two phases: 1) offline Oracle generation and 2) online IL. In the offline phase, we design a fast-converging heuristic to generate near-optimal solutions (i.e., Oracles) for training an online prediction model. In the online phase, we realize IL using the trained model that predicts the resource configuration policies for the incoming task sets to be scheduled. A data aggregation method is also developed to enhance the robustness of the prediction model. We validate ILRM through extensive experiments on both simulated and real integrated CPU-GPU edge platforms. © 1982-2012 IEEE.

关键词： Graphics processing units Reliability Central Processing Unit Renewable energy sources Real-time systems Integrated circuit modeling Imitation learning Generators Energy consumption Edge computing

来源：评论

学校读者我要写书评

暂无评论

Don’t Ignore the Drive of Curiosity: Rethinking Subtleties Between Universality of Commonsense Knowledge and Excellence of Large Language Models

引用

SN computer science 2024年第6期5卷 798页

作者： Wang, Chao Chen, Tao Liu, Jingping School of Future Technology Shanghai University Shanghai China Institute of Artificial Intelligence Shanghai University Shanghai China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China School of Information Science and Engineering East China University of Science and Technology Shanghai China

Commonsense reasoning is one of the abilities necessary for artificial intelligence to be as intelligent as humans. However, how to make AI understand commonsense has been a problem that has plagued artificial intelligence for more than 60 years. Existing efforts focus more on the means of knowledge acquisition and strive to enrich the capacity of commonsense knowledge (CSK) bases and dimensions of CSK through advanced methods. Unfortunately, this exuberance has obscured a general consideration of CSK, such as how to follow human habits to obtain the most representative knowledge we need to understand the world. In this paper, this representative knowledge is referred to as core CSK. The influence of core CSK is extensive, and it constitutes almost the fundamental element of human life and the most fundamental cognition of the world. Harnessing human curiosity to find solutions to the above problems is an effective and straightforward route. Specifically, we focus on a special corpus to mine core CSK, namely, why-questions. For example, we can harvest “the sky is blue” from “why is the sky blue?”. To this end, we propose a novel method to extract CSK from why-questions, which mainly consist of two modules. The first is a question classification module used to determine whether a question contains CSK. In this module, we propose a classifier based on a one-sided bootstrapping method and design several informative features for the classifier. The second is a crowdsourcing module used to improve the quality of the extracted commonsense. We conduct extensive experiments, and the experimental results show that our method effectively mines CSK from question corpora. Furthermore, statistical analysis demonstrates the feasibility of this curiosity-driven approach, implying that we provide a basic idea for collecting core CSK. Remarkably, today’s outstanding large language models do not have such simple knowledge summarization capabilities, demonstrating the barrier between

关键词： Classification Core Commonsense knowledge Crowdsourcing Curiosity Psychologically

来源：评论

学校读者我要写书评

暂无评论

Modelling High-Order Social Relations for Item Recommendation (Extended Abstract) 39

Modelling High-Order Social Relations for Item Recommendatio...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Liu, Yang Chen, Liang He, Xiangnan Peng, Jiaying Zheng, Zibin Tang, Jie Sun Yat-sen University School of Computer Science and Engineering Guangzhou China University of Science and Technology of China School of Data Science School of Information Science and Technology Hefei China Tsinghua University Department of Computer Science and Technology Beijing China

ISBN: (纸本)9798350322279

Personalized recommendation is becoming increasingly important in online information systems in the current era of information explosion. In real-world scenarios, when a user considers which items to consume, the decision choice may be affected by her friends. For example, she may ask her friends for suggestions or be attracted by products purchased by one friend. As such, to provide satisfactory recommendation service, it is important to account for the evidence in social relations when they are available to use. Several prior efforts have been made to leverage social relations to build the recommender system and verified their utility. However, most existing methods, such as the well-known TrustSVD, leverage only first-order social relations, i.e., the direct neighbors that are connected to the target user. The high-order social relations, e.g., the friends of friends, which are very informative to reveal user preference, have been largely ignored. © 2023 IEEE.

关键词： Online systems

来源：评论

学校读者我要写书评

暂无评论

A Prediction-Based Multi-Objective VM Consolidation Approach for Cloud data Centers

引用

computers, Materials & Continua 2024年第7期80卷 1601-1631页

作者： Xialin Liu Junsheng Wu Lijun Chen Jiyuan Hu School of Computer Science Northwestern Polytechnical UniversityXi’an710005China School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’an710021China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an University of Posts and TelecommunicationsXi’an710021China School of Software and Microelectronics Northwestern Polytechnical UniversityXi’an710005China School of Automation Xi’an University of Posts and TelecommunicationsXi’an710021China

Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource *** paper proposes a prediction-basedmulti-objective VMconsolidation approach to search for the best mapping between VMs and PMs with good timeliness and practical *** use a hybrid model based on Auto-Regressive Integrated Moving Average(ARIMA)and Support Vector Regression(SVR)(HPAS)as a prediction model and consolidate VMs to PMs based on prediction results by HPAS,aiming at minimizing the total EC,performance degradation(PD),migration cost(MC)and resource wastage(RW)*** results usingMicrosoft Azure trace show the proposed approach has better prediction accuracy and overcomes the multi-objective consolidation approach without prediction(i.e.,Non-dominated sorting genetic algorithm 2,Nsga2)and the renowned Overload Host Detection(OHD)approaches without prediction,such as Linear Regression(LR),Median Absolute Deviation(MAD)and Inter-Quartile Range(IQR).

关键词： VM consolidation prediction multi-objective optimization machine learning

来源：评论

学校读者我要写书评

暂无评论

Revolutionizing Influenza A Detection in Humans: Unleashing the Power of XGBoost Classification 2

Revolutionizing Influenza A Detection in Humans: Unleashing ...

引用

2nd IEEE International Conference for Women in Innovation, Technology and Entrepreneurship, ICWITE 2024

作者： Nikhil, V. Sahaaya Arul Mary, S.A. Natarajan, B. Bajulunisha, A. Anuradha, R.S. Venkatraman, K. Chennai India Vellore Institute of Technology School of Computer Science and Engineering Vellore India VIT University School of Computer Science Engineering Chennai India M.A.M College of Engineering and Technology Department of Artificial Intelligence & Data Science Tiruchirappalli621105 India Panimalar Engineering College Department of Artificial Intelligence & Data Science Chennai India

ISBN: (纸本)9798350383287

Influenza A, a zoonotic virus potentially affecting and infecting humans, poses a significant global health threat. This research paper presents a comprehensive study on predicting Influenza A outbreaks by applying the XGBoost classification algorithm. The study utilizes two substantial datasets: one from the World Health Organization (WHO) containing global Influenza A epidemiological data from 2003 to 2023 and the other encompassing Influenza A infections in New York counties from 2009 to 2019. Both datasets underwent pre-processing, with essential features selected to develop an XGBoost Classification model for forecasting Influenza A cases in humans. The models exhibited impressive accuracy and performance metrics. Specifically, the WHO dataset demonstrated an AUC of 0.996 and an accuracy score of 0.99, while the New York dataset displayed an AUC of 0.992 and an accuracy score of 0.978. These outcomes underscore the model's capability to differentiate between positive and negative cases, showcasing high precision, accuracy, and F1 scores. The implications of this research extend to various domains, including the early detection of outbreaks, informed decision-making processes, and the implementation of public health interventions. The findings emphasize the pivotal role of high-quality and comprehensive datasets in training effective predictive models. Furthermore, the study points towards potential future avenues, such as personalized predictions, geo-spatial analysis, and integrating these predictive models with healthcare systems. © 2024 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

SAND: semi-automated adaptive network defense via programmable rule generation and deployment

引用

science China(Information sciences) 2022年第7期65卷 121-138页

作者： Haoyu CHEN Deqing ZOU Hai JIN Shouhuai XU Bin YUAN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHubei Engineering Research Center on Big Data Security School of Cyber Science and EngineeringHuazhong University of Science and Technology Department of Computer Science University of Colorado at Colorado Springs

Cyber security is dynamic as defenders often need to adapt their defense postures. The state-ofthe-art is that the adaptation of network defense is done manually(i.e., tedious and error-prone). The ideal solution is to automate adaptive network defense, which is however a difficult problem. As a first step towards automation, we propose investigating how to attain semi-automated adaptive network defense(SAND). We propose an approach extending the architecture of software-defined networking, which is centered on providing defenders with the capability to program the generation and deployment of dynamic defense rules enforced by network defense tools. We present the design and implementation of SAND, as well as the evaluation of the prototype implementation. Experimental results show that SAND can achieve agile and effective dynamic adaptations of defense rules(less than 15 ms on average for each operation), while only incurring a small performance overhead.

关键词： network defense adaptive defense automated defense programmable defense security services software-defined networking security management

来源：评论

学校读者我要写书评

暂无评论

A survey on graph neural network-based next POI recommendation for smart cities

引用

Journal of Reliable Intelligent Environments 2024年第3期10卷 299-318页

作者： Yu, Jian Guo, Lucas Zhang, Jiayu Wang, Guiling Department of Computer Science and Soft Engineering Auckland University of Technology Auckland New Zealand School of Information Science and Technology Beijing Key Laboratory on Integration and Analysis of Large-Scale Stream Data North China University of Technology Beijing China

Amid the rise of mobile technologies and Location-Based Social Networks (LBSNs), there’s an escalating demand for personalized Point-of-Interest (POI) recommendations. Especially pivotal in smart cities, these systems aim to enhance user experiences by offering location recommendations tailored to past check-ins and visited POIs. Distinguishing itself from traditional POI recommendations, the next POI approach emphasizes predicting the immediate subsequent location, factoring in both geographical attributes and temporal patterns. This approach, while promising, faces with challenges like capturing evolving user preferences and navigating data biases. The introduction of Graph Neural Networks (GNNs) brings forth a transformative solution, particularly in their ability to capture high-order dependencies between POIs, understanding deeper relationships and patterns beyond immediate connections. This survey presents a comprehensive exploration of GNN-based next POI recommendation approaches, delving into their unique characteristics, inherent challenges, and potential avenues for future research. © The Author(s) 2024.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

PKEST: Public-Key Encryption With Similarity Test for Medical Consortia Cloud Computing

引用

IEEE Transactions on Cloud Computing 2025年第2期13卷 680-693页

作者： Chen, Junsong Zeng, Shengke Han, Song Yin, Jin Chen, Peng Xihua University School of Computer and Software Engineering Chengdu610039 China Hangzhou City University School of Computer and Computing Science Hangzhou310015 China Sichuan University West China Biomedical Big Data Center West China Hospital Chengdu610041 China

Cloud computing eliminates the limitations of local hardware architecture while also enabling rapid data sharing between healthcare institutions. Encryption of electronic medical records (EMRs) before uploading to cloud servers is necessary for privacy. However, encryption brings challenges for computation. Public Key Encryption with Equality Test (PKEET) allows cloud servers to test the underlying message equality without decryption. Therefore, it can be used to classify the encrypted EMRs corresponding to different medical symptoms. However, traditional PKEETs have limitations in testing the similarity between the ciphertexts. Undoubtedly, it can not handle EMR classification with similar medical symptoms efficiently. In this work, we propose a lightweight public key encryption with similarity test (PKEST) for the EMR classification shared in medical consortia. Our scheme can resist offline message recovery attacks, which may be launched by the insider manager, and the traditional paring computation is not necessary. Our experiment simulation shows that the similarity error between ciphertext and plaintext is tiny when the parameters are set properly. Compared to previous works, our scheme not only achieves the classification of similar encrypted EMRs but is also more efficient than traditional PKEETs since our construction does not need paring computation anymore. © 2013 IEEE.

关键词： Ciphertext

来源：评论

学校读者我要写书评

暂无评论

PVDM-YOLOv8l: a solution for reliable pedestrian and vehicle detection in autonomous vehicles under adverse weather conditions

引用

Multimedia Tools and Applications 2024年 1-26页

作者： Tahir, Noor Ul Ain Zhang, Zuping Asim, Muhammad Iftikhar, Sundas A. Abd El-Latif, Ahmed School of Computer Science and Engineering Central South University Changsha410083 China EIAS Data Science Lab College of Computer and Information Sciences and Center of Excellence in Quantum and Intelligent Computing Prince Sultan University Riyadh11586 Saudi Arabia Gianforte School of Computing Montana State University Bozeman59717 United States Department of Mathematics and Computer Science Faculty of Science Menoufia University Shebin El-Koom32511 Egypt

Ensuring the safe navigation of autonomous vehicles in intelligent transportation system depends on their ability to detect pedestrians and vehicles. While transformer-based models for object detection have shown remarkable advancements, accurately identifying pedestrians and vehicles in adverse weather conditions remains a challenging task. Adverse weather introduces image quality degradation, leading to issues such as low contrast, reduced visibility, blurred edges, false detection, misdetection of tiny objects, and other impediments that further complicate the accuracy of detection. This paper introduces a novel Pedestrian and Vehicle Detection Model under adverse weather conditions, denoted as PVDM-YOLOv8l. In our proposed model, we first incorporate the Swin-Transformer method, which is designed for global extraction of feature of small objects to identify in poor visibility, into the YOLOv8l backbone structure. To enhance detection accuracy and address the impact of inaccurate features on recognition performance, CBAM is integrated between the neck and head networks of YOLOv8l, aiming to gather crucial information and obtain essential data. Finally, we adopted the loss function Wise-IOU v3. This function was implemented to mitigate the adverse effects of low-quality instances by minimizing negative gradients. Additionally, we enhanced and augmented the DAWN dataset and created a custom dataset, named DAWN2024, to cater to the specific requirements of our study. To verify the superiority of PVDM-YOLOV8l, its performance was compared against several commonly used object detectors, including YOLOv3, YOLOv3-tiny, YOLOv3-spp, YOLOv5, YOLOv6, and all the versions of YOLOv8 (n, m, s, l, and x) and some traditional models. The experimental results demonstrate that our proposed model achieved a 6.6%, 5.4%, 6%, and 5.1% improvement in precision, recall, F1-score and mean Average Precision (mAP) on the custom DAWN2024 dataset. This substantial improvement in accuracy ind

关键词： Vehicle detection

来源：评论

学校读者我要写书评

暂无评论

A novel approach for calculating single-source shortest paths of weighted digraphs based on rough sets theory

引用

Mathematical Biosciences and Engineering 2024年第2期21卷 2626-2645页

作者： Hua, Mingfeng Xu, Taihua Yang, Xibei Chen, Jianjun Yang, Jie School of Computer Jiangsu University of Science and Technology Zhenjiang212100 China Key Laboratory of Oceanographic Big Data Mining Application of Zhejiang Province Zhejiang Ocean University Zhoushan316022 China School of Physics and Electronic Science Zunyi Normal University Zunyi563002 China

Calculating single-source shortest paths (SSSPs) rapidly and precisely from weighted digraphs is a crucial problem in graph theory. As a mathematical model of processing uncertain tasks, rough sets theory (RST) has been proven to possess the ability of investigating graph theory problems. Recently, some efficient RST approaches for discovering different subgraphs (e.g. strongly connected components) have been presented. This work was devoted to discovering SSSPs of weighted digraphs by aid of RST. First, SSSPs problem was probed by RST, which aimed at supporting the fundamental theory for taking RST approach to calculate SSSPs from weighted digraphs. Second, a heuristic search strategy was designed. The weights of edges can be served as heuristic information to optimize the search way of k-step R-related set, which is an RST operator. By using heuristic search strategy, some invalid searches can be avoided, thereby the efficiency of discovering SSSPs was promoted. Finally, the W3SP@R algorithm based on RST was presented to calculate SSSPs of weighted digraphs. Related experiments were implemented to verify the W3SP@R algorithm. The result exhibited that W3SP@R can precisely calculate SSSPs with competitive efficiency. © 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：