• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.146.1-146
• /
• 2001

The researches of science and engineering need the latest information from internet resources. But searching and filtering processes of appropriate web documents from huge internet resources are very complex as well as having some repeated procedures. In this paper, I propose a Personalized Agent System(PAS), which can filter World Wide Web Documents that the user is interested, such as papers. To do this, PAS uses a modified spreading activation neural network which 1 propose here. PAS observes the user´s local paper database to analyze, adapt and learn the user interests, and the then constructs the user-specified neural network model by the analyzed interests ...

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.78-80
• /
• 1999

멀티데이터베이스를 구축하기 위해서는 전역스키마 (global schema) 구축이 필수적이며, 지역스키마(local schema) 간 충돌 해결과 스키마 통합 정보는 질의 처리 및 질의 결과를 사용자에게 보여주기 위해 필요하다. 전역스키마 생성 및 충돌 해결 방법은 많이 연구가 되어 왔다. 하지만, 스키마 통합을 위한 정보가 어떻게 표현되고, 어떻게 사용되는지에 대한 연구는 부족하다. 본 논문에서는 지역스키마와 전역스키마를 XML DTD 및 XML 문서로 표현하고, 이를 이용하여 멀티데이터베이스를 위한 스키마 통합 방법을 제안한다. 스키마 통합정보와 멀티데이터베이스와 지역데이터베이스들간 데이터교환을 XML을 이용함으로써 이기종간 데이터 교환이 쉽고, 멀티데이터베이스 시스템의 확장 및 다른 시스템으로의 전환이 용이하게 된다.

• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.439-449
• /
• 2005

Distributed main memory database management systems (DMM-DBMSs) store the database in main memories of the participating sites. They provide high performance through fast access to the local databases and high speed communication among the sites. Recently, a lot of research results on DMM- DBMSs has been reported. However, to the best of our knowledge, there is no known research result on the performance of the catalog management schemes for DMM-DBMSs. In this work, we evaluated the performance of the partitioned catalog management schemes through experimental analysis. First, we classified the partitioned catalog management schemes into three categories : Partitioned Catalogs Without Caching (PCWC), Partitioned Catalogs With Incremental Caching (PCWIC), and Partitioned Catalogs With Full Caching (PCWFC). Experiments were conducted by varying the number of sites, the number of terminals per site, buffer size, write query ratio, and local query ratio. Experiments show that PCWFC outperforms the other two schemes in all cases. It also means that the performance of PCWIC gradually increases as time goes by. It should be noted that PCWFC does not guarantee high performance for disk-based distributed DBMSs in cases when the workload of individual site is high, catalog write ratio is high, or remote data objects are accessed very frequently. Main reason that PCWFC outperforms for DMM-DBMSs is that query compilation and remote catalog access can be done in a very high speed, even when the catalogs of the remote data objects are frequently updated.

• Asian Pacific Journal of Cancer Prevention
• /
• v.16 no.1
• /
• pp.259-263
• /
• 2015

Background: In the field of cancer, the ICD-10 coding convention is based on the site of a neoplasm in the body and usually ignores the morphology, thus the same code may be assigned to tumors of different morphologic types in an organ. Nowadays, all general (provincial) and center hospitals in Thailand are equipped with the hospital information system (HIS) database. Objective: This study aimed to find the characteristics and magnitude of agreement represented by the positive predictive value (PPV) of provisional cancer diagnoses in the HIS database in Pattani Hospital in Thailand in comparison with the final cancer diagnosis of the ICD-10 codes generated from a well established cancer registry in Songklanagarind Hospital, the medical school hospital of Prince of Songkla University. Materials and Methods: Data on cancer patients residing in Pattani province who visited Pattani Hospital from January 2007 to May 2011 were obtained from the HIS database. The ICD-10 codes of the HIS computer database of Pattani Hospital were compared against the ICD-10 codes of the same person recorded in the hospital-based cancer registry of Songklanagarind Hospital. The degree of agreement or positive predictive value (PPV) was calculated for each sex and for both sexes combined. Results: A total of 313 cases (15.9%) could be matched in the two databases. Some 222 cases, 109 males and 113 females, fulfilled the criteria of referral from Pattani to Songklanagarind Hospitals. Of 109 male cancer cases, 76 had the same ICD-10 codes in both hospitals, thus, the PPV was 69.7% (95%CI: 60.2-78.2%). Agreement in 76 out of 113 females gave a PPV of 67.3% (95%CI: 57.8-75.8%). The two percentages were found non-significant with Fisher's exact p-value of 0.773. The PPV for combined cases of both sexes was 68.5% (95%CI: 61.9-74.5%). Conclusions: Changes in final diagnosis in the referral system are common, thus the summary statistics of a hospital without full investigation facilities must be used with care, as the statistics are biased towards simple diseases able to be investigated by available facilities. A systematic feedback of patient information from a tertiary to a referring hospital should be considered to increase the accuracy of statistics and to improve the comprehensive care of cancer patients.

