In this paper, to make the missile intercept the maneuvering target, the parallel approaching guidance law is developed. In order to estimate the target maneuver more accurately and reduce that’s influence on guidance accuracy, the distance-scalar disturbance observer is employed. Specifically, the estimation accuracy of the observer designed is regardless of the relative distance. The finite-time prescribed performance is employed to ensure that the line-of-sight angular rate is capable of converging to a predesigned small region in the specified finite time. All signals of interception system can guarantee ultimately uniformly boundedness proved by the Lyapunov stability theory. Finally, the availability of the parallel approaching guidance law is demonstrated by the numerical simulation.

Some traditional robots are based on offline programming reciprocal motion, and with the continuous upgrading of vision technology, more and more tasks are replaced by machine vision. For the current problem of insufficient accuracy of robot target localization based on binocular vision, and an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance For the current problem of insufficient accuracy of robot target localization based on binocular vision, an improved random sampling consistency algorithm is proposed to complete parallel robot target localization and grasping under the guidance of multi Firstly, the RANSAC algorithm is improved based on the SURF algorithm; then the parallax gradient method is applied to iterate the matched point pairs several times to further optimize the data; then the 3D reconstruction is completed by the program technique; finally the obtained data is finally the obtained data is input into the robot arm and the camera internal and external parameters are obtained by the calibration method so that the robot can accurately locate and The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi- The experiments show that the improved algorithm has advantages in recognition accuracy and grasping success rate under multi-vision system.

To solve the problem of a uneven load for a dual-input counter-rotating transmission system, this research is based on Small Displacement Torsor Jacobian-Torsor theory.Considering the influence of the local parallel chain of a gearbox on the calculation accuracy of the backlash,the processing method of a meshing tooth pair parallel chain is proposed. The probability distribution of the tolerance band of gearbox manufacturing and assembly errors is modeled, the three-dimensional tolerance analysis model of a dual-input counter-rotating gearbox is established, and the Monte Carlo method is used to solve the backlash of the output end. The output backlash is solved with the Monte Carlo method, and the theoretical design backlash is combined with the output backlash to derive the gearbox side clearance range. The gearbox shaft system is analyzed statically, the range of the equal load coefficient is calculated, and the equal load performance optimization method based on the matching relationship between the gear backlash and the elastic shaft torsional stiffness is proposed. The correctness of the three-dimensional tolerance analysis combined with the elastic deflection angle used to optimize the equal load performance of the dual-input counter-rotating transmission system is verified by comparison with the relevant test data.

The analysis of water inflow is a key issue in the construction of subsea tunnels. However, present research on the water inflow of subsea tunnels is predominantly focused on single-bore tunnels. Given the current practices in engineering, it is common to see a parallel configuration of three bores. In such cases, the proximity of tunnels to one another might result in alterations to the water inflow due to the interplay of seepage fields. This paper begins by conducting a numerical simulation to assess the water inflow characteristics of a three-bore parallel subsea tunnel. The study then investigates the impact of many factors, including the permeability coefficient of the surrounding rock, the depth of the seawater, the depth of the tunnel, the spacing between tunnels, and the relative size of the tunnels, on the water inflow phenomenon. Furthermore, based on the principles of the analytic hierarchy process and fuzzy mathematics, a comprehensive assessment framework is developed to evaluate the water inflow of three-bore parallel subsea tunnels. Ultimately, this grade of water inflow is used in practical engineering. The results show that there is mutual influence between the three parallel tunnels, and the predicted water inflow will be too large if the single tunnel model is adopted. The interaction between tunnels should be considered in the water inflow grade evaluation system of the three-hole parallel submarine tunnel. Engineering cases show that using a single-hole tunnel model without considering the interaction between tunnels will lead to higher water inflow grades. The research results of this paper can provide guidance for the waterproofing and drainage design of three parallel subsea tunnels and the stability analysis of surrounding rocks.

The concept of graphs with clique-width at most was first introduced by Courcelle et al.to be the graphs that can be characterized using -expressions derived from graph operations that use labels of vertices. If the clique-width for some graph is bounded then a grand number of algorithmic problems, in general NP-hard, can be solved in polynomial time when restricted to this graph. This important fact motivated the researchers to prove that the clique-width of certain graphs is bounded. Following this research direction, we prove in this paper that the clique-width of series-parallel digraphs is at most 6 and we present an time algorithm to construct a 6-expression for this class of digraphs. In another part, we present a linear time recognition algorithm for a similar class of series-parallel digraphs and prove that the clique-width of this class is at most 3.

