Search Results (2,114)

The in-plane folding wing is one of the important research directions in the field of morphing or bionic aircraft, showing the unique application value of enhancing aircraft maneuverability and gust resistance. This article provides a structural realization of an in-plane folding wing and an aeroelasticity modeling method for the folding process of the wing. By approximating the change in structural properties in each time step, a method for calculating the structural transient response expressed in recursive form is obtained. On this basis, an aeroelasticity model of the wing is developed by coupling with the aerodynamic model using the unsteady panel/viscous vortex particle hybrid method. A wind-tunnel test is implemented to demonstrate the controllable morphing capability of the wing under aerodynamic loads and to validate the reliability of the wing loads predicted by the method in this paper. The results of the gust simulation show that the gust scale has a significant effect on the response of both the open- and closed-loop systems. When the gust alleviation controller is enabled, the peak bending moment at the wing root can be reduced by 5.5%∼47.3% according to different gust scales. Full article

This paper investigates the complexity of real functions through proof techniques inspired by formal language theory. Productiveness, which is a stronger form of non-recursive enumerability, is employed to analyze the complexity of various problems related to real functions. Our work provides a deep reexamination of Hilbert’s tenth problem and the equivalence to the identically 0 function problem, extending the undecidability results of these problems into the realm of productiveness. Additionally, we study the complexity of the equivalence to the identically 0 function problem over different domains. We then construct highly efficient many-one reductions to establish Rice-style theorems for the study of real functions. Specifically, we show that many predicates, including those related to continuity, differentiability, uniform continuity, right and left differentiability, semi-differentiability, and continuous differentiability, are as hard as the equivalence to the identically 0 function problem. Due to their high efficiency, these reductions preserve nearly any level of complexity, allowing us to address both complexity and productiveness results simultaneously. By demonstrating these results, which highlight a more nuanced and potentially more intriguing aspect of real function theory, we provide new insights into how various properties of real functions can be analyzed. Full article

Wetlands play a vital role in regulating the global carbon cycle, providing biodiversity, and reducing flood risks. These functions maintain ecological balance and ensure human well-being. Timely, accurate monitoring of wetlands is essential, not only for conservation efforts, but also for achieving Sustainable Development Goals (SDGs). In this study, we combined Sentinel-1/2 images, terrain data, and field observation data collected in 2020 to better understand wetland distribution. A total of 22 feature variables were extracted from multi-source data, including spectral bands, spectral indices (especially red edge indices), terrain features, and radar features. To avoid high correlations between variables and reduce data redundancy, we selected a subset of features based on recursive feature elimination (RFE) and Pearson correlation analysis methods. We adopted the random forest (RF) method to construct six wetland delineation schemes and incorporated multiple types of characteristic variables. These variables were based on remote sensing image pixels and objects. Combining red-edge features, terrain data, and radar data significantly improved the accuracy of land cover information extracted in low-mountain and hilly areas. Moreover, the accuracy of object-oriented schemes surpassed that of pixel-level methods when applied to wetland classification. Among the three pixel-based schemes, the addition of terrain and radar data increased the overall classification accuracy by 7.26%. In the object-based schemes, the inclusion of radar and terrain data improved classification accuracy by 4.34%. The object-based classification method achieved the best results for swamps, water bodies, and built-up land, with relative accuracies of 96.00%, 90.91%, and 96.67%, respectively. Even higher accuracies were observed in the pixel-based schemes for marshes, forests, and bare land, with relative accuracies of 98.67%, 97.53%, and 80.00%, respectively. This study’s methodology can provide valuable reference information for wetland data extraction research and can be applied to a wide range of future research studies. Full article

The increasing complexity of modern mechanical systems, especially rotating machinery, demands effective condition monitoring techniques, particularly deep learning, to predict potential failures in a timely manner and enable preventative maintenance strategies. Health monitoring data analysis, a widely used approach, faces challenges due to data randomness and interpretation difficulties, highlighting the importance of robust data quality analysis for reliable monitoring. This paper presents a two-part approach to address these challenges. The first part focuses on comprehensive data preprocessing using only feature scaling and selection via random forest (RF) algorithm, streamlining the process by minimizing human intervention while managing data complexity. The second part introduces a Recurrent Expansion Network (RexNet) composed of multiple layers built on recursive expansion theories from multi-model deep learning. Unlike traditional Rex architectures, this unified framework allows fine tuning of RexNet hyperparameters, simplifying their application. By combining data quality analysis with RexNet, this methodology explores multi-model behaviors and deeper interactions between dependent (e.g., health and condition indicators) and independent variables (e.g., Remaining Useful Life (RUL)), offering richer insights than conventional methods. Both RF and RexNet undergo hyperparameter optimization using Bayesian methods under variability reduction (i.e., standard deviation) of residuals, allowing the algorithms to reach optimal solutions and enabling fair comparisons with state-of-the-art approaches. Applied to high-speed bearings using a large wind turbine dataset, this approach achieves a coefficient of determination of 0.9504, enhancing RUL prediction. This allows for more precise maintenance scheduling from imperfect predictions, reducing downtime and operational costs while improving system reliability under varying conditions. Full article

