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

Exponential Decay of Laminated Beam with Nonlinear Time-varying Delay and Microtemperature Effect

Acta Mathematicae Applicatae Sinica 2025年第1期41卷 270-285页

作者： Imene LARIBI Ali KRELIFA Djamel OUCHENANE Fares YAZID Salah BOULAARAS Salah ZITOUNI Department of Mathematics Djilali Bounaama University of Khemis MilianaKhemis MilianaAlgeria Computer Science and Mathematics Laboratory Amar Telidji UniversityLaghouat 03000Algeria Laboratory of Pure and Applied Mathematics Amar Telidji UniversityLaghouat 03000Algeria Department of Mathematics College of ScienceQassim UniversityBuraydah 51452Saudi Arabia Department of Mathematics and Informatics University Mohamed-Cherif MessaadiaSouk AhrasAlgeria

This research paper addresses a topic of interest to many researchers and engineers due to its effective applications in various industrial *** focuses on the thermoelastic laminated beam model with nonlinear structural damping,nonlinear time-varying delay,and microtemperature *** primary goal is to establish the stability of the *** achieve this,and under suitable hypotheses,we demonstrate energy decay and construct a Lyapunov functional that leads to our results.

关键词： structural damping energy decay laminated beam microtemperature time-varying delay partial differential equations nonlinear equations

来源：评论

学校读者我要写书评

暂无评论

Comments on "relaxed Conditions for the Input-to-State Stability of Switched Nonlinear Time-Varying Systems"

引用

IEEE Transactions on Automatic Control 2025年第6期70卷 4233-4236页

作者： Şahan, Gökhan Trenn, Stephan Izmir Institute of Technology Department of Mathematics and Computational Science and Engineering Program Urla Izmir Turkey University of Groningen Bernoulli Institute for Mathematics Computer Science and Artificial Intelligence Groningen9722BA Netherlands

This study addresses the deficiencies in the assumptions of the results in Chen and Yang, 2017 [1] due to the lack of uniformity. We first show the missing hypothesis by presenting a counterexample. Then we prove why they are wrong in that form and show the errors in the proof of the main result of [1]. Next, we compare the assumptions and related results of [1] with similar works in the literature. Lastly, we give suggestions to complement the shortcomings of the hypotheses and thus correct them. © 1963-2012 IEEE.

关键词： Nonlinear simulations

来源：评论

学校读者我要写书评

暂无评论

Nonlinearity in Large-Cycle Cellular Automata

引用

Complex Systems 2025年第1期34卷 129-160页

作者： Mukherjee, Sukanya Adak, Sumit Department of Computer Science and Engineering Institute of Engineering and Management Kolkata University of Engineering and Management West Bengal Kolkata700091 India Department of Applied Mathematics and Computer Science DTU Compute Technical University of Denmark Kgs. Lyngby2800 Denmark

The class of maximal-length cellular automata (CAs) has gained significant attention over the last few years due to the fact that it can generate cycles with the longest possible lengths. For every l of the form l = 2n-1 where n ∈ , a cycle of length l can be generated by a cellular automaton (CA) of size ⌊log2 l⌋ + 1;this maximal-length CA is in fact the optimal (minimum-sized) CA to generate a cycle of length l. However, maximal-length CAs are, in general, linear and have some drawbacks. Moreover, it is nontrivial to address this problem for any l ∈ , that is, removing the constraint that l is of the form 2n-1. In this paper we therefore employ nonlinearity in the rules and aim to generate the near-optimal CA for any given cycle length l, meaning that the generated CAs will be of size n = (⌊log2 l⌋ + 1) + d, where the displacement d is as small as possible. We use a generic operator to concatenate a collection of component CAs of sizes n1, n2, …, nk by employing an evolutionary strategy. Here, n = n1 + n2 + ⋯ + nk and l ≥ lcm(1, 2, …, k ), where i (1 ≤ i ≤ k) is the maximum cycle length of a CA of size ni . An influencing factor in the design of component CAs is to achieve the near-optimal CA for a given cycle length. Here we consider nonlinear reversible large-cycle CAs as component CAs. We also measure the effectiveness of nonlinearity in large-cycle generation. © 2025, Complex Systems Publications, Inc. All rights reserved.

