• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2006년도 추계 종합학술대회 논문집
• /
• pp.61-64
• /
• 2006

이동성 지원 네트워크에 대한 요구가 증가함에 따라 IP 기반의 이동성 지원 프로토콜들이 제안되었다. MAP을 이용해 마이크로 이동성을 관리하는 HMIPv6는 MAP이 관리하는 도메인 내에서의 단말 이동에 대해 효율적인 이동성 지원을 위한 방안들을 제시하고 있지만, MAP으로 트래픽이 집중되는 문제점을 가지고 있다. 본 논문에서는 계층적 Mobile IPv6에서 MAP에 집중되는 트래픽을 효율적으로 분산하는 기법을 제안한다. 제안 기법에서는 두개 이상의 MAP을 선정하고 Active MAP과 Passive MAP으로 구분한다. 제안 기법은 크게 Active MAP과 Passive MAP간의 상태변경과 특정 MAP에서 트래픽으로 인한 부하가 일어날 경우 부하 분산을 위한 MAP간의 동작을 정의한다.

• 대한토목학회논문집
• /
• 제30권5D호
• /
• pp.523-531
• /
• 2010

댐은 일상생활에 필요한 용수를 안정적으로 공급해주고 홍수피해를 저감하는 효과가 있지만 많은 토지와 가옥이 수몰되는 문제가 있다. 따라서 이러한 댐주변지역의 생활환경 개선과 지원을 위해 많은 사업들이 시행중에 있다. 본 연구에서는 GIS 공간중첩 기능을 이용하여 댐주변지역 지원사업비를 산정하는 기법과 함께 수치지형도의 해상도에 따른 영향을 분석한 결과 다음의 결론을 얻었다. 첫째, 1/3,000 수치지형도를 기준으로 각 해상도별 수몰지역 면적오차를 분석한 결과, 1/5,000 수치 지형도가 1/25,000 수치지형도에 비해 면적오차의 합의 비율이 9.5배로 정확도 측면에서 매우 효과적임을 알 수 있었다. 둘째, 댐주변지역 면적오차의 합을 분석한 결과 1/5,000 수치지형도가 1/25,000 수치지형도에 비해 면적오차의 합의 비율이 7.4배로 정확도 측면에서 매우 효과적임을 알 수 있었다. 셋째, 수몰지역 면적에 대한 지원사업비 오차를 분석한 결과, 1/5,000 수치지형도가 1/25,000 수치지형도에 비해 지원사업비 오차의 합과 표준오차 그리고 수몰지역 총사업비에 대한 지원 사업비 오차의 합의 비율에서 각각 15.9배, 14.7배, 15.9배로 매우 효과적임을 알 수 있었다. 또한 댐주변지역 면적에 대한 지원사업비 오차 분석 결과에서도 1/5,000 수치지형도가 1/25,000 수치지형도에 비해 지원사업비 오차의 합과 표준오차 그리고 댐주변지역 총사업비에 대한 지원사업비 오차의 합의 비율에서 각각 10.7배, 9.6, 10.6배로 정확도 측면에서 매우 효과적임을 알 수 있었다. 마지막으로 댐주변지역 전체사업비 오차를 분석한 결과, 1/5,000 수치지형도가 1/25,000 수치지형도에 비해 전체 지원사업비 오차의 합과 표준오차 그리고 전체사업비에 대한 전체사업비 오차의 합의 비율에서 각각 1.4배, 1.3배, 1.4배로 정확도 측면에서 효과적이나 인구항목이 면적개념을 고려하고 있지 않아 수몰지역이나 댐주변지역 면적 오차산정 결과보다는 비교적 차이가 크지 않은 것으로 나타났다.

• 한국농공학회논문집
• /
• 제64권3호
• /
• pp.1-8
• /
• 2022

In this study, a farm map utilization strategy for sustainable agricultural environmental resource management was derived. In addition, it is intended to present an efficient method of providing farm map-related services. As a result of the demand survey, the additional information required for the farm map includes 29% of information on crops grown on farmland, 21% of management-related information such as the owner or business entity, 17% of topographical information including slope, 15% of agricultural water information, 17% of land status information, and the addition of functions. 2% was investigated. As a result of intensive interview survey, it was found that it can be used for information on crops cultivated by agricultural businesses, actual cultivated area by township, arable land consolidation division boundary, and management of agricultural promotion zones. The farm map can be used as basic data to efficiently manage agricultural environmental resources. Since the status of support for individual farms or lots, such as soil improvement agent support and organic fertilizer support, may belong to personal information, it can be processed and provided in units required by administration or policies, such as administrative boundaries, subwatersheds, and watersheds. It can serve as a basis for executing the direct payment currently supported only by individual farms, even in a community unit that manages environmental direct payments.

