• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.231-244
• /
• 2007

In this paper, we use measure theory for considering asymptotically stable of an autonomous system [1] of first order nonlinear ordinary differential equations(ODE's). First, we define a nonlinear infinite-horizon optimal control problem related to the ODE. Then, by a suitable change of variable, we transform the problem to a finite-horizon nonlinear optimal control problem. Then, the problem is modified into one consisting of the minimization of a linear functional over a set of positive Radon measures. The optimal measure is approximated by a finite combination of atomic measures and the problem converted to a finite-dimensional linear programming problem. The solution to this linear programming problem is used to find a piecewise-constant control, and by using the approximated control signals, we obtain the approximate trajectories and the error functional related to it. Finally the approximated trajectories and error functional is used to for considering asymptotically stable of the original problem.

• 한국국방경영분석학회지
• /
• 제29권2호
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

• International Journal of Contents
• /
• 제8권2호
• /
• pp.23-27
• /
• 2012

The successful use of digital textbooks (DTs) in schools requires the development of various teaching and learning methods that are appropriate for DTs. However, recent DT studies have focused mainly on the implementation of DT features and formats. The objective of this study was to investigate a problem-based learning instructional model appropriate to DTs and to present the experimental results using the problem-based DT to demonstrate its educational effectiveness. Two learning-achievements tests were conducted to analyze the learning experience and effectiveness of the problem-based DT after it had been used in a high school for a certain period. The experimental results indicated that the students who used the DT, especially lower-level students, exhibited improved problem-solving ability and demonstrated a better practical understanding of the subject than students who used printed textbooks.

• 가정과삶의질연구
• /
• 제30권6호
• /
• pp.1-11
• /
• 2012

We investigated the effects of maternal parenting behavior and social supports on children's problem behaviors. The participants are 148 elementary school children and their teachers from one elementary school in Seoul. The data were analyzed by using descriptive statistics, correlation analysis, t-test, and multiple regression. The major findings are summarized as follows: (1) there were differences in maternal parenting behavior(warmth), teacher support, and internal problem behaviors according to children's gender; (2) mothers's parenting behavior(warmth) and teachers' support explained children's overt problem behaviors; and (3) mothers' parenting behaviors(supervision) and friends' support explained children's internal problem behaviors. In conclusion, there were differences between the subscale of maternal parenting behavior and social supports influencing overt problem behaviors and internal problem behaviors.

• 충청수학회지
• /
• 제26권4호
• /
• pp.723-734
• /
• 2013

A robust optimization problem, which has a maximum function of continuously differentiable functions as its objective function, continuously differentiable functions as its constraint functions and a geometric constraint, is considered. We prove a necessary optimality theorem and a sufficient optimality theorem for the robust optimization problem. We formulate a Wolfe type dual problem for the robust optimization problem, which has a differentiable Lagrangean function, and establish the weak duality theorem and the strong duality theorem which hold between the robust optimization problem and its Wolfe type dual problem. Moreover, saddle point theorems for the robust optimization problem are given under convexity assumptions.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.661-667
• /
• 1997

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제13권2호
• /
• pp.75-90
• /
• 2009

There are concepts in calculus which are difficult to teach and learn. One of these concepts is integration. However, problem posing has not yet received the attention it deserves from the mathematics education community. There is no systematic study that deals with teaching of calculus concepts by problem posing oriented teaching strategy. In this respect this study investigated the effect of problem posing on students' (prospective teachers') academic success when problem posing oriented approach is used to teach the integral concept in Calculus-II (Mathematics-II) course to first grade prospective teachers who are enrolled to the Primary Science Teaching Program of Education Faculty. The study used intervention-posttest experimental design. Quantitative research techniques were employed to gather, analyze and interpret the data. The sample comprised 79 elementary prospective science teachers. The results indicate that problem posing approach effects academic success in a positive way and at significant level.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.501-505
• /
• 1998

In this paper, an LP problem with convex polyhedral objective coefficients is treated. In the problem, the interactivities of the uncertain objective coefficients are represented by a bounded convex polyhedron (a convex polytope). We develop a computation algorithm of a maxmin achievement rate solution. To solve the problem, first, we introduce the relaxation procedure. In the algorithm, a sub-problem, a bilevel programing problem, should be solved. To solve the sub-problem, we develop a solution method based on a branch and bound method. As a result, it is shown that the problem can be solved by the repetitional use of the simplex method.

• 한국산업융합학회 논문집
• /
• 제20권5호
• /
• pp.385-393
• /
• 2017

The purpose of this study is explore stress, problem solving and emotional intelligence in nursing students. Participants were recruited from December 2016 to February 2017 by web base survey. The participants were 237 who nursing students in university. Stress, problem solving and emotional intelligence were assessed using two questionnaires; Korean version of the Perceived stress inventory (PSI), problem solving, and Wong and Law Emotional Intelligence Scale (WLEIS). The responses 237 students were analyzed statistically. Significantly emotional intelligence was a correlation stress and problem solving (p>.001). The findings showed that problem solving (${\beta}=.386$), stress (${\beta}=-.259$, empathy ability (${\beta}=.144$), and satisfaction with a major in nursing (${\beta}=.129$). Our finding show that stress levels of low and the problem solving levels of above moderate in emotional intelligence. Especially, the problem solving was important factor in emotional intelligence.