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

Informed Machine Learning for Optimizing Melt Spinning Processes

学校读者我要写书评

暂无评论

Informed Machine Learning for Optimizing Melt Spinning Proce...

Artificial Intelligence (CAI), IEEE Conference on

作者： Viny Saajan Victor Manuel Ettmüller Andre Schmeißer Heike Leitte Simone Gramsch Transport Processes Department Fraunhofer ITWM Kaiserslautern Germany Department of Visualization and Scientific Computing Rhineland-Palatinate Technical University Kaiserslautern Germany Department of Computer Science and Engineering Frankfurt University of Applied Sciences Frankfurt Germany

ISBN: (数字)9798350354096

ISBN: (纸本)9798350354102

Industrial textiles have increasingly become a major part of our day-to-day lives owing to their various desirable properties. Melt spinning processes are a primary and integral part of the production of these textiles. Optimizing the spinning process while maintaining desirable quality is one of the key challenges for the textile industry. Although numerical models, which are digital twins of physical processes, are often used in optimization, they tend to be computationally expensive for complex scenarios. Hence, in this paper, we utilize machine learning to facilitate the optimization of melt spinning processes. We present a novel, reliable, and informed machine-learning model that is both data-and physics-driven. We further demonstrate the capability of this model to accelerate the optimization and analysis of melt spinning processes.

关键词： Computational modeling Machine learning Differential equations Numerical models Spinning Reliability Isothermal processes

Leveraging Interpolation Models and Error Bounds for Verifiable scientific Machine Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chang, Tyler Gillette, Andrew Maulik, Romit Mathematics and Computer Science Division Argonne National Laboratory United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States Information Sciences and Technology Department The Pennsylvania State University United States

Effective verification and validation techniques for modern scientific machine learning workflows are challenging to devise. Statistical methods are abundant and easily deployed, but often rely on speculative assumptions about the data and methods involved. Error bounds for classical interpolation techniques can provide mathematically rigorous estimates of accuracy, but often are difficult or impractical to determine computationally. In this work, we present a best-of-both-worlds approach to verifiable scientific machine learning by demonstrating that (1) multiple standard interpolation techniques have informative error bounds that can be computed or estimated efficiently;(2) comparative performance among distinct interpolants can aid in validation goals;(3) deploying interpolation methods on latent spaces generated by deep learning techniques enables some interpretability for black-box models. We present a detailed case study of our approach for predicting lift-drag ratios from airfoil images. Code developed for this work is available in a public Github repository. © 2024, CC BY-NC-SA.

关键词： Interpolation

A hybrid blockchain and AI-based approach for attack protection to secure internet of medical things networks

学校读者我要写书评

暂无评论

Alexandria Engineering Journal 2025年 128卷 223-230页

作者： Hadeel Alsolai Fahd N. Al-Wesabi Ali M. Al-Sharafi Asma Alshuhail Abdulbasit A. Darem Bandar M. Alghamdi Fouad Shoie Alallah Abdulrahman Alzahrani Department of Information Systems College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University Saudi Arabia Department of Computer Science Applied College at Mahayil King Khalid University Saudi Arabia Department of Computer Science and Artificial Intelligence College of Computing and Information Technology University of Bisha Bisha 67714 Saudi Arabia Department of Information Systems College of Computer Sciences & Information Technology King Faisal University Saudi Arabia Center for Scientific Research and Entrepreneurship Northern Border University Arar 73213 Saudi Arabia Department of Information Technology Faculty of Computing and Information Technology King Abdulaziz University Jeddah 21589 Saudi Arabia Department of Computer Science and Engineering College of Computer Science and Engineering University of Hafr Al Batin Saudi Arabia

The Internet of Medical Things (IoMT) has revolutionized healthcare by enabling real-time monitoring, remote diagnosis, and seamless data exchange among medical devices and providers. However, the interconnected and distributed nature of IoMT systems exposes them to significant cybersecurity threats, including data breaches and unauthorized access. This study aims to develop a secure and scalable framework to safeguard IoMT environments using blockchain technology, federated learning, and dynamic consensus algorithms. The proposed approach integrates artificial intelligence to detect threats and employs federated learning to maintain patient privacy while training models collaboratively. Experimental evaluation of the framework shows improved data security, reduced response times, and enhanced system trustworthiness. The results suggest that the integration of blockchain and AI-driven mechanisms offers a robust solution to IoMT cybersecurity challenges, paving the way for more reliable and efficient healthcare systems.

关键词： Internet of medical things (IoMT) Blockchain security Federated learning AI-driven anomaly detection Cyber threat mitigation

Correction: Web service location‑allocation using discrete NSGA‑II with matrix based genetic operations and a repair mechanism

学校读者我要写书评

暂无评论

Journal of Ambient Intelligence and Humanized computing 2023年第1期15卷 797-798页

