• Journal of Forest and Environmental Science
• /
• v.40 no.3
• /
• pp.241-249
• /
• 2024

Human development activities have led to changes in land cover, resulting in the loss of green spaces such as forests and agricultural lands. This loss accompanies issues of habitat reduction and hindrance to wildlife movement. Due to the decrease in urban green spaces, urban green connectivity is reducing. This study aims to analyze changes in green space connectivity through structural and functional changes in green spaces caused by land cover changes. Quantitative analysis of landscape patterns using landscape indices through Fragstats model was employed to analyze the structural changes in green spaces. This study used seven landscape indices to assess the fragmentation and isolation of green spaces. The analysis was focused on changes occurring in agricultural lands, forests, and grasslands within Yongin-si, South Korea, over 20 years from 1989 to 2019. Among the landscape indices for forests, PLAND showed a decrease of approximately 8.2% from 1989 to 2009, while NP exhibited a decline of about 2,025 patches. This indicates both a reduction in the total area of green spaces in Yongin-si. Also, we analyzed functional changes based on landscape index variations in forest land within the study area between 2009 and 2019, and least-cost path (LCP) analysis was conducted using Linkage Mapper. Results yielded 18 and 16 links for 2009 and 2019, respectively, with 12 common links. It was observed that five links showed a slight decrease, indicating partial deletions of links, contributing to the fragmentation and discontinuity of forests.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.49-56
• /
• 2005

Reuse of software is the process of developing software system which does not develop all modules newly but construct system by using existing software modules. Object oriented concept introduces dynamic binding and polymorphism, which increases number of executable Paths. In this case static analysis of source code is not useful to find executable path. These concepts occur new Problems in retesting. Tradition testing method can not cover complex relations such as inheritance, message Passing and instance of and can not apply on object oriented retesting. we propose the method to reduce the number of methods and classes to be retested in associated class relation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.6
• /
• pp.824-832
• /
• 1998

The significant additional path loss is caused by scattering, diffraction, and attenuation of propagation. Most of the wave propagation models for rural areas mainly have considered the influence of topography but ignored the effects due to land usage. The goal of this paper is development of the field strength prediction program for Cheju which is used the contour map and the effects due to land usage. In oder to classify the propagation path and divide the environment of land, data of the terrain and the land-cover are formed into a pixel. Two-ray model is transformed into equivalent model by the predicted reflection coefficient and the slope of terrain. For non line of sight, the additional loss is determined by quantitative analysis. The result show good accord and the wave propagation model program can be applied to predicted the service region in rural area of Cheju.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.69-75
• /
• 2015

This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

• Journal of the Korean Geotechnical Society
• /
• v.21 no.4
• /
• pp.83-98
• /
• 2005

In this paper, a conceptual approach of the stress path method was newly proposed for a rational estimation of settlements of saturated clay deposits. In the proposed approach, settlement-related characteristic deformation behaviors of a specific clay deposit, which can cover all probable stress changes expected in the field, are experimentally evaluated in advance. Then settlements of various structures constructed on the deposit are easily estimated with only the characteristic deformation behaviors and without any additional experimental effort. In Part I of this paper, in order to provide practicality to the new conceptual approach, we developed a detailed procedure which is capable of evaluating characteristic deformation behaviors of a saturated clay deposit with only a limited number of tests and easily predicting deformations under a given stress change using the characteristic deformation behaviors. The applicability of the developed procedure was clearly shown by presenting an actual application example.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.898-902
• /
• 1995

STEP is a neutral model for exchanging CAD modelbetween different CAD systms. The paper presents a laser path contour generation for rapid prototyping originated form STEP format files without using any tools nor libraries for STEP data manipulation. Polygons are generated from every point on the layer of given thickness, which are the intersections of layer plane and edges stored in entity tables. Curves are approximated with polygons whitin segment tolerance limit in order to cover sculptured surfaces. With the advantage of less data loss in direct slicing over STL formats, the system developed in this work shows a good potential to provide data share with various CAD systems including RP data preparation.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.05a
• /
• pp.1080-1084
• /
• 2007

Many different methods for sound source localization have been developed. Most of them mainly depend on time delay of arrival (TDOA) or on empirical or analytic head related transfer functions (HRTFs). In real implementation, since the direct path between a source and a sensor is interrupted by obstacles as like a head or body of robot, it has to be considered the number of sensors as well as their positions. Therefore, in this paper, we present the methods, which are included sensor position problem, to localize the sound source with 4 microphones to cover the 3D space. Those are modified two-step TDOA methods. Our conclusion is that the different method has to be applied in case to be different microphone position on real robot platform.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1723-1726
• /
• 2003

Clean and well maintained roadway signs are important for preserving driver's safety. The existing signs on the roadway must be periodically re-painted in order to maintain clean state. However, current sign painting operations are manually performed now. These are very slow and workers are exposed to very dangerous and hazard working environment. In this paper, we present the method for automating this job with gantry robot and spray system. In addition, we suggest two design concepts to resolve the problem that it is impractical to make the gantry system so big as to cover whole lane width. In order to show the validity of this system, the painting operation is simulated and experimentally executed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4A
• /
• pp.241-249
• /
• 2005

ATM based MPLS(Multiprotocol Label Switching) is discussed for its provisioning QOS commitment capabilities, Traffic engineering and smooth migration for BcN in Korea. At this time, due to the comprehensive nature of ATM protocol, ATM has been adapted as the backbone system for carrying Internet traffic[1,2,3,4]. This paper presents preventive congestion control mechanisms for detecting HTR(Hard-To-Reach) LSP(Label Switched Path) in ATM based MPLS systems. In particular, we have introduced a HTR LSP detection method using network signaling information in an ATM layer. MPLS related studies can cover LSP failures in a physical layer fault, it can not impact network congestion status. Here we will present the research results for introducing HTR LSP detection methods and control mechanisms and this mechanism can be implementing as SOC for high speed processing a packet header. We concluded that it showed faster congestion avoidance abilities with a more reduced system load and maximized the efficiency of network resources by restricting ineffective machine attempts.