• Journal of Digital Contents Society
• /
• v.11 no.3
• /
• pp.393-398
• /
• 2010

Composite and compact devices equipped with the functionality of digital still image acquisition, such as cellular phones and MP3 players are widely available to common users. In addition, the application of digital still images is becoming common among security and digital recording devices. The amount of still images, that are maintained or shared in personal storage or massive storage provided by various web services, are rapidly increasing. These still images are bound with file names or identifiers that are provided arbitrarily by users or that are generated from device specific naming method. However, those identifiers are vulnerable for unexpected changing or eliminating so that it becomes a problem in still image search or management. In this paper, we propose a method for still image identifier generation that is created from the still image internal information.

• The KIPS Transactions:PartC
• /
• v.17C no.5
• /
• pp.399-406
• /
• 2010

Many problems are arisen due to the weakness in the security and invasion to privacy by malicious attacker or internal users while various data services are available in ubiquitous network environment. The matter of controlling security for various contents and large capacity of data has appeared as an important issue to solve this problem. The allocation methods of Ito, Saito and Nishizeki based on traditional polynomial require all shares to restore the secret information shared. On the contrary, the secret information can be restored if the shares beyond the threshold value is collected. In addition, it has the effect of distributed DBMS operation which distributes and restores the data, especially the flexibility in realization by using parameters t,v,k in combinatorial design which has regularity in DB server and share selection. This paper discuss the construction of new share allocation method and data distribution/storage management with the application of matrix structure of t-(v,k,1) design for allocating share when using secret sharing in management scheme to solve the matter of allocating share.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.399-410
• /
• 2002

Web cache, which is functionally another word of proxy server, is located between client and server. Web cache has a limited storage area although it has broad bandwidth between client and proxy server, which are usually connected through LAN. Because of limited storage capacity, existing objects in web cache can be deleted for new objects by some rules called replacement algorithm. Hit rate and byte-hit rate are general metrics to evaluate replacement algorithms. Most of the replacement algorithms do satisfy only one metric, or sometimes none of them. In this paper, we propose two replacement algorithms to achieve both high hit rate and byte-hit rate with great satisfaction. In the first algorithm, the cache is appropriately partitioned according to file types as a basic model. In the second algorithm, the cache is composed of two levels; the upper level cache is managed by the basic algorithm, but the lower level is collectively used for all types of files as a shared area. To show the performance of the proposed algorithms, we evaluate hit rate and byte-hit rate of the proposed replacement algorithms using the trace driven simulation.

• Journal of Korean Society of Water and Wastewater
• /
• v.25 no.4
• /
• pp.581-589
• /
• 2011

Generally, treated water or raw water is transported into storage reservoirs which are receiving facilities of local governments from multi-regional water supply systems. A water supply control and operation center is operated not only to manage the water facilities more economically and efficiently but also to mitigate the shortage of water resources due to the increase in water consumption. To achieve the goal, important information such as the flow-rate in the systems, water levels of storage reservoirs or tanks, and pump-operation schedule should be considered based on the resonable water demand forecasting. However, it is difficult to acquire the pattern of water demand used in local government, since the operating information is not shared between multi-regional and local water systems. The pattern of water demand is irregular and unpredictable. Also, additional changes such as an abrupt accident and frequent changes of electric power rates could occur. Consequently, it is not easy to forecast accurate water demands. Therefore, it is necessary to introduce a short-term water demands forecasting and to develop an application of the forecasting models. In this study, the forecasting simulator for water demand is developed based on mathematical and neural network methods as linear and non-linear models to implement the optimal water demands forecasting. It is shown that MLP(Multi-Layered Perceptron) and ANFIS(Adaptive Neuro-Fuzzy Inference System) can be applied to obtain better forecasting results in multi-regional water supply systems with a large scale and local water supply systems with small or medium scale than conventional methods, respectively.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.447-461
• /
• 2012

A social network service(SNS) is gaining popularity as a new real-time information sharing mechanism. However, the user's privacy infringement is occurred frequently because the information that is shared through a social network include the private information such as user's identity or lifestyle patterns. To resolve this problem, the research about privacy preserving data sharing in social network are being proceed actively. In this paper, we proposed the efficient scheme for privacy preserving data sharing in social network. The proposed scheme provides an efficient conjunctive keyword search functionality. And, users who granted access right to storage server can store and search data in storage server. Also,, our scheme provide join/revocation functionality suited to the characteristics of a dynamic social network.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.1-7
• /
• 2021

