• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.173-181
• /
• 2013

This paper proposes a heuristic optimal solution of multicommodity transportation problem. The proposed algorithm has 3 steps. First the proposed algorithm transforms multicommodity transshipment problem to a general transportation problem, but if the problem is a multicommodity transportation problem, it is not transformed. And the multicommodity is disassembled to a single commodity. Second if it is a multicommodity transportation problem, the algorithm selects the minimum cost according to commodity, on the other hand if it is a multicommodity transshipment problem, the algorithm directly selects the minimum cost based on demand area. And the algorithm assigns carloadings to be satisfied the supply and demand quantity. The algorithm repeats these processes until a given demand quantity is satisfied. Last if it has a condition that is able to reduce the transportation expense, the proposed algorithm controls the assignment quantity of the initial value that got from the step 2. The proposed algorithm was applied to two multicommodity transportation problem and three multicommodity transshipment problem and it got more good result than an existing linear programming method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1452-1460
• /
• 2000

A series of papers in recent literature on logical topology design for wavelength routed optical networks have proposed mathematical models and solution methods unifying logical topology design wavelength assignment and traffic routing. The most recent one is by Krishnaswamy and Sivarajan which is more unifying and complete than the previous models. Especially the mathematical formulation is an integer linear program and hence regarded in readiness for an efficient solution method compared to the previous nonlinear programming models. The solution method in [7] is however elementary one relying on the rounding of linear program relaxation. When the rounding happens to be successful it tends to produce near-optimal solutions. In general there is no such guarantee so that the obtained solution may not satisfy the essential constraints such as logical -path hop-count and even wavelength number constraints. Also the computational efforts for linear program relaxation seems to be too excessive. In this paper we propose an improved and unifying solution method based on the same to be too excessive. In this paper we propose an improved and unifying solution method based on the same model. First its computation is considerably smaller. Second it guarantees the solution satisfies all the constraints. Finally applied the same instances the quality of solution is fairly competitive to the previous near optimal solution.

• Journal of the Korean Geotechnical Society
• /
• v.39 no.4
• /
• pp.45-54
• /
• 2023

The settlement prediction during the design phase is primarily conducted using theoretical methods. However, measurement-based settlement prediction methods that predict future settlements based on measured settlement data over time are primarily used during construction due to accuracy issues. Among these methods, the hyperbolic method is commonly used. However, the existing hyperbolic method has accuracy issues and statistical limitations. Therefore, a weighted nonlinear regression hyperbolic method has been proposed. In this study, two weighting methods were applied to the weighted nonlinear regression hyperbolic method to compare and analyze the accuracy of settlement prediction. Measured settlement plate data from two sites located in Busan New Port were used. The settlement of the remaining sections was predicted by setting the regression analysis section to 30%, 50%, and 70% of the total data. Thus, regardless of the weight assignment method, the settlement prediction based on the hyperbolic method demonstrated a remarkable increase in accuracy as the regression analysis section increased. The weighted nonlinear regression hyperbolic method predicted settlement more accurately than the existing linear regression hyperbolic method. In particular, despite a smaller regression analysis section, the weighted nonlinear regression hyperbolic method showed higher settlement prediction performance than the existing linear regression hyperbolic method. Thus, it was confirmed that the weighted nonlinear regression hyperbolic method could predict settlement much faster and more accurately.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of Korean Academic Society of Nursing Education
• /
• v.20 no.4
• /
• pp.628-638
• /
• 2014

Purpose: This study identifies the relation among the essentials of fundamental nursing skills performance (EFNSP), work capability and stress from work experienced by new clinical nurses. Method: This is a cross-sectional descriptive study with a self-reported questionnaire. The subjects were 224 new clinical nurses employed by general hospitals having more than 400 beds. The data, collected from February 10 to March 7, 2014, were analyzed using descriptive statistics, t-tests, ANCOVA, Pearson's correlation analysis and hierarchical linear regression. Results: The highest frequency of EFNSP of new clinical nurses was vital sign measurement (4.74, ${\pm}.89$) and the lowest frequency of performance was Basic CPR & defibrillator application (1.81, ${\pm}.94$). There were significant positive correlations between frequency and confidence of EFNSP (r=.64, p<.001), frequency and work capability (r=.34, p<.001), and confidence of EFNSP and work capability (r=.48, p<.001), but negative correlation stress from work and work capability (r=-.17, p=.009). General characteristics, stress from work, frequency and confidence in EFNSP and stress from work explain 25.1% of work capability. Conclusion: This result suggests the importance of EFNSP education in nursing schools and availability of opportunities to practice EFNSP during the post-graduation waiting period until assignment to a hospital.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.10
• /
• pp.29-34
• /
• 2011

