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

SSRN 2024年

作者： Jeremiah, Sekione Reward Chen, Haotian Gritzalis, Stefanos Park, Jong Hyuk Department of Electrical and Information Engineering Seoul National University of Science and Technology Seoul Korea Republic of Department of Computer Science and Engineering Seoul National University of Science and Technology Seoul Korea Republic of Department of Digital Systems University of Piraeus Piraeus18532 Greece

The increase in ransomware threats targeting Android devices necessitates the development of advanced techniques to strengthen the effectiveness of detection and prevention methods. Existing studies use Machine Learning (ML) techniques to detect and classify ransomware attacks. However, the ransomware landscape's rapid evolution hinders the effectiveness of these approaches. Moreover, the potential of Deep Reinforcement Learning (DRL) for this purpose remains unexplored. This study investigates the application of various DRL algorithms for Android ransomware detection, leveraging permissions-labeled datasets. The paper provides a detailed explanation of implementing supervised learning within a DRL context. Secondly, the challenge of devising a reward function in Android Ransomware Detection (ARD) is addressed, given the lack of an automated method for Android ransomware identification. The conventional DRL framework, which relies on the agent's interaction with a real-time environment, is conceptually modified in a novel approach. We exhaustively test the efficiency and accuracy of DRL-based models against other ML techniques. Our results show that the A2C model has a better comparable detection performance than other DRL and ML models. Moreover, when DRL models are implemented with minor parameter modifications, they expedite and improve Android ransomware detection's speed, efficiency, and accuracy relative to existing ML strategies. © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Toward Energy Efficient Multiuser IRS-Assisted URLLC systems: A Novel Rank Relaxation Method

Toward Energy Efficient Multiuser IRS-Assisted URLLC Systems...

引用

2023 IEEE Globecom Workshops, GC Wkshps 2023

作者： Jalali, Jalal Lemic, Filip Tabassum, Hina Berkvens, Rafael Famaey, Jeroen University of Antwerp - Imec IDLab Sint-Pietersvliet 7 Antwerp2000 Belgium i2Cat Foundation AI-Driven Systems Lab Barcelona Spain York University Department of Electrical Engineering and Computer Science TorontoON Canada

ISBN: (纸本)9798350370218

This paper proposes an energy efficient resource allocation design algorithm for an intelligent reflecting surface (IRS)-assisted downlink ultra-reliable low-latency communication (URLLC) network. This setup features a multi-antenna base station (BS) transmitting data traffic to a group of URLLC users with short packet lengths. We maximize the total network's energy efficiency (EE) through the optimization of active beamformers at the BS and passive beamformers (a.k.a, phase shifts) at the IRS. The main non-convex problem is divided into two sub-problems. An alternating optimization (AO) approach is then used to solve the problem. Through the use of the successive convex approximation (SCA) with a novel iterative rank relaxation method, we construct a concave-convex objective function for each sub-problem. The first sub-problem is a fractional program that is solved using the Dinkelbach method and a penalty-based approach. The second sub-problem is then solved based on semi-definite programming (SDP) and the penalty-based approach. The iterative solution gradually approaches the rank-one for both the active beamforming and unit modulus IRS phase-shift sub-problems. Our results demonstrate the efficacy of the proposed solution compared to existing benchmarks. © 2023 IEEE.

关键词： Alternating optimization (AO) intelligent re-flecting surface (IRS) semi-definite programming (SDP) ultra-reliable low-latency communication (URLLC)

来源：评论

学校读者我要写书评

暂无评论

GeoReF: Geometric Alignment Across Shape Variation for Category-level Object Pose Refinement

arXiv

引用

arXiv 2024年

作者： Zheng, Linfang Tse, Tze Ho Elden Wang, Chen Sun, Yinghan Chen, Hua Leonardis, Aleš Zhang, Wei Chang, Hyung Jin Shenzhen Key Laboratory of Control Theory and Intelligent Systems School of System Design and Intelligent Manufacturing Southern University of Science and Technology China Department of Computer Science The University of Hong Kong Hong Kong School of Computer Science University of Birmingham United Kingdom

