Test Functions Research Articles

Contextuality of cognitive control deficits in alcohol dependence — pro et contra

Cognitive impairment, including cognitive control, mediates the negative social consequences of alcohol-related behavior, but few studies have examined these processes in the Russian speaking population using modern and standardized assessment methods. Thus, the aim of the study was to examine the features of cognitive control (inhibition of automatic response) and the general level of cognitive functioning in a Russianspeaking sample of alcohol-dependent individuals (AD) using quantitative assessment methods. Materials and Methods. 111 individuals diagnosed with alcohol dependence (F10.30) and 27 healthy participants were examined by using the Brief Assessment of Cognitive Functioning in Affective Disorders Battery (BAC-A) and additional tests of cognitive control (Stroop test with incongruent stimuli, Stroop test with alcohol-associated stimuli). The statistical methods were U-Mann-Whitney test, Spearman correlation coefficient, two-stage least squares regression. Results. In the AD group the indices of cognitive functioning were significantly lower in all parameters except for the subtests of verbal memory and digit sequence (p<0,05). The model of the relationship between the parameters of general cognitive functioning and cognitive control reveals that the index of incongruence to alcohol-related stimuli was a significant predictor of sampe affiliation. Discussion. The obtained results may indicate the presence of impairments of speed of mental processes, planning , verbal fluency and response inhibition function in the group of individuals with AD. In the studied group, the automatic response inhibition function mediates the general cognitive functioning only within the relevant contextual stimuli.

Short-term Traffic Flow Prediction Based on KELM Optimized By Improved Slime Mould Algorithm

Traffic flow prediction plays a crucial role in improving transportation efficiency and enhancing Intelligent Transportation Systems (ITS). However, the temporal, spatial, and nonlinear nature of traffic flow data presents challenges for accurate short-term prediction. We propose a short-term traffic flow prediction model based on Kernel Extreme Learning Machine (KELM) optimized by the improved Slime Mould Algorithm (SMA). KELM is an improved version of Extreme Learning Machine (ELM) that incorporates kernel functions for improved generalization and stability. SMA is a meta-heuristic algorithm inspired by the behavior of slime mould in foraging, known for its strong global searching ability. For better performance, three strategies are introduced: the Good Point Set method for optimizing the initial population, the combination of Opposition Based Learning (OBL) and Differential Evolution (DE) to improve the slime mould generation mechanism, and the use of adaptive t distribution mutation to enhance convergence speed. After comparing the performance of these improved SMAs on twelve test functions, the ISMA improved by integrating three strategies as mentioned above is best. Then the ISMA is applied to search for the optimal parameters of KELM model. Finally, the optimized KELM with optimal parameters is applied to predict the short-term traffic flow on given traffic data set. Experimental results demonstrate that the proposed model, KELM optimized by ISMA namely ISMA-KELM, outperforms existing models such as Random Forest (RF), Least Squares Support Vector Machine (LSSVM), KELM optimized by Tuna Swarm Optimization Algorithm (TSO-KELM), and KELM optimized by SMA (SMA-KELM) in terms of traffic flow prediction accuracy. The proposed model ISMA-KELM provides a promising approach for addressing the challenges of traffic flow prediction, offering improved accuracy and efficiency in real-time traffic management systems.

Development of novel nanostructured biosensors for rapid detection of pathogens in clinical diagnostics

<p class="MsoNormal" style="text-align: justify; text-justify: inter-ideograph; line-height: 120%; mso-pagination: none; layout-grid-mode: char; mso-layout-grid-align: none; margin: 12.0pt 0cm 6.0pt 0cm;"><span lang="EN-US" style="font-size: 10.0pt; line-height: 120%; font-family: 'Times New Roman',serif;">The prompt and precise identification of microorganisms is crucial for successful clinical diagnostics and the prevention of infectious disease outbreaks. Traditional diagnostic methods often suffer from limitations such as extended processing durations, elevated expenses, and the necessity for specialized laboratory equipment. In this research, we propose the development of novel nanostructured biosensors that utilize the distinct characteristics of nanomaterials to improve the accuracy, specificity, and efficiency of identifying pathogens. These biosensors are created with the intention of offering point-of-care testing functionality, thus rendering them appropriate for utilization in a range of clinical settings. The integration of advanced nanotechnology with bioanalytical methods aims to create a reliable system for the real-time identification of bacterial, viral, and fungal pathogens. This review encompasses the design, fabrication, and testing of the biosensors, along with a comprehensive analysis of their performance in comparison to conventional diagnostic techniques. The results demonstrate the potential of nanostructured biosensors to revolutionize pathogen detection, offering significant improvements in efficiency and accuracy, which are essential for timely medical intervention and public health management.</span></p>

