• Journal of the Korean Institute of Gas
• /
• v.19 no.6
• /
• pp.34-39
• /
• 2015

Recently, most of the energy consumed in vehicle is derived from fossil fuels. For this reason, the demand for clean, renewable and affordable alternative energy is forcing the automotive industry to look beyond the conventional fossil fuels. Natural gas represents today a promising alternative to conventional fuels for vehicles propulsion, because it is characterized by a relatively low cost, better geopolitical distribution than oil, lower environmental impact, higher octane number and a higher self ignition temperature. Above all, CNG is an environmentally clean alternative to the existing spark ignition engines with the advantages of minimum change. In this study was installed bi-fuel system that a conventional 2 liters gasoline engine was modified to run on natural gas by a gas injection system. Experiments were mainly carried on the optimization of an ECU control strategy affecting the emission characteristics of CNG/Gasoline bi-fule vehicle. The test results shown that CO2 emission in bi-fuel mode was reduced 16% compared to gasoline fuel in the NEDC mode. Also the amount of CO and HC emissions in bi-fuel and gasoline modes were found to equality. But Compared to gasoline, the bi-fuel mode resulted in higher NOx emissions.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.1
• /
• pp.97-104
• /
• 2016

Because of rapid growth of data size, the number of data storage has been increased. When using multiple data storages, a distribute file system is essential to insure the availability of data files. The power consumption is a major problem when using a distributed file system with many data storages. Previous works have aimed at reducing the energy consumption with efficient file block layout by changing some data servers into stand-by mode. The file block migration has not been seriously considered because migration causes large cost. But when we consider addition of a new data server or file, file block migration is needed. This paper formulates the minimization of data block migration as an ILP optimization problem and solves it using branch-and-bound method. Using this technique, we can maximize the number of stand-by data servers with the minimum number of file block movement. However, computation time of branch-and-bound method of an ILP optimization problem increases exponentially as the problem size grows. Therefore this paper also proposes a data block and data server grouping method to solve many small ILP problems.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.8 no.5
• /
• pp.53-58
• /
• 2008

This study presented a design model optimizing a distance of inlet with drainage pipe laid under the gutter in road. When the distance of inlet changed, a basin for the gutter divided by the distance of inlet and the inflow coming into the gutter would be changed. In this case, the change of inlet distance causes the change of a diameter of drainage pipe and slope because of the change of capacity. Therefore, the optimization is needed to design the combination of them for the distance of inlet. Genetic Algorithm is used to determine the optimal combination of them. The conditions of road and the precipitation were assumed like a real and the range of inlet distance adopted $10{\sim}30\;m$ which has been introduced in domestic. This model presented the optimal distance of inlet and the combination of pipe and slope through the minimum cost. The result of the study is that the optimal distance of inlet is different from each slope of road and it can reduce about 20% of total cost for the distance of inlet.

• Journal of Korean Society of Transportation
• /
• v.33 no.6
• /
• pp.564-574
• /
• 2015

As shown by the popularity of the rapid train in the Seoul Metro Line No. 9, the demand for the rapidization of the metro transit has been continuously increased. However, it needs tremendous cost to construct new additional infrastructures to the existing line for the rapidization. In order to overcome the problem, utilizing the existing infrastructures such as crossing tracks as railroad sidetracks can be considered to be a good method of reducing the cost. In this case, there is a way exploiting the existing train as an express train and the advanced train, which increases both acceleration and deceleration, as a local train, but achievable acceleration and deceleration have not been analyzed rigorously. In this paper, we analyze feasible ranges and optimal values of both acceleration and deceleration of the advanced train analytically when we consider the rapidization of the metro transit utilizing the existing infrastructures and verify the results in Seoul Metro Line No. 3. Simulation results show ranges and optimal values of achievable acceleration and deceleration exist when minimum gap between an express train and a local train is smaller than 40 seconds.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.40 no.6
• /
• pp.613-622
• /
• 2020

