• 제목/요약/키워드: Finding Problems

검색결과 1,197건 처리시간 0.028초

대수 문장제를 해결하고 일반화하는 과정에서 드러난 두 중학생의 공변 추론 수준 비교 (Comparison of the Covariational Reasoning Levels of Two Middle School Students Revealed in the Process of Solving and Generalizing Algebra Word Problems)

  • 마민영
    • 한국수학교육학회지시리즈E:수학교육논문집
    • /
    • 제37권4호
    • /
    • pp.569-590
    • /
    • 2023
  • 본 사례 연구의 목적은 대수 문장제를 해결하고 일반화하는 과정에서 드러난 두 중학생의 공변 추론 수준을 비교하여 분석하는 것이다. 학교 수학에서 이차방정식을 학습하지 않은 중학생 2명을 대상으로 수업을 진행하였고, 수업이 모두 끝난 뒤 회고 분석 과정에서 속도가 일정하게 변하는 상황을 포함한 대수 문장제의 해결에서 두 학생 간의 차이가 두드러지게 드러났다. 이에 본 연구는 속도의 일정함을 가정하거나 속도가 일정하게 변하는 상황을 포함한 대수 문장제를 해결하거나 일반화하는 과정에서 학생들 스스로 구성한 두 변수에 대해 그들 사이의 변화 관계에 대한 이해 수준을 Thompson과 Carlson(2017)이 제안한 공변 추론 수준에 비추어 비교·분석하였다. 그 결과, 본 연구에서는 대수 문장제의 문제 해결 방식과 그 결과가 표면적으로 유사해 보이더라도 두 학생 간의 공변 추론 수준이 서로 다를 수 있음을 확인하였고, 대수 문장제를 해결하고 일반화하는 과정에서 드러난 유사성을 공변 관점에서 제시하였다. 이를 통해 본 연구는 대수 문장제의 교수·학습에서 문제 상황을 빠르게 식으로 변환하여 해를 찾는 데 주목하기보다 학생 스스로 변화하는 두 양을 찾고 그들 사이의 불변하는 관계를 다양한 방식으로 나타내는 활동이 충분히 다루어질 필요가 있음을 제안한다.

클러스터 수가 주어지지 않는 클러스터링 문제를 위한 공생 진화알고리즘 (A symbiotic evolutionary algorithm for the clustering problems with an unknown number of clusters)

  • 신경석;김재윤
    • 품질경영학회지
    • /
    • 제39권1호
    • /
    • pp.98-108
    • /
    • 2011
  • Clustering is an useful method to classify objects into subsets that have some meaning in the context of a particular problem and has been applied in variety of fields, customer relationship management, data mining, pattern recognition, and biotechnology etc. This paper addresses the unknown K clustering problems and presents a new approach based on a coevolutionary algorithm to solve it. Coevolutionary algorithms are known as very efficient tools to solve the integrated optimization problems with high degree of complexity compared to classical ones. The problem considered in this paper can be divided into two sub-problems; finding the number of clusters and classifying the data into these clusters. To apply to coevolutionary algorithm, the framework of algorithm and genetic elements suitable for the sub-problems are proposed. Also, a neighborhood-based evolutionary strategy is employed to maintain the population diversity. To analyze the proposed algorithm, the experiments are performed with various test-bed problems which are grouped into several classes. The experimental results confirm the effectiveness of the proposed algorithm.

