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

전산유체역학(CFD: Computational Fluid Dynamics)를 이용한 스마트팜 환경 내부의 정밀 제어 연구가 진행 중이다. 시계열 데이터의 난해한 동적 해석을 극복하기위해, 비선형 모델링 기법의 일종인 인공신경망을 이용하는 방안을 고려하였다. 선행 연구를 통하여 환경 데이터의 비선형 모델링을 위한 Tensorflow활용 방법이 하드웨어 가속 기능을 바탕으로 월등한 성능을 보임을 확인하였다. 그럼에도 오프라인 일괄(Offline batch)처리 방식의 한계가 있는 인공신경망 모델링 기법과 현장 보급이 불가능한 고성능 하드웨어 연산 장치에 대한 대안 마련이 필요하다고 판단되었다. CFD 해석을 위한 Solver로 SU2(http://su2.stanford.edu)를 이용하였다. 운영 체제 및 컴파일러는 1) Mac OS X Sierra 10.12.2 Apple LLVM version 8.0.0 (clang-800.0.38), 2) Windows 10 x64: Intel C++ Compiler version 16.0, update 2, 3) Linux (Ubuntu 16.04 x64): g++ 5.4.0, 4) Clustered Linux (Ubuntu 16.04 x32): MPICC 3.3.a2를 선정하였다. 4번째 개발환경인 병렬 시스템의 경우 하드웨어 가속는 OpenCL(https://www.khronos.org/opencl/) 엔진을 이용하고 저전력 ARM 프로세서의 일종인 옥타코어 Samsung Exynos5422 칩을 장착한 ODROID-XU4(Hardkernel, AnYang, Korea) SBC(Single Board Computer)를 32식 병렬 구성하였다. 분산 컴퓨팅을 위한 환경은 Gbit 로컬 네트워크 기반 NFS(Network File System)과 MPICH(http://www.mpich.org/)로 구성하였다. 공간 분해능을 계측 주기보다 작게 분할할 경우 발생하는 미지의 바운더리 정보를 정의하기 위하여 3차원 Kriging Spatial Interpolation Method를 실험적으로 적용하였다. 한편 병렬 시스템 구성이 불가능한 1,2,3번 환경의 경우 내부적으로 이미 존재하는 멀티코어를 활용하고자 OpenMP(http://www.openmp.org/) 라이브러리를 활용하였다. 64비트 병렬 8코어로 동작하는 1,2,3번 운영환경의 경우 32비트 병렬 128코어로 동작하는 환경에 비하여 근소하게 2배 내외로 연산 속도가 빨랐다. 실시간 CFD 수행을 위한 분산 컴퓨팅 기술이 프로세서의 속도 및 운영체제의 정보 분배 능력에 따라 결정된다고 판단할 수 있었다. 이를 검증하기 위하여 4번 개발환경에서 운영체제를 64비트로 개선하여 5번째 환경을 구성하여 검증하였다. 상반되는 결과로 64비트 72코어로 동작하는 분산 컴퓨팅 환경에서 단일 프로세서 기반 멀티 코어(1,2,3번) 환경보다 보다 2.5배 내외 연산속도 향상이 있었다. ARM 프로세서용 64비트 운영체제의 완성도가 낮은 시점에서 추후 성공적인 실시간 CFD 모델링을 위한 지속적인 검토가 필요하다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.12
• /
• pp.8187-8194
• /
• 2015

To accelerate a heavy roller coaster train with over 1G force, a lot of thrust is required and linear synchronous motor(LSM) as propulsion method is suitable for this kind of system. To increase the propulsion efficiency of LSM, precise and real-time position information of vehicle is required for accurate phase control. However, the discontinuous position information with relatively long time interval is usually transmitted from the hall-sensors on the track every magnet length. In this paper, the basic motor model based on traditional dq-axis equations is described and the motor dynamic model is produced by considering the cogging force and friction loss. To improve the position accuracy, the position estimator is also proposed for LSM control system. Simulations were performed to check the characteristics of the torque control system which includes the position estimator based on the motor model. Simulation results based on the linearized model show that this control system has an enough bandwidth and phase margin and the executed algorithm achieves an ideal effect to follow the real-time position signal. Therefore, the feasibility of position estimator is also confirmed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.529-538
• /
• 2007

Fair Queueing algorithms based on Generalized Processor Sharing (GPS) not only guarantee sessions with service rate and delay, but also provide sessions with instantaneous fair sharing. This fair sharing distributes server capacity to currently backlogged sessions in proportion to their weights without regard to the amount of service that the sessions received in the past. From a long-term perspective, the instantaneous fair sharing leads to a different quality of service in terms of delay and bandwidth to sessions with the same weight depending on their traffic pattern. To minimize such long-term unfairness, we propose a delay-bandwidth normalization model that defines the concept of value of service (VoS) from the aspect of both delay and bandwidth. A model and a packet-by-packet scheduling algorithm are proposed to realize the VoS concept. Performance comparisons between the proposed algorithm and algorithms based on fair queueing and service curve show that the proposed algorithm provides better long-term fairness among sessions and that is more adaptive to dynamic traffic characteristics without compromising its service rate and delay guarantees.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.2
• /
• pp.75-84
• /
• 2005

This research is to design a high performance NAND-type flash memory package with a smart buffer cache that enhances the exploitation of spatial and temporal locality. The proposed buffer structure in a NAND flash memory package, called as a smart buffer cache, consists of three parts, i.e., a fully-associative victim buffer with a small block size, a fully-associative spatial buffer with a large block size, and a dynamic fetching unit. This new NAND-type flash memory package can achieve dramatically high performance and low power consumption comparing with any conventional NAND-type flash memory. Our results show that the NAND flash memory package with a smart buffer cache can reduce the miss ratio by around 70% and the average memory access time by around 67%, over the conventional NAND flash memory configuration. Also, the average miss ratio and average memory access time of the package module with smart buffer for a given buffer space (e.g., 3KB) can achieve better performance than package modules with a conventional direct-mapped buffer with eight times(e.g., 32KB) as much space and a fully-associative configuration with twice as much space(e.g., 8KB)

• International Commerce and Information Review
• /
• v.14 no.3
• /
• pp.113-138
• /
• 2012

This study examined the determinants of export performance of small and medium sized manufacturing companies in Korea. Depending on the existing research, taking entrepreneurship and product differentiation capabilities as antecedents of export performance. In addition, the product differentiation capabilities examined whether the role of the mediating effects between entrepreneurship and export performance. Thus, the purpose of the study is look at the integrated model of entrepreneurship, product differentiation capabilities and export performance building and their relationship. On 152 domestic companies, empirical analysis was performed. Empirical analysis was conducted using the PLS(Partial Least Square). And analysis tools were used SmartPLS2.0. In the results of the analysis, risk tolerance and innovativeness of small and medium sized manufacturing businesses, entrepreneurs and product differentiation competence have positive impact export performance in both. Product differentiation capabilities also confirmed that it have a positive impact on the export performance of small manufacturing export enterprises. In analysis of the mediated effect in product differentiation capacity showed a significant mediated effect between innovativeness and export performance. But mediated effects did not indicate a significant risk tolerance. these results suggests the need to actively pursue innovation that more product differentiation capabilities required in export companies to small and medium-sized manufacturing. In other words, when attempting to highlight product differentiation, based on innovation, rather than risk tolerance. In terms of analyzing the mediated role of product differentiation capabilities, this study has theoretical implications for the future research to look at the antecedents of export performance from the perspective of dynamic capabilities and competitive advantage. Also, practical implications in this regard as the innovativeness and taking risks to all important to CEO of small manufacturing enterprises but, stranger in the foreign market competition environment, the role of innovation product is required on raising product differentiation capabilities are presented.

• Journal of Intelligence and Information Systems
• /
• v.8 no.1
• /
• pp.119-139
• /
• 2002

In electronic catalogs, each item is represented as an independent unit while the parts of the item can be composed of a higher level of functionality. Thus, the search for this kind of product database is limited to the retrieval of most similar standard commodities. However, many industrial products need to configure optional parts to fulfill the required specifications. Since there are many paths in finding the required specifications, we need to develop a search system via the configuration process. In this system, we adopt a two-phased approach. The first phase finds the most similar template, and the second phase adjusts the template specifications toward the required set of specifications by the Constraint and Rule Satisfaction Problem approach. There is no guarantee that the most similar template can find the most desirable configuration. The search system needs backtracking capability, so the search can stop at a satisfied local optimal satisfaction. This framework is applied to the configuration of computers and peripherals. Template-based reasoning is basically the same as case-based reasoning. The required set of specifications is represented by a list of criteria, and matched with the product specifications to find the closest ones. To measure the distance, we develop a thesaurus of values, which can identify the meaning of numbers, symbols, and words. With this configuration, the performance of the search by configuration algorithm is evaluated in terms of feasibility and admissibility.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.121-129
• /
• 1999

When continuous media are transmitted over the communication networks, asynchrony which can not maintain temporal relationships among packets may occur due to a random transit delay. There exist two types of synchronization schemes ; for guaranteed or non-guaranteed resource networks. The former which applies a resource reservation technique maintains delay characteristics, however, the latter supply a best-effort service. In this paper, I propose a intra-media synchronization scheme to transmit continuous media on general networks not guaranteeing a bounded delay tome. The scheme controls transmission times of the packets by estimating next delay time with the delay distribution. So, the arriving packets may be maintained within a limited delay boundary, and playout will be performed after buffering to smoothen small delay variations. The continually increasing delay due to network overload causes buffer underflow at the receiver. To solve it, the transmitter is required to speed up instantaneously. Too much increase of transmission-rate may cause network congestion. At that time, the transmitter drops the current packet when informed excessive delay from the receiver.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.7
• /
• pp.993-1000
• /
• 2002

In this paper, we design the CORBA-based Mobile Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(below node) routing schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent m()del that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separates the existing mobile agent object by mobile agent including only agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it reduces the required time for round works of mobile agent through the optimal path search of migration nodes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.4
• /
• pp.795-804
• /
• 1999

The increasing number of users of mobile communication systems and the corresponding need for increased system capacity require the use of a modulation scheme which is both power and spectrally efficient. In this paper, we numerically calculate the BER performance of DS/CDMA-BPSK system in different fading channel (Rayleigh, Rician, Shadow Rician). Also, we calculate BER performance and the channel capacity of DS/CDMA-BPSK system which is constant or nearly constant envelopes in 3-state fading channel model. The Shadow Rician fading model described in this paper apply the parameters of the Canadian Mobile Satellite (MSAT). And we assume that the 3-state fading channel model is consist of Rayleigh fading state, Rician fading state, and shadow Rician fading state. This model can be used as a basis for the simulation of the land mobile satellite channel. The dynamic 3-state fading channel model is considered corresponding to different environments and the transitions between these environments. From the numerically calculate results, the DS/CDMA-BPSK system with MUI-20, PG-511 can not achieve the BER performance ($P_b\leq10^{-5}$). And the channel capacity did not meet the system requirement. Also, we know that the BER performance is depend m the occupancy probability of radio channel and the degree of shadow. From the results, we how that during shadowed time intervals it is necessary to use some form of error control coding and receiver diversity in order to support reliable data communication.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.347-360
• /
• 2001

The most expensive spatial operation in spatial databases is a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisfying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved, the response time is not tolerable because of not meeting the requirements of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. However, as the number of processors increases, the efficiency of each processor decreases rapidly because of the disk bottleneck and the overhead of message passing. This paper proposes the method of task allocation to soften the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing among processors. In order to evaluate the performance of the proposed method in terms of the number of disk accesses and message passing, we conduct experiments on the two kinds of parallel spatial join algorithms. The experimental tests on the MIMD parallel machine with shared disks show that the proposed semi-dynamic task allocation method outperforms the static and dynamic task allocation methods.