• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.188-191
• /
• 2003

In this paper, we proposed data generalization and data cube mechanism for efficient data mining in distribute environment. We also proposed active Self Organization Map applying traditional Self Organization Map of Neural network for searching the most Informative data created from data cube after the generalization procedure and designed the system architecture for that.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.215-223
• /
• 2009

The helicoidal surfaces with pointwise 1-type or harmonic gauss map in Euclidean 3-space are studied. The notion of pointwise 1-type Gauss map is a generalization of usual sense of 1-type Gauss map. In particular, we prove that an ordinary helicoid is the only genuine helicoidal surface of polynomial kind with pointwise 1-type Gauss map of the first kind and a right cone is the only rational helicoidal surface with pointwise 1-type Gauss map of the second kind. Also, we give a characterization of rational helicoidal surface with harmonic or pointwise 1-type Gauss map.

• Spatial Information Research
• /
• v.18 no.4
• /
• pp.99-108
• /
• 2010

Space Syntax methodology can be quantitatively calculated spatial cognitive analysis by number of turns_ In the existing GIS-based spatial information service provide 'physical distance' due to the shortest distance as a priority. but pedestrians tends to choose the path with concerned a lot of emphasis of safety, more vitality way from the crime at night, traffic accidents, and comfort on a road. Human's 'psychological distance' may reflect the spatial information services and provided path should be. In this study, using GIS Road Data implements the axial map with idea of the linear simplification principles. Traditional axial map of the Space Syntax get the assumption from the actual traffic values by comparing the results of correlation relationship. Through these methods, the actual relationship between traffic and test values have the correlation value($R^2$= 0.5387) 50% level and was able to get the results.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.71-73
• /
• 2000

Recently researches have been made on the client-side Web GIS, which can lessen the load of a server and provide users with intheractive geographic information. Howwever, the initial delay is the main drawback because of a high volume of geographic data and becausr the server does not associate spatial features with the map scale. Even when a complex spatial object is too small to be distinguished from a point by the naked eyes, it's complete data will be transmitted. This paper proposes a new effcient schema to reduce the response time and increase transmission effciency. Briefly speaking, "Transmit what can be seen" is the main idea. By exploiting the generalization algorithm, the proposed method allows the server to extract readable features from objects according to the display scale. Meanwhile, increasingly detailed map will be cached on the client. Therefore this method will contribute to the transmission efficiency of Web GISs.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.12 no.1
• /
• pp.43-52
• /
• 1994

This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale digital map. Line generalizations are conducted based on Douglas algorithm using 1/25,000 scale topographic maps of southeastern JEJU island which produced by National Geographic Institute to analyze the fitness to the original and problems of graphical representation. Compare to the same scale map which was generated by manual method, a verity of small, but sometimes significant errors ＆ modification of topological relationship have been detected. The research gives full details of three algorithms that operationalize the smallest visible object method, together with some empirical results. A comparison of the results produced by the new algorithms with those produced by manual generalization and Douglas method of data reduction is provided. Also this paper presents the preliminary results of an relationships between the size of smallest visual object and requiring data storages for each algorithms.

• Bulletin of the Korean Mathematical Society
• /
• v.26 no.2
• /
• pp.139-149
• /
• 1989

