Search

The unauthorized replication and distribution of digital images pose significant challenges to copyright protection. While existing solutions incorporate blockchain-based techniques such as perceptual hashing and digital watermarking, they lack large-scale experimental validation and a dedicated blockchain consensus protocol for image copyright management. This paper introduces DRPChain, a novel digital image copyright management system that addresses these issues. DRPChain employs an efficient cropping-resistant robust image hashing algorithm to defend against 14 common image attacks, demonstrating an 85% success rate in watermark extraction, 10% higher than the original scheme. Moreover, the paper designs the K-Raft consensus algorithm tailored for image copyright protection. Comparative experiments with Raft and benchmarking against PoW and PBFT algorithms show that K-Raft reduces block error rates by 2%, improves efficiency by 300ms compared to Raft, and exhibits superior efficiency,decentralization, and throughput compared to PoW and PBFT. These advantages make K-Raft more suitable for digital image copyright protection. This research contributes valuable insights into using blockchain technology for digital copyright protection, providing a solid foundation for future exploration. [ABSTRACT FROM AUTHOR]

This paper focuses on how regulatory bodies respond to artificial intelligence (AI)-enabled medical devices. To achieve this, we present a comparative overview of the United States (USA), European Union (EU), and China. Our search in the governmental database identified 59 AI medical devices approved in China as of July 2023. In comparison to the rules-based regulatory approach in China, the approaches in the USA and EU are more standards-oriented. [ABSTRACT FROM AUTHOR]

Currently, regardless of the algorithm used, motion planners for dealing with dynamic obstructions need to rely on high‐precision sensors and high performance processors. The requirements for hardware increase as the density of dynamic obstructions in an area becomes higher. Additionally, motion planners are more prone to errors in complex environments. The Rapidly‐exploring Random Tree (RRT ∗) algorithm only considers static obstructions and cannot effectively avoid densely populated regions of dynamic obstructions. This paper develops an improved RRT ∗ algorithm that is capable of avoiding densely populated regions of dynamic obstructions. In this algorithm, the cost function of the traditional RRT ∗ algorithm is modified based on the density of dynamic obstructions, allowing the planned path to bypass densely populated regions. The algorithm also introduces reasonable penalty terms to penalize segments that pass through densely populated regions, while maintaining asymptotic optimality of the traditional RRT ∗ algorithm. Numerical experiments reveal that the improved RRT ∗ algorithm is able to successfully avoid densely populated regions of dynamic obstructions with minimal time cost and exhibits better robustness during the path search process in comparison to the traditional RRT ∗ algorithm. Thus, the improved RRT ∗ algorithm possesses the ability to adapt to more complex areas for path planning. [ABSTRACT FROM AUTHOR]

Some special manufacturing fields such as aerospace may encounter mixed production of multiple research and development projects and multiple batch production projects. Under these special production conditions resource conflicts are more severe, resulting in uncertain operating times that are difficult to predict. In addition, a single project may have tens of thousands of supporting products, making it difficult to effectively control the total construction process. To address these challenges this paper proposes new methods. A model, EMA-DCPM (dynamic critical path method) incorporating attention mechanisms in Enterprise Resource Planning and Mechanical Engineering Society) has been proposed. This model predicts product job time through machine learning methods and discovers the predictive advantage of the attention mechanism through data comparison. The CPM control algorithm was improved to enhance its robustness and an efficient modeling method, "5+X" was proposed. This new method is suitable for mixed line planning management in sophisticated manufacturing projects and has value for practical applications. [ABSTRACT FROM AUTHOR]

This paper focuses on predicting road passenger probability and optimizing taxi driving routes based on trajectory big data. By utilizing clustering algorithms to identify key passenger points, a method for calculating and predicting road passenger probability is proposed. This method calculates the passenger probability for each road segment during different time periods and uses a BiLSTM neural network for prediction. A passenger-seeking recommendation model is then constructed with the goal of maximizing passenger probability, and it is solved using the NSGA-II algorithm. Experiments are conducted on the Chengdu taxi trajectory dataset, using MSE as the metric for model prediction accuracy. The results show that the BiLSTM prediction model improves prediction accuracy by 9.67% compared to the BP neural network and by 6.45% compared to the LSTM neural network. The proposed taxi driver passenger-seeking route selection method increases the average passenger probability by 18.95% compared to common methods. The proposed passenger-seeking recommendation framework, which includes passenger probability prediction and route optimization, maximizes road passenger efficiency and holds significant academic and practical value. [ABSTRACT FROM AUTHOR]

In response to the challenges of small-size defects and low recognition rates in Printed Circuit Boards (PCBs), as well as the need for lightweight detection models that can be embedded in portable devices, this paper proposes an improved defect detection method based on a lightweight shared convolutional head using YOLOv8n. Firstly, the Spatial and Channel reconstruction Convolution (SCConv) is embedded into the Cross Stage Partial with Convolutional Layer Fusion (C2f) structure of the backbone network, which reduces redundant computations and enhances the model's learning capacity. Secondly, an adaptive feature selection module is integrated to improve the network's ability to recognize small targets. Subsequently, a Shared Lightweight Convolutional Detection (SLCD) Head replaces the original Decoupled Head, reducing the model's computational complexity while increasing detection accuracy. Finally, the Weighted Intersection over Union (WIoU) loss function is introduced to provide more precise evaluation results and improve generalization capability. Comparative experiments conducted on a public PCB dataset demonstrate that the improved algorithm achieves a mean Average Precision (mAP) of 98.6% and an accuracy of 99.8%, representing improvements of 3.8% and 3.1%, respectively, over the original model. The model size is 4.1 M, and its FPS is 144.1, meeting the requirements for real-time and lightweight portable deployment. [ABSTRACT FROM AUTHOR]

In abstract argumentation frameworks, the computation of stable extensions is an important semantic task for evaluating the acceptability of arguments. The current approaches for the computation of stable extensions are typically conducted through methodologies that are either label-based or extension-based. Label-based algorithms operate by assigning labels to each argument, thus reducing the attack relations between arguments to constraint relations among the labels. This paper analyzes the existing two-label and three-label enumeration algorithms for stable extensions through case studies. It is found that both the two-label and three-label algorithms are not precise enough in defining types of arguments. To address these issues, this paper proposes a four-label enumeration algorithm for stable extensions. This method introduces a m u s t _ i n label to pre-mark certain i n -type arguments, thereby achieving a finer classification of i n -type arguments. This enhances the labelings' propagation ability and reduces the algorithm's search space. Our proposed four-label algorithm was tested on authoritative benchmark sets of abstract argumentation framework problems: ICCMA 2019, ICCMA 2021, and ICCMA 2023. Experimental results show that the four-label algorithm significantly improves solving efficiency compared to existing two-label and three-label algorithms. Additionally, ablation experiments confirm that both the four-label transition strategy and preprocessing strategy enhance the algorithm's performance. [ABSTRACT FROM AUTHOR]

