• Journal of Korean Tunnelling and Underground Space Association
• /
• v.24 no.4
• /
• pp.341-353
• /
• 2022

Pipelines are buried in urban area, and the position (depth and orientation) of buried pipeline should be clearly identified before ground excavation. Although various geophysical methods can be used to detect the buried pipeline, it is not easy to identify the exact information of pipeline due to heterogeneous ground condition. Among various non-destructive geo-exploration methods, ground penetration radar (GPR) can explore the ground subsurface rapidly with relatively low cost compared to other exploration methods. However, the exploration data obtained from GPR requires considerable experiences because interpretation is not intuitive. Recently, researches on automated detection technology for GPR data using deep learning have been conducted. However, the lack of GPR data which is essential for training makes it difficult to build up the reliable detection model. To overcome this problem, we conducted a preliminary study to improve the performance of the detection model using finite difference time domain (FDTD)-based numerical analysis. Firstly, numerical analysis was performed with homogeneous soil media having single permittivity. In case of heterogeneous ground, numerical analysis was performed considering the ground heterogeneity using fractal technique. Secondly, deep learning was carried out using convolutional neural network. Detection Model-A is trained with data set obtained from homogeneous ground. And, detection Model-B is trained with data set obtained from homogeneous ground and heterogeneous ground. As a result, it is found that the detection Model-B which is trained including heterogeneous ground shows better performance than detection Model-A. It indicates the ground heterogeneity should be considered to increase the performance of automated detection model for GPR exploration.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.9
• /
• pp.857-862
• /
• 2011

This paper studies the output consensus problem for a class of heterogeneous linear multi-agent systems under a fixed directed communication network. The dynamics, as well as its dimension, of each agent can widely differ from the others, but all the agents are assumed to have the same transfer matrix. In addition, only the system outputs are constrained to be delivered through the network. Under these conditions, we show that the output consensus is reached by a group of identical controllers, which is designed to achieve the state consensus for the homogeneous multi-agent system obtained from the minimal realization of the transfer matrix. Finally, an example is given to demonstrate the proposed result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.218-224
• /
• 2001

The objective of Distributed Parallel Computing is to solve the computationally intensive problems, which have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. In this paper, we propose a computational model including the generalized graph representation method of distributed parallel systems for speedup analysis, and analyze how the super-linear speedup is achieved when scheduling of programs with diverse embedded parallelism modes onto a distributed heterogeneous supercomputing network environment. The proposed representation method can also be applied to simple homogeneous or heterogeneous systems whose components are heterogeneous only in terms of the processor speed. In order to obtain the core speedup, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled while minimizing the communication overhead.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.119-134
• /
• 2001

This paper proposed a dynamic transit vehicle simulation model and a dynamic transit passengers simulation model, which can simultaneously simulate the transit vehicles and passengers traveling on a transit network, and also developed an algorithm of dynamic departure time choice model based on individual passenger. The proposed model assumes that each passenger's behavior is heterogeneous based on stochastic process by relaxing the assumption of homogeneity among passengers and travelers have imperfect information and bounded rationality to more actually represent and to simulate each passenger's behavior. The proposed model integrated a inference and preference reforming procedure into the learning and decision making process in order to describe and to analyze the departure time choices of transit passengers. To analyze and evaluate the model an example transit line heading for work place was used. Numerical results indicated that in the model based on heterogeneous passengers the travelers' preference influenced more seriously on the departure time choice behavior, while in the model based on homogeneous passengers it does not. The results based on homogeneous passengers seemed to be unrealistic in the view of rational behavior. These results imply that the aggregated travel demand models such as the traditional network assignment models based on user equilibrium, assuming perfect information on the network, homogeneity and rationality, might be different from the real dynamic travel demand patterns occurred on actual network.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4483-4501
• /
• 2020

