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

Automatic detection of lung nodule in CT scan slices using CNN segmentation schemes: A study

Procedia computer Science 2023年 218卷 2786-2794页

作者： Seifedine Kadry Enrique Herrera-Viedma Rubén González Crespo Sujatha Krishnamoorthy Venkatesan Rajinikanth Faculty of Applied Computing and Technology Noroff University College Kristiansand 94612 Norway Research Institute in Data Science and Computational Intelligence University of Granada Granada Andalusian Spain Computer Science Department School of Engineering and Technology Universidad Internacional de La Rioja 26006 Spain Zhejiang Bioinformatics International Science and Technology Cooperation Center Wenzhou-Kean University Zhejiang Province China Wenzhou Municipal Key Lab of Applied Biomedical and Biopharmaceutical Informatics Wenzhou-Kean University Zhejiang Province China Department of Electronics and Instrumentation Engineering St. Joseph's College of Engineering OMR Chennai 600119 Tamil Nadu India

The lung is one of the prime respiratory organs in human physiology, and its abnormality will severely disrupt the respiratory system. Lung Nodule (LN) is one of the abnormalities, and early screening and treatment are necessary to reduce its harshness. The proposed work aims to implement the Convolutional-Neural-Network (CNN) segmentation methodology to extract the LN in various lung CT slices, such as axial, coronal, and sagittal planes. This work consists of the following phases; (i) Image collection and pre-processing, (ii) Ground-truth generation, (iii) CNN-supported segmentation, and (iv) Performance evaluation and validation. In this work, the merit of pre-trained CNN segmentation schemes is verified using (i) One-fold training and (ii) Two-fold training methods. The test images for this study are collected from The Cancer Imaging Archive (TCIA) database. The experimental investigation is executed using Python®, and the outcome of this study confirms that the VGG-SegNet helps to get better values of Jaccard (>88%), Dice (>93%), and Accuracy (>96%) compared to other CNN methods.

关键词： Lung nodule CT scan CNN segmentation VGG-SegNet Accuracy Detection

来源：评论

学校读者我要写书评

暂无评论

Modern Computing: Vision and Challenges

arXiv

引用

arXiv 2024年

作者： Gill, Sukhpal Singh Wu, Huaming Patros, Panos Ottaviani, Carlo Arora, Priyansh Pujol, Victor Casamayor Haunschild, David Parlikad, Ajith Kumar Cetinkaya, Oktay Lutfiyya, Hanan Stankovski, Vlado Li, Ruidong Ding, Yuemin Qadir, Junaid Abraham, Ajith Ghosh, Soumya K. Song, Houbing Herbert Sakellariou, Rizos Rana, Omer Rodrigues, Joel J.P.C. Kanhere, Salil S. Dustdar, Schahram Uhlig, Steve Ramamohanarao, Kotagiri Buyya, Rajkumar School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom Center for Applied Mathematics Tianjin University Tianjin China Raygun Performance Monitoring Wellington New Zealand Department of Computer Science York Centre for Quantum Technologies University of York York United Kingdom Microsoft Schiphol Netherlands Distributed Systems Group Vienna University of Technology Vienna Austria Detecon International GmbH Munich Germany Institute for Manufacturing Department of Engineering University of Cambridge Cambridge United Kingdom Department of Engineering Science University of Oxford Oxford United Kingdom Department of Computer Science University of Western Ontario London Canada Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Institute of Science and Engineering Kanazawa University Japan Tecnun School of Engineering University of Navarra Spain Department of Computer Science and Engineering College of Engineering Qatar University Doha Qatar Bennett University Greater Noida India Machine Intelligence Research Labs AuburnWA United States Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India Baltimore United States Department of Computer Science University of Manchester Oxford Road Manchester United Kingdom School of Computer Science and Informatics Cardiff University Cardiff United Kingdom Department of Computer Science College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia COPELABS Lusófona University Lisbon Portugal Sydney Australia The University of Melbourne Victoria Australia Laboratory School of Computing and Information Systems The University of Melbourne Australia

