• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2004.11a
• /
• pp.218-221
• /
• 2004

The electronic state of ZnO doped with Al, Ga and In, which belong to III family elements in periodic table, was calculated using the density functional theory. In this study, the program used for the calculation on theoretical structures of ZnO and doped ZnO was Vienna Ab-initio Simulation Package (VASP), which is a sort of pseudo potential method. The detail of electronic structure was obtained by the describe variational $X{\alpha}(DV-X{\alpha})$(DV-Xa) method, which is a sort of molecular orbital full potential method. The optimized crystal structures obtained by calculations were compared to the measured structure. The density of state and energy levels of dopant elements was shown and discussed in association with properties.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.363-366
• /
• 2001

Many joint parts by welding are found in the compression vessels, ship structures, pipings, heat exchangers, etc. Before their welding, steel plate cutting in a required form is very important. But because of the present CAD system's capability, unless otherwise expensive general CAD system is equipped, the efficiency or the accuracy of the cutting work can not be achieved easily. In order to get over this sort of problems, application-specific software that is limited on for the development view of the joint parts in those sort of facilities mentioned before was developed in this study.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06c
• /
• pp.127-131
• /
• 2008

관계형 DBMS의 보급이 확대되면서 대형 운영시스템 구축 시에 인덱스를 사용하는 관계형 DB의 사용이 증가하고 있다. 이에 따라 Sort의 용도가 대폭 축소되고 DB에서 직접 대형 결산작업이 주로 처리되게 되었다. 그러나 대형 결산 작업 처리시 사용되는 대용량의 데이터의 경우 ETL(Extract Transformation Loading) 작업 시에는 오히려 파일 시스템을 사용하는 경우보다 성능이 저하되는 문제가 발생하기 시작했다. 본 논문에서는 ETL 작업 시 DBMS에 존재하는 대용량 데이터 처리하는 경우에 파일 시스템 상에서 flat 파일을 이용하여 처리 속도를 향상 시키고, 이와 동시에 리소스부하 문제를 해결할 수 있는 방안을 제시했다. 보다 세부적으로 DBMS에서 사용되는 sort, Join, Merge, Summary, 각종 사용자 함수 등의 다양한 기능들을 flat 파일에 적용하는 방법을 제시하였다. 또한 실험을 통해 ETL 작업 시 제안하는 기법이 처리 속도 개선과 리소스 활용성을 향상 시킴을 증명하였다.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.161-163
• /
• 2001

This paper presents a Case-Sort method to solve the unit commitment problem using database in electric power systems. The formulation of the unit commitment may be described as nonlinear mixed integer programming. However, it is hard to optimize a problem with discrete and continuous variables in a large-scale system at the same time. The Case-Sort method is based on the unit [MW] generation cost considered drive hour. Then, this paper shows effectiveness and economical efficiency of the proposed algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.979-981
• /
• 2004

여러 과학 및 공학 응용 프로그램에서 다루는 그래프 데이터는 종종 그 크기가 너무 커서 컴퓨터의 주 메모리에 다 들어 갈 수 없는 경우가 많다. 이러한 방대한 크기의 자료를 처리하면서 입출력의 빈도가 자연적으로 커지게 되고 전체 계산에서 주요한 병목 요인으로 작용한다. 본 논문은 solid grid 그래프를 위한 입출력 복잡도 (I/O-complexity)가 O(sort(N))인 depth-first search (DFS) 알고리즘을 제안한다. 여기서, N=｜V｜+｜E｜이고 Sort(N)=Θ((N/B)logM/B(N/B)) 이다. 이 전까지 알려진 가장 좋은 알고리즘은 적절한 Sub-grid 입출력을 바탕으로 한 전통적 DFS 알고리즘으로 그 입출력 복잡도는 O((N/B)$B^{1}$2/) 이다.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.4
• /
• pp.274-282
• /
• 1998

