• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.154-163
• /
• 2005

Because most researches that were studied so far on XML documents used an absolute coordinate system in most of the index techniques, the update operation makes a large burden. To express the structural relations between elements, attributes and text, we need to reconstruct the structure of the coordinates. As the reconstruction process proceeds through out the entire XML document in a cascade manner, which is not limited to the current changing node, a serious performance problem may be caused by the frequent update operations. In this paper, we propose an index technique based on extensible index that does not cause serious performance degradations. It can limit the number of node to participate in reconstruction process and improve lots of performance capacities on the whole. And extensible index performs the containment relationship query by the simple expression using SQL statement.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4028-4049
• /
• 2014

Attribute-based encryption (ABE) is a promising cryptographic primitive for implementing fine-grained data sharing in cloud computing. However, before ABE can be widely deployed in practical cloud storage systems, a challenging issue with regard to attributes and user revocation has to be addressed. To our knowledge, most of the existing ABE schemes fail to support flexible and direct revocation owing to the burdensome update of attribute secret keys and all the ciphertexts. Aiming at tackling the challenge above, we formalize the notion of ciphertext-policy ABE supporting flexible and direct revocation (FDR-CP-ABE), and present a concrete construction. The proposed scheme supports direct attribute and user revocation. To achieve this goal, we introduce an auxiliary function to determine the ciphertexts involved in revocation events, and then only update these involved ciphertexts by adopting the technique of broadcast encryption. Furthermore, our construction is proven secure in the standard model. Theoretical analysis and experimental results indicate that FDR-CP-ABE outperforms the previous revocation-related methods.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3753-3761
• /
• 2000

There exist several versions of schema and instances created under different versions of the schema concurrently in the database in schema evolution environments. This paper proposes a mechanism for accessing instances regardless of versions in schema evolution environments in object relational databases. Access handling routines are used in accessing to the instances through the undefined attributes in the versions in which they were created. The change of semantic information of attributes is supported. Access handling routines are defined for each pair of semantics rather than defining backdate/update functions for each pair of versions of a class. A query language that accommodates version and semantic information is defined through the extension of the primitive SQL format.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.181-188
• /
• 2016

This study investigated consumer convergence preferences for healthcare information service in social media using the multi-attribute utility theory. The multi-attribute utility theory is an approach for compositional modeling attributes wherein researchers compute the overall service utility by aggregating the evaluation results for attribute values. We found that healthcare information service consumers in social media evaluate the service preference through the multi attributes - Update, Cost, Usefulness, Usability, Reliability. And the study shows that individual preference by estimating weight of each attribute in the services influences the service use intention. So we believe that estimating preferences with multi-attribute utility theory will predict business success of the services in a new media, and for a successful business of the social media services marketers should assess the consumer's preference using the multi-attributes.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.553-561
• /
• 1999

The facility of schema evolution is necessary in object-oriented database applications. There exist several versions of schema and instances created under different versions of the schema concurrently in the database. This base proposes a mechanism for supporting accessing instances regardless of versions of the schema in schema evolution environments in object oriented databases. There is trade-off between the flexibility of schema modification operations and the system overhead for supporting such schema modifications. Access handling routines are provided to the undefined attributes in each version of the class. Access handling routines are also defined for each pair of semantics rather than defining backdate/update functions for each pair of versions of a class. Thus, this mechanism supports the change of semantics with reduced user and system overhead.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.615-622
• /
• 2007

Recently, users who want to be provided motile devices, such as PDP, PMP, and IPTV connected wireless internet, with multimedia contents are increasing due to an influence of multimedia contents. In the paper, we propose an efficient database design method for managing mobile multimedia services on home network systems. For this, we build relations using attributes required while providing multimedia services, and then design a database. Specially, we propose a database design method based on normalization theory to eliminate redundancies and update anomalies caused by a non trivial multi valued dependency in relations. In the experiments, we compare and analyze occurrence frequencies of data redundancies and update anomalies through query executions on the relation decomposed into normal forms. The results reveal that our database design is failrly effective.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.137-145
• /
• 2010

Wireless sensors play important roles in various areas as ubiquitous computing is generalized. Depending on applications properties, each sensor can be equipped with limited computing power in addition to general function of gathering environment-related information. One of main issues in this environment is to improve energy-efficiency in sensor nodes. In this paper, we devise a new attribute-query processing algorithm. Each sensor has to maintain partial information locally about attributes values gathered at its all descendent nodes. As the volume is higher, however, the maintenance cost also increases. And the update cost also has to be considered in the proposed algorithm. Thus, some bits, AVB(Attribute-Value Bits), are delivered instead of the value itself, where each bit represents a bound of attribute. Thus, the partial information can decrease the number of exchanged messages with a little cost during query processing. Through simulation works, the proposed algorithm is analyzed from several points of view.

• Korean Journal of Remote Sensing
• /
• v.26 no.3
• /
• pp.317-324
• /
• 2010

In recent years, many automatic classification approaches have been employed. An automatic classification method can be effective, time-saving and can produce objective results due to the exclusion of operator intervention. This paper proposes a classification method based on automated training for high resolution multispectral images using ancillary data. Generally, it is problematic to automatically classify high resolution images using ancillary data, because of the scale difference between the high resolution image and the ancillary data. In order to overcome this problem, the proposed method utilizes the classification results of a Landsat image as a medium for automatic classification. For the classification of a Landsat image, a maximum likelihood classification is applied to the image, and the attributes of ancillary data are entered as the training data. In the case of a high resolution image, a K-means clustering algorithm, an unsupervised classification, was conducted and the result was compared to the classification results of the Landsat image. Subsequently, the training data of the high resolution image was automatically extracted using regular rules based on a RELATIONAL matrix that shows the relation between the two results. Finally, a high resolution image was classified and updated using the extracted training data. The proposed method was applied to QuickBird and SPOT-5 images of non-accessible areas. The result showed good performance in accuracy assessments. Therefore, we expect that the method can be effectively used to automatically construct thematic maps for non-accessible areas and update areas that do not have any attributes in geographic information system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.6
• /
• pp.115-126
• /
• 2022

The purpose of this study is to try to IPA(Importance-Performance Analysis) by applying text mining approaches to user review data for korea mobile banking applications, and to derive priorities for improvement. User review data on mobile banking applications of korea commercial banks (Kookmin Bank, Shinhan Bank, Woori Bank, Hana Bank), local banks (Gyeongnam Bank, Busan Bank), and Internet banks (Kakao Bank, K-Bank, Toss) that gained from Google playstore were used. And LDA topic modeling, frequency analysis, and sentiment analysis were used to derive key attributes and measure the importance and satisfaction of each attribute. Result, although 'Authorizing service', 'Improvement of Function', 'Login', 'Speed/Connectivity', 'System/Update' and 'Banking Service' are relatively important attributes when users use mobile banking applications, their satisfaction is not at the average level, indicating that improvement is urgent.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.21-27
• /
• 1998

This paper describes the design and implementation of system for editing SGML document instance using document structure information of SGML DTD. For make use of structure window for logical structure expression of document to SGML document editing without editing mistake of user and easy update the using support to editing process of elements, attributes, entities tools and product document, and valid using SGML parser. Also, in order to support Korean and English text using KS 5601. In this paper, the proposed SGML document editing system is used common controls support of window 95 for window user interface