• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.115-124
• /
• 2006

XML is rapidly becoming technologies for information exchange and representation. It causes many research issues such as semantic modeling methods, security, conversion far interoperability with other models, and so on. Especially, the most important issue for its practical application is how to achieve the interoperability between XML model and relational model. Until now, many suggestions have been proposed to achieve it. However several problems still remain. Most of all, the exiting methods do not consider implicit referential integrity relations, and it causes incorrect data delivery. One method to do this has been proposed with the restriction where one semantic is defined as only one same name in a given database. In real database world, this restriction cannot provide the application and extensibility. This paper proposes a noble conversion (RDB-to-XML) algorithm based on the similarity checking technique. The key point of our method is how to find implicit referential integrity relations between different field names presenting one same semantic. To resolve it, we define an enhanced implicity referentiai integrity relations extraction algorithm based on a widely used ontology, WordNet. The proposed conversion algorithm is more practical than the previous-similar approach.

• The Journal of Society for e-Business Studies
• /
• v.14 no.2
• /
• pp.95-116
• /
• 2009

Ontologies have provided supports in integrating heterogeneous and distributed information. More and more ontologies and tools have been developed in various domains. However, building ontologies requires much time and effort. Therefore, ontologies need to be shared and reused among users. Specifically, finding the desired ontology from an ontology repository will benefit users. In the past, most of the studies on retrieving and ranking ontologies have mainly focused on lexical level supports. In those cases, it is impossible to find an ontology that includes concepts that users want to use at the semantic level. Most ontology libraries and ontology search engines have not provided semantic matching capability. Retrieving an ontology that users want to use requires a new ontology selection and ranking mechanism based on semantic similarity matching. We propose an ontology selection and ranking model consisting of selection criteria and metrics which are enhanced in semantic matching capabilities. The model we propose presents two novel features different from the previous research models. First, it enhances the ontology selection and ranking method practically and effectively by enabling semantic matching of taxonomy or relational linkage between concepts. Second, it identifies what measures should be used to rank ontologies in the given context and what weight should be assigned to each selection measure.

• Fashion & Textile Research Journal
• /
• v.11 no.5
• /
• pp.741-752
• /
• 2009

As a major obstacle to active online purchase at the level of consumer in China, distrust is raised in this study. Most of previous studies showed that trust is a major variable to cause a relational unity between company and consumer, on the other hand, this study attempts to show that according to the two dimensional point of view regarding trust each dimension of both trust and distrust distinctly contributes to marketing achievement. Interaction, perceived popularity, information usefulness, perceived security risk and perceived dealing risk were created as preceding variable, trust and distrust were constituted as parameter and relation absorption and purchase intention as consequential variable. These variables were analyzed with structural equation modeling (SEM) in LISREL 8.3 program. The results for this study are as follows. First, relation between exchange actors in marketing is divided into two concepts of trust and distrust differently from the previous studies. On the assumption that trust and distrust might exist simultaneously and they would distinctly have an influence on marketing consequency such as relation absorption and repurchase intention, it is identified that trust and distrust are a different dimension in online context. Second, the formative factor of online trust-distrust is identified and it is shown what relationship between internet shopping mall and relation absorption and foregoing purchase intention resulting from online trust-distrust exists. Third, it is shown that in online context the formative factor of online trust-distrust is distinctly contributed to relation absorption and repurchase intention. It is suggested that trust needs to be managed two-dimensionally separating from trust and distrust. Fourth, it is shown that both trust and distrust factor in terms of relation absorption and repurchase intention of consumer in internet shopping mall are significant variables. Trust is linked with repurchase intention through relation absorption, however, distrust is not directly linked with repurchase intention through relation absorption. Thus, the ripple effect of distrust appears to be much higher than that of trust.

• Journal of Internet Computing and Services
• /
• v.15 no.1
• /
• pp.63-71
• /
• 2014

