• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.387-401
• /
• 2001

If the distance between two vertices becomes longer after the removal of a vertex u, then u is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takes O(n/P + log n) time using P processors on an EREW PRAM.

• Proceedings of the KIPE Conference
• /
• 2000.07a
• /
• pp.290-293
• /
• 2000

In this paper the algorithm which controls output voltage and power factor independently and the algorithm which controls output voltage with fixed unity power factor are compared and analyzed. These algorithms are applied to single-phase AC/DC parallel are applied to single-phase AC/DC parallel converters for a high speed train system. The control characteristic of the algorithms are compared and analyzed with respect to the output voltage and input power factor when system parameters vary.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.65-78
• /
• 1999

We present a fast/parallel Poisson solver on disks, based on efficient evaluation of the exact solution given by the Newtonian potential and the Poisson integral. Derived from an integral formula-tion it is more accurate and simpler in parallel implementation and in upgrading to a higher order algorithm than an algorithm which solves the linear system obtained from a differential formulation.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1219-1224
• /
• 1999

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array C++ language.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10a
• /
• pp.721-723
• /
• 1987

An Adaptation algorithm is presented and a convergence criterion is derived for parallel model reference adaptive bilinear systems. The output error converges asymptotically to zero, and the parameter estimates are bounded for stable reference models. The convergence criterion depends only upon the input sequence and a priori estimates of the maximum parameter values.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.243-246
• /
• 2006

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.103-106
• /
• 2006

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.35
• /
• pp.107-114
• /
• 1995

This paper proposes the Tabu Search algorithm to minimize mean tardiness in the parallel machine scheduling problem. The algorithm reduces the computation time by employing restricted neighborhood and produces an efficient solution in this problem.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.37-43
• /
• 1998

This paper proposes a new echo canceller that can be used in a full-duplex digital subscriber loop modem. The proposed echo canceller uses a NLMS-based parallel adaptation NLMS (PA-NLMS) algorithm. The PA-NLMS algorithm that an estimate of the nonstationarity to additive noise ratio (NNR) gained from two distinct NLMS processes is used to select the value of NLMS convergence-controlling parameter has been developed. Numerical results based on computer simulation show that the proposed algorithm has a convergence rate approaching that of the fastest possible NLMS process while improving on its MAC performance considerably.