• Title/Summary/Keyword: 위치정보데이타

Search Result 270, Processing Time 0.025 seconds

The Development of Helicopter Aviation Information System for Safe Flight (헬기의 안전운항을 위한 운항정보 시스템 개발)

  • Kang, Tae-Ho;Suh, Sung-Chul;Lee, Jong-Hun
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.3 no.2 s.6
    • /
    • pp.131-136
    • /
    • 1995
  • In this paper, We explain the development of helicopter avation information system which provides the current location and other pre-saved informations in order to guarantee the safe aviation. The system we developed has the functions such as displaying digital map data and current location, route planning, displaying the rate of deviation, calculating and displaying the cross sectional view through the route and providing a real-time speed, heading and other informations. In this system, we use GPS to get the current location, made the 1:250,000 digital map to display the current location and made the cross sectional view from the DEM(Digital Elevation Mode)) data to help safe aviation. This system provides many kinds of route setting methods by using UTM coordinates, Lati. Longi, coordinates, database of heliport location, scanned map, etc., and displaying the heading and distance. Moreover, it also has a characteristic of providing a consistent user interface.

  • PDF

A Location Management Scheme using User Locality in Cellular Communciation Systems (셀룰러 통신 시스템에서 사용자 지역성을 고려한 위치 관리 기법)

  • Yang, Gwon-U;Gil, Jun-Min;Kim, Gi-Beom;Jeong, Sun-Yeong;Hwang, Jong-Seon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.9
    • /
    • pp.1135-1144
    • /
    • 1999
  • 본 논문에서 우리는 셀룰러 통신 시스템을 위한 위치갱신과 위치질의 비용을 줄일 수 있는 새로운 위치관리 기법을 제안한다. 위치갱신 및 위치질의 비용을 줄이기 위하여, 제안한 위치관리 기법은 사용자 지역성을 사용한다. 사용자 지역성은 이동 지역성과 호 지역성으로 이루어진다. 이동 지역성을 갖는 이동단말들을 위한 위치갱신은 지역 PVLR(Proxy-Visitor Location Register) 갱신에 의해 위치갱신 비용을 줄일 수 있다. 호 지역성을 갖는 이동단말들을 위한 위치질의는 지역 PVLR 질의에 의해 위치질의 비용을 줄일 수 있다. 분석 모델을 통하여, 제안한 기법의 성능 분석과 IS-41 표준과 제안 기법과의 성능을 비교한다. 사용된 비교 척도는 네트워크 비용, 데이타베이스 비용 그리고 호 설정 지연이다. 이들 모든 척도들에 대해서, 제안 기법이 IS-41 표준에서 정의된 위치관리 기법보다 더 좋은 성능을 보인다. 또한 비교 결과는 CMR(Call-to-Mobility Ratio)에 상관없이 제안 기법이 IS-41 기법보다 성능이 좋음을 보여준다. Abstract In this paper, we propose a new location management scheme for cellular communication systems with the goal of reducing both location update and query cost. In order to reduce both location update and query cost, the proposed scheme uses user locality. User locality consists of movement and call locality. For mobile terminals with movement locality, location update cost is reduced by local PVLR(Proxy-Visitor Location Register) update. Location query cost is reduced by local PVLR query for mobile terminals with call locality. Through analytical models, we analyze the performance of the proposed scheme and compare it with that of the IS-41 scheme. The measures of comparison used are the network cost, the database cost, and the call set up delay. For all these measures, the proposed scheme performs better than the location management scheme defined in the IS-41 standard. Result comparison also shows that the our scheme performs better than the IS-41 scheme, regardless of CMR(Call-to-Mobility Ratio).

An Efficient Continuous Reverse Skyline Query Processing Method in Metric Spaces for Location-based Services (위치기반 서비스를 위한 거리공간에서의 효율적인 연속 리버스 스카이라인 질의 처리 기법)

  • Lim, Jong-Tae;Park, Yong-Hun;Seo, Dong-Min;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.37 no.5
    • /
    • pp.250-257
    • /
    • 2010
  • As the variant of skyline query processing, reverse skyline Queries have been studied. However, the existing methods for processing reverse skyline Queries have the limitation of service domains and spend high costs to provide various location-based services. In this paper, we propose a new reverse skyline Query processing method that efficiently processes a query with the objects in metric spaces. In addition, the proposed method also processes continuous reverse skyline queries efficiently. In order to show the superiority of the proposed scheme, we compare it with the previous reverse skyline 벼ery processing scheme in various environments. As a result, the proposed method achieves better performance than the existing method.