Object pose refinement is essential for robust object pose estimation. Previous work has made significant progress towards instance-level object pose refinement. Yet, category-level pose refinement is a more challenging problem due to large shape variations within a category and the discrepancies between the target object and the shape prior. To address these challenges, we introduce a novel architecture for category-level object pose refinement. Our approach integrates an HS-layer and learnable affine transformations, which aims to enhance the extraction and alignment of geometric information. Additionally, we introduce a cross-cloud transformation mechanism that efficiently merges diverse data sources. Finally, we push the limits of our model by incorporating the shape prior information for translation and size error prediction. We conducted extensive experiments to demonstrate the effectiveness of the proposed framework. Through extensive quantitative experiments, we demonstrate significant improvement over the baseline method by a large margin across all metrics. © 2024, CC BY-NC-SA.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Low-Distortion Clustering with Ordinal and Limited Cardinal Information

arXiv

引用

arXiv 2024年

作者： Burkhardt, Jakob Caragiannis, Ioannis Fehrs, Karl Russo, Matteo Schwiegelshohn, Chris Shyam, Sudarshan Department of Computer Science Aarhus University Åbogade 34 Aarhus N8200 Denmark Department of Computer Control Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy

Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of n agents located in an underlying metric space, our goal is to partition them into k clusters, optimizing some social cost objective. The metric space is defined by a distance function d between the agent locations. Information about d is available only implicitly via n rankings, through which each agent ranks all other agents in terms of their distance from her. Still, even though no cardinal information (i.e., the exact distance values) is available, we would like to evaluate clustering algorithms in terms of social cost objectives that are defined using d. This is done using the notion of distortion, which measures how far from optimality a clustering can be, taking into account all underlying metrics that are consistent with the ordinal information available. Unfortunately, the most important clustering objectives (e.g., those used in the well-known k-median and k-center problems) do not admit algorithms with finite distortion. To sidestep this disappointing fact, we follow two alternative approaches: We first explore whether resource augmentation can be beneficial. We consider algorithms that use more than k clusters but compare their social cost to that of the optimal k-clusterings. We show that using exponentially (in terms of k) many clusters, we can get low (constant or logarithmic) distortion for the k-center and k-median objectives. Interestingly, such an exponential blowup is shown to be necessary. More importantly, we explore whether limited cardinal information can be used to obtain better results. Somewhat surprisingly, for k-median and k-center, we show that a number of queries that is polynomial in k and only logarithmic in n (i.e., only sublinear in the number of agents for the most relevant scenarios in practice) is enough to get constant distortion. © 2024, CC BY.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A Review of Multi-omics and Machine Learning: Advancements and Applications in Cancer Research

A Review of Multi-omics and Machine Learning: Advancements a...

引用

Mobile, Intelligent, and Ubiquitous Computing Conference (MIUCC), International

作者： Hazem Ayman Madonna Bassem Malak Madkour Mariam Fawzi Nada Amr Youmna Yousry Ziad Elgayar Ashraf Abdelraouf Department of Computer Engineering and Software Systems Faculty of Engineering Ain Shams University Cairo Egypt Faculty of Computer Science Misr International University Cairo Egypt

This comprehensive review starts with diving into the progress and real-world applications of combining multi-omics data analysis with machine learning techniques in cancer research. Multi-omics involves examining various biological data types like genomics, transcriptomics, proteomics, and metabolomics together to enhance our understanding of complex biological systems. By merging machine learning with multiomics data, we highlight the advantages for cancer studies, the deeper insights they yield and increased performance and results. Furthermore, we explore existing literature that showcases the integration of multi-omics and machine learning in cancer research. As part of our study, we conduct an experiment utilizing a multiomics dataset to predict the survival of breast cancer patients. We compare three distinct machine learning methods-ensemble, DeepProg, and DCAP-for survival prediction and conclude that despite the ensemble method that increased the prediction results of DeepProg over DCAP in multi-model setting, but the primitive capacity for DCAP is better in single model setting and achieves higher accuracy than DeepProg with noticeable margin 0.628 to 0.57 on C-Index metric, which strongly recommends using Denoising Autoencoder as the base for dimensionality reduction over the vanilla Autoencoder. Another empirical results conclude that using gaussian mixture model with diagonal covariance matrix for Clustering, which is used in DeepProg, might hinder the process for identifying reasonable clusters due to the assumption of no or zero correlation between different features which might not hold true in our problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pattern Recognition Method for Detecting engineering Errors on Technical Drawings