作者： Verma, Shanu Pant, Millie Snasel, Vaclav Department of Applied Mathematics and Scientific Computing Indian Institute of Technology Roorkee Roorkee India Centre for Artificial Intelligence and Data Science Indian Institute of Technology Roorkee Roorkee India Department of Computer Science VSB-Technical University of Ostrava Ostrava Czech Republic

SHAPE CONSTRAINTS IN SYMBOLIC REGRESSION USING PENALIZED LEAST SQUARES

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Martinek, Viktor Reuter, Julia Frotscher, Ophelia Mostaghim, Sanaz Richter, Markus Herzog, Roland Interdisciplinary Center for Scientific Computing Heidelberg University Heidelberg69120 Germany Otto von Guericke University Faculty of Computer Science Magdeburg39106 Germany Faculty of Mechanical Engineering University of Technology Chemnitz Applied Thermodynamics Chemnitz09107 Germany

We study the addition of shape constraints (SC) and their consideration during the parameter identification step of symbolic regression (SR). SC serve as a means to introduce prior knowledge about the shape of the otherwise unknown model function into SR. Unlike previous works that have explored SC in SR, we propose minimizing SC violations during parameter identification using gradient-based numerical optimization. We test three algorithm variants to evaluate their performance in identifying three symbolic expressions from synthetically generated data sets. This paper examines two benchmark scenarios: one with varying noise levels and another with reduced amounts of training data. The results indicate that incorporating SC into the expression search is particularly beneficial when data is scarce. Compared to using SC only in the selection process, our approach of minimizing violations during parameter identification shows a statistically significant benefit in some of our test cases, without being significantly worse in any instance. © 2024, CC BY-NC-SA.

关键词： Equations of state

local properties and augmented lagrangians in fully nonconvex composite optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： De Marchi, Alberto Mehlitz, Patrick University of the Bundeswehr Munich Department of Aerospace Engineering Institute of Applied Mathematics and Scientific Computing Neubiberg85577 Germany Philipps-Universität Marburg Department of Mathematics and Computer Science Marburg35032 Germany

A broad class of optimization problems can be cast in composite form, that is, considering the minimization of the composition of a lower semicontinuous function with a differentiable mapping. This paper investigates the versatile template of composite optimization without any convexity assumptions. First- and second-order optimality conditions are discussed. We highlight the difficulties that stem from the lack of convexity when dealing with necessary conditions in a Lagrangian framework and when considering error bounds. Building upon these characterizations, a local convergence analysis is delineated for a recently developed augmented Lagrangian method, deriving rates of convergence in the fully nonconvex *** Codes 49J52, 49J53, 65K10, 90C30, 90C33 © 2023, CC BY.

关键词： Lagrange multipliers

Assessing the Efficacy of Improved Learning in Hourly Global Irradiance Prediction

学校读者我要写书评

暂无评论

computers, Materials & Continua 2023年第11期77卷 2579-2594页

作者： Abdennasser Dahmani Yamina Ammi Nadjem Bailek Alban Kuriqi Nadhir Al-Ansari Salah Hanini Ilhami Colak Laith Abualigah El-Sayed M.El-kenawy Department of Mechanical Engineering Faculty of Science and TechnologyGIDD Industrial Engineering and Sustainable Development LaboratoryUniversity of RelizaneBourmadiaRelizane48000Algeria Laboratory of Biomaterials and Transport Phenomena(LBMPT) University of MedeaUrban PoleMedea26000Algeria Energies and Materials Research Laboratory Faculty of Sciences and TechnologyUniversity of TamanghassetTamanrasset10034Algeria Sustainable Development and Computer Science Laboratory Faculty of Sciences and TechnologyAhmed Draia University of AdrarAdrarAlgeria CERIS Instituto Superior TécnicoUniversidade de LisboaLisbon1049-001Portugal Civil Engineering Department University for Business and TechnologyPristina10000Kosovo Department of Civil Environmental and Natural Resources EngineeringLulea University of TechnologyLulea97187Sweden Engineering and Architecture Faculty Nisantasi UniversityIstanbulTurkey Computer Science Department Prince Hussein Bin Abdullah Faculty for Information TechnologyAl al-Bayt UniversityMafraq25113Jordan Hourani Center for Applied Scientific Research Al-Ahliyya Amman UniversityAmman19328Jordan MEU Research Unit Middle East UniversityAmman11831Jordan Applied Science Research Center Applied Science Private UniversityAmman11931Jordan School of Computer Sciences Universiti Sains MalaysiaPulau Pinang11800Malaysia Department of Computing and Information Systems School of Engineering and TechnologySunway University MalaysiaPetaling Jaya27500Malaysia Faculty of Artificial Intelligence Delta University for Science and TechnologyMansoura35712Egypt