This paper addresses the challenge of trajectory planning for autonomous vehicles operating in complex, constrained environments. The proposed method enhances the hybrid A-star algorithm through back-end optimization. An adaptive node expansion strategy is introduced to handle varying environmental complexities. By integrating Dijkstra's shortest path search, the method improves direction selection and refines the estimated cost function. Utilizing the characteristics of hybrid A-star path planning, a quadratic programming approach with designed constraints smooths discrete path points. This results in a smoothed trajectory that supports speed planning using S-curve profiles. Both simulation and experimental results demonstrate that the improved hybrid A-star search significantly boosts efficiency. The trajectory shows continuous and smooth transitions in heading angle and speed, leading to notable improvements in trajectory planning efficiency and overall comfort for autonomous vehicles in challenging environments. [ABSTRACT FROM AUTHOR]

In the field of industrial inspection, accurate detection of thread quality is crucial for ensuring mechanical performance. Existing machine-vision-based methods for internal thread defect detection often face challenges in efficient detection and sufficient model training samples due to the influence of mechanical geometric features. This paper introduces a novel image acquisition structure, proposes a data augmentation algorithm based on Generative Adversarial Networks (GANs) to effectively construct high-quality training sets, and employs a YOLO algorithm to achieve internal thread defect detection. Through multi-metric evaluation and comparison with external threads, high-similarity internal thread image generation is achieved. The detection accuracy for internal and external threads reached 94.27% and 93.92%, respectively, effectively detecting internal thread defects. [ABSTRACT FROM AUTHOR]

In this paper, a consensus-based model predictive control (Cb-MPC) scheme is proposed to control the active power and voltage at all nodes in grid-connected active distribution networks (ADNs) with multiple distributed energy resources (DERs). The proposed design methodology is based on a multiple-input multiple-output (MIMO) model of an ADN which accounts for both the internal and external interactions among the control loops of the DERs. To achieve the control objective, each DER unit is equipped with a controller–observer system. In particular, the observer implements the consensus algorithm to estimate the collective system state by exchanging data only with its neighbors. The scope of the controller is to solve the MPC optimal problem based on its collective state estimate, and, due to the presence of an integral term in the control action, it is robust against any unknown scenarios of the ADN, which are represented by uncertainty in the model parameters. The results of numerical simulations validate the effectiveness of the proposed method in the presence of unknown changes in the operating conditions of the ADN and of communication using a sample and hold function. [ABSTRACT FROM AUTHOR]

Deep Cross-Modal Hashing (DCMH) has garnered significant attention in the field of cross-modal retrieval due to its advantages such as high computational efficiency and small storage space. However, existing DCMH methods still face certain limitations: (1) they neglect the correlation between labels, while label features exhibit high sparsity; (2) they lack fine-grained semantic alignment; (3) they fail to effectively address data imbalance. In order to tackle these issues, this paper introduces a framework named Semantic-Alignment Transformer and Adversary Hashing for Cross-modal Retrieval (SATAH). To the best of our knowledge, this is the first attempt at the Semantic-Alignment Transformer algorithm. Specifically, this paper first designs a label learning network that utilizes a crafted transformer module to extract label information, guiding adversarial learning and hash function learning accordingly. Subsequently, a Balanced Conditional Generative Adversarial Network (BCGAN) is constructed, marking the first instance of adversarial training guided by label information. Furthermore, a Weighted Semi-Hard Cosine Triplet Constraint is proposed to better ensure high-ranking similarity relationships among all items. Lastly, considering the correlation between labels, a semantic-alignment constraint is introduced to handle label correlation from a fine-grained perspective, capturing similarity on a global scale more effectively. Extensive experiments are conducted on multiple representative cross-modal datasets. In experiments with 64-bit hash code length, SATAH achieves average mAP values of 84.75%, 68.87%, and 68.73% on MIR Flickr, NUS-WIDE, and MS COCO datasets, respectively, outperforming state-of-the-art methods. The code is available at https://github.com/Daydaylight/SATAH. [ABSTRACT FROM AUTHOR]

As enterprises increasingly rely on cloud-based Human Resource Management Systems (HRMS) deployed on the Hadoop platform, the optimization of weighting algorithms becomes imperative to enhance system efficiency. This paper addresses the complex challenge of load balancing in the cloud environment by proposing Effective Load Balancing Strategy (ELBS) a hybrid optimization approach that integrates both Genetic Algorithm (GA) and Grey Wolf Optimization (GWO). The optimization objective involves the allocation of N jobs submitted by cloud users to M processing units, each characterized by a Processing Unit Vector (PUV). The PUV encapsulates critical parameters such as Million Instructions Per Second (MIPS), execution cost α, and delay cost L. Concurrently, each job submitted by a cloud user is represented by a Job Unit Vector (JUV), considering service type, number of instructions (NIC), job arrival time (AT), and worst-case completion time (wc). The proposed hybrid GA-GWO aims to minimize a cost function ζ, incorporating weighted factors of execution cost and delay cost. The challenge lies in determining optimal weights, a task addressed by assigning user preferences or importance as weights. The hybrid algorithm iteratively evolves populations of processing units, applying genetic operators, such as crossover and mutation, along with the exploration capabilities of GWO, to efficiently explore the solution space. This research contributes a comprehensive algorithmic solution to the optimization of weighting algorithms in enterprise HRMS on the cloud and Hadoop platform. The adaptability of the hybrid ELBS to dynamic cloud environments and its efficacy in handling complex optimization problems position it as a promising tool for achieving load balancing in HRMS applications. The proposed approach provides a foundation for further empirical validation and implementation in practical enterprise settings. [ABSTRACT FROM AUTHOR]

Intelligent Transportation Systems are witnessing a paradigm shift with the integration of Cooperative Vehicular Networks. The transformations in Intelligent Transportation system in the realistic scenario has posed many research challenges to be addressed. This paper explores a profound survey on impact of vehicles' mobility within the context of real-time scenarios in Cooperative vehicular networks. The dynamic nature of vehicular mobility introduces unique challenges and opportunities for the design and implementation of cooperative systems. It delves into the key components that play a pivotal role for harnessing the full potential of Cooperative vehicular networks such as C-NOMA, Two-Way relaying, cluster formation and collaborative decision-making algorithms for improving latency, link reliability, cluster formation, and interference reduction etc. This paper outlines few surveys on each amalgamated technologies in Vehicular communication and conclude with the research problems in ITS due to vehicles mobility for real time scenarios. [ABSTRACT FROM AUTHOR]

