• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.665-671
• /
• 2013

Even though a dual lens stereoscopic camera allows for convenient stereoscopic photography, the necessity for the research comes up, since the dual lens stereoscopic camera can cause visual discomfort during zoom-in due to the fixed convergence point. We propose a method based on which a convergence point can be adjusted to prevent visual discomfort during zoom-in for a dual lens stereoscopic camera. First, the relational model is classified into nine kinds and defined, depending on locations of focus, object, and convergence point. And then, the method to minimize visual discomfort is suggested by adjusting convergence point on the given model. We also implement the suggested methods with anaglyph computer graphic and demonstrate the superiority of them.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1419-1432
• /
• 1999

The Document Management System(DMS) is a system which retrieves and manages library information efficiently. Since DMS manages the information using only one table, it does not need to provide join and view operations that spend high cost in traditional DBMS. In addition, DMs requires new operations because of their property. the operation has not been supported in existing DBMSs. In this paper we define a data language which represents the structure definition and process of data on the DMS. Especially we define Ranking and Proximity operation which is needed in Document Retrieval,. We also design and implement a query processor to process the query constructed with the data language. When the exiting query processors of relational DBMS are used as a query processor of DMS, they degrade the whole system performance. The proposed query processor not only overcomes such a problem but also supports new operation which is needed in DMS.

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.45-56
• /
• 2003

In the wireless environment, according to the development of technology, which is able to obtain location information of spatiotemporal moving object, the various application systems are developed such as vehicle tracking system, forest fire management system and digital battle field system. These application systems need the data model, which is able to represent and process the continuous change of moving object. However, if moving objects are expressed by a relational model, there is a problem which is not able to store all location information that changed per every time. Also, existing data models of moving object have a week point, which constrain the query time to the time that is managed in the database such as past or current and near future. Therefore, in this paper, we propose a data model, which is able to not only express the continuous movement of moving point and moving region but also process the operation at all query time by using shape-change process and location determination functions for past and future. In addition, we apply the proposed model to forest fire management system and evaluate the validity through the implementation result.

• 한국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:Databases
• /
• v.30 no.2
• /
• pp.176-183
• /
• 2003

Various techniques including histograms, sampling and parametric techniques have been proposed to estimate query result sizes for the query optimization. Histogram-based techniques are the most widely used form for the selectivity estimation in relational database systems. However, in the spatio-temporal databases for the moving objects, the continual changes of the data distribution suffer the direct utilization of the state of the art histogram techniques. Specifically for the future queries, we need another methodology that considers the updated information and keeps the accuracy of the result. In this paper we propose a novel approach based upon the duality and the marginal distribution to construct a histogram with very little time since the spatio-temporal histogram requires the data distribution defined by query predicates. We use data synopsis method in the dual space to construct spatio-temporal histograms. Our method is robust to changing data distributions during a certain period of time while the objects keep the linear movements. An additional feature of our approach supports the dynamic update incrementally and maintains the accuracy of the estimated result.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.77-82
• /
• 2016

This paper presents the development of the Korean medicine symptom diagnosis system. In the Korean medicine symptom diagnosis system, the patient explains their symptoms and an oriental doctor makes a diagnosis based on the symptoms. Natural language processing is required to make a diagnosis automatically through the patients' reports of symptoms. We use morphological analysis to get understandable information from the natural language itself. We developed a diagnosis system that consists of NoSQL document-oriented databases-MongoDB. NoSQL has better performance at unstructured and semi-structured data, rather than using Relational Databases. We collect patient symptom reports in MongoDB to refine difficult medical terminology and provide understandable terminology to patients.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.141-152
• /
• 2007

Selectivity estimation has been a crucial component in query optimization in relational databases. While extensive researches have been done on this topic for the predicates of numerical data, only little work has been done for substring predicates. We propose novel suffix tree transform algorithms for this problem. Unlike previous approaches where a full suffix tree is pruned and then an estimation algorithm is employed, we transform a suffix tree into a suffix graph systematically. In our approach, nodes with similar counts are merged while structural information in the original suffix tree is preserved in a controlled manner. We present both an error-bound algorithm and a space-bound algorithm. Experimental results with real life data sets show that our algorithms have lower average relative error than that of the previous works as well as good error distribution characteristics.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.6
• /
• pp.2945-2957
• /
• 2013

This study was conducted to investigate factors contributing to Evidence-Based Practice Readiness(Knowledge/Skill, Attitudes, Organizational culture) for nurses. A descriptive correlational study design was used. The data were collected from Mar. 21 to Mar. 29 of 2013. The subject were 160 nurses who were working in the 2 Tertiary General Hospital. Factors influencing EBP Knowledge/Skill were critical thinking disposition, which explained about 34.7% of total variance. and EBP Attitudes were EBP Knowledge/Skill, surgical unit, Which explained about 14.2% of total variance. and Organizational culture for EBP were Innovation-oriented culture, Relational-oriented culture, Which explained about 24.6% of total variance. Therefore, For introduction and activated of EBP, Nursing organization-dimentional required at the critical thinking disposition and EBP Knowledge/Skill training programs development and to be applied. Also, Systematic support system for the nursing organization to create a culture of Innovation-oriented culture is required.

• 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.