• Journal of Conservation Science
• /
• v.29 no.4
• /
• pp.321-332
• /
• 2013

Namwon Singyeri Maaeyeoraejwasang (Rock-Carved Seated Buddha Statue) is composed mainly foliated granite and is different metamorphic grade and weathering degree on rock location. As the results of deterioration evaluation, upper part of the buddha statue was estimated that granularity decomposition was serious and rock strength was lower than lower part. Furthermore organism assessed most effect of among weathering factors. Chl. a amount of organism species were calculated $0.2{\mu}g/cm^2$ of crustaceous lichen, $1.1{\mu}g/cm^2$ of foliose lichen, $2.3{\mu}g/cm^2$ of bryophyte. Organism was taken treatment in order of amount of Chl. a and pre-cleaning, dry cleaning, wet cleaning in sequence. It should be establish conservation plan that strengthening in consideration of lithology characteristics and setting in good condition environment to conserve long-term of Maaeyeoraejwasang.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.676-686
• /
• 2005

The Internet users as well as network providers are eager to have different qualities of service among users beyond the best-effort. In this paper, we propose a scheduling algorithm that provides a differentiated service in the granularity of user sessions. The proposed algorithm is a Hierarchical Deficit Round-Robin (H-DRR) algorithm that is an extension of an existing DRR algorithm. A main advantage is that H-DRR provides service differentiation for throughput-intensive applications such as FTP as well as delay-sensitive applications such as telnet or VoIP without distinguishing the types of applications. The most importance in providing a service differentiation in term of network providers is to have controllability and predictability. We show that H-DRR is superior to DRR in terms of controllability and predictability through both mathematical analysis and simulation experiments. Nevertheless, H-DRR requires O(1) complexity for implementation.

• The Journal of the Korea Contents Association
• /
• v.7 no.11
• /
• pp.43-51
• /
• 2007

Access control techniques should be flexible enough to support all protection granularity levels. Since access control policies are very likely to be specified in relation to document types, it is necessary to properly manage a situation in which documents fail to be dealt with by the existing access control policies. The existing access control has not taken information structures and semantics into full account due to the fundamental limitations of HTML. In addition, access control for XML documents allows only read operations, and there exists the problem of slowing down system performance due to the complex authorization evaluation process. In order to resolve this problem, this paper designs a XML Access Control Management System which is capable of making fined-grained access control. And then, in developing an access control system, it describes the subject and object policies of authorization for XML document on which authorization levels should be specified and which access control should be performed.

• The Journal of Society for e-Business Studies
• /
• v.8 no.4
• /
• pp.113-128
• /
• 2003

A Semantic Web based service description is to enable intelligent matchmaking of services by improving representational flexibility and expressiveness in service description for Web Services. Flexibility concerns the way of how a computer handles the discrepancies in the granularity and the structure of service description between different participants of web services. Expressiveness means richness in the semantic description of services (or ontological representation of each service as a concept). The main shortcoming of currently available industry standard framework for e-commerce such as UDDI and ebXML is that they do not allow much flexibility and expressiveness in the service description. In our research we analyze the requirements of extending service description based on the Semantic Web, especially in the context of DAML-S. We also propose a method to be applied to implement intelligent web services by implementing a virtual auction site, testAuction.com. Finally, we consider some theoretical issues regarding the framework for web services using ontology.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.167-178
• /
• 2003

In mobile computing environments, queries based on the location of mobile clients (MCs) may cause different results. We say that the data of these results are location dependent data (LDD). Location-dependent queries to LDD need to be processed in conjunction with the geographical distance. The efficiency of query processing may also be increased by LDD relationship, etc. But there is the problem of fuzziness about how the distance used in location-dependent queries is evaluated and the data regions are organized. In this paper, we quantify the fuzziness of a location-dependent fuery on LDD. And we propose data regions for LDD, called LDD regions, by relationship of accessed data and the degree of distance between data objects and MCs' locations. In simulation studies we show that the number of database access for location-dependent queries, which have several settings on MCs' favor and two granularity of regions, can be smaller in proposed LDD regions than that in geographical regions.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.1
• /
• pp.26-45
• /
• 2001