Recent findings identified the scatter and shape of MFD (macroscopic fundamental diagram) is heavily influenced by the spatial distribution of link density in a road network. This implies that the concept of MFD can be utilized to divide a heterogeneous road network with different degrees of congestion into multiple homogeneous subnetworks. Considering the actual traffic data is usually incomplete and inaccurate while most traffic partition algorithms rely on the completeness of the data, we proposed a three-step partitioned algorithm called Iso-MB (Isoperimetric algorithm - Merging - Boundary adjustment) permitting of incompletely input data in this paper. The proposed algorithm was implemented and verified in a simulated urban transportation network. The existence of well-defined MFD in each subnetwork was revealed and discussed and the selection of stop parameter in the isoperimetric algorithm was explained and dissected. The effectiveness of the approach to the missing input data was also demonstrated and elaborated.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.11-15
• /
• 2018

The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.857-860
• /
• 2009

Intrusion detection in Wireless Sensor Network (WSN) is of practical interest in many applications such as detecting an intruder in a battlefield. The intrusion detection is defined as a mechanism for a WSN to detect the existence of inappropriate, incorrect, or anomalous moving attackers. For this purpose, it is a fundamental issue to characterize the WSN parameters such as node density and sensing range in terms of a desirable detection probability. In this paper, we consider this issue according to two WSN models: homogeneous and heterogeneous WSN.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.2
• /
• pp.53.4-54
• /
• 2021

Although the era of very large telescopes has come, small telescopes still have advantages for fast follow-up and long-term monitoring observation. Intensive monitoring survey of nearby galaxies (IMSNG) aims to understand the nature of the supernovae (SNe) by catching the early light curve from them with the network of small telescopes from 0.4-m to 1.0-m all around the world. To achieve the scientific goals with heterogeneous facilities, three factors are important. First, automatic processes as soon as data is uploaded will increase efficiency and shorten the time. Second, searching for transients is necessary to deal with newly emerged transients for fast follow-up observation. Finally, the Integrated process for different telescopes gives a homogeneous output, which will eventually make connections with the database easy. Here, we introduce the integrated pipeline, 'gppy' based on Python, for more than 10 facilities having various configurations and its performance. Processes consist of image pre-process, photometry, image align, image combine, photometry, and transient search. In the connected database, homogeneous output is summarized and analyzed additionally to filter transient candidates with light curves. This talk will suggest the future work to improve the performance and usability on the other projects, gravitational wave electromagnetic wave counterpart in Korea Observatory (GECKO), and small telescope network of Korea (SOMANGNET).

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.229-232
• /
• 2005

Many kinds of communication systems will be co-existed in the next generation communication environment. Location management will be one of the most important strategies in the future communication network. Whether the user gets the service in any kind of communication system, it is required to know the location of the user properly and manages this location information efficiently. In this paper, mobile IP and WCDMA systems are considered as next generation communication systems. We improve the performance of communication in heterogeneous networks adjusting the conventional region-based location management strategy in homogeneous network. This strategy can be adjusted dynamically to the communication system on the basis of packet-to-mobility ratio (PMR) in mobile IP system or call-to-mobility ratio (CMR) in WCDMA system, lots of different system parameters, and movement pattern of the user. This can be also based on the performance analysis with considering signaling cost and database access cost.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.27-32
• /
• 2022

The fifth generation (5G) mobile communication technology is designed to meet all communication needs. Heterogeneous networks (HetNets) are a new emerging network structure. HetNets have greater potential for radio resource reuse and better service quality than homogeneous networks since they can evolve small cells into macrocells. Effective resource allocation techniques reduce inter-user interference while optimizing the utilization of limited spectrum resources in HetNets. This article discusses resource allocation in 5G HetNets. This paper explains HetNets and how they work. Typical cell types in HetNets are summarized. Also, HetNets models are explained in the third section. The fourth component addresses radio resource control and mobility management. Moreover, future study in this subject may benefit from this article's significant insights on how HetNets function.