• Horticultural Science & Technology
• /
• v.34 no.6
• /
• pp.807-817
• /
• 2016

Many onion growers and researchers assert that differences in soil type, agricultural practices, weather, and duration of prolonged onion cultivation in a particular field could affect onion bulb quality. This study evaluates the bulb quality of onions grown in different regions and determines the correlations between bulb characteristics and postharvest loss during cold and ambient storage. Soil and onion bulbs were collected from fields in six onion growing regions in Korea, during the growing season of 2011-2012. The fresh weight, dry matter content, and carbon (C), sulfur and magnesium contents of the onion bulbs were significantly affected by the location in which they were grown. Bulbs grown in Muan had the greatest number of scales, thinnest scale thickness, and the highest total soluble solids (TSS) and total flavonoids (TF). Bulbs originating from Jecheon had the lowest pyruvic acid (PA), total phenolics and TF. Storage loss of bulbs from the different regions was similar in refrigerated storage, but differed in ambient temperature storage. Bulb fresh weight was positively correlated with scale thickness (r = 0.617) and cold storage loss (CSL; r = 0.398). Dry matter content was positively correlated with C (r = 0.958) and TF (r = 0.256) contents, while it was negatively correlated with CSL (r = -0.424). CSL was primarily affected by the fresh weight, as well as the dry matter, C, and PA contents of the bulbs, while ambient storage loss was primarily influenced by the amount of TSS.

• Journal of Industrial Technology
• /
• v.22 no.A
• /
• pp.127-135
• /
• 2002

In this study, the preliminary risk assessment for the underground storage tanks(UST) in Chunchon city was implemented using the geographical information system(GIS). The estimation variables, such as the installation year, storage capacity, the distances from streams, and from groundwater pumping wells, were selected to estimate the relative risk levels. The weighting factors were given to all the estimation variables. Cumulative scores were induced by the combination of all the scores of the corresponding variables using the buffering technique and the overlay analysis in ArcView. Using the these process, the relative risk level of each UST was estimated. Some sites in this study are simplified and reduced because the number of useable data are limited or too enormous. Thus the selection of the comprehensive estimation variables and the proper weighting values are required for the future study. The methodology in this study could be served not only for the preliminary risk assessment of UST but also for the selection of the proper location of new and old UST. And, it can be used for the effective management system of UST.

• Nuclear Engineering and Technology
• /
• v.55 no.11
• /
• pp.4173-4180
• /
• 2023

The stability of engineered barriers in high-level radioactive waste disposal systems can be influenced by the decay heat generated by the waste. This study focuses on the thermal analysis of various canister designs to effectively lower the maximum temperature of the engineered barrier. A numerical model was developed and employed to investigate the heat dissipation potential of copper rings placed across the buffer. Various canister designs incorporating copper rings were presented, and numerical analysis was performed to identify the design with the most significant temperature reduction effect. The results confirmed that the temperature of the buffer material was effectively lowered with an increase in the number of copper rings penetrating the buffer. Parametric studies were also conducted to analyze the impact of technical gaps, copper thickness, and collar height on the temperature reduction. The numerical model revealed that the presence of gaps between the components of the engineered barrier significantly increased the buffer temperature. Furthermore, the reduction in buffer temperature varied depending on the location of the gap and collar. The methods proposed in this study for reducing the buffer temperature hold promise for contributing to cost reduction in radioactive waste disposal.

• Nuclear Engineering and Technology
• /
• v.42 no.5
• /
• pp.582-589
• /
• 2010

