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

Relative magnetic field and slipping effect on Casson dusty fluid of two phase fluctuating flow over inclined parallel plate

引用

South African Journal of Chemical Engineering 2023年 44卷 135-146页

作者： khan, Dolat Kumam, Poom Kumam, Wiyada Suttiarporn, Panawan Rehman, Ali Fixed Point Research Laboratory Fixed Point Theory and Applications Research Group Center of Excellence in Theoretical and Computational Science (TaCS-CoE) Faculty of Science King Mongkut's University of Technology Thonburi (KMUTT) 126 Pracha Uthit Rd. Bang Mod Bangkok Thung Khru 10140 Thailand Center of Excellence in Theoretical and Computational Science (TaCS-CoE) Faculty of Science King Mongkut's University of Technology Thonburi (KMUTT) 126 Pracha Uthit Rd. Bang Mod Bangkok Thung Khru 10140 Thailand Applied Mathematics for Science and Engineering Research Unit (AMSERU) Program in Applied Statistics Department of Mathematics and Computer Science Faculty of Science and Technology Rajamangala University of Technology Thanyaburi (RMUTT) Pathum Thani 12110 Thailand Faculty of Science Energy and Environment King Mongkut's University of Technology North Bangkok Rayong Campus Rayong 21120 Thailand Special Interest Group for Modelling and Data Analytics Faculty of Ocean Engineering Technology and Informatics Universiti Malaysia Terengganu Terengganu Kuala Nerus 21030 Malaysia

Due to its significant applications in magnetic devices for cell separation, magnetic drugs for cancer tumor treatment, blood flow adjustment during surgery, magnetic endoscopy, and fluid pumping in industrial and engineering processes, magnetohydrodynamics (MHD) has a wide range of applications. Therefore, the aim of this study to investigate the Relative Magnetic Field and slipping effect on Casson dusty fluid of two-phase fluctuating flow over inclined parallel plate. More exactly, the relative magnetic phenomena are fixed relatively to the plate (MFFRP) or fixed relatively to the fluid (MFFRF). The mathematical modeling was established as the set of partial differential equations for dusty Casson fluid. Buckingham's pi theorem is used to find out the dimensionless variables, to make our system dimensionless. The solution in perturb form is to find out by incorporating Poincare–Lighthill perturbation technique (PLPT). To know in-depth different parameters the graphical results for both velocities are plotted with the help of software Mathcad- 15. It is clearly detected that the relative magnetic field performs a vital part in the fluid as well as particle motion. Moreover, the relative magnetic field play a vital role in the decreasing of skin friction of both plates. © 2023

关键词： Brinkman fluid Dust particles Fluctuating vertical plate Inclined relative magnetic field PLPT

来源：评论

学校读者我要写书评

暂无评论

On the existence of solutions to fractional differential equations involving Caputo q-derivative in Banach spaces

引用

Heliyon 2025年第1期11卷 e40876页

作者： Al-Shbeil, Isra Bouzid, Houari Abdelkader, Benali Lupas, Alina Alp Samei, Mohammad Esmael Alhefthi, Reem K. Department of Mathematics Faculty of Sciences The University of Jordan Amman 11942 Jordan Department of Mathematics Faculty of Exact Science and Informatics Hassiba Benbouali University of Chlef Laboratory of Mathematics and Applications (LMA) Chlef Ouled Fares 02000 Algeria Department of Mathematics and Computer Sciences University of Oradea Oradea 10087 Romania Department of Mathematics Faculty of Science Bu-Ali Sina University Hamedan Iran Department of Mathematics College of Science King Saud University P.O. Box 2455 Riyadh 11451 Saudi Arabia

The generalization of BVPs always covers a wide range of equations. Our choice in this research is the generalization of Caputo-type fractional discrete differential equations that include two or more fractional q-integrals. We analyze the existence and uniqueness of solutions to the multi-point nonlinear BVPs base on fixed point theory, including fixed point theorem of Banach, Leray-nonlinear Schauder's alternative, and Leray-degree Schauder's theory. Finally, several examples are presented to demonstrate accuracy of our results. © 2024 The Author(s)

关键词： Existence Leray-Shauders alternative Nonliner fractional equation q-R-L integral

来源：评论

学校读者我要写书评

暂无评论

MF-CLIP: Leveraging CLIP as Surrogate Models for No-box Adversarial Attacks

arXiv

引用

arXiv 2023年