关键词： CAs cellular automata evolution large-cycle CA neighborhood dependent nonlinearity reversible CAs

来源：评论

学校读者我要写书评

暂无评论

Improved Bounds on the Size of Permutation codes under Kendall τ-metric

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4156-4166页

作者： Parvaresh, Farzad Sobhani, Reza Abdollahi, Alireza Bagherian, Javad Jafari, Fatemeh Khatami, Maryam University of Isfahan Faculty of Engineering Department of Electrical Engineering Isfahan Iran School of Mathematics Tehran19395-5746 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Applied Mathematics and Computer Science Isfahan81746-73441 Iran University of Isfahan Faculty of Mathematics and Statistics Department of Pure Mathematics Isfahan81746-73441 Iran

In order to overcome the challenges caused by flash memories and also to protect against errors related to reading information stored in DNA molecules in the shotgun sequencing method, the rank modulation method has been proposed. In the rank modulation framework, codewords are permutations. In this paper, we study the largest size P(n, d) of permutation codes of length n, i.e., subsets of the set Sn of all permutations on {1, ..., n} with the minimum distance at least (Formula presented) under the Kendall τ-metric. By presenting an algorithm and two theorems, we improve the known lower and upper bounds for P(n, d). In particular, we show that P(n, d) = 4 for all n ≥ 6 and (Formula presented). Additionally, we prove that for any prime number n and integer (Formula presented). This result greatly improves the upper bound of P(n, 3) for all primes n ≥ 37. © 1963-2012 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Fine-Tuned Attribute Weighted Naïve Bayes with Modified Partial Instances Reduction for Gaming Disorder Classification

HighTech and Innovation Journal

引用

HighTech and Innovation Journal 2025年第1期6卷 67-80页

作者： Latubessy, Anastasya Wardoyo, Retantyo Musdholifah, Aina Kusrohmaniah, Sri Doctoral Program Department of Computer Science and Electronics Faculty of Mathematics and Natural Science Universitas Gadjah Mada Yogyakarta55281 Indonesia Department of Informatics Engineering Faculty of Engineering Universitas Muria Kudus Indonesia Department of Computer Science and Electronics Faculty of Mathematics and Natural Science Universitas Gadjah Mada Yogyakarta55281 Indonesia Department of Psychology Faculty of Psychology Universitas Gadjah Mada Yogyakarta55281 Indonesia

Fine Tuning Attribute Weighted Naïve Bayes (FTAWNB) is a reliable modified Naïve Bayes model. Even though it is able to provide high accuracy on ordinal data, this model is sensitive to outliers. To improve the performance of FTAWNB, this research modified the Partial Instances Reduction (PIR) technique to make the FTAWNB more adaptive to outliers. Nevertheless, in contrast to the original PIR technique, which substitutes missing values for data values deemed outliers, the PIR technique suggested in this study replaces data values deemed outliers using a Naïve Bayes weighting approach. The attribute values from the outlier data are replaced with the highest probability values for the attributes in the actual class. This PIR technique is referred to as modified PIR. The FTAWNB model with modified PIR has been evaluated using the Gaming Disorder dataset. Replacing the four attributes with the least amount of information resulted in accuracy gains of 99.74%, an increase of 1.53% over the FTAWNB model. The experimental result shows that adding the modified PIR technique to the FTAWNB model can handle the outlier in the data, proving it by increasing the performance in terms of accuracy, precision, and recall without pruning the dataset used. © 2025, Ital Publication. All rights reserved.

关键词： Attribute Weighted Classification Fine-Tune Gaming Disorder Instances Reduction Naïve Bayes

来源：评论

学校读者我要写书评

暂无评论

Global Piecewise Analysis of HIV Model with Bi-Infectious Categories under Ordinary Derivative and Non-Singular Operator with Neural Network Approach

引用

