• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2017.04a
• /
• pp.15-15
• /
• 2017

본 연구는 필드 작업 시 작업조건에 따른 정식기의 PTO 부하를 측정하고, 이를 이용하여 작업조건에 따른 안전율 시뮬레이션을 목적으로 수행하였다. 부하 계측 시스템은 PTO 축의 부하를 측정하기 위한 토크 센서, 토크 센서에서 발생한 신호를 수집하기 위한 데이터 수집장치, 노트북에 전원을 공급하기 위한 파워 컨트롤러로 구성하였다. 토크센서에서 입력된 부하 데이터를 처리하기 위한 소프트웨어는 Labview(Version 2011, National Instrument, USA)를 사용하였다. 포장시험은 유사한 토양 조건에서 4회 반복 시험을 수행하였으며, 작업속도 고속 조건에서 4개의 주간거리(26, 35, 43, 80cm)와 3개의 식부깊이 (85, 105, 136mm)에 대하여 수행하였다. 안전율 시뮬레이션을 위한 소프트웨어는 KISSsoft(Version 2016, Kissling & Co. AG, Switzerland)를 사용하였다. 식부깊이 85mm에서 주간거리 26, 35, 43, 80cm일 때 작업시 각각 굽힘 안전율은 2.2874, 2.4507, 2.7139, 2.8064로 나타났으며 접촉 안전율은 1.1787, 1.2799, 1.3205, 1.3275로 나타났다. 식부깊이 105mm에서 주간거리 26, 35, 43, 80cm일 때 작업 시 각각 굽힘 안전율은 2.1261, 2.2781, 2.4879, 2.5866로 나타났으며 접촉 안전율은 1.1296, 1.1425, 1.2710, 1.2507로 나타났다. 식부깊이 136mm에서 주간거리 26, 35, 43, 80cm일 때 작업 시 각각 굽힘 안전율은 1.6587, 1.6651, 1.7824, 2.2198로 나타났으며 접촉 안전율은 1.0030, 1.0104, 1.0450, 1.1931로 나타났다. 주간거리에 따른 식부깊이의 굽힘 안전율과 접촉 안전율은 가장 차이가 큰 주간거리 80cm에서 식부깊이가 85, 105, 136mm일 때 작업 시 각각 굽힘 안전율은 2.8064, 2.5866, 2.2198로 나타났으며 접촉 안전율은 1.3275, 1.2507, 1.1931로 나타났다. 시뮬레이션 결과 정식기 베벨기어의 안전율은 주간거리가 짧을수록, 식부깊이가 깊을수록 더 낮게 나타났다. 그러므로 정식 작업 시 정식기의 부하와 내구성을 고려하여 적절한 작업조건을 선정해야 함을 알 수 있다. 또한 향후 다양한 토양 조건 및 작업 단수 등에 따른 포장시험을 추가로 진행하여 여러 조건에서의 안전율 시뮬레이션을 수행할 예정이다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.1
• /
• pp.169-177
• /
• 2020

In South Korea, the results of R&D in science and technology are submitted to the National Science and Technology Information Service (NTIS) in reports that have Korea national science and technology standard classification codes (K-NSCC). However, considering there are more than 2000 sub-categories, it is non-trivial to choose correct classification codes without a clear understanding of the K-NSCC. In addition, there are few cases of automatic document classification research based on the K-NSCC, and there are no training data in the public domain. To the best of our knowledge, this study is the first attempt to build a highly performing K-NSCC classification system based on NTIS report meta-information from the last five years (2013-2017). To this end, about 210 mid-level categories were selected, and we conducted preprocessing considering the characteristics of research report metadata. More specifically, we propose a convolutional neural network (CNN) technique using only task names and keywords, which are the most influential fields. The proposed model is compared with several machine learning methods (e.g., the linear support vector classifier, CNN, gated recurrent unit, etc.) that show good performance in text classification, and that have a performance advantage of 1% to 7% based on a top-three F1 score.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.1
• /
• pp.96-106
• /
• 2002

this paper, we propose a flexible, reusable, and extensible HL7 encoding and decoding framework using a Message Object Model (MOM) and Message Definition Repository (MDR). The MOM provides an abstract HL7 message form represented by a group of objects and their relationships. It reflects logical relationships among the standard HL7 message elements such as segments, fields, and components, while enforcing the key structural constraints imposed by the standard. Since the MOM completely eliminates the dependency of the HL7 encoder and decoder on platform-specific data formats, it makes it possible to build the encoder and decoder as reusable standalone software components, enabling the interconnection of arbitrary heterogeneous hospital information systems(HISs) with little effort. Moreover, the MDR, an external database of key definitions for HL7 messages, helps make the encoder and decoder as resilient as possible to future modifications of the standard HL7 message formats. It is also used by the encoder and decoder to perform a well formedness check for their respective inputs (i. e., HL7 message objects expressed in the MOM and encoded HL7 message strings). Although we implemented a prototype version of the encoder and decoder using JAVA, they can be easily packaged and delivered as standalone components using the standard component frameworks like ActiveX, JAVABEAN, or CORBA component.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.12C
• /
• pp.1288-1298
• /
• 2002

To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.