This paper uses big data technology to extract the electromechanical fault characteristics of metro vehicles and analyze the current situation under different fault conditions to ensure the operation quality and safety of metro operations. It also establishes a simulation model to simulate the current waveform of metro vehicles under different fault conditions and analyze the fault phenomenon. The simulation test results show that: (1) The current waveform of a single transistor with the hard fault is compared with the simulated current waveform under a normal state. The upper part of the A phase current waveform is lost when T1 fails. When T2 fails, the current waveform in the lower half of the C phase current is lost. When T3 fails, the upper half of the B phase current waveform is lost. (2) The current waveform in the hard fault's upper and lower bridge arms will have phase loss. In the T25 fault, the C phase current is completely lost. In the T14 fault, the phase A current waveform is completely lost. In the T36 fault, the phase B current is completely lost. (3) The current waveform of a single transistor with a soft fault is complete, but the overall current amplitude is reduced. When a T1 fails, the A phase current tends to rise first and then fall. Compared to normal, the amplitude of the current decreases, and the peak decreases slightly. (4) The current values of phase B and phase C of the two transistors on the same bridge above and below the soft fault are mostly the same. The phase A current output value decreases in both the positive and negative half cycles. This paper aims to improve the monitoring ability of the monitoring system of electromechanical equipment of metro vehicles, which plays a specific role in maintaining the safety of subway operations and improving the quality of subway operations. [ABSTRACT FROM AUTHOR]

In this paper, the Hybrid Grey Wolf and Improved Bat Optimization Algorithm (HWIBO) is proposed to reduce the peak sidelobe level (PSLL) of linear symmetric array synthesis with aperture and element spacing constraints. The HWIBO utilizes both the Grey Wolf Optimization (GWO) and Improved Bat Algorithms (IBA) simultaneously to optimize PSLL. Each iteration generates two sets of results, and the optimal result is chosen for the next loop. Compared to other algorithms used in simulation of antenna sidelobe suppression, the HWIBO not only inherits the fast convergence advantage of the IBA which enhances population diversity but also possesses the strong global search capability of the GWO. This helps the IBA escape local optima and strengthens the global search capability during the later stages of algorithm iterations. Finally, the simulation results demonstrate the successful reduction of PSLL under various constraints, confirming the effectiveness of the hybrid algorithm. [ABSTRACT FROM AUTHOR]

This paper describes a 2-stage tactic for achieving an odd-order variable-bandwidth (OO-VBW) filter with absolutely guaranteed stability. The design methodology aims to minimize the p-norm amplitude-response error while maintaining the OO-VBW-filter's stability. In order to tune OO-VBW filter's amplitude response, we utilize a kind of functions of the bandwidth (BW)-tuning parameter to express the filter's coefficients. Because those functions have changeable function values, the designed OO-VBW-filter's amplitude response possesses variability. Another important concern in this paper is the stability issue. When the filter coefficient values expressed as function values are changed, the OO-VBW filter that has feedback structures may become unstable. This necessitates that the OO-VBW-filter's stability must always be preserved during real-time tuning. In order to stabilize such an OO-VBW filter that has feedback structures, a coefficient-conversion (CC) algorithm is adopted, and it is incorporated into the 2-stage methodology for obtaining the OO-VBW filter. To illustrate both the stability and high approximation accuracy, the design of an OO-VBW bandpass filter is simulated. The simulation details verify that both stability and high accuracy can be successfully achieved. [ABSTRACT FROM AUTHOR]

Aiming at the problems of traditional image super-resolution reconstruction algorithms in the image reconstruction process, such as small receptive field, insufficient multi-scale feature extraction, and easy loss of image feature information, a super-resolution reconstruction algorithm of multi-scale dilated convolution network based on dilated convolution is proposed in this paper. First, the algorithm extracts features from the same input image through the dilated convolution kernels of different receptive fields to obtain feature maps with different scales; then, through the residual attention dense block, further obtain the features of the original low resolution images, local residual connections are added to fuse multi-scale feature information between multiple channels, and residual nested networks and jump connections are used at the same time to speed up deep network convergence and avoid network degradation problems. Finally, deep network extraction features, and it is fused with input features to increase the nonlinear expression ability of the network to enhance the superresolution reconstruction effect. Experimental results show that compared with Bicubic, SRCNN, ESPCN, VDSR, DRCN, LapSRN, MemNet, and DSRNet algorithms on the Set5, Set14, BSDS100, and Urban100 test sets, the proposed algorithm has improved peak signal-to-noise ratio and structural similarity, and reconstructed images. The visual effect is better. [ABSTRACT FROM AUTHOR]

In this paper we propose an algorithm for testing whether the independent observations come from finite-variance distribution. The preliminary knowledge about the data properties may be crucial for its further analysis and selection of the appropriate model. The idea of the testing procedure is based on the simple observation that the empirical cumulative even moment (ECEM) for data from finite-moments distribution tends to some constant whereas for data coming from heavy-tailed distribution, the ECEM exhibits irregular chaotic behavior. Based on this fact, in this paper we parameterize the regular/irregular behavior of the ECEM and construct a new test statistic. The efficiency of the testing procedure is verified for simulated data from three heavy-tailed distributions with possible finite and infinite variances. The effectiveness is analyzed for data represented in time domain. The simulation study is supported by analysis of real vibration signals from rotating machines. Here, the analyses are provided for data in both the time and time-frequency domains. [ABSTRACT FROM AUTHOR]

