• 한국경영정보학회:학술대회논문집
• /
• 2007.06a
• /
• pp.817-822
• /
• 2007

시스템 다이내믹스에서의 인가지도는 동적 환경의 문제를 분석하고, 분석된 내용을 논의할 수 있는 도구로써 활용되고 있다. 하지만, 인과지도는 복잡도가 높은 문제를 설명함에 있어서 문제에 대한 정보의 표현과 논리적인 전개에 한계가 존재한다. 그리고 인과지도의 작성 과정에서 연구자의 주관성을 배제 하고 오류를 검증하기 위한 객관적 기준이 미흡한 실정이다. 또한, 문제 해결을 위한 세부적인 개체 모델링과의 연계성이 부족하다. 이에 일각에서는 시스템 다이내믹스의 문제분석에 관한 방법론에 지적을 가하는 경우도 있다. 이에 본 연구에서는, 인과지도의 타당성 확보와 정보 표현력 향상을 위한 이론적 연구를 진행하고자 한다. 본문에서는 인과지도가 객관적인 논리에 의해 작성될 수 있도록 수리적, 논리적 근거들을 제시함과 동시에, 인과지도의 정보 표현력 향상을 통한 대화도구로서의 기능적 향상 방안에 대해서 연구를 진행하였다.

• 한국지형공간정보학회:학술대회논문집
• /
• 2003.09a
• /
• pp.157-162
• /
• 2003

실시간 동적 GPS 측위를 이용한 해저수심측량은 GPS 수신기가 이동중인 상태에서 신호단절 없이 연속적인 수심측정이 가능하며 등수심도와 등고선 제작에 정확한 위치를 결정할 수 있고, 음향측심기는 발사파와 수신파의 도달시간을 측정하여 수심을 관측할 수 있기 때문에 실시간으로 정확한 3차원 측량이 가능하다. 본 논문에서는 해안지역에 대한 지형 분석을 하기 위하여 기준점에 대한 정지관측을 실시하여 좌표변환계수를 산출하고, 이로부터 실시간 동적 GPS 측량과 음향측심기를 이용하여 해운대 해수욕장과 해안을 관측하였다. 1:1,200 축척의 수치지도에서 추출한 수치표고모델에서의 체적은 $97953.9m^3$이며, 실시간 동적 GPS와 음향측심기를 이용하여 추출한 수치표고모델에서의 체적은 $95994.9m^3$로 나타났다. 이는 수치지도에서의 체적과 측량결과의 체적이 단지 2.0%정도로 나타나 실시간 동적 GPS와 음향측심기의 결합에 의한 해저수심측량이 매우 성공적임을 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10a
• /
• pp.187-189
• /
• 2001

이동 컴퓨팅(Mobile Computing)의 상업적인 응용분야로서, 지능형 교통정보시스템(ITS)에서의 첨단 여행자 정보시스템(ATIS)이 있다. ATIS에서 가장 중요한 이동 컴퓨팅 태스크는 현재 위치에서 목적지까지의 최단 경로를 계산하는 일이다. 본 논문에서는 최단 경로 재 계산 문제에 대해서 연구하였다. 이 문제는 전자 수치 지도(topological digital road map)상의 간선(edge) 비용이 동적인 교통 상태에 따라 빈번하게 갱신되고 있는 ATIS의 동적 경로 안내 시스템(URGS)에서 발생한다. 지금까지 제안된 방법들은 처음부터 최단 경로를 재계산하거나, 또는 단지 비용의 변화가 일어난 간건 상에 있는 양 끝 노드 사이에 대해서 최단 경로를 재계산할 뿐이다. 본 논문에서는 앞서 계산된 최단 경로에 대한 정보를 이용하는 효율적인 적응형 슬라이딩 윈도우 기반의 근접 최단 경로 재 계산 방법을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2292-2298
• /
• 2010

A mashup is a web page or application that uses and combines information, contents or Open APIs available on the web to create a new service. The mashup developed by the need not combination of simple information can contribute to new added-values with practicality and convenience. Thus, in this paper, we want to develop a RIA-based dynamic mashup service for the users considering weather forecast and marine information importantly. We design and implement the system that it can register a number of information about a domain dynamically through registration process based on the map and present a mark of domain location on the map and the information including internal environment, external environment and weather of related to the domain within a webpage. Implemented service need not require a tedious process visiting other web sites every time to confirm the relevant information because we can see simultaneously related information with a map within a page.