Pattern Recognition Method for Detecting Engineering Errors ...

引用

AI IoT Congress (AIIoT), World

作者： Rimma Dzhusupova Richa Banotra Jan Bosch Helena Holmströ m Olsson Department of Electrical &#x0026 Instrumentation Control &#x0026 Safety Systems McDermott The Hague The Netherlands Department of Instrumentation Control &#x0026 Department of Computer Science and Engineering Chalmers University of Technology Gothenburg Sweden Department of Computer Science and Media Technology Malm&#x00F6 University Malm&#x00F6 Sweden

Many organizations are looking for how to automate repetitive tasks to reduce manual work and free up resources for innovation. Machine Learning, especially Deep Learning, increases the chance of achieving this goal while working with technical documentation. Highly costly engineering hours can be saved, for example, by empowering the manual check with AI, which helps to reduce the total time for technical documents review. This paper proposes a way to substantially reduce the hours spent by process engineers reviewing P&IDs (Piping & Instrumentation Diagrams). The developed solution is based on a deep learning model for analyzing complex real-life engineering diagrams to find design errors - patterns that are combinations of high-level objects. Through the research on an extensive collection of P&ID files provided by McDermott, we prove that our model recognizes patterns representing engineering mistakes with high accuracy. We also describe our experience dealing with class-imbalance problems, labelling, and model architecture selection. The developed model is domain agnostic and can be re-trained on various schematic diagrams within engineering fields and, as well, could be used as an idea for other researchers to see whether similar solutions could be built for different industries.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Correlation-aware Graph Data Augmentation with Implicit and Explicit Neighbors

引用

ACM Transactions on Knowledge Discovery from Data 2024年第5期18卷 1-23页

作者： Kuo, Chuan-Wei Chen, Bo-Yu Peng, Wen-Chih Hung, Chih-Chieh Su, Hsin-Ning Institute of Computer Science and Engineering National Yang Ming Chiao Tung University No. 1001 University Road Hsinchu300 Taiwan Department of Management Information Systems National Chung Hsing University 145 Xingda Rd. South Dist. Taichung Taiwan Institute of Management of Technology National Yang Ming Chiao Tung University No. 1001 University Road Hsinchu300 Taiwan

In recent years, there has been a significant surge in commercial demand for citation graph-based tasks, such as patent analysis, social network analysis, and recommendation systems. Graph Neural Networks (GNNs) are widely used for these tasks due to their remarkable performance in capturing topological graph information. However, GNNs’ output results are highly dependent on the composition of local neighbors within the topological structure. To address this issue, we identify two types of neighbors in a citation graph: explicit neighbors based on the topological structure and implicit neighbors based on node features. Our primary motivation is to clearly define and visualize these neighbors, emphasizing their importance in enhancing graph neural network performance. We propose a Correlation-aware Network (CNet) to re-organize the citation graph and learn more valuable informative representations by leveraging these implicit and explicit neighbors. Our approach aims to improve graph data augmentation and classification performance, with the majority of our focus on stating the importance of using these neighbors, while also introducing a new graph data augmentation method. We compare CNet with state-of-the-art (SOTA) GNNs and other graph data augmentation approaches acting on GNNs. Extensive experiments demonstrate that CNet effectively extracts more valuable informative representations from the citation graph, significantly outperforming baselines. The code is available on public GitHub.1 © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Algorithm for Brain Tumor Detection and Classification using MRI Images

Deep Learning Algorithm for Brain Tumor Detection and Classi...

引用

Applied Intelligence and Sustainable Computing (ICAISC), International Conference on

作者： A. Harshavardhan N. Uma Maheswari M. Prakash Naresh Sammeta Department of CSE VNR Vignana Jyothi Institute of Engineering and Technology Hyderabad Department of Computer Science and Business Systems Panimalar Engineering College School of Computing Science and Engineering Vellore Institute of Technology Vellore India Department of Computer Science and Engineering R.M.K College of Engineering and Technology

