• Journal of Biosystems Engineering
• /
• v.7 no.2
• /
• pp.36-44
• /
• 1983

Farm population was rapidly decreasing due to shift of the people from farm sector to the non-farm sector caused by the economic growth of the country. Especially, a great shortage of farm labor in busy farming period in June and October is becoming a serious problem in maintaining or promoting land productivity. The peak of labor requirement in summer is caused by rice transplanting and barley harvesting. In order to reduce the restrictions imposed on farm management by the concurrence of labor requirement and the lack of labor, the experimental study for mechanization of barley harvesting has been carried out in the fields. 1. The machines for barley harvesting were knap-sack type reapers, windrow reaper (power tiller attachment), binder and combine. The order of higher efficiency of machine for barley harvesting was combine, binder, windrow reaper (WR), knapsack type reaper 1(KSTR1), and knap sack type reaper 2(KSTR2; mist and duster attachment). 2. The ratio of grain loss for the manual, binder, and combine plot was about four percent of total field yield. 3. The total yield of barley in 35 days and 40 days harvesting after heading were 514 kg and 507kg per 10 ares respectively. The yield of 35 days-plot was higher than other experimental plots. 4. The lowest yield was recorded in 30 days-plot due to the large quantity of immatured grains and having lighter 1000-grain weight. The ratio of immatured grains was 2.66 percent and 1000-grain weight was 29.4 grams. 5. The total harvesting cost of the windrow reaper was 10,178 won per 10 ares. It was the lowest value compared to other machines. The next were combine, binder, KSTR1, KSTR2, and manual in sequence. As a result, the optimum time of barley harvesting for mechanization was 35-40 days after heading. Combine, binder, and windrow reaper were recommended as the suitable machines for barley harvesting in the work efficiency. However, in total harvesting cost, the windrow reaper was the most promising machine for barley harvesting.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.1
• /
• pp.82-91
• /
• 2009

Routing (or path selection) is one of the key issues of multi-hop relay networks such as the IEEE 802.16j. Moreover, the allocation of appropriate resource such as bandwidth should not only be made in accordance with the paths selected, but the utilization of radio resource of an entire cell should also be maximized. Due to this interdependency between the problems of resource allocation and routing, it is desired these two problems are addressed simultaneously. In this paper, we propose a joint resource allocation and routing scheme for an OFDMA-based multi-hop cellular system. This scheme uses a polynomial time heuristic algorithm called Multi-Dimensional Multi-choice Knapsack Problem (MMKP) in order to find an approximate solution maximizing the total downlink throughput. In the simulation results, we show that the proposed scheme finds a sub-optimal solution which is superior to a link quality-based routing scheme, but slightly worse than the optimal solution.

• Journal of Digital Contents Society
• /
• v.17 no.4
• /
• pp.257-263
• /
• 2016

Cable drum schedule is the final step for the electrical equipment of the power plant, and is assigned cables to efficiently cable drum. In this paper, we have implemented an automated program which cables are scheduled in accordance with the capacity of the cable drum for each cable code. Proposed cable drum schedule was applied to the dynamic programming algorithm to effectively solve the optimization problem, and the implemented program is conducted so as to verify the proposed model. The experiment results show that implemented program eliminates the errors that can occur existing method, so we were able to reduce the design time of cable drum schedule. Cables for the electrical equipment of the power plant is designed to at least 2 million units or more. Thus the automation program to provide applies, it is considered that the design time of the cable drum schedule can be greatly reduced without serious error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.1
• /
• pp.61-69
• /
• 2015

Through Virtual Machine technology(VM), VMs can be packed into much fewer number of physical servers than that of VMs. Since even an idle physical server wastes more than 60% of max power consumption, it has been considered as one of energy saving technologies to minimize the number of physical servers by using the knapsack problem solution based on the computing resources. However, this paper shows that this tightly packed consolidation may not achieve the efficient energy saving. Instead, a service pattern-based VM consolidation algorithm is proposed. The proposed algorithm takes the service time of each VM into account, and consolidates VMs to physical servers in the way to minimize energy consumption. The comprehensive simulation results show that the proposed algorithm gains more than 30% power saving.

• Journal of the Korea Society for Simulation
• /
• v.26 no.3
• /
• pp.105-113
• /
• 2017

This study considers an optimal investment planning for improving survivability from an air threat in the layered air defense system. To establish an optimization model, we first represent the layered air defense system as a network model, and then, present two optimization models minimizing the failure probability of counteracting an air threat subject to budget limitation, in which one deals with whether to invest and the other enables continuous investment on the subset of nodes. Nonlinear objective functions are linearized using log function, and we suggest dynamic programming algorithm and linear programing for solving the proposed models. After designing a layered air defense system based on a virtual scenario, we solve the two optimization problems and analyze the corresponding optimal solutions. This provides necessity and an approach for an effective investment planning of the layered air defense system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.64-77
• /
• 2013

In this paper, we propose a joint bandwidth allocation and path selection scheme for IEEE 802.16j networks in uplink with cooperative relaying, and we evaluate the performance of the proposed scheme by using OPNET based simulation in hilly terrain with heavy tree density. The proposed scheme maximizes the system throughput in uplink with cooperative relaying in IEEE 802.16j networks. Then, we transform the proposed scheme into multi-dimensional multiple choice knapsack problem (MMKP) based scheme. We also propose uplink throughput maximization scheme and MMKP based scheme without cooperative relaying. We show that the system throughput of the proposed MMKP based scheme is higher than that of link quality based scheme, and cooperative relaying provides higher system throughput than the conventional case without cooperative relaying in uplink.