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

arXiv 2024年

作者： Khan, Arif Ali Akbar, Muhammad Azeem Lahtinen, Valtteri Paavola, Marko Niazi, Mahmood Alatawi, Mohammed Naif Alotaibi, Shoayee Dlaim M3S Empirical Software Engineering Research Unit University of Oulu Oulu90014 Finland Software Engineering Department Lappeenranta-Lahti University of Technology Lappeenranta53851 Finland Quanscient Oy Tampere Finland VTT Technical Research Ctr of Finland Ltd Oulu Finland Department of Information and Computer Science King Fahd University of Petroleum and Minerals Saudi Arabia Interdisciplinary Research Centre for Intelligent Secure Systems King Fahd University of Petroleum and Minerals Saudi Arabia Information Technology Department Faculty of Computers and Information Technology University of Tabuk Saudi Arabia Department of Artificial Intelligence and Data Science College of Computer Science and Engineering University of Hail Hail Saudi Arabia

Context: Quantum software systems represent a new realm in software engineering, utilizing quantum bits (Qubits) and quantum gates (Qgates) to solve the complex problems more efficiently than classical counterparts. Agile software development approaches are considered to address many inherent challenges in quantum software development, but their effective integration remains unexplored. Objective: This study investigates key causes of challenges that could hinders the adoption of traditional agile approaches in quantum software projects and develop an Agile-Quantum software Project Success Prediction Model (AQSSPM). Methodology: Firstly, we identified 19 causes of challenging factors discussed in our previous study, which are potentially impacting agile-quantum project success. Secondly, a survey was conducted to collect expert opinions on these causes and applied Genetic Algorithm (GA) with Naive Bayes Classifier (NBC) and Logistic Regression (LR) to develop the AQSSPM. Results: Utilizing GA with NBC, project success probability improved from 53.17% to 99.68%, with cost reductions from 0.463% to 0.403%. Similarly, GA with LR increased success rates from 55.52% to 98.99%, and costs decreased from 0.496% to 0.409% after 100 iterations. Both methods result showed a strong positive correlation (rs=0.955) in causes ranking, with no significant difference between them (t=1.195, p=0.240>0.05). Conclusion: The AQSSPM highlights critical focus areas for efficiently and successfully implementing agile-quantum projects considering the cost factor of a particular project. © 2024, CC BY.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A comparative analysis of machine learning algorithms to build a predictive model for detecting diabetes complications

引用

Informatica (Slovenia) 2021年第1期45卷 117页

作者： Abaker, Ali A. Saeed, Fakhreldeen A. Department of Accounting Information Systems Faculty of Computer Science Al-Neelain University Khartoum Sudan Department of Software Engineering Faculty of Computer Science Al-Neelain University Khartoum Sudan

Diabetes complications have a significant impact on patients’ quality of life. The objective of this study was to predict which patients were more likely to be in a complicated health condition at the time of admission to allow for the early introduction of medical interventions. The data were 644 electronic health records from Alsukari Hospital collected from January 2018 to April 2019. We used the following machine learning methods: logistic regression, random forest, and k-nearest neighbor (KNN). The logistic regression algorithm performed better than the other algorithms achieving an accuracy of 81%, recall of 81%, and F1 score of 75%. Also, attributes such as infection years, swelling, diabetic ketoacidosis, and diabetic septic foot were significant in predicting diabetes complications. This model can be useful for the identification of patients requiring additional care to limit the complications and help practitioners in making decisions on whether the patient should be hospitalized or sent home. Furthermore, we used the sequential feature selection (SFS) algorithm which reduced the features to six, which is fewer than any model built before to predict diabetes complications. The primary goal of this study was achieved. The model had fewer attributes which means we have a simple and understandable model in addition to, it has a better performance. © 2021 Slovene Society Informatika. All rights reserved.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

TEVA: Training-Efficient and Verifiable Aggregation for Federated Learning for Consumer Electronics in Industry 5.0

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Xia, Yuanjun Liu, Yining Chen, Jingxue Liang, Yangfan Khan, Fazlullah Alturki, Ryan Wang, Xiaopei Guilin University of Electronic Technology Guangxi Key Laboratory of Trusted Software School of Computer and Information Security Guilin541004 China Wenzhou University of Technology School of Data Science and Artificial Intelligence Wenzhou325027 China University of Technology School of Mathematical and Physical Sciences SydneyNSW2007 Australia Jiaxing University Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems The Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province The Engineering Research Center of Intelligent Human Health Situation Awareness of Zhejiang Province Jiaxing314001 China University of Nottingham Ningbo China School of Computer Science Faculty of Science and Engineering Zhejiang Ningbo315104 China Umm AI-Qura University Makkah Department of Software Engineering College of Computing Saudi Arabia Riverside Department of Computer Science and Engineering University of California CA92521 United States