With the rapid development of internet and AI technologies, Agricultural Expert Systems (AESs) have become crucial for delivering technical support and decision-making in agricultural management. However, traditional natural language processing methods often struggle with specialized terminology and context, and they lack the adaptability to handle complex text classifications. The diversity and evolving nature of agricultural texts make deep semantic understanding and integration of contextual knowledge especially challenging. To tackle these challenges, this paper introduces a Bidirectional Encoder Recurrent Convolutional Neural Network (AES-BERCNN) tailored for short-text classification in agricultural expert systems. We designed an Agricultural Text Encoder (ATE) with a six-layer transformer architecture to capture both preceding and following word information. A recursive convolutional neural network based on Gated Recurrent Units (GRUs) was also developed to merge contextual information and learn complex semantic features, which are then combined with the ATE output and refined through max-pooling to form the final feature representation. The AES-BERCNN model was tested on a self-constructed agricultural dataset, achieving an accuracy of 99.63% in text classification. Its generalization ability was further verified on the Tsinghua News dataset. Compared to other models such as TextCNN, DPCNN, BiLSTM, and BERT-based models, the AES-BERCNN shows clear advantages in agricultural text classification. This work provides precise and timely technical support for intelligent agricultural expert systems. Full article

Recursive neural networks and transformers have recently become dominant in hyperspectral (HS) image classification due to their ability to capture long-range dependencies in spectral sequences. Despite the success of these sequential architectures, mainstream deep learning methods primarily handle two-dimensional structured data. However, challenges such as the curse of dimensionality, spectral variability, and confounding factors in hyperspectral remote sensing images limit their effectiveness, especially in remote sensing applications. To address this issue, this paper proposes a novel land cover classification algorithm that integrates random forests with a spectral transformer network structure (RS-Net). Firstly, this paper presents a combination of the Gramian Angular Field (GASF) and Gramian Angular Difference Field (GADF) algorithms, which effectively maps the multidimensional time series constructed for each pixel onto two-dimensional image features, enabling precise extraction and recognition in the backend network algorithms and improving the classification accuracy of land cover types. Secondly, to capture the relationships between features at different scales, this paper proposes a SpectralFormer network architecture using the Context and Structure Encoding (CASE) module to effectively learn dependencies between channels. This architecture enhances important features and suppresses unimportant ones, thereby addressing the semantic gap and improving the recognition capability of land cover features. Finally, the final prediction results are determined by a voting mechanism from the Random Forest algorithm, which synthesizes predictions from multiple decision trees to enhance classification stability and accuracy. To better compare the performance of RS-Net, this paper conducted extensive experiments on three benchmark HS datasets obtained from satellite and airborne imagers, comparing various classic neural network models. Surprisingly, the RS-Net algorithm achieves high performance and efficiency, offering a new and effective tool for land cover classification. Full article

Underwater sonar is the primary remote sensing and imaging modality within turbid environments with poor visibility. The two-dimensional (2-D) images of a target near the air–sea interface (or resting on a hard seabed), acquired by forward-scan sonar (FSS), are generally corrupted by the ghost and sometimes mirror components, formed by the multipath propagation of transmitted acoustic beams. In the processing of the 2-D FSS views to generate an accurate three-dimensional (3-D) object model, the corrupted regions have to be discarded. The sonar tilt angle and distance from the sea surface are two important parameters for the accurate localization of the ghost and mirror components. We propose a unified optimization technique for improving both the measurements of these two parameters from inexpensive sensors and the accuracy of a 3-D object model using 2-D FSS images at known poses. The solution is obtained by the recursive updating of sonar parameters and 3-D object model. Utilizing the 3-D object model, we can enhance the original images and generate synthetic views for arbitrary sonar poses. We demonstrate the performance of our method in experiments with the synthetic and real images of three targets: two dominantly convex coral rocks and a highly concave toy wood table. Full article