• 지식경영연구
• /
• 제19권3호
• /
• pp.47-61
• /
• 2018

A knowledge map, a taxonomy of knowledge repositories, must have capabilities supporting and enhancing knowledge user's activity to search and select proper knowledge for problem-solving. Conventional knowledge maps, however, have been hierarchically categorized, and could not support such activity that must coincide with the user's cognitive process for knowledge utilization. This paper, therefore, aims to verify and develop a methodology to build a networked knowledge map that can support user's activity to search and retrieve proper knowledge based on the referential navigation between content-relevant knowledge. This paper deploys keywords as the semantic information between knowledge, because they can represent the overall contents of a given document, and because they can play the role of semantic information on the link between related documents. By aggregating links between documents, a document network can be formulated: a keyword-based networked knowledge map can be finally built. Domain expert-based validation test was also conducted on a networked knowledge map of 50 research papers, which confirmed the performance of the proposed methodology to be outstanding with respect to the precision and recall.

• 한국정밀공학회지
• /
• 제15권7호
• /
• pp.7-17
• /
• 1998

Stereolithography is a process used to rapidly produce stereolithographic parts directly from three dimensional CAD models. However design methodologies to create components to be built by stereolithography are different from those required by conventional machining processes. As a typical case in point, the support structures are required to support a component at build stage, but are later removed once building and curing are complete. These structures are used to anchor the component to the platform and to prevent sagging or distortion. This paper deals with the Support Map data structure prepared to find the appropriate regions of supports. Interferences between supports and parts, and support structure themselves as well, are checked and thus the system are searching the statically stable regions to remove the surplus support structures. Cross shaped tooth profiles are designed for easy eliminating the support structures.

• 한국CDE학회논문집
• /
• 제19권1호
• /
• pp.61-67
• /
• 2014

This paper proposes a procedure enabling the extraction of view-dependent triangular approximations from a height map. In general, procedures to approximate a height map use tree hierarchies. These methods, however, have a limitation in terms of accuracy, because they depend on tree hierarchy than terrain features. To overcome the difficult, we apply the simplification method for triangular meshes to a height map. The proposed procedure maintains full decimation procedure to support multiresolution. The maintenance of decimation procedure results in creation of the groups (trees), each of which consists of vertices that can be merged into one vertex (root node). As the groups have tolerance which is determined by some tests, they support the generation of view-dependent arbitrary triangular meshes.

• 정보처리학회논문지D
• /
• 제9D권4호
• /
• pp.543-554
• /
• 2002

지리정보시스템은 처리 속도의 향상과 비쥬얼라이징의 개선이 필요하다. 이를 위해서는 맵 일반화와 레벨별 상세화 개념이 요구된다. 기존의 공간 인덱싱은 지도 일반화를 지원하지 않거나 지원하더라도 모든 지도 일반화 연산을 제공하지 않는다는 문제점을 가진다. 본 논문에서는 이를 위해 모든 일반화 연산을 지원하는 새로운 인덱스 구조인 LR트리를 제안한다. 또한 LR트리를 검색, 삽입, 삭제하기 위한 알고리즘을 기술하고, 성능 분석을 수행한다. 성능 분석을 통해 제안된 인덱스 구조가 지도 일반화를 지원하는데 있어 다른 공간 인덱싱 기법보다 우수한 성능을 나타냄을 보인다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.257-260
• /
• 1998

In this paper, we describe an IMT-2000 system architecture, a protocol stack, and basic MAP scenarios(e.g., registration, call delivery) based on the IS-41 and IS-41 and IS-751. This paper focuses on the MAP scenarios to support the IMSI which is defined for the global roaming between GSM and IS-41 Networks through the Family of System approach. This paper also deals with the design of the MAP protocol stack transported over the ATM networks and introduces the software structure of MAP in IMT-2000 MSC.

• 한국군사과학기술학회지
• /
• 제16권5호
• /
• pp.583-589
• /
• 2013

In this paper, we proposed a system that efficiently provides support maps which includes the grid based terrain analysis information. To do this, we use the FDB which is defined as a GIS database that contains features with attributes attached to the features. The FDB is composed of a number of features and feature classes. In order to create support maps, it is necessary to classify feature classes that are associated with each support map and to search them in a grid map. The proposed system use a ontology model to classify semantically feature classes and the quad-tree data structure to find them in a grid map quickly. Therefore, our system is expected to be utilized for global path planning of UGV. In this paper, we show the possibility through an experimental implementation.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권1호
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.