computer Modeling in Engineering & sciences 2025年第1期142卷 609-633页

作者： Ghaliah Alhamzi Badr Saad TAlkahtani Ravi Shanker Dubey Mati ur Rahman Department of Mathematics and Statistics College of ScienceImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh13318Saudi Arabia Department of Mathematics College of ScienceKing Saud UniversityRiyadh11989Saudi Arabia Department of Mathematics Amity School of Applied SciencesAmity University RajasthanJaipur302002India School of Mathematical Sciences Jiangsu UniversityZhenjiang212013China Department of Computer Science and Mathematics Lebanese American UniversityBeirut13-5053Lebanon

This study directs the discussion of HIV disease with a novel kind of complex dynamical generalized and piecewise operator in the sense of classical and Atangana Baleanu(AB)derivatives having arbitrary *** HIV infection model has a susceptible class,a recovered class,along with a case of infection divided into three sub-different levels or categories and the recovered *** total time interval is converted into two,which are further investigated for ordinary and fractional order operators of the AB derivative,*** proposed model is tested separately for unique solutions and existence on bi *** numerical solution of the proposed model is treated by the piece-wise numerical iterative scheme of Newtons *** proposed method is established for piece-wise derivatives under natural order and non-singular Mittag-Leffler *** cross-over or bending characteristics in the dynamical system of HIV are easily examined by the aspect of this research having a memory effect for controlling the said *** study uses the neural network(NN)technique to obtain a better set of weights with low residual errors,and the epochs number is considered *** obtained figures represent the approximate solution and absolute error which are tested with NN to train the data accurately.

关键词： HIV infection model qualitative scheme approximate solution piecewise global operator neural network

来源：评论

学校读者我要写书评

暂无评论

Generation of Cycle Permutation Graphs and Permutation Snarks 50th

Generation of Cycle Permutation Graphs and Permutation Sna...

引用

50th International Conference on Current Trends in Theory and Practice of computer science, SOFSEM 2025

作者： Goedgebeur, Jan Renders, Jarne Department of Computer Science KU Leuven Kulak Kortrijk8500 Belgium Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

ISBN: (纸本)9783031826696

We present an algorithm for the efficient generation of all pairwise non-isomorphic cycle permutation graphs, i.e. cubic graphs with a 2-factor consisting of two chordless cycles, and non-hamiltonian cycle permutation graphs, from which the permutation snarks can easily be computed. This allows us to generate all cycle permutation graphs up to order 34 and all permutation snarks up to order 46, improving upon previous computational results by Brinkmann et al. Moreover, we give several improved lower bounds for interesting permutation snarks, such as for a smallest permutation snark of order 6mod8 or a smallest permutation snark of girth at least 6. These computational results also allow us to complete a characterisation of the orders for which non-hamiltonian cycle permutation graphs exist, answering an open question by Klee from 1972, and yield many more counterexamples to a conjecture by Zhang. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Examining finite-time behaviors in the fractional Gray–Scott model: Stability, synchronization, and simulation analysis

引用

International Journal of Cognitive Computing in Engineering 2025年 6卷 380-390页

作者： Momani, Shaher Batiha, Iqbal M. Bendib, Issam Ouannas, Adel Hioual, Amel Mohamed, Dalah Department of Mathematics Faculty of Science The University of Jordan Amman11942 Jordan Ajman University Ajman United Arab Emirates Department of Mathematics Al Zaytoonah University of Jordan Amman11733 Jordan Applied Mathematics & Modeling Laboratory Department of Mathematics Faculty of Exact Sciences University of Brothers Mentouri Constantine25000 Algeria Department of Mathematics and Computer Science University of Oum El Bouaghi Oum El Bouaghi04000 Algeria

