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

HealthEdge: A Machine Learning-Based Smart Healthcare Framework for Prediction of Type 2 Diabetes in an Integrated IoT, Edge, and cloud computing System

引用

Procedia Computer Science 2023年 220卷 331-338页

作者： Alain Hennebelle Huned Materwala Leila Ismail Independent Researcher 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 United Arab Emirates National Water and Energy Center United Arab Emirates University United Arab Emirates Cloud Computing and Distributed Systems (CLOUDS) Lab School of Computing and Information Systems The University of Melbourne Australia

Diabetes Mellitus has no permanent cure to date and is one of the leading causes of death globally. The alarming increase in diabetes calls for the need to take precautionary measures to avoid/predict the occurrence of diabetes. This paper proposes HealthEdge, a machine learning-based smart healthcare framework for type 2 diabetes prediction in an integrated IoT-edge-cloud computing system. Numerical experiments and comparative analysis were carried out between the two most used machine learning algorithms in the literature, Random Forest (RF) and Logistic Regression (LR), using two real-life diabetes datasets. The results show that RF predicts diabetes with 6% more accuracy on average compared to LR.

关键词： Artificial Intelligence (AI) cloud computing Diagnosis Digital Health Edge computing eHealth Internet of Things (IoT) Logisitic Regression Machine Learning Prognosis Random Forest Risk Factors Smart Connected Healthcare Type 2 Diabetes Mellitus

来源：评论

学校读者我要写书评

暂无评论

MUT: Human-in-the-Loop Unit Test Migration 24

MUT: Human-in-the-Loop Unit Test Migration

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Gao, Yi Hu, Xing Xu, Tongtong Xia, Xin Lo, David Yang, Xiaohu Zhejiang University The State Key Laboratory of Blockchain and Data Security Hangzhou China Huawei Hangzhou China School of Computing and Information Systems Singapore Management University Hangzhou China

ISBN: (纸本)9798400702174

Test migration, which enables the reuse of test cases crafted with knowledge and creativity by testers across various platforms and programming languages, has exhibited effectiveness in mobile app testing. However, unit test migration at the source code level has not garnered adequate attention and exploration. In this paper, we propose a novel cross-language and cross-platform test migration methodology, named MUT, which consists of four modules: code mapping, test case filtering, test case translation, and test case adaptation. MUT initially calculates code mappings to establish associations between source and target projects, and identifies suitable unit tests for migration from the source project. Then, MUT's code translation component generates a syntax tree by parsing the code to be migrated and progressively converts each node in the tree, ultima tely generating the target tests, which are compiled and executed in the target project. Moreover, we develop a web tool to assist developers in test migration. The effectiveness of our approach has been validated on five prevalent functional domain projects within the open-source community. We migrate a total of 550 unit tests and submitted pull requests to augment test code in the target projects on GitHub. By the time of this paper submission, 253 of these tests have already been merged into the projects (including 197 unit tests in the Luliyucoordinate-LeetCode project and 56 unit tests in the Rangerlee-HtmlParser project). Through running these tests, we identify 5 bugs, and 2 functional defects, and submitted corresponding issues to the project. The evaluation substantiates that MUT's test migration is both viable and beneficial across programming languages and different projects. © 2024 ACM.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

Investigating the Performance of ECA-YOLOv5n Model for Appearance Quality Detection in Air Conditioner External Units 18

Investigating the Performance of ECA-YOLOv5n Model for Appea...

引用

18th IEEE Conference on Industrial Electronics and Applications, ICIEA 2023

作者： Guo, Zihao Li, Dongyang Yuan, Dongfeng University of Melbourne School of Computing and Information Systems Melbourne Australia Shandong University Shandong Key Laboratory of Wireless Communication Technologies Jinan China

ISBN: (纸本)9798350312201

In an era of rapid technological advancements, keeping up with the iterative updates of factory technology in Intelligent manufacturing presents a daunting challenge. Against this backdrop, this paper investigates the performance of the ECA-YOLOv5n model, a novel approach for appearance quality detection in air conditioner external units. Building upon an open-source dataset, ECA-YOLOv5n model integrates the ECA-Net attention mechanism into the YOLOv5-nano model. ECA-Net effectively captures channel-wise dependencies and studies discriminative features, allowing for seamless integration into the convolutional neural networks of the YOLOv5 architecture without the need for extensive modifications. Furthermore, the efficient channel attention mechanism of ECA-Net demands fewer parameters and computations in comparison to other attention mechanisms, conferring a significant advantage in terms of computational efficiency. Experimental results show that the newly proposed model achieves approximately 98% precision, 99% recall, and 99% mAP on the dataset. The ECA-YOLOv5n model reduces storage usage and minorly increases detection speed in comparison to other YOLO models. © 2023 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Continuous Sub-prevalent Co-location Pattern Mining 4th

Continuous Sub-prevalent Co-location Pattern Mining

引用

4th International Conference on Spatial Data and Intelligence, SpatialDI 2023