Over the past six decades, the computing systems field has experienced significant transformations, profoundly impacting society with transformational developments, such as the Internet and the commodification of computing. Underpinned by technological advancements, computer systems, far from being static, have been continuously evolving and adapting to cover multifaceted societal niches. This has led to new paradigms such as cloud, fog, edge computing, and the Internet of Things (IoT), which offer fresh economic and creative opportunities. Nevertheless, this rapid change poses complex research challenges, especially in maximizing potential and enhancing functionality. As such, to maintain an economical level of performance that meets ever-tighter requirements, one must understand the drivers of new model emergence and expansion, and how contemporary challenges differ from past ones. To that end, this article investigates and assesses the factors influencing the evolution of computing systems, covering established systems and architectures as well as newer developments, such as serverless computing, quantum computing, and on-device AI on edge devices. Trends emerge when one traces technological trajectory, which includes the rapid obsolescence of frameworks due to business and technical constraints, a move towards specialized systems and models, and varying approaches to centralized and decentralized control. This comprehensive review of modern computing systems looks ahead to the future of research in the field, highlighting key challenges and emerging trends, and underscoring their importance in cost-effectively driving technological progress. © 2024, CC BY.

关键词： Obsolescence

来源：评论

学校读者我要写书评

暂无评论

Estimation of Weibull Distribution Parameters by Analytical Methods for the Wind Speed of Jhimpir, Pakistan - A Comparative Assessment

Estimation of Weibull Distribution Parameters by Analytical ...

引用

Emerging Trends in Electrical, Control, and Telecommunication engineering (ETECTE), International Conference on

作者： Ghulam Abbas Jason Gu Muhammad Usman Asad Valentina E. Balas Umar Farooq Irfan A. Khan Department of Electrical Engineering The University of Lahore Lahore Pakistan Department of Electrical and Computer Engineering Dalhousie University Halifax Canada Department of Automation and Applied Informatics Aurel Vlacieu University of Arad Arad Romania Clean and Resilient Energy Systems (CARES) Lab Texas A&M University Galveston TX USA

ISBN: (纸本)9781665492430

Assessing the potential of a wind farm requires looking into how the wind behaves throughout a certain time frame. One of the most popular ways to statistically model wind data is with the Weibull distribution. Estimating two parameters of the Weibull PDF is crucial for a better fit between the PDF and wind speed data. In this study, Weibull distribution parameters for 2019 wind speed data in the Jhimpir region of Pakistan are determined using four analytical techniques: the empirical method (EM), the maximum likelihood method (MLM), the method of moments (MoM), and the energy pattern factor (EPF) approach. Each technique is evaluated using several different metrics, including the root mean squared error (RMSE), mean absolute error (MAE), mean absolute relative error (MARE), and the coefficient of correlation (R). Statistical analyses show that the shape (k) and scale (c) parameters of the Weibull distribution estimated by the EM, MLM, and MoM are quite close to one another compared to the ones obtained by EPF for the available data. The MATLAB environment-based numerical results expressed that the EPF method performed the best in terms of R and RMSE and worst in terms of MAE and MARE.

关键词： Statistical analysis Wind energy Shape Wind speed Wind farms Probability density function Probability

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Attack Tree: Assessing Cyberattack Risk Using Attack Tree and Fuzzy Logic

Fuzzy Attack Tree: Assessing Cyberattack Risk Using Attack T...

引用

International Conference on ICT in Business Industry & Government (ICTBIG)

作者： Nitin Naik Paul Jenkins Paul Grace Dishita Naik Jingping Song Shaligram Prajapat Durgesh Mishra Longzhi Yang Tossapon Boongoen Natthakan Iam-On School of Informatics and Digital Engineering Aston University United Kingdom Cardiff School of Technologies Cardiff Metropolitan University United Kingdom Birmingham City University United Kingdom Software College Northeastern University China International Institute of Professional Studies Devi Ahilya University India School of Computer Science & Information Technology Symbiosis University of Applied Sciences India Department of Computer and Information Sciences Northumbria University United Kingdom Department of Computer Science Aberystwyth University United Kingdom

Organisations and users have been experiencing significant rises in cyberattacks and their severity, which means that they require a greater awareness and understanding of the anatomy of cyberattacks, to prevent and mitigate their effects. In analysing cyberattacks, there are a number of different approaches that may be used to assess their potential risks and effects. However, these are utilised in specific types of cyberattacks and their analysis, which means they cannot be applied in every situation or cyberattack. Moreover, several other factors may influence the decision to use these approaches, such as cost, complexity, skills and adaptability. As a result, continuous research to design and enhance these approaches is undertaken to produce a generic, cost-effective, easy and adaptable approach. This paper presents one such approach to assess the risk of cyberattacks utilising an attack tree and fuzzy logic. An attack tree is a systematic and illustrative method for describing an attack on a system and analysing its taxonomy and other aspects. Subsequently, the probability and risk of each leaf node in the attack tree are calculated using the proposed formulas. Finally, fuzzy logic enables decision making based on imprecise data and heuristics to obtain the overall risk of attack. This proposed approach comprises systematic steps to accomplish an assessment of any cyberattack and its associated risks in an uncomplicated and effective manner, enabling its prevention and mitigation to be determined. The paper illustrates an application of the proposed approach to assess the risk of an information theft attack on an organisation, which can then be utilised to assess the risk of other cyberattacks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SmartCHANGE: AI-based long-term health risk evaluation for driving behaviour change strategies in children and youth 3

