• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.199-214
• /
• 2017

We consider fixed-point iterations constructed by simple transforming from a quadratic matrix equation to equivalent fixed-point equations and assume that the iterations are well-defined at some solutions. In that case, we suggest real valued functions. These functions provide radii at the solution, which guarantee the local convergence and the uniqueness of the solutions. Moreover, these radii obtained by simple calculations of some constants. We get the constants by arbitrary matrix norm for coefficient matrices and solution. In numerical experiments, the examples show that the functions give suitable boundaries which guarantee the local convergence and the uniqueness of the solutions for the given equations.

• Journal of Power Electronics
• /
• v.12 no.3
• /
• pp.503-508
• /
• 2012

Tracking the Maximum Power Point (MPP) of a photovoltaic (PV) array is usually an essential part of a PV system. The problem addressed by Maximum Power Point Tracking (MPPT) techniques is to find the voltage $V_{MPP}$ or current $I_{MPP}$ at which a PV array should operate to generate the maximum power output $P_{MPP}$ under a given temperature and irradiance. MPPT control methods such as the perturb and observe method and the incremental conductance method require a microprocessor or DSP to determine if the duty cycle should be increased or not. This paper proposes a simple and fast analog MPPT method. The proposed control scheme tracks the MPP very quickly and its hardware implementation is simple when compared with the conventional techniques. The new algorithm can successfully track the MPP even in the case of rapidly changing atmospheric conditions. In addition, it has higher efficiency than ordinary algorithms.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.489-500
• /
• 2014

This paper presents a simple modified unipolar carrier-based pulsewidth modulation (CB-PWM) strategy for the three-level neutral-point-clamped (NPC) voltage source inverter (VSI). Analytical expressions for the relationship between modulation reference signals and output voltages are derived. The proposed modulation technique for the three-level NPC VSI includes the maximum and minimum of the three-phase sinusoidal reference voltages with zero-sequence voltage injection concept. The proposed modified CB-PWM strategy incorporates a novel method that requires only of one triangular carrier wave for generate the gating pulses in three-level NPC VSI. It has the advantages of being simplifying the algorithm with no need of complex two/multi-carrier pulsewidth modulation or space vector modulation (SVM) and it's also simple to implement. The possibility of the proposed CB-PWM technique has been verified though computer simulation and experimental results.

• Communications for Statistical Applications and Methods
• /
• v.12 no.1
• /
• pp.199-205
• /
• 2005

In general, simple correspondence analysis has handled mainly correspondence relations between the row and column categories but can not display the trends of their change over the time. For solving this problem, we will propose DSCA(Dynamic Simple Correspondence Analysis) of transition matrix data using supplementary categories in this study, Moreover, DSCA provides its trend of the change for the future by predicting and displaying trend toward the change from a standard point of time to the next.

• Journal of Mechanical Science and Technology
• /
• v.17 no.8
• /
• pp.1133-1139
• /
• 2003

In this paper, a numerical algorithm for the kinematic analysis of a multi-link five-point suspension system is presented. The kinematic analysis is carried out in terms of the rectangular Cartesian coordinates of some defined points in the links and at the joints. Geometric constraints are introduced to fix the relative positions between the points belonging to the same rigid body. Position, velocity and acceleration analyses are carried out. The presented formulation in terms or this system of coordinates is simple and involves only elementary mathematics. The results of the kinematic analysis are presented and discussed.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.3
• /
• pp.231-243
• /
• 2007

In this paper, we study a Lotka-Volterra type simple food chain model. We investigate the positive coexistence of the steady states to the model and give some results for the extinction of species under certain assumptions which can be interpreted as Domino effect and Biological control. The methods of a decoupling operator and the fixed point index theory on a positive cone are used as well as the comparison argument. Numerical evidences for our results also are provided.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1479-1503
• /
• 2007

In this paper, we study a strong k-deformation retract derived from a relative k-homotopy and investigate its properties in relation to both a k-homotopic thinning and the k-fundamental group. Moreover, we show that the k-fundamental group of a wedge product of closed k-curves not k-contractible is a free group by the use of some properties of both a strong k-deformation retract and a digital covering. Finally, we write an algorithm for calculating the k-fundamental group of a dosed k-curve by the use of a k-homotopic thinning.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.45-53
• /
• 2009

As the point sampling technology evolves rapidly, there has been increasing need in generating tool path from dense point set without creating intermediate models such as triangular meshes or surfaces. In this paper, we present a new tool path generation method from point set using Euclidean distance fields based on Algebraic Point Set Surfaces (APSS). Once an Euclidean distance field from the target shape is obtained, it is fairly easy to generate tool paths. In order to compute the distance from a point in the 3D space to the point set, we locally fit an algebraic sphere using moving least square method (MLS) for accurate and simple calculation. This process is repeated until it converges. The main advantages of our approach are : (1) tool paths are computed directly from point set without making triangular mesh or surfaces and their offsets, and (2) we do not have to worry about no local interference at concave region compared to the other methods using triangular mesh or surface model. Experimental results show that our approach can generate accurate enough tool paths from a point set in a robust manner and efficiently.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.5
• /
• pp.688-694
• /
• 2018

The transition section of the overhead rigid conductor rail (ORCR) consists of a direct induction device and a limit point to prevent the power supply failure and failure of the electric railway vehicle pantograph due to the difference of the uplift in the catenary line. In T-Bar transition section, a twin simple catenary is mostly installed between the overhead catenary system (OCS) in the ground section and the ORCR in the underground section. In this paper, we compare and analyze the possibility of replacing the twin simple catenary with heavy simple catenary. The reliability of numerical analysis results was confirmed by comparing field test with numerical results. Comparing the numerical results of the twin simple catenary with the heavy simple catenary in the transition section, the difference uplift is 5.9[mm] on average. When applying heavy simple catenary instead of twin simple catenary, the slight difference of uplift can be compensated by adjusting the height of hanger-ear or support bracket.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.1-4
• /
• 2010

As a countermeasure to simple power attack, the unified point addition codes for the elliptic curve cryptosystem were introduced. However, some authors proposed a different kind of power attacks to the codes. This power attack uses the observation that some internal operations in the codes behave differently for addition and doubling. In this paper, we propose a new countermeasure against such an attack. The basic idea of the new countermeasure is that, if one of the input points of the codes is transformed to an equivalent point over the underlying finite field, then the code will behave in the same manner for addition and doubling. The new countermeasure is highly efficient in that it only requires 27(n-1)/3 extra ordinary integer subtractions (in average) for the whole n-bit scalar multiplication. The timing analysis of the proposed countermeasure is also presented to confirm its SPA resistance.