• Journal of Information Technology Applications and Management
• /
• v.29 no.3
• /
• pp.25-41
• /
• 2022

While there exists voluminous literature on the internationalization of the firms, it has focused on mature firms or born-global firms. There is still a lack of research on firm that is in the growth stage between venture and mature firm. To fill this gap, this paper focuses on the newly public firm which is enter the stock market through initial public offerings (IPO). Specifically, I examine the relationship between the early listing and internationalization. In the venture firm aspect, the decision of the IPO necessary to allow to change organization structure, ownership and take a risk from environmental movements. This paper suggests early listing is a behavior of entrepreneur orientation. According to empirical results, there is a positive relationship between early listing and internationalization. It implies that early listing may help international expansion by sourcing finance, reputations from market. Furthermore, this study emphasizes the importance of financial slack resources to international expansion. I conclude that ventures need not only early entering in stock market but also securing sufficient financial slack resources to achieve sustainable growth in the international market.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.314-314
• /
• 2000

This study deals with the analysis of the effectiveness of a safer belt in frontal crash. ATB, Articulated Total Body, program is used as a dynamics solver of the occupant model. ATB is a public code, however, the program is somewhat cumbersome to use due to lack of sufficient user interface. A preprocessor and a postprocessor are, therefore, developed for a user friendly graphic interface in Windows environment. Dialog boxes are used for an interface with GEBOD, Generator of Body Data, for human anthropometry and with ADAMS for vehicle dynamics. It is found through three test simulations that simulated results are in good agreement with those obtained by ATB. The effect of the initial slack of safety belt is investigated for frontal crash using the developed program.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.7
• /
• pp.21-28
• /
• 2017

Practical models for FPGA architectures which include performance- and/or density-enhancing components such as carry chains, wide function multiplexers, and memory/multiplier blocks are being applied to academic FPGA placement tools which used to rely on simple imaginary models. Previously the techniques such as pre-packing and multi-layer density analysis are proposed to remedy issues related to such practical models, and the wire length is effectively minimized during initial analytic placement. Since timing should be optimized rather than wire length, most previous work takes into account the timing constraints. However, instead of the initial analytic placement, the timing-driven techniques are mostly applied to subsequent steps such as placement legalization and iterative improvement. This paper incorporates the timing driven techniques, which check if the placement meets the timing constraints given in the standard SDC format, and minimize the detected violations, with the existing analytic placer which implements pre-packing and multi-layer density analysis. First of all, a static timing analyzer has been used to check the timing of the wire-length minimized placement results. In order to minimize the detected violations, a function to minimize the largest arrival time at end points is added to the objective function of the analytic placer. Since each clock has a different period, the function is proposed to be evaluated for each clock, and added to the objective function. Since this function can unnecessarily reduce the unviolated paths, a new function which calculates and minimizes the largest negative slack at end points is also proposed, and compared. Since the existing legalization which is non-timing driven is used before the timing analysis, any improvement on timing is entirely due to the functions added to the objective function. The experiments on twelve industrial examples show that the minimum arrival time function improves the worst negative slack by 15% on average whereas the minimum worst negative slack function improves the negative slacks by additional 6% on average.

• Journal of the Korean Society of Safety
• /
• v.32 no.3
• /
• pp.117-122
• /
• 2017

In this study, we studied the ride quality considering the deterioration effects of the three type couplers (single, double, and ring types) for EMUs. In order to know the impact occurred when an urban transit vehicle is under breaking, we tested the conditions of the service brake and the emergency brake. Normal coupler models without any slack showed similar dynamic performance results under all breaking conditions. But if the couplers become old, the initial pre-stresses are removed because of permanent compressive deformation in rubber. For three types of the old coupler models without the initial pre-stress, we evaluated dynamic performances of each type. As the results, the maximum and average acceleration levels of the double type and the ring type were similarly low in all conditions. But the accelerations of the single type coupler was high when compared to those of the double and ring types. In addition, Jerk value of the single type model associated with ride quality was high up to 15 times to the ring type in condition of the service braking in empty vehicle weight. Jerk value of the double type model was high up to 6 times to the ring type.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.21 no.45
• /
• pp.165-180
• /
• 1998

To make a scheduling for minimizing the tardiness of delivery, we present an efficient heuristic algorithm for job-shop scheduling problems with due dates. The SDME(Slack Degree Modified Exchange) algorithm, which is the proposed heuristic algorithm, carries out the operation in two phases. In the phase 1, a dispatching rule is employed to generate an active or non-delay initial schedule. In the phase 2, tasks selected from a predetermined set of promising target operations in the initial schedule are tested to ascertain whether, by left-shifting their start times and rearranging some subset of the remaining operations, one can reduce the total tardiness. In the numerical example, the results indicate that the proposed SDME algorithm is capable of yielding notable reductions in the total tardiness for practical size problems.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2023.11a
• /
• pp.105-106
• /
• 2023

In project projects where various factors arise, the construction company's initial establishment of a reasonable process plan reduces various variables and potential risks. In order to create a densely written initial process plan, it is necessary to compare the economic feasibility of time and money by reflecting Slack time. Through this, site managers can lead a successful project based on reasonable and stable construction.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.153-171
• /
• 2002

In this paper, we present an efficient pricing strategy, the pivot and probe Algorithm for Network Flow Problems(PAPANET), specifically for solving capacitated, linear network flow problem (NPs). The PAPANET begins with an initial relaxed network problem(RNP), consisting of all the nodes and initial candidate arcs(possibly a few least cost arcs form the original problem and a set of all the artificial and slack arcs). After an initial solution to the RNP is derived by pivoting, the PROBE procedure identifies a set of most violated arcs from the noncandidate arcs that are not considered to be in the current RNP, and adds them to the RNP. The procedure also discards a set of least favorable, zero flow, nonbasic arcs from the RNP. The new RNP is solved to optimality and the procedure continues until all of the dual constraints of the noncandidate arcs are satisfied by the dual solution to the RNP. The PAPANET effectively reduces the problem size, time per pivot, and solution CPU time by eliminating noncandidate arcs. Computational tests on randomly generated problems indicate that PAPANET achieves and average savings of 50-80% of the solution CPU time of that of a comparable standard network simplex implementation.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.9
• /
• pp.424-430
• /
• 2001

A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.8
• /
• pp.1281-1286
• /
• 2003

A line search algorithm to increase a convergence in Newton's method is developed and applied to nonlinear finite element analysis. The algorithm is based on the slack line search theory which is an efficient algorithm to determine initial acceleration coefficient, variable backtracking algorithm proposed by some researchers, and convergence criterion based on residual norm. Also, it is capable of avoiding exceptional diverging conditions. Developed program is tested in metal forming simulation such as forging and ring rolling. Numerical result shows the validity of the algorithm for a highly nonlinear system .