• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.606-608
• /
• 1999

본 논문에서는 이동 로봇의 유연하고 짧은 경로 계획을 위하여 기존의 그리드 셀(grid cell)로 구성되는 지도 대신에 삼각형을 이용하여 지도를 구성하는 새로운 방법을 제안한다. 기존의 그리드 셀로 구성되는 지도의 경우 이동 로봇가 현재 셀에서 다음 셀로 진행시 진행 방향이 8 방향이나, 본 논문에서 제안한 방법에 의해 구성된 새로운 지도는 셀을 삼각형으로 표현함으로써, 이동 로봇의 진행 방향이 12 방향이 된다. 이와 같이 이동 로봇의 진행 방향이 증가한다는 것은 이동 로봇이 더욱 유연하게 장애물을 회피하며 더욱 짧은 경로로 주행할 수 있는 가능성을 의미한다. 한편, 본 논문에서 제안한 삼각형 지도 작성 방법의 효율성을 기존의 그리드 셀을 이용한 경로 계획 알고리즘인 거리 변환(path transform) 경로 계획을 통하여 증명한다. 또한 새로운 삼각형 지도 구성이 메모리의 효율성 위해 이동 로봇의 주행 환경을 장애물이 비어있는 공간을 가능한 하나의 셀로 병합하는 4진트리 방법(quadtree method)에도 적용 가능함을 보인다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.07a
• /
• pp.227-229
• /
• 2014

플래시 메모리는 빠른 처리 속도, 비휘발성, 저 전력, 강한 내구성 등으로 인해 최근 스마트폰, 태블릿, 노트북, 컴퓨터와 같은 여러 분야에서 많이 사용하고 있다. 최근 기존에 사용하던 NAND 플래시가 미세화 기술의 한계에 봉착함에 따라 기존 2차원 구조의 NAND플래시를 대처할 장치로 3차원 수직구조 NAND 플래시 메모리(3D Vertical NAND)가 주목받고 있다. 기존의 플래시 메모리는 데이터를 효율적으로 삽입/삭제/검색하기 위해 B-tree와 같은 색인기법을 필요로 한다. 플래시 메모리 상에서 B-tree 구현에 관한 기존 연구로서는 BFTL(B-Tree Flash Translation Layer)기법이 최초로 제안되었다. 현재 3차원 V-NAND 구조의 플래시 메모리가 시작품으로 제작되어 머지않아 양산 될 예정이다. 본 논문에서는 향후 출시될 3차원 구조의 플래시 메모리에 적합한 Octree 기반의 파일시스템을 제안한다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.1
• /
• pp.1-10
• /
• 1992

This study presents a complete octree construction algorithm for 2D depth images obtained from orthogonal face views, which can represent 3D objects exactly. In constructing quadtree, optimal quadtree construction algorithm is applied to depth images for efficient use of memory and reduction of tree construction time. In addition, pseudo-octrees are constructed by using our proposed method, which construct pseudo-octrees according to the resolution value given in each node of constructed quadtree and mapping relation between quadrants and octants. Finally, a complete octree, which represents a 3D object, is constructed by volume intersection with each constructed pseudo-octree. The representation accuracy of a complete octree constructed by our algorithm is investigated by using a 3D display method and a volume ratio method for a complete octree.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.11
• /
• pp.1-10
• /
• 1998

The advent of deep submicron technologies in the age of portable electronic systems creates a moving target for CAB algorithms, which now need to reduce power as well as delay and area in the existing design methodology. This paper presents a resynthesis algorithm for logic decomposition on mapped circuits. The existing algorithm uses a Huffman encoding, but does not consider glitches and effects on logic depth. The proposed algorithm is to generalize the Huffman encoding algorithm to minimize the switching activity of non-critical subcircuits and to preserve a given logic depth. We show how to obtain a transition-optimum binary tree decomposition for AND tree with zero gate delay. The algorithm is tested using SIS (logic synthesizer) and Level-Map (LUT-based FPGA lower power technology mapper) and shows 58%, 8% reductions on power consumptions, respectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.8
• /
• pp.1055-1060
• /
• 2018

