• Childhood Kidney Diseases
• /
• v.2 no.2
• /
• pp.169-177
• /
• 1998

Purpose : Renal duplication is a common occurrence, and the range of ureteral and renal anomalies draining the two poles of the duplex kidney leads to a variety of clinical presentations. Method : A series of 61 children with duplicated systems was studied retrospectively who were admitted during last 12years. Results : Of the children $60.6\%$ were accompanied with urologic anomalies that required surgical treatment, and most children initially were presented with urinary tract infection. $42.6\%$ of children were either diagnosed incidentally during evaluation of other non-urologic disease or during follow-up evaluation of abnormal antenatal renal sonogram. Conclusion : From our point view, children with history of abnormal antenatal renal sonogram, or with symptoms such as urinary tract infection, hematuria, abdominal pain should be evaluated radiologially fully to confirm further abnormality and accompanied complications. And routine follow-up using abdominal ultrasonogram, VCUG, and urine culture should be used to prevent and detect early treatable complications.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.438-449
• /
• 2018

Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.

• The Journal of the Korea Contents Association
• /
• v.17 no.11
• /
• pp.209-220
• /
• 2017

As a semantic data is widely used in various applications such as Knowledge Bases and Semantic Web, needs for effective search over a large amount of RDF data have been increasing. Previous keyword search methods based on distinct root semantics only retrieve a set of answer trees having different root nodes. Thus, they often find answer trees with similar meanings or low query relevance together while those with the same root node cannot be retrieved together even if they have different meanings and high query relevance. We propose a new method to find diverse and relevant answers to the query by permitting duplication of root nodes among them. We present an efficient query processing algorithm using path indexes to find top-k answers given a maximum amount of root duplication a set of answer trees can have. We show by experiments using a real dataset that the proposed approach can produce effective answer trees which are less redundant in their content nodes and more relevant to the query than the previous method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.1
• /
• pp.8-18
• /
• 2010

Traditional storage server suffers from duplicated data blocks which cause an waste of storage space and network bandwidth. To address this problem, various de-duplication mechanisms are proposed. Especially, lots of works are limited to backup server that exploits Contents-Defined Chunking (CDC). In backup server, duplicated blocks can be easily traced by using Anchor, therefore CDC scheme is widely used for backup server. In this paper, we propose a new de-duplication mechanism for improving a storage system. We focus on efficient algorithm for supporting general purpose de-duplication server including backup server, P2P server, and FTP server. The key idea is to adapt stride scheme on traditional fixed block duplication checking mechanism. Experimental result shows that the proposed mechanism can minimize computation time for detecting duplicated region of blocks and efficiently manage storage systems.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.311-316
• /
• 2010

Esterel is an imperative synchronous language that is used to develop memories, cache controllers, bus interfaces, and so on. An Esterel statement is called schizophrenic if it is executed more than once in an instant. A schizophrenic statement may cause problems when it is translated to hardware circuits; a circuit performs more than one reaction in a clock. Previous works claim that only local signal declarations and parallel statements may cause schizophrenic problems. However, control signals produced by a trap statement or data signals used by emit statements can cause schizophrenia. They are new schizophrenic patterns. Especially, schizophrenic problems caused by emit statements cannot be solved by a loop unrolling technique that is the key idea of previous curing techniques for schizophrenic problems. In this paper, we introduce and define the two schizophrenic problems.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.10
• /
• pp.397-404
• /
• 2018

Various applications are widely developed for smartphones to meet customer's needs. In many companies, messenger's typed interactive systems have been studied for business marketing, advertising and promotion to provide useful services for the customers. Such interactive systems are usually called as "Chatbot". In Chatbot, duplicated responses from Chatbot could occur frequently, and these make one lose interest. In this paper, we define a case that the response of Chatbot is duplicated according to the user's input, and propose a method to reduce duplicated responses of Chatbot. In the proposed method, we try to reduce duplication responses through a new duplication avoidance algorithm by building multiple tables in a database and by making combinations of user's input and its response in each table. In our experiments, the proposed method shows that duplicated responses are reduced by an average of 70%, compared with the existing method.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.5
• /
• pp.144-152
• /
• 2012

The reason why most scheduling softwares currently using at construction projects adopt PDM (Precedence Diagramming Method) is that it can express an overlapping relationship between activities. However, the overlapping relationships in PDM are represented only by combinations of four overlapping types that connect the start and finish points of two activities, therefore, PDM cannot express efficiently the relationships between any middle points of two activities if they should be represented. This research proposes the method of transforming the four overlapping types of PDM to the overlapping relationships of BDM(Beeline Diagramming Method), new networking technique, that can connect the inter-relationships at any middle points of two activities as well as express multiple overlapping relationships. The proposed method will help not only to improve an efficiency of scheduling but also to upgrade the scheduling technique because BDM technique has a lot of unique advantages in scheduling.

• Journal of Korean Library and Information Science Society
• /
• v.55 no.1
• /
• pp.1-26
• /
• 2024

The purpose of this study is to derive an integration plan for bibliographic records by applying a duplicate verification algorithm to the item-based catalog in public libraries. To this, G Library, which was opened recently in Busan, was selected. After collecting OPAC data from G Library through web crawling, multipart monographs of Korean Literature (KDC 800) were selected and KERIS duplicate verification algorithm was applied. After two rounds of data correction based on the verification results, the duplicate verification rate increased by a total of 2.74% from 95.53% to 98.27%. Even after data correction, 24 books that were judged to be similar or inconsistent were identified as data from other published editions after receiving separate ISBN such as revised versions or hard copies. Through this, it was confirmed that the duplicate verification rate could be improved through catalog data correction work, and the possibility of using the KERIS duplicate verification algorithm as a tool to convert duplicate item-based records from public libraries into manifestation-based records was confirmed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.7-9
• /
• 2004

센서 네트워크의 급속한 성장에 따라 센서 네트워크의 효율적 관리를 위한 다양한 연구가 진행 중이다. 특히, 센서의 저 전력을 위한 다양한 기술들이 개발되고 있다. 본 논문은 센서에 전해지는 다중 연속 질의의 중복 성을 제거함으로써, 센서 네트워크의 효율적 관리를 제공할 수 있는 방법을 제안한다. 다중 연속 질의는 두 가지 단계로 최적화가 이루어진다. 먼저, 다중 연속 질의의 시간 속성 중복을 제거하기 위해 B+tree를 이용해 그룹 핑된다. 그룹 핑된 다중 연속 질의들은 연관 속성의 중복 여부 판단을 통해, 중복 성을 제거하여 재구성 된다. 그러므로 재구성된 다중 연속 질의가 센서 노드에 전해지게 되면, 센서는 중복된 결과를 전송하지 않기 때문에 센서 노드의 불필요한 전력을 낭비하지 않게 된다.