• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.85-92
• /
• 2006

In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.135-139
• /
• 2006

Today's social networking services have tens of millions of users, and are growing fast. Their sheer size poses a significant challenge in capturing and analyzing their topological characteristics. Snowball sampling is a popular method to crawl and sample network topologies, but requires a high sampling ratio for accurate estimation of certain metrics. In this work, we evaluate how close topological characteristics of snowball sampled networks are to the complete network. Instead of using a synthetically generated topology, we use the complete topology of Cyworld ilchon network. The goal of this work is to determine sampling ratios for accurate estimation of key topological characteristics, such as the degree distribution, the degree correlation, the assortativity, and the clustering coefficient.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.944-946
• /
• 2004

In this paper, a new technique for electromagnetic topology optimization is proposed. The proposed technique is based on the large-step Markov chain (LSMC) method with novel local optimization algorithm. Because the proposed algorithm keeps a good convergence characteristic of LSMC, fast convergence is assured. The proposed LSMC is verified by an application to an inverse reconstruction problem.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.319-335
• /
• 2012

In this study, we design an applicable model enabling internet protocol television (IPTV) service providers to use a virtual network (VN) for IPTV service delivery. The model addresses the guaranteed service delivery, cost effectiveness, flexible control, and scalable network infrastructure limitations of backbone or IP overlay-based content networks. There are two major challenges involved in this research: i) The design of an efficient, cost effective, and reliable virtual network topology (VNT) for IPTV service delivery and the handling of a VN allocation failure by infrastructure providers (InPs) and ii) the proper approach to reduce the cost of VNT recontruction and reallocation caused by VNT allocation failure. Therefore, in this study, we design a more reliable virtual network topology for solving a single virtual node, virtual link, or video server failure. We develop a novel optimization objective and an efficient VN construction algorithm for building the proposed topology. In addition, we address the VN allocation failure problem by proposing VNT decomposition and reconstruction algorithms. Various simulations are conducted to verify the effectiveness of the proposed VNT, as well as that of the associated construction, decomposition, and reconstruction algorithms in terms of reliability and efficiency. The simulation results are compared with the findings of existing works, and an improvement in performance is observed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2191-2198
• /
• 2013

This paper proposes a RFID cell planning scheme for indoor location-awareness. We theoretically develop four objective functions that yield objective goals significant to the optimal design of a RFID cell topology and simulation is conducted to evaluate the performance of the proposed RFID cell planning scheme. We also evaluate the performance of the proposed technique after practically installing RFID readers in an indoor space to configure a RFID cell topology. Performance evaluations are conducted in terms of the following objective goals: minimal number of RFID readers for configuring a RFID cell topology, maximal RFID cell coverage areas for indoor location-awareness, minimal overlapping cells, and maximal indoor location-awareness accuracy.

• Journal of Korea Multimedia Society
• /
• v.24 no.11
• /
• pp.1526-1537
• /
• 2021

Due to the difference between the underwater communication environment and the terrestrial communication environment, the radio communication mainly used on the ground cannot be used in underwater. For this reason, in the underwater communication environment, various communication media such as acoustic waves, infrared rays, light and so on has been studied, but there exist several difficulties in operating them individually due to their physical limitations. The concept for overcoming these difficulties is the very underwater multi-media communication, a method to select a communication medium best suitable for the current underwater environment among underwater communication multimedia whenever there occurs underwater communication failure. In this paper, we present an underwater multi-media communication network based on star topology and a fragmentation and reassembly technique to solve the problems caused by the different MTU (Maximum Transmission Unit) sizes among different underwater communication media. We also present the estimations and analysis on processing times in each of fragmentation and reassembly and the total data amount for transmitting fragments in our proposed underwater multi-media communication network.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2018

We propose a modified real-time marching cubes technique that extracts isosurfaces in the form of connected meshes instead of triangle soup. In this way, a various mesh-based isosurface rendering techniques can be implemented and additional information of the isosurfaces such as its topology can be extracted in real-time. In addition, we propose a real-time technique to extract adjacency-triangle structure for geometry shaders that can be used for various shading effects such as silhouette rendering. Compared with the previous technique that welds the output triangles of classical marching cubes, our technique shows up to 300% performance improvement.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2003.11a
• /
• pp.104-109
• /
• 2003

이동 통신과 무선 단말기의 보급이 보편화되면서 사용자의 위치정보를 이용한 위치 기반 서비스(Location Based Service)에 대한 관심이 높아지고 있다. 이러한 위치 기반 서비스를 제공하기 위해서는 이동객체 위치 정보의 효율적인 저장 및 관리가 필요하며 이를 위해 일정 시간 간격을 두고 위치 정보를 획득하여 저장, 관리하는 방법이 연구되어 왔다. 본 논문에서는 이동 객체의 이동경로에 대응되는 위상 정보(Topology)를 이용하여 이동 객체의 위치 정보를 관리하는 기법을 제안한다. 본 기법은 이동 객체가 위상 정보의 노드에 해당하는 위치에 도착할 예상 시점을 계산하고, 그 시점을 위치 획득 시점으로 결정하여 위치 정보를 갱신하며, 또한 명시적으로 저장되지 않은 불확실한 위치 정보의 요청에 대해 위상 정보 노드의 속성 정보와 선형 함수를 이용해 위치 정보를 추정하여 제공한다. 본 기법은 위상 정보의 노드에 대응되는 위치를 획득하여 저장하기 때문에 갱신 횟수와 데이터의 양을 감소시키고, 불확실한 위치 정보에 대한 위치를 추정할 경우, 명시적으로 저장된 위치 정보에서 유추된 이동 객체의 정보와 더불어 이동 객체의 이동 경로를 고려한 위상 정보 속성을 사용하므로, 선형 함수나 스플라인 함수만을 적용하는 것보다 적은 오차를 발생시켜 위치 정보의 정확성을 향상시킬 수 있다.

• Structural Engineering and Mechanics
• /
• v.5 no.2
• /
• pp.209-220
• /
• 1997

The dynamic equations for an arbitrary cluster comprising rigid spheres or assemblies of spheres (subclusters) encountered in granular-type systems are considered. The system is treated within the framework of multibody dynamics. It is shown that for an arbitrary cluster topology the governing equations can be given in an explicit scalar from. The derivation is based on the D'Alembert principle, on inertial coordinate system for each body and direct utilization of the path matrix describing the topology. The scalar form of the equations is important in computer simulations of flow of granular-type materials. An illustrative example of a three-body system is given.

• Honam Mathematical Journal
• /
• v.26 no.3
• /
• pp.331-339
• /
• 2004

The aim of this paper is to show the difference between the notion of digital continuity and that of computer continuity. More precisely, for digital images $(X,\;k_0){\subset}Z^{n_0}$ and $(Y,\;k_1){\subset}Z^{n_1}$, $if(k_0,\;k_1)=(3^{n_0}-1,\;3^{n_1}-1)$, then the equivalence between digital continuity and computer continuity is proved. Meanwhile, if $(k_0,\;k_1){\neq}(3^{n_0}-1,\;3^{n_1}-1)$, then the difference between them is shown in terms of the uniform continuity property.