This paper investigates the behavior and stability of the fractional-order Gray–Scott model, with a specific focus on achieving finite-time stability and synchronization. It introduces essential concepts, including the Gamma function, the Riemann–Liouville fractional-order integral operator, the Caputo fractional derivative, and the Mittag-Leffler function, to establish a foundational framework for subsequent analysis. Equilibrium points are defined, distinguishing between initial and finite-time equilibria, and the conditions for finite-time stability, including settling time, are precisely outlined. Stability results for this model are presented through theorems with detailed proofs, elucidating the roles of Lyapunov functions, class functions, and other system parameters. Furthermore, the paper explores finite-time synchronization schemes in master–slave systems, providing a mathematical framework for understanding and achieving synchronization within a finite time frame. This framework illuminates synchronization dynamics and their practical implications for controlling complex systems. Additionally, numerical examples illustrate finite-time stability and synchronization within the Gray–Scott reaction–diffusion model. © 2025 The Authors

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

Availability assessment of repairable linear consecutive k-out-of-n: F systems incorporating uncertainty and multiple failure modes

引用

Life Cycle Reliability and Safety Engineering 2025年 1-10页

作者： Khati, Amisha Singh, S.B. Department of Mathematics Statistics and Computer Science G. B. Pant University of Agriculture and Technology Pantnagar India Department of Applied Science and Humanities RIT Roorkee India

This study evaluates the interval-valued availability of a linear consecutive k-out-of-n: F system while considering uncertainty, where the probability that the system will perform as intended is not known with precision. The proposed system is susceptible to µ number of different failure modes and undergoes periodic inspections. Each failure mode has a randomly assigned failure time, and upon failure due to the mth failure mode, an immediate corrective repair is carried out, taking an arbitrary length of time ψm (m = 1, 2,…, µ). By integrating these factors, this research establishes theorems describing point and steady-state availability bounds. Subsequently, it conducts a sensitivity assessment to evaluate how variations in the inspection period affect the system’s availability. The findings are demonstrated with an instance of an oil pipeline system. This study offers valuable insights into the reliability and availability modelling of complex systems under uncertainty, with applications across diverse engineering domains. © The Author(s), under exclusive licence to Society for Reliability and Safety (SRESA) 2025.

关键词： Interval valued point availability Interval valued steady state availability Linear consecutive k-out-of n: F system Multiple failure modes Sensitivity analysis Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Metrics of Success: Evaluating User Satisfaction in AI Chatbots 24

Metrics of Success: Evaluating User Satisfaction in AI Chatb...

引用

8th International Conference on Advances in Artificial Intelligence, ICAAI 2024

作者： Møller, Cecilie Grace Ang, Ke En de Lourdes Bongiovanni, María Khalid, Md Saifuddin Wu, Jiayan Department of Digitalization Copenhagen Business School Fredriksberg Denmark Department of Applied Mathematics and Computer Science Danmarks Tekniske Universitet Lyngby Denmark

ISBN: (纸本)9798400718014

The rapid advancement of Artificial Intelligence (AI), particularly through Large Language Models (LLMs), has catalysed a technological revolution, leading to the widespread adoption of AI-driven chatbots across industries. OpenAI’s customisable generative pretrained transformer (GPT) offerings have popularised generative AI, enabling organisations of all sizes to implement chatbots for customer support. This development presents an opportunity for businesses to offer 24/7, cost-efficient customer service that can overcome the historical limitations of chatbots that lack a "human element." However, despite the proliferation of AI chatbots, there remains a crucial need to evaluate their effectiveness in meeting user needs and preferences for human-like interaction. Current service quality assessment tools, such as SERVQUAL and E-SERVQUAL, are unable to evaluate AI-specific capabilities like language intelligence and recognition. Existing research also lacks information on factors that affect user satisfaction and the continued use of AI chatbots. Based on a mixed-methods study, this paper proposes a new instrument for measuring user satisfaction with AI chatbots, specifically for customer support roles. Using the Stanford five-step Design Thinking Process, this study devised a customer support AI chatbot evaluation instrument through a literature review, Cheatstorming, and SCAMPER techniques, followed by testing in a Danish company. The research employs Prentice and Nguyen’s three-stage scale development process to ensure content, reliability, and construct validity, addressing gaps in current scholarship and advancing understanding of AI chatbot user satisfaction. © 2024 Copyright held by the owner/author(s).

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：