Remote Sensing Image Object Detection (RSIOD) faces the challenges of multi-scale objects, dense overlap of objects and uneven data distribution in practical applications. In order to solve these problems, this paper proposes a YOLO-ACPHD RSIOD algorithm. The algorithm adopts Adaptive Condition Awareness Technology (ACAT), which can dynamically adjust the parameters of the convolution kernel, so as to adapt to the objects of different scales and positions. Compared with the traditional fixed convolution kernel, this dynamic adjustment can better adapt to the diversity of scale, direction and shape of the object, thus improving the accuracy and robustness of Object Detection (OD). In addition, a High-Dimensional Decoupling Technology (HDDT) is used to reduce the amount of calculation to 1/N by performing deep convolution on the input data and then performing spatial convolution on each channel. When dealing with large-scale Remote Sensing Image (RSI) data, this reduction in computation can significantly improve the efficiency of the algorithm and accelerate the speed of OD, so as to better adapt to the needs of practical application scenarios. Through the experimental verification of the RSOD RSI data set, the YOLO-ACPHD model in this paper shows very satisfactory performance. The F1 value reaches 0.99, the Precision value reaches 1, the Precision-Recall value reaches 0.994, the Recall value reaches 1, and the mAP value reaches 99.36 % , which indicates that the model shows the highest level in the accuracy and comprehensiveness of OD. [ABSTRACT FROM AUTHOR]

In response to the vulnerability of image encryption techniques to chosen plaintext attacks, this paper proposes a secure image communication scheme based on two-layer dynamic feedback encryption and discrete wavelet transform (DWT) information hiding. The proposed scheme employs a plaintext correlation and intermediate ciphertext feedback mechanism, and combines chaotic systems, bit-level permutation, bilateral diffusion, and dynamic confusion to ensure the security and confidentiality of transmitted images. Firstly, a dynamically chaotic encryption sequence associated with a secure plaintext hash value is generated and utilized for the first round of bit-level permutation, bilateral diffusion, and dynamic confusion, resulting in an intermediate ciphertext image. Similarly, the characteristic values of the intermediate ciphertext image are used to generate dynamically chaotic encryption sequences associated with them. These sequences are then employed for the second round of bit-level permutation, bilateral diffusion, and dynamic confusion to gain the final ciphertext image. The ciphertext image hidden by DWT also provides efficient encryption, higher level of security and robustness to attacks. This technology offers indiscernible secret data insertion, rendering it challenging for assailants to spot or extract concealed information. By combining the proposed dynamic closed-loop feedback secure image encryption scheme based on the 2D-SLMM chaotic system with DWT-based hiding, a comprehensive and robust image encryption approach can be achieved. According to the results of theoretical research and experimental simulation, our encryption scheme has dynamic encryption effect and reliable security performance. The scheme is highly sensitive to key and plaintext, and can effectively resist various common encryption attacks and maintain good robustness. Therefore, our proposed encryption algorithm is an ideal digital image privacy protection technology, which has a wide range of practical application prospects. [ABSTRACT FROM AUTHOR]

Traditional short‐term traffic volume forecasting approaches make it difficult to predict the highly spatiotemporally coupled short‐time traffic. To tackle the problem, this paper first proposes a variational modal algorithm (GWO‐VMD) based on the optimization of the gray wolf search algorithm. It aims to decompose and reduce the noise of short‐time traffic flows. Meanwhile, it reduces the intricacy of data sequences and enhances the regularity pattern. To address the insufficient utilization of spatiotemporal features, this paper presents an innovative deep‐learning traffic prediction framework based on the stacking of multiple temporal trend‐aware graph attention (TGA) layers and gated temporal convolution (GTC) layers, which are called trend‐aware temporal graph neural network (TTGAN). TGA dynamically models the space‐time relationships of traffic data, and GTC models the temporal characteristics of traffic data. The experimental findings demonstrate that the MAPE model, as presented, achieves a reduction of 9% and 2% compared to the AGCRN and GWNET models, respectively, in the domain of deep spatiotemporal graph modeling. Data decomposition and noise reduction are necessary to achieve accurate results. This model has superior performance in terms of mean absolute error (MAE), coefficient of determination (R2), and explained variance score (EVAR). [ABSTRACT FROM AUTHOR]

Copyright of Zhejiang Electric Power is the property of Zhejiang Electric Power Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The setting of parameter values will directly affect the performance of the neural network, and the manual parameter tuning speed is slow, and it is difficult to find the optimal combination of parameters. Based on this, this paper applies the improved Hunger Games search algorithm to find the optimal value of neural network parameters adaptively, and proposes an ATHGS-GoogleNet model. Firstly, adaptive weights and chaos mapping were integrated into the hunger search algorithm to construct a new algorithm, ATHGS. Secondly, the improved ATHGS algorithm was used to optimize the parameters of GoogleNet to construct a new model, ATHGS-GoogleNet. Finally, in order to verify the effectiveness of the proposed algorithm ATHGS and the model ATHGS-GoogleNet, a comparative experiment was set up. Experimental results show that the proposed algorithm ATHGS shows the best optimization performance in the three engineering experimental designs, and the accuracy of the proposed model ATHGS-GoogleNet reaches 98.1%, the sensitivity reaches 100%, and the precision reaches 99.5%. [ABSTRACT FROM AUTHOR]

This paper employs an integral reinforcement learning (IRL) method to investigate the optimal tracking control problem (OTCP) for nonlinear nonzero-sum (NZS) differential game systems with unknown drift dynamics. Unlike existing methods, which can only bound the tracking error, the proposed approach ensures that the tracking error asymptotically converges to zero. This study begins by constructing an augmented system using the tracking error and reference signal, transforming the original OTCP into solving the coupled Hamilton–Jacobi (HJ) equation of the augmented system. Because the HJ equation contains unknown drift dynamics and cannot be directly solved, the IRL method is utilized to convert the HJ equation into an equivalent equation without unknown drift dynamics. To solve this equation, a critic neural network (NN) is employed to approximate the complex value function based on the tracking error and reference information data. For the unknown NN weights, the least squares (LS) method is used to design an estimation law, and the convergence of the weight estimation error is subsequently proven. The approximate solution of optimal control converges to the Nash equilibrium, and the tracking error asymptotically converges to zero in the closed system. Finally, we validate the effectiveness of the proposed method in this paper based on MATLAB using the ode45 method and least squares method to execute Algorithm 2. [ABSTRACT FROM AUTHOR]

In Mobile Crowdsensing (MCS), sensing tasks have different impacts and contributions to the whole system or specific targets, so the importance of the tasks is different. Since resources for performing tasks are usually limited, prioritizing the allocation of resources to more important tasks can ensure that key data or information can be collected promptly and accurately, thus improving overall efficiency and performance. Therefore, it is very important to consider the importance of tasks in the task selection and allocation of MCS. In this paper, a task queue is established, the importance of tasks, the ability of participants to perform tasks, and the stability of the task queue are considered, and a novel task selection and allocation scheme (TSAS) in the MCS system is designed. This scheme introduces the Lyapunov optimization method, which can be used to dynamically keep the task queue stable, balance the execution ability of participants and the system load, and perform more important tasks in different system states, even when the participants are limited. In addition, the Double Deep Q-Network (DDQN) method is introduced to improve on the traditional solution of the Lyapunov optimization problem, so this scheme has a certain predictive ability and foresight on the impact of future system states. This paper also proposes action-masking and iterative training methods for the MCS system, which can accelerate the training process of the neural network in the DDQN and improve the training effect. Experiments show that the TSAS based on the Lyapunov optimization method and DDQN performs better than other algorithms, considering the long-term stability of the queue, the number and importance of tasks to be executed, and the congestion degree of tasks. [ABSTRACT FROM AUTHOR]