Increasing global energy consumption has become an urgent problem as natural energy sources such as oil,gas,and uranium are rapidly running *** into renewable energy sources such as solar energy is being pursued to counter *** energy is one of the most promising renewable energy sources,as it has the potential to meet the world’s energy needs *** study aims to develop and evaluate artificial intelligence(AI)models for predicting hourly global *** hyperparameters were optimized using the Broyden-FletcherGoldfarb-Shanno(BFGS)quasi-Newton training algorithm and STATISTICA *** from two stations in Algeria with different climatic zones were used to develop the *** error measurements were used to determine the accuracy of the prediction models,including the correlation coefficient,the mean absolute error,and the root mean square error(RMSE).The optimal support vector machine(SVM)model showed exceptional efficiency during the training phase,with a high correlation coefficient(R=0.99)and a low mean absolute error(MAE=26.5741 Wh/m^(2)),as well as an RMSE of 38.7045 Wh/m^(2) across all ***,this study highlights the importance of accurate prediction models in the renewable energy,which can contribute to better energy management and planning.

关键词： Renewable energy energy prediction global irradiation artificial intelligence BFGS quasi-Newton training algorithm

HPC-Coder: Modeling Parallel Programs using Large Language Models

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Nichols, Daniel Marathe, Aniruddha Menon, Harshitha Gamblin, Todd Bhatele, Abhinav Department of Computer Science University of Maryland College ParkMD United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory LivermoreCA United States Livermore Computing Lawrence Livermore National Laboratory LivermoreCA United States

Parallel programs in high performance computing (HPC) continue to grow in complexity and scale in the exascale era. The diversity in hardware and parallel programming models make developing, optimizing, and maintaining parallel software even more burdensome for developers. One way to alleviate some of these burdens is with automated development and analysis tools. Such tools can perform complex and/or remedial tasks for developers that increase their productivity and decrease the chance for error. Until recently, such tools for code development and performance analysis have been limited in the complexity of tasks they can perform, especially for parallel programs. However, with recent advancements in language modeling, and the availability of large amounts of open-source code related data, these tools have started to utilize predictive language models to automate more complex tasks. In this paper, we show how large language models (LLMs) can be applied to tasks specific to high performance and scientific codes. We introduce a new dataset of HPC and scientific codes and use it to fine-tune several pre-trained models. We compare several pre-trained LLMs on HPC-related tasks and introduce a new model, HPC-Coder, fine-tuned on parallel codes. In our experiments, we show that this model can auto-complete HPC functions where generic models cannot, decorate for loops with OpenMP pragmas, and model performance changes in scientific application repositories as well as programming competition solutions. Copyright © 2023, The Authors. All rights reserved.

关键词： Modeling languages

A Comparative Study of the Coulomb’s and Franklin’s Laws Inspired Algorithm (CFA) with Modern Evolutionary Algorithms for Numerical Optimization 1st

学校读者我要写书评

暂无评论

A Comparative Study of the Coulomb’s and Franklin’s Laws I...

1st International Conference on Pervasive Knowledge and Collective Intelligence on Web and Social Media, PerSOM 2022

作者： Ghasemi, Mojtaba Zare, Mohsen Zahedi, Amir Hemmati, Rasul Abualigah, Laith Forestiero, Agostino Department of Electronics and Electrical Engineering Shiraz University of Technology Shiraz Iran Department of Electrical Engineering Faculty of Engineering Jahrom University Fras Jahrom Iran Department of Electrical and Computer Engineering Tarbiat Modares University Tehran Iran Department of Electrical and Computer Engineering Marquette University MilwaukeeWI United States Hourani Center for Applied Scientific Research Al-Ahliyya Amman University Amman Jordan Faculty of Information Technology Middle East University Amman11831 Jordan Applied Science Research Center Applied Science Private University Amman11931 Jordan School of Computer Sciences Universiti Sains Malaysia Pulau Pinang George Town11800 Malaysia Computer Science Department Prince Hussein Bin Abdullah Faculty for Information Technology Al Al-Bayt University Mafraq25113 Jordan Institute for High Performance Computing and Networking National Research Council of Italy Rende Italy

ISBN: (纸本)9783031314681

Coulomb and Franklin’s electricity laws are used in this paper to model an efficient optimization algorithm based on electric particle searches, which has been named CFA. For the CFA optimizer, the influence of electrically charged particles on each other in charged things has been predicated on the forces of attraction and repulsion. Evolutionary algorithms (EA) such as hybrid real coded genetic algorithm (RCGA) which combines the global and local search (GL-25), differential evolution (DE) with strategy adaptation (SaDE), composite DE (CoDE), the improved standard particle swarm optimization 2011 (SPSO2013) and the grouped comprehensive learning PSO (GCLPSO) are compared to the CFA optimizer for finding global solutions of seven basic benchmark functions of high dimension D = 50. (GCLPSO). Experiments have shown that the suggested CFA optimizer is quite effective and competitive for the benchmark functions. Note that the source code of the CFA algorithm is publicly available at https://***/projects/cfa, https://***/matlabcentral/fileexchange/127727-franklin-s-laws-inspired-algorithm-cfa. © 2023, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Charged particles