• Journal of East Asia Management
• /
• v.3 no.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.

• Korean Management Science Review
• /
• v.18 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.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.

• Journal of Families and Better Life
• /
• v.23 no.5 s.77
• /
• 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.

• Management Science and Financial Engineering
• /
• v.4 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.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
• /
• v.11 no.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.

• Knowledge Management Research
• /
• v.22 no.3
• /
• pp.17-29
• /
• 2021

The purpose of this study is to analyze investment performance by applying dynamic methodologies that reflect market expectations rather than traditional static methodologies in applying the glide path of target date fund. In calculating market expectations, the number of distributed shares in the ETF market was used, and the dynamic glide path model portfolio considering market expectations in the analysis period from late 2011 to October 2020 could show better results than the existing static glide path. According to the analysis, increasing the portion of risky assets at a time when the number of shares in the ETF's distribution increases, and in the opposite case, reducing the portion of risky assets is advantageous for profit. The results of this study are expected to provide useful theoretical and practical implications for researchers and asset management workers who are interested in knowledge management from a broad perspective beyond the boundary of pension asset management to the public fund market and ETF market.

• Journal of Convergence for Information Technology
• /
• v.11 no.2
• /
• pp.82-89
• /
• 2021

The objective of this study is to propose a new Glide Path that dynamically adjusts the risky asset inclusion ratio of the Target Date Fund by simultaneously considering the market's forecast volatility as well as the time of investor retirement, and to compare the investment performance with the traditional Target Date Fund. Forecasts of market volatility utilize historical volatility, time series model GARCH volatility, and the volatility index VKOSPI. The investment performance of the new dynamic Glide Path, which considers stock market volatility has been shown to be excellent during the analysis period from 2003 to 2020. In all three volatility prediction models, Sharpe Ratio, an investment performance indicator, is improved with higher returns and lower risks than traditional static Glide Path, which considers only retirement date. The empirical results of this study present the potential for the utilization of the suggested Glide Path in the Target Date Fund management industry as well as retirees.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.917-923
• /
• 2005

Scheduling is one of the main functions in construction project to determine the sequence of activities necessary to complete a project. The scheduling techniques provide important information crucial to a project's success. Highway construction project the paving activity can be considered a linear activity. Linear scheduling technique may be better suited for linear projects than other scheduling techniques. A new type of scheduling in linear project is calling Linear Scheduling Model (LSM). The Project monitoring and controlling is very ease to identify that all the stage of linear project and have more advantages.