作者： Zhang, Jiaming Qiu, Lingyu Yi, Qi Li, Yige Sang, Jitao Xu, Changsheng Yeung, Dit-Yan Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Department of Mathematics and Applications University of Naples Federico II Naples Italy School of Computing and Information Systems Singapore Management University Singapore School of Computer and Information Technology Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing China National Lab of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing100190 China

The vulnerability of Deep Neural Networks (DNNs) to adversarial attacks poses a significant challenge to their deployment in safety-critical applications. While extensive research has addressed various attack scenarios, the no-box attack setting—where adversaries have no prior knowledge, including access to training data of the target model—remains relatively underexplored despite its practical relevance. This work presents a systematic investigation into leveraging large-scale Vision-Language Models (VLMs), particularly CLIP, as surrogate models for executing no-box attacks. Our theoretical and empirical analyses reveal a key limitation in the execution of no-box attacks stemming from insufficient discriminative capabilities for direct application of vanilla CLIP as a surrogate model . To address this limitation, we propose MF-CLIP (Margin-based Fine-tuned CLIP), a novel framework that enhances CLIP’s effectiveness as a surrogate model through margin-aware feature space optimization. Comprehensive evaluations across diverse architectures and datasets demonstrate that MF-CLIP substantially advances the state-of-the-art in no-box attacks, surpassing existing baselines by 15.23% on standard models and achieving a 9.52% improvement on adversarially trained models. Our code (attached in the supplement) will be made publicly available to facilitate reproducibility and future research in this direction. Copyright © 2023, The Authors. All rights reserved.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

Implementation and Empirical Evaluation of a Quantum Machine Learning Pipeline for Local Classification

arXiv

引用

arXiv 2022年

作者： Zardini, Enrico Blanzieri, Enrico Pastorello, Davide Department of Information Engineering and Computer Science University of Trento via Sommarive 9 Povo Trento38123 Italy Trento Institute for Fundamental Physics and Applications via Sommarive 14 Povo Trento38123 Italy

In the current era, quantum resources are extremely limited, and this makes difficult the usage of quantum machine learning (QML) models. Concerning the supervised tasks, a viable approach is the introduction of a quantum locality technique, which allows the models to focus only on the neighborhood of the considered element. A well-known locality technique is the k-nearest neighbors (k-NN) algorithm, of which several quantum variants have been proposed. Nevertheless, they have not been employed yet as a preliminary step of other QML models, whereas the classical counterpart has already proven successful. In this paper, we present (i) an implementation in Python of a QML pipeline for local classification, and (ii) its extensive empirical evaluation. Specifically, the quantum pipeline, developed using Qiskit, consists of a quantum k-NN and a quantum binary classifier. The results have shown the quantum pipeline's equivalence (in terms of accuracy) to its classical counterpart in the ideal case, the validity of locality's application to the QML realm, but also the strong sensitivity of the chosen quantum k-NN to probability fluctuations and the better performance of classical baseline methods like the random forest. © 2022, CC BY.

关键词： k-nearest neighbors

来源：评论

学校读者我要写书评

暂无评论

On the robustness of EEG tensor completion methods

引用

science China(Technological sciences) 2021年第9期64卷 1828-1842页

作者： DUAN Feng JIA Hao ZHANG ZhiWen FENG Fan TAN Ying DAI YangYang CICHOCKI Andrzej YANG ZhengLu CAIAFA Cesar F. SUN Zhe SOLE-CASALS Jordi College of Artificial Intelligence Nankai UniversityTianjin 300350China Skolkowo Institute of Science and Technology Moscow 121205Russia College of Computer Science Hangzhou Dianzi UniversityHangzhou 310018China Department of Informatics Nicolaus Copernicus UniversityTorun 87-100Poland Systems Research Institute Polish Academy of SciencesWarsaw 01-447Poland College of Computer Science Nankai UniversityTianjin 300350China Instituto Argentino de Radioastronom´ıa IAR-CCT La Plata CONICET/CIC-PBA/UNLPVilla Elisa 1894Argentina Computational Engineering Applications Unit Head Office for Information Systems and CybersecurityRIKENWako-Shi 351-0106Japan Department of Psychiatry University of CambridgeCambridge CB28AHUK Data and Signal Processing Research Group University of Vic-Central University of CataloniaCatalonia 08500Spain

