• The Journal of Information Technology and Database
• /
• v.8 no.2
• /
• pp.61-69
• /
• 2001

System Integration Projects, especially in public sector, have a tendency of growing in size and duration. Under such environment the effects of IT personnel turnover becomes a serious problem. In addition a high rate of turnover hinders shill accumulation and competitiveness obtainment. In this research we explored the reasons of turnover by way of tracing IT personnel who have involved in large-scale SI projects and moved or quit before the completion of the projects. Based on previous research we identified three dimensions of variables that affected turnover : task-related dimension, human relations dimension, treatment-related dimension. We used these dimensions as a guideline for the interview and questioning exploration. Implications from the research for improving IT Personnel management are also elaborated.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.279-285
• /
• 2004

In the disease association study, the tagSNP selection problem is important at the view of time and cost. We developed the new tagSNP selection system that has also facilities for the haplotype reconstruction and missing data processing. In our system, we improved biological meanings using LD coefficients as well as dynamic programming method. And our system has capability of processing large -scale dataset, such as the total SNPs on a chromosome. We have tested our system with various dataset from daly et al., patil et al., HapMap Project, artificial dataset, and so on.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.2
• /
• pp.117-127
• /
• 2000

In this paper, we propose a new convex combination weight rule for the cross decomposition method which is known to be one of the most reliable and promising strategies for the large scale optimization problems. It is called generalized cross decomposition, a modification of linear mean value cross decomposition for specially structured linear programming problems. This scheme puts more weights on the recent subproblem solutions other than the average. With this strategy, we are having more room for selecting convex combination weights depending on the problem structure and the convergence behavior, and then, we may choose a rule for either faster convergence for getting quick bounds or more accurate solution. Also, we can improve the slow end-tail behavior by using some combined rules. Also, we provide some computational test results that show the superiority of this strategy to the mean value cross decomposition in computational time and the quality of bounds.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.24 no.2
• /
• pp.161-197
• /
• 2020

Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.3
• /
• pp.77-83
• /
• 1985

This paper considers the problem of stabilizing a class of continuous-time large scale linear systems when the system parameters are uncertain. The proposed local adaptive controls are a combination of a new adaptive feedback control and the conventional linear feedback control. A condition of stability is derived , under which the overall closed-loop system is assured to be globally stable. Also, a numerical example is illustrated via computer simulation.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.367-377
• /
• 2012

The goal of the image restoration is to find a good approximation of the original image for the degraded image, the blurring matrix, and the statistics of the noise vector given. Fast truncated Lagrange (FTL) method has been proposed by G. Landi as a image restoration method for large-scale ill-conditioned BTTB linear systems([3]). We implemented FTL method for the image restoration problem with reflective boundary condition which gives better reconstructions of the unknown, the true image.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.2
• /
• pp.53-58
• /
• 2002

the popularity of uses for internet has been needed to information security. thereforce, intrusion, information leakage and modification, change or intentional efflux to computer system aspects of information security have been resulted in requirement of intrusion detection from outer at user authentication. this problem Presents design of PUM(Processing Unit Module) which analyze both the host log generated by sever host systems that various case for intellectualized intrusion method and network_packet on networks in large scale network.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.411-420
• /
• 1999

The computational model and a new eigenvalue solution algorithm for large-scale structures is presented in the form of parallel computation. The computational loads and data storages required during the solution process are drastically reduced by evenly distributing computational loads to each processor. As the parallel computational model, multiple personal computers are connected by 10Mbits per second Ethernet card. In this study substructuring techniques and static condensation method are adopted for modeling a large-scale structure. To reduce the size of an eigenvalue problem the interface degrees of freedom and one lateral degree of freedom are selected as the master degrees of freedom in each substructure. The performance of the proposed parallel algorithm is demonstrated by applying the algorithm to dynamic analysis of two-dimensional structures.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.463-465
• /
• 1998

In this paper, we consider the problem of robust stability of large-scale uncertain linear systems with time-varying delays. The considered uncertainties are both unstructured uncertainty which is only known its norm bound and structured uncertainty which is known its structure. Based on Lyapunov stability theorem and $H_{\infty}$ theory. we present uncertainty upper bound that guarantee the robust stability of systems. Especially, robustness bound are obtained directly without solving the Lyapunov equation. Finally, we show the usefulness of our results by numerical example.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2558-2561
• /
• 2008

In the present study, a parallel Taylor-Galerkin/level set based two-phase flow code was developed using finite element discretization and domain decomposition method based on MPI (Message Passing Interface). The proposed method can be utilized for the analysis of a large scale free surface problem in a complex geometry due to the feature of FEM and domain decomposition method. Four-step fractional step method was used for the solution of the incompressible Navier-Stokes equations and Taylor-Galerkin method was adopted for the discretization of hyperbolic type redistancing and advection equations. A Parallel ILU(0) type preconditioner was chosen to accelerate the convergence of a conjugate gradient type iterative solvers. From the present parallel numerical experiments, it has been shown that the proposed method is applicable to the simulation of large scale free surface flows.