• Journal of Life Science
• /
• v.10 no.2
• /
• pp.188-195
• /
• 2000

In order to understand molecular events during silk synthesis and provide genetic resources for molecular breeding, we had analyzed the cDNA library constructed from the posterior silkgland of Antheraea yamamai and partially sequenced 276 randomly selected genes from the cDNA library. Database comparisons of the expressed sequence tags (ESTs) revealed that 26 non-redundant clones showed a high similarity with previously identified genes. Among them, 17 clones exhibited a homology with previously identified insect genes and 9 clones were identical to genes that were previously identified from other organisms. A functional categorization showed that silk synthesis-defense- or stress-related genes, as well as genes involved in the metabolic pathways and in the transcriptional or translational apparatus are represented. In this report, the clone (AY479) which had high similarity with fibroin from A. pernyi was particularly analyzed in detail. The AY479 clone was carboxyl terminal region of fibroin. The 472 bp cDNA has 123 amino acids that shared 85% homology with the fibroin from A. pernyi and its deduced peptide had unique feature, that is, sites of alanine rich residues.

• Journal of the Korean Society for Library and Information Science
• /
• v.36 no.1
• /
• pp.61-90
• /
• 2002

This study intends to evaluate the quality of the KERIS UNICAT DB, and to suggest both theoretical and practical methods for the quality improvement of the DB. To the end. this study developed a quality evaluation model and verified the quality of the UNICAT DB in a comprehensive way, Emphasis was on analyzing the factors causing such inferior and substandard bibliographic records in the UNICAT DB. Also suggested are the management strategies and substantial guidelines to improve the quality of the UNICAT DB.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.424-428
• /
• 2004

Study related to a system that saves a n document, and to search is consisting actively and has a lot of cases to have left emphasis in the function that these systems efficiently save a XML document and can search. Also, It has a table or the storage structure which was especially designed in order to save a XML document and can save structure information of a document in addition to contents of a XML document together and can efficiently do content retrieval of a XML document or a structure search with an early base. As for this paper, a design implemented the data which the many different kinds of database that had currently used had with you so that did recycling and shared conversion and this XML file in Web, and output can become a XML format through various interrace.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.31-34
• /
• 2004

회복기법은 비공유 공간 데이터베이스 클러스터에서 고가용성을 위해 매우 중요하게 고려되고 있다. 일반적으로 데이터베이스 클러스터의 회복기법은 노드의 오류가 발생한 경우 로컬 로그와는 별도로 클러스터 로그를 생성하며, 이를 기반으로 해당 노드에서의 회복과정을 수행한다. 그러나, 기존의 기법은 하나의 레코드를 위해 다수의 갱신정보를 유지함으로써 클러스터 로그의 크기가 증가되고, 전송비용이 증가된다. 이는 회복노드에서 하나의 레코드에 대해 여러 번의 불필요한 연산을 실행하여 회복시간이 증가되고, 전체적인 시스템의 부하를 증가시키는 문제를 발생시킨다. 본 논문에서는 비공유 공간 데이터베이스 클러스터에서 최신버전의 클러스터 로그를 이용한 회복기법을 제안한다. 제안기법에서의 최신버전의 클러스터 로그는 레코드의 변경사항과 실제 데이터를 가리키는 포인터 정보로 구성되고, 하나의 갱신정보를 유지함으로써 클러스터 로그의 크기가 감소하며, 전송비용이 감소한다. 회복노드에서는 하나의 레코드에 대해 한번의 갱신연산만 실행하므로 빠른 회복이 가능하며, 시스템의 가용성을 향상시킨다.

• Journal of Information Science Theory and Practice
• /
• v.9 no.2
• /
• pp.47-65
• /
• 2021

This study aims to identify specific topics, trends, and structural characteristics of scholarly communication research, based on 1,435 articles published from 1970 to 2018 in the Scopus database through Latent Dirichlet Allocation topic modeling, serial analysis, and network analysis. Topic modeling, time series analysis, and network analysis were used to analyze specific topics, trends, and structures, respectively. The results were summarized into three sets as follows. First, the specific topics of scholarly communication research were nineteen in number, including research resource management and research data, and their research proportion is even. Second, as a result of the time series analysis, there are three upward trending topics: Topic 6: Open Access Publishing, Topic 7: Green Open Access, Topic 19: Informal Communication, and two downward trending topics: Topic 11: Researcher Network and Topic 12: Electronic Journal. Third, the network analysis results indicated that high mean profile association topics were related to the institution, and topics with high triangle betweenness centrality, such as Topic 14: Research Resource Management, shared the citation context. Also, through cluster analysis using parallel nearest neighbor clustering, six clusters connected with different concepts were identified.