pp.Hartman and G. Stampacchia [6] proved the following theorem in 1966: If f:X.rarw. $R^{n}$ is a continuous map on a compact convex subset X of $R^{n}$ , then there exists $x_{0}$ ..mem.X such that $x_{0}$ , $x_{0}$ -x>.geq.0 for all x.mem.X. This remarkable result has been investigated and generalized by F.E. Browder [1], [2], W. Takahashi [9], S. Park [8] and others. For example, Browder extended this theorem to a map f defined on a compact convex subser X of a topological vector space E into the dual space $E^{*}$; see [2, Theorem 2]. And Takahashi extended Browder's theorem to closed convex sets in topological vector space; see [9, Theorem 3]. In Section 2, we obtain some variational inequalities, especially, generalizations of Browder's and Takahashi's theorems. The generalization of Browder's is an earlier result of the first author [8]. In Section 3, using Theorem 1, we improve and extend some known fixed pint theorems. Theorems 4 and 8 improve Takahashi's results [9, Theorems 5 and 9], respectively. Theorem 4 extends the first author's fixed point theorem [8, Theorem 8] (Theorem 5 in this paper) which is a generalization of Browder [1, Theroem 1]. Theorem 8 extends Theorem 9 which is a generalization of Browder [2, Theorem 3]. Finally, in Section 4, we obtain variational inequalities for multivalued maps by using Theorem 1. We improve Takahashi's results [9, Theorems 21 and 22] which are generalization of Browder [2, Theorem 6] and the Kakutani fixed point theorem [7], respectively.ani fixed point theorem [7], respectively.

• Journal of the Korean Geographical Society
• /
• v.39 no.5 s.104
• /
• pp.804-818
• /
• 2004

As spatial data resources become more abundant, the potential for conflict among them increases. Those conflicts can exist between two or many spatial datasets covering the same area and categories. Therefore, it becomes increasingly important to be able to effectively relate these spatial data sources with others then create new spatial datasets with matching geometry and topology. One extensive spatial dataset is US Census Bureau's TIGER file, which includes census tracts, block groups, and blocks. At present, however, census maps often carry information that conflicts with municipally-maintained detailed spatial information. Therefore, in order to fully utilize census maps and their valuable demographic and economic information, the locational information of the census maps must be reconciled with the more accurate municipally-maintained reference maps and imagery. This paper formulates a conceptual framework and two map models of map conflation to make geometrically and topologically consistent source maps according to the reference maps. The first model is based on the cell model of map in which a map is a cell complex consisting of 0-cells, 1-cells, and 2-cells. The second map model is based on a different set of primitive objects that remain homeomorphic even after map generalization. A new hierarchical based map conflation is also presented to be incorporated with physical, logical, and mathematical boundary and to reduce the complexity and computational load. Map conflation principles with iteration are formulated and census maps are used as a conflation example. They consist of attribute embedding, find meaning node, cartographic 0-cell match, cartographic 1-cell match, and map transformation.

• Journal of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.669-681
• /
• 2001

This paper introduces the notions of essential and inessential map for countably $textsc{k}$-set contractive maps. These ideas enable us to establish a Krasnoselskii-Petryshyn compression and expansion theorem in a cone for countably $textsc{k}$-set contractive maps.

• The Pure and Applied Mathematics
• /
• v.17 no.2
• /
• pp.167-173
• /
• 2010

In this paper, we introduce the concept of a weakly P-space which is a generalization of a P-space and prove that for any covering map f : $X{\rightarrow}Y$, X is a weakly P-space if and only if Y is a weakly P-space. Using these, we investigate the minimal basically disconnected cover of weakly P-spaces and their products.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.25-27
• /
• 2001

컴퓨터와 통신 기술의 급소간 발전으로 이동 매체를 통한 정보 서비스 요구가 급증하고 있다. 이 중에서 이동 매체를 통한 전자 지도 서비스는 전송 정보의 용량이 크고 출력 장치의 resource를 많이 요구하기 때문에 이를 극복하기 위한 연구가 필요하다. 이 논문에서는 무선 지도 서비스 환경의 bandwidth 제약 조건과 resource 제약 조건을 새로이 정의하고 이를 해결하는 동적 약도 생성 기법을 소개한다. 본 논문은 resource 제약 조건을 해결하기 위해 지도 정확성의 기준을 완화하여 재 정의한 generalization 기법을 도입하며, bandwidth 제약 조건을 해결하기 위해 설정된 threshold 값을 만족하는 filtering 기법을 제안 및 설계 구현한다.