• 융합보안논문지
• /
• 제2권2호
• /
• pp.89-97
• /
• 2002

멀티미디어 인터넷 망에서 호 라우팅은 번호나 이름을 라우팅 주소로 번역하며 라우팅 주소는 연결 설정을 위해 사용된다. 트래픽 엔지니어링 기능은 트래픽 관리(Traffic Management), 용량 관리(Capacity Management), 그리고 네트워크 계획(Network Planning) 등을 포함한다. 본 논문에서는 트래픽 엔지니어링의 기능 중 트래픽 관리 기능에서 호 라우팅(Call Routing)과 연결/베어러-패스라우팅을 위한 기본 기능을 제시한다.

• Journal of East Asia Management
• /
• 제3권2호
• /
• pp.43-64
• /
• 2022

Exploring innovations for latecomers to catch up has been a popular concern in industry and academia. Over the last decade, more and more East Asian latecomer firms have moved beyond imitation and are delivering innovative products and services to the market. However, the semiconductor latecomers from China have limited success in catching up with more mature semiconductor firms. Our study examines how semiconductor latecomers to break through the latecomer's dilemma by innovation and achieve catch-up. We use a single-case approach for the Semiconductor Manufacturing International Corporation (SMIC) vertical development process to analysis its innovation path of catching up. The study's results showed that SMIC relied on the government's policy and funding support, and based on the strategic endurance of entrepreneurs, it persisted in technology R&D investment and independent innovation for 20 years. SMIC finally smashed the dilemma of latecomers and successfully achieved catch-up. With these findings, we believe that the path of catching up innovation for semiconductor latecomers should be equipped with independent innovation of technology, strategic leadership of entrepreneurs and support of government policies. As these factors are combined, latecomer firms' position is expected to rise and catch-up will become visible. Our study contributes to some enlightenment on the innovation path for latecomers in China and global semiconductors to achieve their catch-up.

• 경영과학
• /
• 제18권1호
• /
• pp.105-118
• /
• 2001

The common shortest path problem is to find the shortest route between two specified nodes in a transportation network with only one traffic mode. The public transportation network with multiple traffic mode is a more realistic representation of the transportation system in the real world, but it is difficult for the conventional shortest path algorithms to deal with. The genetic algorithm (GA) is applied to solve this problem. The objective function is to minimize the sum of total service time and total transfer time. The individual description, the coding rule and the genetic operators are proposed for this problem.

• 한국경영과학회지
• /
• 제18권2호
• /
• pp.23-43
• /
• 1993

This paper employs fuzzy variables instead of deterministic variables for job times in a project network. A fuzzy variable has its value restricted by a possibility distribution. This paper utilizes the triangular possibility distribution which has three estimated times. That is normal, resonable, and crash job times. This paper develops a fuzzy k-longest path algorithm, by utilizing the k-longest path algorithm. This algorithm will be useful to control the project the project network by considering the project completion possibility.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• 한국경영과학회지
• /
• 제23권4호
• /
• pp.11-20
• /
• 1998

This paper deals with a mathematical model and an algorithm for the problem of determining k most vital arcs in the shortest path problem. First, we propose a 0-1 integer programming model for finding k most vital arcs in shortest path problem given the ordered set of paths with cardinality q. Next, we also propose an algorithm for finding k most vital arcs ln the shortest path problem which uses the 0-1 Integer programming model and shortest path algorithm and maximum flow algorithms repeatedly Malik et al. proposed a non-polynomial algorithm to solve the problem, but their algorithm was contradicted by Bar-Noy et al. with a counter example to the algorithm in 1995. But using our algorithm. the exact solution can be found differently from the algorithm of Malik et al.

• Management Science and Financial Engineering
• /
• 제11권2호
• /
• pp.85-103
• /
• 2005

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• 가정과삶의질연구
• /
• 제23권5호
• /
• pp.15-26
• /
• 2005

The purpose of this study was to investigate the factors affecting credit card attitudes, financial management practices, and sound credit card use among college students, and to conceptualize a theoretical model. Earlier studies identified a number of antecedent variables (such as gender, year in college, job experience, amount of allowance, family income, living with parents, having taken a personal financial management course) and intervening variables (such as attitudes towards credit cards and financial management practices) as useful predictors of sound credit card practices. Four hundred and thirty four undergraduate students in Daejeon participated in this study. Stepwise multiple regression and path analysis were conducted. The results of this study were as follows: 1. Students' attitudes towards credit cards were affected by their you in college, whether they were living with their parents, and the amount of their allowance. Similarly, students' financial management practices were affected by their year in college, whether they were living with their parents, the amount of their allowance, and whether and not they had taken a personal financial management course. 2. Sound credit card practices were influenced by students' gender, their year in college, the amount of their allowance, attitudes towards credit cards, and financial management practices. 3. The path-analysis model demonstrates the relationships among the antecedent variables, intervening variables (credit card attitude, financial management practices), and sound credit card use.

• 지식경영연구
• /
• 제22권3호
• /
• pp.17-29
• /
• 2021

본 연구의 목적은 타겟 데이트 펀드의 글라이드패스를 적용하는 것에 있어서 기존의 정적인 방법론이 아닌 시장기대(Market Expectations)를 반영한 동적 방법론을 적용하여 투자의 성과를 분석하는 것이다. 시장기대는 ETF 시장의 유통 주식 수를 활용하여 산출하였다. 2011년 말부터 2020년 10월까지 분석 기간에서 시장기대를 고려하는 동적 글라이드패스 모델포트폴리오가 기존의 정적 글라이드패스를 적용하는 모델포트폴리오보다 더 우수한 결과가 나타남을 보일 수 있었다. 분석 결과 ETF의 유통 주식 수가 늘어나는 시점에서는 위험자산 편입 비중을 늘리는 것이, 반대의 경우에는 위험 자산 편입 비중을 줄이는 것이 수익에 있어서 유리한 것으로 나타났다. 본 연구의 결과는 연금 자산운용이라는 경계를 벗어나 공모 펀드 시장과 ETF 시장까지의 폭넓은 관점의 지식경영에 관심을 가지는 연구자 및 자산운용 종사자에게 유용한 이론 및 실무적 시사점을 제공할 것으로 기대한다.

• 융합정보논문지
• /
• 제11권2호
• /
• pp.82-89
• /
• 2021

본 연구의 목적은 투자자의 은퇴 시점뿐만 아니라 시장의 예측 변동성을 동시에 고려하여 Target Date Fund의 위험자산 편입 비율을 동적으로 조정하는 새로운 Glide Path를 제안하고, 은퇴 시점만 고려하여 위험자산 편입 비율이 정해지는 전통적 Glide Path와 투자 성과를 비교 분석하는 것이다. 시장 변동성의 예측치로는 역사적 변동성, 시계열모형인 GARCH 변동성, 그리고 변동성지수인 VKOSPI를 활용하였으며, 2003년부터 2020년까지의 분석 기간에서 변동성을 고려하는 새로운 동적 Glide Path의 투자 성과가 우수함을 보여주었다. 3가지 변동성 예측모형 모두에서 은퇴 시점만을 고려하는 Glide Path보다 수익률은 더 높고 위험은 더 낮아지면서 투자 성과 지표인 Sharpe Ratio가 개선되었다. 실증 분석 결과는 은퇴예정자뿐만 아니라 Target Date Fund 운용업계에 새로운 Glide Path의 활용 가능성을 제시하고 있다.