• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.6
• /
• pp.781-786
• /
• 2008

In this paper, we propose a novel approach predicting the fluctuation of stock index by finding a relation in various stock indexes that are represented by linear combinations. The important points are to select stock indexes related to predicting indexes and to find the proper relations in them. Since it is unattainable to use entire stock indexes relation, we used only data that are closely associated with each other. We used Genetic Algorithm(GA) to find the most suitable stock-index relation. We simulated the investment in years from 2005 to 2007 with each real index. Finally we verified that the investment money increased 230 percents by the proposed method.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.22 no.3
• /
• pp.256-262
• /
• 2017

This paper presents the control algorithm of a single-phase AC/DC/AC PWM converter for the linear compressor of a refrigerator. The AC/DC/AC converter consists of a full-bridge PWM converter for the control of the input power factor and a half-bridge PWM inverter for the control of the single-phase linear compressor. At the DC-link of this topology, two capacitors are connected in series. These DC-link voltages must be balanced for safe operation. Thus, a new control method of DC voltage balancing for the half-bridge PWM inverter is proposed. The balancing algorithm uses the Integral-Proportional controller and inserts the DC-offset current at the Proportional-Resonant current controller of the inverter to solve the DC-link unbalanced voltages between the two capacitors. The proposed algorithm can be easily implemented without much computation and additional hardware circuit. The usefulness of the proposed algorithm is verified through several experiments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.177-182
• /
• 2021

Generally, the linear programming (LP) with O(n⁴) time complexity is applied to mixture optimization problem that can be produce the given ingredients grade product with minimum cost from mixture of various raw materials. This paper suggests heuristic algorithm with O(n log n) time complexity to obtain the solution of this problem. The proposed algorithm meets the content range of the components required by the alloy steel plate while obtaining the minimum raw material cost, decides the quantity of raw material that is satisfied with ingredients grade for ascending order of unit cost. Although the proposed algorithm applies simple decision technique with O(n log n) time complexity, it can be obtains same solution as or more than optimization technique of linear programing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.7
• /
• pp.963-971
• /
• 2022

Water pipeline network in local and metropolitan area is buried underground, by which it is hard to know the degree of pipe aging and leakage. In this study, assuming various sensor combinations installed in the water pipeline network, the optimal algorithm was derived by predicting the water flow rate and pressure through artificial intelligence algorithms such as linear regression and neuro fuzzy analysis to examine the possibility of detecting pipe leakage according to the data combination. In the case of leakage detection through water supply pressure prediction, Neuro fuzzy algorithm was superior to linear regression analysis. In case of leakage detection through water supply flow prediction, flow rate prediction using neuro fuzzy algorithm should be considered first. If flow meter for prediction don't exists, linear regression algorithm should be considered instead for pressure estimation.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.3
• /
• pp.276-284
• /
• 2000

Usual practice of the transformation of a B-spline curve into a set of piecewise polynomial curves in a power form is done by either a knot refinement followed by basis conversions or applying a Taylor expansion on the B-spline curve for each knot span. Presented in this paper is a new algorithm, called a direct expansion algorithm, for the problem. The algorithm first locates the coefficients of all the linear terms that make up the basis functions in a knot span, and then the algorithm directly obtains the power form representation of basis functions by expanding the summation of products of appropriate linear terms. Then, a polynomial segment of a knot span can be easily obtained by the summation of products of the basis functions within the knot span with corresponding control points. Repeating this operation for each knot span, all of the polynomials of the B-spline curve can be transformed into a power form. The algorithm has been applied to both static and dynamic curves. It turns out that the proposed algorithm outperforms the existing algorithms for the conversion for both types of curves. Especially, the proposed algorithm shows significantly fast performance for the dynamic curves.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.92-100
• /
• 2006

In many common control charting situations, the statistic to be charted can be viewed as the output of a linear filter applied to the sequence of process measurement data. In recent work that has generalized this concept, the charted statistic is the output of a general linear filter in impulse response form, and the filter is designed by selecting its impulse response coefficients in order to optimize its average run length performance. In this work, we restrict attention to the class of all second-order linear filters applied to the residuals of a time series model of the process data. We present an algorithm for optimizing the design of the second-order filter that is more computationally efficient and robust than the algorithm for optimizing the general linear filter. We demonstrate that the optimal second-order filter performs almost as well as the optimal general linear filter in many situations. Both methods share a number of interesting characteristics and are tuned to detect any distinct features of the process mean shift, as it manifests itself in the residuals.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.6 s.336
• /
• pp.49-58
• /
• 2005