• Journal of the Korean Society for information Management
• /
• v.19 no.2
• /
• pp.109-130
• /
• 2002

This paper is mainly concerned with the matter of how organizational knowledge is represented in terms of usability by letting the members of the organization evaluate knowledge items in the problem solving situations. Organizational knowledge can be represented in the form of a visualized dynamic knowledge map since the organizational members experience constant changes in goals, kinds of problems, and the importance of alternatives to solve the given problems. The dynamic map suggested in this study is goal oriented in the sense that it represents the relationship between knowledge items across domains as well as within a domain.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.204-210
• /
• 2002

The self-organizing feature map of Kohonen has disadvantage that needs too much input patterns in order to converge into the equilibrium state when it trains. In this paper we proposed the method of improving the convergence speed and rate of self-organizing feature map converting the interaction set into Dynamic Gaussian function. The proposed method Provides us with dynamic Properties that the deviation and width of Gaussian function used as an interaction function are narrowed in proportion to learning times and learning rates that varies according to topological position from the winner neuron. In this Paper. we proposed the method of improving the convergence rate and the degree of self-organizing feature map.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.141-158
• /
• 2008

In this paper, we developed the GML Map Server which visualized the map based on GML as international standard for exchanging the common format map and for interoperability of GIS information. And also, it should transmit effectively GML map into the mobile device by using dynamic map partition and caching. It manages a partition based on the visualization area of a mobile device in order to visualize the map to a mobile device in real time, and transmits the partition area by serializing it for the benefit of transmission. Also, the received partition area is compounded in a mobile device and is visualized by being partitioned again as four visible areas based on the display of a mobile device. Then, the area is managed by applying a caching algorithm in consideration of repetitiveness for a received map for the efficient operation of resources. Also, in order to prevent the delay in transmission time as regards the instance density area of the map, an adaptive map partition mechanism is proposed for maintaining the regularity of transmission time. GML Map Server can trace the position of mobile device with WIPI environment in this paper. The field emulator can be created mobile devices and mobile devices be moved and traced it's position instead of real-world. And we developed POIM(POI Management) for management hierarchically POI information and for the efficiency POI search by using the individual tagging technology with visual interface.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.4
• /
• pp.60-70
• /
• 2006

National atlas map for provide various information is one part of National territorial Statatics Survey but National atlas map in 2004 year don't have stability and ability. National territorial Statatics Survey in 2005 years have octuple data compare with data in 2004 years but have only one map. One map is going to provide with stability and ability. We don't use DBMS, But We make a similarly struct in file based program. We programmed system of dynamic-linked data with spatial data. To dynamic-linked system, we make search engine to based index struct and make combobox search system. spatial data only have index codes(year, national terrial indicator, area). If spatial data request specfied data, search engine search index code and provide DB data. New system is middle step of using DBMS. We redraw map for display real Korea area (with dokdo). New map is shape and similar Korea map.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.08a
• /
• pp.87-90
• /
• 2008

Dynamic Heuristic(DH) is not fixed data and is dynamically modified using transferred real time road data from server In this paper, we propose path-finding algorithm with Maximum Speed Dynamic Heuristic (DH-MAX) and do an experiment. The DH-MAX is to be used the highest speed as DH, in real map divided by same sire. And proposed algorithm searches path using the priority searching only of the fixed data, but also the highest speed with real time information. In the performance test, the quality of path is enhanced but the cost of searching is increased than $A^*$ algorithm.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.2
• /
• pp.35-48
• /
• 2008

In this paper, we propose a Dynamic Heuristic to reduce the number of node accesses and improve quality of path in the client-based navigation service. The Dynamic Heuristic is to use heuristic data from server that is calculated with traffic data. The server-based navigation service provides a path searched on server and transmits it to client, but we propose that server only provide heuristic data to client. The proposed client searches a path with heuristic transmitted data from server. We present a new algorithm for using Dynamic Heuristic in the path-finding. The algorithm bases Grid Based Path-Finding, and has minimum speed data of edges in grid. It removes several grids whose minimum speed is less than limited speed.