As a part of the back-end fuel cycle, transportation of spent nuclear fuel (SNF) from nuclear power plants (NPPs) to a fuel storage facility is very important in establishing a nuclear fuel cycle. In Korea, the accumulated amount of SNF in the NPP pools is troublesome since the temporary storage facilities at these NPP pools are expected to be full of SNF within ten years. Therefore, Korea cannot help but plan for the construction of an interim storage facility to solve this problem in the near future. Especially, a decision on several factors, such as where the interim storage facility should be located, how many casks a transport ship can carry at a time and how many casks are initially required, affect the configuration of the transportation system. In order to analyze the various possible candidate scenarios, we assumed four cases for the interim storage facility location, three cases for the load capacity that a transport ship can carry and two cases for the total amount of casks used for transportation. First, this study considered the currently accumulated amount of SNF in Korea, and the amount of SNF generated from NPPs until all NPPs are shut down. Then, how much SNF per year must be transported from the NPPs to an interim storage facility was calculated during an assumed transportation period. Second, 24 candidate transportation scenarios were constructed by a combination of the decision factors. To construct viable yearly transportation schedules for the selected 24 scenarios, we created a spreadsheet program named TranScenario, which was developed by using MS EXCEL. TranScenario can help schedulers input shipping routes and allocate transportation casks. Also, TranScenario provides information on the cask distribution in the NPPs and in the interim storage facility automatically, by displaying it in real time according to the shipping routes, cask types and cask numbers that the user generates. Once a yearly transportation schedule is established, TranScenario provides some statistical information, such as the voyage time, the availability of the interim storage facility, the number of transported casks sent from the NPPs, and the number of transported casks received at the interim storage facility. By using this information, users can verify and validate a yearly transportation schedule. In this way, the 24 candidate scenarios could be constructed easily. Finally, these 24 scenarios were compared in terms of their operation cost.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.725-727
• /
• 2006

The development of GIS and Location-Based Services requires a high-level database that will be able to allow real-time access to moving objects for spatial and temporal operations. MODB.MM is able to meet these requirements quite adequately, providing operations with the abilities of acquiring, storing, and querying large-scale moving objects. It enables a dynamic and diverse query mechanism, including searches by region, trajectory, and temporal location of a large number of moving objects that may change their locations with time variation. Furthermore, MODB.MM is designed to allow for performance upon main memory and the system supports the migration on out-of-date data from main memory to disk. We define the particular query for truncation of moving objects data and design two migration methods so as to operate the main memory moving objects database system and file-based location storage system with.

• Journal of Intelligence and Information Systems
• /
• v.16 no.2
• /
• pp.129-141
• /
• 2010

An Internet shopping mall for clothing operates a warehouse for packing and shipping products to fulfill its orders. All the products in the warehouse are put into the boxes of same brands and the boxes are stored in a row on shelves equiped in the warehouse. To make picking and managing easy, boxes of the same brands are located side by side on the shelves. When new products arrive to the warehouse for storage, the products of a brand are put into boxes and those boxes are located adjacent to the boxes of the same brand. If there is not enough space for the new coming boxes, however, some boxes of other brands should be moved away and then the new coming boxes are located adjacent in the resultant vacant spaces. We want to minimize the movement of the existing boxes of other brands to another places on the shelves during the warehousing of new coming boxes, while all the boxes of the same brand are kept side by side on the shelves. Firstly, we define the adjacency of boxes by looking the shelves as an one dimensional series of spaces to store boxes, i.e. cells, tagging the series of cells by a series of numbers starting from one, and considering any two boxes stored in the cells to be adjacent to each other if their cell numbers are continuous from one number to the other number. After that, we tried to formulate the problem into an integer programming model to obtain an optimal solution. An integer programming formulation and Branch-and-Bound technique for this problem may not be tractable because it would take too long time to solve the problem considering the number of the cells or boxes in the warehouse and the computing power of the Internet shopping mall. As an alternative approach, we designed a fast heuristic method for this reallocation problem by focusing on just the unused spaces-empty cells-on the shelves, which results in an assignment problem model. In this approach, the new coming boxes are assigned to each empty cells and then those boxes are reorganized so that the boxes of a brand are adjacent to each other. The objective of this new approach is to minimize the movement of the boxes during the reorganization process while keeping the boxes of a brand adjacent to each other. The approach, however, does not ensure the optimality of the solution in terms of the original problem, that is, the problem to minimize the movement of existing boxes while keeping boxes of the same brands adjacent to each other. Even though this heuristic method may produce a suboptimal solution, we could obtain a satisfactory solution within a satisfactory time, which are acceptable by real world experts. In order to justify the quality of the solution by the heuristic approach, we generate 100 problems randomly, in which the number of cells spans from 2,000 to 4,000, solve the problems by both of our heuristic approach and the original integer programming approach using a commercial optimization software package, and then compare the heuristic solutions with their corresponding optimal solutions in terms of solution time and the number of movement of boxes. We also implement our heuristic approach into a storage location assignment system for the Internet shopping mall.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.691-693
• /
• 2007