Location based Service with Temporal Reasoning (시간적 추론이 적용된 위치 기반 서비스)

  • Kim Je-Min;Park Young-Tack
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.3
    • /
    • pp.356-364
    • /
    • 2006
  • 'Ubiquitous Computing' is the most important paradigm of the next generation Information-Communication technology. The one of important problems to develop ubiquitous computing service system get hold of relations between times of transfer objects and events of transfer objects. Another problem is what reason transfer-pattern through location data of transfer objects. In this paper, we propose an approach to offer temporal-relation service in ubiquitous computing environment. The first is temporal reasoning in service viewpoint. The second is temporal reasoning to record user's preference. Users have preferences that are closely connected with time. These preferences are recorded at user profile. Therefore, the user profile-based ubiquitous service system can offer suitable service to users.

Query Optimization Algorithm for Image Retrieval by Spatial Similarity) (위치 관계에 의한 영상 검색을 위한 질의 및 검색 기법)

  • Cho, Sue-Jin;Yoo, Suk-In
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.551-562
    • /
    • 2000
  • Content-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. GContent-based image retrieval system retrieves an image from a database using visual features. Among approaches to express visual aspects in queries, 'query by sketch' is most convenient and expressive. However, every 'query by sketch' system has the query imperfectness problem. Generally, the query image produced by a user is different from the intended target image. To overcome this problem, many image retrieval systems use the spatial relationships of the objects, instead of pixel coordinates of the objects. In this paper, a query-converting algorithm for an image retrieval system, which uses the spatial relationship of every two objects as an image feature, is proposed. The proposed algorithm converts the query image into a graph that has the minimum number of edges, by eliminating every transitive edge. Since each edge in the graph represents the spatial relationship of two objects, the elimination of unnecessary edges makes the retrieval process more efficient. Experimental results show that the proposed algorithm leads the smaller number of comparison in searching process as compared with other algorithms that do not guarantee the minimum number of edges.

  • PDF

게놈연구 동향

  • 박종훈;김명희
    • The Microorganisms and Industry
    • /
    • v.20 no.1
    • /
    • pp.2-9
    • /
    • 1994
  • 최근에 미국의 국립보건원과 에너지성에서는 1990년부터 합동으로 수행하고 있는 게놈연구 5개년 계획(1991-1995)을 보완하여 새로운 5개년(1994-1998) 계획을 마련하였다. 이 계획에는 인체게놈의 지도작성 및 염기서열결정, 물리지도에 알려진 유전자들의 위치결정, 게놈연구에 필요한 기술, 모델 organism, 정보의 축적, 윤리, 법 및 사회적인 문제, 게놈연구에 관련된 교육훈련, 기술이전, 축적된 기술 및 데이타의 상호교환 등에 관한 구체적인 계획들의 변경을 포함하고 있다. 본문에서는 인체게놈연구 수행을 위하여 필요로 하는 몇몇 게놈연구 관련 기술과 현재 이용되고 있는 유전자지도 작성방법 등에 대하여 알아보고 향후의 게놈연구 방향에 관하여 기술하려고 한다.

  • PDF

