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

시공간 상에서 움직이는 물체의 이동경로는 일반적으로 MBR이 매우 크므로, R-tree 계열의 다차원 인덱싱 기법을 적용할 때 질의시 겹침 영역이 많이 발생하는 문제점이 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 time slice에 따라 이동경로의 MBR을 나누어 별도의 인덱스에 저장하는 기법을 제안한다. 이 기법을 적용하면 MBR의 평균 크기가 줄어들어 인덱스 페이지 및 데이터 페이지 접근횟수를 감소시킬 수 있을 뿐만 아니라, 시간이 지나 질의가 매우 드물게 수행되는 데이터에 대한 엔트리를 삭제하여 검색 범위를 줄이는 것이 용이하다. 또한 본 논문에서는 질의 성능을 최적화하기 위해서 time slice를 어떻게 설계해야 하는지에 대해서도 논의한다.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.35-42
• /
• 2010

The increasing regular medical check up rate for early diagnosis in disease has increasing sleep endoscopy rate because of reduction with discomfort. The purpose of this study was to determine the number of recovery bed as increasing sleep endoscopy rate using check up time, waiting time & recovery time at a general hospital in Seoul. This study was analyzed using ARENA 10.0 program. At present and as increasing of sleep endoscopy rate 10%, 20% was increased recovery time, waiting time & the rate of bed inflection. So at present, the number of recovery bed has to increase for client's safety and as increasing of sleep endoscopy rate 10%, 20% has to increase 3 and then waiting time decreased in 2 minutes.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.19-30
• /
• 2009

The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.7
• /
• pp.40-48
• /
• 2015

An optical network-on-chip(ONoC) architecture is emerging as a new paradigm for solving on-chip communication bottleneck. Recent studies on ONoC have been focusing on supporting the parallel transmission and avoiding path collisions using wavelength division multiplexing(WDM). However, since the maximum number of wavelengths, which a single waveguide can accommodate is limited by crosstalk and insertion loss. Therefore previous WDM studies based on incrementing the number of different wavelengths according to the number of nodes would be infeasible due to the implementation complexity. To solve such problems, we combined time division multiplexing(TDM) and wavelength-routed ONoC, along with an optimized channel allocation algorithm, which can minimize the number of extra wavelength channels and latency caused by combining TDM scheme.

• Journal of KIISE
• /
• v.43 no.12
• /
• pp.1428-1436
• /
• 2016

A multipath routing in wireless sensor networks (WSNs) provides advantage such as reliability improvement and load balancing by transmitting data through divided paths. For these reasons, existing multipath routing protocols divide path appropriately or create independent paths efficiently. However, when the sink node moves to avoid hotspot problem or satisfy the requirement of the applications, the existing protocols have to reconstruct multipath or exploit foot-print chaining mechanism. As a result, the existing protocols will shorten the lifetime of a network due to excessive energy consumption, and lose the advantage of multipath routing due to the merging of paths. To solve this problem, we propose a multipath creation and maintenance scheme to support the mobile sink node. The proposed protocol can be used to construct local grid structure with restricted area and exploit grid structure for constructing the multipath. The grid structure can also be extended depending on the movement of the sink node. In addition, the multipath can be partially reconstructed to prevent merging paths. Simulation results show that the proposed protocol is superior to the existing protocols in terms of energy efficiency and packet delivery ratio.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.546-548
• /
• 2023

인공지능 기술을 도입한 의료분야에서 진단 및 예측을 위한 관련 연구가 활발하게 진행되고 있다. 특히, 인공지능 기술 적용에 가장 많이 활용되고 있는 의료영상을 기반으로 하는 질환에 관한 진단 연구는 매우 복잡한 과정이 필요한 질환의 진단에 큰 영향을 미치고 있다. 복부 장기들의 분할은 환자의 질환 진단 지원 및 복강경등의 수술 지원에 매우 중요한 부분을 차지한다. 본 논문에서는 의료영상을 통해 13가지 복부 장기들을 분할하는 모델을 만들고 그 결과를 보인다. 본 논문에서 제안한 모델을 통해 13가지 복부 장기에 대한 분할로 영상분석을 통해 진단 지원이 가능할 것으로 기대한다.