This research investigates how university students define and perceive success, an area that is increasingly important to ensuring that a university’s brand remains aligned to the expectations of future students. Over the next decade, university students will comprise members of Generation Z (Gen Z), and by recognizing this group of students’ preferences and aspirations, universities can tailor their branding, educational portfolio, and overall campus experiences to ensure that together they resonate and satisfy evolving needs and demands. Using data based on a sample of Gen Z undergraduate students undertaking their degrees at three case study UK post-1992 universities, this research adopted an exploratory, interpretivist methodology. Data collected from semi-structured interviews were analyzed using recursive abstraction to identify underlying patterns and trends within the data. The research identified five key themes that Gen Z are using to define success, and these are the following: (1) being objective and task-driven; (2) embracing fluidity and subjectivity; (3) being ethically and morally responsible; (4) having resilience; and (5) accepting and learning from failure. Recommendations were made for actions that universities should start to take to enable them to work toward achieving this. Full article

High-resolution optical images will provide planetary geology researchers with finer and more microscopic image data information. In order to maximize scientific output, it is necessary to further increase the resolution of acquired images, so image super-resolution (SR) reconstruction techniques have become the best choice. Aiming at the problems of large parameter quantity and high computational complexity in current deep learning-based image SR reconstruction methods, we propose a novel Recursive Swin Transformer Super-Resolution Network (RSTSRN) for SR applied to images. The RSTSRN improves upon the LapSRN, which we use as our backbone architecture. A Residual Swin Transformer Block (RSTB) is used for more efficient residual learning, which consists of stacked Swin Transformer Blocks (STBs) with a residual connection. Moreover, the idea of parameter sharing was introduced to reduce the number of parameters, and a multi-scale training strategy was designed to accelerate convergence speed. Experimental results show that the proposed RSTSRN achieves superior performance on 2×, 4× and 8×SR tasks to state-of-the-art methods with similar parameters. Especially on high-magnification SR tasks, the RSTSRN has great performance superiority. Compared to the LapSRN network, for 2×, 4× and 8× Mars image SR tasks, the RSTSRN network has increased PSNR values by 0.35 dB, 0.88 dB and 1.22 dB, and SSIM values by 0.0048, 0.0114 and 0.0311, respectively. Full article

Greedy search (GS) or exhaustive search plays a crucial role in decision trees and their various extensions. We introduce an alternative splitting method called smooth sigmoid surrogate (SSS) in which the indicator threshold function used in GS is approximated by a smooth sigmoid function. This approach allows for parametric smoothing or regularization of the erratic and discrete GS process, making it more effective in identifying the true cutoff point, particularly in the presence of weak signals, as well as less prone to the inherent end-cut preference problem. Additionally, SSS provides a convenient means of evaluating the best split by referencing a parametric nonlinear model. Moreover, in many variants of recursive partitioning, SSS can be reformulated as a one-dimensional smooth optimization problem, rendering it computationally more efficient than GS. Extensive simulation studies and real data examples are provided to evaluate and demonstrate its effectiveness. Full article

Breast cancer is a heterogeneous disease composed of various biologically distinct subtypes, each characterized by unique molecular features. Its formation and progression involve a complex, multistep process that includes the accumulation of numerous genetic and epigenetic alterations. Although integrating RNA-seq transcriptome data with ATAC-seq epigenetic information provides a more comprehensive understanding of gene regulation and its impact across different conditions, no classification model has yet been developed for breast cancer intrinsic subtypes based on such integrative analyses. In this study, we employed machine learning algorithms to predict intrinsic subtypes through the integrative analysis of ATAC-seq and RNA-seq data. We identified 10 signature genes (CDH3, ERBB2, TYMS, GREB1, OSR1, MYBL2, FAM83D, ESR1, FOXC1, and NAT1) using recursive feature elimination with cross-validation (RFECV) and a support vector machine (SVM) based on SHAP (SHapley Additive exPlanations) feature importance. Furthermore, we found that these genes were primarily associated with immune responses, hormone signaling, cancer progression, and cellular proliferation. Full article

