• Nuclear Engineering and Technology
• /
• v.53 no.11
• /
• pp.3764-3771
• /
• 2021

Based on the convolutional neural network (CNN), a novel technique is investigated for lost gamma source detection in a room. The CNN is trained with the result of a GEANT4 simulation containing a gamma source inside a meshed room. The dataset for the training process is the deposited energy in the meshes of different n-step paths. The neural network is optimized with parameters such as the number of input data and path length. Based on the proposed method, the place of the gamma source can be recognized with reasonable accuracy without human intervention. The results show that only by 5 measurements of the energy deposited in a 5-step path, (5 sequential points 50 cm apart within 1600 meshes), the gamma source location can be estimated with 94% accuracy. Also, the method is tested for the room geometry containing the interior walls. The results show 90% accuracy with the energy deposition measurement in the meshes of a 5-step path.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.131-143
• /
• 2004

Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.

• Journal of Environmental Science International
• /
• v.25 no.11
• /
• pp.1521-1530
• /
• 2016

As a result of dividing typhoon that affected Korean Peninsular between 1999 and 2012 into 7 types of path and entering forecast field and analysis field of RDAPS, until 36 hours from the time of forecast, it is reliable to use the forecast field of RDAPS to predict typhoon and for each typhoon path, the difference between the forecast and the analysis shows normal distribution, which is usable for weather forecast until the $36^{th}$ hour. In the $48^{th}$ hour from the time of forecast, the difference of result depending on each typhoon path increased, which was analyzed to be due to errors in the forecast. It was expected that relatively reasonable results should be shown if the $36^{th}$ hour forecast is used to predict the strength and distribution of strong wind. As a result of using Korean RAM and observing the difference of the maximum damage, reliability was secured up to 36 hours and after 48hours, it was expected that the fluctuation of results may become more severe.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.10 no.2
• /
• pp.1-8
• /
• 2011

5-axis NC machining has a good advantage of the accessibility of tool motion by adding two rotary axes. It offers numerous advantages such as expanding machining fields in parts of turbo machineries like impeller, propeller, turbine blade and rotor, reasonable tool employment and great reduction of the set-up process. However, as adding two rotary axes, it is difficult to choose suitable machining conditions in terms of cutter path and cutter posture at a cutter contact point. Therefore in this paper, it is proposed to decide suitable machining condition through an experimental method such as adopting various cutter paths, cutter postures types. Also, in order to increase the efficiency of 5-axis machining, it is necessary to minimize the cutter posture changes and create a continuous cutter path while avoiding interference. This study, by using an MC-space algorithm for interference avoidance and an MB-spline algorithm for continuous control, is intended to create a 5-axis machining cutter path with excellent surface quality and economic feasibility. finally, this study will verify the effectiveness of the suggested method through verification processing.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.19-31
• /
• 2016

A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.4
• /
• pp.25-32
• /
• 2015

The Genetic algorithm is a search algorithm using evaluation, genetic operator, natural selection to populational solution iteratively. The convergence and divergence characteristic of genetic algorithm are affected by selection strategy, generation replacement method, genetic operator when genetic algorithm is designed. This paper proposes fast convergence genetic algorithm for time-limited robot path planning. In urgent situation, genetic algorithm for robot path planning does not have enough time for computation, resulting in quality degradation of found path. Proposed genetic algorithm uses fast converging selection strategy and generation replacement method. Proposed genetic algorithm also uses not only traditional crossover and mutation operator but additional genetic operator for shortening the distance of found path. In this way, proposed genetic algorithm find reasonable path in time-limited situation.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Journal of the Optical Society of Korea
• /
• v.13 no.2
• /
• pp.173-177
• /
• 2009

Digital holographic microscopy allows optical path difference measurement. Optical path difference depends on the both refractive index and morphology of sample. We developed a dual-wavelength in-line digital holographic microscope that can measure simultaneously the refractive index and morphology of a sample, providing highly precise three-dimensional information. Here we propose theoretical and experimental methods for dual-wavelength in-line digital holographic microscopy. The measured data were reasonable, although there was data error. By improving the experimental method, we could measure the refractive index more precisely and obtain more accurate three-dimensional information on samples.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2001.03a
• /
• pp.215-222
• /
• 2001

Uncertainty study of shear strength characteristics of the marine clays was carried out based ell In-situ tests and laboratory tests on tile south-east coastal region of the Korean peninsula. Theoretical analyses were studied using both tile spherical cavity expansion theory in finite soil mass and the strain path method to determine tile cone factor using the undrained shear strengths obtained by in-situ tests, and the empirical methods in accordance with the ultimate resistance theory were also discussed. Analysis show that the empirical methods suggest more reasonable value than that of theoretical methods in terms of comparing the cone factor estimated using linear regression and frequency distribution analyses. The cone factors obtained by the empirical methods are 18, 15, and 6 respectively, from the results of total cone resistance, effective cone resistance, and excess porewater cone resistance method, and the estimated were similar to those of previous researcher's.