경기 대침체 이후 가계의 부채상환 문제 (Effects of the Great Recession on Debt Repayment Problems of Hispanic Households in the United States)

  • 이종희
    • Human Ecology Research
    • /
    • 제55권3호
    • /
    • pp.275-287
    • /
    • 2017
  • The recent Great Recession of 2008 was a period of sharp economic decline throughout the late 2000s. All socio-demographic groups were impacted by the economic downturn, however, Hispanic households were particularly hard hit. It is not a recent phenomenon that minority groups often have greater problems related to credit and debt repayments. A better understanding of these racial/ethnic differences in credit and debt has been hindered by the propensity of many studies to pool all racial/ethnic minorities together and compare them to white households. Using a Heckman-type selection model with a combination of the 2010 and 2013 Survey of Consumer Finances datasets to study household debt repayment problems, we found that racial/ethnic groups have been differently impacted by the recent Great Recession in terms of debt repayment problems. Hispanic households were less likely to hold debt; however, those with debt were just as likely as white households and African American households to be delinquent in repayments. This finding is contrary to prior research that indicated Hispanics with debt were less likely than white and African American households to be delinquent on repayments prior to the Great Recession of 2008. We propose possible explanations for the increase in debt repayment problems, that includes increased assimilation into the U.S. culture of credit use, the circumstance of being more recent home buyers prior to the decline, and living in states that suffered the greatest decline in housing value.

초등학생 군인 자녀의 문제행동 관련요인 (Factors associated with Behavior Problems of Military Children in Elementary School)

  • 김경미;이가언
    • 한국학교보건학회지
    • /
    • 제26권3호
    • /
    • pp.184-194
    • /
    • 2013
  • Purpose: The purpose of this study was to investigate predictors of behavior problems of military children in elementary school. Methods: Participants were 195 military children who were attending D-elementary school in C-city. Data were collected from July 8 to July 10, 2013, using self-report questionnaires which included Han's Externalized Behavior Problems Scale, Lee's Parent's Rearing Attitude Scale, and Hong's Friend/Teacher Support Appraisal Scale. Data analysis was performed using the SPSS/WIN 18.0 program, which included the t-test, the one-way ANOVA, Pearson correlation coefficients, and the multiple liner regression analysis. Results: The mean score of the subjects' behavior problem was 1.47/5.0 points. The degree of the score is similar to or slightly lower than that of ordinary children. There were statistically significant differences in behavior problems according to gender, grade, birth order and economic status. Behavior problems have a negative correlation with parent's rearing attitude, parent-child relationship, teacher's support, and friend's support. Influencing factors of behavior problems were teacher's support, father-child relationship, and mother's rearing attitude, which explained 20.6% of the variance. Conclusion: The finding of this study suggests there is a need to increase teacher's support for elementary students and to educate parents to improve their parenting skills by developing proper school health programs.

  • PDF

A METHOD USING PARAMETRIC APPROACH WITH QUASINEWTON METHOD FOR CONSTRAINED OPTIMIZATION

  • Ryang, Yong-Joon;Kim, Won-Serk
    • 대한수학회보
    • /
    • 제26권2호
    • /
    • pp.127-134
    • /
    • 1989
  • This paper proposes a deformation method for solving practical nonlinear programming problems. Utilizing the nonlinear parametric programming technique with Quasi-Newton method [6,7], the method solves the problem by imbedding it into a suitable one-parameter family of problems. The approach discussed in this paper was originally developed with the aim of solving a system of structural optimization problems with frequently appears in various kind of engineering design. It is assumed that we have to solve more than one structural problem of the same type. It an optimal solution of one of these problems is available, then the optimal solutions of thel other problems can be easily obtained by using this known problem and its optimal solution as the initial problem of our parametric method. The method of nonlinear programming does not generally converge to the optimal solution from an arbitrary starting point if the initial estimate is not sufficiently close to the solution. On the other hand, the deformation method described in this paper is advantageous in that it is likely to obtain the optimal solution every if the initial point is not necessarily in a small neighborhood of the solution. the Jacobian matrix of the iteration formula has the special structural features [2, 3]. Sectioon 2 describes nonlinear parametric programming problem imbeded into a one-parameter family of problems. In Section 3 the iteration formulas for one-parameter are developed. Section 4 discusses parametric approach for Quasi-Newton method and gives algorithm for finding the optimal solution.

  • PDF