• Spatial Information Research
• /
• v.9 no.1
• /
• pp.15-30
• /
• 2001

Solid waste collection service is viewed as one of the most important public services in urban area. The purpose of this study is to apply the GIS based regional partitioning and arc routing methods for solid waste collection districting and vehicle routing-scheduling in order to provide waste collection service more efficiently. In this study, solid waste deposit sites are derived from the centroid of each building and the amount of solid waste is deduced based on the number of households and establishments. The regional partitioning procedure is performed based on waste collection zones which are constructed from waste deposit sites. The result of this study shows that solid waste collection districts which are delineated by regional partitioning method are able to increase efficiencies and cut costs in performing solid waste collection services. Also the output of vehicle-scheduling from the analysis of arc routing may provide more efficiently and quickly manage the scheduling of the residential solid waste collection routes, reducing costs with minimal deadheading costs. Therefore, the application of GIS based on regional partitioning and arc routing methods would be very useful to construct a solid waste management system by supplying the important and flexible informations for solid waste collection districts and vehicle routing-scheduling for waste collection.

• Journal of Intelligence and Information Systems
• /
• v.10 no.3
• /
• pp.1-10
• /
• 2004

In this paper, a new character segmentation algorithm of machine printed character recognition is proposed. The new approach of the proposed character segmentation algorithm overcomes the weak points of both feature-based approaches and recognition-based approaches in character segmentation. This paper defines side profiles of touching characters. The character segmentation algorithm gives a candidate single character in touching characters by side profiles, without any help of character recognizer. It segments touching characters and decides the candidate single character by side profiles. This paper also defines cutting cost, which makes the proposed character segmentation find an optimal segmenting path. The performance of the proposed character segmentation algorithm in this paper has been obtained using a real envelope reader system, which can recognize addresses in U.S. mail pieces and sort the mail pieces. 3359 mail pieces were tested. The improvement was from $68.92\%\;to\;80.08\%$ by the proposed character segmentation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.58-60
• /
• 2006

대사 경로를 자동으로 레이아웃 해주는 시스템에 있어 노드 수가 일정수 이상으로 증가할수록 에지 크로싱이 기하급수적으로 증가하는 문제가 있다. 따라서 유전체 수준에서 대사 경로간의 관계(Cross-talk) 등을 살펴보기 위해서는 레이아웃 상에 나타나는 에지 크로싱을 줄이고 이를 압축하여 표시할 필요가 있다. 이는 개개의 대사경로에 대한 레이아웃 분만 아니라 대사 경로간의 관계 등 다양한 단계와 방식의 레이아웃이 가능한 시스템이 필요하기 때문이다. 본 논문에서는 레이아웃 상에 나타나는 에지 크로싱에 의한 가독성 저해를 피하기 위하여 대상 경로 상에 존재하는 연결성 높은 부그래프를 찾는 모듈을 개발하였다. 또한 각각의 부그래프를 슈퍼노드로 치환하는 방식을 적용함으로써 대사 경로를 이해하기 쉽도록 하였다. 또한 이러한 과정은 반복적, 혹은 역방향으로 실행할 수 있도록 하였다. 실험결과, 대사 경로 상에 존재하는 연결성 높은 부그래프들은 그래프밀도값 Q가 0.8로 나타나, 단백질 상호작용 네트워크에 비하여 희소한(sparse) 네트워크 구조를 보임을 알 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.927-930
• /
• 2010

Recently, continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used in the LBS(Location Based Service) and ITS(Intelligent Transportation System) applications. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. This paper proposes a new method to search nearest POIs(Point Of Interest) for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results. There is no order between the POIs. The analysis show that the proposed method outperforms the existing methods.