During the acquisition of electroencephalographic(EEG) signals, data may be missing or corrupted by noise and artifacts. To reconstruct the incomplete data, EEG signals are firstly converted into a three-order tensor(multi-dimensional data) of shape time × channel × trial. Then, the missing data can be efficiently recovered by applying a tensor completion method(TCM).However, there is not a unique way to organize channels and trials in a tensor, and different numbers of channels are available depending on the EEG setting used, which may affect the quality of the tensor completion results. The main goal of this paper is to evaluate the robustness of EEG completion methods with several designed parameters such as the ordering of channels and trials, the number of channels, and the amount of missing data. In this work, the results of completing missing data by several TCMs were compared. To emulate different scenarios of missing data, three different patterns of missing data were ***, the amount of missing data on completion effects was analyzed, including the time lengths of missing data and the number of channels or trials affected by missing data. Secondly, the numerical stability of the completion methods was analyzed by shuffling the indices along channels or trials in the EEG data tensor. Finally, the way that the number of electrodes of EEG tensors influences completion effects was assessed by changing the number of channels. Among all the applied TCMs, the simultaneous tensor decomposition and completion(STDC) method achieves the best performance in providing stable results when the amount of missing data or the electrode number of EEG tensors is changed. In other words, STDC proves to be an excellent choice of TCM, since permutations of trials or channels have almost no influence on the complete results. The STDC method can efficiently complete the missing EEG signals. The designed simulations can be regarded as a procedure to validate whether or

关键词： electroencephalogram corrupted data missing data tensor completion tensor decomposition

来源：评论

学校读者我要写书评

暂无评论

Automated Intrusion Detection and Classification using Binary Metaheuristics with Deep Learning on Smart Cities

Automated Intrusion Detection and Classification using Binar...

引用

Sustainable Communication Networks and Application (ICSCNA), International Conference on

作者： Haritha V R. Sindhuja Kumutha R. Aviral Srivastava Shobana. G Suma Christal Mary Sundararajan Department of CSE RMK Engineering College Kavarapettai Department of Medical Electronics Saveetha Engineering college Department of Humanities and science (Physics) S. A. Engineering College Chennai India college of information sciences and technology Pennsylvania state university State college Pennsylvania USA Department of Computer Applications College of Science and Humanities SRM Institute of Science and Technology SRM Nagar Kattankulathur India Department of Information Technology Panimalar Engineering College Poonamalle Chennai

With the dramatic increase of interconnected devices in smart cities, ensuring the integrity and security of the basic infrastructure has become a major concern. Intrusion detection plays a major role in protecting smart city systems against cyber-attacks and threats. Deep learning (DL) techniques, namely recurrent neural networks (RNN) or convolutional neural networks (CNNs), were employed for analyzing the network traffic data. The model was trained by labelled dataset, where network traffic instance was categorized as either intrusive or normal. This study proposes a novel automated Intrusion Detection and Classification design using Binary Metaheuristics with Deep Learning (AIDC-BMDL) techniques on Smart Cities. The AIDC-BMDL technique makes use of metaheuristic feature selection and DL based classification process. For the election of optimal features in the intrusion data, the AIDC-BMDL technique uses binary gray wolf optimizer (BGWO) algorithm. Besides, the AIDC-BMDL technique exploits Stacked Autoencoder (SAE) model for the effectual recognition and classification of the intrusions in the smart city environment. The simulation results illustrated the ability of the AIDC-BMDL technique to accurately identify intrusions in smart city environments. The AIDC-BMDL technique gained maximum performance, pointing out the significance of improving the security of smart cities.

关键词：

来源：评论

学校读者我要写书评

暂无评论

P – Field with some of their properties

引用

AIP Conference Proceedings 2023年第1期2845卷

作者： Hind F. Abbas Hassan H. Ebrahim Ali Al-Fayadh Department of Mathematics College of Computer Science and Mathematics Tikrit University Tikrit Iraq Department of Mathematics and Computer Applications College of Science Al – Nahrain University Baghdad Iraq

This article introduces the idea of P – field which is generalization of P –field. As a first result, it is shown that the intersection of any family of P – field is a P – field too. The main goal of this work to study a basic of this concept and a basic properties, examples, propositions, theorem and characterizations of this idea have been introduced.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving text classification using text summarization

Improving text classification using text summarization

引用

International Conference on New Technologies of Information and Communication (NTIC)

