• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.918-919
• /
• 2012

This paper present a method of function decomposition and input variable manipulation method based on modular design techniques. We obtain the column multiplicity of decomposition function according to row decomposition method. Also, the proposed partial decomposition function have advantage which is able to omit control function using t-Gate. We find the advantage for internal connection decrement 12% and T-gate number 16%, therefore we find the simple design circuit.

• International Journal of Precision Engineering and Manufacturing
• /
• v.8 no.1
• /
• pp.3-10
• /
• 2007

A new approach based on implicit surface interpolation combined with domain decomposition is proposed for filling complex-shaped holes in a large polygon model, A surface was constructed by creating a smooth implicit surface from an incomplete polygon model through which the actual surface would pass. The implicit surface was defined by a radial basis function, which is a continuous scalar-value function over the domain $R^{3}$. The generated surface consisted of the set of all points at which this scalar function is zero. It was created by placing zero-valued constraints at the vertices of the polygon model. The well-known domain decomposition method was used to treat the large polygon model. The global domain of interest was divided into smaller domains in which the problem could be solved locally. The LU decomposition method was used to solve the set of small local problems; the local solutions were then combined using weighting coefficients to obtain a global solution. The validity of this new approach was demonstrated by using it to fill various holes in large and complex polygon models with arbitrary topologies.

• Honam Mathematical Journal
• /
• v.32 no.4
• /
• pp.581-592
• /
• 2010

With the help of some techniques based upon certain inverse pairs of symbolic operators initiated by Burchnall-Chaundy, the authors investigate decomposition formulas associated with Saran's function $F_E$ in three variables. Many operator identities involving these pairs of symbolic operators are first constructed for this purpose. By employing their decomposition formulas, we also present a new group of integral representations for the Saran function $F_E$.

• Journal of the Korean Society for Precision Engineering
• /
• v.23 no.1 s.178
• /
• pp.174-184
• /
• 2006

In order to fill the holes with complex shapes in the large polygon model, a new approach which is based on the implicit surface interpolation method combined with domain decomposition method is presented. In the present study, a surface is constructed by creating smooth implicit surface from the incomplete polygon model through which the surface should pass. In the method an implicit surface is defined by a radial basis function, a continuous scalar-valued function over the domain $R^3$ The generated surface is the set of all points at which this scalar function takes on the value zero and is created by placing zero-valued constraints at the vertices of the polygon model. In this paper the well-known domain decomposition method is used in order to treat the large polygon model. The global domain of interest is divided into smaller domains where the problem can be solved locally. LU decomposition method is used to solve a set of small local problems and their local solutions are combined together using the weighting coefficients to obtain a global solution. In order to show the validity of the present study, various hole fillings are carried out fur the large and complex polygon model of arbitrary topology.

• Journal of Korean Association for Spatial Structures
• /
• v.19 no.2
• /
• pp.101-108
• /
• 2019

In this paper, the characteristic of intrinsic mode function(IMF) and its orthogonalization of ensemble empirical mode decomposition(EEMD), which is often used in the analysis of the non-linear or non-stationary signal, has been studied. In the decomposition process, the orthogonal IMF of EEMD was obtained by applying the Gram-Schmidt(G-S) orthogonalization method, and was compared with the IMF of orthogonal EMD(OEMD). Two signals for comparison analysis are adopted as the analytical test function and El Centro seismic wave. These target signals were compared by calculating the index of orthogonality(IO) and the spectral energy of the IMF. As a result of the analysis, an IMF with a high IO was obtained by GSO method, and the orthogonal EEMD using white noise was decomposed into orthogonal IMF with energy closer to the original signal than conventional OEMD.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.759-772
• /
• 2012

In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.47 no.7
• /
• pp.535-540
• /
• 2019

The coupling between different models for MDO (Multi-disciplinary Optimization) greatly increases the complexity of the computational framework, while at the same time increasing CPU time and memory usage. To overcome these difficulties, POD (Proper Orthogonal Decomposition) and RBF (Radial Basis Function) are used to solve the optimization problem of determining the thickness of composites and sandwich cores when composite sandwich structures are used as aircraft wing skin materials. POD and RBF are used to construct surrogate models for the wing shape and the load data. Optimization is performed using the objective function and constraint function values which are obtained from the surrogate models.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.679-689
• /
• 2010

By developing and using certain operators like those initiated by Burchnall-Chaundy, the authors aim at investigating several decomposition formulas associated with the $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ function $F_{2:0;0}^{0:3;3}$ [x, y]. For this purpose, many operator identities involving inverse pairs of symbolic operators are constructed. By employing their decomposition formulas, they also present a new group of integral representations of Eulerian type for the $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ function $F_{2:0;0}^{0:3;3}$ [x, y], some of which include several hypergeometric functions such as $_2F_1$, $_3F_2$, an Appell function $F_3$, and the $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ functions $F_{2:0;0}^{0:3;3}$ and $F_{1:0;1}^{0:2;3}$.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3E
• /
• pp.37-43
• /
• 1999

In this paper, we present a new technique for the optimal local decomposition of convex structuring elements on a hexagonal grid, which are used as templates for morphological image processing. Each basis structuring element in a local decomposition is a local convex structuring element, which can be contained in hexagonal window centered at the origin. Generally, local decomposition of a structuring element results in great savings in the processing time for computing morphological operations. First, we define a convex structuring element on a hexagonal grid and formulate the necessary and sufficient conditions to decompose a convex structuring element into the set of basis convex structuring elements. Further, a cost function was defined to represent the amount of computation or execution time required for performing dilations on different computing environments and by different implementation methods. Then the decomposition condition and the cost function are applied to find the optimal local decomposition of convex structuring elements, which guarantees the minimal amount of computation for morphological operation. Simulation shows that optimal local decomposition results in great reduction in the amount of computation for morphological operations. Our technique is general and flexible since different cost functions could be used to achieve optimal local decomposition for different computing environments and implementation methods.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.9
• /
• pp.1167-1174
• /
• 1999

In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.