SmartCHANGE: AI-based long-term health risk evaluation for d...

引用

3rd International Conference on applied Mathematics and computer Science, ICAMCS 2023

作者： Rescic, Nina Alberts, Janna Altenburg, Teatske M. Chinapaw, Mai J. M. De Nigro, Antonio Fenoglio, Dario Gjoreski, Martin Gradisek, Anton Jurak, Gregor Kiourtis, Athanasios Kyriazis, Dimosthenis Langheinrich, Marc Mancuso, Elena Mavrogiorgou, Argyro Pechenizkiy, Mykola Pratola, Roberto Ribeiro, Jose Soric, Maroje Taj, Fawad Tammelin, Tuija H. Vastenburg, Martijn Vilanova, Anna Vrijkotte, Tanja G. M. Lustrek, Mitja Jožef Stefan Institute Department of Intelligent Systems Ljubljana Slovenia ConnectedCare Research & Development Nijmegen Netherlands Vrije Universiteit Amsterdam Amsterdam Public Health Research Institute Department of Public and Occupational Health Amsterdam Umc Amsterdam Netherlands Informatica S.p.A. Engineering Ingegneria Rome Italy Università della Svizzera Italiana Faculty of Informatics Lugano Switzerland University of Ljubljana Faculty of Sports Ljubljana Slovenia University of Piraeus Department of Digital Systems Piraeus Greece Eindhoven University of Technology Department of Mathematics and Computer Science Eindhoven Netherlands University of Porto Faculty of Sport Porto Portugal Jamk University of Applied Sciences Likes School of Health and Social Studies Jyväskylä Finland

ISBN: (纸本)9798350324266

The SmartCHANGE project, a Horizon-Europe Research & Innovation project that has been ongoing since May 2023 and is scheduled to conclude in April 2027, aims to develop AI-driven decision-support tools to identify and reduce the long-term risk of non-communicable chronic diseases (NCDs) in children and youth. NCDs have become a significant public health burden in developed countries, with common risk factors including obesity, low physical fitness, and unhealthy lifestyle habits. Childhood and adolescence are critical periods for establishing healthy habits, and early intervention can prevent or delay the onset of NCDs later in life. However, current tools for identifying high-risk individuals mainly focus on adults, leading to missed opportunities for early detection. The SmartCHANGE project aims to address this gap by creating trustworthy AI tools that accurately assess risk factors in children and youth and promote optimised strategies for risk reduction. The paper outlines the plan for the project from the project's proposed methodologies, including dataset utilisation, data cleaning, risk prediction models (basic and complex), and the implementation of federated learning. Additionally, it discusses user experience aspects such as participatory design, suggested applications, and the evaluation of project outcomes. © 2023 IEEE.

关键词： Health risks

来源：评论

学校读者我要写书评

暂无评论

A SUCCESSIVE TWO-STAGE METHOD FOR SPARSE GENERALIZED EIGENVALUE PROBLEMS

arXiv

引用

arXiv 2023年

作者： Li, Qia Liao, Jianmin Shen, Lixin Zhang, Na School of Computer Science and Engineering Guangdong Province Key Laboratory of Computational Science Sun Yat-sen University Guangdong Province Guangzhou510275 China Department of Mathematics Syracuse University SyracuseNY13244 United States Department of Applied Mathematics College of Mathematics and Informatics South China Agricultural University Guangdong Province Guangzhou510642 China

