• Nuclear Engineering and Technology
• /
• v.51 no.8
• /
• pp.1905-1915
• /
• 2019

This paper investigated the influence of simple support girds on flow, irrespective of having mixing vanes, in a 1 × 3 array rod bundle by using CFD methodology and the most accurate turbulence model which could reflect the actual physics of the flow was determined. In this context, a CFD model was created simulating the experimental studies on a single-phase flow [1] and the results were compared with the experimental data. In the first part of the study, influence of mesh was examined. Tetra, hybrid and poly type meshes were analyzed and convergence study was carried out on each in order to determine the most appropriate type and density. k - ε Standard and RSM LPS turbulence models were used in this section. In the second part of the study, the most appropriate turbulence model that could reflect the physics of the actual flow was investigated. RANS based turbulence models were examined using the mesh that was determined in the first part. Velocity and turbulence intensity results obtained on the upstream and downstream of the spacer grid at -3d_h, +3d_h and +40d_h locations were compared with the experimental data. In the last section of the study, the behavior of flow through the spacer grid was examined and its prominent aspects were highlighted on the most appropriate turbulence model determined in the second part. Results of the study revealed the importance of mesh type. Hybrid mesh having the largest number of structured elements performed remarkably better than the other two on results. While comparisons of numerical and experimental results showed an overall agreement within all turbulence models, RSM LPS presented better results than the others. Lastly, physical appearance of the flow through spacer grids revealed that springs has more influence on flow than dimples and induces transient flow behaviors. As a result, flow through a simple support grid was examined and the most appropriate turbulence model reflecting the actual physics of the flow was determined.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1250-1256
• /
• 2019

Although one can easily generate real-world 3D mesh data using a 3D printer or a depth camera, the generated data inevitably includes unnecessary noise. Therefore, mesh denoising is essential to obtain intact 3D mesh data. However, conventional mathematical denoising methods require preprocessing and often eliminate some important features of the 3D mesh. To address this problem, this paper proposes a deep learning based 3D mesh denoising method. Specifically, we propose a convolution-based autoencoder model consisting of an encoder and a decoder. The convolution operation applied to the mesh data performs denoising considering the relationship between each vertex constituting the mesh data and the surrounding vertices. When the convolution is completed, a sampling operation is performed to improve the learning speed. Experimental results show that the proposed autoencoder model produces faster and higher quality denoised data than the conventional methods.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.1-6
• /
• 2009

In this paper, we propose a mesh smoothing method for mesh models with noise. The proposed method enables not only the removal of noise from the vertexes but the preservation and smoothing of shape recognized as edges and comers. The magnitude ratio of 2D area and 3D volume in mesh data is adopted for the smoothing of noise. Comparing with previous smoothing methods, this method does not need many iteration of the smoothing process and could preserve the shape of original model. Experimental results demonstrate improved performance of the proposed approach in 3D mesh smoothing.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1507-1510
• /
• 2002

In this paper, we propose a sequential mesh cod- ing algorithm using the vertex pedigree based on the wave partitioning. After a mesh model is partitioned into several small processing blocks (SPB) using wave partitioning, we obtain vertices for each SPB along circumferences defined by outer edges of the attached triangles. Once all the vertices within each circumference are arranged into one line, we can encode mesh models

• Journal of Broadcast Engineering
• /
• v.9 no.1
• /
• pp.64-73
• /
• 2004

A robust watermarking algorithm is proposed for 3D mesh models. Watermark is inserted into the 2D image which is extracted from the target 3D model. Each Pixel value of the extracted 2D image represents a distance from the predefined reference points to the face of the given 3D model. This extracted image is defined as “range image” in this paper. Watermark is embedded into the range image. Then, watermarked 3D mesh is obtained by modifying vertices using the watermarked range Image. In extraction procedure, the original model is needed. After registration between the original and the watermarked models, two range images are extracted from each 3D model. From these images. embedded watermark is extracted. Experimental results show that the proposed algorithm is robust against the attacks such as rotation, translation, uniform scaling, mesh simplification, AWGN and quantization of vertex coordinates.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2332-2342
• /
• 1999

Multicast is an important system-level one-to-many collective communication service. A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Based on the LogP model, the proposed parameterized communication model can more accurately characterize the communication network of parallel platforms, Under the parameterized model, we propose an efficient architecture-independent method. OPT-tree algorithm, to construct optimal multicast trees and also investigate architecture-dependent tuning on performance of the multicast algorithm to achieve the truly optimal performance when implemented in real networks. Specifically, OPT-mesh which is the optimized version of the parameterized multicast algorithm for wormhole-switched mesh networks is developed and compared with two other well-known network-dependent algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3386-3411
• /
• 2019