Federated learning (FL) has been widely used for privacy-preserving model updates in Industry 5.0, facilitated by 6G networks. Despite FL's privacy-preserving advantages, it remains vulnerable to attacks where adversaries can infer private data from local models or manipulate the central server (CS) to deliver falsified global models. Current privacy-preserving approaches, primarily based on the FedAvg algorithm, fail to optimize training efficiency for non-independent and identically distributed (non-IID) data. This article proposes training-efficient and verifiable aggregation (TEVA) for FL to resolve these issues. This scheme combines threshold Paillier homomorphic encryption (TPHE), verifiable aggregation, and an optimized double momentum update mechanism (OdMum). TEVA not only leverages TPHE to protect the privacy of local models but also ensures the integrity of the global model through a verifiable aggregation mechanism. Additionally, TEVA integrates the OdMum algorithm to effectively address the challenges posed by non-IID data, promoting rapid model convergence and significantly enhancing overall training efficiency. Security analysis indicates that TEVA meets the requirements for privacy protection. Extensive experimental results demonstrate that TEVA can accelerate model convergence while incurring lower computational and communication overheads. © 1975-2011 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness

arXiv

引用

arXiv 2022年

作者： Banerjee, Tamajit Majumdar, Rupak Mallik, Kaushik Schmuck, Anne-Kathrin Soudjani, Sadegh Department of Computer Science and Engineering Indian Institute of Technology Delhi India Max Planck Institute for Software Systems Germany Institute of Science and Technology Austria Austria Newcastle University United Kingdom

We consider fixpoint algorithms for two-player games on graphs with ω-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of strong fairness. It requires that any execution is strongly fair with respect to a specified set of live edges: whenever the source vertex of a live edge is visited infinitely often along a play, the edge itself is traversed infinitely often along the play as well. We show that, surprisingly, strong transition fairness retains the algorithmic characteristics of the fixpoint algorithms for ω-regular games-the new algorithms have the same alternation depth as the classical algorithms but invoke a new type of predecessor operator. For example, for Rabin games with k pairs under strong transition fairness, the complexity of the new algorithm is O(nk+2k!) symbolic steps, which is independent of the number of live edges in the strong transition fairness assumption. In contrast, strong fairness necessarily requires increasing the alternation depth depending on the number of fairness assumptions. We get symbolic algorithms for (generalized) Rabin, parity, and GR(1) objectives under strong transition fairness assumptions as well as a direct symbolic algorithm for qualitative winning in stochastic ω-regular games that runs in O(nk+2k!) symbolic steps, improving the state of the art. Previous approaches for handling fairness assumptions would either increase the alternation depth of the fixpoint algorithm or require an up-front automata-theoretic construction that would increase the state space, or both. We have implemented a BDD-based synthesis engine based on our algorithm. We show on a set of synthetic and real benchmarks that our algorithm is scalable, parallelizable, and outperforms previous algorithms by orders of magnitude. © 2022, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

The Development of a Visual Novel Role-Playing Game [VN RPG] as an Open Educational Resource [OER] for Philippine Literature Educators Administering the 'Noli Me Tangere' Module 13

The Development of a Visual Novel Role-Playing Game [VN RPG]...

引用

2021 IEEE 13th International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment, and Management, HNICEM 2021

作者： Sales, Nina Ana Marie Jocelyn Villanueva, Nathaniel Evangelista, Matthew Robert Cestina, Joshua Luigi Emmanuel Camba, Jhona De La Salle University College of Computer Studies Software Technology Department Manila Philippines Gokongwei College of Engineering de la Salle University Industrial and Systems Engineering Department Manila Philippines De La Salle University International Center Office of the Vice President for External Relations and Internationalization Manila Philippines

ISBN: (纸本)9781665401678

