• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1552-1564
• /
• 1995

A fault detecting method of ternary logic is proposed by using the spectral coefficients of the Chrestenson function. Fault detecting conditions are derived for a stuck-at fault in case of single input, multiple inputs and internal lines in the ternary logic. The detecting conditions for min/max bridging faults are also considered. When using this fault analysis method, it is possible to detect faults without the test vector and minimize high volume memory for storing the vector and response data. Thus, the computational complexity for the test vector can be decreased.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.283-288
• /
• 2004

Authentication and digital signature make secured existing contract in remote spot. But, It required method of storing and managing secret, such as private key password. For this method, we make efforts solution of security with smart cart, such as java card. This paper implement SEED algorithm based on Java Card

• Journal of the Korean Statistical Society
• /
• v.5 no.1
• /
• pp.49-59
• /
• 1976

This paper is to present an iterative method for determining an optimum geographic location pattern for the warehouses (sources) that are employed to serve or supply, known quantities of its finished product to a set of custormer areas (destinations) that have fixed and known locations, where the number of sources is permitted to vary. What must be determined, in this paper, is the number and location of the sources or warehouses that will minimize the combined costs of transferring and storing the total quantity of products demanded in the destinations or customer areas.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1349-1356
• /
• 2004

The interest of version management is increasing in electronic commerce requiring data mining and documents processing system related to digital governmentapplications. In this paper, we define a change set that is to manage historicalinformation and to maintain XML documents during a long period of time and propose several storage policies of XML documents using a change set. A change set includes a change oper-ation set and temporal dimensions and a change operation set is composed with schema change operations and data change operations. We pro-pose three storage policies using a change set. Three storage policies are (1) storing all the change sets, (2) storing the change sets and the versions periodically. (3) storing the aggregation of change sets and the versions at a point of proper time. Also, we compare the performance between the existing storage policy and the proposed storage policies. Though the performance evaluation, we show that the method to store the aggregation of change sets and the versions at a point of proper time outperforms others.

• Journal of Sericultural and Entomological Science
• /
• v.6
• /
• pp.18-27
• /
• 1966

This treatise was sat up as a basic study of the artificial diets of silk worm, both nursed and wild, by storing the natural leaves in defarmentizing solution and the results obtained were as followings. 1. Defarmentizer C, a kind of defarmentizer, was developed by the author in order to store any natural diet by soaking them in the solution. 2. The defarmentizer was workable for aerophobic bacteriums, but was not effectable for aerophilic bacteriums or fungus. 3. The defarmentized diet could feed silk worm during winter season. 4. The storing method has found the importance of growthness of the diet leaves and the perfect riped leaves were found as the best condition for the purpose. 5. The perfect riped leaves were softened properly during the soaking to be fed for silk worm. 6. The defarmentizing solution has held almost the same pH value of protein isoelectric point so that the protein extraction be ceased during the soaking process. 7. The utilization of defarmentizer has found an economical value. 5. The analytical results of various wild plant leaves were found to be usable as the artificial diet mixture for general silkworm.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.3
• /
• pp.1096-1103
• /
• 2014

This paper proposes a novel strategy for attenuating the output power fluctuation of the wind farm (WF) in a range of tens of seconds delivered to the grid, where the kinetic energy caused by the large inertia of the wind turbine systems is utilized. A control scheme of the two-level structure is applied to control the wind farm, which consists of a supervisory control of the wind farm and individual wind turbine controls. The supervisory control generates the output power reference of the wind farm, which is filtered out from the available power extracted from the wind by a low-pass filter (LPF). A lead-lag compensator is used for compensating for the phase delay of the output power reference compared with the available power. By this control strategy, when the reference power is lower than the maximum available power, some of individual wind turbines are operated in the storing mode of the kinetic energy by increasing the turbine speeds. Then, these individual wind turbines release the kinetic power by reducing the turbine speed, when the power command is higher than the available power. In addition, the pitch angle control systems of the wind turbines are also employed to limit the turbine speed not higher than the limitation value during the storing mode of kinetic energy. For coordinating the de-rated operation of the WT and the storing or releasing modes of the kinetic energy, the output power fluctuations are reduced by about 20%. The PSCAD/EMTDC simulations have been carried out for a 10-MW wind farm equipped with the permanent-magnet synchronous generator (PMSG) to verify the validity of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.159-168
• /
• 2021

Building Information Modeling (BIM) data is a digitized construction design by worldwide construction design stands rules. Some research are being conducted to utilize blockchain for safe sharing and trade of BIM data, but there is no way to store BIM data directly in the blockchain due to the size of BIM data and technical limitation of the blockchain. In this paper, we propose a method of storing BIM data by combining a distributed file system and a blockchain. We propose two network overlays for storing BIM data, and we also propose generating the Level of Detail (LOD)-based merkle tree for efficient verification of BIM data. In addition, this paper proposes a system design for distributed storage of BIM data by using blockchain besu client and IPFS client. Our system design has a result that the processing speed stably increased despite the increase in data size.

• Journal of Environmental Science International
• /
• v.33 no.1
• /
• pp.97-102
• /
• 2024

We introduce a method for preserving yellow mealworm (Tenebrio molitor Linnaeus) larvae for an extended period and show that a high percentage of larvae can survive in good health under low-temperature storage conditions combined with specific diapause termination conditions. Our study revealed that we can regulate important development stages such as pupation, emergence, and larval duration by adjusting these termination conditions. When storing larvae aged 6-8 weeks for 140 days, the storage temperature can be varied based on our goals, giving us control over yellow mealworm production to meet specific demands. To produce adult beetles, storing larvae at 15 ℃ with wheat bran and ending diapause at 30 ℃ resulted in 90% pupation rate, with 60% becoming adults in 21 days. If our aim is larvae production, storing them at 10-12 ℃ with wheat bran and ending diapause at 25-30 ℃ allows the larvae to reach a suitable weight for processing. This straightforward approach ensures long-term storage of yellow mealworm larvae and provides a practical way to control their development, allowing efficient mass production tailored to market demands.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.105-115
• /
• 2006

A sensor network which uses DCS(Data-Centric Storage) stores the same data into the same sensor node. Thus it has a hot spot problem when the sensor network grows and the same data arise frequently. In the past researches of the sensor network using DCS, the hot spot problem caused by growing the sensor network was ignored because they only concentrated on managing stored sensor data efficiently. In this paper, we proposed a non-equal region split method that supports efficient scalability on storing multi-dimensional sensor data. This method can reduce the storing cost, as the sensor network is growing, by dividing whole space into regions which have the same number of sensor nodes according to the distribution of sensor nodes, and storing and managing sensor data within each region. Moreover, this method can distribute the energy consumption of sensor nodes by increasing the number of regions according to the size of the sensor network, the number of sensor nodes within the sensor network, and the quantity of sensor data. Therefore it can help to increase the life time and the scalability of the sensor network.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.35-41
• /
• 2017

This paper introduces a new method for storing a private key. This method can be achieved by dividing the private key into "n" pieces by a (k, n) secret sharing method, and then storing each piece into photo files utilizing a steganography method. In this way, a user can restore a private key as long as he can remember the locations of "k" photos among the entire photo files. Attackers, meanwhile, will find it extremely difficult to extract the private key if a user has hidden the pieces of the private key into numerous photo files stored in the system. It also provides a high degree of user convenience, as the user can restore the private key from his memory of k positions among n photo files. Coupled with this, a certain level of security can be guaranteed because the attacker cannot restore a private key, even if he knows k-1 photo file locations.