Introduction With the global population increasingly relying on the internet for information, YouTube has emerged as a significant platform for communication and information sharing, particularly in the field of medicine. However, concerns persist regarding the reliability and quality of medical information on YouTube, given the lack of regulation and guidelines. This study aims to systematically evaluate the reliability of health-related information on YouTube. Methods: Data collection was conducted in September 2023 on YouTube, with stringent selection criteria for videos. Videos were evaluated using the "Internet Health Information Certification Standards" by the Korean Medical Association and the Global Quality Scale. A plastic surgeon assessed information quality based on specific criteria. The study analyzed the influence of keywords on information accessibility and compared the evaluation tools. Results: 76 Korean search results were analyzed using keywords. Certified South Korean medical providers appeared more in "ptosis surgery" results (50%) than "droopy eyelid diagnosis" (5%). Medical professionals produced 86.7% of videos, with some non-medical content. "Ptosis surgery" had the highest KMA scale score (16.3), "droopy eyelid diagnosis" the lowest (13.8). Out of 76 videos, 39 by plastic surgeons, 20 by ophthalmologists, and 5 by dermatologists. A GQS comparison showed specialists with higher scores (3.12) than non-specialists (1.53). Conclusion: YouTube and similar platforms offer valuable access to medical information, but quality and reliability remain significant concerns. Collaborative efforts from government agencies, medical organizations, and users are essential to enhance the quality of online health information. Users should also cultivate critical thinking skills to discern trustworthy information.

In order to solve the problem of many constraints and complex navigation environment in the path planning of unmanned surface vehicle(USV), an improved Sparrow search algorithm com-bining Cubic chaotic map and Gaussian random walk strategy was proposed to plan it. Firstly, in the population initialization stage, Cubic chaotic map was used to replace the random generation method of the traditional sparrow search algorithm to optimize the uneven initial distribution of the population and improve the global search ability of the population. Secondly, in the late it-eration of the algorithm, the standard deviation of fitness is introduced to determine whether the population is trapped in the local optimum. If true, the Gaussian random walk strategy is used to perturb the optimal individual and assist the algorithm to escape the local optimum. Thirdly, the chosen water environment is modeled, and the navigation information of the original inland electronic navigation chart(ENC) is preprocessed, gridized, and the obstacle swelling is processed. Finally, the path planning experiments of USV are carried out in inland ENC grid environment. The experimental results show that, compared with the traditional sparrow search algorithm, the average fitness value of the path planned by improved sparrow search algorithm is reduced by 14.8%, and the variance is reduced by 49.9%. The path planned by the algorithm is of good quality and high stability, and combined with ENC, it can provide a reliable path for USV.

Traditional path planning algorithms have drawbacks in unmanned vehicle path planning, such as low efficiency, unsuitability for dynamic environments, and high computational complexity. To address these issues, this paper proposes a dynamic path planning method for unmanned vehicles that combines the A* algorithm with an improved Dynamic Window Approach (DWA). Firstly, a collision risk function is incorporated into the DWA algorithm to evaluate scores based on the braking distance corresponding to the current vehicle speed and the distance to obstacles, determining whether timely braking or obstacle avoidance is feasible. The earlier the braking or obstacle avoidance, the higher the score, thereby enhancing the evaluation algorithm of the DWA. Secondly, the key points extracted by the A* algorithm are used as temporary target points for the DWA algorithm, reducing the eight search directions to five. Finally, the key points of the A* algorithm’s path are set as the temporary end points for the DWA algorithm, integrating the two algorithms to plan a smoother curved path that can avoid unknown and dynamic obstacles. Simulation data demonstrates that compared to traditional artificial potential field methods, RRT, and Dijkstra’s algorithm, the new fusion algorithm reduces time by 11.71 seconds, a decrease of 6.9%, and shortens path length by 3.093 meters, a reduction of 4.16%, while increasing average linear velocity by 2.9%. The proposed algorithm ensures smoother paths while also making paths more rational and efficient

The Stepped Frequency Waveform (SFW) is commonly employed in radar technology to synthesize wideband signals through the aggregation of narrow-band pulses, thereby achieving high-resolution range profiles without the need to increase the radar's instantaneous bandwidth. However, the inherent large time-bandwidth product of SFW introduces substantial ranging errors and energy dispersion, which significantly hinders its efficacy in detecting high-speed objects. This paper introduces a pioneering velocity estimation technique utilizing the fractional Fourier transform (FrFT) to address these limitations. Leveraging the characteristic of the Doppler signal from a moving target, which manifests as a chirp signal with a rate proportional to the target's velocity, the FrFT is utilized for precise velocity estimation. Subsequent to this, velocity compensation is applied using the deduced metrics, followed by the application of the inverse fast Fourier transform (iFFT) to pinpoint the target's exact location. To optimize the computational efficiency of determining the FrFT's optimal order, we propose an iterative algorithm founded on the golden section search method. The effectiveness of the proposed approach is verified by simulation data, and the results demonstrate that the proposed approach can accurately estimate the velocity and the range of the high-speed targets with a relatively low computational complexity.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

Searching over a sorted list is a classical problem in computer science. Binary Search takes at most log2n+1 tries to find an item in a sorted list of size n. Interpolation Search achieves an average time complexity of Ο(loglogn) for uniformly distributed data. Hybrids of Binary Search and Interpolation Search are also available to handle data with unknown distributions. This paper analyzes the computation cost of these methods and shows that interpolation can significantly affect their performance — accordingly, a new method, Interpolation Once Binary Search (IOBS), is proposed. The experimental results show that IOBS outperforms the hybrids of Binary Search and Interpolation Search for nonuniformly distributed data.