• Bulletin of the Korean Mathematical Society
• /
• v.28 no.2
• /
• pp.201-205
• /
• 1991

• Kyungpook Mathematical Journal
• /
• v.10 no.1
• /
• pp.69-73
• /
• 1970

• Kyungpook Mathematical Journal
• /
• v.17 no.1
• /
• pp.95-96
• /
• 1977

• Bulletin of the Korean Mathematical Society
• /
• v.25 no.2
• /
• pp.221-232
• /
• 1988

• Communications of Mathematical Education
• /
• v.21 no.1 s.29
• /
• pp.19-31
• /
• 2007

Currently the mathematics gifted students educational program is plentifully being developed for the elementary and the junior high school students. But the educational program for the gifted students who comes and goes to the high school is not many. This study look for the regularity and generalization of Hanoi Tower with 4 pillars, from the regularity and generalization of Hanoi Tower with 3 pillars. I think this study will be a clue to find the regularity and generalization of Hanoi Tower with n pillars, it's not solved still.

• 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 Association of Geographic Information Studies
• /
• v.6 no.1
• /
• pp.12-23
• /
• 2003

The expansion of internet and the development of communication technology have brought about an explosive increasement of data. Further progress has led to the increasing demand for efficient and effective data analysis tools. According to this demand, data mining techniques have been developed to find out knowledge from a huge amounts of raw data. This paper suggests a generalization based classification method which explores rules from real world data appearing repeatedly. Also, it analyzed the relation between weather data and forest fire, and efficiently predicted through it as a prediction model by applying the suggested generalization based classification method to forest fire data. Additionally, the proposed method can be utilized variously in the important field of real life like the analysis and prediction on natural disaster occurring repeatedly, the prediction of energy demand and so forth.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1103-1114
• /
• 2003

Currently, one of the most critical issues in developing the service support system for various spatio-temporal applications is the discoverying of meaningful knowledge from the large volume of moving object data. This sort of knowledge refers to the spatiotemporal moving pattern. To discovery such knowledge, various relationships between moving objects such as temporal, spatial and spatiotemporal topological relationships needs to be considered in knowledge discovery. In this paper, we proposed an efficient method, MPMine, for discoverying spatiotemporal moving patterns. The method not only has considered both temporal constraint and spatial constrain but also performs the spatial generalization using a spatial topological operation, contain(). Different from the previous temporal pattern methods, the proposed method is able to save the search space by using the location summarization and generalization of the moving object data. Therefore, Efficient discoverying of the useful moving patterns is possible.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.6 no.3
• /
• pp.73-82
• /
• 2003

This paper proposes a work procedure for generalizing large-scale digital maps ver. 2.0(1/5,000) into a small-scale digital map(1/25,000). Unlike a existent digital map, the digital map ver. 2.0 has a variety of attribute data as well as graphic data. To perform an efficient map generalization with these structural properties, we establish a work procedure as follow; firstly, delete layers which don't exist in small-scale digital map's feature code, and secondly, generalize features which have been classified into 8 layers, and finally merge 8 layers which have been generalized into 1 layer. Therefore, we expect that a work procedure which is proposed in this paper will play a fundamental role in automated generalization system and will contribute to small-scale digital mapping and thematic mapping.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2011

Recently, demand for the use of cadastral map is increasing in both public and private area. To use cadastral map in web or mobile environment, construction of the multi-representation database(MRDB) that is the compressed into multiple scale from the original map data is recommended. In this study, the map generalization methodology for the cadastral map by applying overlay with topographic map and polygon generalization technique is suggested. This process is composed of three steps, re-constructing the network data of topographic map, polygon merging of parcel lines according to network degree, and applying line simplification techniques. Proposed methodologies are applied to the cadastral map in Suwon area. The result map was generalized into 1:5,000, 1:20,000, 1:100,000 scale, and data compression ratio was shown in 15% 8% 1% level respectively.