Typical satellite component detection is an application-valuable and challenging research field. Currently, there are many algorithms for detecting typical satellite components, but due to the limited storage space and computational resources in the space environment, these algorithms generally have the problem of excessive parameter count and computational load, which hinders their effective application in space environments. Furthermore, the scale of datasets used by these algorithms is not large enough to train the algorithm models well. To address the above issues, this paper first applies YOLOv8 to the detection of typical satellite components and proposes a Lightweight Typical Satellite Components Detection algorithm based on improved YOLOv8 (LTSCD-YOLO). Firstly, it adopts the lightweight network EfficientNet-B0 as the backbone network to reduce the model's parameter count and computational load; secondly, it uses a Cross-Scale Feature-Fusion Module (CCFM) at the Neck to enhance the model's adaptability to scale changes; then, it integrates Partial Convolution (PConv) into the C2f (Faster Implementation of CSP Bottleneck with two convolutions) module and Re-parameterized Convolution (RepConv) into the detection head to further achieve model lightweighting; finally, the Focal-Efficient Intersection over Union (Focal-EIoU) is used as the loss function to enhance the model's detection accuracy and detection speed. Additionally, a larger-scale Typical Satellite Components Dataset (TSC-Dataset) is also constructed. Our experimental results show that LTSCD-YOLO can maintain high detection accuracy with minimal parameter count and computational load. Compared to YOLOv8s, LTSCD-YOLO improved the mean average precision (mAP50) by 1.50% on the TSC-Dataset, reaching 94.5%. Meanwhile, the model's parameter count decreased by 78.46%, the computational load decreased by 65.97%, and the detection speed increased by 17.66%. This algorithm achieves a balance between accuracy and light weight, and its generalization ability has been validated on real images, making it effectively applicable to detection tasks of typical satellite components in space environments. [ABSTRACT FROM AUTHOR]

Object detection via remote sensing encounters significant challenges due to factors such as small target sizes, uneven target distribution, and complex backgrounds. This paper introduces the K-CBST YOLO algorithm, which is designed to address these challenges. It features a novel architecture that integrates the Convolutional Block Attention Module (CBAM) and Swin-Transformer to enhance global semantic understanding of feature maps and maximize the utilization of contextual information. Such integration significantly improves the accuracy with which small targets are detected against complex backgrounds. Additionally, we propose an improved detection network that combines the improved K-Means algorithm with a smooth Non-Maximum Suppression (NMS) algorithm. This network employs an adaptive dynamic K-Means clustering algorithm to pinpoint target areas of concentration in remote sensing images that feature varied distributions and uses a smooth NMS algorithm to suppress the confidence of overlapping candidate boxes, thereby minimizing their interference with subsequent detection results. The enhanced algorithm substantially bolsters the model's robustness in handling multi-scale target distributions, preserves more potentially valid information, and diminishes the likelihood of missed detections. This study involved experiments performed on the publicly available DIOR remote sensing image dataset and the DOTA aerial image dataset. Our experimental results demonstrate that, compared with other advanced detection algorithms, K-CBST YOLO outperforms all its counterparts in handling both datasets. It achieved a 68.3% mean Average Precision (mAP) on the DIOR dataset and a 78.4% mAP on the DOTA dataset. [ABSTRACT FROM AUTHOR]

The use of mobile robots in substations improves maintenance efficiency and ensures the personal safety of staff working at substations, which is a trend in the development of technologies. Strong electric and solid magnetic fields around high-voltage equipment in substations may lead to the breakdown and failure of inspection devices. Therefore, safe operation range measurement and coordinated planning are key factors in ensuring the safe operation of substations. This paper first summarizes the current developments that are occurring in the field of fixed and mobile safe operating range sensing methods for substations, such as ultra-wideband technology, the two-way time flight method, and deep learning image processing algorithms. Secondly, this paper introduces path-planning algorithms based on safety range sensing and analyzes the adaptability of global search methods based on a priori information, local planning algorithms, and sensor information in substation scenarios. Finally, in view of the limitations of the existing range awareness and path-planning methods, we investigate the problems that occur in the dynamic changes in equipment safety zones and the frequent switching of operation scenarios in substations. Furthermore, we explore a new type of barrier and its automatic arrangement system to improve the performance of distance control and path planning in substation scenarios. [ABSTRACT FROM AUTHOR]

Efficient traffic sign recognition is crucial to facilitating the intelligent driving of new energy vehicles. However, current approaches like the Vision Transformer (ViT) model often impose high storage and computational demands, escalating hardware costs. This paper presents a similarity filter pruning method based on locally linear embedding. Using the alternating direction multiplier method and the loss of the locally linear embedding method for the model training function, the proposed pruning method prunes the operation model mainly by evaluating the similarity of each layer in the network layer filters. According to the pre-set pruning threshold value, similar filters to be pruned are obtained, and the filter with a large cross-entropy value is retained. The results from the Belgium Traffic Sign (BelgiumTS) and German Traffic Sign Recognition Benchmark (GTSRB) datasets indicate that the proposed similarity filter pruning based on local linear embedding (SJ-LLE) pruning algorithm can reduce the number of parameters of the multi-head self-attention module and Multi-layer Perceptron (MLP) module of the ViT model by more than 60%, and the loss of model accuracy is acceptable. The scale of the ViT model is greatly reduced, which is conducive to applying this model in embedded traffic sign recognition equipment. Also, this paper proves the hypothesis through experiments that "using the LLE algorithm as the loss function for model training before pruning plays a positive role in reducing the loss of model performance in the pruning process". [ABSTRACT FROM AUTHOR]