This paper addresses the input coupling problem for the shape memory alloy (SMA) actuated parallel platform with completely unknown nonlinear dynamics. The problem means that in a parallel platform with multiple SMA actuators acting together, the displacement of one of the actuators will simultaneously affect the remaining actuators to change. Due to the coupling problem and nonlinear characteristics of the SMA actuators, it is not easy to control the platform to achieve bi-directional swing with completely unknown nonlinear dynamics. Therefore, a model-free adaptive sliding mode control method is proposed to improve the control accuracy of the complex motion of the platform, avoiding the complex modeling process of the SMA actuated parallel platform. Based on the model-free adaptive control (MFAC) theory, a multiple input and multiple output (MIMO) dynamic linearized mathematical model of the parallel platform is established using the online input and output data of the system. Then, a sliding mode controller is designed based on the dynamic model. A rigorous theoretical analysis proves that the proposed model-free adaptive sliding mode controller is able to stably control the SMA actuated parallel platform, and its tracking error is uniformly ultimately bounded (UUB). Finally, experiments are conducted on the established SMA actuated parallel platform. The results show that the proposed model-free controller is feasible and effective, and can control the system well to achieve the complex motion of bi-directional swing.

To overcome the time-consuming drawbacks of Computational Fluid Dynamics (CFD) numerical simulations, this paper proposes a hybrid model based on a parallel architecture based on the concept of intelligent aerodynamics, named PA-TLA (Parallel Architecture combining TCN, LSTM, and Attention mechanism). This model utilizes CFD data to drive efficient predictions of aircraft wake evolution at different initial altitudes during the approach phase. Initially, CFD simulations of continuous initial altitudes during the approach phase are used to generate aircraft wake evolution data, which are then validated against real-world LIDAR data to verify their reliability. The PA-TLA model is designed based on a parallel architecture, combining Long Short-Term Memory networks (LSTM), Temporal Convolutional Networks (TCN), and a tensor concatenation module based on the attention mechanism, which ensures computational efficiency while fully leveraging the advantages of each component in a parallel processing framework. The study results show that the PA-TLA model outperforms both the LSTM and TCN models in predicting the three characteristic parameters of aircraft wake: vorticity, circulation, and Q-criterion. Compared to the serially structured TCN-LSTM, PA-TLA achieves an average reduction in mean squared error (MSE) by 6.80%, mean absolute error (MAE) by 7.70%, and root mean square error (RMSE) by 4.47%, with an average increase in the coefficient of determination (R²) by 0.36%, and a 35% improvement in prediction efficiency. Lastly, this study combines numerical simulation and the PA-TLA deep learning architecture to analyze the characteristics of wake evolution during the near-ground phase, providing theoretical value for further reducing aircraft wake intervals and enhancing airport operational efficiency.

The NOSTR is a communication protocol for the social web, based on the w3c websockets standard. Although it is still in its infancy, it is well known as a social media protocol, thousands of trusted users and multiple user interfaces, offering a unique experience and enormous capabilities. To name a few, the NOSTR applications include but are not limited to direct messaging, file sharing, audio/video streaming, collaborative writing, blogging and data processing through distributed AI directories. In this work, we propose an approach that builds upon the existing protocol structure with end goal a decentralized marketplace for federated learning and LLM training. In this proposed design there are two parties: on one side there are customers who provide a dataset that they want to use for training an AI model. On the other side, there are service providers, who receive (parts of) the dataset, train the AI model, and for a payment as an exchange, they return the optimized AI model. The decentralized and censorship resistant features of the NOSTR enable the possibility of designing a fair and open marketplace for training AI models and LLMs.

Brain tumors are frequently classified with high accuracy using convolutional neural networks (CNNs) and better comprehend the spatial connections among pixels in complex pictures. Due to their tiny receptive fields, the majority of deep convolutional neural network (DCNN)-based techniques overfit and are unable to extract global context information from more significant regions. While dilated convolution retains data resolution at the output layer and increases the receptive field without adding computation, stacking several dilated convolutions has the drawback of producing a grid effect. To handle gridding artifacts and extract both coarse and fine features from the images, this research suggests using a dilated parallel deep convolutional neural network (PDCNN) architecture that preserves a wide receptive field. To reduce complexity, initially, input images are resized and then grayscale transformed. Data augmentation has since been used to expand the number of datasets. Dilated PDCNN makes use of the lower computational overhead and contributes to the reduction of gridding artifacts. By contrasting various dilation rates, the global path uses a low dilation rate (2,1,1), while the local path uses a high dilation rate (4,2,1) for decremental even numbers to tackle gridding artifacts and extract both coarse and fine features from the two parallel paths. Using three different types of MRI datasets, the suggested dilated PDCNN with the average ensemble method performs better. The accuracy provided by the Multiclass Kaggle dataset-III, Figshare dataset-II, and Binary tumor identification dataset-I is 98.35%, 98.13%, and 98.67%, respectively. In comparison to state-of-the-art techniques, the suggested structure improves results by extracting both fine and coarse features, making it efficient.