The Sparse Generalized Eigenvalue Problem (sGEP), a pervasive challenge in statistical learning methods including sparse principal component analysis, sparse Fisher's discriminant analysis, and sparse canonical correlation analysis, presents significant computational complexity due to its NP-hardness. The primary aim of sGEP is to derive a sparse vector approximation of the largest generalized eigenvector, effectively posing this as a sparse optimization problem. Conventional algorithms for sGEP, however, often succumb to local optima and exhibit significant dependency on initial points. This predicament necessitates a more refined approach to avoid local optima and achieve an improved solution in terms of sGEP's objective value, which we address in this paper through a novel successive two-stage method. The first stage of this method incorporates an algorithm for sGEP capable of yielding a stationary point from any initial point. The subsequent stage refines this stationary point by adjusting its support, resulting in a point with an enhanced objective value relative to the original stationary point. This support adjustment is achieved through a novel procedure we have named support alteration. The final point derived from the second stage then serves as the initial point for the algorithm in the first stage, creating a cyclical process that continues until a predetermined stopping criterion is satisfied. We also provide a comprehensive convergence analysis of this process. Through extensive experimentation under various settings, our method has demonstrated significant improvements in the objective value of sGEP compared to existing methodologies, underscoring its potential as a valuable tool in statistical learning and *** Codes 90C26, 90C32, 90C59, 90C90 Copyright © 2023, The Authors. All rights reserved.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Simon’s Period Finding on a Quantum Annealer

arXiv

引用

arXiv 2025年

作者： Robertson, Reece Doucet, Emery Mzaouali, Zakaria Domino, Krzysztof Gardas, Bartlomiej Deffner, Sebastian Department of Computer Science & Electrical Engineering Department of Physics Quantum Science Institute UMBC Baltimore United States Department of Physics Quantum Science Institute UMBC Baltimore United States Institut für Theoretische Physik Universität Tübingen Auf der Morgenstelle 14 Tübingen72076 Germany Institute of Theoretical and Applied Informatics Polish Academy of Sciences Gliwice Poland National Quantum Laboratory College Park United States

Dating to 1994, Simon’s period-finding algorithm is among the earliest and most fragile of quantum algorithms. The algorithm’s fragility arises from the requirement that, to solve an n qubit problem, one must fault-tolerantly sample O(n) linearly independent values from a solution space. In this paper, we study an adiabatic implementation of Simon’s algorithm that requires a constant number of successful samples regardless of problem size. We implement this algorithm on D-Wave hardware and solve problems with up to 298 qubits. We compare the runtime of classical algorithms to the D-Wave solution to analyze any potential advantage. Copyright © 2025, The Authors. All rights reserved.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

Regression models for predicting the effect of trash rack on flow properties at power intakes

引用

engineering Applications of Computational Fluid Mechanics 2024年第1期18卷

作者： Li, Shuguang Qasem, Sultan Noman Karami, Hojat Salwana, Ely Rezaei, Alireza Shahmirzadi, Danyal Band, Shahab S. School of Computer Science and Technology Shandong Technology and Business University Yantai China Computer Science Department Imam Muhammad Ibn Saud Islamic University Riyadh Saudi Arabia Computer Science Department Faculty of Applied Science Taiz University Taiz Yemen Civil Engineering Department Semnan University Semnan Iran Institute of Visual Informatics Universiti Kebangsaan Malaysia Selangor Malaysia Graduate School of Engineering Science and Technology National Yunlin University of Science and Technology Douliou Taiwan International Graduate School of AI National Yunlin University of Science and Technology Yunlin Taiwan

Vortex flow characteristics in a reservoir and horizontal water intake have been predicted by using regression models in this numerical research. In this paper, three standalone machine learning models–Random Forest (RF), K-nearest neighbours (KNN), Gradient Boosting (GB)–and a proposed hybrid model based on Lévy Jaya Algorithm (LJA) and GB (LJA-GB) are employed to estimate the effect of trash racks on flow properties at power intakes. The experimental data which are prepared for the proposed study in this paper were obtained through a rectangular laboratory tank 8.3 m³ with various submergence depths and Froude numbers on nine trash racks with 63.7%–84.1% opening, made out of 2, 2.5, 4, and 6 mm thick copper wire. The outcomes revealed that the proposed LJA-GB model shows the best overall performance among the four models used for estimation. Thus, the LJA-GB model has the lowest mean absolute error (MAE) (0.3344), mean squared error (MSE) (0.1784), and root mean squared error (RMSE) (0.4223) values and highest R-squared ((Formula presented.)) (0.9899) and Willmott’s index (WI) values (0.9508) in the testing stage metrics for (Formula presented.) estimation and MAE (0.0061), MSE (0.0001), RMSE (0.0073), (Formula presented.) (0.9971), WI (0.9727) for (Formula presented.) estimation. Whereas the RF and KNN models exhibited poor performance in both stages of estimation. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： experimental modelling Hydro power plant regression models vortex strength

