• Journal of Biosystems Engineering
• /
• v.22 no.3
• /
• pp.269-278
• /
• 1997

An automatic level measurement system was developed to level the land fer direct seeding of rice. A laser transmitter/receiver set was used to measure land-level. The inclination error occurred in level measurement on irregular land surface could be compensated by attaching rotating mass. The level measuring experiments were performed on three kinds of different shapes(step, random, sine). This system could accurately measure step level of which amplitude was 40mm in 0.5s, random level change within $\pm$ 5mm maximum measurement error, and sine level change of which spatial frequency was 0.5m-1. To verify performance of the inclination error compensation system, frequency transfer function(acceleration input vs. inclination error) was computed by spectral analysis. The inclination error was decreased about 20㏈ by error compensation system.

• IE interfaces
• /
• v.7 no.2
• /
• pp.75-85
• /
• 1994

This paper presents a production scheduling model in a block assembly shop in shipbuilding industry. In a block assembly shop, the most important performance criterion is load leveling, which balances manpower and work area utilization through the planning horizon. The problem is formulated as a mixed-integer nonlinear programming(MINLP) problem of which objective function is to optimize load leveling. The developed MINLP problem can not be solvable due to computational complexity. The MINLP problem is decomposed into two stage mixed-integer linear programming (MILP) problems to obtain a good solution, but the decomposed MILP problems are still computationally intractable because of combinatorial complexity. Therfore, a heuristic method using linear programming is proposed to solve two stage MILP problems sequentially. The proposed heuristic generates a good production schedule within a reasonable computation time, and it is easily applicable for establishing the production schedule in a block assembly shop in shipbuilding industry.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.12 no.3
• /
• pp.121-130
• /
• 2017

NAND flash memory has advantages of non-volatility, little power consumption and fast access time. However, it suffers from inability that does not provide to update-in-place and the erase cycle is limited. Moreover, the unit of read/write operation is a page and the unit of erase operation is a block. Therefore, erase operation is slower than other operations. The AGC, the proposed garbage collection policy focuses on not only garbage collection time reduction for real-time guarantee but also wear-leveling for a flash memory lifetime. In order to achieve above goals, we define three garbage collection operating modes: Fast Mode, Smart Mode, and Wear-leveling Mode. The proposed policy decides the garbage collection mode depending on system CPU usage rate. Fast Mode selects the dirtiest block as victim block to minimize the erase operation time. However, Smart Mode selects the victim block by reflecting the invalid page number and block erase count to minimizing the erase operation time and deviation of block erase count. Wear-leveling Mode operates similar to Smart Mode and it makes groups and relocates the pages which has the similar update time. We implemented the proposed policy and measured the performance compare with the existing policies. Simulation results show that the proposed policy performs better than Cost-benefit policy with the 55% reduction in the operation time. Also, it performs better than Greedy policy with the 87% reduction in the deviation of erase count. Most of all, the proposed policy works adaptively according to the CPU usage rate, and guarantees the real-time performance of the system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.2
• /
• pp.79-86
• /
• 2020

To make a satisfactory decision regarding project scheduling, a trade-off between the resource-related cost and project duration must be considered. A beneficial method for decision makers is to provide a number of alternative schedules of diverse project duration with minimum resource cost. In view of optimization, the alternative schedules are Pareto sets under multi-objective of project duration and resource cost. Assuming that resource cost is closely related to resource leveling, a heuristic algorithm for resource capacity reduction (HRCR) is developed in this study in order to generate the Pareto sets efficiently. The heuristic is based on the fact that resource leveling can be improved by systematically reducing the resource capacity. Once the reduced resource capacity is given, a schedule with minimum project duration can be obtained by solving a resource-constrained project scheduling problem. In HRCR, VNS (Variable Neighborhood Search) is implemented to solve the resource-constrained project scheduling problem. Extensive experiments to evaluate the HRCR performance are accomplished with standard benchmarking data sets, PSPLIB. Considering 5 resource leveling objective functions, it is shown that HRCR outperforms well-known multi-objective optimization algorithm, SPEA2 (Strength Pareto Evolutionary Algorithm-2), in generating dominant Pareto sets. The number of approximate Pareto optimal also can be extended by modifying weight parameter to reduce resource capacity in HRCR.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.39-46
• /
• 2007

