• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.1-10
• /
• 1995

We have analyzed the reliability of failure models in circuit-switched networks. These models are grid topology circuit-switched networks, and each node transmits a packet to a destination node using a Flooding routing method. We have assumed that the failure of each link and node is independent. We have considered two method to analyze reliability in these models : The Karnaugh Map method and joint probability method. In this two method, we have analyzed the reliability in a small grid topology circuit switched network by a joint probability method, and comared analytic results with simulated ones. For a large grid enormous. So, we have evaluated the reliability of the network by computer simulation techniques. As results, we have found that the analytic results are very close to simulated ones in a small grid topology circuit switched network. And, we have found that network reliability decreases exponentially, according to increment of link or node failure, and network reliability is almost linearly decreased according to increment of the number of links, by which call has passed. Finally, we have found an interesting result that nodes in a center of the network are superior to the other nodes from the reliability point of view.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.443-454
• /
• 2017

We study a notion of q-frequent hypercyclicity of linear maps between the Banach algebras consisting of operators on a separable infinite dimensional Banach space. We derive a sufficient condition for a linear map to be q-frequently hypercyclic in the strong operator topology. Some properties are investigated regarding q-frequently hypercyclic subspaces as shown in [5], [6] and [7]. Finally, we study q-frequent hypercyclicity of tensor products and direct sums of operators.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.2 s.2
• /
• pp.97-104
• /
• 1993

The Cadastre assumed as one of the most important Part of GIS has the highest priority in GIS model and Organization of the Cadasual embraces the modern methods of gaining and collecting geometric type cadastral data concerning on the land and it's ownership. Geneally, the measurement of the topologigraphic map offers great convenience for the architects to device. But the graphic precision of the value from the map is too low for many users, the large scale digital map as well as cadastral map can solve these problems. So it is necessary to get the coordinates of the characteristic points and the graphic information. In this paper, for calculating the point of measured element such as distance, and it's adjustment. This paper dicusses the methodes also, the combination of GIS data and Cadastral data and the geo-reference system, topology, data system, data modeling and so on.

• Bulletin of the Korean Mathematical Society
• /
• v.21 no.2
• /
• pp.67-75
• /
• 1984

Let X be a topological space. We consider a groupoid G over X and the quotient groupoid G/N for any normal subgroupoid N of G. The concept of groupoid (topological groupoid) is a natural generalization of the group(topological group). An useful example of a groupoid over X is the foundamental groupoid .pi.X whose object group at x.mem.X is the fundamental group .pi.(X, x). It is known [5] that if X is locally simply connected, then the topology of X determines a topology on .pi.X so that is becomes a topological groupoid over X, and a covering space of the product space X*X. In this paper the concept of the locally simple connectivity of a topological space X is applied to the groupoid G over X. That concept is defined as a term '1-connected local subgroupoid' of G. Using this concept we topologize the groupoid G so that it becomes a topological groupoid over X. With this topology the connected groupoid G is a covering space of the product space X*X. Further-more, if ob(.overbar.G)=.overbar.X is a covering space of X, then the groupoid .overbar.G is also a covering space of the groupoid G. Since the fundamental groupoid .pi.X of X satisfying a certain condition has an 1-connected local subgroupoid, .pi.X can always be topologized. In this case the topology on .pi.X is the same as that of [5]. In section 4 the results on the groupoid G are generalized to the quotient groupoid G/N. For any topological groupoid G over X and normal subgroupoid N of G, the abstract quotient groupoid G/N can be given the identification topology, but with this topology G/N need not be a topological groupoid over X [4]. However the induced topology (H) on G makes G/N (with the identification topology) a topological groupoid over X. A final section is related to the covering morphism. Let G$_{1}$ and G$_{2}$ be groupoids over the sets X$_{1}$ and X$_{2}$, respectively, and .phi.:G$_{1}$.rarw.G$_{2}$ be a covering spimorphism. If X$_{2}$ is a topological space and G$_{2}$ has an 1-connected local subgroupoid, then we can topologize X$_{1}$ so that ob(.phi.):X$_{1}$.rarw.X$_{2}$ is a covering map and .phi.: G$_{1}$.rarw.G$_{2}$ is a topological covering morphism.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.627-632
• /
• 2002

One main purpose of environmental monitoring after oil spill is developing ESI (Environmental Sensitivity) Maps. Environmental impacts caused by the spilt oil are strongly depending upon the coastal topology and geology. Monitoring all impacted shorelines is almost impossible; using high-resolution satellite images such as IKONOS greatly contributes to improve the efficiency of on-site researches, at the same time, reliability of ESI maps.

• The Bulletin of The Korean Astronomical Society
• /
• v.36 no.1
• /
• pp.46.2-46.2
• /
• 2011

Planck is already in active operation, and in a few years a detailed CMB anisotropy map will be compiled, surpassing WMAP both in temperature and polarization. The E mode - E mode autocorrelation power spectrum at large scales contains weak but sizable information on the history of cosmic reionization. We show our latest advance of our own simulation of cosmic reionization that incorporates Pop III stars, and provide a forecast for Planck polarization measurement.

• Honam Mathematical Journal
• /
• v.33 no.4
• /
• pp.575-589
• /
• 2011

In order to examine the possibility of some topological structures into the fields of network science, telecommunications related to the future internet and a digitization, the paper studies the Marcus Wyse topological structure. Further, this paper develops the notions of lattice based Marcus Wyse continuity and lattice based Marcus Wyse homeomorphism which can be used for studying spaces $X{\subset}R^2$ in the Marcus Wyse topological approach. By using these two notions, we can study and classify lattice based simple closed Marcus Wyse curves.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.575-590
• /
• 2017

A new class of functions called $R_{\theta}$-supercontinuous functions is introduced. Their basic properties are studied and their place in the hierarchy of strong variants of continuity, which already exist in the literature, is elaborated. The class of $R_{\theta}$-supercontinuous functions properly contains the class of $R_z$-supercontinuous functions [39] which in turn properly contains the class of $R_{cl}$-supercontinuous functions [43] and so includes all cl-supercontinuous (clopen continuous) functions ([38], [34]) and is properly contained in the class of $R_{\delta}$-supercontinuous functions [24].

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2346-2361
• /
• 2017

A major challenge in cloud infrastructure is the efficient allocation of virtual network elements on top of substrate network elements. Path algebra is a mathematical framework which allows the validation and convergence analysis of the mono-constraint or multi-constraint routing problems independently of the network topology or size. The present study proposes a new heuristic approach based on mathematical framework "paths algebra" to map virtual nodes and links to substrate nodes and paths in cloud. In this approach, we define a measure criterion to rank the substrate nodes, and map the virtual nodes to substrate nodes according to their ranks by using a greedy algorithm. In addition, considering multi-constraint routing in virtual link mapping stage, the used paths algebra framework allows a more flexible and extendable embedding. Obtained results of simulations show appropriate improvement in acceptance ratio of virtual networks and cost incurred by the infrastructure networks.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.