Many scholars saw opportunities of using digital interactive video games as a learning tool during the pandemic. However, it was indeed complex for educators, especially those who teach history-driven novels to prepare lesson plans for classes not only to get the learning outcomes but also to produce high technology materials such as video games. Given the predicament, this study aims to measure the effectiveness of the developed video game named 'Touch Me Not' under the genre Visual Novel Role-Playing Game (VN RPG) as an Open Education Resource (OER) to educators who teach the novel, Noli Me Tangere or Touch Me Not. To accomplish the proposed objective, the Understanding by Design (UbD) approach was analyzed through the administered survey questionnaire, pre-test, and post-test. The findings show that using the 'Touch Me Not' VN RPG to complement the standard class modules had a more significant effect on the educators' performance. Thus, it proved that using VN RPG is an effective complementary pedagogical tool in teaching history-driven classes. © 2021 IEEE.

关键词： Serious games

来源：评论

学校读者我要写书评

暂无评论

Evaluating a Comparing Deep Learning Architectures for Blood Glucose Prediction 13th

Evaluating a Comparing Deep Learning Architectures for Blood...

引用

13th International Joint Conference on Biomedical engineering systems and Technologies, BIOSTEC 2020

作者： El Idrissi, Touria Idri, Ali Department of Computer Sciences EMI University Mohamed V Rabat Morocco Software Project Management Research Team RITC ENSIAS University Mohamed V Rabat Morocco Complex Systems Engineering University Mohammed VI Polytechnic Ben Guerir Morocco

ISBN: (纸本)9783030723781

To manage their disease, diabetic patients need to control the blood glucose level (BGL) by monitoring it and predicting its future values. This allows to avoid high or low BGL by taking recommended actions in advance. In this paper, we conduct a comparative study of two emerging deep learning techniques: Long-Short-Term Memory (LSTM) and Convolutional Neural Networks (CNN) for one-step and multi-steps-ahead forecasting of the BGL based on Continuous Glucose Monitoring (CGM) data. The objectives are twofold: 1) Determining the best strategies of multi-steps-ahead forecasting (MSF) to fit the CNN and LSTM models respectively, and 2) Comparing the performances of the CNN and LSTM models for one-step and multi-steps prediction. Toward these objectives, we firstly conducted series of experiments of a CNN model through parameters selection to determine its best configuration. The LSTM model we used in the present study was developed and evaluated in an earlier work. Thereafter, five MSF strategies were developed and evaluated for the CNN and LSTM models using the Root-Mean-Square Error (RMSE) with an horizon of 30 min. To statistically assess the differences between the performances of CNN and LSTM models, we used the Wilcoxon statistical test. The results showed that: 1) no MSF strategy outperformed the others for both CNN and LSTM models, and 2) the proposed CNN model significantly outperformed the LSTM model for both one-step and multi-steps prediction. © 2021, Springer Nature Switzerland AG.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Towards Evidence-Based Cybersecurity Assessment of Programmable systems to Ensure the Protection of Critical IT Infrastructure

Towards Evidence-Based Cybersecurity Assessment of Programma...

引用

IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing systems: Technology and Applications

作者： Oleg Illiashenko Vyacheslav Kharchenko Oleg Odarushchenko Department of computer systems and networks National aerospace university “KhAI” Kharkiv Ukraine Software Engineering & Dependable Computing Laboratory Institute of Information Science and Technologies “Alessandro Faedo”—ISTI CNR Pisa Italy Research and Production Enterprise RPC Radics LLC Kropyvnytskyi Ukraine

The paper is devoted to developing scientific principles, methods, means, and information technology of model-oriented verification and evidence-based assessment using functional safety and cybersecurity cases for programmable systems of critical applications (PSCA). In particular, information and control systems important for the safety of nuclear power plants (NPPs), aerospace systems, railway domains, etc., developed using Field Programmable Gate Arrays (FPGAs) and hardware platforms are reviewed. The goal is to ensure the guaranteed completeness and reliability of its functional safety and cybersecurity assessment by developing and implementing a set of formal and semi-formal methods and tools that consider defects of different nature – physical, design, trojans, and vulnerabilities that can be attacked and lead to a fatal system failure, which results in damaging the critical IT infrastructure. The methods shown are based on integrating algebraic, tabular, graph models, and case assessment methodology. The methods are implemented as appropriate technologies for evidence-based verification and evaluation of PSCA. For formal methods, a prototype of a translator of Very High-Speed Integrated Circuits Hardware Description Language (VHDL) code is developed into an algebra of behaviors. It provides evidence-based verification and a framework and tools to design reports on assessing the cybersecurity and functional safety of programmable systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust Generalization Against Photon-Limited Corruptions via Worst-Case Sharpness Minimization

