• 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 the Korean Society for Precision Engineering
• /
• v.13 no.6
• /
• pp.90-101
• /
• 1996

Determination of assembly sequence of components is a key issue in assembly operation. Although a number of articles dealing with assembly sequence determination have appeared, an efficient and general methodology for complex products has yet to appear. The objective of this paper is to present the problems and models used to generate assembly sequence from design data. An essential idea of this research is to acquire a finite number of voxels from any complex geometric entity, such as 3D planar polygons, hollow spheres, cylinders. cones, tori, etc. In order to find a feasible assembly sequence, the following four steps are needed: (1) The components composing of an assembly product are identified and then the geometric entities of each component are extracted. (2) The geometric entities extracted in the first step are translated into a number of voxels. (3) All the mating or coupling relations between components are found by considering relations between voxels. (4) The components to be disassembled are determined using CCGs (Component Coupling Graph).

• Journal of Korean Society of Rural Planning
• /
• v.22 no.4
• /
• pp.61-69
• /
• 2016

In order to reduce the farmers' burden of purchasing agricultural machinery and address the shortage of farm workers, the government have been promoting agricultural machinery rental service since 2003. Despite of political purpose, the outcome of agricultural machinery rental service turned out to be adverse, high cost and low efficiency, by the pork barrel projects operated from some municipalities. Therefore, this study was aimed to improve the efficiency of agricultural machinery rental service by analyzing the operation status of agricultural machinery in local government. A questionnaire survey was conducted at 134 cities and counties in terms of rent type, management personnel, business budget, agricultural machinery ownership, rental performance, use rates, operational problems, and improvement plan. This study found that some agricultural machinery rental offices were only focused on the short-term rental service, which caused the increasing number of operating personnel, required facilities/equipment. The short-term rental service has a limitation for promoting the mechanization rate in dry-field farming. Therefore, it should be carried out along with the long-term rental service which a lessee maintains and manages agricultural machinery directly. Furthermore, the reasonable number of agricultural machinery based on regional circumstances should be considered to meet rental demand and collect the minimal rental fee for purchasing new agricultural machinery and replacing old ones.

• 한국연소학회:학술대회논문집
• /
• 2002.06a
• /
• pp.3-10
• /
• 2002

In this work, numerical parametric studies on spray combustion have been conducted. In simulation of turbulence, RNG ${\kappa}-{\varepsilon}model$ is adopted. Initial spray distribution is specified by Rosin-Rammler distribution function. Eddy break-up model is adopted as a combustion model. The parameters considered are inlet air temperature, swirl number, and SMD. With higher inlet air temperature, the axial velocities are increased and penetration of primary jet is stronger than that of lower inlet air temperature and temperature at the exit of combustor is more uniform. Combustion efficiency is improved with high inlet air temperature. The effect of swirl number on flow field is not significant. It affect only recirculation zone. So temperature at upstream of combustor is influenced. Combustion efficiency deteriorate as SMD of fuel spray increase.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.53-60
• /
• 2012

Attribute-based encryption (ABE) is an encryption scheme in which the user is able to decrypt a ciphertext with associated attributes. However, the scheme does not offer the capability of decryption to others when the user is offline. For this reason, the attribute-based proxy re-encryption (ABPRE) scheme was proposed, which combines traditional proxy re-encryption with ABE, so a user is able to empower designated users to decrypt the re-encrypted ciphertext with the associated attributes of designated users. However, previous ABPRE schemes demands a number of pairing operations that imply huge computational overhead. To reduce the number of pairing operations, we reduce the pairing operations with exponent operations. This paper provides a novel approach to an ABPRE scheme with constant pairing operation latency.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.2
• /
• pp.43-47
• /
• 2009

Glass forming technology is used to form channels of external electrode flat fluorescent lamps (FFL). The efficiency of FFL depends on the number and the length of the channels. Five FFLs with same size ($300\;mm{\times}80\;mm$), different channel number, and different channel length were fabricated. The electrical and optical characteristics of 5 FFLs were evaluated. It was found that the FFL with one channel with its channel length of 1,110 mm and channel width of 7 mm corner width was shown to have the highest efficiency at room temperature operation.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.51-56
• /
• 2009