The South Korean government plans for a 37 % reduction in CO2 emissions against business as usual by 2030. Subsequently, the Ministry of Land, Infrastructure and Transport declared a 26.9 % reduction target in greenhouse gas emissions from buildings by 2020 and established the Green Standard for Energy and Environmental Design (G-SEED) to help improve the environmental performance of buildings. Construction companies often work with consulting firms to prepare for G-SEED certification. In the process, owing to inefficient data sharing and work connections, it is difficult to achieve economic efficiency and obtain certification. The objective of this study was to develop an economic model to assist contractors in achieving the required G-SEED scores for materials and resources. To do this, we automated the process for material comparison and selection on the basis of an analysis of actual consulting data, and developed a model that selects material alternatives that can meet the required scores at a minimum cost. Information on materials is input by applying a genetic algorithm to the optimization of alternatives. When the model was applied to actual data, the construction cost could be lowered by 79.3 % compared with existing methods. The economical material selection model is expected to not only reduce construction costs for owners desiring G-SEED certification but also shorten the project design time.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1D
• /
• pp.63-72
• /
• 2009

This study aims at establishing the decision-making support system for the highway assets, long-term performance presumption and evaluation of asset value, which are appropriate for Korea, and proposing the methods of the optimal engineering method and the timing decision for the preventive maintenance through the project evaluation, the optimization method and life-cycle analysis related to the highways. In order to supplement the current problem of the near-sighted budget management system, which chooses the maintenance place of the highway, depending on the level of the budget with fixed amount, the long-term required budget prediction system and the economy principle were introduced, so that the pavement agency can predict the level of the required budget, and it was aimed to develop the pavement asset evaluation system to maintain the performance of the highway with the minimum of the cost. In the use of the highway pavement asset evaluation system, to maintain the appropriate level of the pavement evaluation index, when the budget was efficiently established in the reference of the required maintenance budget for the chosen section of the highway in the year concerned, it was possible to analyze the most rational pavement maintenance budget. With this result, it is estimated to prevent the unnecessary waste of budget in advance, and through the development of the decision-making system for the long-term performance presumption and the asset value estimation of the pavement, it is expected to able to analyze the previous evaluation of the project related to the highway and the feasibility of introduction.

• Journal of Astronomy and Space Sciences
• /
• v.25 no.2
• /
• pp.181-198
• /
• 2008

Designing satellite constellations providing partial coverage of certain regions becomes more important as small low-altitude satellites receives an increasing attention due to its cost-effectiveness analysis. Generally, Walker's method is a standard constellation method for global coverage but not effective for partial coverage. The purpose of this study is to design optimal constellation of satellites for effective observation in Korean peninsula regions. In this study, a new constellation design method is presented for partial coverage, using direct control of satellites' orbital elements. And also, a ground repeating circular orbit is considered for each satellite's orbit with the Earth oblateness effect. As the results, at least four satellites are required to observe the Korean peninsula regions effectively when minimum elevation angle is assumed as 12 degrees. The results from new method are better than those from the best Walker method. The proposed algorithm will be useful to design satellite constellation missions of Korea in future.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.37-47
• /
• 2008

Exploitation of address generation units which are typically provided in DSPs plays an important role in DSP code generation since that perform fast address computation in parallel to the central data path. Offset assignment is optimization of memory layout for program variables by taking advantage of the capabilities of address generation units, consists of memory layout generation and address pointer assignment steps. In this paper, we propose an effective address pointer assignment method to minimize the number of address calculation instructions in DSP code generation. The proposed approach reduces the time complexity of a conventional address pointer assignment algorithm with fixed memory layouts by using minimum cost-nodes breaking. In order to contract memory size and processing time, we employ a powerful pruning technique. Moreover our proposed approach improves the initial solution iteratively by changing the memory layout for each iteration because the memory layout affects the result of the address pointer assignment algorithm. We applied the proposed approach to about 3,000 sequences of the OffsetStone benchmarks to demonstrate the effectiveness of the our approach. Experimental results with benchmarks show an average improvement of 25.9% in the address codes over previous works.

• Journal of Korea Water Resources Association
• /
• v.54 no.7
• /
• pp.475-484
• /
• 2021