Customization of web Contents: The Case of kookmin Internet Banking eCRM (고객 맞춤 웹 컨텐츠 - 국민은행 인터넷뱅킹의 eCRM 사례)

  • 함유근;윤태주
    • Proceedings of the Korea Database Society Conference
    • /
    • 2001.11a
    • /
    • pp.60-75
    • /
    • 2001
  • 금융산업에서 인터넷을 본격적인 영업 채널로 활용하는 비중이 높아지고 사이버금융의 확산에 따라 고객과의 거리를 좁히면서 금융기관의 수익성을 높이는 방안으로 eCRM 등 고객 맞춤화 전략이 최근 국내외에서 주목을 받고 있다. 본 논문에서는 금융정보기술의 발전 단계에 있어서 eCRM 의 위치를 살펴보며, 국민은행 인터넷뱅킹의 개발 배경과 그 유형을 논의하며, 고객의 니즈를 찾아내고 이에 맞추어 가치를 창출하는 방법으로서 개인화의 종류들을 살펴본다. 또한 원투원 마케팅의 실현 기법들과 실제로 국민은행의 eCRM 과정에서 이들이 어떻게 구현되었는지를 논의한다.

  • PDF

교육용 멀티미디어 컨텐트 품질인증 정책 방향

  • 조정우
    • Proceedings of the Korea Database Society Conference
    • /
    • 1998.09a
    • /
    • pp.272-275
    • /
    • 1998
  • - 정보화 사회의 시대적 요청 - 교육정보화의 방향 및 과제 - 인프라의 기반 위에서 상보적인 발전 - 교육 컨텐트의 중요성 인식 -학습 패러다임의 변화에 대한 이해를 바탕으로 - Side-effect에 대한 대비 - 교육정보화 사업 속에서의 교육용 소프트웨어 인증의 위치 2. 좋은 소프트웨어와 나쁜 소프트웨어에 대한 기본 시각 - 구성주의 학습관이 시사하는바 - 1 : 1 개인교수 효과의 원인 변수 - 고차적 지적 능력의 함양 - 학습의 경제성(중략)

  • PDF

Query Rewriting and Indexing Schemes for Distributed Systems based on the Semantic Web (시맨틱 웹 기반의 분산 시스템을 위한 질의 변환 및 인덱싱 기법)

  • Chae, Kwang-Ju;Kim, Youn-Hee;Lim, Hae-Chull
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.718-722
    • /
    • 2008
  • Ontology plays an important role of the Semantic Web to describe meaning and reasoning of resources. Ontology has more rich expressive power through OWL that is a next standard representation language recommended by W3C. As the Semantic Web is widely known, an amount of information resources on the Web is growing rapidly and the related information resources are placed in distributed systems on the Web. So, for providing seamless services without the awareness of far distance, efficient management of the distributed information resources is required. Especially, sear ching fast for local repositories that include data related to user's queries is important to the performance of systems in the distributed environment. In this paper, first, we propose an index structure to search local repositories related to queries in the distributed Semantic Web. Second, we propose a query rewriting strategy to extend given user's query using various expression of OWL. Through the proposed index and query strategy, we can utilize various expressions of OWL and find local repositories related to all query patterns on the Semantic Web.

Boosting up the Mount Latency of NAND Flash File System using Byte-addressable NVRAM (바이트 접근성을 가지는 비휘발성 메모리 소자를 이용한 낸드 플래시 파일 시스템의 부팅시간 개선 기법)

  • Jeon, Byeong-Gil;Kim, Eun-Ki;Shin, Hyung-Jong;Han, Seok-Hee;Won, Yoo-Jip
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.3
    • /
    • pp.256-260
    • /
    • 2008
  • This paper describes an improvement of mount-time delay in NAND Flash file systems. To improve file system mount performance, this work configures a hierarchical storage system with byte-addressable NVRAM and NAND Flash memory, and let the meta data of a file system allocated in the NVRAM. Since the meta data are stored in NVRAM supporting data integrity some of the items, which are stored in Spare area and Object Header area of NAND Flash memory to control meta data of NAND Flash file system, could be eliminated. And also, this work eliminates the scanning operation of the Object Header area of previous work FRASH1.0. The scanning operation is definitely required to find out the empty Object Header address for storing the Object Header data and provokes a certain amount of performance loss in file generation and deletion. In this work, an implemented file system, so-called FRASH1.5, is demonstrated, featuring new data structures and new algorithms. The mount time of FRASH1.5 becomes twice as fast as that of the FRASH1.0. The performance in file generation gets improved by about $3{\sim}8%$. In particular, for most large-size files, the FRASH1.5 has 8 times faster mount time than YAFFS, without any performance loss as seen in the file generation.