• Proceedings of KOSOMES biannual meeting
• /
• 2006.11a
• /
• pp.217-219
• /
• 2006

This study focused an water quality response to land-based pollution loads and the appropriate pollutant load reduction in Chinhae Bay using an eco-hydrodynamic model. Land-based discharge foam urban areas, industrial complex and sewage treatment plant was the greatest contributor to cause red-tide blooms and summer hypoxia. Tidal currents velocity af the ebb tide was about 10 cm/s stronger than that of the flood tide. A residual current was simulated to. have a slightly complicated pattern with ranging from 0.1 to. 2.7 cm/s. In Masan Bay, pollutant materials cannot flaw from the inner to the outer bay easily because af residual currents flaw southward at surface and northward at the bottom. The simulation results of COD distribution showedhigh concentrations aver 3 mg/L in the inner part of Masan Bay related pollutant discharge, and charge, and lower levels less than 1.5mg/L in the central part of Chinhae Bay. For improvement water quality in Chinhae Bay, it is necessary to reduce the organic and inorganic loads from paint sources by mare than 50% and ameliorate severe polluted sediment.

• Journal of the Korean Regional Science Association
• /
• v.36 no.2
• /
• pp.3-12
• /
• 2020

Recently, metropolitanization and suburbization have been occurring mainly in large cities, and spatial miss-match between residential and employment areas has increased. Spatial miss-match is different in the metropolitan cities and other metropolitan cities in Korea. Seoul and other metropolitan cities have grown to become centers of business functions, while other metropolitan cities have been transformed into residential function centers. Accordingly, The reverse commuting phenomenon is occurring in the rural metropolitan. The reverse commuting phenomenon limits the employment opportunities of specific classes among urban residents, and cause various problems such as environmental pollution and traffic congestion. Therefore, many studies on spatial mismatch and reverse commuting have been conducted, but a number of studies have been conducted on the Seoul metropolitan area, and research on other metropolitan areas is insufficient. The purpose of this study is to analyze the cause of the commuting phenomenon in the metropolitan area of the non-metropolitan area by considering spatial mismatch and understanding the reverse commutation situation in the local metropolitan area. This study is analyzed by a multi-level model and suggests the need for management of industrial location and expansion of residence in suburban.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.602-610
• /
• 2001

In the MPLS(Multiprotocol Label Switching) forwarding paradigm, once a packet is assigned to a FEC(Forwarding Equivalence Class), no further header analysis is done by subsequent routers; all forwarding is driven by the labels. This has a number of advantages over conventional network layer forwarding. The MPLS LER(Label Edge Router) is located at the boundary of MPLS domain and plays a role in connecting with the existing Internet as an ingress or an egress router. That is, the MPLS LER as an ingress router assigns a label to a packet which enters the MPLS network from the Internet by analyzing its header and forwards to a corresponding next router in MPLS domain. As an egress router, the MPLS LER turns the packets out of the MPLS network by performing the reverse operation. In this paper, we analyze the traffic performance of an MPLS LER system and estimate the IP(Internet Protocol) packet processing capacity of the system using queueing model and simulation. It is found that the maximum IP packet processing capacity of the system is estimated by 420,000 through 460,000 packets/sec.

• Journal of Advanced Navigation Technology
• /
• v.18 no.3
• /
• pp.209-214
• /
• 2014

Current black boxes have a problem of storing unnecessary imagery data recordings without data classification. For this reason, users have to erase videos every time. This method is inadequate for black boxes with limited memory capacity. In this paper, we design and implement a system that recognizes traffic accident situations and saves these recordings by classifying them according to weighted values. The system was made to save video recorded at a 30-sec interval of every event to black box folders by changing names based on weighted value data under the external environment in a 1:10 scale model car. Based on this, when the tests were performed as a major car accident while driving, the videos were created in w2 folder, and when the tests were performed as a minor car accident while stopped, the videos were created in w1 folder.