Existing methods to process continuous range queries are not scalable. In particular, as the number of continuous range queries on a large number of moving objects becomes larger, their performance degrades significantly. We propose a novel query indexing method called the projected attribute bit (PAB)-based query index. We project a two-dimensional continuous range query on each axis to get two one-dimensional bit lists. Since the queries are transformed to bit lists and query evaluation is performed by bit operations, the storage cost of indexing and query evaluation time are reduced significantly. Through various experiments, we show that our method outperforms the containment-encoded squares-based indexing method, which is one of the most recently proposed methods.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1172-1181
• /
• 1997

A militimedia data is a data mixed of formatted data like an audio and video. Multimedia data has characteristics that it need large amount of storage,wide network bandwith andreal time responsibolity. Because of these characteristocs, the VOD server and continous media storage server have a disk stripe structure or disk stripe sructure or disk array structure(RAID).In the parallel disk access system,high-speed play-back of continous media using segment interleavung may not ensure Qos pf other cioents because of the concentrated load within some disks. The load concentration of disks is related to both the number of disks in the system and playback rate of contimous media.In this paper. we describe that high-speed playback scheme,which is independent of the number of disk and plyback rate can be achieved by technique of changing the in-teval of access to segnent location.We show the experimental result of this technique in this pater.

• The KIPS Transactions:PartD
• /
• v.18D no.4
• /
• pp.225-236
• /
• 2011

Various applications of LBS (Location Based Services) are being developed to provide the customized service depending on user's location with progress of wireless communication technology and miniaturization of personalized device. To effectively process an amount of vehicles' location data, LBS requires the techniques such as vehicle observation, data communication, data insertion and search, and user query processing. In this paper, we propose the historical location index, GIP-FB (Group Insertion tree with Flexible Buffer Node) and the flexible buffer node technique to adjust the cost of data insertion and search. the designed GIP+ based index employs the buffer node and the projection storage to cut the cost of insertion and search. Besides, it adjusts the cost of insertion and search by changing the number of line segments of the buffer node with user defined time interval. In the experiment, the buffer node size influences the performance of GIP-FB by changing the number of non-leaf node of the index. the proposed flexible buffer node is used to adjust the performance of the historical location index depending on the applications of LBS.

• Journal of the Korea Institute of Building Construction
• /
• v.20 no.3
• /
• pp.279-287
• /
• 2020

Recently, the demand for underground-type ammunition storage facilities has increased. Comparing with a ground-type ammunition storage facility, the underground-type ammunition storage facility can decrease the standard of safety distance because fragment and blast wave can be locked in the rock formation. However, the absence of a design method on the underground-type ammunition storage chamber became a major setback for the construction promotion. In this study, the process for designing an overall configuration of the underground-type ammunition storage facility was provided. First, the determination method for configuration and number of the chamber was developed by performing the ammunition storage simulation. Then, a tunnel (i.e., transfer channel for vehicles) and designed chambers can be arranged on the basis of safety distance standard. The safety distance standard also should be considered for determining the location and the size of entrances because of the blast wave and fragment effect at the entrances when an explosion is generated inside a chamber. In addition, considerations on the design for the waterproof and the drainage of subsurface water were analyzed through construction cases. Finally, an example of designing underground-type ammunition storage chambers was provided in order to verify the developed design process.