Recently flash memory is widely accepted as a storage devise of embedded systems for portability and performance reasons. Flash memory has many distinguishing features compared to legacy magnetic disks. Especially, a file system for flash memory usually assumes the form of log-structured file system and it employs garbage collector accordingly. Since the garbage collector can greatly affect the performance of file system, it should be designed carefully considering flash memory features. In this paper, we suggest a new garbage collector for existing JFFS2 (Journaling Flash File System II) file system. By extensive performance evaluation, we show that the proposed garbage collector achieves improved performance in terms of flash memory consumption rate, increased flash memory life time, and improved wear-leveling.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.5
• /
• pp.322-330
• /
• 2009

In order to utilize NAND flash memory as storage media which does not allow update-in-place and limits the number of block erase count, various garbage collection policies supporting wear-leveling have been investigated. Conventional garbage collection policies require cleaning-index calculation for the entire blocks to choose a block to be garbage-collected to support wear-leveling whenever a garbage collection is required, which results in performance degradation of system. This paper proposes a garbage collection policy which supports wear-leveling using a threshold value, which is in fact a variance of erase counts and by the maximum erase count of all blocks, without calculating the cleaning-index. During garbage collection, the erase cost is minimized by using the Greedy Policy if the variance is less than the threshold value. It achieves wear-leveling by excluding the block with the largest erase count from erase target blocks if the variance is larger than threshold value. The proposed scheme shows that a standard deviation approaches to zero as the erase count of blocks approaches to its upper limit and the measured speed of garbage collection is two times faster than the conventional schemes.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.23 no.6
• /
• pp.423-438
• /
• 2021

The blade of motor grader is used for scattering and leveling the aggregates on the foundation of road construction site. The paper performed a design improvement research of the blade part to enhance the working efficiency of motor graders. The scattering works of aggregates by blade driving were simulated by DEM (discrete element method) of a dynamic code. The four design parameters were selected and a specific leveling scenario for the simulation was determined. The nine blade models were numerically experimented, and the sensitivity of each factors was analyzed. Next, the design factors that influence a blade performance have been selected by ANOVA, and these key design factors were applied to the progressive quadratic response surface method (PQRSM). The optimum set of design factors of the blade was finally proposed.

• International Journal of Automotive Technology
• /
• v.6 no.4
• /
• pp.429-436
• /
• 2005

In this paper, operation algorithms are evaluated for a fuel cell hybrid electric vehicle (FCHEV). Power assist, load leveling and equivalent fuel algorithm are proposed and implemented in the FCHEV performance simulator. It is found from the simulation results that the load leveling algorithm shows poor fuel economy due to the system charge and discharge efficiency. In the power assist and equivalent fuel algorithm, the fuel cell stack is operated in a relatively better efficiency region owing to the battery power assist, which provides the improved fuel economy.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.1404-1408
• /
• 2006

In this paper, a hybrid-type vibration isolator which has air chamber(spring) and viscous damper in series is developed. The developed vibration isolator is designed to perform 3 following functions : spring function for normal operating conditions, damping function to reduce an impact for sudden move of upper beam, and finally leveling function. Based on the given natural frequency and damping factor, the design procedure is proposed. The performance of the developed isolator is tested by measuring stiffness and damping.

• Journal of the Semiconductor & Display Technology
• /
• v.6 no.2 s.19
• /
• pp.5-10
• /
• 2007

According to the advantageous features of flash memory, its exploitation and application in mobile and ubiquitous related devices as well as voluminous storage devices is being increased rapidly. The inherent properties that are determined by configuration of flash memory unit might restrict the promising expansion in its utilization. In this paper, we study policies based on threshold values, instead of using global search, in order to satisfy our objective that is to decrease the necessary processing cost or penalty for recycling of flash memory space at the same time minimizing the potential degradation of performance. The proposed cleaning methods create partitions of candidate memory regions, to be reclaimed as free, by utilizing global or dynamic threshold values. The impact of the proposed policies is evaluated through a number of experiments, the composition of the optimal configuration featuring the methods is tested through experiments as well.