• Kyungpook Mathematical Journal
• /
• v.54 no.3
• /
• pp.477-483
• /
• 2014

In this paper, we introduce a new class of regular generalized b-continuous map and study some of their properties as well as inter relationship with other continuous maps.

• The Pure and Applied Mathematics
• /
• v.4 no.2
• /
• pp.115-119
• /
• 1997

We show that if $f_{i}$:$X_{i}$ longrightarrow Y is strongly continuous(resp. weakly continuous, set connected, compact, feebly continuous, almost-continuous, strongly $\theta$-continuous, $\theta$-continuous, g-continuous, V-map), then F : $X_1 \bigoplus X_2$longrightarrow Y is strongly continuous(resp.weakly continuous, set connected, compact, feebly continuous, almost-continuous, strongly $\theta$-continuous, $\theta$-continuous, g-continuous, V-map).

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2009.04a
• /
• pp.75-78
• /
• 2009

As a digital map is tile based of 2D, it is difficult to be satisfied with accuracy and up-to-date. In this study, we analyzed requirements of an object-oriented continuous digital map and designed the system. The digital map is 3D continuous object and has the accuracy and up-to-date, and designs with management system, transfer system, change information management system, frequent updating system and, same time updating system.

• Journal of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.573-582
• /
• 1995

J.Milnor[Mi2] has introduced the notion of directional entropy in his study of Cellular Automata. Cellular Automaton map can be considered as a continuous map from a space $K^Z^n$ to itself which commute with the translation of the lattice $Z^n$. Since the space $K^Z^n$ is compact, map S is uniformly continuous. Hence S is a block map(a finite code)[He]. (S is said to have a finite memory.) In the case of n = 1, we have a shift map, T on $K^Z$, and a block map S and they together generate a $Z^2$ action.

• Spatial Information Research
• /
• v.18 no.1
• /
• pp.27-37
• /
• 2010

As a pilot project of the National Spatial Data Infrastructure, "Quality upgrade of continuous cadastral map and Conversion of land use zoning map" is performed last year. In this study, for the following main project, its result is analyzed and problems occurred on the way carried out are extracted. The area change before and after conversion is compared, and relationship with the continuous cadastral map is analysed on the data of Ansung-Si. And than, systematic improvement method is suggested based on that problem.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.49-54
• /
• 2003

As of date, the cadastral information which is the utility to be computerized have not been identical with local autonomous entities and relational groups each other and updated real-time, therefore the relation group or the academic circles carried out in many researches on a cadastral map matching, but the cadastral maps have not been even occurred the expansion and contraction so that the theory arrangement doesn't seem simple as to a cadastral map matching. As being take such reality into consideration, We have to be based on $\boxDr$construction ministry of the rules for continuous map$\boxUl$ for a continuous cadastral map with using PBLIS data; so the operators use Autodesk Map 5 which added applications and match the neat line by the identical scale, the different scale, the district boundary and the origin according to the judgement myself We have the purpose to minimize the problem as analyzing the accuracy between the parcel coordinates If the matched map and ones of moved map.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.259-261
• /
• 2010

This paper describes the results and possibility of continuous cadastral map compilation with digital camera image. A high quality serial cadastral map can be produced and work efficiency can be increased with using digital aero-photogrammetry when edge matching method could be used to match digital cadastral map.

• Journal of the Chungcheong Mathematical Society
• /
• v.30 no.4
• /
• pp.381-385
• /
• 2017

Let (X, d) be a compact metric space with metric d and let f : $X{\rightarrow}X$ be a continuous map. In this paper, we consider that for a subset ${\Lambda}$, a map f has the eventual shadowing property if and only if f has the eventual shadowing property on ${\Lambda}$. Moreover, a map f has the eventual shadowing property if and only if f has the eventual shadowing property in ${\Lambda}$.

• Kyungpook Mathematical Journal
• /
• v.55 no.4
• /
• pp.859-870
• /
• 2015

The notion of quasi-valuation maps based on a subalgebra and an ideal in BCK/BCI-algebras is introduced, and then several properties are investigated. Relations between a quasi-valuation map based on a subalgebra and a quasi-valuation map based on an ideal is established. In a BCI-algebra, a condition for a quasi-valuation map based on an ideal to be a quasi-valuation map based on a subalgebra is provided, and conditions for a real-valued function on a BCK/BCI-algebra to be a quasi-valuation map based on an ideal are discussed. Using the notion of a quasi-valuation map based on an ideal, (pseudo) metric spaces are constructed, and we show that the binary operation * in BCK-algebras is uniformly continuous.

• Smart Media Journal
• /
• v.13 no.2
• /
• pp.129-135
• /
• 2024

In this paper, we propose a new approach that enhances the continuous optimization performance of the MAP-Elites algorithm. The existing self-referencing MAP-Elites algorithm employed the "DE/rand/1/bin" operator from the differential evolution algorithm, which, due to its lack of rotational invariance, led to a degradation in optimization performance when there were high correlations among variables. The proposed algorithm replaces the "DE/rand/1/bin" operator with the "DE/current-to-rand/1" operator. This operator, possessing rotational invariance, ensures robust performance even in cases where there are high correlations among variables. Experimental results confirm that the proposed algorithm performs better than the comparison algorithms.