Accurate segmentation of the pulmonary airway tree is crucial for diagnosing lung diseases. To tackle the issues of low segmentation accuracy and frequent leaks in existing methods, this paper proposes a precise segmentation method using quasi-spherical region-constrained wavefront propagation with tracheal wall gap sealing. Based on the characteristic that the surface formed by seed points approximates the airway cross-section, the width of the unsegmented airway is calculated, determining the initial quasi-spherical constraint region. Using the wavefront propagation method, seed points are continuously propagated and segmented along the tracheal wall within the quasi-spherical constraint region, thus overcoming the need to determine complex segmentation directions. To seal tracheal wall gaps, a morphological closing operation is utilized to extract the characteristics of small holes and locate low-brightness tracheal wall gaps. By filling the CT values at these gaps, the method seals the tracheal wall gaps. Extensive experiments on the EXACT09 dataset demonstrate that our algorithm ranks third in segmentation completeness. Moreover, its performance in preventing airway leaks is significantly better than the top-two algorithms, effectively preventing large-scale leak-induced spread. [ABSTRACT FROM AUTHOR]

This paper studies an LSTM-based adaptive transmission method for a 360-degree video and proposes a non-uniform encoding transmission strategy based on LSTM. Our goal is to maximize the user's video experience by dynamically dividing the 360-degree video into tiles of different numbers and sizes, and selecting different bitrates for each tile. This aims to reduce buffering events and video jitter. To determine the optimal number and size of tiles at the current moment, we constructed a dual-layer stacked LSTM network model. This model predicts, in real-time, the number, size, and bitrate of the tiles needed for the next moment of the 360-degree video based on the distance between the user's eyes and the screen. In our experiments, we used an exhaustive algorithm to calculate the optimal tile division and bitrate selection scheme for a 360-degree video under different network conditions, and used this dataset to train our prediction model. Finally, by comparing with other advanced algorithms, we demonstrated the superiority of our proposed method. [ABSTRACT FROM AUTHOR]

A novel hybrid algorithm combining the 3‐D vector finite element method‐boundary integral method (FEM‐BIM) with the half‐space Green's function with the rough‐surface interface is developed in this paper to study the scattering from a 3‐D coated target above a perfectly electric conducting (PEC) rough surface. The half‐space Green's function is derived from the Kirchhoff approximation (KA). The 3‐D vector FEM is applied to model the coated object, and the BIM with the half‐space Green's function is selected as the exact radiation boundary conditions. The accuracy of our numerical code is validated by the numerical method. Some numerical results are provided to study the electromagnetic scattering characteristics from a coated sphere above a Gaussian rough surface. [ABSTRACT FROM AUTHOR]

The transformation of energy structure has brought about new changes in the power system, and the environmentally friendly gas switchgear with the goal of low carbon and environmental protection has been widely spread and applied, but due to its short application time and the accumulation of related research, it continues to carry out life prediction to improve the related operation and maintenance system. The article proposes the environmental protection gas switchgear data processing technology based on data enhancement technology, proposes the environmental protection gas switchgear life prediction technology based on approximate dynamic planning, and verifies the algorithm through case analysis, which proves the effectiveness and accuracy of the proposed method. [ABSTRACT FROM AUTHOR]

In response to the challenges of path planning in complex scenarios, to overcome the influence of optimal path determination by the precision of grid map sizes, and to escape the uncertainty in solving by intelligent algorithms, this paper designs a method for obtaining an adjacency matrix based on node planning of shortest path diagrams with polygonal obstacles and then uses the Dijkstra algorithm to get the shortest path. For irregular curved obstacles, an edge straightening method is proposed. To enhance the applicability of the path, this paper introduces the constraint of minimum turning radius. It researches path smoothing under obstacle conditions based on arcs and straight lines, providing practical solutions for different scenarios. Considering the need to maintain a safe distance due to the size of the moving carrier and the deviation in trajectory tracking, this paper conducts an expansion analysis of obstacles. It obtains the trajectory on the arc after edge straight line fitting, followed by further smoothing treatment. The method proposed in this paper demonstrates excellent accuracy and robustness in path planning through simulation verification, proving its practicality and effectiveness in complex environments. [ABSTRACT FROM AUTHOR]

Currently, existing deep learning methods exhibit many limitations in multi-target detection, such as low accuracy and high rates of false detection and missed detections. This paper proposes an improved Faster R-CNN algorithm, aiming to enhance the algorithm's capability in detecting multi-scale targets. This algorithm has three improvements based on Faster R-CNN. Firstly, the new algorithm uses the ResNet101 network for feature extraction of the detection image, which achieves stronger feature extraction capabilities. Secondly, the new algorithm integrates Online Hard Example Mining (OHEM), Soft non-maximum suppression (Soft-NMS), and Distance Intersection Over Union (DIOU) modules, which improves the positive and negative sample imbalance and the problem of small targets being easily missed during model training. Finally, the Region Proposal Network (RPN) is simplified to achieve a faster detection speed and a lower miss rate. The multi-scale training (MST) strategy is also used to train the improved Faster R-CNN to achieve a balance between detection accuracy and efficiency. Compared to the other detection models, the improved Faster R-CNN demonstrates significant advantages in terms of mAP@0.5, F1-score, and Log average miss rate (LAMR). The model proposed in this paper provides valuable insights and inspiration for many fields, such as smart agriculture, medical diagnosis, and face recognition. [ABSTRACT FROM AUTHOR]

Deploying static wireless sensor nodes is prone to network coverage gaps, resulting in poor network coverage. In this paper, an attempt is made to improve the network coverage by moving the locations of the nodes. A surrogate-assisted sine Phasmatodea population evolution algorithm (SASPPE) is used to evaluate the network coverage. A 50 × 50 hill simulation environment was tested for the number of nodes of 30 and 40 and radii of 3, 5 and 7, respectively. The results show that the SASPPE algorithm has the highest coverage, which can be up to 23.624% higher than the PPE algorithm, and up to 5.196% higher than the PPE algorithm, ceteris paribus. The SASPPE algorithm mixes the GSAM with LSAMs, which balances the computational cost of the algorithm and the algorithm's ability to find optimal results. The use of hierarchical clustering enhances the stable type of the LSAMs. In addition, LSAMs are easy to fall into local optimality when they are modeled with local data, and the use of sine Phasmatodea population evolution algorithm (Sine-PPE) for searching in LSAMs alleviates the time for the algorithm to fall into local optimality. On 30D, 50D, and 100D, the proposed algorithm was tested by 7 test functions. The results show that the algorithm has significant advantages on most functions. [ABSTRACT FROM AUTHOR]