In this paper, we propose an optimal ILP scheduling algorithm for multiprocessor design on LDFG(Linear Data-Flow Graph) that can be represented by homogeneous synchronous data-flow. The proposed computation in this paper does not contain data-dependent, all scheduling decisions for such algorithms can be taken at compile time, only fully static overlapped schedules are considered. It means that all linear have the same schedule and the same processor assignment. In this paper, the resource-constrained problem is addressed, for the LDFG optimization for multiprocessor design problem formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.321-325
• /
• 2004

Linear motor feed drive systems have been broadly used in machine tools or precision automatic feed systems. Recently, modem machine tools require high speed and high precision feed drive system to achieve high productivity. Unfortunately, a feed drive system, even though it was optimum designed, may experience severe transient vibrations during high-speed operation if its feed rate control is unsuitable. A rough feed rate curve having discontinuity in its acceleration profile causes a serious vibration problem in the feed slides system. This paper presents a feed rate optimization of a machine tool feed slide system, which is driven by a linear motor, for its minimum vibrations. Firstly, a 4-degree-of-freedom lumped parameter model is proposed for the vibration analysis of a linear motor driven machine tool feed drive system. Next, a feed rate optimization of the feed slide is carried out for minimum vibrations. The feed rate curve optimization strategy is to find out the most appropriate acceleration profile with jerk continuity. Of course, the optimized feed rate should approximate to the desired one as possible. A genetic algorithm with variable penalty function was used in this feed rate optimization.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.530-539
• /
• 2007

Many construction projects such as highways, pipelines, tunnels, and high-rise buildings typically contain repetitive activities. Research has shown that the Critical Path Method (CPM) is not efficient in scheduling linear construction projects that involve repetitive tasks. Linear Scheduling Method (LSM) is one of the techniques that have been developed since 1960s to handle projects with repetitive characteristics. Although LSM has been regarded as a technique that provides significant advantages over CPM in linear construction projects, it has been mainly viewed as a graphical complement to the CPM. Studies of scheduling linear construction projects with resource consideration are rare, especially with multiple resource constraints. The objective of this proposed research is to explore a resource assignment mechanism, which assigns multiple critical resources to all activities to minimize the project duration while satisfying the activities precedence relationship and resource limitations. Resources assigned to an activity are allowed to vary within a range at different stations, which is a combinatorial optimization problem in nature. A heuristic multiple resource allocation algorithm is explored to obtain a feasible initial solution. The Simulated Annealing search algorithm is then utilized to improve the initial solution for obtaining near-optimum solutions. A housing example is studied to demonstrate the resource assignment mechanism.

• Journal of Korean Society of Steel Construction
• /
• v.22 no.1
• /
• pp.33-42
• /
• 2010

Patterning with a geodesic line is essential for economical or efficient usage of membrane materialsin fabric tension membrane structural engineering and analysis. The numerical algorithm to determine the geodesic line for membrane structures is generally classified into two. The first algorithm finds a non-linear shape using a fictitious geodesic element with an initial pre-stress, and the other algorithm is the geodesic line cutting or searching algorithm for arbitrarily curved 3D surface shapes. These two algorithms are still being used only for the three-node plane stress membrane element, and not for the four-node element. The lack of a numerical algorithm for geodesic lines with four-node membrane elements is the main reason for the infrequent use of the four-node membrane element in membrane structural engineering and design. In this paper, a modified numerical algorithm is proposed for the generation of a geodesic line that can be applied to three- or four-node elements at the same time. The explicit non-linear static Dynamic Relaxation Method (DRM) was applied to the non-linear geodesic shape-finding analysis by introducing the fictitiously tensioned 'strings' along the desired seams with the three- or four-node membrane element. The proposed algorithm was used for the numerical example for the non-linear geodesic shape-finding and patterning analysis to demonstrate the accuracy and efficiency, and thus, the potential, of the algorithm. The proposed geodesic shape-finding algorithm may improve the applicability of the four-node membrane element for membrane structural engineering and design analysis simultaneously in terms of the shape-finding analysis, the stress analysis, and the patterning analysis.