In the wake of the 4th Industrial Revolution, the problem of career education in schools has become a big issue. While various studies are being conducted on services or technologies to effectively handle artificial intelligence and big data, in the field of education, data on students is simply processed. Therefore, in this paper, we are going to design and present career prediction programs for students using artificial intelligence and big data. Using observational data from students at the institute, the decision tree is constructed with the C4.5 algorithm known to be most intelligent and effective in the decision tree and is used to predict students' path of hope. As a result, the coefficient of kappa exceeded 0.7 and showed a fairly low average error of 0.1 degrees. As shown in this study, a number of studies and data will be deployed to help guide students in their consultation and to provide them with classroom attitudes and directions.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.8
• /
• pp.922-931
• /
• 1992

This paper presents an efficient algorithm for converting the boundary representation of a polyhedron to its corresponding octree representation which is convenient for detecting intersection between objects. In order to determine the states of octants efficiently and quickly, our algorithm consists of three basic processes which use the bounding box, the infinite plane and the projection. In our conversion algorithm, the states of octants are determined by performing one of these three processes according to the intersecting pattern of an octant with a polyhedron, instead of by performing only a face-to-face intersection test repeatedly. In particular, states of 8 suboctants are determined completely by performing the process using only the infinite plane, when the given octant is intersected with only a patch of the polyhedron. Finally, by using a 3D display method and a volume ratio method, it is confirmed that the octree converted by out algorithm is accurate. It is also confirmed that the conversion time is reduced in our algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.292-298
• /
• 2002

We focus on the slicing off some sub-nets using the transitive matrix. Control flows in the Petri nets is done based on the token flows. One control f]ow explains the independent tokens status and if the token-in divides into several tokens after firing a transition then the control flow divides to several flows, as well. Accordingly, we define that the basic unit of concur-rency (short BUC) is a set of the executed control flows based on the behavioral properties in the net. The BUC is S-invariant which has one control flow. We show the usefulness of transitive matrix to slice off some subnets from the original net based on BUC-through on an example.

• Journal of the Korean Chemical Society
• /
• v.29 no.5
• /
• pp.516-521
• /
• 1985

Ethylenediamine-triacetatocobalt (III) complexes with an ammine, an ethylene-diamine, and a trimethylenediamine as the unidentate ligand were prepared, and were isolated as only one isomer for each case by the Dowex 50W-X8, cation exchange resin in $H^+$ form. The geometrical isomer of these complexes have been assigned cis-equatorial form in the three possible geometrical isomers from the elemental analysis, pH titration, IR, NMR, and electronic absorption spectrum. It was found that $[CoN_3O_3]$ system of the meridional form with multidentate ligand have the first absorption band of the largely splitting pattern, and that the diamines (ethylenediamine, trimethylenediamine) have coordinated to the central cobalt (III) ion as a unidentate ligand.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.6
• /
• pp.1047-1054
• /
• 2004

One of the fundamental problems in computer science is how to store information so that it can be searched and retrieved efficiently. Hashing is a technique which solves this problem. In this paper, we propose a tree construction algorithm using linear two-predecessor single attractor cellular automata C and its complemented cellular automata. Also by using the concept of MRT we give a perfect hasing algorithm based on C.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.3
• /
• pp.360-365
• /
• 1999

TMN에 기초한 망 관리 시스템은 관리자/관리대행자 패러다임으로 역할이 분류되며 관리자는 관리대행자를 통해 관리 객체의 집합체인 관리정보베이스(MIB)에 접근할수 있다. CMIP 질의는 관리 정보 트리 상에서 관리 행위가 이루어질 관리객체를 선별하기 위하여 Scope 와 Filter를 이용한다. 본 논문에서는 관계형 데이터베이스를 이용하여 관리 정보베이스를 구축시 이러한 질의를 한번의 데이터 베이스 스캔으로 처리할 수 있도록 관리 객체의 " Distinguished Name"을 이용하여 MIT를 형성하고 SQL의 LIKE 연산자를 이용하여 Scope를 만족하는 노드를 찾는 방안을 제시한다. 이러한 방법은 부모자식 관계를 이용하여MIT를 표현하고자 결합 연산에 의해 Scope를 처리하는 일반적인 방법에비하여 성능이 우수함을 보였다. 관리자와 관리 대행자간의 교신을 위하여 IODE 8.0 CMIP프로토콜 스택을 이용하였고 ASN.1인코딩을 위하여 Pepsy컴파일러를 사용하였다.일러를 사용하였다.