With the rapid advancement of autonomous driving technology, the recognition of vehicle lane-changing can provide effective environmental parameters for vehicle motion planning, decision-making and control, and has become a key task for intelligent vehicles. In this paper, an improved method for vehicle taillight detection and intent recognition based on YOLOv8 (You Only Look Once version 8) is proposed. Firstly, the CARAFE (Context-Aware Reassembly Operator) module is introduced to address fine perception issues of small targets, enhancing taillight detection accuracy. Secondly, the TriAtt (Triplet Attention Mechanism) module is employed to improve the model's focus on key features, particularly in the identification of positive samples, thereby increasing model robustness. Finally, by optimizing the EfficientP2Head (a small object auxiliary head based on depth-wise separable convolutions) module, the detection capability for small targets is further strengthened while maintaining the model's practicality and lightweight characteristics. Upon evaluation, the enhanced algorithm demonstrates impressive results, achieving a precision rate of 93.27%, a recall rate of 79.86%, and a mean average precision (mAP) of 85.48%, which shows that the proposed method could effectively achieve taillight detection. [ABSTRACT FROM AUTHOR]

Hole detection is an important means of crack detection for aero-engine blades, and the current technology still mainly relies on manual operation, which may cause safety hazards for visual reasons. To address this problem, this paper proposes a deep learning-based, aero-engine blade crack detection model. First, the K-means++ algorithm is used to recalculate the anchor points, which reduces the influence of the anchor frame on the accuracy; second, the backbone network of YOLOv5s is replaced with Mobilenetv3 for a lightweight design; then, the slim-neck module is embedded into the neck part, and the activation function is replaced with Hard Sigmoid for redesign, which improves the accuracy and the convergence speed. Finally, in order to improve the learning ability for small targets, the SimAM attention mechanism is embedded in the head. A large number of ablation tests are conducted in real engine blade data, and the results show that the average precision of the improved model is 93.1%, which is 29.3% higher; the number of parameters of the model is 12.58 MB, which is 52.96% less, and the Frames Per Second (FPS) can be up to 95. The proposed algorithm meets the practical needs and is suitable for hole detection. [ABSTRACT FROM AUTHOR]

This paper investigates null control within the transmit–receive beampattern of Frequency Diverse Array-Multiple-Input and Multiple-Output (FDA-MIMO) systems, presenting a novel phase-only optimization approach for achieving null control in FDA-MIMO. We employ an alternating multiplier framework, which transforms the intricate and inherent constant modulus constraint and numerous amplitude constraints in optimization into more manageable projection problems. By employing a phase-only optimization strategy, the intricate hardware and computational burdens associated with null control in FDA-MIMO are effectively alleviated. The simulation results indicate that the algorithm proposed in this paper exhibits excellent null control ability while precisely maintaining constant modulus constraints, and it possesses an extremely high computational efficiency. [ABSTRACT FROM AUTHOR]

This paper presents an analytical method for the dimensioning and selection of the four glass tube collector types: single-glazed with an air layer, single-glazed with a vacuum layer, double-glazed with an air layer, and double-glazed with a vacuum layer. In the first part of the paper (dimensioning phase), the iterative thermal resistance calculation algorithms were developed for all glass tube collector types, whereby the iterative thermal resistance calculation algorithm of the single-glazed tube collector with an air layer was experimentally tested and validated. The second part of the paper (selection phase) uses a multi-criteria decision-making method to determine the optimal glass tube collector design. Unlike other papers, three indicator groups are taken into account in this case: geometric (mass, surface occupation, total surface occupation, volume occupation), economic (manufacturing and exploitation costs), and ecological (embodied energy and greenhouse gas emission). The proposed method is characterized by simple and fast calculations with satisfactory accuracy, which avoids high investment costs (experimental research), approximation and discretization of physical models (numerical research), and a large number of input parameters with boundary conditions (theoretical research). It should be noted that, with certain additions and changes, it can also be applied to other solar thermal collectors, so the authors believe such tools are handy for the global scientific public. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Xi'an Polytechnic University is the property of Editorial Department of Journal of Xi'an Polytechnic University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Path planning is one of the core issues in the autonomous navigation of an Unmanned Surface Vehicle (USV), as the accuracy of the results directly affects the safety of the USV. Hence, this paper proposes a USV path planning algorithm that integrates an improved Particle Swarm Optimisation (PSO) algorithm with a Dynamic Window Approach (DWA). Firstly, in order to advance the solution accuracy and convergence speed of the PSO algorithm, a nonlinear decreasing inertia weight and adaptive learning factors are introduced. Secondly, in order to solve the problem of long path and path non-smoothness, the fitness function of PSO is modified to consider both path length and path smoothness. Finally, the International Regulations for Preventing Collisions at Sea (COLREGS) are utilised to achieve dynamic obstacle avoidance while complying with maritime practices. Numerical cases verify that the path planned via the proposed algorithm is shorter and smoother, guaranteeing the safety of USV navigation while complying with the COLREGS. [ABSTRACT FROM AUTHOR]

This paper presents a design method of a suspension controller with an adaptive feedforward algorithm for ride comfort enhancement and motion sickness mitigation. Recently, it was shown that motion sickness is caused by combined heave and pitch motions of a sprung mass within the range of 0.8 and 8 Hz. For this reason, it is necessary to design a suspension controller for the purpose of reducing the heave and pitch vibration of a sprung mass within this range. To represent the heave acceleration and the pitch rate of a sprung mass, a 4-DOF half-car model is adopted as a vehicle model. For easy implementation in a real vehicle, a static output feedback control is adopted instead of a full-state one. To reduce the heave acceleration of a sprung mass for ride comfort enhancement, a linear quadratic SOF controller is designed. To reduce the pitch rate of a sprung mass for motion sickness mitigation, a filtered-X LMS algorithm is applied. To validate the method, simulation on vehicle simulation software is conducted. From the simulation results, it is shown that the proposed method is effective for ride comfort enhancement and motion sickness mitigation. [ABSTRACT FROM AUTHOR]

Understanding the dynamics of bubble growth and collapse during gas–liquid two-phase transient flow is crucial for minimizing pipeline wear and maintaining the normal operation of the pipeline system. This paper focuses on obtaining the bubble trajectory, movement velocity, and volume change of gas bubbles. The bubble images during the transient flow are first denoised and enhanced, then the moving target detection algorithm and watershed segmentation algorithm are used to segment the bubbles, and the contour reconstruction of the bubbles is performed using fitting to extract the relevant parameters. The movement trajectories of the bubbles are then traced by analyzing the trajectories and velocities of growth and collapse of the first bubbles during the transient flow, specifically when the flow rate of the hydraulic pipeline is 0.75 m/s. Finally, the changes in gas content during the transient flow in the pipeline under different initial flow rates are compared between the algorithm proposed here and the simulation results. [ABSTRACT FROM AUTHOR]