Somersault Foraging and Elite Opposition-Based Learning Dung Beetle Optimization Algorithm

To tackle the shortcomings of the Dung Beetle Optimization (DBO) Algorithm, which include slow convergence speed, an imbalance between exploration and exploitation, and susceptibility to local optima, a Somersault Foraging and Elite Opposition-Based Learning Dung Beetle Optimization (SFEDBO) Algorithm is proposed. This algorithm utilizes an elite opposition-based learning strategy as the method for generating the initial population, resulting in a more diverse initial population. To address the imbalance between exploration and exploitation in the algorithm, an adaptive strategy is employed to dynamically adjust the number of dung beetles and eggs with each iteration of the population. Inspired by the Manta Ray Foraging Optimization (MRFO) algorithm, we utilize its somersault foraging strategy to perturb the position of the optimal individual, thereby enhancing the algorithm’s ability to escape from local optima. To verify the effectiveness of the proposed improvements, the SFEDBO algorithm is utilized to optimize 23 benchmark test functions. The results show that the SFEDBO algorithm achieves better solution accuracy and stability, outperforming the DBO algorithm in terms of optimization results on the test functions. Finally, the SFEDBO algorithm was applied to the practical application problems of pressure vessel design, tension/extension spring design, and 3D unmanned aerial vehicle (UAV) path planning, and better optimization results were obtained. The research shows that the SFEDBO algorithm proposed in this paper is applicable to actual optimization problems and has better performance.

A Combined Quasi-Newton-Type Method Using 4th-Order Directional Derivatives for Solving Degenerate Problems of Unconstrained Optimization

Introduction. Methods of unconstrained optimization play a significant role in machine learning [1–6]. When solving practical problems in machine learning, such as tuning nonlinear regression models, the extremum point of the chosen optimality criterion is often degenerate, which significantly complicates its search. Therefore, degenerate problems are the most challenging in optimization. Known numerical methods for solving the general unconstrained optimization problem, up to the second order, have very low convergence rates when solving degenerate problems [7, 8]. This is explained by the fact that for a significant improvement in convergence rate in this case, it is necessary to use higher-order derivatives in the method than the second order [10]. The purpose of the paper is to develop an efficient quasi-Newton method for solving degenerate unconstrained optimization problems, the idea of which (unlike regularization) involves dividing the entire space into the sum of two orthogonal subspaces. This idea was introduced in [23]. The space division at each iteration of the method is based on the spectral decomposition of the matrix approximating the Hessian of the objective function using the BFGS formula [3]. Each subspace exhibits its own behavior of the objective function, and therefore, an appropriate minimization method is applied on it. Results. A combined quasi-Newton method is presented for solving degenerate unconstrained optimization problems, based on orthogonal decomposition of the Hessian approximation matrix and division of the entire space into the sum of two orthogonal subspaces. On one subspace (the kernel of the Hessian approximation matrix), a method is applied where derivatives in the direction of the 4th order are computed, while on the orthogonal complement to it, a quasi-Newtonian method is applied. A separate one-dimensional search is applied on each of these subspaces to determine the step multiplier in the respective direction. The effectiveness of the presented combined method is confirmed by numerical experiments conducted on widely accepted test functions for unconstrained optimization problems. The proposed method allows obtaining fairly accurate solutions to test tasks in case of degeneracy of the minimum point with significantly lower computational costs for gradient calculations compared to optimization procedures of well-known mathematical packages. Conclusions. The idea of dividing the entire space into the sum of two (or possibly more) orthogonal subspaces when solving complex optimization problems is quite promising in terms of applying a combination of different numerical methods on separate subspaces. In the future, it is planned to conduct theoretical research on the convergence rate of the presented combined method in solving degenerate unconstrained optimization problems. Keywords: unconstrained optimization, quasi-Newton methods, degenerate minimum point, spectral matrix decomposition, Machine Learning.

