• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회A
• /
• pp.1053-1056
• /
• 2008

An application of CSG (Constructive Solid Geometry) modeling technique in Machining Simulation is introduced in this paper. The current CSG model is based on z-buffer CSG Rendering Algorithm. In order to build a CSG model, frame buffers of VGA (Video Graphic Accelerator) should be used in term of color buffer, depth buffer, and stencil buffer. In addition to using CSG model in machine simulation Stock and Cutter Swept Surface (CSS) should be solid. Method to create a solid Cuboid stock and Ball-end mill CSS are included in the present paper. Boolean operations are used to produce the after-cut part, especially the Difference operation between Stock and CSS as the cutter remove materials form stock. Finally, a small program called MaSim which simulates one simple cut using this method was created.

• 한국CDE학회논문집
• /
• 제5권3호
• /
• pp.242-254
• /
• 2000

This paper describes an efficient solid modeling method for thin-walled plastic or sheet metal parts, based on the non-manifold offsetting operations. Since the previous methods for modeling and converting a sheet into a solid have adopted the boundary representations for solid object as their topological framework, it is difficult to represent the exact adjacency relationship between topological entities of a sheet model and a mixture of wireframe and sheet models that can appear in the meantime of modeling procedure, and it is hard to implement topological operations for sheet modeling and transformation of a sheet into a solid. To solve these problems, we introduce a non-manifold B-rep and propose a sheet conversion method based on a non-manifold offset algorithm. Because the non-manifold offset aigorithm based on mathematical definitions results in an offset solid with tubular and spherical thickness-faces we modify it to generate the ruled or planar thickness-faces that are mostly shown in actual plastic or sheet metal parts. In addition, in order to accelerate the Boolean operations used the offset algorithm, we also develope an efficient face-face intersection algorithm using topological adjacency information.

• 한국정보처리학회논문지
• /
• 제4권8호
• /
• pp.2163-2172
• /
• 1997

곡면간의 교차계산은 부울연산(Boolean operations)과 조각된 곡면들을 지원하기위한 기하 모델링과 솔리드에서 사용되는 기본적인 기하학 연산이다. 본 논문에서는 두 정규화된 곡면의 교차곡선을 따라 추적하기 위한 새로운 알고리즘을 제안한다. 그러므로 본 논문에서는 계산상의 간소화와 2차 연속성을 나타낸다. 따라서, 교차 곡선의 한 점이 주어지면 이 점을 초기점으로 하여 교차 곡선의 전체 곡선을 추적한다. 그리고 각각의 교선들의 초기점들은 쿼드트리에서 DFS(Depth First Search) 기법으로 검색되고 교선은 연속적인 형태로 자연스럽게 표현된다.

• 한국정밀공학회지
• /
• 제21권4호
• /
• pp.39-47
• /
• 2004

In mold machining, there are many concave machining regions where chatter and tool deflection occur since MRR(material removal rate) increases as curvature increases even though cutting speed and depth of cut are constant. Boolean operation between stock and tool model is widely used to compute MRR in NC milling simulation. In finish cutting, the side step is reduced to about 0.3mm and tool path length is sometimes over loom, so Boolean operation takes long computation time and includes much error if the resolution of stock and tool model is larger than the side step. In this paper, curvature of CL (cutter location) surface and side step of tool path is used to compute the feedrate for constant MRR machining. The data structure of CL surface is Z-map generated from NC tool path. The algorithm to get local curvature from discrete data was developed and applied to compute local curvature of CL surface. The side step of tool path was computed by point density map which includes cutter location point density at each grid element. The feedrate computed from curvature and side step is inserted to new tool path to regulate MRR. The resultants were applied to feedrate optimization system which generates new tool path with feedrate from NC codes for finish cutting. The system was applied to the machining of speaker and cellular phone mold. The finishing time was reduced to 12.6%, tool wear was reduced from 2mm to 1.1mm and chatter marks and over cut on corner were reduced, compared to the machining by constant feedrate. The machining time was shorter to 17% and surface quality and tool was also better than the conventional federate regulation using curvature of the tool path.

• 대한전자공학회논문지SP
• /
• 제47권1호
• /
• pp.159-168
• /
• 2010

전력 분석 공격의 다양한 대응법들 중 대칭키 암호의 경우, 암/복호화, 키 스케쥴링의 연산 도중 중간 값이 전력 측정에 의해 드러나지 않도록 하는 마스킹 기법이 잘 알려져 있다. 대칭키 암호는 Boolean 연산과 Arithmetic연산이 섞여 있으므로 마스킹 형태 변환이 불가피하다. Messerges에 의해서 일반적인 전력 분석 공격에 안전한 마스킹 형태 변환 알고리즘이 제안되었고 이에 대한 취약성이 보고되었다. 본 논문에서는 Messerges가 제안한 마스킹 형태 변환 알고리즘에 대한 기존 전력 분석 공격이 불가능함을 보이고 새로운 전력 분석 공격 방법을 제안한다. 마스킹 형태 변환 알고리즘에 대하여 강화된 DPA와 CPA 공격 방법을 제시한 뒤 시뮬레이션 결과로써 제안하는 공격 방법으로 실제 분석이 가능함을 확인한다.