Robust Generalization Against Photon-Limited Corruptions via...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhuo Huang Miaoxi Zhu Xiaobo Xia Li Shen Jun Yu Chen Gong Bo Han Bo Du Tongliang Liu Sydney AI Centre The University of Sydney National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University JD Explore Academy Department of Automation University of Science and Technology of China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Department of Computer Science Hong Kong Baptist University

Robust generalization aims to tackle the most challenging data distributions which are rare in the training set and contain severe noises, i.e., photon-limited corruptions. Common solutions such as distributionally robust optimization (DRO) focus on the worst-case empirical risk to ensure low training error on the uncommon noisy distributions. However, due to the over-parameterized model being optimized on scarce worst-case data, DRO fails to produce a smooth loss landscape, thus struggling on generalizing well to the test set. Therefore, instead of focusing on the worst-case risk minimization, we propose SharpDRO by penalizing the sharpness of the worst-case distribution, which measures the loss changes around the neighbor of learning parameters. Through worst-case sharpness minimization, the proposed method successfully produces a flat loss curve on the corrupted distributions, thus achieving robust generalization. Moreover, by considering whether the distribution annotation is available, we apply SharpDRO to two problem settings and design a worst-case selection process for robust generalization. Theoretically, we show that SharpDRO has a great convergence guarantee. Experimentally, we simulate photon-limited corruptions using CIFAR10/100 and ImageNet30 datasets and show that SharpDRO exhibits a strong generalization ability against severe corruptions and exceeds well-known baseline methods with large performance gains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CoNi-MPC: Cooperative Non-inertial Frame Based Model Predictive Control

arXiv

引用

arXiv 2023年

作者： Zhang, Baozhe Chen, Xinwei Li, Zhehan Beltrame, Giovanni Xu, Chao Gao, Fei Cao, Yanjun Huzhou Institute of Zhejiang University Huzhou313000 China State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China The Chinese University of Hong Kong Shenzhen518172 China Department of Computer Engineering and Software Engineering Poly-technique Montreal Canada

This paper presents a novel solution for UAV control in cooperative multi-robot systems, which can be used in various scenarios such as leader-following, landing on a moving base, or specific relative motion with a target. Unlike classical methods that tackle UAV control in the world frame, we directly control the UAV in the target coordinate frame, without making motion assumptions about the target. In detail, we formulate a nonlinear model predictive controller of a UAV, referred to as the agent, within a non-inertial frame (i.e., the target frame). The system requires the relative states (pose and velocity), the angular velocity and the accelerations of the target, which can be obtained by relative localization methods and ubiquitous MEMS IMU sensors, respectively. This framework eliminates dependencies that are vital in classical solutions, such as accurate state estimation for both the agent and target, prior knowledge of the target motion model, and continuous trajectory re-planning for some complex tasks. We have performed extensive simulations to investigate the control performance with varying motion characteristics of the target. Furthermore, we conducted real robot experiments, employing either simulated relative pose estimation from motion capture systems indoors or directly from our previous relative pose estimation devices outdoors, to validate the applicability and feasibility of the proposed approach. © 2023, CC BY.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Review of Active EV Battery Cell Voltage Balancing systems: Current Issues and Prospective Solutions

A Comprehensive Review of Active EV Battery Cell Voltage Bal...

引用

On-Line Conference (ONCON), Industrial Electronics Society Annual

作者： Chandan Chetri Alvin Huynh Sheldon S. Williamson Department of Electrical Computer and Software Engineering Smart Transportation Electrification and Energy Research (STEER) Group Advanced Storage Systems and Electric Transportation (ASSET) Laboratory Faculty of Engineering and Applied Science Ontario Tech University Oshawa Canada

The performance of a battery pack is greatly affected by an imbalance between the cells. Cell balancing is a very important criterion for Battery Management System (BMS) to operate properly. This paper presents the various cell balancing topologies which have been presented by various researchers in the past years. A novel topology has also been discussed, which improves the overall efficiency of the components being used. Various comparison parameters such as Control, Speed, Efficiency, Power Effects, Manufacturability, Size, and Cost have been considered.

关键词： Industrial electronics Electric potential Costs Equalizers Battery management systems Transformers Power electronics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：