Brain tumor classification is beneficial for identifying and diagnosing the tumor’s specific location. According to the medical imaging system, early diagnosis and categorization of a tumor extend a person’s life. Clinical specialists rely heavily on magnetic resonance imaging (MRI) among numerous imaging modalities since it provides contrast information on brain malignancies. The primary purpose of this project is to use a competent automated approach that improves tumour identification accuracy. Several segmentation strategies have been developed throughout the years to achieve and improve the categorization precision of brain tumours. Brain picture segmentation has long been recognised as a difficult and time-consuming aspect of medical image processing. This method for detecting brain tumors Brain pictures are classified using the Full Resolution Convolutional Network (FRCN) classification architecture after pre-processing and segmentation. This study presents a Full Resolution Convolutional Network (FRCN) with Support Vector Machine (SVM) approach for detecting tumors on MRI scans. The procedure is broken down into four steps. In the first phase, the anisotropic filter is utilized to pre-process raw MRI images, followed by segmentation using the Support vector machine (SVM) and skull classification. The singular value decomposition and primary component analysis operations are performed in the third step. Tumors are then detected and classified using the Full Resolution Convolutional Network (FRCN) approach. Simultaneously, the Support Vector Machine (SVM) technique is employed to improve the classification precision of the study model. The experimental results showed an amazing accuracy rate of nearly 100% in detecting both normal and diseased tissues from brain MR images, confirming the efficacy of the suggested technique.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Average Communication Rate for Networked Event-Triggered Stochastic control systems

引用

IEEE Transactions on control of Network systems 2025年

作者： Zhang, Zengjie Liu, Qingchen Mamduhi, Mohammad H. Hirche, Sandra Eindhoven University of Technology Department of Electrical Engineering Netherlands University of Science and Technology of China Department of Automation Hefei China University of Birmingham School of Computer Science United Kingdom Technical University of Munich Chair of Information-Oriented Control Munich Germany

Quantifying the average communication rate (ACR) of a networked event-triggered stochastic control system (NET-SCS) with deterministic thresholds is challenging due to the non-stationary nature of the system's stochastic processes. For a NET-SCS, the propagation of nonlinear statistics of the network communication status brought up by deterministic thresholds makes the precise computation of ACR difficult. Previous work used to over-simplify the computation using a Gaussian distribution without incorporating this nonlinearity, leading to sacrificed precision. This paper proposes a novel approach to calculate the exact ACR for a NET-SCS using a recursive model. We use theoretical analysis and a numerical study to qualitatively evaluate the deviation gap of the conventional approach that ignores the side information. The accuracy of our proposed method, alongside its comparison with the simplified results of the conventional approach, is validated by experimental studies. Our work is promising to benefit the efficient resource planning of networked control systems with limited communication resources by providing accurate ACR computation. © 2025 IEEE.

关键词： Networked control systems

来源：评论

学校读者我要写书评

暂无评论

Experiences from the first delivery of a new immersive software engineering course: mathematical foundations and data analytics

Experiences from the first delivery of a new immersive softw...

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： Florenc Demrozi Marina Marchisio Tiziana Margaria Matteo Sacchet Department of Electrical Engineering and Computer Science University of Stavanger Norway Department of Computer Science and Information Systems University of Limerick Ireland Department of Molecular Biotechnology and Health Sciences University of Turin Italy

According to data from the US Bureau of Labor Statistics, the number of job postings for software engineers has steadily increased over the past few years and is expected to grow by 22% from 2019 to 2029. This paper presents the pedagogical experience within the new Immersive Software engineering (ISE) program concerning mathematical foundations and data analytics topics. These topics were designed to cover essential mathematical concepts such as calculus, linear algebra, probability, and statistics and their integration within data analytic tools and techniques such as time-series forecasting, data cleaning, data visualization, and introduction to pattern recognition. In addition, hands-on projects and real-world applications were incorporated throughout the course to provide students with practical experience in these areas. We reflect on the first delivery of the ISE course, which provided students with a new innovative blended learning environment, and how it will be further developed towards Open Educational Resources (OER) components and refined to respond to the rapidly evolving needs of the software engineering industry.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：