• Journal of computational fluids engineering
• /
• v.20 no.2
• /
• pp.23-36
• /
• 2015

The $2^{nd}$ generation ice accretion analysis program has been developed and validated for various icing conditions. The essential feature of the $2^{nd}$ generation code lies in its capability of handling general 3-D geometry and improved accuracy. The entire velocity fields are obtained based on Navier-Stokes equations in order to take the massively separated flow field into account. Unlike $1^{st}$ generation code, the droplet trajectories are calculated using Eulerian approach, which is adopted to yield appropriate collection efficiency even in the shadow region. For improved thermodynamic analysis on the surfaces, water film model and modified Messinger model are newly included in the present analysis. The ice shape for a given time step is obtained by considering the exact amount of ice accreted on the surface. Each module of the icing analysis code has been seamlessly integrated on the OpenFOAM platform. The developed code was validated against available experimental data for 2D airfoils and 3D DLR-F4. Due to the lack of experimental data, the computed results of DLR-F4 were compared with those obtained from FENSAP-ICE, which is state-of-the-art 3D icing analysis code. It was clearly shown that the present code produces comparable results to those of FENSAP-ICE, in terms of prediction accuracy and the capability of handling general 3-D geometries.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2017.04a
• /
• pp.78-80
• /
• 2017

3D 프린터를 이용하여 출력을 하기 위해서는 3D 모델 데이터를 G-code로 변환하는 과정을 수행해야 한다. 일반적으로 3D 모델은 STL 파일 형식으로 저장되는데, 이 파일은 대개 삼각형 형식인 페이셋들의 좌표 데이터를 포함하고 있다. 만약 3D 모델의 크기가 커지거나 정밀도가 높아진다면, 페이셋의 수가 매우 많아지게 되고, 결과적으로 3D 모델에서 G-code로 변환하는 시간이 길어지게 된다. 본 논문에서는 널리 활용되고 있는 Hadoop에서 변환 소프트웨어를 개발하고자 하였다. Hadoop은 마스터 노드와 여러 데이터 노드들이 Map-Reduce 방식으로 작업을 수행한다. 이러한 노드들은 하둡 파일시스템(HDFS)을 공유할 수 있어 작업을 효율적으로 수행할 수 있다. 이에 본 논문에서는 이 시스템의 기능을 활용하여 기존에 개발된 분산 알고리즘을 변형한 후 이를 구현하고자 한다.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2001

We developed an on-line lathe simulator which can be used for a CAM education on the internet. Previously, VRML or static images such as JPG have been commonly used to achieve the same goal. With the 3D tool like VRML, it was possible to describe the movement of 3D object effectively. However, G-code based modeling and real-time visualization for the cutting process including parts being machined could not be accomplished. By using the simulator, we can machine a part with G-code input from a user or modeler, and parts being machined can be visualized in 2D as well as 3D. The developed system is based on EMCO lathe from Eshed and can be used through a web browser.

• Korean Journal of Computational Design and Engineering
• /
• v.22 no.1
• /
• pp.10-17
• /
• 2017

The recent 3D printing industry has been focusing on developing 3D printers to fulfill the user's need to bring more colorful and realistic outcomes. Several 3D printers have deployed multiple extruders to print different colors. However, this method has a limit on its availability of colors. To solve this, recent research is focused on using mixing chambers to mix the possible colors to provide more color availability. In this paper, we discuss the environment and algorithm behind the development of G-code which allows a gradation effect of the mix of two filaments. The generation algorithm to make gradient G-code has been implemented in Cura using C ++ and Python.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.10a
• /
• pp.194-199
• /
• 2007

IB (immersed boundary) method is one of the prominent tool in computational fluid dynamics for the analysis of flows over complex geometries. The IB technique simplyfies the solution procedure by eliminating the requirement of complex body fitted grids and it is also superior in terms of memory requirement. In this study we have developed numerical code (FOTRAN) for the analysis of 2D flow over a cylinder using IB technique. The code is validated by comparing the wake lengths and separation angles given by Guo et. al. We employed fractional-step procedure for solving the Navier-Stokes equations governing the flow and discrete forcing IB technique for imposing boundary conditions. Also we have developed a 3D code for the backward-facing-step flow and flow over a sphere. The reattachment length in backward-facing-step flow was compared with the one given by Nie and Armaly, which has proven the validity of our code.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1105-1120
• /
• 2015