作者： Wang, Qilong Chen, Hongmei Wang, Lizhen School of Information Science and Engineering Yunnan University Kunming China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Kunming China

ISBN: (纸本)9783031329098

Spatial co-location pattern represents a subset of spatial features whose instances are frequently located together in space. Sub-prevalent co-location pattern mining discovers patterns with richer spatial relationships based on star instance model instead of clique instance model. Further, discovering spatiotemporal sub-prevalent co-location pattern is important to reveal the spatiotemporal interaction between spatial features and promote the application of patterns. However, the methods for mining spatiotemporal sub-prevalent co-location pattern measure the interestingness of patterns by the frequency of patterns in time slice set, and ignore the duration of patterns which is an important spatiotemproal information in patterns. Thus, this paper presents mining spatiotemporal sub-prevalent co-location pattern by considering the duration and the frequency of patterns. Specifically, a novel pattern, is proposed by defining the continuous sub-prevalent index. Then, an efficient algorithm is designed to mine the proposed patterns by utilizing the anti-monotonicity of continuous sub-prevalent index to prune unpromising patterns. Extensive experiments on synthetic and real datasets verify the practicability of the proposed patterns and the effectiveness of the proposed algorithm. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Efficient Inference of Markov Logic Network for Link Prediction 12

Efficient Inference of Markov Logic Network for Link Predict...

引用

12th IEEE Global Conference on Consumer Electronics, GCCE 2023

作者： Li, Zhongbin Duan, Liang Yue, Kun Yunnan University School of Information Science and Engineering Kunming China Yunnan University Yunnan Key Laboratory of Intelligent Systems and Computing Kunming China

ISBN: (纸本)9798350340181

Link prediction has achieved great success on ubiquitous graph-based applications, which usually contain multiple types of connections. The heterogeneity of networks introduces complexities in two aspects: representation of multiple types of links, and incorporation of domain knowledge. In this paper, we construct Markov logic network (MLN) to preserve he logical information of graphs for link prediction tasks. By using the graph neural network, we propose a novel inference method in MLNs to guarantee the scalability of link prediction. Experimental results on various datasets show that our proposed method outperforms the state-of-the-art competitors on precision and efficiency. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

RNTrajRec: Road Network Enhanced Trajectory Recovery with Spatial-Temporal Transformer 39

RNTrajRec: Road Network Enhanced Trajectory Recovery with Sp...

引用

39th IEEE International Conference on Data Engineering, ICDE 2023

作者： Chen, Yuqi Zhang, Hanyuan Sun, Weiwei Zheng, Baihua Fudan University School of Computer Science Shanghai Key Laboratory of Data Science China Shanghai Institute of Intelligent Electronics & Systems China Singapore Management University School of Computing and Information Systems Singapore

ISBN: (纸本)9798350322279

GPS trajectories are the essential foundations for many trajectory-based applications. Most applications require a large number of high sample rate trajectories to achieve a good performance. However, many real-life trajectories are collected with low sample rate due to energy concern or other constraints. We study the task of trajectory recovery in this paper as a means to increase the sample rate of low sample trajectories. Most existing works on trajectory recovery follow a sequence-to-sequence diagram, with an encoder to encode a trajectory and a decoder to recover real GPS points in the trajectory. However, these works ignore the topology of road network and only use grid information or raw GPS points as input. Therefore, the encoder model is not able to capture rich spatial information of the GPS points along the trajectory, making the prediction less accurate and less spatial consistent. In this paper, we propose a road network enhanced transformer-based framework, namely RNTrajRec, for trajectory recovery. RNTrajRec first uses a graph model, namely GridGNN, to learn the embedding features of each road segment. It next develops a spatial-temporal transformer model, namely GPSFormer, to learn rich spatial and temporal features along with a Sub-Graph Generation module to capture the spatial features for each GPS point in the trajectory. It finally forwards the outputs of encoder model to a multi-task decoder model to recover the missing GPS points. Extensive experiments based on three large-scale real-life trajectory datasets confirm the effectiveness of our approach. © 2023 IEEE.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Structural Entropy Based Graph Node Classification 12

Structural Entropy Based Graph Node Classification

引用

12th IEEE Global Conference on Consumer Electronics, GCCE 2023

作者： Zhang, Jun Yue, Kun School of Information Science and Engineering Yunnan University Kunming China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Kunming China

ISBN: (纸本)9798350340181

Node classification is to predict the labels of the unlabeled nodes in a graph, which is useful for various applications of social network and biological information analysis. To measure the uncertainty of structural information, we propose the structural entropy theory based method for graph node classification. First, we calculate the structural entropy of different graph structures, since the smaller the structural entropy, the less the uncertainty of the structural relationship in the graph. Then, we use the minimal structural entropy to determine the uncertainty of graphical structures. Finally, the nodes with similar structural relationships in the graph are classified. Experimental results show that our method outperforms some state-of-the-art competitors. © 2023 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

A Method for Measuring Node Similarity in Heterogeneous information Networks 9

