• 제목/요약/키워드: mesh model

검색결과 1,194건 처리시간 0.03초

Numerical investigation of flow characteristics through simple support grids in a 1 × 3 rod bundle

  • Karaman, Umut;Kocar, Cemil;Rau, Adam;Kim, Seungjin
    • Nuclear Engineering and Technology
    • /
    • 제51권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 -3dh, +3dh and +40dh 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.

딥 러닝 기반 얼굴 메쉬 데이터 디노이징 시스템 (A Deep Learning-Based Face Mesh Data Denoising System)

  • 노지현;임현승;김종민
    • 전기전자학회논문지
    • /
    • 제23권4호
    • /
    • pp.1250-1256
    • /
    • 2019
  • 3차원 프린터나 깊이 카메라 등을 이용하면 실세계의 3차원 메쉬 데이터를 손쉽게 생성할 수 있지만, 이렇게 생성된 데이터에는 필연적으로 불필요한 노이즈가 포함되어 있다. 따라서, 온전한 3차원 메쉬 데이터를 얻기 위해서는 메쉬 디노이징 작업이 필수적이다. 하지만 기존의 수학적인 디노이징 방법들은 전처리 작업이 필요하며 3차원 메쉬의 일부 중요한 특징들이 사라지는 문제점이 있다. 본 논문에서는 이러한 문제를 해결하기 위해 딥 러닝 기반의 3차원 메쉬 디노이징 기법을 소개한다. 구체적으로 본 논문에서는 인코더와 디코더로 구성된 컨볼루션 기반 오토인코더 모델을 제안한다. 메쉬 데이터에 적용하는 컨볼루션 연산은 메쉬 데이터를 구성하고 있는 각각의 정점과 그 주변의 정점들 간의 관계를 고려하여 디노이징을 수행하며, 컨볼루션이 완료되면 학습 속도 향상을 위해 샘플링 연산을 수행한다. 실험 결과, 본 논문에서 제안한 오토인코더 모델이 기존 방식보다 더 빠르고 더 높은 품질의 디노이징된 데이터를 생성함을 확인하였다.

Noise reduction for mesh smoothing of 3D mesh data

  • Hyeon, Dae-Hwan;WhangBo, Taeg-Keun
    • International Journal of Contents
    • /
    • 제5권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.

Sequential Mesh Coding using Wave Partitioning

  • Kim, Tae-Wan;Ahn, Jeong-Hwan;Jung, Hyeok-Koo;Ho, Yo-Sung
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 ITC-CSCC -3
    • /
    • 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

  • PDF

3차원 메쉬 모델을 위한 강인한 워터마킹 기법 (Robust Watermarking Algorithm for 3D Mesh Models)

  • 송한새;조남익;김종원
    • 방송공학회논문지
    • /
    • 제9권1호
    • /
    • pp.64-73
    • /
    • 2004
  • 본 논문에서는 3차원 메쉬 모델에 적용되는 강인한 워터마킹 알고리듬을 제안한다. 제안하는 알고리듬에서 워터마크는 3차원 모델로부터 추출된 2차원 영상에 삽입된다. 이 2차원 영상의 화소 값은 정해진 기준점들로부터 3차원 모델의 표면까지의 거리이며, 이를 거리 영상이라 한다. 워터마크는 거리 영상에 삽입되며, 워터마크된 거리 영상을 이용하여 3차원 모델의 꼭지점 좌표를 변경하면 워터마크가 삽입된 3차원 모델을 얻는다. 워터마크의 추출은 워터마크가 삽입된 모델로부터 거리영상을 얻고, 이 영상에서 워터마크를 추출한다. 워터마크 추출에는 원본 모델이 필요하며 원본과의 정합이 필요하다. 실험을 통해 제안하는 알고리듬이 회전, 병진, 비례조절, 가우스 잡음, 메쉬 간략화, 꼭지점 양자화에 강인함을 확인하였다.

변수화된 통신모델에서의 최적의 멀티캐스트 알고리즘 및 컴퓨터 구조에 따른 튜닝 (Optimal Multicast Algorithm and Architecture-Dependent Tuning on the Parameterized Communication Model)

  • 이주영
    • 한국정보처리학회논문지
    • /
    • 제6권9호
    • /
    • pp.2332-2342
    • /
    • 1999
  • 멀티캐스트는 중요한 시스템 레벨의 그룹 프로세스들을 수반하는 통신 서비스의 한 클래스이다. 소프트웨어 멀티캐스트 알고리즘을 설계하는데 있어서의 주된 문제는 성능과 이식성 사이의 교환조건(trade-off)을 고려하는 것이다. 본 논문에서 제안하는 변수화 된 통신 모델은 LogP 모델의 확장으로 병렬 플랫폼의 통신 네트워크를 더 정확하게 특성화 할 수 있다. 이 변수화 된 모델에서, 컴퓨터 구조에 의존적이지 않고 이식성 있는 OPT-tree라는 최적의 멀티캐스트를 형성하는 알고리즘을 제안한다. 실제 여러 네트워크에 구현했을 때 진정한 최적의 수행을 달성하기 위해서 OPT-tree로 생성된 트리에서의 네트워크 위상에 따른 튜닝(tuning)에 대해 연구한다. 특히 웜홀 스위치를 사용하는 메쉬(mesh) 네트워크에서 변수화 된 멀티캐스트 알고리즘의 최적화 한 버전인 OPT-mesh 알고리즘을 개발하여 다른 알고리즘들과 비교하여 그 우수성을 검증한다.

  • PDF

Trust based Secure Reliable Route Discovery in Wireless Mesh Networks

  • Navmani, TM;Yogesh, P
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권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.

Application of adaptive mesh refinement technique on digital surface model-based urban flood simulation

  • Dasallas, Lea;An, Hyunuk
    • 한국수자원학회:학술대회논문집
    • /
    • 한국수자원학회 2020년도 학술발표회
    • /
    • 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.

  • PDF

사각형강목의 끝자루를 이용한 트롤어구의 어획선택성 연구 ( 2 ) - 다이아몬드형강목과 사각형강목의 선택성비교 - ( Studies on the Selectivity of the Trawl Net With the Square Mesh Cod-End ( 2 ) - Comparison of Diamond and Square Mesh Cod-End - )

  • 김삼곤;이주희;박정식
    • 수산해양기술연구
    • /
    • 제30권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.

  • PDF

삼각망 곡면의 3축 라운드엔드밀 가공을 위한 공구경로 생성 (Toolpath Generation for Three-axis Round-end Milling of Triangular Mesh Surfaces)

  • 정연찬
    • 한국정밀공학회지
    • /
    • 제26권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.