조합최적화문제로 접근한 경제급전 알고리즘 개발 (Economic Dispatch Algorithm as Combinatorial Optimization Problems)

  • 민경일;이수원;최인규;문영현
    • 전기학회논문지
    • /
    • 제58권8호
    • /
    • pp.1485-1495
    • /
    • 2009
  • This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the ${\lambda}-P$ function method is used to calculate ED for the fitness function of GA. The ${\lambda}-P$ function method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with two kinds of ED problems, namely ED with multiple fuel units (EDMF) and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all the ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.

묵사집산법(?思集算法)에 수록된 퇴타개적문(堆?開積門)의 현대적 재구성 및 수학교육적 활용 방안 (A Modern Reconstruction of the Problems on the Sums of Sequences in MukSaJipSanBup and its Pedagogical Applications)

  • 양성현
    • 한국수학사학회지
    • /
    • 제33권1호
    • /
    • pp.1-19
    • /
    • 2020
  • Under 2009 Revised Mathematics Curriculum and 2015 Revised Mathematics Curriculum, mathematics teachers can help students inductively express real life problems related to sequences but have difficulties in dealing with problems asking the general terms of the sequences defined inductively due to 'Guidelines for Teaching and Learning'. Because most of textbooks mainly deal with the simple calculation for the sums of sequences, students tend to follow them rather than developing their inductive and deductive reasoning through finding patterns in the sequences. In this study, we reconstruct 8 problems to find the sums of sequences in MukSaJipSanBup which is known as one of the oldest mathematics book of Chosun Dynasty, using the terminology and symbols of the current curriculum. Such kind of problems can be given in textbooks and used for teaching and learning. Using problems in mathematical books of Chosun Dynasty with suitable modifications for teaching and learning is a good method which not only help students feel the usefulness of mathematics but also learn the cultural value of our traditional mathematics and have the pride for it.

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • 제11권4호
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

스트링의 최대 서픽스를 계산하는 효율적인 외부 메모리 알고리즘 (Efficient External Memory Algorithm for Finding the Maximum Suffix of a String)

  • 김성권;김수철;조정식
    • 정보처리학회논문지A
    • /
    • 제15A권4호
    • /
    • pp.239-242
    • /
    • 2008
  • 외부 메모리 계산 모델에서 스트링의 최대서픽스를 찾는 문제를 고려한다. 외부메모리 모델에서는 디스크와 내부메모리 사이의 디스크 입출력 횟수를 줄이는 알고리즘을 설계하는 것이 중요 사항이다. 길이가 N인 스트링은 N개의 서픽스를 가지는데, 이중에서 사전 순서에 따라 가장 큰 것을 최대 서픽스라 부른다. 최대서픽스를 구하는 것은 여러 스트링 문제를 해결하는 데 중요한 역할을 한다. 본 논문에서는 길이가 N인 스트링의 최대 서픽스를 구하는 외부메모리 알고리즘을 제시한다. 이 알고리즘은 네 개의 내부 메모리 블록을 사용하고 최대 4(N/L)번의 디스크 입출력을 한다. 여기서 L은 블록의 크기이다.

타부 탐색에 근거한 집락문제의 발견적 해법 (Tabu Search Heuristics for Solving a Class of Clustering Problems)

  • 정주성;염봉진
    • 대한산업공학회지
    • /
    • 제23권3호
    • /
    • pp.451-467
    • /
    • 1997
  • Tabu search (TS) is a useful strategy that has been successfully applied to a number of complex combinatorial optimization problems. By guiding the search using flexible memory processes and accepting disimproved solutions at some iterations, TS helps alleviate the risk of being trapped at a local optimum. In this article, we propose TS-based heuristics for solving a class of clustering problems, and compare the relative performances of the TS-based heuristic and the simulated annealing (SA) algorithm. Computational experiments show that the TS-based heuristic with a long-term memory offers a higher possibility of finding a better solution, while the TS-based heuristic without a long-term memory performs better than the others in terms of the combined measure of solution quality and computing effort required.

  • PDF