• Health Policy and Management
• /
• v.13 no.1
• /
• pp.98-115
• /
• 2003

Concerns about growing health insurance expenditures became a national Issue in 2001 when the National Health Insurance went into a deficit. Increases in spending for ambulatory care shared the largest portion of the problem. Methods and systems to control the spending should be developed and a system to measure case mix of providers is one of core components of the control system. The objectives of this article is to examine the feasibility of applying Korean Diagnosis Related Groups (KDRGs) to classify health insurance claims for ambulatory care and to identify problem areas of the classification. A database of 11,586,270 claims for ambulatory care delivered during January 2002 was obtained for the study, and the final number of claims analyzed was 8,319,494 after KDRG numbers were assigned to the data and records with an error KDRG were excluded from the study. The unit of analysis was a claim and resource use was measured by the sum of charges incurred during a month at a department of a hospital of at a clinic. Within group variance was assessed by th coefficient of variation (CV), and the classification accuracy was evaluated by the variance reduction achieved by the KDRG classification. The analyses were performed on both all and non-outlier data, and on a subset of the database to examine the validity of study results. Data were assigned to 787 KDRGs among 1,244 KDRGs defined in the classification system. For non-outlier data, 77.4％ of KDRGs had a CV of charges from tertiary care hospitals less than 100％ and 95.43％ of KDRGs for data from clinics. The variance reduction achieved by the KDRG classification was 40.80％ for non-outlier claims from tertiary care hospitals, 51.98％ for general hospitals, 40.89% for hospitals, and 54.99% for clinics. Similar results were obtained from the analyses performed on a subset of the study database. The study results indicated that KDRGs developed for a classification of inpatient care could be used for ambulatory care, although there were areas where the classification should be refined. Its power to predict tile resource utilization showed a potential for its application to measure case mix of providers for monitoring and managing delivery of ambulatory care. The issue concerning the quality of diagnostic information contained in insurance claims remains to be improved, and significance of future studies for other classification systems based on visits or episodes is guaranteed.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.347-360
• /
• 2001

The most expensive spatial operation in spatial databases is a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisfying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved, the response time is not tolerable because of not meeting the requirements of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. However, as the number of processors increases, the efficiency of each processor decreases rapidly because of the disk bottleneck and the overhead of message passing. This paper proposes the method of task allocation to soften the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing among processors. In order to evaluate the performance of the proposed method in terms of the number of disk accesses and message passing, we conduct experiments on the two kinds of parallel spatial join algorithms. The experimental tests on the MIMD parallel machine with shared disks show that the proposed semi-dynamic task allocation method outperforms the static and dynamic task allocation methods.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.459-470
• /
• 2003

It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.197-208
• /
• 2003

Abstract Workflow is not appropriately applied to coordinated execution of applications(steps) that comprise business process such as a collaborative series of tasks because of the lacks of network infra, standard of information exchange and data consistency management with conflict mode of shared data. Particularly we have not mentioned the problem which can be occurred by shared data with conflict mode. In this paper, to handle data consistency in the process of rollback for failure handling or recovery policy, we have classified rollback dependency into three types such as implicit rollback dependency in a transactional workflow, implicit rollback dependency in collaborative transactional workflows and explicit rollback dependency in collaborative transactional workflows. Also, we have proposed the rollback dependency compiler that determines above three types of rollback dependency. A workflow designer specifies the workflow schema and the resources accessed by the steps from a global database of resources. The rollback dependency compiler generates the enhanced workflow schema with the rollback dependency specification. The run-time system interprets this specification and executes the rollback policy with data consistency if failure of steps is occurred. After all, this paper can offer better correctness and performance than state-of-the-art WFMSs.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.4
• /
• pp.221-244
• /
• 2006

This research analyzes the current status of personal name authority control and its impact on the end user searching against OPACs in public libraries in Korea. Further it also suggests the ways to improve the recall ratio in author search with a minimal modification, system-wise and authority-wise. on the KOLISNET as a stepping stone for other public libraries. Finally, a long-term plan for establishing proper authority work in public libraries including the National Library of Korea is briefly proposed. In order to find out whether authority works are conducted and examine how variant written forms of the same foreign name and variant names of the same person are treated, OPACS of the National Library of Korea, KOLISNET, and ten randomly selected public libraries were searched. Findings indicate that while the National Library of Korea was performing authority control, even incomplete, the rest did not appear to conduct any form or authority control. As a spinoff of the research, it is observed that in many public libraries their bibliographic records and retrieval methods are inaccurate, lacking consistency, and incomplete. In sum. it is strongly recommended that (1) as a start for authority work among public libraries personal name authority control should be conducted to enhance the identifying and collocating functions in OPACs, (2) a shared authority database, for which the National Library of Korea's authority database might be used. should be built for Public libraries.