In this paper, optimized media data retrieval and transmission based on the Hybrid CDN/P2P architecture and selective storage through user's prediction of requestability enable seamless data transfer to users and reduction of unnecessary traffic. We also propose a new media management method to minimize the possibility of transmission delay and packet loss so that media can be utilized in real time. To this end, we construct each media into logical segments, continuously compute weights for each segment, and determine whether to store segment data based on the calculated weights. We also designate scattered computing nodes on the network as local groups by distance and ensure that storage space is efficiently shared and utilized within those groups. Experiments conducted to verify the efficiency of the proposed technique have shown that the proposed method yields a relatively good performance evaluation compared to the existing methods, which can enable both initial latency reduction and seamless transmission.

• Korean journal of food and cookery science
• /
• v.24 no.5
• /
• pp.645-651
• /
• 2008

The antioxidant activity of shared fresh, steamed, and black garlic on soybean oil was assessed at levels of 0, 5, 10, 20, 0 g/100 g, respectively, and these samples were stored for 28 days at $60^{\circ}C$. The color of the oil was increased during torage. The anisidine value was increased dramatically at 14 days of storage, after which it continually increased. The cid values of the samples to which fresh and steamed garlic were added did not differ significantly, but were increased n proportion to the sample concentration after 14 days of storage in the samples to which black garlic was added. The peroxide value was lower in the samples to which shred garlic was added, as compared to the samples to which ${\alpha}$ -tocopherol and BHT were added. Garlic had an inhibitory effect on peroxides when the sample volume was larger. The TBA value was increased during storage and was inhibited with larger volumes of added shred garlic. After 28 days of storage, the TBA volumes of all samples were lower than those of the controls (335.63), with the exception of the sample to which 5 g/100 g of steamed garlic was added, particular, the shred garlics evidenced more profound antioxidant activity in the 40 g/100 g added samples than in the sample to which 0.02% BHT was added.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.157-165
• /
• 2010

In the manufacturing industries, CAE analysis results are frequently required during the product development process for design verification. CAE data which include all related information of an analysis is, however, not efficiently shared among engineers because CAE data size is in general very large to deal with. At first, we represent a proposed lightweight format which is capable to include all the types of CAE analysis results and to support hierarchical data structure. Since each CAE system has different data structures of its own, a translator which translates to the proposed format is also represented. Unlike the design environment with CAD system, many CAE systems are used in a manufacturing company because many sorts of analysis are performed usually for a product design. Thus, lots of CAE results are generated and occupy huge size within storage, and they make it harder to manage or share many CAE results efficiently. A multi-CAE management system which is able to share many types of CAE data simultaneously using lightweight format is proposed in this paper. Finally, an implementation of the system for this will be introduced.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2404-2410
• /
• 2011

This paper describes the design overview of cluster file system $SANique^{TM}$ based on SAN(Storage Area Network) environment. The design issues and problems of the conventional global buffer manager are also illustrated under a large set of clustered computing hosts. We propose the efficient global buffer management method that provides the more scalability and availability. In our proposed global buffer management method, we reuse the maintained list of lock information from our cluster lock manager. The global buffer manger can easily find and determine the location of requested data block cache based on that lock information. We present the pseudo code of the global buffer manager and illustration of global cache operation in cluster environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.967-979
• /
• 2013

Now a day, Wireless Sensor Networks (WSNs) are being widely used in different areas one of which is healthcare services. A wireless medical sensor network senses patient's vital physiological signs through medical sensor-nodes deployed on patient's body area; and transmits these signals to devices of registered medical professionals. These sensor-nodes have low computational power and limited storage capacity. Moreover, the wireless nature of technology attracts malicious minds. Thus, proper user authentication is a prime concern before granting access to patient's sensitive and private data. Recently, P. Kumar et al. claimed to propose a strong authentication protocol for healthcare using Wireless Medical Sensor Networks (WMSN). However, we find that P. Kumar et al.'s scheme is flawed with a number of security pitfalls. Information stored inside smart card, if extracted, is enough to deceive a valid user. Adversary can not only access patient's physiological data on behalf of a valid user without knowing actual password, can also send fake/irrelevant information about patient by playing role of medical sensor-node. Besides, adversary can guess a user's password and is able to compute the session key shared between user and medical sensor-nodes. Thus, the scheme looses message confidentiality. Additionally, the scheme fails to resist insider attack and lacks user anonymity.