作者： Abdelkader Kaddour Nassim Zellal Lamri Sayad Department of Computer Science University of M’Sila Algeria Department of Artificial Intelligence and Data Sciences University of Science and Technology Houari Boumediene (USTHB) Bab-Ezzouar Algiers Algeria Laboratory of Informatics and its Applications of M’Sila (LIAM) University of M’Sila Algeria

The classification problem has been widely studied in data mining, machine learning, and information retrieval communities with applications in several domains, such as target marketing, medical diagnosis, newsgroup filtering, and document organization. In this work, we take up the challenge of improving Text Classification (TC) using Text Summarizing (TS).

关键词： Support vector machines Filtering Text categorization Machine learning Organizations Information retrieval Medical diagnosis

来源：评论

学校读者我要写书评

暂无评论

Research on Majorization Algorithm and Application of Geotechnical Engineering Structure Based on Granule Swarm Majorization

Research on Majorization Algorithm and Application of Geotec...

引用

International Conference on Smart Technologies For Smart Nation (SmartTechCon)

作者： A. Gnana Soundari Arun Balaji N Mohammed Hussien Al-Fatlawy Suseela D Jamvant Omkar V. Asha Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai Tamil Nadu India New Prince Shri Bhavani College of Engineering and Technology Tamil Nadu India College of Technical Engineering The Islamic University Najaf Iraq Department of Artificial Intelligence and Machine Learning Bannari Amman Institute of Technology Sathyamangalam Tamil Nadu India Department of Electronics & Communication IES College Of Technology Bhopal MP India Department of Master of Computer Applications New Horizon College of Engineering Bengaluru

The traditional majorization design method makes too many restrictions on the objective function to be optimized and its constraints, which brings a lot of inconvenience to solving majorization problems in practical projects. A new stochastic Optimization algorithm based on swarm intelligence - granule swarm algorithm (PSO) was put forward in, and it has been widely concerned by researchers. When the algorithm is initialized, the granules are randomly divided into several sub-granule groups, each sub-granule group evolves independently according to a given strategy, and random migration and adaptive mutation of granules are carried out in the specified period of evolution to maintain the diversity of the entire population., to avoid premature convergence. The inverse analysis of geotechnical engineering majorization is essentially a typical majorization problem of complex nonlinear functions. The use of global majorization algorithm is an ideal way to solve this problem. low productivity. The new algorithm is applied to the elastic-plastic parameter inversion of geotechnical materials. The results show that compared with the conventional granule swarm majorization algorithm, the improved algorithm significantly improves the search efficiency of parameters, and the results that meet the accuracy requirements can be obtained with less iterations, which reduces the amount of calculation of elastic- plastic back analysis of geotechnical engineering. It is a feasible parameter inversion method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Per-RMAP: Feasibility-Seeking and Superiorization Methods for Floorplanning with I/O Assignment

arXiv

引用

arXiv 2023年

作者： Yu, Shan Censor, Yair Jiang, Ming Luo, Guojie Department of Information and Computational Sciences School of Mathematical Sciences Peking University Beijing China Department of Mathematics University of Haifa Haifa Israel National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University Beijing China Center for Energy-efficient Computing and Applications Peking University Beijing China

The feasibility-seeking approach provides a systematic scheme to manage and solve complex constraints for continuous problems, and we explore it for the floorplanning problems with increasingly heterogeneous constraints. The classic legality constraints can be formulated as the union of convex sets. However, the convergence of conventional projection-based algorithms is not guaranteed when the constraints sets are non-convex, which is the case with unions of convex sets. In this work, we propose a resetting strategy to greatly eliminate the divergence issue of the projection-based algorithm for the feasibility-seeking formulation. Furthermore, the superiorization methodology (SM), which lies between feasibility-seeking and constrained optimization, is firstly applied to floorplanning. The SM uses perturbations to steer the iterates of a feasibility-seeking algorithm to a feasible solution with shorter total wirelength. The proposed algorithmic flow is extendable to tackle various constraints and variants of floorplanning problems, e.g., floorplanning with I/O assignment problems. We have evaluated the proposed algorithm on the MCNC benchmarks. We can obtain legal floorplans only two times slower than the branch-and-bound method in its current prototype using MATLAB, with only 3% wirelength inferior to the optimal results. We evaluate the effectiveness of the algorithmic flow by considering the constraints of I/O assignment, and our algorithm achieves 8% improvement on wirelength. © 2023, CC BY.

关键词： Branch and bound method

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：