Cannabigerol Reduces Acute and Chronic Hypernociception in Animals Exposed to Prenatal Hypoxia-Ischemia

Cannabigerol (CBG), a phytocannabinoid, has shown promise in pain management. Previous studies by our research group identified an increase in pain sensitivity as a consequence of prenatal hypoxia-ischemia (HI) in an animal model. This study aimed to investigate the efficacy of CBG in acute and chronic hyperalgesia induced by prenatal HI. A pharmacological screening was first conducted using hot plate and open-field tests to evaluate the antinociceptive and locomotor activities of animals administered with a 50 mg/kg oral dose of cannabis extract with a high CBG content. Prenatal HI was induced in pregnant rats, and the offspring were used to evaluate the acute antinociceptive effect of CBG in the formalin-induced peripheral pain model, while chronic antinociceptive effects were observed through spinal nerve ligation (SNL) surgery, a model used to induce neuropathic pain. Our results show that CBG exhibited an antinociceptive effect in the hot plate test without affecting the animals’ motor function in the open-field test. CBG significantly reduced formalin-induced reactivity in HI offspring during both the neurogenic and inflammatory phases. CBG treatment alleviated thermal and mechanical hypernociception induced by SNL. Biomolecular analysis revealed CBG’s ability to modulate expression, particularly reducing TNFα and Nav1.7 in HI male and female rats, respectively. These results highlight CBG as a potential antinociceptive agent in acute and chronic pain models, suggesting it as a promising therapeutic option without inducing motor impairment. Further research is needed to fully elucidate its mechanisms and clinical applications in pain management.

A Reinforced Whale Optimization Algorithm for Solving Mathematical Optimization Problems.

The whale optimization algorithm has several advantages, such as simple operation, few control parameters, and a strong ability to jump out of the local optimum, and has been used to solve various practical optimization problems. In order to improve its convergence speed and solution quality, a reinforced whale optimization algorithm (RWOA) was designed. Firstly, an opposition-based learning strategy is used to generate other optima based on the best optimal solution found during the algorithm's iteration, which can increase the diversity of the optimal solution and accelerate the convergence speed. Secondly, a dynamic adaptive coefficient is introduced in the two stages of prey and bubble net, which can balance exploration and exploitation. Finally, a kind of individual information-reinforced mechanism is utilized during the encircling prey stage to improve the solution quality. The performance of the RWOA is validated using 23 benchmark test functions, 29 CEC-2017 test functions, and 12 CEC-2022 test functions. Experiment results demonstrate that the RWOA exhibits better convergence accuracy and algorithm stability than the WOA on 20 benchmark test functions, 21 CEC-2017 test functions, and 8 CEC-2022 test functions, separately. Wilcoxon's rank sum test shows that there are significant statistical differences between the RWOA and other algorithms.

MSBWO: A Multi-Strategies Improved Beluga Whale Optimization Algorithm for Feature Selection.

Feature selection (FS) is a classic and challenging optimization task in most machine learning and data mining projects. Recently, researchers have attempted to develop more effective methods by using metaheuristic methods in FS. To increase population diversity and further improve the effectiveness of the beluga whale optimization (BWO) algorithm, in this paper, we propose a multi-strategies improved BWO (MSBWO), which incorporates improved circle mapping and dynamic opposition-based learning (ICMDOBL) population initialization as well as elite pool (EP), step-adaptive Lévy flight and spiral updating position (SLFSUP), and golden sine algorithm (Gold-SA) strategies. Among them, ICMDOBL contributes to increasing the diversity during the search process and reducing the risk of falling into local optima. The EP technique also enhances the algorithm's ability to escape from local optima. The SLFSUP, which is distinguished from the original BWO, aims to increase the rigor and accuracy of the development of local spaces. Gold-SA is introduced to improve the quality of the solutions. The hybrid performance of MSBWO was evaluated comprehensively on IEEE CEC2005 test functions, including a qualitative analysis and comparisons with other conventional methods as well as state-of-the-art (SOTA) metaheuristic approaches that were introduced in 2024. The results demonstrate that MSBWO is superior to other algorithms in terms of accuracy and maintains a better balance between exploration and exploitation. Moreover, according to the proposed continuous MSBWO, the binary MSBWO variant (BMSBWO) and other binary optimizers obtained by the mapping function were evaluated on ten UCI datasets with a random forest (RF) classifier. Consequently, BMSBWO has proven very competitive in terms of classification precision and feature reduction.