• Journal of Advanced Navigation Technology
• /
• v.21 no.2
• /
• pp.206-211
• /
• 2017

Recently computing devices by connecting to a network, grid computing, the next generation of digital neural networks that provide maximum service will connect all of the computer such as a PC or server, PDA into one giant network makes the virtual machine. Therefore, we propose the grid computing implementation model to be applied to meteorological business field as follows. First, grid computing will be used for tasks such as the development of numerical models below the mid-scale or test operations, and the final backup of the weather supercomputer. Second, the resources that will constitute grid computing are limited to business PCs and Linux servers operated by the central government considering operational efficiency. Third, the network is restricted to the LAN section, which suggests the implementation of high performance computing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.114-129
• /
• 2005

In this paper, we examine Interleaved Polling with Adaptive Cycle Time (IPACT) algorithm which was proposed to control upstream traffic for Gigabit Ethernet-PONs, and we analyze the performance of the gated service and the limited service of the IPACT mathematically. For the mathematical performance analysis, we model IPACT algorithm as a polling system and use mean-value analysis. We divide arrival rate λ value into three regions and analyze each region accordingly. We obtain average packet delay, average queue size and average cycle time of both the gated and the limited service. We compare analytical results with simulation to verify the accuracy of the mathematical analysis. Upon now, simulation analysis have been used to evaluate the performance of EPONs, which require much time sud effort. Mathematical analysis can be widely used in the design of EPON systems since system designers can obtain various performance results rapidly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1265-1275
• /
• 1999

An adaptive MMSE detector can be used to cancel the MAI in CDMA system. But standard adaptive MMSE detector cannot be used in real mobile environment due to fast fading channel. Furthermore multipath reception make it more difficult to converge to optimum weight values. In this paper we discuss and model the multipath fading environment in Forward-link Synchronous CDMA channels and propose adaptive MMSE RAKE detector structure which can be applied in the mobile station. A proposed adaptive MMSE detector requires estimation of received signal delay and complex channel coefficients such as amplitude and phase variation. These burden can be solved by utilizing the common pilot channel. The pilot channel may have higher power than the traffic channel, which give more exact channel estimation. Moreover RAKE structure gives more accurate and stable result which can be used as reliable reference signal in multipath fading channel environment. With this structure, conventional adaptive algorithm such as LMS or NLMS can be applied in adaptive MMSE detector.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.11
• /
• pp.979-985
• /
• 2012

The design of an efficient scheduler is a key design factor in IEEE 802.16m systems, in order to support services with various QoS smoothly. Although conventional studies of schedules have been suggested, those had problems that are not able to satisfy the delay condition and make the through-put declined, because they only focused on a specific action scenario rather than reflecting practical action scenarios which have real-time and non-real-time traffics variously. In this paper, an efficient uplink scheduling algorithm is proposed for IEEE 802.16m system by introducing the concepts of Virtual Time(VT) and Virtual Finish Time(VFT) based priority determination, and separate buffers for each QoS class in the mobile terminal. Simulation results showed that the proposed scheme had satisfied the delay requirement of real-time services even with improved throughput performance compared to conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.53-60
• /
• 2007

We investigate the end-to-end delay bounds in large scale networks with Differentiated services (DiffServ) architecture. It is generally understood that networks with DiffServ architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, only in lightly utilized cases. We focus on tree networks, which are defined to be acyclic connected graphs. We obtain a closed formula for delay bounds for such networks. We show that, in tree networks, the delay bounds exist regardless of the level of network utilization. These bounds are quadratically proportional to the maximum hop counts in heavily utilized networks; and are linearly proportional to the maximum hop counts in lightly utilized networks. Considering that tree networks, especially the Ethernet networks are being accepted more and more for access networks as well as provider networks, we argue that based on these delay bounds DiffServ architecture is able to support real time applications even for a large network. Throughout the paper we use Latency-Rate (LR) server model, with which it has proven that FIFO and Strict Priority are LR servers to each flows in certain conditions.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.203-210
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.