• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.765-778
• /
• 2017

Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.30-39
• /
• 2010

This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is composed of a single depot and a series of starting and ending points of contours to be cut. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem. To solve the problem, a hybrid genetic algorithm with the local search of torch paths is proposed. The genetic algorithm is tested for hypothetical problems whose optimal solutions are known in advance due to the special structure of them. The computational results show that the algorithm generates very near optimal solutions for most cases of the test problems, which verifies the validity of the algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.95-104
• /
• 2009

This paper proposes the noise robust algorithm to detect the starting point of music. Detection of starting point of music is necessary to solve computational-waste problem and retrieval-comparison problem with inconsistent input data in music content based retrieval system. In particular, such detection is even more necessary in time sequential retrieval method that compares data in the sequential order of time in contents based music retrieval system. Whereas it has the long point that the retrieval is fast since it executes simple comparison in the order of time, time sequential retrieval method has the short point that data starting time to be compared should be the same. However, digitalized music cannot guarantee the equity of starting time by bit rate conversion. Therefore, this paper ensured that recognition rate shall not decrease even while executing high speed retrieval by applying time sequential retrieval method through detection of music starting point in the pre-processing stage of retrieval. Starting point detection used minimum wave model that can detect effective sound, and for strength against noise, the noises existing in mute sound were swapped. The proposed algorithm was confirmed to produce about 38% more excellent performance than the results to which starting point detection was not applied, and was verified for the strength against noise.

• Proceedings of the KIPE Conference
• /
• 2004.11a
• /
• pp.1-4
• /
• 2004

From standstill to medium speed which enough to sensing back EMF, it is not easy to drive without additional equipments due to directly proportional to flux. Conventional method to drive is 'align and go' method, so called v/f control that is increased voltage duty in proportion to the increase of frequency. Because it isn't consider load of motor and doesn't know rotor position exactly, current is supplied too much current or not enough to rotate motor. This paper is proposed starting method without any poison sensor and can drive a BLDC motor from standstill to the medium speed smoothly without any rattling and time delay compared with the conventional starting algorithm. To verify algorithm of this paper, experimental results are presented.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.27 no.1
• /
• pp.80-83
• /
• 2022

This paper proposes an initial rotor polarity detection algorithm of a single-phase permanent magnet synchronous motor (SP-PMSM) related to stable open-loop starting for sensorless operation. Generally, the SP-PMSM needs an asymmetric air-gap structure to can avoid the initial starting failure at zero torque point. Therefore, the rotor polarity information can be obtained by using the DC offset current direction of a stator current through a high frequency voltage injection into an SP-PMSM with an asymmetric air gap. In this paper, the proposed rotor initial polarity detection algorithm is verified through several experimental results.

• Proceedings of the KIEE Conference
• /
• 2003.11a
• /
• pp.91-94
• /
• 2003

A DC railway system has low feeder voltage, The fault current can be smaller than the current of load starting. So it is important to discriminate between the small fault current and the load starting current. The load starting current increases step by step but the fault current increases all at once. So the type of ${\Delta}I$ relay(50F) was developed using the different characteristics between the load starting current and the fault current. As for the load starting current, the time constant of load current at each step is much smaller than that of the fault current. First, to detect faults in DC railway systems, an algorithm using the time constant calculated by the method of least squares is presented in this paper. Secondly, to compose a protection scheme for DC railway systems is presented in this paper.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.12
• /
• pp.3025-3032
• /
• 1996

A fast algorithm for the restoration of an images based on chain codes description using y-axis partition of the starting and ending ponts. The algorithm is to convert the chain codes description into the two y-axis partitions by proposed look-up table. It reduces the size of column elements as a half in y-axis partition. this technique is computationally faster than Shih's methods. comparision of the proposed method and Shih method is also provided.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.18 no.1
• /
• pp.19-29
• /
• 2020

This paper gives two graph-based algorithms for radioactive decay computation. The first algorithm identifies the connected components of the graph induced from the given radioactive decay dynamics to reduce the size of the problem. The solutions are derived over the precalculated connected components, respectively and independently. The second algorithm utilizes acyclic structure of radioactive decay dynamics. The algorithm evaluates the reachable vertices of the induced system graph from the initially activated vertices and finds the minimal set of starting vertices populating the entire reachable vertices. Then, the decay calculations are performed over the reachable vertices from the identified minimal starting vertices, respectively, with the partitioned initial value over the reachable vertices. Formal arguments are given to show that the proposed graph inspired divide and conquer calculation methods perform the intended radioactive decay calculation. Empirical efforts comparing the proposed radioactive decay calculation algorithms are presented.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.26 no.5
• /
• pp.349-356
• /
• 2021

Permanent magnet synchronous motors are mainly used in the traction of electric vehicle and home application products including air-conditioners and refrigerators. For sensorless control without rotor position sensors, I-F control is applied for initial starting at low speeds, and mode is changed to sensorless control when the rotor speed is sufficiently accelerated for estimating rotor position. When the mode is changed to the sensorless control from the open-loop starting, the initial integral value of the speed controller should be considered by load condition; otherwise, the transition to sensorless control may fail. The sensorless transfer algorithm of PM synchronous motor based on load condition for smooth transition is proposed. The performance of the proposed sensorless transfer algorithm was verified by experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1725-1731
• /
• 2010

In this paper, we proposed preamble structure and code acquisition method to improve code acquisition performance for DS-SS/TDMA packet communication systems. Proposed algorithm changes the short PN code position depending on the sub slot number. Proposed algorithm also saves position differences between short PN codes and position offsets between short PN codes and data starting position of the TDMA packet. By using the position difference table, proposed algorithm can find out exact data starting position even though some sub slots were defected. As a result of simulation, we concluded that proposed algorithm has at least 5dB gain compared to conventional method when same short PN code is used. Moreover, proposed algorithm shows same code acquisition performance only with 1/4 shortened short PN code compared to conventional method.