• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.2218-2223
• /
• 2014

A crack which is axially oriented with small size is hard to detect in conventional system. CMFL(Circumferential Magnetic Flux Leakage) type PIG(Pipelines Inspection Gauge) in the NDT(Nondestructive Testing), is operated to detect this defect called axially oriented cracks in the pipe. It is necessary to decompose the size and shapes of cracks for the maintenance of underground pipelines. This article is mainly focused on the decomposing method of the size and shape of the axially oriented cracks by using inspection signal data for defect.

• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• Structural Engineering and Mechanics
• /
• v.61 no.2
• /
• pp.275-282
• /
• 2017

The Fleck-Hutchinson theory on strain gradient plasticity (SGP), proposed in Adv. Appl Mech 33 (1997) 295, has recently been reformulated by adopting the strategy of decomposing the second order strain presented by Lam et al. in J Mech Pays Solids 51 (2003) 1477. The newly built SGP satisfies the non negativity of plastic dissipation, which is still an outstanding issue in other SGP theories. Furthermore, it explicitly shows how elastic strain gradients and corresponding elastic characteristic length scales come into play in general elastic-plastic loading histories. In this study, the relation between elastic length scales and plastic length scales is investigated by taking wire torsion as an example. It is concluded that the size effects arising when two sets of length scales are of the same order are essentially elastic instead of plastic.

• International Journal of Contents
• /
• v.12 no.3
• /
• pp.22-28
• /
• 2016

Tensor with missing or incomplete values is a ubiquitous problem in various fields such as biomedical signal processing, image processing, and social network analysis. In this paper, we considered how to reconstruct a dataset with missing values by using tensor form which is called tensor completion process. We applied Tucker factorization to solve tensor completion which was built base on optimization problem. We formulated the optimization objective function using components of Tucker model after decomposing. The weighted least square matric contained only known values of the tensor with low rank in its modes. A first order optimization method, namely Nonlinear Conjugated Gradient, was applied to solve the optimization problem. We demonstrated the effectiveness of the proposed method in EEG signals with about 70% missing entries compared to other algorithms. The relative error was proposed to compare the difference between original tensor and the process output.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1463-1466
• /
• 1987

The problem of generating minimal area CMOS functional cell layout can be converted to that of decomposing the transistor connection graph into a minimum number of subgraphs, each having a pair of Euler paths with the same sequence of input labels on the N-graph and P-graph, which are portions of the graph corresponding to NMOS and PMOS parts respectively. This paper proposes a heuristic algorithm which yields a nearly minimal number of Euler paths from the path representation formula which represents the give a logic function. Subpath merging is done through a list processing scheme where the pair of paths which results in the lowest cost is successively merged from all candidate merge pairs until no further path merging and further reduction of number of subgraphs are possible. Two examples were shown where we were able to further reduce the number of interlaces, i.e., the number of non-butting diffusion islands, from 3 to 2, and from 2 to 1, compared to the earlier work [1].

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.425-434
• /
• 2011

The success of iris recognition depends mainly on two factors: image acquisition and an iris recognition algorithm. In this study, we present a system that considers both factors and focuses on the latter. The proposed algorithm aims to find out the most efficient wavelet family and its coefficients for encoding the iris template of the experiment samples. The algorithm implemented in software performs segmentation, normalization, feature encoding, data storage, and matching. By using the Haar and Biorthogonal wavelet families at various levels feature encoding is performed by decomposing the normalized iris image. The vertical coefficient is encoded into the iris template and is stored in the database. The performance of the system is evaluated by using the number of degrees of freedom, False Reject Rate (FRR), False Accept Rate (FAR), and Equal Error Rate (EER) and the metrics show that the proposed algorithm can be employed for an iris recognition system.

• Structural Engineering and Mechanics
• /
• v.52 no.1
• /
• pp.205-220
• /
• 2014

This paper is concerned with the modification of multidisciplinary feasible formulation for MDO problems using the integrated coupled approximate models. A drawback of conventional MDFs is the numerical difficulty in decomposing the design variables and deriving the coupled equations of state. To overcome such a drawback of conventional methods, the coupling in analysis and design is resolved by approximating the state variables in each discipline by the response surface method and by modifying the optimization formulation using the corresponding integrated coupled approximate models. The validity, reliability and effectiveness of the proposed method are illustrated and verified through two optimization problems, a mathematical MDF problem and the multidisciplinary optimum design of suspension unit of wheeled armored vehicle.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.172-182
• /
• 2006

This paper presents a method to convert 3D CAD model to an appropriate analysis model using wrap-around, smooth-out and thinning operators that have been originally developed to realize the multi-resolution modeling. Wrap-around and smooth-out operators are used to simplify 3D model, and thinning operator is to reduce the dimension of a target object with simultaneously decomposing the simplified 3D model to 1D or 2D shapes. By using the simplification and dimension-reduction operations in an appropriate way, the user can generate an analysis model that matches specific applications. The advantage of this method is that the user can create optimized analysis models of various simplification levels by selecting appropriate number of detailed features and removing them.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.105-114
• /
• 1997

The phase retrieval problem is concerned with the reconstruction of a signal or its fourier transform phase form the fourier transform magnitude of the signal. This problem does not have a unique solution, in general. If, however, the desired signal is minimum-phase, then it can be decided uniquely. This paper shows that we can make a minimum-phase signal by adding a delta function having a large value at the origin of an arbitrary one-dimensional signal, and a two-dimensional signal can be uniquely specified from its fourier transform magnitude if it is added by a delta function having a large value at the origin, and finally we can solve a two-dimensional phase retrieval problem by decomposing it into several ine-dimensional phase retrieval problems.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.215-219
• /
• 2015

Cells in a culture process transform with time and produce many overlapping cells in their vicinity. We are interested in a separation algorithm for images of overlapping cells taken using a fluorescence optical microscope system during a cell culture process. In this study, all cells are assumed to have an ellipse-like shape. For an ellipse fitting-based method, an improved least squares method is used by decomposing the design matrix into quadratic and linear parts for the separation of overlapping cells. Through various experiments, the improved least squares method (numerically stable direct least squares fitting [NSDLSF]) is compared with the conventional least squares method (direct least squares fitting [DLSF]). The results reveal that NSDLSF has a successful separation ratio with an average accuracy of 95% for two overlapping cells, an average accuracy of 91% for three overlapping cells, and about 82% accuracy for four overlapping cells.