Secured and reliable routing is a crucial factor for improving the performance of Wireless Mesh Networks (WMN) since these networks are susceptible to many types of attacks. The existing assumption about the internal nodes in wireless mesh networks is that they cooperate well during the forwarding of packets all the time. However, it is not always true due to the presence of malicious and mistrustful nodes. Hence, it is essential to establish a secure, reliable and stable route between a source node and a destination node in WMN. In this paper, a trust based secure routing algorithm is proposed for enhancing security and reliability of WMN, which contains cross layer and subject logic based reliable reputation scheme with security tag model for providing effective secured routing. This model uses only the trusted nodes with the forwarding reliability of data transmission and it isolates the malicious nodes from the providing path. Moreover, every node in this model is assigned with a security tag that is used for efficient authentication. Thus, by combining authentication, trust and subject logic, the proposed approach is capable of choosing the trusted nodes effectively to participate in forwarding the packets of trustful peer nodes successfully. The simulation results obtained from this work show that the proposed routing protocol provides optimal network performance in terms of security and packet delivery ratio.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.122-122
• /
• 2020

Urban flood simulation plays a vital role in national flood early warning, prevention and mitigation. In recent studies on 2-dimensional flood modeling, the integrated run-off inundation model is gaining grounds due to its ability to perform in greater computational efficiency. The adaptive quadtree shallow water numerical technique used in this model implements the adaptive mesh refinement (AMR) in this simulation, a procedure in which the grid resolution is refined automatically following the flood flow. The method discounts the necessity to create a whole domain mesh over a complex catchment area, which is one of the most time-consuming steps in flood simulation. This research applies the dynamic grid refinement method in simulating the recent extreme flood events in Metro Manila, Philippines. The rainfall events utilized were during Typhoon Ketsana 2009, and Southwest monsoon surges in 2012 and 2013. In order to much more visualize the urban flooding that incorporates the flow within buildings and high-elevation areas, Digital Surface Model (DSM) resolution of 5m was used in representing the ground elevation. Results were calibrated through the flood point validation data and compared to the present flood hazard maps used for policy making by the national government agency. The accuracy and efficiency of the method provides a strong front in making it commendable to use for early warning and flood inundation analysis for future similar flood events.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.30 no.3
• /
• pp.172-181
• /
• 1994

The mesh selectivity of diamond and suare mesh cod-ends at the Southern Korean Sea and the East China Sea were compared for Pampus argenteus, Trachurus japonicus, Trichiurus lepturus. Selection trials were carried out using diamond and square mesh cod-end by trouser type cod-end with cover net. of which the mesh cod-end has four types : A(51.2mm), B(70.2mm), C(77.6mm), D(88.0mm). Selection curves and selection parameters were calculated using a logistic model. The results obained are summarized as follows : 1. Harvest fish : In B. C and D type selection range and fifty percent selection length of the square mesh were about 21mm, 11mm : 12mm, 18mm and 34mm, 5mm higher than those of the diamond mesh, respectively. Selection factor of master curve for the diamond mesh was 1.54 and for the square mesh was 1.68. The optimum mesh size for the diamond mesh was 97.4mm and for the square mesh was 89.3mm, the difference was 8.1mm. 2. Horse mackerel : In A type, selection range was nearly the same for the diamond and the square mesh, but fifty percent selection length of the square mesh was 43mm higher than the diamond mesh. In B. C and D type, selection range and fifty percent selection length of the square mesh were about 6mm, 3mm : 24mm, 21mm and 11mm, 42mm higher than those of the diamond mesh, respectively. Selection factor of master curve for the diamond mesh was 2.37, for the square mesh was 2.77. The optimum mesh size for the diamond mesh was 78.1mm and for the square mesh was 66.8mm, the difference was 11.3mm. 3. Hair tail : In A, B and C type, selection range of the square mesh was about 34mm, 8mm, 60mm higher than those of the diamond mesh. Fifty percent selection length for the diamond mesh was about 5mm, 7mm, 8mm higher than that of the square mesh. Selection factor of master curve for the diamond mesh was 3.11, for the square mesh was 3.48. The optimum mesh size for the diamond mesh was 64.3mm and for the square mesh was 57.5mm, the difference was 6.8mm.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.133-140
• /
• 2009

Presented in this paper is a method to generate round-endmill toolpaths for sculptured surfaces represented as a triangular mesh model. The proposed method is applicable in toolpath generation for ball-endmills and flat-endmills because the round-endmill is a generalized tool in three-axis NC (numerical control) milling. The method uses a wireframe model as the offset model that represents a cutter location surface. Since wireframe models are relatively simple and fast to calculate, the proposed method can process large models and keep high precision. Intersection points with the wireframe offset model and a tool guide plane are calculated, and intersection curves are constructed by tracing the intersection points. The final step of the method is extracting regular curves from the intersection curves including degenerate and self-intersected segments. The proposed method is implemented and tested, and a practical example is presented.