The Flash memory market: is an exciting market that has quickly over the last 10 years. Recently Flash memory provides a high-density. truly non-volatile, high performance read write memory solutions, also is characterized by low power consumption, extreme ruggedness and high reliability. Flash memory is an optimum solution for large nonvolitilc storage operations such as solid file storage, digital video recorder, digital still camera, The MP3 player and other portable multimedia communication applications requiring non-volatility. Regardless of the type of Flash memory, Flash media management software is always required to manage the larger Flash memory block partitions. This is true, since Flash memory cannot be erased on the byte level common to memory, but must be erased on a block granularity. The management of a Flash memory manager requires a keen understanding of a Flash technology and data management methods. Though Flash memory's write performance is relatively slow, the suggested algorithm offers a higher maximum write performance. Algorithms so far developed is not suitable for applications which is requiring more fast and frequent accesses. But, the proposed algorithm is focused on the justifiable operation even in the circumstance of fast and frequent accesses.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.649-658
• /
• 1997

Database management systems(DMBS)using bolatile memory shluld have a recovery function to protect data against system failutes.Recovery requires much overhead in transaction proessing and is one of the great factors that deteriorate the system performance.Recently, there have been a lot of studies on database systems with nonbolatile memory to enhance the performance.A nonbolatile memory called DFeRAM is one of the promising memory devices of the future technology, but this device does not support fine-franularity licking.In this paper, we present a dual plane FeRAM(DFeRAM)architecture to support the fine-granularity locking.We also propose a recovery algorithm for the database system with the DFeRAM based on a shadow paging methed.In order to analze the performance of the proposed algorithm, we present an analytical model and analyze the performance using the moedl.

• Journal of the Korean earth science society
• /
• v.29 no.3
• /
• pp.305-314
• /
• 2008

The purpose of this study is to analyze the concept of igneous rock textures and to uncover incorrect descriptions regarding the concept found within high school Earth Science II course seventh curriculum textbooks. Based upon this analysis suggestions will be made so as to improve descriptions regarding the concept of igneous rock texture. At least some incorrect descriptions regarding igneous rock texture were found in all the textbooks examined. Textures of volcanic rocks are described as being either fine-grained and glassy or porphyritic, while those of plutonic rocks are described as hollocrystalline, granular, coarse-grained or equigranular. These descriptions may contribute to forming and/or reinforcing misconceptions about both the classification criteria for, as well as the general concept of igneous rock textures. Therefore, some improvement schemes for the classification of igneous rock textures have been suggested. These schemes suggest that volcanic rocks be classified as either aphanitic or porphyritic, while plutonic rocks be classified as phaneritic, hollocrystalline or equigranular according to granularity, crystallinity, and both the absolute and relative sizes of the crystals within the rock.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.571-578
• /
• 2002

In temporal database, extended time dimension for history management brings about complexity of join operation and increased cost. To solve this problem, a method that joins the divided segment time data after partition the time range into fixed time interval is introduced. But existing methods can't solve the ambiguity problem of time border that caused by temporal granularity in the partition point. In this paper, We suggested Fuzzy Minimum Interval Partition (FMIP) method that introduced the possibility distribution of fuzzy theory considered uncertainty time interval border in the partition line.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.202-209
• /
• 2002

This paper deals with simplification of classification rules for data mining and rule bases for control systems. Datamining that extracts useful information from such a large amount of data is one of important issues. There are various ways in classification methodologies for data mining such as the decision trees and neural networks, but the result should be explicit and understandable and the classification rules be short and clear. The rough sets theory is an effective technique in extracting knowledge from incomplete and inconsistent data and provides a good solution for classification and approximation by using various attributes effectively This paper investigates granularity of knowledge for reasoning of uncertain concopts by using rough set approximations and uses a hierarchical classification structure that is more effective technique for classification by applying core to upper level. The proposed classification methodology makes analysis of an information system eary and generates minimal classification rules.