Meshfree Variational-Physics-Informed Neural Networks (MF-VPINN): An Adaptive Training Strategy

In this paper, we introduce a Meshfree Variational-Physics-Informed Neural Network. It is a Variational-Physics-Informed Neural Network that does not require the generation of the triangulation of the entire domain and that can be trained with an adaptive set of test functions. In order to generate the test space, we exploit an a posteriori error indicator and add test functions only where the error is higher. Four training strategies are proposed and compared. Numerical results show that the accuracy is higher than the one of a Variational-Physics-Informed Neural Network trained with the same number of test functions but defined on a quasi-uniform mesh.

Multiple elite strategy enhanced RIME algorithm for 3D UAV path planning

With the wave of artificial intelligence sweeping the world in recent years, UAVs is widely used in various fields. UAV path planning has attracted much attention from scientists as an essential part of UAV work. In order to design an efficient and reasonable 3D UAV path planning program, recent researchers have invented and improved many algorithms. This paper proposes an elite RIME algorithm for 3D UAV path planning. First, we propose an elite reverse learning population selection strategy based on piecewise mapping to enhance the population diversity of the algorithm for better exploration. Second, this paper proposes a stochastic factor-controlled elite pool exploration strategy so that the algorithm is difficult to enter the local optimum and can better explore the global optimum. Then, this paper proposes a hard frost puncture exploitation strategy based on the sine–cosine function so that the algorithm can find the global optimum faster during the exploitation process. Meanwhile, in order to test the performance of the algorithm proposed in this paper, we compare it with 13 other intelligent optimization algorithms that are classical and popular nowadays on 52 test functions in three test sets, CEC2017, CEC2020, and CEC2022, and obtain competitive results. Finally, we applied it to the 3D UAV path planning problem in three different terrain scenarios, and the ELRIME algorithm achieved good results in all of them. Especially in the 7-peak model, the ELRIME algorithm improves the performance of the RIME algorithm by a factor of two. In the 9-peak model, the average value aspect also reduce the cost by 91 compared to the RIME algorithm, and more importantly, it has the smallest fluctuation in 30 runs, which is among the most stable of all the compared algorithms. In the 12-peak model, its stability is also significantly enhanced, and in terms of worst-case cost, it improves the cost by 340 compared to RIME.

Parameter tuning for active disturbance rejection control of fixed-wing UAV based on improved bald eagle search algorithm

PurposeThis paper aims to develop a method for tuning the parameters of the active disturbance rejection controller (ADRC) for fixed-wing unmanned aerial vehicles (UAVs). The bald eagle search (BES) algorithm has been improved, and a cost function has been designed to enhance the optimization efficiency of ADRC parameters.Design/methodology/approachA six-degree-of-freedom nonlinear model for a fixed-wing UAV has been developed, and its attitude controller has been formulated using the active disturbance rejection control method. The parameters of the disturbance rejection controller have been fine-tuned using the collaborative mutual promotion bald eagle search (CMP-BES) algorithm. The pitch and roll controllers for the UAV have been individually optimized to obtain the most effective controller parameters.FindingsInspired by the salp swarm algorithm (SSA), the interaction among individual eagles has been incorporated into the CMP-BES algorithm, thereby enhancing the algorithm's exploration capability. The efficient and accurate optimization ability of the proposed algorithm has been demonstrated through comparative experiments with genetic algorithm, particle swarm optimization, Harris hawks optimization HHO, BES and modified bald eagle search algorithms. The algorithm's capability to solve complex optimization problems has been further proven by testing on the CEC2017 test function suite. A transitional function for fitness calculation has been introduced to accelerate the ability of the algorithm to find the optimal parameters for the ADRC controller. The tuned ADRC controller has been compared with the classical proportional-integral-derivative (PID) controller, with gust disturbances introduced to the UAV body axis. The results have shown that the tuned ADRC controller has faster response times and stronger disturbance rejection capabilities than the PID controller.Practical implicationsThe proposed CMP-BES algorithm, combined with a fitness function composed of transition functions, can be used to optimize the ADRC controller parameters for fixed-wing UAVs more quickly and effectively. The tuned ADRC controller has exhibited excellent robustness and disturbance rejection capabilities.Originality/valueThe CMP-BES algorithm and transitional function have been proposed for the parameter optimization of the active disturbance rejection controller for fixed-wing UAVs.