Currently many non-traditional application areas such as artificial intelligence and web databases require advanced modeling power than the existing relational data model. In those application areas, object-oriented database (OODB) is better data model since an OODB can providemodeling power as grouping similar objects into class, and organizing all classes into a hierarchy where a subclass inherits all definitions from its superclasses. The purpose of this paper is to develop an OODB concurrency control scheme dealing with multiple inheritance. The proposed scheme, called Multiple Inheritance Implicit Locking (MIIL), is based on so-called implicit locking. In the proposed scheme, we eliminate redundant locks that are necessary in the existing implicit locking scheme. Intention locks are required as the existing implicit locking scheme. In this paper, it is shown that MIIL has less locking overhead than implicit locking does. We use only OODB inheritance hierarchies, single inheritance and multiple inheritance so that no additional overhead is necessary for reducing locking overhead.

• 한국HCI학회:학술대회논문집
• /
• 2006.02b
• /
• pp.377-382
• /
• 2006

본 연구의 주제는 정보의 관계를 사용자 중심으로 시각화하는 것이다. 생활속에서 제공되는 대부분의 정보들은 보이지 않는 연결성을 가지고 있다. 이런 정보들의 공통적인 특성 및 관계의 연구를 통해 정보의 중요도를 측정할 수 있고, 각 정보의 개체 간의 연결성이 형성되어 인접정보의 접근이 용이해진다. 특히 인간관계는 사회 연결망의 주된 관심사이며, 사회의 각 개체 간 관계를 분석하여 도식화하는 여러 방법론이 제시되어 있다. 이번 연구를 위하여 제한된 사회라고 볼 수 있는 그리스 신화를 소재로 선정하여 등장인물들 간의 관계를 파악하는데 사회연결망 이론을 적용하였다. 하지만 시각화 측면에서 볼 때 현재 제공되는 사회 연결망 분석 도구는 사용자를 고려한 디자인 부분이 배제되어 단순히 정보를 일방적으로 보여준다는 한계를 지니고 있다. 미톨로지아에서는 분석된 자료를 바탕으로 사용자가 정보를 파악하는데 좀더 효과적이고 용이한 시각적인 구성을 가질 수 있도록 시도했다. 사회 연결망 분석법으로 그리스 신화의 인물들이 가진 신분, 출현 빈도, 감정관계 등을 수치화하여 인물의 연결성을 분석하였다. 또한 정보와 사용자 간의 상호작용 기능을 제공함으로써 사용자의 이해도를 높였다. 기본 인터페이스는 인물노드에 쉽게 접근할 수 있도록 4 가지 분류에 의한 인덱스의 형태를 가지며, 인물 간의 세밀한 관계는 선택에 의한 줌-인(zoom in) 기능을 통해 볼 수 있다. 이는 기존의 필터링 기능과는 차별적인 요소로서 직접 관련된 정보 이외의 정보들은 시각적으로 제한되어 사용자가 인물 관계를 빠르고 직관적으로 파악할 수 있다. 미톨로지아는 개괄적인 관계를 보여주는 레이아웃과 부분적이며 상세한 정보를 파악하기에 적합한 인터랙션 방법을 제시한다.

• 한국IT서비스학회:학술대회논문집
• /
• 2002.06a
• /
• pp.96-107
• /
• 2002

