• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.171-179
• /
• 2008

RBAC(Role based Access Control) is effective way of managing user's access to information object in enterprise level and e-government system. The concept of RBAC is that the access right to object in a system is not directly assigned o users but assigned by being a member of a role which is defined in a organization. RBAC is utilized for controling access range of privacy but it does not support the personal legal right of control over information and right of limited access to the self. Nor it contains the way of observation of privacy flow that is guided in a legal level. In this paper, extended RBAC model for protecting privacy will be suggested and discussed. Two components of Data Right and Assigning Data Right are added to existed RBAC and the definition of each component is redefined in aspect of privacy preservation. Data Right in extended RBAC represents the access right to privacy data. This component provides the way of control over who can access which privacy and ensures limitation of access quantity of privacy. Based on this extended RBAC, implemented examples are presented and the evaluation is discussed by comparing existed RBAC with extended RBAC.

• Journal of KIISE:Databases
• /
• v.31 no.1
• /
• pp.61-71
• /
• 2004

XML can describe a wide range of data, from regular to irregular and from flat to deeply nested. Thus, XML is rapidly emerging as the do facto standard for the Web document format since XML supports an efficient data exchange and integration. Also, to retrieve the data represented by XML, several XML query languages are proposed. XML query languages such as XPath and XQuery use path expressions to traverse irregularly structured data which comprise B% elements. To evaluate path expressions, various path indexes are proposed. However, traditional path indexes are constructed by utilizing only the XML data structure. Therefore, in this paper, we propose an adaptive path index which utilizes the XML data structure as well as query workloads. To improve the query performance, the adaptive path index proposed by this paper manages the frequently used paths and the structural summary of the XML data using a hash tree and a graph structure. Experimental results show that the adaptive path index improves the query performance typically 2 to 69 times compared with the existing indexes.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.117-134
• /
• 1994

The problems of urban land use are becoming worse by the increase of population and facilities. Land use planning is the major part of comprehensive city plan¬ning. Understanding and forecasting the present and future conditions of land use are the main process of land use planning. In order to comprehend the various phenomena which occured on the land, collecting accurate land information is the most important thing for the effective management of land use. Therefore, it is necessary for us to establish the land information systems. In this study, theories of functions, objectives, components and applications of land information systems were investigated as the basis of this research. Case studies of Korea and Japan were examined, not only for the desirable selection of input data items, but also for the effective land use anslysis in land information systems. Through this kind of study, we can anslize and understand the changing patterns of land use over time, and we can also prepare a more desirable and adjustable land use plan-ning programs for the future.

• Smart Media Journal
• /
• v.5 no.4
• /
• pp.124-130
• /
• 2016

Big data technologies are increasing the need for big data in many areas of the world. Recently, the health care industry has become increasingly aware of the importance of disease and health care services, as it has become increasingly immune to prevention and health care. To do this, we need a Big data system to collect and analyze the personal biometric data. In this paper, we design the biometric big data system using low cost wearable device. We collect basic biometric data, such as heart rate, step count and physical activity from Mi Band, and store the collected biometric data into MongoDB. Based on the results of this study, it is possible to build a big data system that can be used in actual medical environment by using Hadoop etc. and to use it in real medical service in connection with various wearable devices for medical information.

• Journal of Intelligence and Information Systems
• /
• v.14 no.2
• /
• pp.179-192
• /
• 2008

This case study shows constructing the knowledge-based system using a rule-based approach for detecting illegal transactions regarding money laundering in the Korea Financial Intelligence Unit (KoFIU). To better manage the explosive increment of low risk suspicious transactions reporting from financial institutions, the adoption of a knowledge-based system in the KoFIU is essential. Also since different types of information from various organizations are converged into the KoFIU, constructing a knowledge-based system for practical use and data management regarding money laundering is definitely required. The success of the financial information system largely depends on how well we can build the knowledge-base for the context. Therefore we designed and constructed the knowledge-based system for anti-money laundering by committing domain experts of each specific financial industry co-worked with a knowledge engineer. The outcome of the knowledge base implementation, measured by the empirical ratio of Suspicious Transaction Reports (STRs) reported to law enforcements, shows that the knowledge-based system is filtering STRs in the primary analysis step efficiently, and so has made great contribution to improve efficiency and effectiveness of the analysis process. It can be said that establishing the foundation of the knowledge base under the entire framework of the knowledge-based system for consideration of knowledge creation and management is indeed valuable.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.616-619
• /
• 2008