来源：评论

学校读者我要写书评

暂无评论

BiLSTM with Data Augmentation using Interpolation Methods to Improve Early Detection of Parkinson Disease 15

BiLSTM with Data Augmentation using Interpolation Methods to...

引用

15th Federated Conference on computer Science and Information Systems, FedCSIS 2020

作者： Abayomi-Alli, Olusola O. Damasevicius, Robertas Maskeliunas, Rytis Abayomi-Alli, Adebayo Kaunas University of Technology Department of Software Engineering Kaunas Lithuania Vytautas Magnus University Department of Applied Informatics Kaunas Lithuania Federal University of Agriculture Department of Computer Science Abeokuta Nigeria

ISBN: (纸本)9788395541674

The lack of dopamine in the human brain is the cause of Parkinson disease (PD) which is a degenerative disorder common globally to older citizens. However, late detection of this disease before the first clinical diagnosis has led to increased mortality rate. Research effort towards the early detection of PD has encountered challenges such as: small dataset size, class imbalance, overfitting, high false detection rate, model complexity, etc. This paper aims to improve early detection of PD using machine learning through data augmentation for very small datasets. We propose using Spline interpolation and Piecewise Cubic Hermite Interpolating Polynomial (Pchip) interpolation methods to generate synthetic data instances. We further investigate on reducing dimensionality of features for effective and real-time classification while considering computational complexity of implementation on real-life mobile phones. For classification we use Bidirectional LSTM (BiLSTM) deep learning network and compare the results with traditional machine learning algorithms like Support Vector Machine (SVM), Decision Tree, Logistic regression, KNN and Ensemble bagged tree. For experimental validation we use the Oxford Parkinson disease dataset with 195 data samples, which we have augmented with 571 synthetic data samples. The results for BiLSTM shows that even with a holdout of 90%, the model was still able to effectively recognize PD with an average accuracy for ten rounds experiment using 22 features as 82.86%, 97.1%, and 96.37% for original, augmented (Spline) and augmented (Pchip) datasets, respectively. Our results show that proposed data augmentation schemes have significantly (p © 2020 Polish Information Processing Society - as it is since 2011.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

The Smart Analysis of Performing Scalable Inference for Big Data Analytics

The Smart Analysis of Performing Scalable Inference for Big ...

引用

International Conference on Power Energy, Environment and Intelligent Control (PEEIC)

作者： Vishakha D Bhandarkar Aruna Sri Rongali Mohamed Dawood Shamout Prof. Sachin Pund Gigih Forda Nama Shrishailappa Patil Applied Mathematics and Humanities Yeshwantrao Chavan College of Engineering India Graduate Doctoral Information Technology/Graduate (Information Technology Emphasis/Information Technology Ph.D.) University of The Cumberlands US Department of Management College of Business Administration University of Sharjah Sharjah United Arab Emirates Department of Industrial Engineering Shri Ramdeobaba College of Engineering and Management Nagpur Maharashtra India Department of Informatics Doctoral Program of Environtmental Science University of Lampung Bandar Lampung Computer engineering Vishwakarma Institute of Technology Pune

This paper examines the reproducibility of massive information analytics under particular factors. The paper proposes the “performing Scalable Inference” technique to cope with scalability troubles and to exploit current big statistics platforms for efficient computing and statistics garage of the statistics. In particular, the paper describes how to perform leak-free, parallelizable visible analytics over massive datasets using present extensive records analytics frameworks such as Apache Flink. This method presents an automated manner to execute analytics that preserves reproducibility and the ability to make adjustments without re-running the entire technique. The paper also demonstrates how these analytics may help several real-world use instances, explore affected person cohorts for studies, and develop stratified patient cohorts for hospital therapy. In the end, the paper observes how the proposed method may be exercised within the real world. Actively scalable inference for massive information analytics is pivotal in optimizing decision-making and allocation of assets. Typically, such inferences are made based on information accumulated from numerous sources, databases, unstructured data, and different digital sources. So one can ensure scalability, a complete cloud-primarily based platform has to be hired. This solution will permit the ***, deploying the essential records series and evaluation algorithms are prime here. It could permit the platform to recognize the styles inside the statistics and discover any ability correlations or traits. Additionally, predictive analytics and system mastering strategies may be incorporated to provide insights into the results of the information. In the long run, by leveraging those techniques, the platform can draw efficient inferences and appropriately compare situations in an agile and green way..

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：