21세기를 맞이하는 기업은 세계화와 국제화, 정보의 다양화 및 분산화, 제품수명주기의 단축과 수익률의 감소, 고품질의 제품, 지식산업의 등장, 고객 욕구의 증대 등 다양한 내 ${\cdot}$ 외적 환경변화에 대응해야 하고 경쟁우위를 확보하기 위해 끊임없이 기업의 변화능력을 확보해야 한다. 기업은 제품을 생산하여 판매하는 기업의 시스템 전체가 경쟁력을 갖추어 총체적 우위를 확보하고 고객의 기호와 감성에 호소하는 제품을 만들 수 있도록 다양한 정보를 제공하는 시스템을 필요로 하게 되었다. 즉, 시간과 서비스에 뒤진 고객지원체계는 기업의 성장에 절대적인 마이너스 요인이므로 고객 정보의 효율적 관리, 고객 요구에 대한 신속한 대응, 정기적 고객만족도 조사 등 고객이 원하는 것을 재빠르게 얻어낼 수 있는 고객 친밀형 정보시스템의 확립이 요구되는 것이다. 이를 해결해 줄 수 있는 새로운 경영정보시스템이 바로 WebERP인 것이다. WebERP는 기업의 원활한 자재, 구매활동을 위해 제안된 MRP에서 시작되었으며, 생산관리의 개념을 포함하고 있는 MRPII로 확대되었다가 다시 인사나 회계, 재무 등 조직이나 기업의 전업무영역을 수용하는 종합경영정보시스템으로 발전된 것이다. 현재는 전자상거래와 관련하여 WebERP의 필요성이 부각되었고, 모기업과 협력사간의 구매발주 및 납품관리를 확대시켜 소모성자재(MRO: Maintenance, Repair & Operation) 및 기타 공동구매서비스와 유사업종간의 그룹을 형성하여 ASP(Application Service Provider)의 공동 환경을 이용한 WebERP 환경을 이용한 WebERP활용이 현시점으로 적실히 필요한 것이다. 이는 중소기업들의 공동 협업체제를 도모하여 외세를 대비하는 응집력을 확고히 함으로써 집단체제의 e마켓플레이스 확립과 더불어 국제경쟁을 대비한 방안으로서 집단 공동의 웹환경 인프라가 필요한 것이다. 이러한 배경에서 ASP환경을 이용한 WebERP활용방안과 시스템 구축전략을 경남지역의 기계산업정보화사업단이 추진하는 일반기계, 전기기계, 금속기계, 수송기계, 정밀기계의 5개 업종을 4,877개 기업 대상으로 추진하고 있으며, 그 중 WebERP의 모델로서 2003년도까지 50개 기업을 선정하고, 이는 5개 업종 골고루 선정하여 적용과 표준화 모델로 전개해 나가는 것을 정리한 것이다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.984-989
• /
• 2005

This study aims to identify grammatical relations (GRs) in Korean sentences. The key task is to find the GRs in sentences in terms of such GR categories as subject, object, and adverbial. To overcome this problem, we are fared with the many ambiguities. We propose a statistical model, which resolves the grammatical relational ambiguity first, and then finds correct noun phrases (NPs) arguments of given verb phrases (VP) by using the probabilities of the GRs given NPs and VPs in sentences. The proposed model uses the characteristics of the Korean language such as distance, no-crossing and case property. We attempt to estimate the probabilities of GR given an NP and a VP with Support Vector Machines (SVM) classifiers. Through an experiment with a tree and GR tagged corpus for training the model, we achieved an overall accuracy of $84.8\%,\;94.1\%,\;and\;84.8\%$ in identifying subject, object, and adverbial relations in sentences, respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.707-711
• /
• 2010

Most relational database systems provide $B^+$-trees as their main index structures, and use bulk-loading techniques for creating new $B^+$-trees on existing data from scratch. Although bulk loadings are more effective than inserting keys one by one, they are still time-consuming because they have to sort all the keys from large data. To improve the performance of bulk loadings, this paper proposes an efficient parallel bulk loading method for $B^+$-trees based on CUDA, which is a parallel computing architecture developed by NVIDIA to utilize computing powers of graphic processor units for general purpose computing. Experimental results show that the proposed method enhance the performance more than 70 percents compared to existing bulk loading methods.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.333-344
• /
• 2008

In recent years, the web services composition has received much attention. By web services composition, we mean providing a new service that does not exist on the repository. In this paper, we propose a new system called PSR for web services composition search using a relational database. We also propose algorithms for pre-computing web services composition using joins and indices. We store ontologies from web services in RDBMS, so that the PSR system returns web services composition in order of similarity with user query through the degree of the ontology matching. We demonstrated that our pre-computing web services composition approach in RDBMS yields lower execution time and good scalability when handling a large number of web services and user queries.

• Journal of Korean Society of Rural Planning
• /
• v.9 no.1 s.18
• /
• pp.85-93
• /
• 2003

Many features of the Single Field version have been enhanced to provide user friendly interface. The County/Watershed version of NAPRA WWW system was further enhanced. The newly developed Web GIS version is an ideal tool for novice users, such as farmers, to simulate the effects of agricultural management for their farms because of its easy-to-use Web GIS interface. The NAPRA WWW system provides an easy to use WWW interface and uses spatial and relational databases to simplify the process of preparing model files. Thus, the NAPRA WWW systems now can be effectively used for nutrient management as well as pesticide management to identify the least impact agricultural management practices.