• Computers and Concrete
• /
• v.6 no.6
• /
• pp.505-521
• /
• 2009

The analysis of prismatic members made of reinforced concrete under inclined bending, especially the computation of ultimate loads, is a pronounced non-linear problem which is frequently solved by discretizing the stress distribution in the cross-section using interpolation functions. In the approach described in the present contribution the exact analytical stress distribution is used instead. The obtained expressions are integrated by means of a symbolic manipulation package and automatically converted to optimized Fortran code. The direct problem-computation of ultimate internal forces given the position of the neutral axis-is first described. Subsequently, two kinds of inverse problem are treated: the computation of rupture envelops and the dimensioning of reinforcement, given design internal forces. An iterative Newton-Raphson procedure is used. Examples are presented.

• Korean Journal of Human Ecology
• /
• v.16 no.1
• /
• pp.27-37
• /
• 2007

The purposes of present study were to investigate relationships among wife abuse, social support, coping styles, and quality of life, and to examine how abused wives' social support influences coping and quality of life. The subjects were consisted of 144 abused wives in Gwangju, Korea. The major findings are as follows; 1. Problem-focused coping and seeking of social support were different by the wife abuse. 2. Abused wives' quality of life was positively related monthly income, social support, problem-focused coping, and wishful thinking coping. 3. The results of the hierarchical regression analysis indicated that the social support had the strongest impact on abused wives' quality of life. And the problem-focused coping, monthly income, and emotion-focused coping. These variables accounted for 32% of variance of abused wives' quality of life.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.09a
• /
• pp.220-229
• /
• 1995

Generally the Multiprocessor Scheduling(MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm(GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and CP/MISF(Critical Path/Most Immediate Successors First). A new genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with Ga to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• Journal of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1003-1021
• /
• 2015

A matrix completion problem has been exploited amply because of its abundant applications and the analysis of contractions enables us to have insight into structure and space of operators. In this article, we focus on a specific completion problem related to Hankel partial contractions. We provide concrete necessary and sufficient conditions for the existence of completion of Hankel partial contractions for both extremal and non-extremal types with lower dimensional matrices. Moreover, we give a negative answer for the conjecture presented in [8]. For our results, we use several tools such as the Nested Determinants Test (or Choleski's Algorithm), the Moore-Penrose inverse, the Schur product techniques, and a congruence of two positive semi-definite matrices; all these suggest an algorithmic approach to solve the contractive completion problem for general Hankel matrices of size $n{\times}n$ in both types.

• 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.

• Communications of the Korean Mathematical Society
• /
• v.17 no.2
• /
• pp.321-330
• /
• 2002

Consider the random assignment (or bipartite matching) problem with iid uniform edge costs t(i, j). Let $A_{n}$ be the optimal assignment cost. Just recently does Aldous [2] give a rigorous proof that E $A_{n}$ longrightarrowζ(2). In this paper we establish the upper and lower bounds for Var $A_{n}$ , i.e., there exist two strictly positive but finite constants $C_1$ and $C_2$ such athat $C_1$ $n^{(-5}$2)/ (log n)$^{(-3}$2)/ $\leq$ Var $A_{n}$ $\leq$ $C_2$ $n^{-1}$ (log n)$^2$.EX>.

• Journal of the Korean Institute of Educational Facilities
• /
• v.22 no.6
• /
• pp.3-11
• /
• 2015

Nowadays, the number of school students in rural area has decreased significantly. For this reason, there are mixed classes among students of different grades in schools in rural area. Moreover, there are several teachers who teach two and more subjects except for the major of teacher so educational environment has been deteriorated. To tackle this problem, the ministry of education has suggested merging small schools in rural area. However, some people believe that merging small schools would make educational environment more worse and would not solve this problem. To solve this problem, this research suggests that the proper solution for educational environment of merging small schools through surveying environment of merging schools.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.107-121
• /
• 1996

An optimization procedure is proposed to determine the optimal stacking sequence on the buckling of laminated composite plates with midplane symmetry under various loading conditions. Classical lamination theory is used for the determination of the critical buckling load of simply supported angle-ply laminates. Analysis is performed by the Galerkin method and Rayleigh-Ritz method. The approximate solution of buckling is replaced by the algorithms that produce generalized eigenvalue problem. Direct search technique is employed to solve the optimization problem effectively. A series of computations is carried out for plates having different aspect ratios, different load ratios and different number of lay-ups.