• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.407-416
• /
• 1998

For fast Cholesky factorization, it is most important to reduce the number of nonzero elements by ordering methods. Generally, the minimum deficiency ordering produces less nonzero elements, but it is very slow. We propose an efficient implementation method. The minimum deficiency ordering requires much computations related to adjacent nodes. But, we reduce those computations by using indistinguishable nodes, the clique storage structures, and the explicit storage structures to compute deficiencies.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2005.05b
• /
• pp.1219-1223
• /
• 2005

This study was accomplished to confirm the possibility of supplying stream minimum flow from detention storage which was determined to reduce peak flows of flood within developing planned district. The results analyzed was summarized as follows; Firstly, Sin-gil district situated in Ansan city was selected, of which watershed area has $0.56km^2$. And detention storage was determined to $5,370m^3$ from analyzing flood volume by the SCS unit hydrograph method. Secondly, using Visual Basic ver 6.0, a detention storage water balance model was developed, in which simulation was based on conditioning storage inflow and outflow according to streamflow volume or rate state. And streamflow was simulated using the DAWAST model. Thirdly, detention operation scenarios were consisted of the combinations with inflow referencing streamflow of 5mm/day, 10mm/day and outflow referencing streamflow of 1mm/day, 2mm/day. The developed detention storage water balance model was operated to simulate daily water storages of detention sized on flood by scenarios. Stream minimum flows were able to be supplied during 209 days to 237 days per a year, total volume of stream minimum flows supplied for this period was analyzed to reach 27 to $55\% of yearly streamflow volume. If inflow criteria of streamflows to detention was considered to be established on a theoretical condition, it is expected to supply stream minimum flows of 20 to $30\% of yearly streamflow from stream to detention. Also to maximize function of supplying urban stream minimum flow from detention storages, sewage waters within developing planned district have to be treated and entered to detention inflow together with streamflows to enrich function of detention planned to reduce flood volumes.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.11 no.3
• /
• pp.401-413
• /
• 1999

An ice storage cooling facility with cooling capacity of 150㎾ has been constructed for the purpose of developing optimal design and control strategy for an ice storage system. As the first step to this purpose, a computer program has been developed to simulate the operation of the ice storage system and examined precisely by comparing the results with those measured from the test facility. With the simulation program verified from the comparison, a design procedure has been developed to determine the minimum capacity required for each operation strategy available commercially. It is shown that the minimum sizes of the chiller and the storage tank are strongly dependent on the control strategy, i.e., chiller priority or storage priority, but less affected by the arrangement method, i.e., chiller upstream or chiller downstream.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.53-56
• /
• 2007

Symmerge is a stable minimum storage algorithm for merging that needs $O(mlog\frac{n}{m})$ element comparisons, where m and n are the sizes of the input sequences with m ${\leqq}$ n. According to the lower bound for merging, the algorithm is asymptotically optimal regarding the number of comparisons. The objective of this paper is to consider the relationship between m and n for the spanning case with the recursion level m-1.

• Journal of Biosystems Engineering
• /
• v.19 no.3
• /
• pp.211-221
• /
• 1994

In this study, to maximize the solar energy utilization for greenhouse heating during the winter season, solar energy-underground latent heat storage system was constructed, and the thermal performance of the system has been analyzed to obtain the basic data for realization of greenhouse solar heating system. The results are summarized as follows. 1. $Na_2SO_4{\cdot}10H_20$ was selected as a latent heat storage material, its physical properties were stabilized and the phase change temperature was controlled at $13{\sim}15^{\circ}C$. 2. Solar radiation of winter season was the lowest value in December, and Jinju area was the highest and the lowest value was shown in Jeju area. 3. The minimum inner air temperature of greenhouse with latent heat storage system(LHSS) was $7.0{\sim}7.5^{\circ}C$ higher than that of greenhouse without LHSS and was $7.0{\sim}11.2^{\circ}C$ higher than the minimum ambient air temperature. 4. Greenhouse heating effect of latent heat storage system was getting higher according to the increase of solar radiation and was not concerned with the variation of minimum ambient air temperature. 5. The relative humidity of greenhouse with latent heat storage system was varied from 50 to 85%, but that of greenhouse without LHSS was varied from 30 to 93%. 6. The heating cost of greenhouse with solar energy-latent heat storage system was about 24% of that with the kerosene heating system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.227-247
• /
• 2018

For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

• Korean Journal of Optics and Photonics
• /
• v.13 no.6
• /
• pp.486-492
• /
• 2002

In this paper. we presented 1 & 2 dimensional minimum mean-squared-error (MMSE) equalization scheme in a digital holographic data storage system to improve bit-error-rate (BER) and to mitigate inter-symbol interference (ISI) which were generated during the data storage and retrieval processes. We showed experimentally for ten data pages retrieved from the holographic storage system that BER and signal-to-noise ratio (SNR) were improved by adopting MMSE equalization.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.59 no.2
• /
• pp.29-36
• /
• 2017

The objective of this study was to analyze the temporal and spatial characteristics of agricultural drought by tracking the daily reservoir storage in Chungnam province. All daily records of the percent of reservoir storage from 2000 to 2015 were collected for 130 irrigation reservoirs from the RIMS (Rural Infrastructure Management System). The temporal change of province-wide average reservoir storage and the statistics showed that the annual average and minimum percent of reservoir storage in 2015 were extremely low like as those in the historical drought years of 2001 and 2012. The minimum reservoir storage on record was a 41 % at the end of September and remained far less than its historical average even until the end of the year. Furthermore, the annual average reservoir storage (68.3 %) recorded the lowest on record since 2000. In addition, about half of 130 major irrigation reservoirs in Chungnam fell into the risk of water shortage below 30 % full, and, in terms of annual minimum reservoir storage, the 79 reservoirs yielded lower storage in 2015 comparing with the measured in another drought year, 2001. On the other hand, irrigation reservoirs of comparatively worse storage condition revealed to be mostly located on the inside, such as Cheongyang-gun and Hongsung-gun. Conclusively, the low reservoir storage, still far below average even on December 2015, induced a serious concern about that more extreme drought would happen in the next spring.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.10
• /
• pp.52-58
• /
• 2009

In this paper, we propose a probability method to determine minimum capacity of energy storage system(ESS) for Micro-grid Because of high capital cost of ESS, It's very important to determine optimal capacity of ESS and for stable operation of Micro grid(MG), we should determine minimum capacity of ESS. The proposed method has abilities to consider forced outage rate of generators and intermittent of non-dispatchable generators and minimum capacity make MG keep energy balancing by oneself.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3583-3598
• /
• 2019

In order to improve the reliability and repair efficiency of distributed storage systems, minimum bandwidth regenerating (MBR) codes based on cyclic variable fractional repetition (VFR) codes are constructed in this thesis, which can repair failed nodes accurately. Specifically, in order to consider the imbalance of data accessed by the users, cyclic VFR codes are constructed according to that data with different heat degrees are copied in different repetition degrees. Moreover, we divide the storage nodes into groups, and construct MBR codes based on cyclic VFR codes to improve the file download speed. Performance analysis and simulation results show that, the repair locality of a single node failure is always 2 when MBR codes based on cyclic VFR codes are adopted in distributed storage systems, which is obviously superior to the traditional MBR codes. Compared with RS codes and simple regenerating codes, the proposed MBR codes based on cyclic VFR codes have lower repair locality, repair complexity and bandwidth overhead, as well as higher repair efficiency. Moreover, relative to FR codes, the MBR codes based on cyclic VFR codes can be applicable to more storage systems.