Flash memory has rapidly deployed as data storage. However, the flash memory has a major disadvantage that recorded data cannot be dynamically overwritten. In order to solve this "erase-before-write" problem, the log block buffer scheme used Flash memory file system. however, the current managements of the log buffer, in case random write pattern, BAST technique have problem of frequent merge operation, but FAST technique don't consider merge operation by frequently updated data. Previous methods not consider merge operation cost and frequently updated data. In this paper, we propose a new log buffer management scheme, called JBB. Our proposed method evaluates the worth of the merge of log blocks, so we conducts the merge operation between infrequently updated data and its data blocks, and postpone the merge operation between frequently updated data and its data blocks. Through the method, we prevent the unnecessary merge operations, reduce the number of the erase operation, and improve the utilization of the flash memory storage. We show the superiority of our proposed method through the performance evaluation with BAST and FAST.

• Journal of Trauma and Injury
• /
• v.32 no.4
• /
• pp.195-201
• /
• 2019

Purpose: This study was conducted to investigate the usefulness of a polyester urethane dural substitute (Neuro-Patch^®, B. Braun, Boulogne, France) as an anti-adhesion agent in subsequent cranioplasty by analyzing the use of Neuro-Patch^® during decompressive craniectomy in traumatic brain injury patients. Methods: We retrospectively analyzed patients with traumatic brain injury who underwent decompressive craniectomy followed by cranioplasty from January 2015 to December 2018. Patients were analyzed according to whether they received treatment with Neuro-Patch^® or not (Neuro-Patch^® group, n=71; control group, n=55). Patients' baseline characteristics were analyzed to identify factors that could affect cranioplasty results, including age, sex, hypertension, diabetes mellitus, use of antiplatelet agents or anticoagulant medication, the interval between craniectomy and cranioplasty, and the type of bone used in cranioplasty. The cranioplasty results were analyzed according to the following factors: operation time, blood loss, postoperative hospitalization period, surgical site infection, and revision surgery due to extra-axial hematoma. Results: No significant difference was found between the two groups regarding patients' baseline characteristics. For the cranioplasty procedures, the operation time (155 vs. 190 minutes, p=0.003), intraoperative blood loss (350 vs. 450 mL, p=0.012), and number of surgical site infections (4 vs. 11 cases, p=0.024) were significantly lower in the Neuro-Patch^® group than in the control group. Conclusions: The use of Neuro-Patch^® was associated with a shorter operation time, less blood loss, and a lower number of surgical site infections in subsequent cranioplasties. These results may provide a rationale for prospective studies investigating the efficacy of Neuro-Patch^®.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.1
• /
• pp.11-21
• /
• 2017

Artillery fire power due to effectiveness which is hard to predict well-planned and surprising attack can give a fear and shock to the personnel and is a very core weapon system and takes a critical role in wartime. Therefore in order to maximize operational effectiveness, Army required protecting artillery and takes a quick attack action through rapid construction of artillery's positions. The artillery use artillery's position to prevent exposure by moving to other position frequently. They have to move and construct at new artillery's positions quickly against exposing existed place by foe's recognition. These positions should be built by not manpower but engineering construction equipment. Because artillery positions have to protect human and artillery equipment well and build quickly. Military engineering battalion have lots of construction equipment which include excavator, loader, dozer, combat multi-purposed excavator, armored combat earthmover dump truck and so on. So they have to decide to optimal number of Team combining these equipments and determine construction sequence of artillery's position in operational plan. In this research, we propose to decide number of Team efficiently and allocate required construction's positions for each Team under constraints of limited equipments and time. To do so, we develop efficient heuristic method which can give near optimal solution and be applied to various situation including commander's intention, artillery position's priority or grouping etc. This heuristic can support quick and flexible construction plan of artillery positions not only for using various composition's equipment to organize Teams but also for changing quantity of positions.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.84-91
• /
• 2006

In this paper, we present a new segmentation algorithm for color images based on mathematical morphology and a Gaussian mixture model(GMM). We use the morphological operations to determine the number of components in a mixture model and to detect their modes of each mixture component. Next, we have adopted the GMM to represent the probability distribution of color feature vectors and used the deterministic annealing expectation maximization (DAEM) algorithm to estimate the parameters of the GMM that represents the multi-colored objects statistically. Finally, we segment the color image by using posterior probability of each pixel computed from the GMM. The experimental results show that the morphological operation is efficient to determine a number of components and initial modes of each component in the mixture model. And also it shows that the proposed DAEM provides a global optimal solution for the parameter estimation in the mixture model and the natural color images are segmented efficiently by using the GMM with parameters estimated by morphological operations and the DAEM algorithm.