Security issues and privacy issues are serious problems facing today's society, especially in image security, where privacy protection plays a pivotal role. To improve the security of images, we propose an image encryption algorithm based on optical chaos and Rubik's cube matrix in this paper. First, optical chaos is generated by constructing an optical device model. Second, in the image encryption algorithm, optical chaos and Rubik's cube matrix are used to encrypt the image at the bit level for the first time, and a "U" type encryption method is designed, and different "U" type encryption schemes are selected to encrypt the image for the second time. Finally, the "four-way diffusion" algorithm is used to diffuse the encrypted image, which further improves the security of the image. The computer simulations and security analysis results both confirm that ciphertext images can resist various common attack means, such as statistical attacks, differential attacks, and brute force attacks. In this paper, the proposed algorithm of decimal conversion, "U" encryption, and "quadrangle diffusion" makes the pixel value and pixel position change greatly, and the ciphertext image loses the original features of the plaintext image, which shows that the algorithm has good security performance and is suitable for image encryptions. [ABSTRACT FROM AUTHOR]

The question "How does it work" has motivated many scientists. Through the study of natural phenomena and behaviors, many intelligence algorithms have been proposed to solve various optimization problems. This paper aims to offer an informative guide for researchers who are interested in tackling optimization problems with intelligence algorithms. First, a special neural network was comprehensively discussed, and it was called a zeroing neural network (ZNN). It is especially intended for solving time-varying optimization problems, including origin, basic principles, operation mechanism, model variants, and applications. This paper presents a new classification method based on the performance index of ZNNs. Then, two classic bio-inspired algorithms, a genetic algorithm and a particle swarm algorithm, are outlined as representatives, including their origin, design process, basic principles, and applications. Finally, to emphasize the applicability of intelligence algorithms, three practical domains are introduced, including gene feature extraction, intelligence communication, and the image process. [ABSTRACT FROM AUTHOR]

This paper addresses the challenge of detecting unknown or unforeseen obstacles in railway track transportation, proposing an innovative detection strategy that integrates an incremental clustering algorithm with lightweight segmentation techniques. In the detection phase, the paper innovatively employs the incremental clustering algorithm as a core method, combined with dilation and erosion theories, to expand the boundaries of point cloud clusters, merging adjacent point cloud elements into unified clusters. This method effectively identifies and connects spatially adjacent point cloud clusters while efficiently eliminating noise from target object point clouds, thereby achieving more precise recognition of unknown obstacles on the track. Furthermore, the effective integration of this algorithm with lightweight shared convolutional semantic segmentation algorithms enables accurate localization of obstacles. Experimental results using two combined public datasets demonstrate that the obstacle detection average recall rate of the proposed method reaches 90.3%, significantly enhancing system reliability. These findings indicate that the proposed detection strategy effectively improves the accuracy and real-time performance of obstacle recognition, thereby presenting important practical application value for ensuring the safe operation of railway tracks. [ABSTRACT FROM AUTHOR]

A deep-seated landslide could release numerous microseismic signals from creep-slip movement, which includes a rock-soil slip from the slope surface and a rock-soil shear rupture in the subsurface. Machine learning can effectively enhance the classification of microseismic signals in landslide seismic monitoring and interpret the mechanical processes of landslide motion. In this paper, eight sets of triaxial seismic sensors were deployed inside the deep-seated landslide, Jiuxianping, China, and a large number of microseismic signals related to the slope movement were obtained through 1-year-long continuous monitoring. All the data were passed through the seismic event identification mode, the ratio of the long-time average and short-time average. We selected 11 days of data, manually classified 4131 data into eight categories, and created a microseismic event database. Classical machine learning algorithms and ensemble learning algorithms were tested in this paper. In order to evaluate the seismic event classification performance of each algorithmic model, we evaluated the proposed algorithms through the dimensions of the accuracy, precision, and recall of each model. The validation results demonstrated that the best performing decision tree algorithm among the classical machine learning algorithms had an accuracy of 88.75%, while the ensemble algorithms, including random forest, Gradient Boosting Trees, Extreme Gradient Boosting, and Light Gradient Boosting Machine, had an accuracy range from 93.5% to 94.2% and also achieved better results in the combined evaluation of the precision, recall, and F1 score. The specific classification tests for each microseismic event category showed the same results. The results suggested that the ensemble learning algorithms show better results compared to the classical machine learning algorithms. [ABSTRACT FROM AUTHOR]

We live in the era of large data analysis, where processing vast datasets has become essential for uncovering valuable insights across various domains of our lives. Machine learning (ML) algorithms offer powerful tools for processing and analyzing this abundance of information. However, the considerable time and computational resources needed for training ML models pose significant challenges, especially within cascade schemes, due to the iterative nature of training algorithms, the complexity of feature extraction and transformation processes, and the large sizes of the datasets involved. This paper proposes a modification to the existing ML-based cascade scheme for analyzing large biomedical datasets by incorporating principal component analysis (PCA) at each level of the cascade. We selected the number of principal components to replace the initial inputs so that it ensured 95% variance retention. Furthermore, we enhanced the training and application algorithms and demonstrated the effectiveness of the modified cascade scheme through comparative analysis, which showcased a significant reduction in training time while improving the generalization properties of the method and the accuracy of the large data analysis. The improved enhanced generalization properties of the scheme stemmed from the reduction in nonsignificant independent attributes in the dataset, which further enhanced its performance in intelligent large data analysis. [ABSTRACT FROM AUTHOR]

Autonomous vehicles are rapidly advancing and have the potential to revolutionize transportation in the future. This paper primarily focuses on vehicle motion trajectory planning algorithms, examining the methods for estimating collision risks based on sensed environmental information and approaches for achieving user-aligned trajectory planning results. It investigates the different categories of planning algorithms within the scope of local trajectory planning applications for autonomous driving, discussing and differentiating their properties in detail through a review of the recent studies. The risk estimation methods are classified and introduced based on their descriptions of the sensed collision risks in traffic environments and their integration with trajectory planning algorithms. Additionally, various user experience-oriented methods, which utilize human data to enhance the trajectory planning performance and generate human-like trajectories, are explored. The paper provides comparative analyses of these algorithms and methods from different perspectives, revealing the interconnections between these topics. The current challenges and future prospects of the trajectory planning tasks in autonomous vehicles are also discussed. [ABSTRACT FROM AUTHOR]