• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.25-31
• /
• 2009

In this paper, the implementation of a production control system based on RFID has been studied in order to obtain an exact Cost Center data such as the name of workers included a process of work and a time period to finish the process. The cost center of a worker will be correctly obtained by checking the work time using RFID tag data and by transmitting the data to a server of ERP or POP system. And also warming up time, cleaning time, power failure, and out of order sign will be checked and calculated using the data stored in RFID tags attached in workers and machine facilities. Therefore, exact Cost Center data will be obtained by the production control system with touch screens entering the data according to the situation in real time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.171-176
• /
• 2021

This paper deals with bid evaluation problem that chooses the vendors and quantity with minimum purchasing cost for bid information of setup cost and unit price. For this problem, the branch-and-bound(BB) and branch-and-cut(BC) methods are well-known. But these methods can be fail to obtain the optimal solution. This paper gets the initial feasible solution with procuring quantity assignment principle in accordance with the unit price or setup cost rank-first. Then procuring quantity moving optimization(vendor change) is execute take account of unit price or setup cost rank. As a result of experimentation, the propose algorithm is significantly lower compared to BB and BC.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.242-245
• /
• 2008

Exchange System for mobile communication operator is very important for providing continuous services to customers. However traditional solution is too expensive for choosing in the real environment. In this paper, we suggest cost-effective auto backup monitoring solution, which is robust for system failure. And this suggested solution will also can be adopted to the $4^{th}$ generation of IP core network.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.264-267
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However dynamic programming cannot be applied to certain cost function due its drawback and to produce optimal multiple sequence alignment. We proposed sub-alignment refinement algorithm to overcome the problem of dynamic programming and impelmented this algorithm as a module of our MS Windows-based sequence alignment program.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.11a
• /
• pp.280-284
• /
• 2004

In this paper, we propose a low-cost near-field measurement system using a circular cylindrical scanning formula in order to obtain the radiation pattern of an AUT (Antenna Under Test). Near-field measurement is performed with the improved circular cylindrical scanning based on a planar scanning. We propose a novel method that replaces a network analyzer and we also offer the specifications of the near-field measurement system.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.277-278
• /
• 2008

Localization system is an important problem for Wireless Sensor Networks(WSN). Since the sensor nodes are limited, the range-based that uses the special device for localization is unsuitable in WSN. DV-Hop is one of the range-free localization algorithm using hop-distance and number of hop count. But Its disadvantage is that it spend large communication cost in scalable sensor nodes. We propose a simple algorithm to reduce the communication cost, using the smallest number of hop count.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.6
• /
• pp.475-484
• /
• 1990

This paper proposes a method for the implementation of a power line communication equipment using power line synchronization in a direct-sequence spread spectrum communication system. In order to implement a network using a power line as a transmission channel we have investigated the utilization of direct-sequence speread spctrum which gives such advantages as robustness against narrow-band interference and noise, and realization of multiple access. In a power line, however, complexity of synchronization makes it difficult to realize a multiple access and cost down and system simplification. The proposed technique of power line synchronization makes it possible to get cost down and system size small, and the realization of multiple communication can be achieved by the addition of address setting circuit.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.88-97
• /
• 2017

With the increasing of the penetration rate of large-scale wind farms, a reliable, highly available and cost-effective communication network is needed. As the failure of a WF communication network will significantly impact the control and real-time monitoring of wind turbines, network reliability should be considered into the WF design process. This paper analyzes the network reliability of different WF configurations for the Southwest Offshore project that is located in Korea. The WF consists of 20 WTs with a total capacity of 60 MW. In this paper, the performance is compared according to a variety of indices such as network unavailability, mean downtime and network cost. To increase the network reliability, partial protection and full protection were investigated as strategies that can overcome the impact of a single point of failure. Furthermore, the reliability performances of different network architectures are analyzed, evaluated and compared.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1109-1112
• /
• 2020

This paper presents a low cost hardware message passing engine of enhanced atomic pipelined broadcast based on processing node status. In this algorithm, the previous atomic pipelined broadcast algorithm is modified to reduce the waiting time until next broadcast communication. For this, the processor change the transmission order of processing nodes based on the nodes' communication channel. Also, the hardware message passing engine architecture of the proposed algorithm is modified to be adopted to multi-core processor. The synthesized logic area of the proposed hardware message passing engine was reduced by about 16%, compared by the pre-existing hardware message passing engine.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.141-151
• /
• 2012

This paper suggests more simple algorithm than Hungarian algorithm for assignment problem. Hungarian algorithm selects minimum cost of row and column, and subtracts minimum cost from each cost. Then, performs until the number of minimum lines with 0 equals the number of rows. But, the proposed algorithm selects the minimum cost for each rows only. From the start point with over 2 to the target point with null selects in column, fixes the maximum opportunity cost that the difference of the cost of starting point and target point, and moves the cost less than opportunity cost th more than previous cost. For the 25 balance and 7 unbalance assignment problems, This algorithm gets the optimal solution same as Hungarian algorithm. This algorithm improves the time complexity $O(n^3)$ of Hungarian algorithm to $O(n^2)$, and do not performs the transformation process from unbalance to balance assignment in Hungarian algorithm. Therefore, this algorithm can be alter Hungarian algorithm in assignment problem.