In this paper, we design and implement the authentication system for home network service and applied it to actual sensor nodes. We achieved authentication key, encryption and decryption applied RC5 encryption algorithm of SNEP. In addition, we used pair-wise key pre-distribution for prevention of authentication sniffing in wireless sensor network. The experiment environment consists of a base station receiving data and sensor nodes sending data. Each sensor nodes sends both the data and encrypted authentication key to the base station. As a simulation environment, we assumed some what-if scenarios of security menaces in home network service. And we slightly altered the TOS_Msg construction of TinyOS. The experiences had shown that the malfunction doesn't happen in communication among other groups. And we confirmed in tests that the system is secure when a sensor having malicious propose is added.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.61-68
• /
• 2004

Now, the representative researching trends of view managements for improving the query processing in multi-database system are focused on the materialized view mechanism and the signature view index mechanism. But when we compare with both mechanisms, the former mechanism's access time is faster than one of the latter's, and needs large space. The latter mechanism needs small space and the access time is slower than one of the former. These mechanisms are trade-off each other. Therefore, in case of query process using the view management, we are to improve the system performance and to reduce the access cost of disk input and output by suggesting a new mechanism mixing both the materialized view mechanism and the signature view index mechanism. We suggested that the structure of metadata and the algorithm about the new mired mechanism.

• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.549-561
• /
• 2000

In database management systems(DBMSs), partial rollback is a useful facility that cancels part of the executed operations upon user's requests without a total rollback. Many relational DBMSs(RDBMSs) provide this facility, However, object-orientccd DBMSs (OODBMSs) cannot utilize the previous recovery scl18lne of partial rollback usccd in (RDBMSs) since, unlike RDBMSs, they use a dual buffer consisting of an object buffer and a page buffer. Therefore, a new recovery scheme is required that rolls back the data efficiently in the dual buffer. We propose four partial rollback schemes in OODBMSs that use a dual buffer. We classify the proposed schemes into the single buffer based partial rollback scheme and the dual buffer based partial rollback scheme according to the number of buffers used for partial rollback processing. We further classify them into Uthe page buffer based partial rollback scheme, 2)the object buffccr based partial rollback scheme, 3)the dual buffer based partial rollback scheme using soft log, and 4)the dual buffer based partial rollback scheme using shadows. We evaluate the performance by mathematical analysis and experiments. The results show that the dual buffer based partial rollback scheme using shadows provides the best performance.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.219-230
• /
• 2003

Motion capture technology is widely used to make a realistic motion in these days. So, motion capture data is required to exchange between many animators in a work group. But different motion capture devices have different motion rapture data formats. Thus it is difficult that a animator reuse and exchange motion capture data in a storage. In this paper, we proposes a standard format for integrating a different motion capture data format. In addition, we proposes a framework of a system that manage motion capture data using our standard format. Our standard format is called MCML(Motion Capture Markup Language). It is a markup language for motion capture data and based on XML(extensable Markup Language). Our system to manage motion capture data consists of a several component - MCML Converter, MCML , MCML Editor, Motion Viewer.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.52-63
• /
• 2003

Spatiotemporal moving objects are changing their Positions and/or shape over time in real world. As most of the indices of moving object are based on the R-tree. they have defects of the R-tree which are dead space and overlap. Some of the indices amplify the defects of the R-tree. In the paper, to solve the problems, we propose the MPR-tree(Moving Point R-tree) using Projection operation which has more effective search than existing moving point indices on time slice query and spatiotemporal range query. The MPR-tree connects positions of the same moving objects over time by using linked list, so it processes the combined query about trajectory effectively. The usefulness of the Projection operation is confirmed during processing moving object queries and in practical use of space from experimentation to compare MPR-tree with existing indices of moving objects. The proposed MPR-tree would be useful in the LBS, the car management using GPS, and the navigation system.