A feature is a local shape of a product directly related to the manufacturing process. The feature plays a role of the bridge connecting CAD and CAM. In the process planning for he CAM, information on manufacturing is required. To get the a manufacturing information from CAD dat, we need to recognize features. Once features are recognized, they are used as an input for the process planning. In this paper, we thoroughly investigate the composite features, which are generated by interacting simple features. The simple features in the composite feature usually have precedence relation in terms of process sequence. Based on the reason for the precedence relation, we classify the composite features for the process planning. In addition to the precedence relation, approach direction is used as an input for the process planning. In the process planning, the number of set-up orientations are minimized whole process sequence for the features are generated. We propose a process planning algorithm based on the topological sort and breadth-first search of graphs. The algorithn is verified using sample products.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.8 no.12
• /
• pp.79-87
• /
• 1985

Environmental approach places the focus on a cause-and-effect relationship between the external environments and the internal business conditions. But that approach is an attempt to describe the characteristics of environmental constraints. W.J. Abernathy, K.B. Clark, and A.M. Kantrow attribute the Japanese carmaker's success to superiority in the manufacturing plant, especially in their process systems and work force management. They provide a paradigm for discussions of manufacturing competitiveness comparison. The structure of the paradigm has two main distinctions. The first is the division between analysis and prescription of a macro sort and those of a micro sort, the second is the division between analysis and prescription based on hardware and those based on software.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.285-286
• /
• 2020

전 세계적으로 유행하는 COVID-19(코로나19)로 인해 사람들은 대면 접촉을 피하게 되었고, 전염성이 높은 이유로 마스크의 착용이 의무화되고 있고, 이를 검사하는 업무가 증가하고 있다. 그래서, 인공지능 기술을 통해 업무를 도와줄 수 있는 출입자 통계와 출입자 마스크 착용 검사를 할 수 있는 시스템이 필요하다. 이를 위해 본 논문에서는 딥러닝 알고리즘을 활용한 출입자 통계와 마스크 착용 판별 시스템을 제시한다. 또한, 실시간 영상인식에 많이 활용되고 있는 YOLO-v3와 YOLO-v4, YOLO-Tiny 알고리즘을 데스크탑 PC와 Nvidia사의 Jetson Nano에 적용하여 알고리즘별 성능 비교를 통해 적합한 방법을 찾고 적용하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.992-1001
• /
• 1996

Radix sort scans the data twice in a pass, to search bit 0s of the items being sorted and store them into the lowest address, and to search bit 1s and st ore them into the following addresses. This doubles the sorting time. In this paper, we introduce Reverse Radix Sort Algorithm, in which the data being sorted are sacnned just once and write upward from the lowest address if it is 0 and downward from the highest address if it is 1. The algorithm is simple and the hardware sorter implemented by this method shows very high sorting sped. Hardware implementation requires two separate pocket memories, register, an upward increasing address counter, a downward decreasing address counter, and comparator. The software simulation of Reverse Radix Sor Algorithm performs sorting in the speed of 54.9ms per 10 thousand of 8 bit digit data, but the hardware sorter spends 5.3ms to sort the same number of data.

• Journal of Bio-Environment Control
• /
• v.15 no.4
• /
• pp.358-363
• /
• 2006

Results on growth and fruit elongation and quality by rootstock sort of oriental melon were followed; Growth of upper part of oriental melon was faster grafted seedlings than self-root seedlings and among grafted seedlings, Elite and Shintozoa rootstocks were better than Hongtozoa. Growth of Elite and Shintozoa rootstocks, stem length and leaf number, were laster after 30 days of seedling transplant. Fruit elongation had no difference in rootstocks sort. Fruit weight was higher Elite and Shintozoa grafted seedlings than self-root seedlings but soluble solid contents of fruit was higher self root seedlings, $13.9^{\circ}Brix$, than Elite grafted seedlings, $12.5^{\circ}Brix$.