With the proposed principle of two-dimensional matrix bar code design based on masks, the whole surface of a 2D bar code is used for creating graphic patterns. Masks are a method of overlaying certain information with complete preservation of encoded information. In order to ensure suitable mask performance, it is essential to create a set of masks (mask folder) which are similar to each other. This ultimately allows additional error correction on the whole code level which is proven mathematically through an academic example of a QR code with a matrix of size $9{\times}9$. In order to create a mask folder, this article will investigate parameters based on Weber's law. With the parameters founded in the research, this principle shows how QR codes, or any other 2D bar code, can be designed to display two different messages. This ultimately enables a better description of a 2D bar code, which will improve users' visual recognition of 2D bar code purpose, and therefore users' greater enjoyment and involvement.

• Nuclear Engineering and Technology
• /
• v.37 no.3
• /
• pp.265-272
• /
• 2005

Severe accidents in nuclear power plants can cause hydrogen-generating chemical reactions, which create the danger of hydrogen combustion and thus threaten containment integrity. For containment analyses, a three-dimensional mechanistic code, GOTHIC-3D has been applied near source compartments to predict whether or not highly reactive gas mixtures can form during an accident with the hydrogen mitigation system working. To assess the code applicability to hydrogen combustion analysis, this paper presents the numerical calculation results of GOTHIC-3D for various hydrogen combustion experiments, including FLAME, LSVCTF, and SNU-2D. In this study, a technical base for the modeling oflarge- and small-scale facilities was introduced through sensitivity studies on cell size and bum modeling parameters. Use of a turbulent bum option of the eddy dissipation concept enabled scale-free applications. Lowering the bum parameter values for the flame thickness and the bum temperature limit resulted in a larger flame velocity. When applied to hydrogen combustion analysis, this study revealed that the GOTHIC-3D code is generally able to predict the combustion phenomena with its default bum modeling parameters for large-scale facilities. However, the code needs further modifications of its bum modeling parameters to be applied to either small-scale facilities or extremely fast transients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1672-1677
• /
• 2015

The multi-level holographic storage system can store more than one bit per pixel. In this paper, we introduce a 6-pixel 4-level modulation code and compare with 4-level 6/9 modulation code and 2/3 modulation code. The proposed 6-pixel modulation code has the minimum Euclidean distance 3. The 6-pixel modulation code is approximately 1dB better than the other modulation codes.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.29 no.5
• /
• pp.459-469
• /
• 2011

There are various factors for determining object shape, such as size, slope and its direction, curvature, length, surface, angles between lines or planes, distribution of the model key points, and so on. Most of the object description and recognition methods are for the 2D space not for the 3D object space where the objects actually exist. In this study, 3D chain code operator, which is basically extension of 2D chain code, was proposed for object description and analysis in 3D space. Results show that the sequence of the 3D chain codes could be basis of a top-down approach for object recognition and modeling. In addition, the proposed method could be applicable to segment point cloud data such as LiDAR data.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.29-44
• /
• 2021

The set D of column vectors of a generator matrix of a linear code is called a defining set of the linear code. In this paper we consider the problem of constructing few-weight (mainly two- or three-weight) linear codes from defining sets. It can be easily seen that we obtain an one-weight code when we take a defining set to be the nonzero codewords of a linear code. Therefore we have to choose a defining set from a non-linear code to obtain two- or three-weight codes, and we face the problem that the constructed code contains many weights. To overcome this difficulty, we employ the linear codes of the following form: Let D be a subset of ��2n, and W (resp. V ) be a subspace of ��2 (resp. ��2n). We define the linear code ��D(W; V ) with defining set D and restricted to W, V by $${\mathcal{C}}_D(W;V )=\{(s+u{\cdot}x)_{x{\in}D^{\ast}}|s{\in}W,u{\in}V\}$$. We obtain two- or three-weight codes by taking D to be a Vasil'ev code of length n = 2m - 1(m ≥ 3) and a suitable choices of W. We do the same job for D being the complement of a Vasil'ev code. The constructed few-weight codes share some nice properties. Some of them are optimal in the sense that they attain either the Griesmer bound or the Grey-Rankin bound. Most of them are minimal codes which, in turn, have an application in secret sharing schemes. Finally we obtain an infinite family of minimal codes for which the sufficient condition of Ashikhmin and Barg does not hold.