Cosmic-ray muon scattering tomography (MST) technology is a new radiation imaging technology with unique advantages. As the performance of its image reconstruction algorithm has a crucial influence on the imaging qual...
详细信息
Cosmic-ray muon scattering tomography (MST) technology is a new radiation imaging technology with unique advantages. As the performance of its image reconstruction algorithm has a crucial influence on the imaging quality, researches on this algorithm are of great significance to the development and application of this technology. In this paper, a fast inspection algorithm based on clustering analysis for the identification of the existence of nuclear materials is studied and optimized. Firstly, the principles of MST technology and a binned clustering algorithm were introduced, and then several simulation ex-periments were carried out using Geant4 toolkit to test the effects of exposure time, algorithm parameter, the size and structure of object on the performance of the algorithm. Based on these, we proposed two optimization methods for the clustering algorithm: the optimization of vertical distance coefficient and the displacement of sub-volumes. Finally, several sets of experiments were designed to validate the optimization effect, and the results showed that these two optimization methods could significantly enhance the distinguishing ability of the algorithm for different materials, help to obtain more details in practical applications, and was therefore of great importance to the development and application of the MST technology. (c) 2020 Korean Nuclear Society, Published by Elsevier Korea LLC. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).
The evolution of technologies such as Big Data, Cloud Computing, and Artificial Intelligence is inextricably linked to the transmission of network data. Programmable network devices that facilitate high-speed processi...
详细信息
This study aims to enhance privacy protection algorithms in hospital information systems by proposing a differential privacy approach to secure patients' sensitive data. The study initially looked into the necessi...
详细信息
ISBN:
(纸本)9798400707087
This study aims to enhance privacy protection algorithms in hospital information systems by proposing a differential privacy approach to secure patients' sensitive data. The study initially looked into the necessity for privacy protections in hospital information systems, stressing the significance of balancing privacy and data usefulness when handling medical information. The differential privacy mechanism was implemented to address privacy leakage risks during data anonymization, leading to enhanced data processing efficiency. The experimental design used a simulated hospital information system data set to analyze and verify the performance of the proposed algorithm, proving its effectiveness under different privacy parameter settings. The experimental results show that the algorithm can achieve a good balance between data practicality and privacy protection, and improve computational efficiency, which is suitable for large-scale medical data processing. The research also investigated how various privacy settings affect algorithm efficiency, offering valuable insight for implementing hospital information systems. The study's successful execution established the groundwork for using privacy protection algorithms in the medical sector, and introduced a privacy protection technique that can serve as a model for other industries with sensitive data.
Forward collision warning (FCW) systems have been widely used in trucks to alert drivers of potential road situations so they can reduce the risk of crashes. Research on FCW use shows, however, that there are differen...
详细信息
Forward collision warning (FCW) systems have been widely used in trucks to alert drivers of potential road situations so they can reduce the risk of crashes. Research on FCW use shows, however, that there are differences in drivers' responses to FCW alerts under different scenarios. Existing FCW algorithms do not take differences in driver response behavior into account, with the consequence that the algorithms' minimum safe distance assessments that trigger the warnings are not always appropriate for every driver or situation. To reduce false alarms, this study analyzed truck driver behavior in response to FCW warnings, and k-means clustering was adopted to classify driver response behavior into three categories: Response Before Warning (RBW), Response After Warning (RAW), and No Response (NR). Results showed that RBW clusters tend to occur at long following distances (>19 m), and drivers applied braking before the warning. In RAW clusters, deceleration after warning is significantly more forceful than before warning. NR clusters occur at short distances, and deceleration fluctuates only slightly. To optimize the FCW algorithm, the warning distance was divided into reaction distance and braking distance. The linear support vector machine was used to fit the driver reaction distance. The long shortterm memory method was used to predict braking distance based on each of the three response scenarios: R2 was 0.896 for RAW scenarios, 0.927 for RBW scenarios, and 0.980 for NR scenarios. Verification results show that the optimized truck FCW algorithm improved safety by 1 % to 5.1 %;accuracy reached 97.92 %, and the false alarm rate was 1.73 %.
BM@N (Baryonic Matter at Nuclotron) is the first working experiment performed at the NICA accelerator complex. It is a fixed target experiment. To date, there have been seven runs of the experiment, most of which were...
详细信息
BM@N (Baryonic Matter at Nuclotron) is the first working experiment performed at the NICA accelerator complex. It is a fixed target experiment. To date, there have been seven runs of the experiment, most of which were technical. In 2018, the first run of the experimental facility with physics data acquisition took place. One of the prerequisites for physics analysis of experimental data is the existence of the primary vertex position estimation. This study describes the proposed algorithm for reconstruction of the primary vertex using the virtual planes method. The results of this algorithm for different targets, beams, and trigger conditions are presented. The sensitivity of the presented method is considered.
The U-curve branch-and-bound algorithm for optimization was introduced recently by Ris and collaborators. In this paper we introduce an improved algorithm for finding the optimal set of features based on the U-curve a...
详细信息
ISBN:
(纸本)9781479934621
The U-curve branch-and-bound algorithm for optimization was introduced recently by Ris and collaborators. In this paper we introduce an improved algorithm for finding the optimal set of features based on the U-curve assumption. Synthetic experiments are used to asses the performance of the proposed algorithm, and compare it to exhaustive search and the original algorithm. The results show that the modified U-curve BB algorithm makes fewer evaluations and is more robust than the original algorithm.
Research the application of A* algorithm in path planning. Examine several different optimization strategies for the A* algorithm heuristic function. These strategies aim to improve the search efficiency and path qual...
详细信息
ISBN:
(纸本)9798350386783;9798350386776
Research the application of A* algorithm in path planning. Examine several different optimization strategies for the A* algorithm heuristic function. These strategies aim to improve the search efficiency and path quality of the algorithm. To verify the effectiveness of each strategy, simulations were conducted in two raster map environments with different levels of complexity. The results show that the optimization strategy of the heuristic function can improve the algorithm performance to a certain extent, and the effects of different strategies are related to the complexity of the environment.
Based on the characteristics of Einstein wurfelt nicht!(EWN), this paper puts forward the UCT algorithm applied to EWN, and on its basis, an optimized UCT algorithm with the evaluation function and the dynamic searchi...
详细信息
ISBN:
(纸本)9781665478960
Based on the characteristics of Einstein wurfelt nicht!(EWN), this paper puts forward the UCT algorithm applied to EWN, and on its basis, an optimized UCT algorithm with the evaluation function and the dynamic searching rounds is proposed. The evaluation function is used to better evaluate the situation, and the dynamic searching rounds is used to reduce the average cost per game by a decay function. By playing multiple games with the UCT algorithm, the optimized UCT algorithm proved to be effective in improving the strength of the EWN game system.
In the current research field, aiming at the problem of robot path planning, this study proposes an optimization strategy combining RRT algorithm and APF method. This strategy aims to achieve more efficient and reliab...
详细信息
ISBN:
(纸本)9798350352511;9798350352504
In the current research field, aiming at the problem of robot path planning, this study proposes an optimization strategy combining RRT algorithm and APF method. This strategy aims to achieve more efficient and reliable robot path planning by improving the path search efficiency of RRT algorithm and combining the goal-oriented and obstacle-avoiding capability of APF. Specifically, we optimize the RRT algorithm as follows: First, we introduce an APF-based heuristic strategy, which helps guide the path search process closer to the target point faster;Secondly, in the process of path generation, the APF method is used to smooth the path in real time to reduce the complexity of the path and the energy consumption during execution. After extensive testing in simulation environments, the optimization strategy shows significant improvements in path length, planning time, and obstacle avoidance. Compared with the traditional RRT algorithm, the new strategy not only reduces the path length, but also shows stronger adaptive ability and robustness in the face of complex environment and sudden obstacles. In addition, through the path smoothing process guided by APF, the dynamic response and stability of the robot when executing the path are also improved.
In order to make the CMOS image sensor exposure automatically and correctly in different environment, this paper presents an improved algorithm based on image entropy. Image entropy is the information measure of image...
详细信息
ISBN:
(纸本)9781467390989
In order to make the CMOS image sensor exposure automatically and correctly in different environment, this paper presents an improved algorithm based on image entropy. Image entropy is the information measure of image. Thus, with the purpose of getting the most appropriate exposure time, we can search the maximum information entropy. What's more, by using the formula manipulation of image entropy and the piecewise linearization of the log function, the algorithm grasps the overall change rule and avoids the traditional precise calculation, which can save the computing time greatly and reduce the use of the resource. Meanwhile, simulation results demonstrated the effectiveness of the algorithm, which leaves a strong foundation for the hardware realization of the CMOS image sensor auto-exposure.
暂无评论