• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.5
• /
• pp.383-391
• /
• 2001

The value of XML as electronic documents is increasing nowadays. The XML document has properties of semistructured data. It can be modeled as object-oriented model which can be easily adapted by object-oriented database. For storing XML documents to conventional database system, extracting schema information from the DTD of a XML document has been studied for several years. In this paper we store XML documents into object-oriented database, which preserve the semantics of the documents. We can store and query by OQL and make applications by C++ and make applications by C++ binding which is the access method of object-oriented database. Therefore, existing database applications can be used without modification.

• Korea Journal of Hospital Management
• /
• v.18 no.4
• /
• pp.97-112
• /
• 2013

This study is a proposal of quality scale and measurement for the Mobile Hospital Information System Usability used to the Chungnam National University Hospital in Daejeon Korea. This study is to provide decision- making guideline for hospital managers and to provide feedback for the users' information needs in Mobile Hospital Information System. The target people of the study were medical doctors in Chungnam National University Hospital. The service contexts of usability were request of medical Care, Vital sign check of Patient, Care Agreement of Patient, Blood management, Check of care state, Sign of choice doctors, Query of doctor order and patient measurement result. The Usability factors were the efficiency, effectiveness and satisfaction of quality model ISO9241-11. This study shows that the Mobile HIS is used for the communication and education between doctor and patients. Especially, The Care Agreement of Patient is a part of the most utilized in the Mobile HIS.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.147-158
• /
• 1996

This paper proposed a concurrency control structure based on specialized data flow graphs that was analysed a run-time concurrency control activity to be integrated with the task scheduler Data were viewed as flowing on the arcs from one node to another in a stream of discrete to tokens. The network that Is based upon the Entity-Relationship model, can be viewed a fixed problems used query tokens as a data flow graph. The performance was measured used in the various expriments compared the overall performance of the different concurrency control methods, DBFG (DataBase Flow graphs) scheduling had the knowledge to obtain better performance than 2PL in a distributed environment.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.911-918
• /
• 2002

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.765-772
• /
• 2005

For the excellent U web services, the program developers should create both user's client program and the sewer program Recently, the structural alteration of programs are often caused by infernal and external environment concerned with social trends and preferences as well as user's requirements expectations. So, for reducing the development time and workload of XML web service programs, it is necessary to develop the web program generation tools. This paper suggest how to design and implement the web-based XML Tree builder, which was able to provide the information for promptly and easily generating the XML Schema, XML Stylesheet and XML Document through the XML Development Supporting Server System.

• Korea Information Processing Society Review
• /
• v.11 no.6
• /
• pp.56-75
• /
• 2004

In this article we address some system characteristics and challenging issues in developing Context-aware Middleware for Ubiquitous Computing. The functionalities of a Context-aware Middleware includes gathering context data from hardware/software sensors, reasoning and inferring high-level context data, and disseminating/delivering appropriate context data to interested applications/services. The Middleware should facilitate the query, aggregation, and discovery for the contexts, as well as facilities to specify their privacy policy. Following a formal context model using ontology would enable syntactic and semantic interoperability, and knowledge sharing between different domains. Moddleware should also provide different kinds of context classification mechanical as pluggable modules, including rules written in different types of logic (first order logic, description logic, temporal/spatial logic, fuzzy logic, etc.) as well as machine-learning mechanical (supervised and unsupervised classifiers). Different mechanisms have different power, expressiveness and decidability properties, and system developers can choose the appropriate mechanism that best meets the reasoning requirements of each context. And finally, to promote the context-trigger actions in application level, it is important to provide a uniform and platform-independent interface for applications to express their need for different context data without knowing how that data is acquired. The action could involve adapting to the new environment, notifying the user, communicating with another device to exchange information, or performing any other task.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.481-490
• /
• 2006

In a super-peer based P2P network, The network is clustered and each cluster is managed by a special peer, called a super-peer which has information of all peers in its cluster. This clustered P2P model is known to have efficient information search and less traffic load. In this paper, we first estimate the message traffic cost caused by peer's query, join and update actions within a cluster as well as between the clusters and with these values, we present the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.rks.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.9
• /
• pp.85-94
• /
• 2004

As over 70% of the total life cycle cost (LCC) of a product is committed at the early design stage, designers are in an important position to substantially reduce the LCC of the products they design by giving due to life cycle implications of their design decisions. During early design stages, there may be competing concepts with dramatic differences. In addition, the detailed information is scarce and decisions must be made quickly. Thus, both the overhead in developing parametric LCC models fur a wide range of concepts, and the lack of detailed information make the application of traditional LCC models impractical. A different approach is needed, because a traditional LCC method is to be incorporated in the very early design stages. This paper explores an approximate method for providing the preliminary LCC, Learning algorithms trained to use the known characteristics of existing products might allow the LCC of new products to be approximated quickly during the conceptual design phase without the overhead of defining new LCC models. Artificial neural networks are trained to generalize product attributes and LCC data from pre-existing LCC studies. Then the product designers query the trained artificial model with new high-level product attribute data to quickly obtain an LCC for a new product concept. Foundations fur the learning LCC approach are established, and then an application is provided.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.62-65
• /
• 2010

Image annotations allow users to access a large image database with textual queries. But since the surrounding text of Web images is generally noisy. an efficient image annotation and retrieval system is highly desired. which requires effective image search techniques. Data mining techniques can be adopted to de-noise and figure out salient terms or phrases from the search results. Clustering algorithms make it possible to represent visual features of images with finite symbols. Annotationbased image search engines can obtains thousands of images for a given query; but their results also consist of visually noise. In this paper. we present a new algorithm Double-Circles that allows a user to remove noise results and characterize more precise representative annotations. We demonstrate our approach on images collected from Flickr image search. Experiments conducted on real Web images show the effectiveness and efficiency of the proposed model.

• Korean Journal of Remote Sensing
• /
• v.26 no.2
• /
• pp.133-142
• /
• 2010

As diverse web-based geos-spatial services are developed, the values of technologies and standards related to this trend are also emphasized. In this study, a prototype supporting mandatory components in OGC standard catalog service is designed and implemented, linked to PostgreSQL, open source DBMS. As the main features, XML metadata server was built with the helps of XML query functions in PostgreSQL. Given target applications with geo-spatial data sources and contents, this model can be applied, and it can be used for extension in other external web-based service systems or applications, because it supports international standard specifications.