The optimal design for water distribution system (WDS) is not only satisfying the minimum required water pressure of the nodes, but also minimizing pipe cost, etc. The number of designs of WDS increases exponentially due to the arrangement of various pipes. Various optimization algorithms were applied to propose an optimized design of WDS. In this study, Modified Hybrid Vision Correction Algorithm (MHVCA) with improved self-adapting parameter was applied to optimal design of WDS. The performance was improved by changing the Hybrid Rate (HR) of the existing Hybrid Vision Correction Algorithm (HVCA) to nonlinear HR. To verify the performance of the proposed MHVCA, it applied to mathematical problems consisting of 2 and 30 decision variables and constrained mathematical problems. In order to review the application results of MHVCA, it was compared with Harmony Search (HS), Improved Harmony Search (IHS), Vision Correction Algorithm (VCA) and HVCA. Finally, MHVCA was applied to the optimal design problem of WDS and the results were compared with other algorithms. MHVCA showed better results than other algorithms in mathematical problems and WDS problem. MHVCA will be able to show good results by applying to various water resource engineering problems as well as problems applied in this study.

• Journal of Intelligence and Information Systems
• /
• v.25 no.1
• /
• pp.63-83
• /
• 2019

Investors prefer to look for trading points based on the graph shown in the chart rather than complex analysis, such as corporate intrinsic value analysis and technical auxiliary index analysis. However, the pattern analysis technique is difficult and computerized less than the needs of users. In recent years, there have been many cases of studying stock price patterns using various machine learning techniques including neural networks in the field of artificial intelligence(AI). In particular, the development of IT technology has made it easier to analyze a huge number of chart data to find patterns that can predict stock prices. Although short-term forecasting power of prices has increased in terms of performance so far, long-term forecasting power is limited and is used in short-term trading rather than long-term investment. Other studies have focused on mechanically and accurately identifying patterns that were not recognized by past technology, but it can be vulnerable in practical areas because it is a separate matter whether the patterns found are suitable for trading. When they find a meaningful pattern, they find a point that matches the pattern. They then measure their performance after n days, assuming that they have bought at that point in time. Since this approach is to calculate virtual revenues, there can be many disparities with reality. The existing research method tries to find a pattern with stock price prediction power, but this study proposes to define the patterns first and to trade when the pattern with high success probability appears. The M & W wave pattern published by Merrill(1980) is simple because we can distinguish it by five turning points. Despite the report that some patterns have price predictability, there were no performance reports used in the actual market. The simplicity of a pattern consisting of five turning points has the advantage of reducing the cost of increasing pattern recognition accuracy. In this study, 16 patterns of up conversion and 16 patterns of down conversion are reclassified into ten groups so that they can be easily implemented by the system. Only one pattern with high success rate per group is selected for trading. Patterns that had a high probability of success in the past are likely to succeed in the future. So we trade when such a pattern occurs. It is a real situation because it is measured assuming that both the buy and sell have been executed. We tested three ways to calculate the turning point. The first method, the minimum change rate zig-zag method, removes price movements below a certain percentage and calculates the vertex. In the second method, high-low line zig-zag, the high price that meets the n-day high price line is calculated at the peak price, and the low price that meets the n-day low price line is calculated at the valley price. In the third method, the swing wave method, the high price in the center higher than n high prices on the left and right is calculated as the peak price. If the central low price is lower than the n low price on the left and right, it is calculated as valley price. The swing wave method was superior to the other methods in the test results. It is interpreted that the transaction after checking the completion of the pattern is more effective than the transaction in the unfinished state of the pattern. Genetic algorithms(GA) were the most suitable solution, although it was virtually impossible to find patterns with high success rates because the number of cases was too large in this simulation. We also performed the simulation using the Walk-forward Analysis(WFA) method, which tests the test section and the application section separately. So we were able to respond appropriately to market changes. In this study, we optimize the stock portfolio because there is a risk of over-optimized if we implement the variable optimality for each individual stock. Therefore, we selected the number of constituent stocks as 20 to increase the effect of diversified investment while avoiding optimization. We tested the KOSPI market by dividing it into six categories. In the results, the portfolio of small cap stock was the most successful and the high vol stock portfolio was the second best. This shows that patterns need to have some price volatility in order for patterns to be shaped, but volatility is not the best.