A Multi-Strategy Improved Northern Goshawk Optimization Algorithm for Optimizing Engineering Problems.

Northern Goshawk Optimization (NGO) is an efficient optimization algorithm, but it has the drawbacks of easily falling into local optima and slow convergence. Aiming at these drawbacks, an improved NGO algorithm named the Multi-Strategy Improved Northern Goshawk Optimization (MSINGO) algorithm was proposed by adding the cubic mapping strategy, a novel weighted stochastic difference mutation strategy, and weighted sine and cosine optimization strategy to the original NGO. To verify the performance of MSINGO, a set of comparative experiments were performed with five highly cited and six recently proposed metaheuristic algorithms on the CEC2017 test functions. Comparative experimental results show that in the vast majority of cases, MSINGO's exploitation ability, exploration ability, local optimal avoidance ability, and scalability are superior to those of competitive algorithms. Finally, six real world engineering problems demonstrated the merits and potential of MSINGO.

MISAO: A Multi-Strategy Improved Snow Ablation Optimizer for Unmanned Aerial Vehicle Path Planning

The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article suggests a multi-strategy improved (MISAO) snow ablation optimizer. It is employed in the unmanned aerial vehicle (UAV) path planning issue. To begin with, the tent chaos and elite reverse learning initialization strategies are merged to extend the diversity of the population; secondly, a greedy selection method is deployed to retain superior alternative solutions for the upcoming iteration; then, the Harris hawk (HHO) strategy is introduced to enhance the exploitation capability, which prevents trapping in partial ideals; finally, the red-tailed hawk (RTH) is adopted to perform the global exploration, which, enhances global optimization capability. To comprehensively evaluate MISAO’s optimization capability, a battery of digital optimization investigations is executed using 23 test functions, and the results of the comparative analysis show that the suggested algorithm has high solving accuracy and convergence velocity. Finally, the effectiveness and feasibility of the optimization path of the MISAO algorithm are demonstrated in the UAV path planning project.

An Exponential Map-based Whale Optimization Algorithm (Exp-WOA) for Optimization

This research work offers three variations of the Whale Optimization Algorithm (WOA) based on exponential chaotic maps, namely Logistic-Exponential-Logistic WOA (LEL-WOA), Logistic-Exponential-Sinusoidal WOA (LES-WOA), and Logistic-Exponential-Tent WOA (LET-WOA). The WOA with an exponential chaos-based mechanism is developed in this study to overcome the poor rate of convergence of the WOA and to prevent getting caught in local optimal solutions while dealing with the challenges. An exponential chaotic mechanism was employed in this research to initialize the agents and control the parameters of the exploration and exploitation phases of WOA. The proposed methodologies (Exp-WOA) are evaluated using twenty-three widely recognized test functions. The results demonstrate that the given solutions can enhance the performance of WOA by achieving optimal (minimum) values. The findings also indicate that LEL-WOA and LES-WOA exhibit faster convergence than WOA.

Cooperative coevolution for non-separable large-scale black-box optimization: Convergence analyses and distributed accelerations