This paper is concerned with the state estimation problem based on non-fragile set-membership filtering for a class of measurement-saturated memristive neural networks (MNNs) with unknown but bounded (UBB) noises, mixed time delays and missing measurements (MMs), subject to cyber-attacks under the framework of weighted try-once-discard protocol (WTOD protocol). Considering bandwidth-limited open networks, this paper proposes an improved set-membership filtering based on WTOD protocol to partially solve the problem that multiple sensor-related problems and multiple network-induced phenomena influence the state estimation performance of MNNs. Moreover, this paper also discusses the gain perturbations of the estimator and proposes an improved non-fragile estimation framework based on set-membership filtering, which enhances the robustness of the estimation approach. The proposed estimation framework can effectively estimate the state of MNNs with UBB noises, estimator gain perturbations, mixed time-delays, cyber-attacks, measurement saturations and MMs. This paper first utilizes mathematical induction to provide the sufficient conditions for the existence of the desired estimator, and obtains the estimator gain by solving a set of linear matrix inequalities. Then, a recursive optimization algorithm is utilized to achieve optimal estimation performance. The effectiveness of the theoretical results is verified by comparative numerical simulation examples. Full article

In response to the COVID-19 pandemic, governments worldwide have implemented mandatory face mask regulations in crowded public spaces, making the development of automatic face mask detection systems critical. To achieve robust face mask detection performance, a high-quality and comprehensive face mask dataset is required. However, due to the difficulty in obtaining face samples with masks in the real-world, public face mask datasets are often imbalanced, leading to the data imbalance problem in model training and negatively impacting detection performance. To address this problem, this paper proposes a novel recursive model-training technique designed to improve detection accuracy on imbalanced datasets. The proposed method recursively splits and merges the dataset based on the attribute characteristics of different classes, enabling more balanced and effective model training. Our approach demonstrates that the carefully designed splitting and merging of datasets can significantly enhance model-training performance. This method was evaluated using two imbalanced datasets. The experimental results show that the proposed recursive learning technique achieves a percentage increase (PI) of 84.5% in mean average precision ([email protected]) on the Kaggle dataset and of 186.3% on the Eden dataset compared to traditional supervised learning. Additionally, when combined with existing oversampling techniques, the PI on the Kaggle dataset further increases to 88.9%, highlighting the potential of the proposed method for improving detection accuracy in highly imbalanced datasets. Full article

For $2\le t\le m$, let ${\mathbb{Z}}_m$ denote the group of integers modulo m, and let $T{C}_m^{\left(t\right)}$ denote the t-uniform hypergraph with vertex set ${\mathbb{Z}}_m$ and hyperedge set $\{\{i,i+1,i+2,\dots ,i+t-1\}:i\in {\mathbb{Z}}_m\}$. Any hypergraph isomorphic to $T{C}_m^{\left(t\right)}$ is a t-uniform tight m-cycle. In this paper, we consider the existence of tight 9-cycle decompositions of $\lambda$-fold complete 3-uniform hypergraphs. According to the recursive constructions, the required designs of small orders are found. For hypergraphs with large orders, they can be recursively generated using some designs of small orders. Then, we obtain the necessary and sufficient conditions for the existence of $T{C}_9^{\left(3\right)}$-decomposition of $\lambda K_n^{\left(3\right)}$. We show there exists a $T{C}_9^{\left(3\right)}$-decomposition of $\lambda K_n^{\left(3\right)}$ if and only if $\lambda n(n-1)(n-2)\equiv 0(mod54)$, $\lambda (n-1)(n-2)\equiv 0(mod6)$ and $n\ge 9$. Full article

In this paper, using a scaling symmetry, it is shown how to compute polynomial conservation laws, generalized symmetries, recursion operators, Lax pairs, and bilinear forms of polynomial nonlinear partial differential equations, thereby establishing their complete integrability. The Gardner equation is chosen as the key example, as it comprises both the Korteweg–de Vries and modified Korteweg–de Vries equations. The Gardner and Miura transformations, which connect these equations, are also computed using the concept of scaling homogeneity. Exact solitary wave solutions and solitons of the Gardner equation are derived using Hirota’s method and other direct methods. The nature of these solutions depends on the sign of the cubic term in the Gardner equation and the underlying mKdV equation. It is shown that flat (table-top) waves of large amplitude only occur when the sign of the cubic nonlinearity is negative (defocusing case), whereas the focusing Gardner equation has standard elastically colliding solitons. This paper’s aim is to provide a review of the integrability properties and solutions of the Gardner equation and to illustrate the applicability of the scaling symmetry approach. The methods and algorithms used in this paper have been implemented in Mathematica, but can be adapted for major computer algebra systems. Full article