In the face of the burgeoning electricity demands and the imperative for sustainable development amidst rapid industrialization, this study introduces a dynamic and adaptable framework suitable for policy-makers and renewable energy experts working on integrating and optimizing renewable energy solutions. While using a case study representative model for Sub-Saharan Africa (SSA) to demonstrate the challenges and opportunities present in introducing optimization methods to bridge power supply deficits and the scalability of the model to other regions, this study presents an agile multi-criteria decision tool that pivots on four key development phases, advancing upon established methodologies and pioneering refined computational techniques, to select optimal configurations from a set of Policy Decision Making Metrics (PDM-DPS). Central to this investigation lies a rigorous comparative analysis of variants of three advanced algorithmic approaches: Swarm-Based Multi-objective Particle Swarm Optimization (MOPSO), Decomposition-Based Multi-objective Evolutionary Algorithm (MOEA/D), and Evolutionary-Based Strength Pareto Evolutionary Algorithm (SPEA2). These are applied to a grid-connected hybrid system, evaluated through a comprehensive 8760-hour simulation over a 20-year planning horizon. The evaluation is further enhanced by a set of refined Algorithm Performance Evaluation Metrics (AL-PEM) tailored to the specific constraints. The findings not only underscore the robustness and consistency of the SPEA2 variant over 15 runs of 200 generations each, which ranks first on the AL-PEM scale but also validate the strategic merit of combining multiple technologies and empowering policymakers with a versatile toolkit for informed decision-making.

Accurate traffic simulation models play a crucial role in developing intelligent transport systems that offer timely traffic information to users and efficient traffic management. However, calibrating these models to represent real-world traffic conditions accurately poses a significant challenge due to the dynamic nature of traffic flow and the limitations of traditional calibration methods. This article introduces a machine learning-based approach to calibrate macroscopic traffic simulation models using real-time traffic video stream data. By leveraging computer vision technologies to extract key traffic parameters from video streams, the approach demonstrated a notable improvement in aligning the generated data from the calibrated simulation model with car sensor data, achieving an average improvement of over 50% compared to the uncalibrated macroscopic model. Moreover, there was a substantial reduction in data drift for the machine learning model integrated into the virtual transport space using vehicle-to-everything technology, resulting in a more than fourfold decrease in the average absolute error of the model.

The Global Navigation Satellite Systems (GNSS) software-defined receivers offer greater flexibility, cost-effectiveness, customization, and integration capabilities compared to traditional hardware-based receivers, making them essential for a wide range of applications. The continuous evolution of GNSS research and the availability of new features require these software-defined receivers to upgrade continuously to facilitate the latest requirements. The Finnish Geospatial Research Institute (FGI) has been supporting the GNSS research community with its open-source implementations, such as a MATLAB-based GNSS software-defined receiver ’FGI-GSRx’ and a Python-based implementation ’FGI-OSNMA’ for utilizing Galileo’s Open Service Navigation Message Authentication (OSNMA). In this context, longer datasets are crucial for GNSS software-defined receivers to support adaptation, optimization and facilitate testing to investigate and develop future-proof receiver capabilities. In this paper we present an updated version of FGI-GSRx, namely FGI-GSRx-v2.0.0, which is also available as an open-source resource for the research community. FGI-GSRx-v2.0.0 offers improved performance as compared to its previous version, especially for the execution of long datasets. This is carried out by optimizing the receiver’s functionality and offering a newly added parallel processing feature to ensure faster capabilities to process the raw GNSS data. This paper also presents an analysis of some key design aspects of previous and current versions of FGI-GSRx for a better insight into the receiver’s functionalities. The results show that FGI-GSRx-v2.0.0 offers about 40% run time execution improvement over FGI-GSRx-v1.0.0 in case of sequential processing mode and about 59% improvement in case of parallel processing mode with 17 GNSS satellites from GPS and Galileo. In addition, an attempt is made to execute v2.0.0 with MATLAB’s own parallel computing toolbox. A detail performance comparison reveals an improvement of about 43% in execution time over v2.0.0 parallel processing mode for the same GNSS scenario.

Traditional population-based metaheuristic algorithms are effective in solving complex real-world problems but require careful strategy selection and parameter tuning. Parameter-less population-based optimization algorithms have gained importance due to their simplicity and efficiency. However, research on their applicability for solving large systems of nonlinear equations is still incipient. In this paper, a systematic review and detailed description of metaphor-less optimization algorithms is made, including the Jaya algorithm, the main Jaya variants for continuous optimization problems, with a focus on the Enhanced Jaya (EJAYA) algorithm, the three Rao algorithms, the best-worst-play (BWP) algorithm, and the very recent max-min-greedy-interaction (MaGI) algorithm. This paper also discusses a few previous parallelizations of the Jaya optimization algorithm, as well as recent GPU-based massively parallel implementations of the Jaya, Enhanced Jaya (EJAYA), Rao, and BWP algorithms developed by the authors. In addition, a novel GPU-accelerated version of the MaGI algorithm is proposed. The GPU-accelerated versions of the metaphor-less algorithms developed by the authors were implemented using the Julia programming language and tested primarily on GeForce RTX 3090 and NVIDIA A100 GPUs, as well as on Tesla V100S and Tesla T4 GPUs, using a set of difficult, large-scale nonlinear equation system problems. The computational experiments carried out produced quite significant speedups, which highlights the efficiency of the GPU-based versions of the metaphor-less algorithms developed for solving large-scale systems of nonlinear equations.