• Journal of Broadcast Engineering
• /
• v.21 no.1
• /
• pp.51-59
• /
• 2016

This paper presents a method of DCT-based illuminant compensation to enhance the accuracy of face recognition under an illuminant change. The basis of the proposed method is that the illuminant is generally located in low-frequency components in the DCT domain. Therefore, the effect of the illuminant can be compensated by controlling the low-frequency components. Moreover, a directional high-order local pattern descriptor is used to detect robust features in the case of face motion. Experiments confirm the performance of the proposed algorithm got up to 95% when tested using a real database.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05b
• /
• pp.325-330
• /
• 1996

The existing CHF correlations for internally heated concentric annulus channels are assessed using KAIST CHF database for uniformly heated vertical annuli. Six annulus correlations (Jannsen-Kervinen. Barnett, Levitan-Lantsman, Kumamaru et al., Doerffer et al., and Bobkov et at.) are chosen for assessment based on literature survey and Groeneveld et al.'s CHF table for round tube is also assessed for comparison. Among the above correlations, two are inlet-condition type and others local conditions type. To make the comparison meaningful, the local-condition-type correlations are assessed in two ways: direct substitution method (DSM) and heat balance condition method (HBM). Totally 1174 data are classified into 10 groups based on pressure and mass flux conditions and correlations are assessed to each group separately. Prediction capability of each correlation depends on the data group and none shows the best prediction over the entire group. In overall, the correlations by Doerffer et al. and Jannsen et al. appear to be the best, but Barnett or Levitan-Lantsman correlations also show reasonable prediction for most groups. However, the low-pressure, ]ow flow CHFs are not well predicted by any correlations. The CHF table for round tubes overpredicts the CHF in annuli at fixed local conditions.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.121-128
• /
• 2004

This paper proposes a quality evaluation system of a handwriting string written by electronic pen. For the purpose of the system, this paper describes how to retrieve reference data from a database, how to evaluate the quality of a handwiting string using global and local features. Also, it explains how to optionally recognize a grade of a handwriting string at using global and how to diagnose stroke order at using local. The quality can be evaluated in the case of different language between reference and input by the system. Therefore, we expect that the system is very useful not only for training on handwriting but also for learning a language.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.131-146
• /
• 2021

Multimodal biometric-based recognition has been an active topic because of its higher convenience in recent years. Due to high user convenience of finger, finger-based personal identification has been widely used in practice. Hence, taking Finger-Print (FP), Finger-Vein (FV) and Finger-Knuckle-Print (FKP) as the ingredients of characteristic, their feature representation were helpful for improving the universality and reliability in identification. To usefully fuse the multimodal finger-features together, a new robust representation algorithm was proposed based on hierarchical model. Firstly, to obtain more robust features, the feature maps were obtained by Gabor magnitude feature coding and then described by Local Binary Pattern (LBP). Secondly, the LGBP-based feature maps were processed hierarchically in bottom-up mode by variable rectangle and circle granules, respectively. Finally, the intension of each granule was represented by Local-invariant Gray Features (LGFs) and called Hierarchical Local-Gabor-based Gray Invariant Features (HLGGIFs). Experiment results revealed that the proposed algorithm is capable of improving rotation variation of finger-pose, and achieving lower Equal Error Rate (EER) in our homemade database.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.3
• /
• pp.143-154
• /
• 2011

SQLite is a small sized database engine largely used in embedded devices and local application software. The availability of portable devices, such as smartphones, has been extended over the recent years and has contributed to growing adaptation of SQLite. This implies a high likelihood of digital evidences acquired during forensic investigations to include SQLite database files. Where intentional deletion of sensitive data can be made by a suspect, forensic investigators need to recover deleted records in SQLite at the best possible. This study analyzes data management rules used by SQLite and the structure of deleted data in the system, and in turn suggests a recovery Tool of deleted data. Further, the study examines major SQLite suited software as it validates feasible possibility of deleted data recovery.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.