• Proceedings of the Korean DIstribution Association Conference
• /
• 2003.05a
• /
• pp.71-92
• /
• 2003

Specialty stores, which have been major channels of Korean cosmetic industry, are bringing out a lot of problems in current distribution channel systems because of its repeated depression of sales. Especially, inefficiency in distribution channel systems is caused by cannibalistic price-off competition between specialty stores, too many launchings of new products, excessive sales promotion, absence or surplus of stock, and so on. Using qualitative methods such as in-depth interview and group discussion, the authors attempt In diagnose fundamental problems of the cosmetic specialty store distribution channels in three viewpoints； achievement of goals, marketing flows in channels, and relationship management. In addition, this paper suggests core strategies for building up the competitiveness of both of the maker and the retailer, The competitive strategies are mainly about securing profitability of retailers, smoothening of marketing flows in channels, and building-up trustful relationships between distribution channel members.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1165-1174
• /
• 2007

Mobile ad hoc networks suffer from the re-construction of the routing path as a node on the path moves away and/or fails. In this paper we propose a multipath routing scheme, designed for the network based on the directional antennas, in which a new path is quickly recovered by do-touring to an alternative neighbor called braid. Simulations are conducted in random networks with 50 nodes uniformly deployed in a $1,000m{\times}1,000M$ area where, all nodes have a transmission range of 250m and the average node moving speed varies from 0 to 10m/s. The proposed approach under the ideal antenna with K(>1) directional sectors achieves better results compared with the case of K=1, the omnidirectional antenna model, in terms of the metrics: packet delivery ratio and average number of hops for the routing paths. As further study, a scheme to alleviate the heavy amount of latency accompanied by the rout setup is urgently required.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.981-988
• /
• 2023

As the usage of unmanned aerial vehicles expands, the development and the demand of related technologies are increasing. As the frequency of operation increases and the convenience of operation is emphasized, the importance of related autonomous flight technology is also highlighted. Establishing a path plan to reach the destination in autonomous flight of an unmanned aerial vehicle is important in guidance and control, and a technology for automatically generating path plan is required in order to maximize the effect of unmanned aerial vehicle. In this study, the optimization research of path planning using rapid-exploring random tree method was performed for increasing the effectiveness of autonomous operation. The path planning optimization method considering the characteristics of the unmanned aerial vehicle is proposed. In order to achieve indexes such as optimal distance, shortest time, and passage of mission points, the path planning was optimized in consideration of the mission goals and dynamic characteristics of the unmanned aerial vehicle. The proposed methods confirmed their applicability to the generation of path planning for unmanned aerial vehicles through performance verification for obstacle situations.

• Proceedings of the KOR-KST Conference
• /
• 2002.02a
• /
• pp.45-77
• /
• 2002

교통혼잡 문제가 점점 심각해짐에 따라 대중교통의 중요성은 날로 부각되며, 대중교통을 지원하기 위한 정책들이 속속 입안되고 있어 대중교통을 심도 있게 분석할 수 있는 틀의 개발은 필연적이라 할 수 있다. 이에 본 연구는 대중교통 통행배정모형 개발과 대중교통 기종점통행량(OD) 추정을 목적으로 수행되었다. 대중교통 통행배정모형의 개발부분에서는 기존의 대중교통 통행배정모형이 개별차량과 다른 대중교통의 특성을 정확히 반영하고 있지 못하다는 한계를 극복하고자, 최적경로 탐색에는 유전자 알고리즘(Genetic Algorithm)을 통행량 배정에는 로짓모형을 기반으로 한 확률적 통행량 배정모형(Stochastic Network Loading Model)을 이용하여 TATSN 모형을 개발하였다. 그리고, 대중교통 기종점통행량의 추정은 전통적인 기종점통행량 추정 방법인 기종점조사 방법이 시간과 비용이 과대하게 소요된다는 단점을 인식하여 관측통행량을 이용하여 추정하는 방법을 제안하였다.

• Journal of Biomedical Engineering Research
• /
• v.24 no.2
• /
• pp.77-82
• /
• 2003

Virtual colonoscopy is a non-invasive computerized procedure to detect polyps by examining the colon from a CT data set. To fly through the inside of colons. the extraction of a suitable flight-path is necessary to Provide the viewpoint and view direction of a virtual camera. However. manual path extraction by Picking Points is a very time-consuming and difficult task due 1,c, the long and complex shape of colon. Also, existing automatic methods are computationally complex. and tend to generate an improper and/or discontinuous path for complicated regions. In this paper, we propose a fast flight-path generation algorithm using the distance and order maps. The order map Provides all Possible directions of a path. The distance map assigns the Euclidean distance value from each inside voxel to the nearest background voxel. By jointly using these two maps. we can obtain a proper centerline regardless of thickness and curvature of an object. Also, we Propose a simple smoothing technique that guarantees not to collide with the surface of an object. The phantom and real colon data are used for experiments. Experimental results show that for a set of human colon data, the proposed algorithm can provide a smoothened and connected flight-path within a minute on an 800MHz PC. And it is proved that the obtained flight-Path provides successive volume-rendered images satisfactory for virtual navigation.

• Economic Analysis
• /
• v.27 no.3
• /
• pp.1-32
• /
• 2021

This study empirically analyzes whether bank capital channel and risk-taking channel for monetary policy work for domestic banks in South Korea by analyzing the impact of the expansionary monetary policy on the rate spread between deposit and loan, capital ratio, and loan amount. For the empirical analysis, the Uhlig (2005)'s sign-restricted SVAR(Structural Vector Auto-Regression) model is used. The empirical results are as follows: the bank's interest rate margin increases, the capital ratio improves, risk-weighted asset ratio increases, and the amount of loans increases in response to expansionary monetary shock. This empirical results confirm that bank capital channel and risk-taking channel work in domestic banks, similar to the previous research results. The implications of this study are as follows. Although the expansionary monetary policy has the effect of improving the bank's financial soundness and profitability in the short term as bank capital channel works, it could negatively affect the soundness of banks by encouraging banks to pursue risk in the long run as risk-taking channel works. It is necessary to note that the capital ratio according to the BIS minimum capital requirement of individual banks may cause an illusion in supervising the soundness of the bank. So, the bank's aggressive lending expansion may lead to an inherent weakness in the event of a crisis. Since the financial authority may have an illusion about the bank's financial soundness if the low interest rate persists, the authority needs to be actively interested in stress tests and concentration risk management in the pillar 2 of the BIS capital accord. In addition, since system risk may increase, it is necessary to conduct regular stress tests or preemptive monitoring of assets concentration risk.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.162-163
• /
• 2011

송전손실 배분에 대한 방법 중에서 발전 증가 패턴에 따른 방법을 제시하였다. 손실 감도 계산을 통하여 모선별 계통 손실을 구한다. 기저점에서 동작점으로 증가해 갈 때의 송전 손실 배분에 대해서 공정하게 할 수 있는 알고리즘이다. 모선별 계통 손실은 적분 경로에 따라 달라지게 되고, 이에 따라 어떻게 달라지는 지 시뮬레이션을 통하여 알아보았다.