• Nuclear Engineering and Technology
• /
• 제55권2호
• /
• pp.421-431
• /
• 2023

Nuclear power plants (NPPs) have technical specifications (Tech Specs) to ensure that the equipment and key operating parameters necessary for the safe operation of the power plant are maintained within limiting conditions for operation (LCO) determined by a safety analysis. The LCO of Tech Specs that identify the lowest functional capability of equipment required for safe operation for a facility must be complied for the safe operation of NPP. There have been previous studies to aid in compliance with LCO relevant to rule-based expert systems; however, there is an obvious limit to expert systems for implementing the rules for many situations related to LCO. Therefore, in this study, we present a retrieval methodology for similar LCO cases in determining whether LCO is met or not met. To reflect the natural language processing of NPP features, a domain dictionary was built, and the optimal term frequency-inverse document frequency variant was selected. The retrieval performance was improved by adding a Boolean retrieval model based on terms related to the LCO in addition to the vector space model. The developed domain dictionary and retrieval methodology are expected to be exceedingly useful in determining whether LCO is met.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2002년도 춘계학술대회 논문집
• /
• pp.551-554
• /
• 2002

The paper discusses new approach for machining operation simulation using enhanced Z map algorithm. To extract the required geometric information from NC code, suggested algorithm uses supersampling method to enhance the efficiency of a simulation process. By executing redundant Boolean operations in a grid cell and averaging down calculated data, presented algorithm can accurately represent material removal volume though tool swept volume is negligibly small. Supersampling method is the most common form of antialiasing and usually used with polygon mesh rendering in computer graphics. The key advantage of enhanced Z map model is that the data structure is same with conventional Z map model, though it can acquire higher accuracy and reliability with same or lower computation time. By simulating machining operation efficiently, this system can be used to improve the reliability and efficiency of NC machining process as well as the quality of the final product.

• 대한기계학회논문집
• /
• 제18권1호
• /
• pp.53-64
• /
• 1994

Rouge cutting process takes the major portion of machining operation using NC milling machine. Especially, most of the machining time is spent in this process when molds are machined. Therefore, an efficient algorithm for generating the tool path for rough cutting is suggested in this paper. The first step of the procedure is getting the volume to be machined by applying the Boolean operation on the finished model and the workpiece which have been modeling system. Basic principle of determining machining procedure is that a large tool should be used at the portion of the simple shape while a small tool should be used at the complex portion. This principle is realized by representing the volume to be machined by an octree, which is basically a set of hexahedrons, and matching the proper tools with the given octants. When the tools are matched with the octants, the tool path can be derived at the same time.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제6권4호
• /
• pp.297-306
• /
• 2006

In this paper, We presented the algorithm for estimating a reliability between nodes in wireless distributed sensor networks (DSN). To estimate the reliability between nodes, we first modeled DSN as probability graph. Links of the graph are always reliable and the probability of node failure is independent. After all possible simple path which can be established between two nodes are examined, we perform sharp operation to remove repetition event between two nodes. Using probability for each variable of the minimized Boolean equation, we present the reliability formula.

• 한국산업정보학회논문지
• /
• 제11권1호
• /
• pp.29-37
• /
• 2006

오늘날 컴퓨터 네트워크의 발전과 휴대통신의 광범위한 보급으로 연예 오락, 영상 문화콘텐츠, 전자상거래 또는 의료분야에 이르기 까지 멀티미디어 자료의 응용은 매우 중요한 위치를 차지하고 있다. 그러나 실제 이들 자료들이 발달된 통신망을 통하여 효율적으로 전파, 활용되기 위해서는 무엇보다도 이들을 저장하거나 전송하는 과정에서 충분한 안정성이 전제되어야 할 것이다. 이를 위하여 오늘날 많은 암호화 방법들이 개발되어 응용되고 있다. 그러나 대부분 원문에 대한 자료를 텍스트에 기반으로 하게 됨으로, 영상과 같이 자료의 양이 방대하고 실시간 처리하는데 제약이 존재하는 멀티미디어 자료에 직접 적용하기는 문제점이 많다. 이에 본 논문에서는 먼저 복잡성과 초기 조건에 대한 민감성 등 카오스적 특성을 지닌 Logistic 함수를 이용한 암호화 기법을 도입하고 다음으로 비트평면상에서 Boolean 행렬의 기본 연산을 이용한 대수적 암호화 알고리즘을 수행함으로써 효과적인 영상 암호화 방법을 제시하였다.