• The Pure and Applied Mathematics
• /
• v.18 no.2
• /
• pp.141-155
• /
• 2011

We compute zeta functions of 1-solenoids. When our 1-solenoid is nonorientable, we compute Artin-Mazur zeta function and Lefschetz zeta function of the 1-solenoid and its orientable double cover explicitly in terms of adjacency matrices and branch points. And we show that Artin-Mazur zeta function of orientable double cover is a rational function and a quotient of Artin-Mazur zeta function and Lefschetz zeta function of the 1-solenoid.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.7
• /
• pp.793-801
• /
• 1992

This paper proposes a method of extracting connected strokes and characters in a Hangeul document image represented by a quadtree. Connected strokes are extracted by examining adjacency for each node of a black region to the side of east and south. Then, each character is extracted by the sizes and the relations of connected strokes. This is done by iterative vertical and horizontal manipulation. The result shows all characters are extracted in the same sequence as that of context with space and time efficiency.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.171-184
• /
• 2024

In this paper, we show that if G is strongly regular then the Gallai graph Γ(G) and the anti-Gallai graph ∆(G) of G are edge-regular. We also identify conditions under which the Gallai and anti-Gallai graphs are themselves strongly regular, as well as conditions under which they are 2-connected. We include also a number of concrete examples and a discussion of spectral properties of the Gallai and anti-Gallai graphs.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.83-92
• /
• 2012

Location-based services (LBS) are increasingly popular due to the improvement of geo-positioning capabilities and wireless communication technology. However, in order to enjoy LBS services, a user requesting a query must send his/her exact location to the LBS provider. Therefore, it is a key challenge to preserve user's privacy while providing LBS. To solve this problem, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, 2PASS does not fully guarantee the actual user privacy because it does not take the real user distribution into account. Hence, in this paper, we propose a nearest neighbor query processing algorithm that supports K-anonymity property based on the weighted adjacency graph(WAG). Our algorithm not only preserves the location of a user by guaranteeing k-anonymity in a query region, but also improves a bandwidth usage by reducing unnecessary search for a query result. We demonstrate from experimental results that our algorithm outperforms the existing one in terms of query processing time and bandwidth usage.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.60 no.2
• /
• pp.13-24
• /
• 2018

As food consumption pattern changes (reduced rice consumption and increased consumption of fresh vegetables), managing upland fields became a greater priority. However, the agricultural infrastructure projects have been focused on rice farming, and the infrastructure level to support dry fields cultivation is insufficient. The purpose of this study was to spatial distribution analysis of these dry fields with farm manager registration information. Using FRAGSTATS, we analyzed landscape indices (TA/CA, NP, PD, LSI, LPI, PLADJ, COHESION, CONNECT, AI) of farmlands in which farmers in 13 regions (Si or Gun) cultivated dry-field crops. As results of this analysis, the total area of the fields in Naju-si, Hampyeong-gun and Suncheon-si were found to be wider, but the average area of a patch in Youngam-gun, Hampyeong-gun and Jangseong-gun were wider than other regions. On average, each farmer had farmlands containing of 1.7~2.4 patches and cultivated crops in fields of 0.2~0.5 ha. Farmlands of Hampyeong-gun, Youngam-gun, Naju-si showed high values in adjacency indices, however the farmlands of Suncheon and Gwangyang showed fragmented distribution with low values in adjacency indices. These results of fragmentation analysis of farmlands could be used when we establish the plan of an agricultural infrastructure project or select places for a collaborative agricultural management business promotion project.

• Honam Mathematical Journal
• /
• v.36 no.3
• /
• pp.695-706
• /
• 2014

Various properties of digital covering spaces have been substantially used in studying digital homotopic properties of digital images. In particular, these are so related to the study of a digital fundamental group, a classification of digital images, an automorphism group of a digital covering space and so forth. The goal of the present paper, as a survey article, to speak out utility of digital covering theory. Besides, the present paper recalls that the papers [1, 4, 30] took their own approaches into the study of a digital fundamental group. For instance, they consider the digital fundamental group of the special digital image (X, 4), where X := $SC^{2,8}_4$ which is a simple closed 4-curve with eight elements in $Z^2$, as a group which is isomorphic to an infinite cyclic group such as (Z, +). In spite of this approach, they could not propose any digital topological tools to get the result. Namely, the papers [4, 30] consider a simple closed 4 or 8-curve to be a kind of simple closed curve from the viewpoint of a Hausdorff topological structure, i.e. a continuous analogue induced by an algebraic topological approach. However, in digital topology we need to develop a digital topological tool to calculate a digital fundamental group of a given digital space. Finally, the paper [9] firstly developed the notion of a digital covering space and further, the advanced and simplified version was proposed in [21]. Thus the present paper refers the history and the process of calculating a digital fundamental group by using various tools and some utilities of digital covering spaces. Furthermore, we deal with some parts of the preprint [11] which were not published in a journal (see Theorems 4.3 and 4.4). Finally, the paper suggests an efficient process of the calculation of digital fundamental groups of digital images.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.4
• /
• pp.429-435
• /
• 2009

This paper propose color assessment method using HSI model to evaluate quantitative quality of mosaic images by aerial digital frame camera. Firstly, we convert RGB color into HSI model and we extract six pixel information of S and I corresponding to H from adjacency image by using HSI model. Secondly, a method to measure similarity and contrast is proposed and performed for assesment of observation regarding adjacency images. Through these procedure, we could generate four parameters. We could observe that both of the evaluation results by proposed method and the evaluation results by visual were almost similar. This facts support that our method based on several formula can be an objective method to evaluate a quality of mosaic images itself.

• Journal of the Korean Geographical Society
• /
• v.41 no.2 s.113
• /
• pp.188-194
• /
• 2006

Three-dimensional topological data is essential for 3D modeling and application such as emergency management and 3D network analysis. This paper reviewed current 3D topological data model and developed a method to construct 3D topological node-relation data structure from 2D computer aided design (CAD) data. The method needed two steps with medial axis-transformation and topological node-relation algorithms. Using a medial-axis transformation algorithm, the first step is to extract skeleton from wall data that was drawn polygon or double line in a CAD data. The second step is to build a topological node-relation structure by converting rooms to nodes and the relations between rooms to links. So, links represent adjacency and connectivity between nodes (rooms). As a result, with the conversion method 3D topological data for micro-level sub-unit of each building can be easily constructed from CAD data that are commonly used to design a building as a blueprint.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.19-28
• /
• 2015

In this paper, we proposed an algorithm for the identification of relieving or worsening current traffic congestion using historic traffic congestion patterns. Historical congestion patterns were placed in an adjacency list. The patterns were constructed to represent spatial and temporal length for status of a congested road. Then, we found information about historical traffic congestions that were similar to today's traffic congestion and will use that information to show how to change traffic congestion in the future. The most similar pattern to current traffic status among the historical patterns corresponded to starting section of current traffic congestion. One of our experiment results had average error when we compared identified changes of the congestion for one of the sections in the congestion road by using our proposal and real traffic status. The average error was 15 minutes. Another result was for the long congestion road consisting of several sections. The average error for this result was within 10 minutes.