• Journal of Korean Society of societal Security
• /
• v.4 no.1
• /
• pp.49-55
• /
• 2011

The primary objective of this paper is to develop optimal algorithms of reinforced concrete frame structural systems by the limit state design(CP 1110) and to look into the possibility of detailed design of these structural systems. The structural formulation is derived on the finite element method. The objective of optimization of a reinforced structure for a specified geometry is mainly to determine the optimum cross-sectional dimensions of concrete and the area of the various sizes of the reinforcement required for each member. In addition to the detail s such as the amount of web reinforcement, cutoff points of longitudinal reinforcedments etc. are also considered as design variables. In this study, the method of "Generalized Reduced Gradient, Rounding and with Neighborhood search" and "the Sequential Linear Programming" are employed as an analytical method of nonlinear optimization.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.05
• /
• pp.288-292
• /
• 1996

This paper describes far the detection of heart event that is, QRS complex and P wave which are result from heart activity. The proposed QRS detection method by using the spatial velocity was identified as having the 99.6% detection accuracy as well as fast processing time. Atrial flutter, coupled P wave, and noncoupled P wave as well as atrial fibrillation could be detected correctly by three different algorithms according to their origination farm. About 99.6% correction accuracy coupled P wave could be obtained and we could be found that most detection errors are caused by establishing wrong search interval.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.70-79
• /
• 2010

Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.7
• /
• pp.1144-1150
• /
• 2016

Short-term load forecasting is essential to the electricity pricing and stable power system operations. The conventional weekday 24-hour load forecasting algorithms consider the temperature model to forecast maximum load and minimum load. But 24-hour load pattern forecasting models do not consider temperature effects, because hourly temperature forecasts were not present until the latest date. Recently, 3 hour temperature forecast is announced, therefore hourly temperature forecasts can be produced by mathematical techniques such as various interpolation methods. In this paper, a new 24-hour load pattern forecasting method is proposed by using similar day search considering the hourly temperature. The proposed method searches similar day input data based on the anomalous weather features such as continuous temperature drop or rise, which can enhance 24-hour load pattern forecasting performance, because it uses the past days having similar hourly temperature features as input data. In order to verify the effectiveness of the proposed method, it was applied to the case study. The case study results show high accuracy of 24-hour load pattern forecasting.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1382-1389
• /
• 2007

This paper presents a new approach for solving the problem of maintenance scheduling of generating units using a binary particle swarm optimization (BPSO). In this paper, we find the optimal solution of the maintenance scheduling of generating units within a specific time horizon using a binary particle swarm optimization algorithm, which is the discrete version of a conventional particle swarm optimization. It is shown that the BPSO method proposed in this paper is effective in obtaining feasible solutions in the maintenance scheduling of generating unit. IEEE reliability test systems(1996) including 32-generators are selected as a sample system for the application of the proposed algorithm. From the result, we can conclude that the BPSO can find the optimal solution of the maintenance scheduling of the generating unit with the desirable degree of accuracy and computation time, compared to other heuristic search algorithm such as genetic algorithms. It is also envisaged that BPSO can be easily implemented for similar optimizations and scheduling problems in power system problems to obtain better solutions and improve convergence performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.946-949
• /
• 2005

It is very a time-consuming and error-prone process to obtain the optimal injection condition, which can produce good injection molding products in some operational variation of facilities, from a seed injection condition. This study proposes a new approach to search the optimal injection molding condition using a neural network and a genetic algorithm. To estimate the defect type of unknown injection conditions, this study forces the neural network into learning iteratively from the injection molding conditions collected. Major two parameters of the injection molding condition - injection pressure and velocity are encoded in a binary value to apply to the genetic algorithm. The optimal injection condition is obtained through the selection, cross-over, and mutation process of the genetic algorithm. Finally, this study compares the optimal injection condition searched using the proposed approach. with the other ones obtained by heuristic algorithms and design of experiment technique. The comparison result shows the usability of the approach proposed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.249-268
• /
• 2014

Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to reconstruct the similarity matrix, and then rank medical images on this new manifold. In contrast to most of the algorithms that only concern manifold structure, the proposed method integrates pairwise constraint information in a feedback procedure and resolves the small sample size and the asymmetrical training typically in relevance feedback. We also introduce a long-term feedback strategy for our retrieval tasks. Experiments on two medical image datasets indicate the proposed approach can significantly improve the performance of medical image retrieval. The experiments also indicate that the proposed approach outperforms previous relevance feedback models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3789-3809
• /
• 2015

In this paper, we deal with the problem of M2M gateways' network selection for different types of M2M traffic in heterogeneous wireless networks. Based on the difference in traffic's quality of service (QoS) requirements, the M2M traffic produced by various applications is mainly classified as two categories: flexible traffic and rigid traffic. Then, game theory is adopted to solve the problem of network-channel selection with the coexistence of flexible and rigid traffic, named as flexible network access (FNA). We prove the formulated discrete game is a potential game. The existence and feasibility of the Nash equilibrium (NE) of the proposed game are also analyzed. Then, an iterative algorithm based on optimal reaction criterion and a distributed algorithm with limited feedback based on learning automata are presented to obtain the NE of the proposed game. In simulations, the proposed iterative algorithm can achieve a near optimal sum utility of whole network with low complexity compared to the exhaustive search. In addition, the simulation results show that our proposed algorithms outperform existing methods in terms of sum utility and load balance.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.02a
• /
• pp.82-94
• /
• 2004

This paper addresses solutions to the challenges of carrier phase integer ambiguity resolution and cycle slip detection/identification, for maintaining high accuracy of an integrated GPS/Pseudolite/INS system. Such a hybrid positioning and navigation system is an augmentation of standard GPS/INS systems in localized areas. To achieve the goal of high accuracy, the carrier phase measurements with correctly estimated integer ambiguities must be utilized to update the system integration filter's states. The occurrence of a cycle slip that is undetected is, however, can significantly degrade the filter's performance. This contribution presents an effective approach to increase the reliability and speed of integer ambiguity resolution through using pseudolite and INS measurements, with special emphasis on reducing the ambiguity search space. In addition, an algorithm which can effectively detect and correct the cycle slips is described as well. The algorithm utilizes additional position information provided by the INS, and applies a statistical technique known as the cumulative-sum (CUSUM) test that is very sensitive to abrupt changes of mean values. Results of simulation studies and field tests indicate that the algorithms are performed pretty well, so that the accuracy and performance of the integrated system can be maintained, even if cycle slips exist in the raw GPS measurements.

• Journal of KIISE:Software and Applications
• /
• v.27 no.8
• /
• pp.827-833
• /
• 2000

Facial expression is an effective tool to express human emotion. In this paper, a facial expression analysis method based on the base faces and their blending ratio is proposed. The seven base faces were chosen as axes describing and analyzing arbitrary facial expression. We set up seven facial expressions such as, surprise, fear, anger, disgust, happiness, sadness, and expressionless as base faces. Facial expression was built by fitting generic 3D facial model to facial image. Two comparable methods, Genetic Algorithms and Simulated Annealing were used to search the blending ratio of base faces. The usefulness of the proposed method for facial expression analysis was proved by the facial expression synthesis results.