Journal of The Franklin Institute-engineering and Applied Mathematics最新文献_第4页

Identification of linear parameter-varying system with missing measurement data and outliers

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107547

Xiang Chen, Xiaogang Wang, Fei Liu

引用次数: 0

Performance constrained trajectory tracking control for free-flying flexible-joint space robots based on adaptive sliding mode disturbance observer

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107524

Dingfeng Gao, Xiutao Gu, Liaoxue Liu, Yu Guo

{"title":"Performance constrained trajectory tracking control for free-flying flexible-joint space robots based on adaptive sliding mode disturbance observer","authors":"Dingfeng Gao, Xiutao Gu, Liaoxue Liu, Yu Guo","doi":"10.1016/j.jfranklin.2025.107524","DOIUrl":"10.1016/j.jfranklin.2025.107524","url":null,"abstract":"<div><div>Aiming at the trajectory tracking control with performance constraints and actuator saturation for free-flying flexible-joint space robots (FFSR) under uncertain external disturbance. In the framework of the command filter backstepping method, a composite controller combining tan-type barrier Lyapunov function (TBLF) and anticipatory activation anti-saturation (AAA) is proposed. A finite-time prescribed performance function (FPPF) is developed to improve the transient performances of trajectory tracking. In addition, an adaptive sliding mode disturbance observer (ASMDO) is designed to estimate the uncertain external disturbance, with a novel log-type barrier function based adaptive control law (LBFACL) to prevent successive monotonic increases in gain and mitigate the risk of gain tending to infinity at the regional boundary. The simulation results show that the trajectory tracking performance of FFSR system under the designed control scheme has fast convergence speed and high accuracy.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 4","pages":"Article 107524"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143348298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributed event-triggered adaptive fuzzy finite-time control for multiple QUAVs with time-varying state constraints

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2024.107505

Changhui Wang, Yihao Wang, Mei Liang, Yibao Chen

引用次数: 0

Color image watermarking scheme based on singular value decomposition of split quaternion matrices

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107508

Gang Wang , Tongsong Jiang , Dong Zhang , V.I. Vasil’ev

{"title":"Color image watermarking scheme based on singular value decomposition of split quaternion matrices","authors":"Gang Wang , Tongsong Jiang , Dong Zhang , V.I. Vasil’ev","doi":"10.1016/j.jfranklin.2025.107508","DOIUrl":"10.1016/j.jfranklin.2025.107508","url":null,"abstract":"<div><div>As digital media increasingly faces copyright threats, robust protection schemes are crucial. While gray-scale watermarking techniques are well-developed, color watermarking problems require more advanced solutions due to the complex spectral relationships among RGB channels. This paper introduces a novel color watermarking scheme based on the split quaternion matrix model, a 4D algebraic structure that preserves the linear spectral relationships among RGB channels, enhances computational efficiency, and improves color image processing. Watermark embedding employs a double split quaternion singular value decomposition (SVDSQ) process. The host image is divided into patches, and dominant singular values are extracted from each patch using SVDSQ. These values are assembled into a matrix, which undergoes a second SVDSQ to embed the watermark. This dual-layered method enhances the adaptability of the watermark embedding payload. Experimental results show that, under the same experimental conditions, our watermarking scheme demonstrates strong robustness against noise and geometric attacks, while maintaining a high peak signal-to-noise ratio (PSNR <span><math><mo>≥</mo></math></span> 35), compared to recent watermarking schemes. Despite introducing real part redundancy and requiring prior information for the watermark extraction, this approach advances color image processing using split quaternion matrices. Future work will focus on addressing these limitations and exploring new applications.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 3","pages":"Article 107508"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fuzzy control for Markov singularly perturbed systems with dynamic-probabilistic event-triggered mechanism

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107514

Xiaoke Tang , Yunliang Wang , Jun Cheng , Dan Zhang , Wenhai Qi

引用次数: 0

Dynamic regret for decentralized online bandit gradient descent with local steps

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107530

Honglei Liu, Baoyong Zhang, Deming Yuan

{"title":"Dynamic regret for decentralized online bandit gradient descent with local steps","authors":"Honglei Liu, Baoyong Zhang, Deming Yuan","doi":"10.1016/j.jfranklin.2025.107530","DOIUrl":"10.1016/j.jfranklin.2025.107530","url":null,"abstract":"<div><div>In this paper, we focus on a decentralized online convex optimization problem over a multi-agent system, where each agent is equipped with a time-varying objective function. To handle the communication bottleneck and reduce the communication costs, we consider the method of local steps, where the agents communicate with their neighbors after performing local gradient descent steps. Under bandit feedback, we develop the Local-Decentralized Online Bandit Gradient Descent (Local-DOBGD) algorithm, which combines local steps and gradient descent. The performance of the developed algorithm is analyzed and the dynamic regret bound <span><math><mrow><mi>O</mi><mfenced><mrow><msqrt><mrow><mi>T</mi><mrow><mo>(</mo><mn>1</mn><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>T</mi></mrow></msub><mo>)</mo></mrow></mrow></msqrt></mrow></mfenced></mrow></math></span> is obtained, which is concerned with time horizon <span><math><mi>T</mi></math></span> and path-length <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>T</mi></mrow></msub></math></span>. Finally, we provide a numerical example to verify the effectiveness of the Local-DOBGD algorithm.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 4","pages":"Article 107530"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143145430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Dynamic event-triggered optimal critic-only control strategy for nonlinear systems based on state observer

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107519

Yuhui Fu, Yuan Fan

{"title":"Dynamic event-triggered optimal critic-only control strategy for nonlinear systems based on state observer","authors":"Yuhui Fu, Yuan Fan","doi":"10.1016/j.jfranklin.2025.107519","DOIUrl":"10.1016/j.jfranklin.2025.107519","url":null,"abstract":"<div><div>This paper develops a dynamic event-triggered optimal control method based on a critic neural network (CNN) for nonlinear continuous-time (CT) systems with a state observer. Firstly, a discounted cost function is introduced to solve the optimal problem of the nonlinear systems, and the related optimal performance index function and a Hamilton–Jacobi–Bellman (HJB) equation are established to obtain the optimal control law. Then, to reduce communication burdens, a dynamic event-triggered control (DETC) method is defined by adding an additional dynamic variable on the basis of the traditional event-triggered control (ETC) method to keep the aperiodic update of the systems, and the stability of the systems based on these two methods are proved, respectively. Moreover, to approximate the optimal solution of the HJB equation, a CNN is utilized to approximate the optimal performance index function and tune its weight by the gradient descent approach. By the Lyapunov method, the uniform ultimate boundedness (UUB) of the closed-loop systems is proved, while also excluding Zeno behavior. Finally, the effectiveness of the proposed optimal control strategy is verified by two simulations.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 4","pages":"Article 107519"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143146028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributed state-saturation secure filtering under Round-Robin protocol and deception attacks

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107529

Fang Zhao , Bo Wu , Xisheng Zhan , Lingli Cheng , Huaicheng Yan

{"title":"Distributed state-saturation secure filtering under Round-Robin protocol and deception attacks","authors":"Fang Zhao , Bo Wu , Xisheng Zhan , Lingli Cheng , Huaicheng Yan","doi":"10.1016/j.jfranklin.2025.107529","DOIUrl":"10.1016/j.jfranklin.2025.107529","url":null,"abstract":"<div><div>The distributed secure filtering issue is concerned for discrete time-varying systems with state-saturation constraints subjected to both deception attacks and Round-Robin (RR) protocol over sensor networks in this paper. Firstly, the phenomenon of state-saturation, a prevalent issue encountered in real-world projects, is considered in this paper. In order to reduce the burden on the network, the RR protocol is introduced to determine which sensor node is connected to the network at each transmission moment. Subsequently, the randomness of the occurrence of deception attacks is modeled in this paper, with each event being assigned a specific probability through the utilization of a series of Bernoulli-distributed white sequences. Next, a sufficient condition for the expectation filter to satisfy the prediction error variance requirement is obtained based on the recursive linear matrix inequality (RLMI) method. Based on this, an optimization problem is created to find the filtering parameters that guarantee locally optimal filtering performance at every moment. Ultimately, the efficacy of the proposed algorithm is substantiated through a series of illustrative simulation scenarios.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 4","pages":"Article 107529"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143145432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Frequency-domain attention-guided adaptive robust watermarking model

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107511

Hong Zhang , Mohamed Meyer Kana Kone , Xiao-Qian Ma , Nan-Run Zhou

{"title":"Frequency-domain attention-guided adaptive robust watermarking model","authors":"Hong Zhang , Mohamed Meyer Kana Kone , Xiao-Qian Ma , Nan-Run Zhou","doi":"10.1016/j.jfranklin.2025.107511","DOIUrl":"10.1016/j.jfranklin.2025.107511","url":null,"abstract":"<div><div>Deep learning-based watermarking models usually take on shortcomings in visual fidelity and robustness. To address these limitations, a novel frequency-domain attention-guided adaptive robust watermarking model is explored. Frequency-domain transform and channel attention mechanism are integrated by the model, it dynamically adapts the watermark embedding process based on content features to ensure adaptability and robustness to different media types. To enhance the representation of image features, an information fusion module is designed to comprehensively capture both deep and shallow features of cover images for fusion with watermark. Additionally, the multi-scale frequency-domain attention module is deployed to generate an attention mask to guide the embedding of watermark, and the weight allocation for different frequencies are optimized during the watermark embedding. The robust feature learning is enhanced during the training by a noise layer. Furthermore, an information extraction module is devised to recover watermarks from the attacked encoded images. The experimental results indicate that the PSNR and the SSIM of the encoded image are above 44.65 dB and 0.9934 respectively. Meanwhile, the proposed model has strong robustness against JPEG attack, which achieves a bit accuracy >98.43 % for extracted messages with compression quality factor of 50. Besides, the proposed model shows strong robustness to many other distortions such as Gaussian noise, resizing, cropping, dropout and Salt & Pepper noise.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 3","pages":"Article 107511"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Shedding light on uncertainties in machine learning: formal derivation and optimal model selection

IF 3.7 3区计算机科学

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-02-01 DOI: 10.1016/j.jfranklin.2025.107548

Giulio Del Corso, Sara Colantonio, Claudia Caudai

{"title":"Shedding light on uncertainties in machine learning: formal derivation and optimal model selection","authors":"Giulio Del Corso, Sara Colantonio, Claudia Caudai","doi":"10.1016/j.jfranklin.2025.107548","DOIUrl":"10.1016/j.jfranklin.2025.107548","url":null,"abstract":"<div><div>The concept of uncertainty has always been important in the field of mathematical modeling. In particular, the growing application of Machine Learning and Deep Learning methods in many scientific fields has led to the implementation and use of new uncertainty quantification techniques aimed at distinguishing between reliable and unreliable predictions. However, the novelty of this discipline and the plethora of articles produced, ranging from theoretical results to purely applied experiments, has resulted in a very fragmented and cluttered literature. In this review, we have attempted to combine the well-established mathematical background of the Bayesian framework with the practical aspect of modern state-of-the-art emerging techniques in order to meet the urgent need for clarity on key concepts related to uncertainty quantification. First, we introduced the different sources of uncertainty, ranging from epistemic/reducible to aleatoric/irreducible, providing both a rigorous mathematical derivation and several examples to facilitate understanding. The review then details some of the most important techniques for uncertainty quantification. These methods are compared in terms of their advantages and drawbacks and classified in terms of their intrusiveness, in order to provide the practitioner with a useful vademecum for selecting the optimal model depending on the application context.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 3","pages":"Article 107548"},"PeriodicalIF":3.7,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143137201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0