• Korean Journal of Computational Design and Engineering
• /
• v.16 no.3
• /
• pp.178-186
• /
• 2011

Static CAD models are the CAD models that do not have feature information and modeling history. These static models are generated by translating CAD models in a specific CAD system into neutral formats such as STEP and IGES. When a CAD model is translated into a neutral format, its precious feature information such as feature parameters and modeling history is lost. Once the feature information is lost, the advantage of feature based modeling is not valid any longer, and modification for the model is purely dependent on geometric and topological manipulations. However, the capabilities of the existing methods to modify static CAD models are limited, Direct modification methods such as tweaking can only handle the modifications that do not involve topological changes. There was also an approach to modify static CAD model by using volume decomposition. However, this approach was also limited to modifications of protrusion features. To address this problem, we extend the volume decomposition approach to handle not only protrusion features but also depression features in a static CAD model. This method first generates the model that contains the volume of depression feature using the bounding box of a static CAD model. The difference between the model and the bounding box is selectively decomposed into so called the feature volume and the base volume. A modification of depression feature is achieved by manipulating the feature volume of the static CAD model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6043-6062
• /
• 2019

Low-rank matrix decomposition has shown its capability in many applications such as image in-painting, de-noising, background reconstruction and defect detection etc. In this paper, we consider the texture background of rail track images and the sparse foreground of the defects to construct a low-rank matrix decomposition model with block sparsity for defect inspection of rail tracks, which jointly minimizes the nuclear norm and the 2-1 norm. Similar to ADM, an alternative method is proposed in this study to solve the optimization problem. After image decomposition, the defect areas in the resulting low-rank image will form dark stripes that horizontally cross the entire image, indicating the preciselocations of the defects. Finally, a two-stage defect extraction method is proposed to locate the defect areas. The experimental results of the two datasets show that our algorithm achieved better performance compared with other methods.

• 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 Broadcast Engineering
• /
• v.19 no.1
• /
• pp.64-74
• /
• 2014

The primary and ambient signal decomposition of a stereo sound is a key step to the stereo upmix. The principal component analysis (PCA) is one of the most widely used methods of primary-ambient signal decomposition. However, previous PCA-based decomposition algorithms assume that stereo sound sources are only amplitude-panned without any consideration of phase difference. So it occurs some performance degradation in case of live recorded stereo sound. In this paper, we propose a new PCA-based stereo decomposition algorithm that can consider the phase difference between the channel signals. The proposed algorithm overcomes limitation of conventional signal model using PCA with phase alignment. The phase alignment is realized by using inter-channel phase difference (IPD) which is widely used in parametric stereo coding. Moreover, Enhanced Modified PCA(EMPCA) is combined to solve the problem of conventional PCA caused by Primary to Ambient energy Ratio(PAR) and panning angle dependency. The simulation results are presented to show the improvements of the proposed algorithm.

• The Korean Journal of Applied Statistics
• /
• v.28 no.2
• /
• pp.159-174
• /
• 2015

Dragomiretskiy and Zosso (2014) developed a new decomposition method, termed variational mode decomposition (VMD), which is efficient for handling the tone detection and separation of signals. However, VMD may be inefficient in the presence of missing data since it is based on a fast Fourier transform (FFT) algorithm. To overcome this problem, we propose a new approach based on a novel combination of VMD and hierarchical (or h)-likelihood method. The h-likelihood provides an effective imputation methodology for missing data when VMD decomposes the signal into several meaningful modes. A simulation study and real data analysis demonstrates that the proposed method can produce substantially effective results.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.33-47
• /
• 1998

The facility location problem considered here is to determine facility location sites under future's uncertain demand. The objective of this paper is to propose a solution method and algorithm for a two-stage stochastic facility location problem. utilizing the Benders decomposition method. As a two-stage stochastic facility location problem is a large-scale and complex to solve, it is usually attempted to use a mean value problem rather than using a stochastic problem. Thus, the other objective is to study the relative error of objective function values between a stochastic problem and a mean value problem. The simulation result shows that the relative error of objective function values between two problems is relatively small, when a feasibility constraint is added to a facility location model.

• Journal of Korean Society of Steel Construction
• /
• v.16 no.1 s.68
• /
• pp.123-134
• /
• 2004

In this research, a multilevel decomposition technique to enhance the efficiency of the configuration optimization of truss structures was proposed. On the first level, the nonlinear programming problem was formulated considering cross-sectional areas as design variables, weight, or volume as objective function and behavior under multiloading condition as design constraint. Said nonlinear programming problem was transformed into a sequential linear programming problem. which was effective in calculation through the approximation of member forces using behavior space approach. Such approach has proven to be efficient in sensitivity analysis and different form existing shape optimization studies. The modified method of feasible direction (MMFD) was used for the optimization process. On the second level, by treating only shape design variables, the optimum problem was transformed into and unconstrained optimal design problem. A unidirectional search technique was used. As numerical examples, some truss structures were applied to illustrate the applicability. and validity of the formulated algorithm.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.2
• /
• pp.74-79
• /
• 2012

An efficient separation heuristic for the rank-1 Chvatal-Gomory cuts for the binary knapsack problem is proposed. The proposed heuristic is based on the decomposition property of the separation problem for the fixedcharge 0-1 knapsack problem characterized by Park and Lee [14]. Computational tests on the benchmark instances of the generalized assignment problem show that the proposed heuristic procedure can generate strong rank-1 C-G cuts more efficiently than the exact rank-1 C-G cut separation and the exact knapsack facet generation.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.117-129
• /
• 1999

We consider a Location-Allocation Problem with the Cost of Land(LAPCL). LAPCL has extremely huge size of problem and complex characteristic of location and allocation problem. Heuristics and decomposition approaches on simple Location-Allocation Problem were well developed in last three decades. Currently, genetic algorithm(GA) is used widely at combinatorics and NLP fields. A lot of research show that GA has efficiency for finding good solution. Our main motive of this research is developing of a GA in LAPCL. We found that LAPCL could be reduced to trivial problem, if locations were given. In this case, we can calculate fitness function by simple technique. We propose fourth alternative genetic algorithm. Computational experiments are carried out to find a best algorithm.