• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.121-135
• /
• 2013

This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.

• Journal of Broadcast Engineering
• /
• v.20 no.5
• /
• pp.706-717
• /
• 2015

The computer generated hologram (CGH) method is the technology which can generate a hologram by using only a personal computer (PC) commonly used. However, the CGH method requires a huge amount of calculational time for the 3D object with a super multi-light source or a high-definition hologram. Hence, some solutions are obviously necessary for reducing the computational complexity of a CGH algorithm or increasing the computing performance of hardware. In this paper, we propose a method which can generate a digital hologram of the 3D object with a super multi-light source using parallel distributed computing. The traditional methods has the limitation of improving CGH performance by using a single PC. However, the proposed method where a server PC efficiently uses the computing power of client PCs can quickly calculate the CGH method for 3D object with super multi-light source. In the experimental result, we verified that the proposed method can generate the digital hologram with 1,5361,536 resolution size of 3D object with 157,771 light source in 121 ms. In addition, in the proposed method, we verify that the proposed method can reduce generation time of a digital hologram in proportion to the number of client PCs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.2
• /
• pp.57-63
• /
• 2012

Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.

• Investigative Magnetic Resonance Imaging
• /
• v.6 no.2
• /
• pp.137-146
• /
• 2002

Purpose : This paper introduces an improved classification approach which adopts a deterministic relaxation method and an agglomerative clustering technique for the classification of MRI using neural network. The proposed approach can solve the problems of convergency to local optima and computational burden caused by a large number of input patterns when a neural network is used for image classification. Materials and methods : Application of Hopfield neural network has been solving various optimization problems. However, major problem of mapping an image classification problem into a neural network is that network is opt to converge to local optima and its convergency toward the global solution with a standard stochastic relaxation spends much time. Therefore, to avoid local solutions and to achieve fast convergency toward a global optimization, we adopt MFA to a Hopfield network during the classification. MFA replaces the stochastic nature of simulated annealing method with a set of deterministic update rules that act on the average value of the variable. By minimizing averages, it is possible to converge to an equilibrium state considerably faster than standard simulated annealing method. Moreover, the proposed agglomerative clustering algorithm which determines the underlying clusters of the image provides initial input values of Hopfield neural network. Results : The proposed approach which uses agglomerative clustering and deterministic relaxation approach resolves the problem of local optimization and achieves fast convergency toward a global optimization when a neural network is used for MRI classification. Conclusion : In this paper, we introduce a new paradigm to classify MRI using clustering analysis and deterministic relaxation for neural network to improve the classification results.

• Journal of the Society of Naval Architects of Korea
• /
• v.30 no.1
• /
• pp.125-133
• /
• 1993

Most studies on the vibration analysis of a beam-column with ends elastically restrained and various intermediate constraints have been based on the Euler beam theory, which is inadequate for beam-columns of low slenderness ratios. In this paper, analytical methods for vibration and dynamic sensitivity of a Timoshenko beam-column with ends elastically restrained and various intermediate constraints are presented. Firstly, an exact solution method is shown. Since the exact method requires considerable computational effort, a Rayleigh-Ritz analysis is also investigated. In the latter two kinds of trial functions are examined for comparisions : eigenfunctions of the base system(the system without intermediate constraints) and polynomials having properties corresponding to the eigenfunctions of the base system. The results of some numerical Investigations show that the Rayleigh-Ritz analysis using the characteristic polynomials is competitive with the exact solutions in accuracy, and that it is much more efficient in computations than using the eigenfunctions of the base system, especially in the dynamic sensitivity analysis. In addition, the prediction of the changes of natural frequencies due to the changes of design variables based on the first order sensitivity is in good agreements with that by the ordinary reanalysis as long as the changes of design variables are moderate.

• Geophysics and Geophysical Exploration
• /
• v.9 no.3
• /
• pp.241-249
• /
• 2006

Due to the long tectonic history and the very complex geologic formations in Korea, the anisotropic characteristics of subsurface material may often change very greatly and locally. The algorithms commonly used, however, may not give sufficiently precise computational results of traveltime data particularly for the complex and strong anisotropic model, since they are based on the two-dimensional (2D) earth and/or weak anisotropy assumptions. This study is intended to develope a three-dimensional (3D) modeling algorithm to precisely calculate the first arrival time in the complex anisotropic media. Considering the complex geology of Korea, we assume 3D TTI (tilted transversely isotropy) medium having the arbitrary symmetry axis. The algorithm includes the 2D non-linear interpolation scheme to calculate the traveltimes inside the grid and the 3D traveltime mapping to fill the 3D model with first arrival times. The weak anisotropy assumption, moreover, can be overcome through devising a numerical approach of the steepest descent method in the calculation of minimum traveltime, instead of using approximate solution. The performance of the algorithm developed in this study is demonstrated by the comparison of the analytic and numerical solutions for the homogeneous anisotropic earth as well as through the numerical experiment for the two layer model whose anisotropic properties are greatly different each other. We expect that the developed modeling algorithm can be used in the development of processing and inversion schemes of seismic data acquired in strongly anisotropic environment, such as migration, velocity analysis, cross-well tomography and so on.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.1
• /
• pp.36-45
• /
• 2015

Recently, a lot of studies have been made about the methods used to generate turbulent velocity fields stochastically in order to effectively predict broadband flow noise. Among them, the FRPM (Fast Random Particle Mesh) method which generates turbulence with specific statistical properties using turbulence kinetic energy and dissipation obtained from the steady solution of the RANS (Reynolds Averaged Navier-Stokes) equations has been successfully applied. However, the FRPM method cannot be applied to the flow noise problems involving intrinsic unsteady characteristics such as centrifugal fan. In this paper, to effectively predict the broadband noise generated by centrifugal fan, U-FRPM (unsteady FRPM) method is developed by extending the FRPM method to be combined with the unsteady numerical solutions of the unsteady RANS equations to generate the turbulence considered as broadband noise sources. Firstly, an unsteady flow field is obtained from the unsteady RANS equations through CFD (Computational Fluid Dynamics). Then, noise sources are generated using the U-FRPM method combined with acoustic analogy. Finally, the linear propagation model which is realized through BEM (Boundary Element Method) is combined with the generated sources to predict broadband noise at the listeners' position. The proposed technique is validated to compare its prediction result with the measured data.

• 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 Biomedical Engineering Research
• /
• v.21 no.4
• /
• pp.391-401
• /
• 2000

Flow through compliant tubes with linear taper in wall thickness is numerically simulated by finite element analysis. For verification of the numerical method, flow through a compliant stenotic vessel is simulated and the results are compared to the existing experimental data. Steady two-dimensional flow in a collapsible channel with initial tension is also simulated and the results are compared with numerical solutions from the literature. Computational results show that as cross-sectional area decreases with the reduction in downstream pressure, flow rate increases and reaches the maximum when the speed index (mean velocity divided by wave speed) is near the unity at the point of minimum cross-section area, indicating the flow limitation or choking (flow speed equals wave speed) in one-dimensional studies. for further reductions in downstream pressure, flow rate decreases. The flow limitation or choking consist of the main reasons of waterfall effect which occurs in the airways, capillaries of lung, and other veins. Cross-sectional narrowing is significant but localized. When the ratio of downstream-to-upstream wall thickness is 2, the area throat is located near the downstream end. As this ratio is increased to 3, the constriction moves to the upstream end of the tube.