We present a network coding scheme which is designed for improving throughput in multi-hop wireless network with multi-radio multi-channel. The co-channel interference and unreliability of wireless transmissions cause the wireless network to reduce throughput. In wireless network, multi-radio multi-channel technology shows benefit to cut down channel interferences and contentions. And network coding can reduce the complexity of scheduling and improve throughput by increasing usage of links in wireless network. In this paper, we propose a method of channel assignment and transmission scheduling in intra-session network coding that efficiently improve throughput for multi-hop wireless network by using mathematical modeling and linear programming. Moreover, we evaluate the performance of the intra-session network coding scheme by using AMPL with CPLEX. The simulation results show that intra-session network coding can achieve better throughput than traditional routing.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2196-2203
• /
• 1999

This paper describes the bus scheduling problem and register optimization method in datapath synthesis. Scheduling is process of operation allocation to control steps in order to minimize the cost function under the given circumstances. For that purpose, we propose some formulations to minimize the cost function for bus assignment to get an optimal and minimal cost function in hardware allocations. Especially, bus and register minimization technique are fully considered which are the essential topics in hardware allocation. Register scheduling is done after the operation and bus scheduling. Experiments are done with the DFG model of fifth-order digital ware filter to show its effectiveness. Structural integer programming formulations are used to solve the scheduling problems in order to get the optimal scheduling results in the integer linear programming environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1193-1200
• /
• 2005

In this paper, we proposed an image hiding method which decreases the amount of calculation encrypting partial data rather than the whole image data using a discrete wavelet transform and a linear scalar quantization which have been adopted as the main technique in JPEG2000 standard and then implemented the proposed algorithm to hardware. A chaotic system was used instead of encryption algorithms to reduce further amount of calculation. It uses a method of random changing method using the chaotic system of the data in a selected subband. For ciphering the quantization index it uses a novel image encryption algorithm of cyclical shifting to the right or left direction and encrypts two quantization assignment method (Top-down coding and Reflection coding), made change of data less. The experiments have been performed with the proposed methods implemented in software for about 500 images. The hardware encryption system was synthesized to find the gate-level circuit with the Samsung $0.35{\mu}m$ Phantom-cell library and timing simulation was performed, which resulted in the stable operation in the frequency above 100MHz.

• Journal of vocational education research
• /
• v.36 no.2
• /
• pp.23-50
• /
• 2017

The purpose of this study was to determine the hierarchical linear relationship among receptivity to organizational change, individual variables of professors and organizational variables in junior colleges. The population for this study was 12,920 professors in 139 junior colleges. Using random sampling method considering subject, 800 professors in 40 colleges were sampled for this study. The data were collected from May 26 to June 13. A total of 445 out of 800 questionnaires were returned of which 441 of 40 junior colleges were used for analysis after data cleaning. These data were analyzed by both descriptive statistics and One-way ANOVA with Random Effects, Ranmdom-Coefficients Regression Model, and Intercepts-and Slopes-as-Outcomes Model of hierarchical linear model(HLM). All data analysis was accomplished using the SPSS 20.0 for windows program and the HLM 6.0 for windows program. An alpha level of 0.05 was established priori for determining the significance. The findings of the study were as follows: First, the level of receptivity to organizational change of professions in junior college was 3.94. Second, 56.5% of total variance in receptivity to organizational change was individual level variance. 43.5% of total variance in receptivity to organizational change was organizational level variance. Third, personal valence about organizational change, psychological ownership, experience of assignment, years of service and job security had positive effects on receptivity to organizational change while years of service had negative effects on receptivity to organizational change. The effect of personal valence about organizational change was highest, and the effect of job security was lowest. Fourth, degree of organizational change, participative decision-making, group culture and accessibility of information related to organizational change had positive effects on receptivity to organizational change. The effect of degree of organizational change was highest, and the effect of accessibility of information related to organizational change was lowest.

• Journal of Korean Society of Transportation
• /
• v.27 no.6
• /
• pp.147-156
• /
• 2009

We present a methodology for modeling and solving the transit frequency design problem with variable demand. The problem is described as a bi-level model based on a non-cooperative Stackelberg game. The upper-level operator problem is formulated as a non-linear optimization model to minimize net cost, which includes operating cost, travel cost and revenue, with fleet size and frequency constraints. The lower-level user problem is formulated as a capacity-constrained stochastic user equilibrium assignment model with variable demand, considering transfer delay between transit lines. An efficient algorithm is also presented for solving the proposed model. The upper-level model is solved by a gradient projection method, and the lower-level model is solved by an existing iterative balancing method. An application of the proposed model and algorithm is presented using a small test network. The results of this application show that the proposed algorithm converges well to an optimal point. The methodology of this study is expected to contribute to form a theoretical basis for diagnosing the problems of current transit systems and for improving its operational efficiency to increase the demand as well as the level of service.