Given the ubiquity of non-separable optimization problems in real worlds, in this paper we analyze and extend the large-scale version of the well-known cooperative coevolution (CC), a divide-and-conquer black-box optimization framework, on non-separable functions. First, we reveal empirical reasons of when decomposition-based methods are preferred or not in practice on some non-separable large-scale problems, which have not been clearly pointed out in many previous CC papers. Then, we formalize CC to a continuous-game model via simplification, but without losing its essential property. Different from previous evolutionary game theory for CC, our new model provides a much simpler but useful viewpoint to analyze its convergence, since only the pure Nash equilibrium concept is needed and more general fitness landscapes can be explicitly considered. Based on convergence analyses, we propose a hierarchical decomposition strategy for better generalization, as for any decomposition, there is a risk of getting trapped into a suboptimal Nash equilibrium. Finally, we use powerful distributed computing to accelerate it under the recent multi-level learning framework, which combines the fine-tuning ability from decomposition with the invariance property of CMA-ES. Experiments on a set of high-dimensional test functions validate both its search performance and scalability (w.r.t. CPU cores) on a clustering computing platform with 400 CPU cores.

Multi-Strategy Improved Harris Hawk Optimization Algorithm and Its Application in Path Planning.

Path planning is a key problem in the autonomous navigation of mobile robots and a research hotspot in the field of robotics. Harris Hawk Optimization (HHO) faces challenges such as low solution accuracy and a slow convergence speed, and it easy falls into local optimization in path planning applications. For this reason, this paper proposes a Multi-strategy Improved Harris Hawk Optimization (MIHHO) algorithm. First, the double adaptive weight strategy is used to enhance the search capability of the algorithm to significantly improve the convergence accuracy and speed of path planning; second, the Dimension Learning-based Hunting (DLH) search strategy is introduced to effectively balance exploration and exploitation while maintaining the diversity of the population; and then, Position update strategy based on Dung Beetle Optimizer algorithm is proposed to reduce the algorithm's possibility of falling into local optimal solutions during path planning. The experimental results of the comparison of the test functions show that the MIHHO algorithm is ranked first in terms of performance, with significant improvements in optimization seeking ability, convergence speed, and stability. Finally, MIHHO is applied to robot path planning, and the test results show that in four environments with different complexities and scales, the average path lengths of MIHHO are improved by 1.99%, 14.45%, 4.52%, and 9.19% compared to HHO, respectively. These results indicate that MIHHO has significant performance advantages in path planning tasks and helps to improve the path planning efficiency and accuracy of mobile robots.

Levy Sooty Tern Optimization Algorithm Builds DNA Storage Coding Sets for Random Access.

DNA molecules, as a storage medium, possess unique advantages. Not only does DNA storage exhibit significantly higher storage density compared to electromagnetic storage media, but it also features low energy consumption and extremely long storage times. However, the integration of DNA storage into daily life remains distant due to challenges such as low storage density, high latency, and inevitable errors during the storage process. Therefore, this paper proposes constructing a DNA storage coding set based on the Levy Sooty Tern Optimization Algorithm (LSTOA) to achieve an efficient random-access DNA storage system. Firstly, addressing the slow iteration speed and susceptibility to local optima of the Sooty Tern Optimization Algorithm (STOA), this paper introduces Levy flight operations and propose the LSTOA. Secondly, utilizing the LSTOA, this paper constructs a DNA storage encoding set to facilitate random access while meeting combinatorial constraints. To demonstrate the coding performance of the LSTOA, this paper consists of analyses on 13 benchmark test functions, showcasing its superior performance. Furthermore, under the same combinatorial constraints, the LSTOA constructs larger DNA storage coding sets, effectively reducing the read-write latency and error rate of DNA storage.

BrainSuite BIDS App: Containerized Workflows for MRI Analysis.