A Method for Measuring Node Similarity in Heterogeneous Info...

引用

9th International Conference on Fuzzy systems and Data Mining, FSDM 2023

作者： Zhan, Liudi Chen, Hongmei Zhou, Lihua Xiao, Qing School of Information Science and Engineering Yunnan University Kunming China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Kunming China

ISBN: (纸本)9781643684703

Meta-path-based methods for measuring the similarities between nodes in Heterogeneous information Networks (HINs) have attracted attention from researchers due to excellent performance. However, these methods suffer from some issues: (1) it is difficult for users to provide effective meta-paths of complex HINs;(2) it is inefficient to enumerate all instances of meta-paths. In order to solve the above issues, this paper proposes a novel method, K-order Neighbors based Heterogeneous Graph Neural Network (KN-HGNN), for measuring node similarity. Firstly, KN-HGNN generates meta-paths based on network schema. Then, KN-HGNN obtains the features of nodes by aggregating itself type feature and its k-order neighbors' type features under the constraints of meta-paths. Finally, KN-HGNN calculates the similarities between nodes based on the features of nodes. The experimental results on real datasets show that KN-HGNN outperforms the baselines. © 2023 The authors and IOS Press.

关键词： information services

来源：评论

学校读者我要写书评

暂无评论

Deep reinforcement learning-based algorithms selectors for the resource scheduling in hierarchical cloud computing

引用

Journal of Network and Computer Applications 2022年第0期208卷

作者： Zhou, Guangyao Wen, Ruiming Tian, Wenhong Buyya, Rajkumar School of Information and Software Engineering University of Electronic Science and Technology of China China Cloud Computing and Distributed Systems Lab School of Computing and Information Systems The University of Melbourne Australia

cloud computing environment is becoming increasingly complex due to its large-scale information growth and increasing heterogeneity of computing resources. Hierarchical cloud computing dividing the system into multi-levels with multiple subsystems to support the adaptability to abundant requests from users has been widely applied and brings great challenges to resource scheduling. It is critical to find an effective way to address the complex scheduling problems in hierarchical cloud computing, whose scenarios and optimization objectives often change with the types of subsystems. In this paper, we propose a scheduling framework to select the scheduling algorithms (SFSSA) for different scheduling scenarios considering no algorithm well suitable to all scenarios. To concretize SFSSA, we propose deep learning-based algorithms selectors (DLS) trained by labeled data and deep reinforcement learning-based algorithms selectors (DRLS) trained by feedback from dynamic scenarios to complete the algorithms selection regarding the scheduling algorithms as selectable tools. Then, we apply strategies including pre-trained model, long experience reply and joint training to improve the performance of DRLS. To enable the quantitative comparison of selectors, we introduce a weighted cost model for the trade-off between solution and complexity. Through multiple sets of experiments in hierarchical cloud computing with multi subsystems for five types of scheduling problems and varying weights of cost, we demonstrate DLS and DRLS outperform baseline strategies. Compared with random selector, greedy selector, round-robin selector, single best selector, virtual best selector and single fast selector, DLS reduces the cost by 47.4%, 46.1%, 33.9%, 47.9%, 19.3%, 18.8% under stable parameter ranges, and DRLS reduces the cost by 41.1%, 40.6%, 11.7%, 42.3%, 11.5%, 12.5% in dynamic scenarios respectively. In experiments, we also validate DRLS has stronger adaptability than DLS in dynamic schedulin

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

TF-DDRL: A Transformer-enhanced distributed DRL Technique for Scheduling IoT Applications in Edge and cloud computing Environments

arXiv

引用

arXiv 2024年

作者： Wang, Zhiyu Goudarzi, Mohammad Buyya, Rajkumar Laboratory School of Computing and Information Systems The University of Melbourne Australia Australia

With the continuous increase of IoT applications, their effective scheduling in edge and cloud computing has become a critical challenge. The inherent dynamism and stochastic characteristics of edge and cloud computing, along with IoT applications, necessitate solutions that are highly adaptive. Currently, several centralized Deep Reinforcement Learning (DRL) techniques are adapted to address the scheduling problem. However, they require a large amount of experience and training time to reach a suitable solution. Moreover, many IoT applications contain multiple interdependent tasks, imposing additional constraints on the scheduling problem. To overcome these challenges, we propose a Transformer-enhanced distributed DRL scheduling technique, called TF-DDRL, to adaptively schedule heterogeneous IoT applications. This technique follows the Actor-Critic architecture, scales efficiently to multiple distributed servers, and employs an off-policy correction method to stabilize the training process. In addition, Prioritized Experience Replay (PER) and Transformer techniques are introduced to reduce exploration costs and capture long-term dependencies for faster convergence. Extensive results of practical experiments show that TF-DDRL, compared to its counterparts, significantly reduces response time, energy consumption, monetary cost, and weighted cost by up to 60%, 51%, 56%, and 58%, respectively. © 2024, CC BY.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：