• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.05a
• /
• pp.77-78
• /
• 2010

• Computational Structural Engineering
• /
• v.7 no.3
• /
• pp.167-176
• /
• 1994

A local remeshing algorithm using Delaunay property is developed for the analysis on the phenomenon of quasi-static crack propagation, which is a typical problem of accompanying constantly varying geometry. The algorithm performs both remeshing and refinement. The use of M-integral is demonstrated to simulate crack propagation under mixed mode with the edge spalling problem.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.21-28
• /
• 2007

The symmetric dual filters are essential for the construction of biorthogonal multiresolution an analyses and wavelets. We propose an algorithm to seek for dual symmetric trigonometric filters $\tilde{m}_0$ for for the given symmetric trigonometric filter $m_0$ and illustrate our algorithm by examples.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.1
• /
• pp.36-41
• /
• 2006

In this paper, we present the performance of iterative decoding with a Turbo decoder and a M-ary QAM(Quadrature Amplitude Modulation) demapper. The demappers are designed with Max-Log-MAP algorithm and it's approximated one. In addition, we provide implementing block for the approximated algorithm. From the results of computer simulations, the approximated algorithm of the Max-Log-MAP has little bit worse than the Max-Log-MAP but suggests low complexity for practical implementation.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.121-126
• /
• 2007

Among many graphs, directed acyclic graph(DAG) attracts many researchers due to its nice property of existence of topological sort. In some classic graph problems, it is known that, if we use the aforementioned property, then much efficient algorithms can be generated. So, in this paper, new algorithm for the all-pairs shortest path problem in a DAG is proposed. While the algorithm performing the iteration, it identifies the set of essential arcs which requires in a shortest path. So, the proposed algorithm has a running time of $O(m^*n+m)$, where m, n and $m^*$ denote the number of arcs, number of node, and the number of essential arcs in a DAG, respectively.

• East Asian mathematical journal
• /
• v.27 no.5
• /
• pp.545-555
• /
• 2011

Based on the A-maximal(m)-relaxed monotonicity frameworks, the approximation solvability of a general class of variational inclusion problems using the relaxed proximal point algorithm is explored, while generalizing most of the investigations, especially of Xu (2002) on strong convergence of modified version of the relaxed proximal point algorithm, Eckstein and Bertsekas (1992) on weak convergence using the relaxed proximal point algorithm to the context of the Douglas-Rachford splitting method, and Rockafellar (1976) on weak as well as strong convergence results on proximal point algorithms in real Hilbert space settings. Furthermore, the main result has been applied to the context of the H-maximal monotonicity frameworks for solving a general class of variational inclusion problems. It seems the obtained results can be used to generalize the Yosida approximation that, in turn, can be applied to first- order evolution inclusions, and can also be applied to Douglas-Rachford splitting methods for finding the zero of the sum of two A-maximal (m)-relaxed monotone mappings.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1998.10b
• /
• pp.621-626
• /
• 1998

In this study, the analytic model of concrete column strengthened with CFS(carbon fiber sheets) for obtaining P-M interaction is presented. Firstly, an algorithm to evaluate accurate behavior of CFS is presented using laminate theory. Stress-strain model of CFS is presented based on the results of this algorithm. Secondly, an algorithm to evaluate stress-strain relationship of concrete column confined with CFS is presented. In order to evaluate the reliability of these algorithms, the results of analysis are compared with experimental data. Lastly, section analysis is performed by using constitutive equations of materials. As a result, P-M interaction curve of the column strengthened is obtained and the strengthening effects of CFs are analyzed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.11a
• /
• pp.357-358
• /
• 2007

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.10a
• /
• pp.193-194
• /
• 2012

• Journal of Energy Engineering
• /
• v.20 no.3
• /
• pp.216-223
• /
• 2011

This paper presents an effective energy saving algorithm for lighting control systems using M&V method in various buildings and factories. It is important to aggregate a various demand side resource which is controllable at the peak power time to reduce the energy cost. Previous demand side algorithm appropriate for building is based on peak power. In this paper, we develop the new energy saving algorithm using M&V method to reduce the quantity of power consumption. The simulation results show that the proposed method is very effective.