There has been a concerted effort by the neuroimaging community to establish standards for computational methods for data analysis that promote reproducibility and portability. In particular, the Brain Imaging Data Structure (BIDS) specifies a standard for storing imaging data, and the related BIDS App methodology provides a standard for implementing containerized processing environments that include all necessary dependencies to process BIDS datasets using image processing workflows. We present the BrainSuite BIDS App, which encapsulates the core MRI processing functionality of BrainSuite within the BIDS App framework. Specifically, the BrainSuite BIDS App implements a participant-level workflow comprising three pipelines and a corresponding set of group-level analysis workflows for processing the participant-level outputs. The Anatomical Pipeline extracts cortical surface models from a T1-weighted (T1w) MRI. It then performs surface-constrained volumetric registration to align the T1w MRI to a labeled anatomical atlas, which is used to delineate anatomical regions of interest in the MRI brain volume and on the cortical surface models. The Diffusion Pipeline processes diffusion-weighted imaging (DWI) data, with steps that include coregistering the DWI data to the T1w scan, correcting for susceptibility-induced geometric image distortion, and fitting diffusion models to the DWI data. The Functional Pipeline performs fMRI processing using a combination of FSL, AFNI, and BrainSuite tools. It coregisters the fMRI data to the T1w image, then transforms the data to the anatomical atlas space and to the Human Connectome Project's grayordinate space. The outputs of each pipeline can then be processed during group-level analysis. The outputs of the Anatomical Pipeline and the Diffusion Pipeline are analyzed using the BrainSuite Statistics Toolbox in R (bstr), which provides functionality for hypothesis testing and statistical modeling. The outputs of the Functional Pipeline can be analyzed using atlas-based or atlas-free statistical methods during group-level processing. These analyses include the application of BrainSync, which synchronizes the time-series data temporally and enables comparison of resting-state or task-based fMRI data across scans. We also present the BrainSuite Dashboard quality control system, which provides a browser-based interface for reviewing the outputs of individual modules of the participant-level pipelines across a study in real-time as they are generated. BrainSuite Dashboard facilitates rapid review of intermediate results, enabling users to identify processing errors and make adjustments to processing parameters if necessary. The comprehensive functionality included in the BrainSuite BIDS App provides a mechanism for rapidly deploying the BrainSuite workflows into new environments to perform large-scale studies. We demonstrate the capabilities of the BrainSuite BIDS App using structural, diffusion, and functional MRI data from the Amsterdam Open MRI Collection's Population Imaging of Psychology dataset.

Association of pulmonary function with functional capacity among middle-aged women

INTRODUCTION: Age-related decline in pulmonary function and functional capacity is seen in adults. The menopausal process leads to a decline in pulmonary function and functional capacity which is essential in maintaining independence in daily life. OBJECTIVE: The present study aimed to explore the association of pulmonary function with functional capacity among middle-aged women. METHODS: One hundred and eight female participants aged 40–55 years were included in this cross-sectional study; depending on their menstrual history participants were classified as premenopausal and postmenopausal. After initial screening and assessment, six-minute walk test (6MWT) and pulmonary function (FEV1, FVC, FEV1/FVC) were recorded as per standardised guidelines. The mean and standard deviation for all continuous variables were calculated. Correlations were estimated using Pearson’s coefficient of correlation. A comparison of premenopausal and postmenopausal groups was done by independent t-test. A two-tailed p-value < 0.05 was considered statistically significant. RESULTS: There were significant differences in values of six-minute walk distance (6MWD) and pulmonary function values of pre and postmenopausal women (p < 0.05). The Pearson coefficient of correlation showed t significant association of FEV1, FVC and FEV1/FVC with 6MWD among middle-aged women. There was fair positive correlation of FEV1 (r = 0.391, p = 0.002) and FEV1/FVC (r = 0.395, p = 0.002) with 6MWD among postmenopausal women. CONCLUSION: There exists a fair positive correlation of pulmonary function with 6MWD among middle-aged women particularly postmenopausal women. Early screening of respiratory health and functional capacity should be initiated for middle-aged women as a preventive strategy.

A Method for Optimizing Terminal Sliding Mode Controller Parameters Based on a Multi-Strategy Improved Crayfish Algorithm

This paper proposes a parameter optimization method for a terminal sliding mode controller (TSMC) based on a multi-strategy improved crayfish algorithm (JLSCOA) to enhance the performance of ship dynamic positioning systems. The TSMC is designed for the “Xinhongzhuan” vessel of Dalian Maritime University. JLSCOA integrates subtractive averaging, Levy Flight, and sparrow search strategies to overcome the limitations of traditional crayfish algorithms. Compared to COA, WOA, and SSA algorithms, JLSCOA demonstrates superior optimization accuracy, convergence performance, and stability across 12 benchmark test functions. It achieves the optimal value in 83% of cases, outperforms the average in 83% of cases, and exhibits stronger robustness in 75% of cases. Simulations show that applying JLSCOA to TSMC parameter optimization significantly outperforms traditional non-optimized controllers, reducing the average time for three degrees of freedom position changes by over 300 s and nearly eliminating control force and velocity oscillations.